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
|
//
// 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 <immer/box.hpp>
#include <immer/algorithm.hpp>
#include <hash_trie.hpp> // Phil Nash
#include <boost/container/flat_set.hpp>
#include <set>
#include <unordered_set>
#include <numeric>
namespace {
template <typename T>
struct iter_step
{
unsigned operator() (unsigned x, const T& y) const
{
return x + y;
}
};
template <>
struct iter_step<std::string>
{
unsigned operator() (unsigned x, const std::string& y) const
{
return x + (unsigned) y.size();
}
};
template <>
struct iter_step<immer::box<std::string>>
{
unsigned operator() (unsigned x, const immer::box<std::string>& y) const
{
return x + (unsigned) y->size();
}
};
template <typename Generator, typename Set>
auto benchmark_access_std_iter()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v.insert(g1[i]);
using step_t = iter_step<typename decltype(g1)::value_type>;
measure(meter, [&] {
volatile auto c = std::accumulate(v.begin(), v.end(), 0u, step_t{});
return c;
});
};
}
template <typename Generator, typename Set>
auto benchmark_access_reduce()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v = v.insert(g1[i]);
using step_t = iter_step<typename decltype(g1)::value_type>;
measure(meter, [&] {
volatile auto c = immer::accumulate(v, 0u, step_t{});
return c;
});
};
}
template <typename Generator, typename Set>
auto benchmark_access_iter()
{
return [] (nonius::chronometer meter)
{
auto n = meter.param<N>();
auto g1 = Generator{}(n);
auto v = Set{};
for (auto i = 0u; i < n; ++i)
v = v.insert(g1[i]);
using step_t = iter_step<typename decltype(g1)::value_type>;
measure(meter, [&] {
volatile auto c = std::accumulate(v.begin(), v.end(), 0u, step_t{});
return c;
});
};
}
} // namespace
|
