1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9#include <algorithm>
10
11#include "common.h"
12
13namespace {
14template <class ValueType, class Order>
15struct RangesMakeThenSortHeap {
16 size_t Quantity;
17
18 void run(benchmark::State& state) const {
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
20 std::ranges::make_heap(Copy);
21 std::ranges::sort_heap(Copy);
22 });
23 }
24
25 std::string name() const {
26 return "BM_RangesMakeThenSortHeap" + ValueType::name() + Order::name() + "_" + std::to_string(val: Quantity);
27 };
28};
29} // namespace
30
31int main(int argc, char** argv) {
32 benchmark::Initialize(argc: &argc, argv);
33 if (benchmark::ReportUnrecognizedArguments(argc, argv))
34 return 1;
35 makeCartesianProductBenchmark<RangesMakeThenSortHeap, AllValueTypes, AllOrders>(A: Quantities);
36 benchmark::RunSpecifiedBenchmarks();
37}
38

source code of libcxx/benchmarks/algorithms/ranges_make_heap_then_sort_heap.bench.cpp