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
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
// Copyright Tomislav Ivek 2015-2016
//
// Use, modification and distribution is subject to 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)
//
// Project home: https://github.com/ericniebler/range-v3
#include <vector>
#include <sstream>
#include <range/v3/core.hpp>
#include <range/v3/range_for.hpp>
#include <range/v3/algorithm/set_algorithm.hpp>
#include <range/v3/algorithm/move.hpp>
#include <range/v3/iterator/operations.hpp>
#include <range/v3/iterator/insert_iterators.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/utility/copy.hpp>
#include <range/v3/view/all.hpp>
#include <range/v3/view/const.hpp>
#include <range/v3/view/drop_while.hpp>
#include <range/v3/view/iota.hpp>
#include <range/v3/view/reverse.hpp>
#include <range/v3/view/set_algorithm.hpp>
#include <range/v3/view/stride.hpp>
#include <range/v3/view/take.hpp>
#include <range/v3/view/transform.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
int main()
{
using namespace ranges;
int i1_finite[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};
int i2_finite[] = { -3, 2, 4, 4, 6, 9};
auto i1_infinite = views::ints | views::stride(3);
auto i2_infinite = views::ints | views::transform([](int x)
{
return x * x;
});
// intersection of two finite ranges
{
auto res = views::set_intersection(i1_finite, i2_finite);
CPP_assert(view_<decltype(res)>);
CPP_assert(forward_range<decltype(res)>);
CPP_assert(!random_access_range<decltype(res)>);
CPP_assert(!common_range<decltype(res)>);
using R = decltype(res);
CPP_assert(same_as<range_value_t<R>, int>);
CPP_assert(same_as<range_reference_t<R>, int&>);
CPP_assert(same_as<decltype(iter_move(begin(res))), int &&>);
static_assert(range_cardinality<R>::value == ranges::finite, "Cardinality of intersection with a finite range should be finite!");
::check_equal(res, {2, 4, 4});
CHECK(&*begin(res) == &*(begin(i1_finite) + 1));
}
// intersection of two infinite ranges
{
auto res = views::set_intersection(i1_infinite, i2_infinite);
CPP_assert(view_<decltype(res)>);
CPP_assert(forward_range<decltype(res)>);
CPP_assert(!random_access_range<decltype(res)>);
CPP_assert(!common_range<decltype(res)>);
using R = decltype(res);
CPP_assert(same_as<range_value_t<R>, int>);
CPP_assert(same_as<range_reference_t<R>, range_reference_t<decltype(i1_infinite)>>);
CPP_assert(same_as<decltype(iter_move(begin(res))), range_rvalue_reference_t<decltype(i1_infinite)>>);
static_assert(range_cardinality<R>::value == ranges::unknown, "Cardinality of intersection of infinite ranges should be unknown!");
::check_equal(res | views::take(5), {0, 9, 36, 81, 144});
}
// intersection of a finite and infinite range
{
auto res = views::set_intersection(i1_finite, i2_infinite);
CPP_assert(view_<decltype(res)>);
CPP_assert(forward_range<decltype(res)>);
CPP_assert(!random_access_range<decltype(res)>);
CPP_assert(!common_range<decltype(res)>);
using R = decltype(res);
CPP_assert(same_as<range_value_t<R>, int>);
CPP_assert(same_as<range_reference_t<R>, range_reference_t<decltype(i1_finite)>>);
CPP_assert(same_as<decltype(iter_move(begin(res))), range_rvalue_reference_t<decltype(i1_finite)>>);
static_assert(range_cardinality<R>::value == ranges::finite, "Cardinality of intersection with a finite range should be finite!");
::check_equal(res | views::take(500), {1, 4});
auto res2 = views::set_intersection(i1_infinite, i2_finite);
CPP_assert(view_<decltype(res2)>);
CPP_assert(forward_range<decltype(res2)>);
CPP_assert(!random_access_range<decltype(res2)>);
CPP_assert(!common_range<decltype(res2)>);
using R2 = decltype(res2);
CPP_assert(same_as<range_value_t<R2>, int>);
CPP_assert(same_as<range_reference_t<R2>, range_reference_t<decltype(i1_infinite)>>);
CPP_assert(same_as<range_rvalue_reference_t<R2>, range_rvalue_reference_t<decltype(i1_infinite)>>);
static_assert(range_cardinality<decltype(res2)>::value == ranges::finite, "Cardinality of intersection with a finite range should be finite!");
::check_equal(res2 | views::take(500), {6, 9});
}
// intersection of a set of unknown cardinality
{
auto rng0 = views::iota(10) | views::drop_while([](int i)
{
return i < 25;
});
static_assert(range_cardinality<decltype(rng0)>::value == ranges::unknown, "");
auto res = views::set_intersection(i1_finite, rng0);
static_assert(range_cardinality<decltype(res)>::value == ranges::unknown, "Intersection with a set of unknown cardinality should have unknown cardinality!");
}
// test const ranges
{
auto res1 = views::set_intersection(views::const_(i1_finite), views::const_(i2_finite));
using R1 = decltype(res1);
CPP_assert(same_as<range_value_t<R1>, int>);
CPP_assert(same_as<range_reference_t<R1>, const int&>);
CPP_assert(same_as<range_rvalue_reference_t<R1>, const int&&>);
auto res2 = views::set_intersection(views::const_(i1_finite), i2_finite);
using R2 = decltype(res2);
CPP_assert(same_as<range_value_t<R2>, int>);
CPP_assert(same_as<range_reference_t<R2>, const int&>);
CPP_assert(same_as<range_rvalue_reference_t<R2>, const int&&>);
}
// test different orderings
{
auto res = views::set_intersection(views::reverse(i1_finite), views::reverse(i2_finite), [](int a, int b)
{
return a > b;
});
::check_equal(res, {4, 4, 2});
}
// test projections and sets with different element types
struct S
{
int val;
bool operator==(const S& other) const
{
return val == other.val;
}
};
S s_finite[] = {S{-20}, S{-10}, S{1}, S{3}, S{3}, S{6}, S{8}, S{20}};
{
auto res1 = views::set_intersection(s_finite, views::ints(-2, 10),
less(),
&S::val,
identity()
);
using R1 = decltype(res1);
CPP_assert(same_as<range_value_t<R1>, S>);
CPP_assert(same_as<range_reference_t<R1>, S&>);
CPP_assert(same_as<range_rvalue_reference_t<R1>, S&&>);
::check_equal(res1, {S{1}, S{3}, S{6}, S{8}});
auto res2 = views::set_intersection(views::ints(-2, 10), s_finite,
less(),
identity(),
[](const S& x){ return x.val; }
);
using R2 = decltype(res2);
CPP_assert(same_as<range_value_t<R2>, int>);
CPP_assert(same_as<range_reference_t<R2>, int>);
CPP_assert(same_as<range_rvalue_reference_t<R2>, int>);
::check_equal(res2, {1, 3, 6, 8});
}
// move
{
auto v0 = to<std::vector<MoveOnlyString>>({"a","b","b","c","x","x"});
auto v1 = to<std::vector<MoveOnlyString>>({"b","x","y","z"});
auto res = views::set_intersection(v0, v1, [](const MoveOnlyString& a, const MoveOnlyString& b){return a<b;});
std::vector<MoveOnlyString> expected;
move(res, back_inserter(expected));
::check_equal(expected, {"b","x"});
::check_equal(v0, {"a","","b","c","","x"});
::check_equal(v1, {"b","x","y","z"});
using R = decltype(res);
CPP_assert(same_as<range_value_t<R>, MoveOnlyString>);
CPP_assert(same_as<range_reference_t<R>, MoveOnlyString &>);
CPP_assert(same_as<range_rvalue_reference_t<R>, MoveOnlyString &&>);
}
{
auto rng = views::set_intersection(
debug_input_view<int const>{i1_finite},
debug_input_view<int const>{i2_finite}
);
::check_equal(rng, {2, 4, 4});
}
return test_result();
}
|
