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 StableSort {
16 size_t Quantity;
17
run__anonbcd710760111::StableSort18 void run(benchmark::State& state) const {
19 runOpOnCopies<ValueType>(
20 state, Quantity, Order(), BatchSize::CountElements,
21 [](auto& Copy) { std::stable_sort(Copy.begin(), Copy.end()); });
22 }
23
skip__anonbcd710760111::StableSort24 bool skip() const { return Order() == ::Order::Heap; }
25
name__anonbcd710760111::StableSort26 std::string name() const {
27 return "BM_StableSort" + ValueType::name() + Order::name() + "_" +
28 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<StableSort, AllValueTypes, AllOrders>(Quantities);
38 benchmark::RunSpecifiedBenchmarks();
39 }
40