-
Notifications
You must be signed in to change notification settings - Fork 23
Expand file tree
/
Copy pathfilters.cpp
More file actions
523 lines (431 loc) · 15.2 KB
/
Copy pathfilters.cpp
File metadata and controls
523 lines (431 loc) · 15.2 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
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
#include <algorithm>
#include <execution>
#include <functional>
#include <future>
#include <iostream>
#include <memory>
#include <ranges>
#include <random>
#include <set>
#include <string>
#include <vector>
#include <type_traits>
#include "simpleperf.h"
// filter - copy only those elements into out that satisfies the predicate
template <typename TContainer>
void Print(std::string_view intro, const TContainer& container) {
std::cout << intro << ": ";
for (size_t i = 0; auto && elem : container)
std::cout << elem << (++i == container.size() ? "\n" : ", ");
};
void PrintEx(const std::ranges::range auto& container, auto proj) {
for (size_t i = 0; auto && elem : container)
std::cout << std::invoke(proj, elem) << (++i == container.size() ? "\n" : ", ");
};
template <std::floating_point T>
T GenRandom(T lower, T upper) {
// usage of thread local random engines allows running the generator in concurrent mode
thread_local static std::default_random_engine rd;
std::uniform_real_distribution<double> dist(lower, upper);
return dist(rd);
}
// vec and out won't ever overlap
// but you can vec = Filter(vec)
template <typename T, typename Pred>
auto FilterRaw(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
for (auto&& elem : vec)
if (p(elem))
out.push_back(elem);
return out;
}
// to appreciate new range based loops
template <typename T, typename Pred>
auto FilterRawOld(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
for (typename std::vector<T>::const_iterator it = begin(vec); it != end(vec); ++it)
if (p(*it))
out.push_back(*it);
return out;
}
template <typename T, typename Pred>
auto FilterCopyIf(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
std::copy_if(begin(vec), end(vec), std::back_inserter(out), p);
return out;
}
template <typename T, typename = void>
struct has_push_back : std::false_type {};
template <typename T>
struct has_push_back<T
, std::void_t<decltype(std::declval<T>().push_back(std::declval<typename T::value_type>()))>
> : std::true_type {};
template <typename TCont, typename Pred>
auto FilterCopyIfGen(const TCont& cont, Pred p) {
TCont out;
if constexpr(has_push_back<TCont>::value)
std::copy_if(begin(cont), end(cont), std::back_inserter(out), p);
else
std::copy_if(begin(cont), end(cont), std::inserter(out, out.begin()), p);
return out;
}
template <typename T, std::predicate<const T&> Pred>
auto FilterCopyIfConcepts(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
std::copy_if(begin(vec), end(vec), std::back_inserter(out), p);
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParNaive(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
std::mutex mut;
std::for_each(std::execution::par, begin(vec), end(vec),
[&out, &mut, p](auto&& elem) {
if (p(elem)) {
std::unique_lock lock(mut);
out.push_back(elem);
}
});
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParCompose(const std::vector<T>& vec, Pred p) {
std::vector<uint8_t> buffer(vec.size());
std::vector<uint32_t> idx(vec.size());
std::transform(std::execution::par, begin(vec), end(vec), begin(buffer), [&p](const T& elem) {
return p(elem);
});
#ifdef _DEBUG
Print("input\t", buffer);
Print("buffer\t", buffer);
#endif
std::exclusive_scan(std::execution::par, begin(buffer), end(buffer), begin(idx), 0);
#ifdef _DEBUG
Print("idx\t", idx);
#endif
std::vector<T> out(idx.back() + buffer.back());
std::vector<size_t> indexes(vec.size());
std::iota(indexes.begin(), indexes.end(), 0);
std::for_each(std::execution::par, begin(indexes), end(indexes), [&buffer, &vec, &idx, &out](size_t i) {
if (buffer[i])
{
out[idx[i]] = vec[i];
}
});
#ifdef _DEBUG
Print("out\t", out);
#endif
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParComposeSeq(const std::vector<T>& vec, Pred p) {
std::vector<uint8_t> buffer(vec.size());
std::vector<uint32_t> idx(vec.size());
std::transform(std::execution::par, begin(vec), end(vec), begin(buffer), [&p](const T& elem) {
return p(elem);
});
//Print("buffer", buffer);
std::exclusive_scan(std::execution::par, begin(buffer), end(buffer), begin(idx), 0);
//Print("idx", idx);
std::vector<T> out(idx.back() + buffer.back());
//std::vector<size_t> indexes(vec.size());
//std::iota(indexes.begin(), indexes.end(), 0);
for (size_t i = 0; i < vec.size(); ++i)
if (buffer[i])
out[idx[i]] = vec[i];
#ifdef _DEBUG
Print("out", out);
#endif
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParChunks(const std::vector<T>& vec, Pred p) {
const auto chunks = std::thread::hardware_concurrency();
const auto chunkLen = vec.size() / chunks;
std::vector<size_t> indexes(chunks);
std::iota(indexes.begin(), indexes.end(), 0);
std::vector<std::vector<T>> copiedChunks(chunks);
std::for_each(std::execution::par, begin(indexes), end(indexes), [&](size_t i) {
auto startIt = std::next(std::begin(vec), i * chunkLen);
auto endIt = std::next(startIt, chunkLen);
std::copy_if(startIt, endIt, std::back_inserter(copiedChunks[i]), p);
});
std::vector<T> out;
for (const auto& part : copiedChunks)
out.insert(out.end(), part.begin(), part.end());
// remaining part:
if (vec.size() % chunks != 0) {
auto startIt = std::next(std::begin(vec), chunks * chunkLen);
std::copy_if(startIt, end(vec), std::back_inserter(out), p);
}
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParChunksReserve(const std::vector<T>& vec, Pred p) {
const auto chunks = std::thread::hardware_concurrency();
const auto chunkLen = vec.size() / chunks;
std::vector<size_t> indexes(chunks);
std::iota(indexes.begin(), indexes.end(), 0);
std::vector<std::vector<T>> copiedChunks(chunks);
std::for_each(std::execution::par, begin(indexes), end(indexes), [&](size_t i) {
copiedChunks[i].reserve(chunkLen);
auto startIt = std::next(std::begin(vec), i * chunkLen);
auto endIt = std::next(startIt, chunkLen);
std::copy_if(startIt, endIt, std::back_inserter(copiedChunks[i]), p);
});
std::vector<T> out;
for (const auto& part : copiedChunks)
out.insert(out.end(), part.begin(), part.end());
// remaining part:
if (vec.size() % chunks != 0) {
auto startIt = std::next(std::begin(vec), chunks * chunkLen);
std::copy_if(startIt, end(vec), std::back_inserter(out), p);
}
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParChunksFuture(const std::vector<T>& vec, Pred p) {
const auto chunks = std::thread::hardware_concurrency();
const auto chunkLen = vec.size() / chunks;
std::vector<std::future<std::vector<T>>> tasks(chunks);
for (size_t i = 0; i < chunks; ++i) {
auto startIt = std::next(std::begin(vec), i * chunkLen);
auto endIt = std::next(startIt, chunkLen);
tasks[i] = std::async(std::launch::async, [=, &p] {
std::vector<T> chunkOut;
std::copy_if(startIt, endIt, std::back_inserter(chunkOut), p);
return chunkOut;
});
}
std::vector<T> out;
for (auto& ft : tasks)
{
auto part = ft.get();
out.insert(out.end(), part.begin(), part.end());
}
// remaining part:
if (vec.size() % chunks != 0) {
auto startIt = std::next(std::begin(vec), chunks * chunkLen);
std::copy_if(startIt, end(vec), std::back_inserter(out), p);
}
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParChunksFutureReserve(const std::vector<T>& vec, Pred p) {
const auto chunks = std::thread::hardware_concurrency();
const auto chunkLen = vec.size() / chunks;
std::vector<std::future<std::vector<T>>> tasks(chunks);
for (size_t i = 0; i < chunks; ++i) {
auto startIt = std::next(std::begin(vec), i * chunkLen);
auto endIt = std::next(startIt, chunkLen);
tasks[i] = std::async(std::launch::async, [=, &p] {
std::vector<T> chunkOut;
chunkOut.reserve(chunkLen);
std::copy_if(startIt, endIt, std::back_inserter(chunkOut), p);
return chunkOut;
});
}
std::vector<T> out;
for (auto& ft : tasks)
{
auto part = ft.get();
out.insert(out.end(), part.begin(), part.end());
}
// remaining part:
if (vec.size() % chunks != 0) {
auto startIt = std::next(std::begin(vec), chunks * chunkLen);
std::copy_if(startIt, end(vec), std::back_inserter(out), p);
}
return out;
}
template <typename T, typename Pred>
auto FilterCopyIfParTransformPush(const std::vector<T>& vec, Pred p) {
std::vector<uint32_t> buffer(vec.size());
std::transform(std::execution::par, begin(vec), end(vec), begin(buffer), [&p](const T& elem) {
return p(elem) ? 1 : 0;
});
std::vector<T> out;
for (size_t i = 0; i < vec.size(); ++i)
if (buffer[i])
out.push_back(vec[i]);
return out;
}
template <typename T, typename Pred>
auto FilterRemoveCopyIf(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
std::remove_copy_if(begin(vec), end(vec), std::back_inserter(out), std::not_fn(p));
return out;
}
template <typename T, typename Pred>
auto FilterRemoveErase(const std::vector<T>& vec, Pred p) {
auto out = vec;
out.erase(std::remove_if(begin(out), end(out), std::not_fn(p)), end(out));
return out;
}
template <typename T, typename Pred>
auto FilterEraseIf(const std::vector<T>& vec, Pred p) {
auto out = vec;
std::erase_if(out, std::not_fn(p));
return out;
}
template <typename TCont, typename Pred>
auto FilterEraseIfGen(const TCont& cont, Pred p) {
auto out = cont;
std::erase_if(out, std::not_fn(p));
return out;
}
//template <typename TCont, std::predicate Pred>
//auto FilterEraseIfGenConcepts(const TCont& cont, Pred p) {
// auto out = cont;
// std::erase_if(out, std::not_fn(p));
// return out;
//}
template <typename T, typename Pred>
auto FilterRangesCopyIf(const std::vector<T>& vec, Pred p) {
std::vector<T> out;
std::ranges::copy_if(vec, std::back_inserter(out), p);
return out;
}
template <typename TCont, typename Pred>
auto FilterRangesCopyIfGen(const TCont& vec, Pred p) {
TCont out;
std::ranges::copy_if(vec, std::back_inserter(out), p);
return out;
}
int main(int argc, const char** argv) {
const std::vector<std::string> vec{ "Hello", "**txt", "World", "error", "warning", "C++", "****" };
auto printVec = [](std::string_view intro, const auto& container) {
std::cout << intro << ": ";
for (size_t i = 0; auto && elem : container)
std::cout << elem << (++i == container.size() ? "\n" : ", ");
};
printVec("initial vec:\t", vec);
{
auto filtered = FilterRaw(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRaw", filtered);
}
{
auto filtered = FilterRawOld(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRawOld", filtered);
}
{
auto filtered = FilterCopyIf(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterCopyIf", filtered);
//filtered = FilterCopyIf(vec, [](auto& elem) { return elem; });
}
{
auto filtered = FilterCopyIfConcepts(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterCopyIfConcepts", filtered);
//filtered = FilterCopyIf(vec, [](auto& elem) { return std::pair{ 1, 1 }; });
}
{
auto filtered = FilterCopyIfParNaive(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterCopyIfPar", filtered);
}
{
auto filtered = FilterRemoveCopyIf(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRemoveCopyIf", filtered);
}
{
auto filtered = FilterRemoveErase(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRemoveErase", filtered);
}
{
auto filtered = FilterEraseIf(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterEraseIf", filtered);
}
{
auto filtered = FilterRangesCopyIf(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRangesCopyIf", filtered);
}
{
auto filtered = FilterRangesCopyIfGen(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRangesCopyIf", filtered);
}
{
std::set<std::string> mySet{ "Hello", "**txt", "World", "error", "warning", "C++", "****" };
printVec("initial set", mySet);
auto filtered = FilterEraseIfGen(mySet, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterRangesCopyIf", filtered);
}
{
std::set<std::string> mySet{ "Hello", "**txt", "World", "error", "warning", "C++", "****" };
auto filtered = FilterCopyIfGen(mySet, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterCopyIfGen", filtered);
}
{
auto filtered = FilterCopyIfGen(vec, [](auto& elem) { return !elem.starts_with('*'); });
printVec("FilterCopyIfGen", filtered);
}
// benchmark:
//std::cout << "\n benchmarks: \n\n";
std::vector<Timing> timings;
const size_t VEC_SIZE = argc > 1 ? atoi(argv[1]) : 10000;
std::cout << "benchmark vec size: " << VEC_SIZE << '\n';
#ifdef _DEBUG
auto test = [](int elem) { return elem != 0 && elem != 3 && elem != 6; };
std::vector<int> testVec(VEC_SIZE);
std::iota(testVec.begin(), testVec.end(), 0);
#else
std::vector<std::pair<double, double>> testVec(VEC_SIZE);
std::ranges::generate(testVec.begin(), testVec.end(), []() mutable {
return std::pair{ GenRandom(-10.0, 10.0), GenRandom(-10.0, 10.0) };
});
auto test = [](auto& elem) {
auto sn = sin(elem.first) * cos(elem.second + 10.0);
return sn > 0.0;
};
#endif
std::vector<uint8_t> buffer(testVec.size());
RunAndMeasure("transform only seq ", [&testVec, &buffer, &test]() {
std::transform(begin(testVec), end(testVec), begin(buffer), test);
return buffer.size();
}, timings);
RunAndMeasure("transform only par ", [&testVec, &buffer, &test]() {
std::transform(std::execution::par, begin(testVec), end(testVec), begin(buffer), test);
return buffer.size();
}, timings);
RunAndMeasure("FilterCopyIf ", [&testVec, &test]() {
auto filtered = FilterCopyIf(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterEraseIf ", [&testVec, &test]() {
auto filtered = FilterEraseIf(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParNaive ", [&testVec, &test]() {
auto filtered = FilterCopyIfParNaive(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParCompose ", [&testVec, &test]() {
auto filtered = FilterCopyIfParCompose(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParComposeSeq ", [&testVec, &test]() {
auto filtered = FilterCopyIfParComposeSeq(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParTransformPush", [&testVec, &test]() {
auto filtered = FilterCopyIfParTransformPush(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParChunks ", [&testVec, &test]() {
auto filtered = FilterCopyIfParChunks(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParChunksReserve", [&testVec, &test]() {
auto filtered = FilterCopyIfParChunksReserve(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("FilterCopyIfParChunksFuture ", [&testVec, &test]() {
auto filtered = FilterCopyIfParChunksFuture(testVec, test);
return filtered.size();
}, timings);
RunAndMeasure("CopyIfParChunksFutureReserve", [&testVec, &test]() {
auto filtered = FilterCopyIfParChunksFutureReserve(testVec, test);
return filtered.size();
}, timings);
std::ranges::sort(timings, {}, &Timing::time);
for (const auto& t : timings)
std::cout << t.name << ' ' << t.time << '\n';
}