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// UNSUPPORTED: c++03, c++11, c++14, c++17
10
11#include <algorithm>
12
13#include "common.h"
14
15namespace {
16template <class ValueType>
17struct RangesPopHeap {
18 size_t Quantity;
19
20 void run(benchmark::State& state) const {
21 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
22 for (auto B = Copy.begin(), I = Copy.end(); I != B; --I) {
23 std::ranges::pop_heap(B, I);
24 }
25 });
26 }
27
28 std::string name() const { return "BM_RangesPopHeap" + ValueType::name() + "_" + std::to_string(val: Quantity); };
29};
30} // namespace
31
32int main(int argc, char** argv) {
33 benchmark::Initialize(argc: &argc, argv);
34 if (benchmark::ReportUnrecognizedArguments(argc, argv))
35 return 1;
36 makeCartesianProductBenchmark<RangesPopHeap, AllValueTypes>(A: Quantities);
37 benchmark::RunSpecifiedBenchmarks();
38}
39

source code of libcxx/test/benchmarks/algorithms/ranges_pop_heap.bench.cpp