-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbench.cpp
More file actions
139 lines (119 loc) · 3.34 KB
/
Copy pathbench.cpp
File metadata and controls
139 lines (119 loc) · 3.34 KB
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
#include "thh-handle-vector/handle-vector.hpp"
#include <benchmark/benchmark.h>
static void add_element(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
for ([[maybe_unused]] auto _ : state) {
thh::handle_t handle = handle_vector.add();
benchmark::DoNotOptimize(handle);
benchmark::ClobberMemory();
}
}
BENCHMARK(add_element);
static void add_element_with_reserve(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
handle_vector.reserve(8);
for ([[maybe_unused]] auto _ : state) {
thh::handle_t handle = handle_vector.add();
benchmark::DoNotOptimize(handle);
benchmark::ClobberMemory();
}
}
BENCHMARK(add_element_with_reserve);
static void remove_element(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
thh::handle_t handle = handle_vector.add();
for ([[maybe_unused]] auto _ : state) {
handle_vector.remove(handle);
benchmark::ClobberMemory();
}
}
BENCHMARK(remove_element);
static void has_element_present(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
thh::handle_t handle = handle_vector.add();
for ([[maybe_unused]] auto _ : state) {
bool has = handle_vector.has(handle);
benchmark::DoNotOptimize(has);
}
}
BENCHMARK(has_element_present);
static void has_element_not_present(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
thh::handle_t handle = handle_vector.add();
handle_vector.remove(handle);
for ([[maybe_unused]] auto _ : state) {
bool has = handle_vector.has(handle);
benchmark::DoNotOptimize(has);
}
}
BENCHMARK(has_element_not_present);
static void resolve(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
thh::handle_t handle = handle_vector.add();
for ([[maybe_unused]] auto _ : state) {
handle_vector.call(handle, [](auto& element) {
benchmark::DoNotOptimize(element);
benchmark::ClobberMemory();
});
}
}
BENCHMARK(resolve);
static void enumerate_range_for(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
std::vector<thh::handle_t> handles;
handles.reserve(10);
for (int i = 0; i < 10; ++i) {
handles.push_back(handle_vector.add());
}
for ([[maybe_unused]] auto _ : state) {
for (auto& element : handle_vector) {
int i = 0;
element = i++;
benchmark::ClobberMemory();
}
}
}
BENCHMARK(enumerate_range_for);
static void enumerate_resolve(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
std::vector<thh::handle_t> handles;
handles.reserve(10);
for (int i = 0; i < 10; ++i) {
handles.push_back(handle_vector.add());
}
for ([[maybe_unused]] auto _ : state) {
for (int64_t i = 0; i < handle_vector.size(); ++i) {
handle_vector.call(handles[i], [i](auto& element) {
element = static_cast<int>(i);
benchmark::ClobberMemory();
});
}
}
}
BENCHMARK(enumerate_resolve);
static void enumerate_iterators(benchmark::State& state)
{
thh::handle_vector_t<int> handle_vector;
std::vector<thh::handle_t> handles;
handles.reserve(10);
for (int i = 0; i < 10; ++i) {
handles.push_back(handle_vector.add());
}
for ([[maybe_unused]] auto _ : state) {
int i = 0;
for (auto& element : handle_vector) {
element = i++;
benchmark::ClobberMemory();
}
}
}
BENCHMARK(enumerate_iterators);
BENCHMARK_MAIN();