29#ifndef _GLIBCXX_GENERATOR
30#define _GLIBCXX_GENERATOR
34#pragma GCC system_header
39#define __glibcxx_want_generator
42#ifdef __cpp_lib_generator
46#include <bits/elements_of.h>
47#include <bits/uses_allocator.h>
62namespace std _GLIBCXX_VISIBILITY(default)
64_GLIBCXX_BEGIN_NAMESPACE_VERSION
81 template<
typename _Ref,
typename _Val =
void,
typename _Alloc =
void>
89 template<
typename _Ref,
typename _Val>
90 using _Reference_t = __conditional_t<is_void_v<_Val>,
94 template<
typename _Reference>
95 using _Yield_t = __conditional_t<is_reference_v<_Reference>,
100 template<
typename _Ref,
typename _Val>
101 using _Yield2_t = _Yield_t<_Reference_t<_Ref, _Val>>;
103 template<
typename>
constexpr bool __is_generator =
false;
104 template<
typename _Val,
typename _Ref,
typename _Alloc>
105 constexpr bool __is_generator<std::generator<_Val, _Ref, _Alloc>> =
true;
109 template<
typename _Yielded>
110 class _Promise_erased
112 static_assert(is_reference_v<_Yielded>);
113 using _Yielded_deref = remove_reference_t<_Yielded>;
114 using _Yielded_decvref = remove_cvref_t<_Yielded>;
115 using _ValuePtr = add_pointer_t<_Yielded>;
116 using _Coro_handle = std::coroutine_handle<_Promise_erased>;
118 template<
typename,
typename,
typename>
119 friend class std::generator;
121 template<
typename _Gen>
122 struct _Recursive_awaiter;
124 friend struct _Recursive_awaiter;
125 struct _Copy_awaiter;
126 struct _Subyield_state;
127 struct _Final_awaiter;
130 initial_suspend() const noexcept
134 yield_value(_Yielded __val)
noexcept
141 yield_value(
const _Yielded_deref& __val)
142 noexcept (is_nothrow_constructible_v<_Yielded_decvref,
143 const _Yielded_deref&>)
144 requires (is_rvalue_reference_v<_Yielded>
145 && constructible_from<_Yielded_decvref,
146 const _Yielded_deref&>)
147 {
return _Copy_awaiter(__val, _M_bottom_value()); }
149 template<
typename _R2,
typename _V2,
typename _A2,
typename _U2>
150 requires std::same_as<_Yield2_t<_R2, _V2>, _Yielded>
152 yield_value(ranges::elements_of<generator<_R2, _V2, _A2>&&, _U2> __r)
154 {
return _Recursive_awaiter {
std::move(__r.range) }; }
156 template<ranges::input_range _R,
typename _Alloc>
157 requires convertible_to<ranges::range_reference_t<_R>, _Yielded>
159 yield_value(ranges::elements_of<_R, _Alloc> __r)
161 auto __n = [] (allocator_arg_t, _Alloc,
162 ranges::iterator_t<_R> __i,
163 ranges::sentinel_t<_R> __s)
164 -> generator<_Yielded, ranges::range_value_t<_R>, _Alloc> {
165 for (; __i != __s; ++__i)
166 co_yield static_cast<_Yielded
>(*__i);
168 return yield_value(ranges::elements_of(__n(allocator_arg,
170 ranges::begin(__r.range),
171 ranges::end(__r.range))));
176 final_suspend() noexcept
180 unhandled_exception()
187 if (_M_nest._M_is_bottom())
193 void await_transform() =
delete;
194 void return_void() const noexcept {}
198 _M_bottom_value() noexcept
199 {
return _M_nest._M_bottom_value(*
this); }
203 {
return _M_nest._M_value(*
this); }
205 _Subyield_state _M_nest;
209 template<
typename _Yielded>
210 struct _Promise_erased<_Yielded>::_Subyield_state
214 _Coro_handle _M_bottom;
215 _Coro_handle _M_parent;
221 _ValuePtr _M_value =
nullptr;
230 _M_is_bottom() const noexcept
231 {
return !std::holds_alternative<_Frame>(this->_M_stack); }
236 if (
auto __f = std::get_if<_Frame>(&this->_M_stack))
237 return __f->_M_bottom.promise()._M_nest._M_top();
239 auto __bf = std::get_if<_Bottom_frame>(&this->_M_stack);
240 __glibcxx_assert(__bf);
245 _M_push(_Coro_handle __current, _Coro_handle __subyield)
noexcept
247 __glibcxx_assert(&__current.promise()._M_nest ==
this);
248 __glibcxx_assert(this->_M_top() == __current);
250 __subyield.promise()._M_nest._M_jump_in(__current, __subyield);
253 std::coroutine_handle<>
256 if (
auto __f = std::get_if<_Frame>(&this->_M_stack))
260 auto __p = this->_M_top() = __f->_M_parent;
265 return std::noop_coroutine();
269 _M_jump_in(_Coro_handle __rest, _Coro_handle __new)
noexcept
271 __glibcxx_assert(&__new.promise()._M_nest ==
this);
272 __glibcxx_assert(this->_M_is_bottom());
277 __glibcxx_assert(!this->_M_top());
279 auto& __rn = __rest.promise()._M_nest;
280 __rn._M_top() = __new;
283 auto __bott = __rest;
284 if (
auto __f = std::get_if<_Frame>(&__rn._M_stack))
288 __bott = __f->_M_bottom;
290 this->_M_stack = _Frame {
297 _M_bottom_value(_Promise_erased& __current)
noexcept
299 __glibcxx_assert(&__current._M_nest ==
this);
300 if (
auto __bf = std::get_if<_Bottom_frame>(&this->_M_stack))
301 return __bf->_M_value;
302 auto __f = std::get_if<_Frame>(&this->_M_stack);
303 __glibcxx_assert(__f);
304 auto& __p = __f->_M_bottom.promise();
305 return __p._M_nest._M_value(__p);
309 _M_value(_Promise_erased& __current)
noexcept
311 __glibcxx_assert(&__current._M_nest ==
this);
312 auto __bf = std::get_if<_Bottom_frame>(&this->_M_stack);
313 __glibcxx_assert(__bf);
314 return __bf->_M_value;
318 template<
typename _Yielded>
319 struct _Promise_erased<_Yielded>::_Final_awaiter
321 bool await_ready() noexcept
324 template<
typename _Promise>
325 auto await_suspend(std::coroutine_handle<_Promise> __c)
noexcept
327#ifdef __glibcxx_is_pointer_interconvertible
329 _Promise_erased, _Promise>);
332 auto& __n = __c.promise()._M_nest;
336 void await_resume() noexcept {}
339 template<
typename _Yielded>
340 struct _Promise_erased<_Yielded>::_Copy_awaiter
342 _Yielded_decvref _M_value;
343 _ValuePtr& _M_bottom_value;
345 constexpr bool await_ready() noexcept
348 template<
typename _Promise>
349 void await_suspend(std::coroutine_handle<_Promise>)
noexcept
351#ifdef __glibcxx_is_pointer_interconvertible
353 _Promise_erased, _Promise>);
359 await_resume() const noexcept
363 template<
typename _Yielded>
364 template<
typename _Gen>
365 struct _Promise_erased<_Yielded>::_Recursive_awaiter
368 static_assert(__is_generator<_Gen>);
369 static_assert(std::same_as<typename _Gen::yielded, _Yielded>);
371 _Recursive_awaiter(_Gen __gen) noexcept
373 { this->_M_gen._M_mark_as_started(); }
376 await_ready() const noexcept
380 template<
typename _Promise>
381 std::coroutine_handle<>
382 await_suspend(std::coroutine_handle<_Promise> __p)
noexcept
384#ifdef __glibcxx_is_pointer_interconvertible
386 _Promise_erased, _Promise>);
389 auto __c = _Coro_handle::from_address(__p.address());
390 auto __t = _Coro_handle::from_address(this->_M_gen._M_coro.address());
391 __p.promise()._M_nest._M_push(__c, __t);
397 if (
auto __e = _M_gen._M_coro.promise()._M_except)
404 alignas(__STDCPP_DEFAULT_NEW_ALIGNMENT__)
405 char _M_data[__STDCPP_DEFAULT_NEW_ALIGNMENT__];
408 _M_cnt(std::size_t __sz)
noexcept
410 auto __blksz =
sizeof(_Alloc_block);
411 return (__sz + __blksz - 1) / __blksz;
415 template<
typename _All>
416 concept _Stateless_alloc = (allocator_traits<_All>::is_always_equal::value
417 && default_initializable<_All>);
419 template<
typename _Alloc>
422 using _ATr = allocator_traits<_Alloc>;
423 using _Rebound =
typename _ATr::template rebind_alloc<_Alloc_block>;
424 using _Rebound_ATr =
typename _ATr
425 ::template rebind_traits<_Alloc_block>;
426 static_assert(is_pointer_v<typename _Rebound_ATr::pointer>,
427 "Must use allocators for true pointers with generators");
430 _M_alloc_address(std::uintptr_t __fn, std::uintptr_t __fsz)
noexcept
432 auto __an = __fn + __fsz;
433 auto __ba =
alignof(_Rebound);
434 return reinterpret_cast<_Rebound*
>(((__an + __ba - 1) / __ba) * __ba);
438 _M_alloc_size(std::size_t __csz)
noexcept
440 auto __ba =
alignof(_Rebound);
445 return __csz + __ba +
sizeof(_Rebound);
449 _M_allocate(_Rebound __b, std::size_t __csz)
451 if constexpr (_Stateless_alloc<_Rebound>)
453 return __b.allocate(_Alloc_block::_M_cnt(__csz));
456 auto __nsz = _Alloc_block::_M_cnt(_M_alloc_size(__csz));
457 auto __f = __b.allocate(__nsz);
458 auto __fn =
reinterpret_cast<std::uintptr_t
>(__f);
459 auto __an = _M_alloc_address(__fn, __csz);
467 operator new(std::size_t __sz)
468 requires default_initializable<_Rebound>
469 {
return _M_allocate({}, __sz); }
471 template<
typename _Na,
typename... _Args>
473 operator new(std::size_t __sz,
474 allocator_arg_t,
const _Na& __na,
476 requires convertible_to<const _Na&, _Alloc>
478 return _M_allocate(
static_cast<_Rebound
>(
static_cast<_Alloc
>(__na)),
482 template<
typename _This,
typename _Na,
typename... _Args>
484 operator new(std::size_t __sz,
486 allocator_arg_t,
const _Na& __na,
488 requires convertible_to<const _Na&, _Alloc>
490 return _M_allocate(
static_cast<_Rebound
>(
static_cast<_Alloc
>(__na)),
495 operator delete(
void* __ptr, std::size_t __csz)
noexcept
497 if constexpr (_Stateless_alloc<_Rebound>)
500 return __b.deallocate(
reinterpret_cast<_Alloc_block*
>(__ptr),
501 _Alloc_block::_M_cnt(__csz));
505 auto __nsz = _Alloc_block::_M_cnt(_M_alloc_size(__csz));
506 auto __fn =
reinterpret_cast<std::uintptr_t
>(__ptr);
507 auto __an = _M_alloc_address(__fn, __csz);
510 __b.deallocate(
reinterpret_cast<_Alloc_block*
>(__ptr), __nsz);
516 class _Promise_alloc<void>
518 using _Dealloc_fn = void (*)(
void*, std::size_t);
521 _M_dealloc_address(std::uintptr_t __fn, std::uintptr_t __fsz)
noexcept
523 auto __an = __fn + __fsz;
524 auto __ba =
alignof(_Dealloc_fn);
525 auto __aligned = ((__an + __ba - 1) / __ba) * __ba;
526 return reinterpret_cast<_Dealloc_fn*
>(__aligned);
529 template<
typename _Rebound>
531 _M_alloc_address(std::uintptr_t __fn, std::uintptr_t __fsz)
noexcept
532 requires (!_Stateless_alloc<_Rebound>)
534 auto __ba =
alignof(_Rebound);
535 auto __da = _M_dealloc_address(__fn, __fsz);
536 auto __aan =
reinterpret_cast<std::uintptr_t
>(__da);
537 __aan +=
sizeof(_Dealloc_fn);
538 auto __aligned = ((__aan + __ba - 1) / __ba) * __ba;
539 return reinterpret_cast<_Rebound*
>(__aligned);
542 template<
typename _Rebound>
544 _M_alloc_size(std::size_t __csz)
noexcept
548 std::size_t __aa = 0;
549 std::size_t __as = 0;
550 if constexpr (!std::same_as<_Rebound, void>)
552 __aa =
alignof(_Rebound);
553 __as =
sizeof(_Rebound);
555 auto __ba = __aa +
alignof(_Dealloc_fn);
556 return __csz + __ba + __as +
sizeof(_Dealloc_fn);
559 template<
typename _Rebound>
561 _M_deallocator(
void* __ptr, std::size_t __csz)
noexcept
563 auto __asz = _M_alloc_size<_Rebound>(__csz);
564 auto __nblk = _Alloc_block::_M_cnt(__asz);
566 if constexpr (_Stateless_alloc<_Rebound>)
569 __b.deallocate(
reinterpret_cast<_Alloc_block*
>(__ptr), __nblk);
573 auto __fn =
reinterpret_cast<std::uintptr_t
>(__ptr);
574 auto __an = _M_alloc_address<_Rebound>(__fn, __csz);
577 __b.deallocate(
reinterpret_cast<_Alloc_block*
>(__ptr), __nblk);
581 template<
typename _Na>
583 _M_allocate(
const _Na& __na, std::size_t __csz)
586 ::template rebind_alloc<_Alloc_block>;
588 ::template rebind_traits<_Alloc_block>;
590 static_assert(is_pointer_v<typename _Rebound_ATr::pointer>,
591 "Must use allocators for true pointers with generators");
593 _Dealloc_fn __d = &_M_deallocator<_Rebound>;
594 auto __b =
static_cast<_Rebound
>(__na);
595 auto __asz = _M_alloc_size<_Rebound>(__csz);
596 auto __nblk = _Alloc_block::_M_cnt(__asz);
597 void* __p = __b.allocate(__nblk);
598 auto __pn =
reinterpret_cast<std::uintptr_t
>(__p);
599 *_M_dealloc_address(__pn, __csz) = __d;
600 if constexpr (!_Stateless_alloc<_Rebound>)
602 auto __an = _M_alloc_address<_Rebound>(__pn, __csz);
609 operator new(std::size_t __sz)
611 auto __nsz = _M_alloc_size<void>(__sz);
612 _Dealloc_fn __d = [] (
void* __ptr, std::size_t __sz)
614 ::operator
delete(__ptr, _M_alloc_size<void>(__sz));
616 auto __p = ::operator
new(__nsz);
617 auto __pn =
reinterpret_cast<uintptr_t
>(__p);
618 *_M_dealloc_address(__pn, __sz) = __d;
622 template<
typename _Na,
typename... _Args>
624 operator new(std::size_t __sz,
625 allocator_arg_t,
const _Na& __na,
627 {
return _M_allocate(__na, __sz); }
629 template<
typename _This,
typename _Na,
typename... _Args>
631 operator new(std::size_t __sz,
633 allocator_arg_t,
const _Na& __na,
635 {
return _M_allocate(__na, __sz); }
638 operator delete(
void* __ptr, std::size_t __sz)
noexcept
641 auto __pn =
reinterpret_cast<uintptr_t
>(__ptr);
642 __d = *_M_dealloc_address(__pn, __sz);
647 template<
typename _Tp>
648 concept _Cv_unqualified_object = is_object_v<_Tp>
649 && same_as<_Tp, remove_cv_t<_Tp>>;
653 template<
typename _Ref,
typename _Val,
typename _Alloc>
655 :
public ranges::view_interface<generator<_Ref, _Val, _Alloc>>
657 using _Value = __conditional_t<is_void_v<_Val>,
658 remove_cvref_t<_Ref>,
660 static_assert(__gen::_Cv_unqualified_object<_Value>,
661 "Generator value must be a cv-unqualified object type");
662 using _Reference = __gen::_Reference_t<_Ref, _Val>;
663 static_assert(is_reference_v<_Reference>
664 || (__gen::_Cv_unqualified_object<_Reference>
665 && copy_constructible<_Reference>),
666 "Generator reference type must be either a cv-unqualified "
667 "object type that is trivially constructible or a "
670 using _RRef = __conditional_t<
671 is_reference_v<_Reference>,
672 remove_reference_t<_Reference>&&,
676 static_assert(common_reference_with<_Reference&&, _Value&&>);
677 static_assert(common_reference_with<_Reference&&, _RRef&&>);
678 static_assert(common_reference_with<_RRef&&, const _Value&>);
680 using _Yielded = __gen::_Yield_t<_Reference>;
681 using _Erased_promise = __gen::_Promise_erased<_Yielded>;
685 friend _Erased_promise;
686 friend struct _Erased_promise::_Subyield_state;
688 using yielded = _Yielded;
690 struct promise_type : _Erased_promise, __gen::_Promise_alloc<_Alloc>
692 generator get_return_object() noexcept
693 {
return { coroutine_handle<promise_type>::from_promise(*
this) }; }
696#ifdef __glibcxx_is_pointer_interconvertible
701 generator(
const generator&) =
delete;
703 generator(generator&& __other) noexcept
704 : _M_coro(std::__exchange(__other._M_coro,
nullptr)),
705 _M_began(std::__exchange(__other._M_began,
false))
710 if (
auto& __c = this->_M_coro)
715 operator=(generator __other)
noexcept
717 swap(__other._M_coro, this->_M_coro);
718 swap(__other._M_began, this->_M_began);
724 this->_M_mark_as_started();
725 auto __h = _Coro_handle::from_promise(_M_coro.promise());
726 __h.promise()._M_nest._M_top() = __h;
735 using _Coro_handle = std::coroutine_handle<_Erased_promise>;
737 generator(coroutine_handle<promise_type> __coro) noexcept
738 : _M_coro {
move(__coro) }
742 _M_mark_as_started() noexcept
744 __glibcxx_assert(!this->_M_began);
745 this->_M_began =
true;
748 coroutine_handle<promise_type> _M_coro;
749 bool _M_began =
false;
752 template<
class _Ref,
class _Val,
class _Alloc>
753 struct generator<_Ref, _Val, _Alloc>::_Iterator
755 using value_type = _Value;
756 using difference_type = ptrdiff_t;
759 operator==(
const _Iterator& __i, default_sentinel_t)
noexcept
760 {
return __i._M_coro.done(); }
762 friend class generator;
764 _Iterator(_Iterator&& __o) noexcept
765 : _M_coro(std::__exchange(__o._M_coro, {}))
769 operator=(_Iterator&& __o)
noexcept
771 this->_M_coro = std::__exchange(__o._M_coro, {});
784 { this->operator++(); }
788 const noexcept(is_nothrow_move_constructible_v<_Reference>)
790 auto& __p = this->_M_coro.promise();
791 return static_cast<_Reference
>(*__p._M_value());
795 friend class generator;
797 _Iterator(_Coro_handle __g)
803 auto& __t = this->_M_coro.promise()._M_nest._M_top();
807 _Coro_handle _M_coro;
814 template<
typename _Ref,
typename _Val =
void>
815 using generator = std::generator<_Ref, _Val, polymorphic_allocator<std::byte>>;
819_GLIBCXX_END_NAMESPACE_VERSION
constexpr complex< _Tp > operator*(const complex< _Tp > &__x, const complex< _Tp > &__y)
Return new complex value x times y.
constexpr bool is_pointer_interconvertible_base_of_v
constexpr _Tp * addressof(_Tp &__r) noexcept
Returns the actual address of the object or function referenced by r, even in the presence of an over...
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
exception_ptr current_exception() noexcept
void rethrow_exception(exception_ptr)
Throw the object pointed to by the exception_ptr.
ISO C++ entities toplevel namespace is std.
constexpr default_sentinel_t default_sentinel
A default sentinel value.
Uniform interface to all allocator types.
An opaque pointer to an arbitrary exception.