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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
//===----------------------------------------------------------------------===//
//
// 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 <list>
#include <string>
#include <vector>
#include <benchmark/benchmark.h>
#include "../../GenerateInput.h"
int main(int argc, char** argv) {
auto std_equal_3leg = [](auto first1, auto last1, auto first2, auto) { return std::equal(first1, last1, first2); };
auto std_equal_4leg = [](auto first1, auto last1, auto first2, auto last2) {
return std::equal(first1, last1, first2, last2);
};
auto std_equal_3leg_pred = [](auto first1, auto last1, auto first2, auto) {
return std::equal(first1, last1, first2, [](auto x, auto y) {
benchmark::DoNotOptimize(x);
benchmark::DoNotOptimize(y);
return x == y;
});
};
auto std_equal_4leg_pred = [](auto first1, auto last1, auto first2, auto last2) {
return std::equal(first1, last1, first2, last2, [](auto x, auto y) {
benchmark::DoNotOptimize(x);
benchmark::DoNotOptimize(y);
return x == y;
});
};
auto ranges_equal_4leg_pred = [](auto first1, auto last1, auto first2, auto last2) {
return std::ranges::equal(first1, last1, first2, last2, [](auto x, auto y) {
benchmark::DoNotOptimize(x);
benchmark::DoNotOptimize(y);
return x == y;
});
};
// Benchmark {std,ranges}::equal where we determine inequality at the very end (worst case).
{
auto bm = []<class Container>(std::string name, auto equal) {
benchmark::RegisterBenchmark(
name,
[equal](auto& st) {
std::size_t const size = st.range(0);
using ValueType = typename Container::value_type;
ValueType x = Generate<ValueType>::random();
ValueType y = random_different_from({x});
Container c1(size, x);
Container c2(size, x);
c2.back() = y;
for ([[maybe_unused]] auto _ : st) {
benchmark::DoNotOptimize(c1);
benchmark::DoNotOptimize(c2);
auto result = equal(c1.begin(), c1.end(), c2.begin(), c2.end());
benchmark::DoNotOptimize(result);
}
})
->Arg(8)
->Arg(50) // non power-of-two
->Arg(1024)
->Arg(8192)
->Arg(1 << 20);
};
// std::equal(it, it, it)
bm.operator()<std::vector<int>>("std::equal(vector<int>) (it, it, it)", std_equal_3leg);
bm.operator()<std::deque<int>>("std::equal(deque<int>) (it, it, it)", std_equal_3leg);
bm.operator()<std::list<int>>("std::equal(list<int>) (it, it, it)", std_equal_3leg);
// std::equal(it, it, it, pred)
bm.operator()<std::vector<int>>("std::equal(vector<int>) (it, it, it, pred)", std_equal_3leg_pred);
bm.operator()<std::deque<int>>("std::equal(deque<int>) (it, it, it, pred)", std_equal_3leg_pred);
bm.operator()<std::list<int>>("std::equal(list<int>) (it, it, it, pred)", std_equal_3leg_pred);
// {std,ranges}::equal(it, it, it, it)
bm.operator()<std::vector<int>>("std::equal(vector<int>) (it, it, it, it)", std_equal_4leg);
bm.operator()<std::deque<int>>("std::equal(deque<int>) (it, it, it, it)", std_equal_4leg);
bm.operator()<std::list<int>>("std::equal(list<int>) (it, it, it, it)", std_equal_4leg);
bm.operator()<std::vector<int>>("rng::equal(vector<int>) (it, it, it, it)", std::ranges::equal);
bm.operator()<std::deque<int>>("rng::equal(deque<int>) (it, it, it, it)", std::ranges::equal);
bm.operator()<std::list<int>>("rng::equal(list<int>) (it, it, it, it)", std::ranges::equal);
// {std,ranges}::equal(it, it, it, it, pred)
bm.operator()<std::vector<int>>("std::equal(vector<int>) (it, it, it, it, pred)", std_equal_4leg_pred);
bm.operator()<std::deque<int>>("std::equal(deque<int>) (it, it, it, it, pred)", std_equal_4leg_pred);
bm.operator()<std::list<int>>("std::equal(list<int>) (it, it, it, it, pred)", std_equal_4leg_pred);
bm.operator()<std::vector<int>>("rng::equal(vector<int>) (it, it, it, it, pred)", ranges_equal_4leg_pred);
bm.operator()<std::deque<int>>("rng::equal(deque<int>) (it, it, it, it, pred)", ranges_equal_4leg_pred);
bm.operator()<std::list<int>>("rng::equal(list<int>) (it, it, it, it, pred)", ranges_equal_4leg_pred);
}
// Benchmark {std,ranges}::equal on vector<bool>.
{
auto bm = [](std::string name, auto equal, bool aligned) {
benchmark::RegisterBenchmark(
name,
[=](auto& st) {
std::size_t const size = st.range();
std::vector<bool> c1(size, true);
std::vector<bool> c2(size + 8, true);
auto first1 = c1.begin();
auto last1 = c1.end();
auto first2 = aligned ? c2.begin() : c2.begin() + 4;
auto last2 = aligned ? c2.end() : c2.end() - 4;
for ([[maybe_unused]] auto _ : st) {
benchmark::DoNotOptimize(c1);
benchmark::DoNotOptimize(c2);
auto result = equal(first1, last1, first2, last2);
benchmark::DoNotOptimize(result);
}
})
->Arg(8)
->Arg(50) // non power-of-two
->Arg(1024)
->Arg(8192)
->Arg(1 << 20);
};
// {std,ranges}::equal(vector<bool>) (aligned)
bm("std::equal(vector<bool>) (aligned)", std_equal_4leg, true);
bm("rng::equal(vector<bool>) (aligned)", std::ranges::equal, true);
// {std,ranges}::equal(vector<bool>) (unaligned)
bm("std::equal(vector<bool>) (unaligned)", std_equal_4leg, false);
bm("rng::equal(vector<bool>) (unaligned)", std::ranges::equal, false);
}
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
benchmark::Shutdown();
return 0;
}
|
