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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <cstddef>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <set>
#include <tr1/unordered_set>
#include <vector>
#include <algorithm>
#include <vespa/vespalib/stllike/hash_set.hpp>
#include <vespa/vespalib/stllike/hash_map.hpp>
template <typename S>
void fill(S & s, size_t count)
{
for(size_t i(0); i < count; i++) {
s.insert(i);
}
}
template <typename M>
void fillM(M & m, size_t count)
{
for(size_t i(0); i < count; i++) {
m[i] = i;
}
}
template <typename S>
size_t lookup_bench(S & s, size_t count, size_t rep)
{
std::vector<uint32_t> keys(count);
for (uint32_t & key : keys) {
key = rand()%count;
}
size_t sum(0);
typename S::const_iterator e(s.end());
for (size_t j(0); j < rep; j++) {
for (size_t i(0); i < count; i++) {
if (e != s.find(i)) {
sum++;
}
}
}
return sum;
}
template <typename S>
size_t bench(S & set, size_t sz, size_t numLookups)
{
fill(set, sz);
return lookup_bench(set, sz, numLookups/sz);
}
template <typename M>
size_t benchM(M & map, size_t sz, size_t numLookups)
{
fillM(map, sz);
return lookup_bench(map, sz, numLookups/sz);
}
size_t benchMap(size_t sz, size_t numLookups)
{
std::set<uint32_t> set;
return bench(set, sz, numLookups);
}
size_t benchHashStl(size_t sz, size_t numLookups)
{
std::tr1::unordered_set<uint32_t> set;
return bench(set, sz, numLookups);
}
size_t benchHashVespaLib(size_t sz, size_t numLookups)
{
vespalib::hash_set<uint32_t> set(3*sz);
return bench(set, sz, numLookups);
}
size_t benchHashVespaLib2(size_t sz, size_t numLookups)
{
vespalib::hash_set<uint32_t, vespalib::hash<uint32_t>, std::equal_to<uint32_t>, vespalib::hashtable_base::and_modulator > set(3*sz);
return bench(set, sz, numLookups);
}
size_t benchHashMapVespaLib(size_t sz, size_t numLookups)
{
vespalib::hash_map<uint32_t, uint32_t> set(3*sz);
return benchM(set, sz, numLookups);
}
size_t benchHashMapVespaLib2(size_t sz, size_t numLookups)
{
vespalib::hash_map<uint32_t, uint32_t, vespalib::hash<uint32_t>, std::equal_to<uint32_t>, vespalib::hashtable_base::and_modulator > set(3*sz);
return benchM(set, sz, numLookups);
}
int main(int argc, char *argv[])
{
size_t count(1000);
size_t rep(10000000);
char type('m');
if (argc >= 2) {
type = argv[1][0];
}
if (argc >= 3) {
count = strtoul(argv[2], nullptr, 0);
}
if (argc >= 4) {
rep = strtoul(argv[3], nullptr, 0);
}
std::vector<const char *> description(256);
description['m'] = "std::set";
description['h'] = "std::hash_set";
description['g'] = "vespalib::hash_set";
description['G'] = "vespalib::hash_set with simple and modulator.";
description['k'] = "vespalib::hash_map";
description['K'] = "vespalib::hash_map with simple and modulator.";
size_t found(0);
switch (type) {
case 'm': found = benchMap(count, rep); break;
case 'h': found = benchHashStl(count, rep); break;
case 'g': found = benchHashVespaLib(count, rep); break;
case 'G': found = benchHashVespaLib2(count, rep); break;
case 'k': found = benchHashMapVespaLib(count, rep); break;
case 'K': found = benchHashMapVespaLib2(count, rep); break;
default:
printf("'m' = %s\n", description[type]);
printf("'h' = %s\n", description[type]);
printf("'g' = %s\n", description[type]);
printf("'G' = %s\n", description[type]);
printf("Unspecified type %c. Running map lookup benchmark\n", type);
exit(1);
break;
}
printf("Running test '%c' = %s, result = %ld found values\n", type, description[type], found);
}
|
