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, class Order>
15 struct MakeThenSortHeap {
16 size_t Quantity;
17
run__anon11a248f00111::MakeThenSortHeap18 void run(benchmark::State& state) const {
19 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
20 std::make_heap(Copy.begin(), Copy.end());
21 std::sort_heap(Copy.begin(), Copy.end());
22 });
23 }
24
name__anon11a248f00111::MakeThenSortHeap25 std::string name() const {
26 return "BM_MakeThenSortHeap" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity);
27 };
28 };
29 } // namespace
30
main(int argc,char ** argv)31 int main(int argc, char** argv) {
32 benchmark::Initialize(&argc, argv);
33 if (benchmark::ReportUnrecognizedArguments(argc, argv))
34 return 1;
35 makeCartesianProductBenchmark<MakeThenSortHeap, AllValueTypes, AllOrders>(Quantities);
36 benchmark::RunSpecifiedBenchmarks();
37 }
38