libcxx/test/benchmarks/algorithms/sort.bench.cpp

   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 // UNSUPPORTED: c++03, c++11, c++14
  10
  11 #include <algorithm>
  12
  13 #include "common.h"
  14
  15 namespace {
  16 template <class ValueType, class Order>
  17 struct Sort {
  18   size_t Quantity;
  19
  20   void run(benchmark::State& state) const {
  21     runOpOnCopies<ValueType>(state, Quantity, Order(), BatchSize::CountElements, [](auto& Copy) {
  22       std::sort(Copy.begin(), Copy.end());
  23     });
  24   }
  25
  26   bool skip() const { return Order() == ::Order::Heap; }
  27
  28   std::string name() const { return "BM_Sort" + ValueType::name() + Order::name() + "_" + std::to_string(Quantity); };
  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<Sort, AllValueTypes, AllOrders>(Quantities);
  37   benchmark::RunSpecifiedBenchmarks();
  38 }