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
|
// Copyright (C) 2022 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/reverse_iterator.hpp>
#include <boost/stl_interfaces/view_interface.hpp>
#include <boost/stl_interfaces/view_adaptor.hpp>
#include "ill_formed.hpp"
#include "../example/all_view.hpp"
#include "../example/reverse_view.hpp"
#include "../example/take_view.hpp"
#include <boost/core/lightweight_test.hpp>
#include <algorithm>
#include <vector>
namespace detail {
template<
typename R,
bool ReverseView = is_reverse_view<std::decay_t<R>>::value>
struct reverse_impl_impl
{
static constexpr auto call(R && r) { return ((R &&) r).base(); }
};
template<typename R>
struct reverse_impl_impl<R, false>
{
static constexpr auto call(R && r)
{
return reverse_view<std::remove_reference_t<R>>(0, (R &&) r);
}
};
struct reverse_impl
: boost::stl_interfaces::range_adaptor_closure<reverse_impl>
{
template<typename R>
constexpr auto operator()(R && r) const
{
return reverse_impl_impl<R>::call((R &&) r);
}
};
struct take_impl
{
template<typename R>
constexpr auto operator()(R && r, int n) const
{
return take_view<std::remove_reference_t<R>>((R &&) r, n);
}
constexpr auto operator()(int n) const
{
using closure_func_type =
decltype(boost::stl_interfaces::bind_back(*this, n));
return boost::stl_interfaces::closure<closure_func_type>(
boost::stl_interfaces::bind_back(*this, n));
}
};
}
#if defined(__cpp_inline_variables)
inline constexpr detail::reverse_impl old_reverse;
inline constexpr detail::take_impl old_take;
#else
namespace {
constexpr detail::reverse_impl old_reverse;
constexpr detail::take_impl old_take;
}
#endif
int main()
{
// non-closures
{
std::vector<int> vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : old_all(vec1) | old_reverse) {
vec2.push_back(x);
}
std::reverse(vec2.begin(), vec2.end());
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : old_all(vec1) | old_reverse) {
vec2.push_back(x);
}
std::reverse(vec2.begin(), vec2.end());
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : old_all(vec1) | old_reverse | old_reverse) {
vec2.push_back(x);
}
BOOST_TEST(vec1 == vec2);
}
// Mismatched begin and end; only test this in C++17 and later.
#if 201703L <= __cplusplus
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : old_all(vec1) | old_take(3)) {
vec2.push_back(x);
}
BOOST_TEST(vec2 == (std::vector<int>{0, 1, 2}));
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : old_all(vec1) | old_reverse | old_take(3)) {
vec2.push_back(x);
}
BOOST_TEST(vec2 == (std::vector<int>{7, 6, 5}));
}
#endif
#if 201703L <= __cplusplus
// closures
{
std::vector<int> vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | reverse) {
vec2.push_back(x);
}
std::reverse(vec2.begin(), vec2.end());
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | reverse) {
vec2.push_back(x);
}
std::reverse(vec2.begin(), vec2.end());
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | reverse | reverse) {
vec2.push_back(x);
}
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | take(3)) {
vec2.push_back(x);
}
BOOST_TEST(vec2 == (std::vector<int>{0, 1, 2}));
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | reverse | take(3)) {
vec2.push_back(x);
}
BOOST_TEST(vec2 == (std::vector<int>{7, 6, 5}));
}
#endif
// User views mixed with std views.
#if BOOST_STL_INTERFACES_USE_CONCEPTS
{
std::vector<int> vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | std::views::reverse | old_reverse |
std::views::reverse) {
vec2.push_back(x);
}
std::reverse(vec2.begin(), vec2.end());
BOOST_TEST(vec1 == vec2);
}
{
std::vector<int> const vec1 = {0, 1, 2, 3, 4, 5, 6, 7};
std::vector<int> vec2;
for (auto x : all(vec1) | reverse | std::views::take(3)) {
vec2.push_back(x);
}
BOOST_TEST(vec2 == (std::vector<int>{7, 6, 5}));
}
#endif
return boost::report_errors();
}
|
