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
437
438
439
440
441
442
443
444
|
/// \file
// Range v3 library
//
// Copyright Eric Niebler 2014-present
//
// 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
//
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef RANGES_V3_ALGORITHM_SET_ALGORITHM_HPP
#define RANGES_V3_ALGORITHM_SET_ALGORITHM_HPP
#include <utility>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/copy.hpp>
#include <range/v3/algorithm/result_types.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/functional/invoke.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/dangling.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/detail/prologue.hpp>
namespace ranges
{
/// \addtogroup group-algorithms
/// @{
RANGES_FUNC_BEGIN(includes)
/// \brief function template \c includes
template(typename I1,
typename S1,
typename I2,
typename S2,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires input_iterator<I1> AND sentinel_for<S1, I1> AND
input_iterator<I2> AND sentinel_for<S2, I2> AND
indirect_strict_weak_order<C, projected<I1, P1>, projected<I2, P2>>)
constexpr bool RANGES_FUNC(includes)(I1 begin1,
S1 end1,
I2 begin2,
S2 end2,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
for(; begin2 != end2; ++begin1)
{
if(begin1 == end1 ||
invoke(pred, invoke(proj2, *begin2), invoke(proj1, *begin1)))
return false;
if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2)))
++begin2;
}
return true;
}
/// \overload
template(typename Rng1,
typename Rng2,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires input_range<Rng1> AND input_range<Rng2> AND
indirect_strict_weak_order<C,
projected<iterator_t<Rng1>, P1>,
projected<iterator_t<Rng2>, P2>>)
constexpr bool RANGES_FUNC(includes)(
Rng1 && rng1, Rng2 && rng2, C pred = C{}, P1 proj1 = P1{}, P2 proj2 = P2{}) //
{
return (*this)(begin(rng1),
end(rng1),
begin(rng2),
end(rng2),
std::move(pred),
std::move(proj1),
std::move(proj2));
}
RANGES_FUNC_END(includes)
namespace cpp20
{
using ranges::includes;
}
template<typename I1, typename I2, typename O>
using set_union_result = detail::in1_in2_out_result<I1, I2, O>;
RANGES_FUNC_BEGIN(set_union)
/// \brief function template \c set_union
template(typename I1,
typename S1,
typename I2,
typename S2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires sentinel_for<S1, I1> AND sentinel_for<S2, I2> AND
mergeable<I1, I2, O, C, P1, P2>)
constexpr set_union_result<I1, I2, O> RANGES_FUNC(set_union)(I1 begin1,
S1 end1,
I2 begin2,
S2 end2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
for(; begin1 != end1; ++out)
{
if(begin2 == end2)
{
auto tmp = ranges::copy(begin1, end1, out);
return {tmp.in, begin2, tmp.out};
}
if(invoke(pred, invoke(proj2, *begin2), invoke(proj1, *begin1)))
{
*out = *begin2;
++begin2;
}
else
{
*out = *begin1;
if(!invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2)))
++begin2;
++begin1;
}
}
auto tmp = ranges::copy(begin2, end2, out);
return {begin1, tmp.in, tmp.out};
}
/// \overload
template(typename Rng1,
typename Rng2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires range<Rng1> AND range<Rng2> AND
mergeable<iterator_t<Rng1>, iterator_t<Rng2>, O, C, P1, P2>)
constexpr set_union_result<borrowed_iterator_t<Rng1>, borrowed_iterator_t<Rng2>, O> //
RANGES_FUNC(set_union)(Rng1 && rng1,
Rng2 && rng2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
return (*this)(begin(rng1),
end(rng1),
begin(rng2),
end(rng2),
std::move(out),
std::move(pred),
std::move(proj1),
std::move(proj2));
}
RANGES_FUNC_END(set_union)
namespace cpp20
{
using ranges::set_union;
using ranges::set_union_result;
} // namespace cpp20
RANGES_FUNC_BEGIN(set_intersection)
/// \brief function template \c set_intersection
template(typename I1,
typename S1,
typename I2,
typename S2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires sentinel_for<S1, I1> AND sentinel_for<S2, I2> AND
mergeable<I1, I2, O, C, P1, P2>)
constexpr O RANGES_FUNC(set_intersection)(I1 begin1,
S1 end1,
I2 begin2,
S2 end2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
while(begin1 != end1 && begin2 != end2)
{
if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2)))
++begin1;
else
{
if(!invoke(pred, invoke(proj2, *begin2), invoke(proj1, *begin1)))
{
*out = *begin1;
++out;
++begin1;
}
++begin2;
}
}
return out;
}
/// \overload
template(typename Rng1,
typename Rng2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires range<Rng1> AND range<Rng2> AND
mergeable<iterator_t<Rng1>, iterator_t<Rng2>, O, C, P1, P2>)
constexpr O RANGES_FUNC(set_intersection)(Rng1 && rng1,
Rng2 && rng2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
return (*this)(begin(rng1),
end(rng1),
begin(rng2),
end(rng2),
std::move(out),
std::move(pred),
std::move(proj1),
std::move(proj2));
}
RANGES_FUNC_END(set_intersection)
namespace cpp20
{
using ranges::set_intersection;
}
template<typename I, typename O>
using set_difference_result = detail::in1_out_result<I, O>;
RANGES_FUNC_BEGIN(set_difference)
/// \brief function template \c set_difference
template(typename I1,
typename S1,
typename I2,
typename S2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires sentinel_for<S1, I1> AND sentinel_for<S2, I2> AND
mergeable<I1, I2, O, C, P1, P2>)
constexpr set_difference_result<I1, O> RANGES_FUNC(set_difference)(I1 begin1,
S1 end1,
I2 begin2,
S2 end2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
while(begin1 != end1)
{
if(begin2 == end2)
{
auto tmp = ranges::copy(begin1, end1, out);
return {tmp.in, tmp.out};
}
if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2)))
{
*out = *begin1;
++out;
++begin1;
}
else
{
if(!invoke(pred, invoke(proj2, *begin2), invoke(proj1, *begin1)))
++begin1;
++begin2;
}
}
return {begin1, out};
}
/// \overload
template(typename Rng1,
typename Rng2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires range<Rng1> AND range<Rng2> AND
mergeable<iterator_t<Rng1>, iterator_t<Rng2>, O, C, P1, P2>)
constexpr set_difference_result<borrowed_iterator_t<Rng1>, O> //
RANGES_FUNC(set_difference)(Rng1 && rng1,
Rng2 && rng2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
return (*this)(begin(rng1),
end(rng1),
begin(rng2),
end(rng2),
std::move(out),
std::move(pred),
std::move(proj1),
std::move(proj2));
}
RANGES_FUNC_END(set_difference)
namespace cpp20
{
using ranges::set_difference;
using ranges::set_difference_result;
} // namespace cpp20
template<typename I1, typename I2, typename O>
using set_symmetric_difference_result = detail::in1_in2_out_result<I1, I2, O>;
RANGES_FUNC_BEGIN(set_symmetric_difference)
/// \brief function template \c set_symmetric_difference
template(typename I1,
typename S1,
typename I2,
typename S2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires sentinel_for<S1, I1> AND sentinel_for<S2, I2> AND
mergeable<I1, I2, O, C, P1, P2>)
constexpr set_symmetric_difference_result<I1, I2, O> //
RANGES_FUNC(set_symmetric_difference)(I1 begin1,
S1 end1,
I2 begin2,
S2 end2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
while(begin1 != end1)
{
if(begin2 == end2)
{
auto tmp = ranges::copy(begin1, end1, out);
return {tmp.in, begin2, tmp.out};
}
if(invoke(pred, invoke(proj1, *begin1), invoke(proj2, *begin2)))
{
*out = *begin1;
++out;
++begin1;
}
else
{
if(invoke(pred, invoke(proj2, *begin2), invoke(proj1, *begin1)))
{
*out = *begin2;
++out;
}
else
++begin1;
++begin2;
}
}
auto tmp = ranges::copy(begin2, end2, out);
return {begin1, tmp.in, tmp.out};
}
/// \overload
template(typename Rng1,
typename Rng2,
typename O,
typename C = less,
typename P1 = identity,
typename P2 = identity)(
requires range<Rng1> AND range<Rng2> AND
mergeable<iterator_t<Rng1>, iterator_t<Rng2>, O, C, P1, P2>)
constexpr set_symmetric_difference_result<borrowed_iterator_t<Rng1>,
borrowed_iterator_t<Rng2>,
O>
RANGES_FUNC(set_symmetric_difference)(Rng1 && rng1,
Rng2 && rng2,
O out,
C pred = C{},
P1 proj1 = P1{},
P2 proj2 = P2{}) //
{
return (*this)(begin(rng1),
end(rng1),
begin(rng2),
end(rng2),
std::move(out),
std::move(pred),
std::move(proj1),
std::move(proj2));
}
RANGES_FUNC_END(set_symmetric_difference)
namespace cpp20
{
using ranges::set_symmetric_difference;
using ranges::set_symmetric_difference_result;
} // namespace cpp20
/// @}
} // namespace ranges
#include <range/v3/detail/epilogue.hpp>
#endif
|
