1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
|
///////////////////////////////////////////////////////////////////////////////
// Reference implementation of std::generator proposal P2168.
//
// See https://wg21.link/P2168 for details.
//
///////////////////////////////////////////////////////////////////////////////
// Copyright Lewis Baker, Corentin Jabot
//
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0.
// (See accompanying file LICENSE or http://www.boost.org/LICENSE_1_0.txt)
///////////////////////////////////////////////////////////////////////////////
module;
#include <cassert>
export module nihil.generator:generator;
import nihil.std;
import :byte_allocator;
import :coroutine_traits;
import :elements_of;
import :forward;
import :generator_promise_base;
import :generator_promise;
import :manual_lifetime;
import :promise_base_alloc;
import :util;
namespace nihil {
// TODO : make layout compatible promise casts possible
export template <typename Ref, typename Value, typename Alloc>
struct generator
{
using byte_allocator = byte_allocator_t<Alloc>;
public:
using promise_type = generator_promise<generator<Ref, Value, Alloc>, byte_allocator>;
friend promise_type;
private:
using coroutine_handle = std::coroutine_handle<promise_type>;
public:
generator() noexcept = default;
generator(generator &&other) noexcept
: m_coro(std::exchange(other.m_coro, {}))
, m_started(std::exchange(other.m_started, false))
{
}
~generator() noexcept
{
if (m_coro) {
if (m_started && !m_coro.done()) {
m_coro.promise().__value_.destruct();
}
m_coro.destroy();
}
}
auto operator=(generator &&g) noexcept -> generator &
{
swap(g);
return *this;
}
void swap(generator &other) noexcept
{
std::swap(m_coro, other.m_coro);
std::swap(m_started, other.m_started);
}
struct sentinel
{
};
struct iterator
{
using iterator_category = std::input_iterator_tag;
using difference_type = std::ptrdiff_t;
using value_type = Value;
using reference = Ref;
using pointer = std::add_pointer_t<Ref>;
iterator() noexcept = default;
iterator(const iterator &) = delete;
iterator(iterator &&other) noexcept
: m_coro(std::exchange(other.m_coro, {}))
{
}
auto operator=(iterator &&other) noexcept -> iterator &
{
std::swap(m_coro, other.m_coro);
return *this;
}
~iterator() = default;
friend auto operator==(const iterator &it, sentinel) noexcept -> bool
{
return it.m_coro.done();
}
auto operator++() -> iterator &
{
m_coro.promise().m_value.destruct();
m_coro.promise().resume();
return *this;
}
void operator++(int)
{
(void)operator++();
}
auto operator*() const noexcept -> reference
{
return static_cast<reference>(m_coro.promise().m_value.get());
}
private:
friend generator;
explicit iterator(coroutine_handle coro) noexcept
: m_coro(coro)
{
}
coroutine_handle m_coro;
};
auto begin() -> iterator
{
assert(m_coro);
assert(!m_started);
m_started = true;
m_coro.resume();
return iterator{m_coro};
}
auto end() noexcept -> sentinel
{
return {};
}
private:
explicit generator(coroutine_handle coro) noexcept
: m_coro(coro)
{
}
public: // to get around access restrictions for __yield_sequence_awaitable
auto get_coro() noexcept -> std::coroutine_handle<>
{
return m_coro;
}
auto get_promise() noexcept -> promise_type *
{
return std::addressof(m_coro.promise());
}
private:
coroutine_handle m_coro;
bool m_started = false;
};
// Specialisation for type-erased allocator implementation.
export template <typename Ref, typename Value>
class generator<Ref, Value, use_allocator_arg>
{
using promise_base = generator_promise_base<Ref>;
public:
generator() noexcept
: m_promise(nullptr)
{
}
generator(generator &&other) noexcept
: m_promise(std::exchange(other.m_promise, nullptr))
, m_coro(std::exchange(other.m_coro, {}))
, m_started(std::exchange(other.m_started, false))
{
}
~generator() noexcept
{
if (m_coro) {
if (m_started && !m_coro.done()) {
m_promise->m_value.destruct();
}
m_coro.destroy();
}
}
auto operator=(generator g) noexcept -> generator &
{
swap(g);
return *this;
}
void swap(generator &other) noexcept
{
std::swap(m_promise, other.m_promise);
std::swap(m_coro, other.m_coro);
std::swap(m_started, other.m_started);
}
struct sentinel
{
};
struct iterator
{
using iterator_category = std::input_iterator_tag;
using difference_type = std::ptrdiff_t;
using value_type = Value;
using reference = Ref;
using pointer = std::add_pointer_t<Ref>;
iterator() noexcept = default;
iterator(const iterator &) = delete;
iterator(iterator &&other) noexcept
: m_promise(std::exchange(other.m_promise, nullptr))
, m_coro(std::exchange(other.m_coro, {}))
{
}
auto operator=(iterator &&other) noexcept -> iterator &
{
m_promise = std::exchange(other.m_promise, nullptr);
m_coro = std::exchange(other.m_coro, {});
return *this;
}
~iterator() = default;
friend auto operator==(const iterator &it, sentinel) noexcept -> bool
{
return it.m_coro.done();
}
auto operator++() -> iterator &
{
m_promise->m_value.destruct();
m_promise->resume();
return *this;
}
void operator++(int)
{
(void)operator++();
}
auto operator*() const noexcept -> reference
{
return static_cast<reference>(m_promise->m_value.get());
}
private:
friend generator;
explicit iterator(promise_base *promise,
std::coroutine_handle<> coro) noexcept
: m_promise(promise)
, m_coro(coro)
{
}
promise_base *m_promise;
std::coroutine_handle<> m_coro;
};
auto begin() -> iterator
{
assert(m_coro);
assert(!m_started);
m_started = true;
m_coro.resume();
return iterator{m_promise, m_coro};
}
auto end() noexcept -> sentinel
{
return {};
}
private:
template <typename Generator, typename ByteAllocator, bool ExplicitAllocator>
friend struct generator_promise;
template <typename Promise>
explicit generator(std::coroutine_handle<Promise> coro) noexcept
: m_promise(std::addressof(coro.promise()))
, m_coro(coro)
{
}
public: // to get around access restrictions for __yield_sequence_awaitable
auto get_coro() noexcept -> std::coroutine_handle<>
{
return m_coro;
}
auto get_promise() noexcept -> promise_base *
{
return m_promise;
}
private:
promise_base *m_promise;
std::coroutine_handle<> m_coro;
bool m_started = false;
};
} // namespace nihil
|