Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / test / benchmarks / algorithms / ranges_stable_sort.bench.cpp
blobacc2f3f755fb86ef67d4614371d79023bc27d819
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 //===----------------------------------------------------------------------===//
9 // UNSUPPORTED: c++03, c++11, c++14, c++17
11 #include <algorithm>
13 #include "common.h"
15 namespace {
16 template <class ValueType, class Order>
17 struct StableSort {
18 size_t Quantity;
20 void run(benchmark::State& state) const {
21 runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
22 std::ranges::stable_sort(Copy);
23 });
26 bool skip() const { return Order() == ::Order::Heap; }
28 std::string name() const {
29 return "BM_RangesStableSort" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity);
32 } // namespace
34 int main(int argc, char** argv) {
35 benchmark::Initialize(&argc, argv);
36 if (benchmark::ReportUnrecognizedArguments(argc, argv))
37 return 1;
38 makeCartesianProductBenchmark<StableSort, AllValueTypes, AllOrders>(Quantities);
39 benchmark::RunSpecifiedBenchmarks();