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
|
// Copyright (C) 2019 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#pragma once
#include <algorithm>
#include <concepts>
#include <functional>
#include <ranges>
namespace Utils {
template<class Callable>
class function_output_iterator
{
public:
typedef std::output_iterator_tag iterator_category;
typedef void value_type;
typedef std::ptrdiff_t difference_type;
typedef void pointer;
typedef void reference;
explicit function_output_iterator() {}
explicit function_output_iterator(const Callable &callable)
: m_callable(&callable)
{}
struct helper
{
helper(const Callable *callable)
: m_callable(callable)
{}
template<class T>
helper &operator=(T &&value)
{
(*m_callable)(std::forward<T>(value));
return *this;
}
const Callable *m_callable;
};
helper operator*() { return helper(m_callable); }
function_output_iterator &operator++() { return *this; }
function_output_iterator &operator++(int) { return *this; }
private:
const Callable *m_callable;
};
template<typename Callable>
function_output_iterator<Callable> make_iterator(const Callable &callable)
{
return function_output_iterator<Callable>(callable);
}
template<typename Iterator1,
typename Iterator2,
typename Relation = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
concept callmergeable = std::indirect_strict_weak_order<Relation,
std::projected<Iterator1, Projection1>,
std::projected<Iterator2, Projection2>>;
template<typename Iterator1, typename Iterator2, typename OutIterator>
using set_intersection_result = std::ranges::set_intersection_result<Iterator1, Iterator2, OutIterator>;
struct set_greedy_intersection_functor
{
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
std::invocable<std::iter_value_t<Iterator1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr void operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2)
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2)))
++first1;
else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1)))
++first2;
else {
std::invoke(callable, *first1);
++first1;
}
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
std::invocable<std::ranges::range_value_t<Range1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr void operator()(Range1 &&range1,
Range2 &&range2,
Callable callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
(*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::forward<Callable>(callable),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
std::invocable<std::iter_value_t<Iterator1> &, std::iter_value_t<Iterator2> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr void operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2)
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2)))
++first1;
else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1)))
++first2;
else {
std::invoke(callable, *first1, *first2);
++first1;
}
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
std::invocable<std::ranges::range_value_t<Range1> &, std::ranges::range_value_t<Range2> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr void operator()(Range1 &&range1,
Range2 &&range2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
(*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::forward<Callable>(callable),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
};
inline constexpr set_greedy_intersection_functor set_greedy_intersection{};
struct set_greedy_difference_functor
{
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
std::invocable<std::iter_value_t<Iterator1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr void operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2) {
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2))) {
std::invoke(callable, *first1);
++first1;
} else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1))) {
++first2;
} else {
++first1;
}
}
while (first1 != last1) {
std::invoke(callable, *first1);
++first1;
}
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
std::invocable<std::ranges::range_value_t<Range1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr void operator()(Range1 &&range1,
Range2 &&range2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
(*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::forward<Callable>(callable),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
};
inline constexpr set_greedy_difference_functor set_greedy_difference{};
struct set_difference_functor
{
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
std::invocable<std::iter_value_t<Iterator1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr void operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2) {
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2))) {
std::invoke(callable, *first1);
++first1;
} else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1))) {
++first2;
} else {
++first1;
++first2;
}
}
while (first1 != last1) {
std::invoke(callable, *first1);
++first1;
}
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
std::invocable<std::ranges::range_value_t<Range1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr void operator()(Range1 &&range1,
Range2 &&range2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
(*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::forward<Callable>(callable),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
};
inline constexpr set_difference_functor set_difference{};
struct set_has_common_element_functor
{
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr bool operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2)
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2)))
++first1;
else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1)))
++first2;
else
return true;
return false;
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr bool operator()(Range1 &&range1,
Range2 &&range2,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
return (*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
};
inline constexpr set_has_common_element_functor set_has_common_element{};
struct set_intersetion_functor
{
template<std::input_iterator Iterator1,
std::sentinel_for<Iterator1> Sentinel1,
std::input_iterator Iterator2,
std::sentinel_for<Iterator2> Sentinel2,
std::invocable<std::iter_value_t<Iterator1> &> Callable,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<Iterator1, Iterator2, Comp, Projection1, Projection2>
constexpr void operator()(Iterator1 first1,
Sentinel1 last1,
Iterator2 first2,
Sentinel2 last2,
Callable &&callable,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
while (first1 != last1 && first2 != last2)
if (std::invoke(comp, std::invoke(proj1, *first1), std::invoke(proj2, *first2)))
++first1;
else if (std::invoke(comp, std::invoke(proj2, *first2), std::invoke(proj1, *first1)))
++first2;
else {
std::invoke(callable, *first1);
++first1;
++first2;
}
}
template<std::ranges::input_range Range1,
std::ranges::input_range Range2,
typename Comp = std::ranges::less,
typename Projection1 = std::identity,
typename Projection2 = std::identity>
requires callmergeable<std::ranges::iterator_t<Range1>, std::ranges::iterator_t<Range2>, Comp, Projection1, Projection2>
constexpr bool operator()(Range1 &&range1,
Range2 &&range2,
Comp comp = {},
Projection1 proj1 = {},
Projection2 proj2 = {}) const
{
return (*this)(std::ranges::begin(range1),
std::ranges::end(range1),
std::ranges::begin(range2),
std::ranges::end(range2),
std::move(comp),
std::move(proj1),
std::move(proj2));
}
};
inline constexpr set_intersetion_functor set_intersetion{};
} // namespace Utils
|
