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 | |
18 | void run(benchmark::State& state) const { |
19 | runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) { |
20 | std::ranges::stable_sort(Copy); |
21 | }); |
22 | } |
23 | |
24 | bool skip() const { return Order() == ::Order::Heap; } |
25 | |
26 | std::string name() const { |
27 | return "BM_RangesStableSort" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity); |
28 | } |
29 | }; |
30 | } // namespace |
31 | |
32 | int main(int argc, char** argv) { |
33 | benchmark::Initialize(&argc, argv); |
34 | if (benchmark::ReportUnrecognizedArguments(argc, argv)) |
35 | return 1; |
36 | makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities); |
37 | benchmark::RunSpecifiedBenchmarks(); |
38 | } |
39 | |