boostorg/container
1
0
Fork 1
mirror of https://github.com/boostorg/container.git synced 2026-07-05 15:30:46 +02:00
Code Issues Packages Projects Releases Wiki Activity

Avoid benchmarking suboptimal algorithms

Browse Source
This commit is contained in:
Ion Gaztañaga
2026-03-19 01:34:21 +01:00
parent 7df642649a
commit 60761d2df4
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files
experimental/bench_segmented_algos.cpp
+9 -9
View File
@@ -1925,17 +1925,17 @@ void run_all(const C& c, std::size_t iters, const char* cname)
bench_none_of(c, iters, cname, is_negative<VT>(), "none_of(hit)");
bench_none_of(c, iters, cname, equal_to_ref<VT>(VT(static_cast<int>(c.size()/2))), "none_of(miss)");
//partition
//partition (not tested since it's not optimized for random access iterators)
bench_partition(c, iters, cname, is_odd<VT>(), "partition(hit)");
bench_partition(c, iters, cname, is_negative<VT>(), "partition(miss)");
//partition_copy
bench_partition_copy(c, iters, cname);
//partition_point
bench_partition_point(c, iters, cname, less_than_ref<VT>(static_cast<VT>((int)c.size()/2)), "partition_point(hit)");
bench_partition_point(c, iters, cname, is_negative<VT>(), "partition_point(miss)");
;
//partition_point (not tested since it's not optimized for random access iterators)
//bench_partition_point(c, iters, cname, less_than_ref<VT>(static_cast<VT>((int)c.size()/2)), "partition_point(hit)");
//bench_partition_point(c, iters, cname, is_negative<VT>(), "partition_point(miss)");
//remove
bench_remove(c, iters, cname, VT(0), "remove(hit)");
bench_remove(c, iters, cname, VT(-1), "remove(miss)");
@@ -1990,9 +1990,9 @@ void run_all(const C& c, std::size_t iters, const char* cname)
bench_set_union(c, c2, iters, cname);
}
//stable_partition
bench_stable_partition(c, iters, cname, is_odd<VT>(), "stable_partition(hit)");
bench_stable_partition(c, iters, cname, is_negative<VT>(), "stable_partition(miss)");
//stable_partition (not tested since it's not optimized for random access iterators)
//bench_stable_partition(c, iters, cname, is_odd<VT>(), "stable_partition(hit)");
//bench_stable_partition(c, iters, cname, is_negative<VT>(), "stable_partition(miss)");
//swap_ranges
bench_swap_ranges(c, iters, cname);
@@ -2013,7 +2013,7 @@ void run_benchmarks()
const std::size_t iter = 500;
#else
const std::size_t N = 10000;
const std::size_t iter = 10;
const std::size_t iter = 1;
#endif
std::cout << "\n=== Segmented algorithm benchmark [" << typeid(T).name() << "] ===\n"