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
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
|
// Copyright (C) 2019 T. Zachary Laine
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/stl_interfaces/iterator_interface.hpp>
#include "ill_formed.hpp"
#include <boost/core/lightweight_test.hpp>
#include <algorithm>
#include <array>
#include <numeric>
#include <type_traits>
struct basic_input_iter
: boost::stl_interfaces::iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
basic_input_iter,
#endif
std::input_iterator_tag, int>
{
basic_input_iter() : it_(nullptr) {}
basic_input_iter(int * it) : it_(it) {}
int & operator*() const noexcept { return *it_; }
basic_input_iter & operator++() noexcept
{
++it_;
return *this;
}
friend bool operator==(basic_input_iter lhs, basic_input_iter rhs) noexcept
{
return lhs.it_ == rhs.it_;
}
using base_type = boost::stl_interfaces::iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
basic_input_iter,
#endif
std::input_iterator_tag, int>;
using base_type::operator++;
private:
int * it_;
};
BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(
basic_input_iter, std::input_iterator)
#if __cplusplus < 202002L
BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS(
basic_input_iter,
std::input_iterator_tag,
std::input_iterator_tag,
int,
int &,
int *,
std::ptrdiff_t)
#endif
template<typename ValueType>
struct input_iter : boost::stl_interfaces::iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
input_iter<ValueType>,
#endif
std::input_iterator_tag,
ValueType>
{
input_iter() : it_(nullptr) {}
input_iter(ValueType * it) : it_(it) {}
template<
typename ValueType2,
typename E = std::enable_if_t<
std::is_convertible<ValueType2 *, ValueType *>::value>>
input_iter(input_iter<ValueType2> it) : it_(it.it_)
{}
ValueType & operator*() const noexcept { return *it_; }
input_iter & operator++() noexcept
{
++it_;
return *this;
}
friend bool operator==(input_iter lhs, input_iter rhs) noexcept
{
return lhs.it_ == rhs.it_;
}
using base_type = boost::stl_interfaces::iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
input_iter<ValueType>,
#endif
std::input_iterator_tag,
ValueType>;
using base_type::operator++;
private:
ValueType * it_;
template<typename ValueType2>
friend struct input_iter;
};
BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(input_iter<int>, std::input_iterator)
#if __cplusplus < 202002L
BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS(
input_iter<int>,
std::input_iterator_tag,
std::input_iterator_tag,
int,
int &,
int *,
std::ptrdiff_t)
#endif
using int_input = input_iter<int>;
using const_int_input = input_iter<int const>;
using pair_input = input_iter<std::pair<int, int>>;
using const_pair_input = input_iter<std::pair<int, int> const>;
template<typename ValueType>
struct proxy_input_iter : boost::stl_interfaces::proxy_iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
proxy_input_iter<ValueType>,
#endif
std::input_iterator_tag,
ValueType>
{
proxy_input_iter() : it_(nullptr) {}
proxy_input_iter(ValueType * it) : it_(it) {}
template<
typename ValueType2,
typename E = std::enable_if_t<
std::is_convertible<ValueType2 *, ValueType *>::value>>
proxy_input_iter(proxy_input_iter<ValueType2> it) : it_(it.it_)
{}
ValueType operator*() const noexcept { return *it_; }
proxy_input_iter & operator++() noexcept
{
++it_;
return *this;
}
friend bool operator==(proxy_input_iter lhs, proxy_input_iter rhs) noexcept
{
return lhs.it_ == rhs.it_;
}
using base_type = boost::stl_interfaces::proxy_iterator_interface<
#if !BOOST_STL_INTERFACES_USE_DEDUCED_THIS
proxy_input_iter<ValueType>,
#endif
std::input_iterator_tag,
ValueType>;
using base_type::operator++;
private:
ValueType * it_;
template<typename ValueType2>
friend struct proxy_input_iter;
};
using int_pair = std::pair<int, int>;
BOOST_STL_INTERFACES_STATIC_ASSERT_CONCEPT(
proxy_input_iter<int_pair>, std::input_iterator)
#if __cplusplus < 202002L
BOOST_STL_INTERFACES_STATIC_ASSERT_ITERATOR_TRAITS(
proxy_input_iter<int_pair>,
std::input_iterator_tag,
std::input_iterator_tag,
int_pair,
int_pair,
boost::stl_interfaces::proxy_arrow_result<int_pair>,
std::ptrdiff_t)
#endif
std::array<int, 10> ints = {{0, 1, 2, 3, 4, 5, 6, 7, 8, 9}};
std::array<std::pair<int, int>, 10> pairs = {{
{0, 1},
{1, 1},
{2, 1},
{3, 1},
{4, 1},
{5, 1},
{6, 1},
{7, 1},
{8, 1},
{9, 1},
}};
////////////////////
// view_interface //
////////////////////
#include "view_tests.hpp"
template<typename T>
using data_t = decltype(std::declval<T>().data());
static_assert(
ill_formed<
data_t,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous>>::value,
"");
static_assert(
ill_formed<
data_t,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous> const>::
value,
"");
template<typename T>
using size_t_ = decltype(std::declval<T>().size());
static_assert(
ill_formed<
size_t_,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous>>::value,
"");
static_assert(
ill_formed<
size_t_,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous> const>::
value,
"");
template<typename T>
using back_t_ = decltype(std::declval<T>().back());
static_assert(
ill_formed<
back_t_,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous>>::value,
"");
static_assert(
ill_formed<
back_t_,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous> const>::
value,
"");
template<typename T>
using index_operator_t = decltype(std::declval<T>()[0]);
static_assert(
ill_formed<
index_operator_t,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous>>::value,
"");
static_assert(
ill_formed<
index_operator_t,
subrange<
basic_input_iter,
basic_input_iter,
boost::stl_interfaces::element_layout::discontiguous> const>::
value,
"");
int main()
{
{
basic_input_iter first(ints.data());
basic_input_iter last(ints.data() + ints.size());
{
std::array<int, 10> ints_copy;
#if __cplusplus < 202002L
std::copy(first, last, ints_copy.begin());
#else
std::ranges::copy(first, last, ints_copy.begin());
#endif
BOOST_TEST(ints_copy == ints);
}
}
{
int_input first(ints.data());
int_input last(ints.data() + ints.size());
const_int_input first_copy(first);
const_int_input last_copy(last);
#if __cplusplus < 202002L
std::equal(first, last, first_copy, last_copy);
#else
std::ranges::equal(first, last, first_copy, last_copy);
#endif
}
{
{
std::array<int, 10> ints_copy;
int_input first(ints.data());
int_input last(ints.data() + ints.size());
#if __cplusplus < 202002L
std::copy(first, last, ints_copy.begin());
#else
std::ranges::copy(first, last, ints_copy.begin());
#endif
BOOST_TEST(ints_copy == ints);
}
{
std::array<std::pair<int, int>, 10> pairs_copy;
pair_input first(pairs.data());
pair_input last(pairs.data() + pairs.size());
#if __cplusplus < 202002L
std::copy(first, last, pairs_copy.begin());
#else
std::ranges::copy(first, last, pairs_copy.begin());
#endif
BOOST_TEST(pairs_copy == pairs);
}
{
std::array<int, 10> firsts_copy;
pair_input first(pairs.data());
pair_input last(pairs.data() + pairs.size());
for (auto out = firsts_copy.begin(); first != last; ++first) {
*out++ = (*first).first;
}
BOOST_TEST(firsts_copy == ints);
}
{
std::array<int, 10> firsts_copy;
proxy_input_iter<std::pair<int, int>> first(pairs.data());
proxy_input_iter<std::pair<int, int>> last(pairs.data() + pairs.size());
for (auto out = firsts_copy.begin(); first != last; ++first) {
*out++ = (*first).first;
}
BOOST_TEST(firsts_copy == ints);
}
}
{
{
std::array<int, 10> ints_copy;
const_int_input first(ints.data());
const_int_input last(ints.data() + ints.size());
#if __cplusplus < 202002L
std::copy(first, last, ints_copy.begin());
#else
std::ranges::copy(first, last, ints_copy.begin());
#endif
BOOST_TEST(ints_copy == ints);
}
{
std::array<std::pair<int, int>, 10> pairs_copy;
const_pair_input first(pairs.data());
const_pair_input last(pairs.data() + pairs.size());
#if __cplusplus < 202002L
std::copy(first, last, pairs_copy.begin());
#else
std::ranges::copy(first, last, pairs_copy.begin());
#endif
BOOST_TEST(pairs_copy == pairs);
}
{
std::array<int, 10> firsts_copy;
const_pair_input first(pairs.data());
const_pair_input last(pairs.data() + pairs.size());
for (auto out = firsts_copy.begin(); first != last; ++first) {
*out++ = (*first).first;
}
BOOST_TEST(firsts_copy == ints);
}
{
std::array<int, 10> firsts_copy;
proxy_input_iter<std::pair<int, int> const> first(pairs.data());
proxy_input_iter<std::pair<int, int> const> last(
pairs.data() + pairs.size());
for (auto out = firsts_copy.begin(); first != last; ++first) {
*out++ = (*first).first;
}
BOOST_TEST(firsts_copy == ints);
}
}
{
basic_input_iter first(ints.data());
basic_input_iter last(ints.data() + ints.size());
auto r = range<boost::stl_interfaces::element_layout::discontiguous>(
first, last);
auto empty =
range<boost::stl_interfaces::element_layout::discontiguous>(
first, first);
// range begin/end
{
std::array<int, 10> ints_copy;
#if __cplusplus < 202002L
std::copy(r.begin(), r.end(), ints_copy.begin());
#else
std::ranges::copy(r.begin(), r.end(), ints_copy.begin());
#endif
BOOST_TEST(ints_copy == ints);
BOOST_TEST(empty.begin() == empty.end());
}
}
return boost::report_errors();
}
|
