 Ion Gaztañaga
|
f566b64272
|
Modified benchmark to take the original container as const reference and for those mutating algorithms, copy construct a copy for each iteration.
|
2026-03-29 16:58:31 +02:00 |
|
|
Ion Gaztañaga
|
c2d135e2bb
|
Erase segmented_find_if_original_dispatch
|
2026-03-28 23:39:47 +01:00 |
|
|
Ion Gaztañaga
|
0ab7e5d0af
|
Add bidirectional iterator support for find_last overloads
|
2026-03-28 22:29:17 +01:00 |
|
|
Ion Gaztañaga
|
bd642effb9
|
Condition on less_than_ref is wrong.
|
2026-03-23 12:06:15 +01:00 |
|
|
Ion Gaztañaga
|
06d259dd5c
|
Put early algorithm termination positions in the middle of the sequence to have a better representation of the average performance of the algorithms
|
2026-03-22 23:39:16 +01:00 |
|
|
Ion Gaztañaga
|
0f99763ea7
|
Add mark for slower than expected results
|
2026-03-20 15:20:51 +01:00 |
|
|
Ion Gaztañaga
|
57ae7a82d3
|
Added segmented_find_last, segmented_find_last_if, segmented_find_last_if_not
|
2026-03-20 01:33:48 +01:00 |
|
|
Ion Gaztañaga
|
60761d2df4
|
Avoid benchmarking suboptimal algorithms
|
2026-03-19 01:34:21 +01:00 |
|
|
Ion Gaztañaga
|
f59c02a1e8
|
Added all_of, any_of, none_of to the benchmark, add "clobber()" call for each iteration to make sure each algorithm iteration starts with "unknown" memory contents.
|
2026-03-18 16:33:56 +01:00 |
|
|
Ion Gaztañaga
|
18edb763fb
|
Add segmented_mismatch algorithm
|
2026-03-17 21:48:13 +01:00 |
|
|
Ion Gaztañaga
|
c5d40dfe58
|
Add partition_point benchmark
|
2026-03-17 15:30:31 +01:00 |
|
|
Ion Gaztañaga
|
031d05c423
|
Add merge to benchmarks
|
2026-03-17 13:31:19 +01:00 |
|
|
Ion Gaztañaga
|
9524edaf65
|
Fix typo
|
2026-03-17 12:05:53 +01:00 |
|
|
Ion Gaztañaga
|
d3fd6c5a51
|
Added set_difference, set_intersection, set_symmetric_difference to the benchmark. Reorder execution of algorithms lexicographicaly.
|
2026-03-17 11:58:35 +01:00 |
|
|
Ion Gaztañaga
|
8e19a4965d
|
Improve escape mechanism to avoid unwanted loop optimizations.
|
2026-03-17 10:38:10 +01:00 |
|
|
Ion Gaztañaga
|
13ee44c848
|
Take container by value to avoid replacing values in mutating algorithms
|
2026-03-17 00:10:13 +01:00 |
|
|
Ion Gaztañaga
|
703720b186
|
Add segmented_set_union to benchmark
|
2026-03-17 00:09:43 +01:00 |
|
|
Ion Gaztañaga
|
e4fc3e6852
|
Add "segmented_is_sorted_until" to benchmark
|
2026-03-16 22:55:49 +01:00 |
|
|
Ion Gaztañaga
|
85785938d5
|
Use C++11 standard library implementation when available.
|
2026-03-16 19:13:02 +01:00 |
|
|
Ion Gaztañaga
|
f5032dad86
|
Added find_if_not, partition and stable_partition to benchmark
|
2026-03-16 15:35:08 +01:00 |
|
|
Ion Gaztañaga
|
6983125fcb
|
Refactor copy_if test to pass the predicate from outside and reuse code
|
2026-03-16 00:04:08 +01:00 |
|
|
Ion Gaztañaga
|
82dfcf54be
|
Add segmented algorithms simple benchmark
|
2026-03-14 01:11:11 +01:00 |
|