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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#pragma once
#include "benchmark/config.hpp"
#include <immer/set.hpp>
#include <hash_trie.hpp> // Phil Nash
#include <boost/container/flat_set.hpp>
#include <set>
#include <unordered_set>
namespace {
template <typename T=unsigned>
auto make_generator_ranged(std::size_t runs)
{
assert(runs > 0);
auto engine = std::default_random_engine{13};
auto dist = std::uniform_int_distribution<T>{0, (T)runs-1};
auto r = std::vector<T>(runs);
std::generate_n(r.begin(), runs, std::bind(dist, engine));
return r;
}
template <typename Generator, typename Set>
auto benchmark_access_std()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto g2 = make_generator_ranged(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i)
c += v.count(g1[g2[i]]);
volatile auto r = c;
return r;
});
};
}
template <typename Generator, typename Set>
auto benchmark_access_hamt()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto g2 = make_generator_ranged(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i) {
auto& x = g1[g2[i]];
auto leaf = v.find(x).leaf();
c += !!(leaf && leaf->find(x));
}
volatile auto r = c;
return r;
});
};
}
template <typename Generator, typename Set>
auto benchmark_access()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto g2 = make_generator_ranged(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v = v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i)
c += v.count(g1[g2[i]]);
volatile auto r = c;
return r;
});
};
}
template <typename Generator, typename Set>
auto benchmark_bad_access_std()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n*2);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i)
c += v.count(g1[n+i]);
volatile auto r = c;
return r;
});
};
}
template <typename Generator, typename Set>
auto benchmark_bad_access_hamt()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n*2);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i) {
auto& x = g1[n+i];
auto leaf = v.find(x).leaf();
c += !!(leaf && leaf->find(x));
}
volatile auto r = c;
return r;
});
};
}
template <typename Generator, typename Set>
auto benchmark_bad_access()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n*2);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v = v.insert(g1[i]);
measure(meter, [&] {
auto c = 0u;
for (auto i = 0u; i < n; ++i)
c += v.count(g1[n+i]);
volatile auto r = c;
return r;
});
};
}
} // namespace
|
