1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17
#include <algorithm>
#include <vector>
#include <benchmark/benchmark.h>
void run_sizes(auto benchmark) {
benchmark->Arg(1)
->Arg(2)
->Arg(3)
->Arg(4)
->Arg(64)
->Arg(512)
->Arg(1024)
->Arg(4000)
->Arg(4096)
->Arg(5500)
->Arg(64000)
->Arg(65536)
->Arg(70000);
}
template <class T>
void BM_std_minmax_element(benchmark::State& state) {
std::vector<T> vec(state.range(), 3);
for (auto _ : state) {
benchmark::DoNotOptimize(vec);
benchmark::DoNotOptimize(std::minmax_element(vec.begin(), vec.end()));
}
}
BENCHMARK(BM_std_minmax_element<char>)->Apply(run_sizes);
BENCHMARK(BM_std_minmax_element<short>)->Apply(run_sizes);
BENCHMARK(BM_std_minmax_element<int>)->Apply(run_sizes);
BENCHMARK(BM_std_minmax_element<long long>)->Apply(run_sizes);
BENCHMARK_MAIN();
|
