| /openbsd-src/gnu/llvm/libcxx/benchmarks/algorithms/ |
| H A D | ranges_sort_heap.bench.cpp | 20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
|
| H A D | ranges_make_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | sort_heap.bench.cpp | 20 state, Quantity, Order::Heap, BatchSize::CountElements, in run()
|
| H A D | make_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | ranges_make_heap_then_sort_heap.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | ranges_stable_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | ranges_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | min_max_element.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | ranges_pop_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | stable_sort.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | pop_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | make_heap_then_sort_heap.bench.cpp | 19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, in run()
|
| H A D | push_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | ranges_push_heap.bench.cpp | 20 state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { in run()
|
| H A D | common.h | 210 CountElements, enumerator
220 const size_t Batch = Count == BatchSize::CountElements in runOpOnCopies()
|