Nikolas Klauser 0bf41e3d7a

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

This rewrites the `make_heap` benchmark to make it significantly faster
to run. In my test it saves ~10 minutes.

This patch also drops `ranges::` heap benchmarks, since we've decided to
remove `ranges::` benchmarks if there is a `std::` equivalent.

2026-02-05 11:46:11 +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.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

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