-
Notifications
You must be signed in to change notification settings - Fork 0
/
reserve.cpp
92 lines (82 loc) · 2.33 KB
/
reserve.cpp
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
// Copyright 2020 The Division Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Author [email protected] && [email protected]
#include <benchmark/benchmark.h>
#include <llvm/ADT/DenseSet.h>
#include <llvm/ADT/SetVector.h>
#include <llvm/ADT/SmallPtrSet.h>
#include <llvm/ADT/SmallSet.h>
#include <llvm/ADT/SparseSet.h>
#include <llvm/ADT/StringSet.h>
#include <unordered_set>
template <class M> static void BM_insert(benchmark::State &state)
{
for (auto _ : state)
{
M m;
for (auto i = 0; i < 65536; i++)
{
m.insert(i);
}
}
}
template <class M> static void BM_reserve(benchmark::State &state)
{
for (auto _ : state)
{
M m;
m.reserve(65536);
for (auto i = 0; i < 65536; i++)
{
m.insert(i);
}
}
}
BENCHMARK_TEMPLATE(BM_insert, std::unordered_set<int>);
BENCHMARK_TEMPLATE(BM_reserve, std::unordered_set<int>);
BENCHMARK_TEMPLATE(BM_insert, llvm::DenseSet<int>);
BENCHMARK_TEMPLATE(BM_insert, llvm::SmallSet<int, 32>);
BENCHMARK_TEMPLATE(BM_reserve, llvm::DenseSet<int>);
BENCHMARK_TEMPLATE(BM_insert, llvm::SetVector<int>);
template <class M> static void BM_AdtInsert(benchmark::State &state)
{
for (auto _ : state)
{
M m;
m.setUniverse(65536);
for (auto i = 0; i < 65536; i++)
{
m.insert(i);
}
}
}
BENCHMARK_TEMPLATE(BM_AdtInsert, llvm::SparseSet<unsigned>);
template <class M> static void BM_StringInsert(benchmark::State &state)
{
for (auto _ : state)
{
M m;
for (auto i = 0; i < 65536; i++)
{
m.insert(std::to_string(i));
}
}
}
BENCHMARK_TEMPLATE(BM_StringInsert, llvm::StringSet<>);
int main(int argc, char **argv)
{
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
return 0;
}