Nikolas Klauser ab25249e63

[libc++] Refactor std::push_heap benchmark (#181343) ...

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 ~8 minutes
per run.

Fixes #177028

2026-02-14 08:34:45 +01:00

..

common.h

…

is_sorted_until.bench.cpp

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

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

is_sorted.bench.cpp

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

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

make_heap_then_sort_heap.bench.cpp

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

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

make_heap.bench.cpp

[libc++] Rewrite the std::make_heap benchmark (#178696)

2026-02-05 11:46:11 +01:00

partial_sort_copy.bench.cpp

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

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

partial_sort.bench.cpp

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

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

pop_heap.bench.cpp

[libc++] Rewrite the std::pop_heap benchmark (#179911)

2026-02-11 12:47:33 +01:00

push_heap.bench.cpp

[libc++] Refactor std::push_heap benchmark (#181343)

2026-02-14 08:34:45 +01:00

sort_heap.bench.cpp

[libc++] Refactor std::sort_heap benchmark (#180941)

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

sort.bench.cpp

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

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

stable_sort.bench.cpp

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

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