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#include <numeric>
11#include <random>
12#include <vector>
13
14#include "common.h"
15
16namespace {
17template <class ValueType>
18struct LowerBound {
19 size_t Quantity;
20
21 mutable std::mt19937_64 rng{std::random_device{}()};
22
23 void run(benchmark::State& state) const {
24 runOpOnCopies<ValueType>(state, Quantity, Order::Ascending, BatchSize::CountBatch, [&](auto& Copy) {
25 auto result = std::lower_bound(Copy.begin(), Copy.end(), Copy[rng() % Copy.size()]);
26 benchmark::DoNotOptimize(result);
27 });
28 }
29
30 std::string name() const { return "BM_LowerBound" + ValueType::name() + "_" + std::to_string(val: Quantity); }
31};
32} // namespace
33
34int main(int argc, char** argv) {
35 benchmark::Initialize(argc: &argc, argv);
36 if (benchmark::ReportUnrecognizedArguments(argc, argv))
37 return 1;
38 makeCartesianProductBenchmark<LowerBound, AllValueTypes>(A: Quantities);
39 benchmark::RunSpecifiedBenchmarks();
40}
41

source code of libcxx/benchmarks/algorithms/lower_bound.bench.cpp