Nikolas Klauser 8c93fb0c05

[libc++] Refactor benchmarking std::make_heap and std::sort_heap together (#180935) ...

We're trying to get the time it takes to run all the benchmarks down, so
that we can run them on a regular basis. This patch saves us ~18 minutes
per run.

2026-02-11 13:17:44 -05:00

..

modifying

[libc++] Remove benchmarks for ranges algorithms that have a std equivalent (#176138)

2026-01-19 16:04:32 +01:00

nonmodifying

[libc++] Rewrite the std::lower_bound benchmark to be more efficient and add an upper_bound benchmark (#177180)

2026-01-27 13:46:36 -05:00

partitions

[libc++] Remove benchmarks for ranges algorithms that have a std equivalent (#176138)

2026-01-19 16:04:32 +01:00

sorting

[libc++] Refactor benchmarking std::make_heap and std::sort_heap together (#180935)

2026-02-11 13:17:44 -05:00

common.h

…

lexicographical_compare_three_way.bench.cpp

…

lexicographical_compare.bench.cpp

[libc++] Remove some low value benchmarks (#175178)

2026-01-12 14:09:54 -05:00

min_max_element.bench.cpp

…

min.bench.cpp

[libc++] Reduce the number of runs on the ranges::min{,max} benchmarks (#179912)

2026-02-11 13:17:03 -05:00

minmax.bench.cpp

[libc++] Reduce the number of runs on the ranges::min{,max} benchmarks (#179912)

2026-02-11 13:17:03 -05:00

push_heap.bench.cpp

…

set_intersection.bench.cpp

…

swap_ranges.bench.cpp

[libc++] Optimize ranges::swap_ranges for vector<bool>::iterator (#121150)

2025-03-04 17:15:36 -05:00