xref: /openbsd-src/gnu/llvm/libcxx/benchmarks/algorithms/ranges_pop_heap.bench.cpp (revision 4bdff4bed0e3d54e55670334c7d0077db4170f86)
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 
13 namespace {
14 template <class ValueType>
15 struct RangesPopHeap {
16   size_t Quantity;
17 
run__anon88b9977f0111::RangesPopHeap18   void run(benchmark::State& state) const {
19     runOpOnCopies<ValueType>(
20         state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
21           for (auto B = Copy.begin(), I = Copy.end(); I != B; --I) {
22             std::ranges::pop_heap(B, I);
23           }
24         });
25   }
26 
name__anon88b9977f0111::RangesPopHeap27   std::string name() const {
28     return "BM_RangesPopHeap" + ValueType::name() + "_" + std::to_string(Quantity);
29   };
30 };
31 } // namespace
32 
main(int argc,char ** argv)33 int main(int argc, char** argv) {
34   benchmark::Initialize(&argc, argv);
35   if (benchmark::ReportUnrecognizedArguments(argc, argv))
36     return 1;
37   makeCartesianProductBenchmark<RangesPopHeap, AllValueTypes>(Quantities);
38   benchmark::RunSpecifiedBenchmarks();
39 }
40