-
Notifications
You must be signed in to change notification settings - Fork 0
/
reserve.cpp
152 lines (142 loc) · 6.52 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
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
// 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 "flat_hash_map/bytell_hash_map.hpp"
#include "flat_hash_map/flat_hash_map.hpp"
#include "parallel_hashmap/btree.h"
#include "parallel_hashmap/phmap.h"
#include "robin_hood/robin_hood.h"
#include "sparsepp/spp.h"
#include "tsl/bhopscotch_map.h"
#include "tsl/hopscotch_map.h"
#include "tsl/ordered_map.h"
#include "tsl/robin_map.h"
#include "tsl/sparse_map.h"
#include "flat_hash_map/unordered_map.hpp"
#include "utils/symbol.h"
#include <absl/container/flat_hash_map.h>
#include <benchmark/benchmark.h>
#include <map>
#include <unordered_map>
#include <utils/rss.h>
#include <utils/memory.h>
template <class M> static void BM_reserve(benchmark::State &state)
{
for (auto _ : state)
{
M m;
m.reserve(state.range(0));
for (auto i = 0; i < state.range(0); i++)
{
m[i] = i;
}
}
}
BENCHMARK_TEMPLATE(BM_reserve, std::unordered_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, ska::unordered_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, ska::flat_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, ska::bytell_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, phmap::node_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, phmap::flat_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, absl::flat_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, robin_hood::unordered_flat_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, spp::sparse_hash_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::ordered_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::vector_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::bhopscotch_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::hopscotch_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::robin_map<int, int>)->Range(1 << 10, 1 << 20);
BENCHMARK_TEMPLATE(BM_reserve, tsl::sparse_map<int, int>)->Range(1 << 10, 1 << 20);
template <class M, size_t N> void BM_MemoryStringShared()
{
rusage rusage;
FillRSS(rusage);
M m;
std::cout << demangle(typeid(m).name()) << " memory " << '\n';
for (size_t i = 0; i < N; i++)
{
m[std::to_string(i)] = std::make_shared<int>(i);
}
PrintUsage(rusage);
}
template <class M, size_t N> void BM_MemoryStringUnique()
{
rusage rusage;
FillRSS(rusage);
M m;
std::cout << demangle(typeid(m).name()) << " memory " << '\n';
for (size_t i = 0; i < N; i++)
{
m[std::to_string(i)] = std::make_unique<int>(i);
}
PrintUsage(rusage);
}
template <class M, size_t N> void BM_MemoryStringPtr()
{
rusage rusage;
FillRSS(rusage);
M m;
std::cout << demangle(typeid(m).name()) << " memory " << '\n';
std::vector<int> v(N);
for (size_t i = 0; i < N; i++)
{
m[std::to_string(i)] = &v[i];
}
PrintUsage(rusage);
}
int main(int argc, char **argv)
{
RSSMemoryMap<std::unordered_map<int, int>, 1 << 20>();
RSSMemoryMap<ska::unordered_map<int, int>, 1 << 20>();
RSSMemoryMap<ska::flat_hash_map<int, int>, 1 << 20>();
RSSMemoryMap<ska::bytell_hash_map<int, int>, 1 << 20>();
RSSMemoryMap<phmap::flat_hash_map<int, int>, 1 << 20>();
RSSMemoryMap<absl::flat_hash_map<int, int>, 1 << 20>();
RSSMemoryMap<robin_hood::unordered_flat_map<int, int>, 1 << 20>();
RSSMemoryMap<spp::sparse_hash_map<int, int>, 1 << 20>();
RSSMemoryMap<tsl::bhopscotch_map<int, int>, 1 << 20>();
RSSMemoryMap<tsl::hopscotch_map<int, int>, 1 << 20>();
RSSMemoryMap<tsl::robin_map<int, int>, 1 << 20>();
RSSMemoryMap<tsl::sparse_map<int, int>, 1 << 20>();
RSSMemoryMap<tsl::ordered_map<int, int>, 1 << 20>();
RSSMemoryMap<std::map<int, int>, 1 << 20, false>();
RSSMemoryMap<phmap::btree_map<int, int>, 1 << 20, false>();
RSSMemoryStringMap<std::map<std::string, int>, 1 << 20, false>();
RSSMemoryStringMap<phmap::btree_map<std::string, int>, 1 << 20, false>();
BM_MemoryStringShared<std::map<std::string, std::shared_ptr<int>>, 1 << 20>();
BM_MemoryStringShared<phmap::btree_map<std::string, std::shared_ptr<int>>, 1 << 20>();
BM_MemoryStringShared<tsl::sparse_map<std::string, std::shared_ptr<int>>, 1 << 20>();
BM_MemoryStringUnique<tsl::sparse_map<std::string, std::unique_ptr<int>>, 1 << 20>();
BM_MemoryStringUnique<tsl::ordered_map<std::string, std::shared_ptr<int>>, 1 << 20>();
BM_MemoryStringUnique<tsl::ordered_map<std::string, std::unique_ptr<int>>, 1 << 20>();
BM_MemoryStringPtr<tsl::sparse_map<std::string, int *>, 1 << 20>();
RSSMemoryStringMap<std::unordered_map<std::string, int>, 1 << 20>();
BM_MemoryStringShared<std::unordered_map<std::string, std::shared_ptr<int>>, 1 << 20>();
BM_MemoryStringUnique<std::unordered_map<std::string, std::unique_ptr<int>>, 1 << 20>();
RSSMemoryStringMap<ska::unordered_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<ska::flat_hash_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<ska::bytell_hash_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<phmap::flat_hash_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<absl::flat_hash_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<robin_hood::unordered_flat_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<spp::sparse_hash_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<tsl::bhopscotch_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<tsl::hopscotch_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<tsl::robin_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<tsl::sparse_map<std::string, int>, 1 << 20>();
RSSMemoryStringMap<tsl::ordered_map<std::string, int>, 1 << 20>();
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
return 0;
}