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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
//===----------------------------------------------------------------------===//
//
// 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 <cstddef>
#include <deque>
#include <iterator>
#include <list>
#include <string>
#include <vector>
#include "benchmark/benchmark.h"
#include "../../GenerateInput.h"
int main(int argc, char** argv) {
auto std_is_sorted = [](auto first, auto last) { return std::is_sorted(first, last); };
auto std_is_sorted_pred = [](auto first, auto last) {
return std::is_sorted(first, last, [](auto x, auto y) {
benchmark::DoNotOptimize(x);
benchmark::DoNotOptimize(y);
return x < y;
});
};
auto ranges_is_sorted_pred = [](auto first, auto last) {
return std::ranges::is_sorted(first, last, [](auto x, auto y) {
benchmark::DoNotOptimize(x);
benchmark::DoNotOptimize(y);
return x < y;
});
};
// Benchmark {std,ranges}::is_sorted on a sorted sequence (the worst case).
{
auto bm = []<class Container>(std::string name, auto is_sorted) {
benchmark::RegisterBenchmark(
name,
[is_sorted](auto& st) {
std::size_t const size = st.range(0);
using ValueType = typename Container::value_type;
std::vector<ValueType> data;
std::generate_n(std::back_inserter(data), size, [] { return Generate<ValueType>::random(); });
std::sort(data.begin(), data.end());
Container c(data.begin(), data.end());
for ([[maybe_unused]] auto _ : st) {
benchmark::DoNotOptimize(c);
auto result = is_sorted(c.begin(), c.end());
benchmark::DoNotOptimize(result);
}
})
->Arg(8)
->Arg(1024)
->Arg(8192);
};
bm.operator()<std::vector<int>>("std::is_sorted(vector<int>)", std_is_sorted);
bm.operator()<std::deque<int>>("std::is_sorted(deque<int>)", std_is_sorted);
bm.operator()<std::list<int>>("std::is_sorted(list<int>)", std_is_sorted);
bm.operator()<std::vector<int>>("rng::is_sorted(vector<int>)", std::ranges::is_sorted);
bm.operator()<std::deque<int>>("rng::is_sorted(deque<int>)", std::ranges::is_sorted);
bm.operator()<std::list<int>>("rng::is_sorted(list<int>)", std::ranges::is_sorted);
bm.operator()<std::vector<int>>("std::is_sorted(vector<int>, pred)", std_is_sorted_pred);
bm.operator()<std::deque<int>>("std::is_sorted(deque<int>, pred)", std_is_sorted_pred);
bm.operator()<std::list<int>>("std::is_sorted(list<int>, pred)", std_is_sorted_pred);
bm.operator()<std::vector<int>>("rng::is_sorted(vector<int>, pred)", ranges_is_sorted_pred);
bm.operator()<std::deque<int>>("rng::is_sorted(deque<int>, pred)", ranges_is_sorted_pred);
bm.operator()<std::list<int>>("rng::is_sorted(list<int>, pred)", ranges_is_sorted_pred);
}
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
benchmark::Shutdown();
return 0;
}
|
