-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathtuple_algorithms.hpp
More file actions
450 lines (399 loc) · 17.7 KB
/
tuple_algorithms.hpp
File metadata and controls
450 lines (399 loc) · 17.7 KB
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
445
446
447
448
449
450
#pragma once
#if __cplusplus >= 202002L
#include <stdx/ct_conversions.hpp>
#include <stdx/tuple.hpp>
#include <stdx/type_traits.hpp>
#include <boost/mp11/algorithm.hpp>
#include <algorithm>
#include <array>
#include <cstddef>
#include <type_traits>
#include <utility>
namespace stdx {
inline namespace v1 {
template <typename F, tuplelike... Ts> constexpr auto apply(F &&f, Ts &&...ts) {
constexpr auto total_num_elements =
(std::size_t{} + ... + stdx::tuple_size_v<std::remove_cvref_t<Ts>>);
[[maybe_unused]] constexpr auto element_indices =
[&]() -> std::array<detail::index_pair, total_num_elements> {
std::array<detail::index_pair, total_num_elements> indices{};
[[maybe_unused]] auto p = indices.data();
((p = std::remove_cvref_t<Ts>::fill_inner_indices(p)), ...);
[[maybe_unused]] auto q = indices.data();
[[maybe_unused]] std::size_t n{};
((q = std::remove_cvref_t<Ts>::fill_outer_indices(q, n++)), ...);
return indices;
}();
[[maybe_unused]] auto outer_tuple =
stdx::tuple<Ts &&...>{std::forward<Ts>(ts)...};
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return std::forward<F>(f)(
std::move(outer_tuple)[index<element_indices[Is].outer>]
[index<element_indices[Is].inner>]...);
}(std::make_index_sequence<total_num_elements>{});
}
template <tuplelike... Ts> [[nodiscard]] constexpr auto tuple_cat(Ts &&...ts) {
if constexpr (sizeof...(Ts) == 0) {
return stdx::tuple<>{};
} else if constexpr (sizeof...(Ts) == 1) {
return (ts, ...);
} else {
constexpr auto total_num_elements =
(std::size_t{} + ... + stdx::tuple_size_v<std::remove_cvref_t<Ts>>);
[[maybe_unused]] constexpr auto element_indices =
[&]() -> std::array<detail::index_pair, total_num_elements> {
std::array<detail::index_pair, total_num_elements> indices{};
auto p = indices.data();
((p = std::remove_cvref_t<Ts>::fill_inner_indices(p)), ...);
auto q = indices.data();
std::size_t n{};
((q = std::remove_cvref_t<Ts>::fill_outer_indices(q, n++)), ...);
return indices;
}();
[[maybe_unused]] auto outer_tuple =
stdx::tuple<Ts &&...>{std::forward<Ts>(ts)...};
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
using T = stdx::tuple<stdx::tuple_element_t<
element_indices[Is].inner,
std::remove_cvref_t<decltype(std::move(
outer_tuple)[index<element_indices[Is].outer>])>>...>;
return T{
std::move(outer_tuple)[index<element_indices[Is].outer>]
[index<element_indices[Is].inner>]...};
}(std::make_index_sequence<total_num_elements>{});
}
}
template <typename T, tuplelike Tup>
[[nodiscard]] constexpr auto tuple_cons(T &&t, Tup &&tup) {
using tuple_t = std::remove_cvref_t<Tup>;
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return stdx::tuple<std::remove_cvref_t<T>,
stdx::tuple_element_t<Is, tuple_t>...>{
std::forward<T>(t), std::forward<Tup>(tup)[index<Is>]...};
}(std::make_index_sequence<stdx::tuple_size_v<tuple_t>>{});
}
template <tuplelike Tup, typename T>
[[nodiscard]] constexpr auto tuple_snoc(Tup &&tup, T &&t) {
using tuple_t = std::remove_cvref_t<Tup>;
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return stdx::tuple<stdx::tuple_element_t<Is, tuple_t>...,
std::remove_cvref_t<T>>{
std::forward<Tup>(tup)[index<Is>]..., std::forward<T>(t)};
}(std::make_index_sequence<stdx::tuple_size_v<tuple_t>>{});
}
template <typename T, tuplelike Tup>
[[nodiscard]] constexpr auto tuple_push_front(T &&t, Tup &&tup)
-> decltype(auto) {
return tuple_cons(std::forward<T>(t), std::forward<Tup>(tup));
}
template <tuplelike Tup, typename T>
[[nodiscard]] constexpr auto tuple_push_back(Tup &&tup, T &&t)
-> decltype(auto) {
return tuple_snoc(std::forward<Tup>(tup), std::forward<T>(t));
}
template <template <typename T> typename Pred, tuplelike T>
[[nodiscard]] constexpr auto filter(T &&t) {
using tuple_t = std::remove_cvref_t<T>;
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
constexpr auto num_matches =
(std::size_t{} + ... +
(Pred<stdx::tuple_element_t<Is, tuple_t>>::value ? std::size_t{1}
: std::size_t{}));
constexpr auto indices = []() -> std::array<std::size_t, num_matches> {
auto a = std::array<std::size_t, num_matches>{};
[[maybe_unused]] auto it = a.begin();
[[maybe_unused]] auto copy_index =
[&]<std::size_t I, typename Elem> {
if constexpr (Pred<Elem>::value) {
*it++ = I;
}
};
(copy_index
.template operator()<Is, stdx::tuple_element_t<Is, tuple_t>>(),
...);
return a;
}();
return [&]<std::size_t... Js>(std::index_sequence<Js...>) {
using R =
stdx::tuple<stdx::tuple_element_t<indices[Js], tuple_t>...>;
return R{std::forward<T>(t)[index<indices[Js]>]...};
}(std::make_index_sequence<num_matches>{});
}(std::make_index_sequence<stdx::tuple_size_v<tuple_t>>{});
}
namespace detail {
template <std::size_t I, typename... Ts>
constexpr auto invoke_at(auto &&op, Ts &&...ts) -> decltype(auto) {
return op(get<I>(std::forward<Ts>(ts))...);
}
template <typename... Ts>
constexpr std::size_t zip_length_for =
sizeof...(Ts) == 0
? 0
: std::min({stdx::tuple_size_v<std::remove_cvref_t<Ts>>...});
} // namespace detail
template <template <typename> typename... Fs, typename Op, tuplelike... Ts>
constexpr auto transform(Op &&op, Ts &&...ts) {
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
if constexpr (sizeof...(Fs) == 0) {
return stdx::tuple<decltype(detail::invoke_at<Is>(
std::forward<Op>(op), std::forward<Ts>(ts)...))...>{
detail::invoke_at<Is>(std::forward<Op>(op),
std::forward<Ts>(ts)...)...};
} else {
return stdx::make_indexed_tuple<Fs...>(detail::invoke_at<Is>(
std::forward<Op>(op), std::forward<Ts>(ts)...)...);
}
}(std::make_index_sequence<detail::zip_length_for<Ts...>>{});
}
template <typename Op, typename... Ts>
constexpr auto unrolled_for_each(Op &&op, Ts &&...ts) -> Op {
[&]<std::size_t... Is>(std::index_sequence<Is...>) {
(detail::invoke_at<Is>(op, std::forward<Ts>(ts)...), ...);
}(std::make_index_sequence<detail::zip_length_for<Ts...>>{});
return op;
}
template <typename Op, tuplelike... Ts>
constexpr auto for_each(Op &&op, Ts &&...ts) -> Op {
return unrolled_for_each(std::forward<Op>(op), std::forward<Ts>(ts)...);
}
namespace detail {
template <std::size_t I, typename... Ts>
constexpr auto invoke_with_idx_at(auto &&op, Ts &&...ts) -> decltype(auto) {
return op.template operator()<I>(get<I>(std::forward<Ts>(ts))...);
}
} // namespace detail
template <typename Op, typename... Ts>
constexpr auto unrolled_enumerate(Op &&op, Ts &&...ts) -> Op {
[&]<std::size_t... Is>(std::index_sequence<Is...>) {
(detail::invoke_with_idx_at<Is>(op, std::forward<Ts>(ts)...), ...);
}(std::make_index_sequence<detail::zip_length_for<Ts...>>{});
return op;
}
template <typename Op, tuplelike... Ts>
constexpr auto enumerate(Op &&op, Ts &&...ts) -> Op {
return unrolled_enumerate(std::forward<Op>(op), std::forward<Ts>(ts)...);
}
template <typename F, tuplelike... Ts>
constexpr auto all_of(F &&f, Ts &&...ts) -> bool {
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return (... and detail::invoke_at<Is>(f, std::forward<Ts>(ts)...));
}(std::make_index_sequence<detail::zip_length_for<Ts...>>{});
}
template <typename F, tuplelike... Ts>
constexpr auto any_of(F &&f, Ts &&...ts) -> bool {
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return (... or detail::invoke_at<Is>(f, std::forward<Ts>(ts)...));
}(std::make_index_sequence<detail::zip_length_for<Ts...>>{});
}
template <typename... Ts> constexpr auto none_of(Ts &&...ts) -> bool {
return not any_of(std::forward<Ts>(ts)...);
}
namespace detail {
template <typename T, template <typename> typename F, typename... Us>
constexpr auto is_index_for = (std::is_same_v<F<Us>, T> or ...);
template <typename T, typename IndexSeq, template <typename> typename... Fs,
typename... Us>
constexpr auto contains_type(
stdx::detail::tuple_impl<IndexSeq, index_function_list<Fs...>, Us...> const
&) -> std::bool_constant<(is_index_for<T, Fs, Us...> or ...) or
(std::is_same_v<T, Us> or ...)>;
template <tuplelike T, template <typename> typename Proj = std::type_identity_t>
[[nodiscard]] constexpr auto sorted_indices() {
return []<std::size_t... Is>(std::index_sequence<Is...>)
->std::array<std::size_t, sizeof...(Is)> {
using P = std::pair<std::string_view, std::size_t>;
auto a = std::array<P, sizeof...(Is)>{
P{stdx::type_as_string<Proj<tuple_element_t<Is, T>>>(), Is}...};
std::sort(a.begin(), a.end(), [](auto const &p1, auto const &p2) {
return p1.first < p2.first;
});
return {a[Is].second...};
}
(std::make_index_sequence<T::size()>{});
}
} // namespace detail
template <tuplelike Tuple, typename T>
constexpr auto contains_type =
decltype(detail::contains_type<T>(std::declval<Tuple>()))::value;
template <template <typename> typename Proj = std::type_identity_t,
tuplelike Tuple>
[[nodiscard]] constexpr auto sort(Tuple &&t) {
using T = stdx::remove_cvref_t<Tuple>;
constexpr auto indices = detail::sorted_indices<T, Proj>();
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return stdx::tuple<tuple_element_t<indices[Is], T>...>{
std::forward<Tuple>(t)[index<indices[Is]>]...};
}(std::make_index_sequence<T::size()>{});
}
namespace detail {
template <tuplelike T, template <typename> typename Proj> struct test_pair_t {
template <std::size_t I, std::size_t J>
constexpr static auto value =
std::is_same_v<Proj<stdx::tuple_element_t<I, T>>,
Proj<stdx::tuple_element_t<J, T>>>;
};
template <tuplelike T, template <typename> typename Proj = std::type_identity_t>
requires(tuple_size_v<T> > 1)
[[nodiscard]] constexpr auto count_chunks() {
auto count = std::size_t{1};
[&]<std::size_t... Is>(std::index_sequence<Is...>) {
((count += static_cast<std::size_t>(
not test_pair_t<T, Proj>::template value<Is, Is + 1>)),
...);
}(std::make_index_sequence<stdx::tuple_size_v<T> - 1>{});
return count;
}
struct chunk {
std::size_t offset{};
std::size_t size{};
friend constexpr auto operator==(chunk const &, chunk const &)
-> bool = default;
};
template <tuplelike T, template <typename> typename Proj = std::type_identity_t>
requires(tuple_size_v<T> > 1)
[[nodiscard]] constexpr auto create_chunks()
-> std::array<chunk, count_chunks<T, Proj>()> {
auto index = std::size_t{};
std::array<chunk, count_chunks<T, Proj>()> chunks{};
++chunks[index].size;
auto check_next_chunk = [&]<std::size_t I>() {
if (not test_pair_t<T, Proj>::template value<I, I + 1>) {
chunks[++index].offset = I + 1;
}
++chunks[index].size;
};
[&]<std::size_t... Is>(std::index_sequence<Is...>) {
(check_next_chunk.template operator()<Is>(), ...);
}(std::make_index_sequence<stdx::tuple_size_v<T> - 1>{});
return chunks;
}
} // namespace detail
template <template <typename> typename Proj = std::type_identity_t,
tuplelike Tuple>
[[nodiscard]] constexpr auto chunk_by(Tuple &&t) {
using tuple_t = std::remove_cvref_t<Tuple>;
if constexpr (tuple_size_v<tuple_t> == 0) {
return stdx::tuple{};
} else if constexpr (tuple_size_v<tuple_t> == 1) {
return stdx::make_tuple(std::forward<Tuple>(t));
} else {
constexpr auto chunks = detail::create_chunks<tuple_t, Proj>();
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return stdx::make_tuple(
[&]<std::size_t... Js>(std::index_sequence<Js...>) {
constexpr auto offset = chunks[Is].offset;
return stdx::tuple<tuple_element_t<
offset + Js, stdx::remove_cvref_t<Tuple>>...>{
std::forward<Tuple>(t)[index<offset + Js>]...};
}(std::make_index_sequence<chunks[Is].size>{})...);
}(std::make_index_sequence<chunks.size()>{});
}
}
template <tuplelike Tuple> [[nodiscard]] constexpr auto chunk(Tuple &&t) {
return chunk_by(std::forward<Tuple>(t));
}
template <tuplelike... Ts> constexpr auto cartesian_product_copy(Ts &&...ts) {
if constexpr (sizeof...(Ts) == 0) {
return make_tuple(tuple{});
} else {
return []<typename First, typename... Rest>(First &&first,
Rest &&...rest) {
auto const c = cartesian_product_copy(std::forward<Rest>(rest)...);
return std::forward<First>(first).apply([&]<typename... Elems>(
Elems &&...elems) {
[[maybe_unused]] auto const prepend = [&]<typename E>(E &&e) {
return c.apply([&](auto... subs) {
return make_tuple(
tuple_cat(make_tuple(std::forward<E>(e)), subs)...);
});
};
return tuple_cat(prepend(std::forward<Elems>(elems))...);
});
}(std::forward<Ts>(ts)...);
}
}
template <tuplelike... Ts> constexpr auto cartesian_product(Ts &&...ts) {
if constexpr (sizeof...(Ts) == 0) {
return make_tuple(tuple{});
} else {
return []<typename First, typename... Rest>(First &&first,
Rest &&...rest) {
auto const c = cartesian_product(std::forward<Rest>(rest)...);
return std::forward<First>(first).apply(
[&]<typename... Elems>(Elems &&...elems) {
auto const prepend = [&]<typename E>(E &&e) {
return c.apply([&](auto... subs) {
return make_tuple(tuple_cat(
forward_as_tuple(std::forward<E>(e)), subs)...);
});
};
return tuple_cat(prepend(std::forward<Elems>(elems))...);
});
}(std::forward<Ts>(ts)...);
}
}
template <tuplelike T> constexpr auto unique(T &&t) {
return chunk(std::forward<T>(t)).apply([]<typename... Us>(Us &&...us) {
return tuple<tuple_element_t<0, Us>...>{
get<0>(std::forward<Us>(us))...};
});
}
template <tuplelike T> constexpr auto to_sorted_set(T &&t) {
return unique(sort(std::forward<T>(t)));
}
template <tuplelike Tuple> constexpr auto to_unsorted_set(Tuple &&t) {
using T = stdx::remove_cvref_t<Tuple>;
using U = boost::mp11::mp_unique<T>;
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return U{get<boost::mp11::mp_find<T, tuple_element_t<Is, U>>::value>(
std::forward<Tuple>(t))...};
}(std::make_index_sequence<U::size()>{});
}
template <template <typename> typename Proj = std::type_identity_t,
tuplelike Tuple>
[[nodiscard]] constexpr auto gather_by(Tuple &&t) {
using tuple_t = std::remove_cvref_t<Tuple>;
if constexpr (tuple_size_v<tuple_t> == 0) {
return stdx::tuple{};
} else if constexpr (tuple_size_v<tuple_t> == 1) {
return stdx::make_tuple(std::forward<Tuple>(t));
} else {
constexpr auto sorted_idxs = detail::sorted_indices<tuple_t, Proj>();
constexpr auto tests =
[&]<std::size_t... Is>(std::index_sequence<Is...>) {
return std::array<bool, stdx::tuple_size_v<tuple_t> - 1>{
detail::test_pair_t<tuple_t, Proj>::template value<
sorted_idxs[Is], sorted_idxs[Is + 1]>...};
}(std::make_index_sequence<stdx::tuple_size_v<tuple_t> - 1>{});
constexpr auto chunk_count =
std::count(std::begin(tests), std::end(tests), false) + 1;
constexpr auto chunks =
[&]() -> std::array<detail::chunk, chunk_count> {
std::array<detail::chunk, chunk_count> cs{};
auto index = std::size_t{};
++cs[index].size;
for (auto i = std::size_t{}; i < std::size(tests); ++i) {
if (not tests[i]) {
cs[++index].offset = i + 1;
}
++cs[index].size;
}
return cs;
}();
return [&]<std::size_t... Is>(std::index_sequence<Is...>) {
return stdx::make_tuple([&]<std::size_t... Js>(
std::index_sequence<Js...>) {
constexpr auto offset = chunks[Is].offset;
return stdx::tuple<
tuple_element_t<sorted_idxs[offset + Js], tuple_t>...>{
std::forward<Tuple>(t)[index<sorted_idxs[offset + Js]>]...};
}(std::make_index_sequence<chunks[Is].size>{})...);
}(std::make_index_sequence<chunks.size()>{});
}
}
template <tuplelike Tuple> [[nodiscard]] constexpr auto gather(Tuple &&t) {
return gather_by(std::forward<Tuple>(t));
}
} // namespace v1
} // namespace stdx
#endif