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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
#include <string>
#include <iostream>
#include <chrono>
#include <stc/crand.h>
#define i_static
#include <stc/cstr.h>
#define i_type StcVec
#define i_val_str
#include <stc/cstack.h>
#include <vector>
using StdVec = std::vector<std::string>;
#include <unordered_set>
#include "../external/ankerl/robin_hood.h"
struct string_hash {
using is_transparent = void;
[[nodiscard]] size_t operator()(const char *txt) const {
return std::hash<std::string_view>{}(txt);
}
[[nodiscard]] size_t operator()(std::string_view txt) const {
return std::hash<std::string_view>{}(txt);
}
[[nodiscard]] size_t operator()(const std::string &txt) const {
return std::hash<std::string>{}(txt);
}
};
using StdSet = robin_hood::unordered_flat_set<std::string, string_hash, std::equal_to<>>;
//using StdSet = std::unordered_set<std::string>;
#define i_type StcSet
#define i_val_str
//#define i_hash(txtp) std::hash<std::string_view>{}(*txtp)
#include <stc/cset.h>
static const int BENCHMARK_SIZE = 250000;
static const int MAX_STRING_SIZE = 100;
static const char CHARS[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz=+-";
using time_point = std::chrono::high_resolution_clock::time_point;
static inline const char* randomString(int strsize) {
static char str[256];
union { uint64_t u8; uint8_t b[8]; } r;
for (int i = 0; i < strsize; ++i) {
if ((i & 7) == 0) r.u8 = crand() & 0x3f3f3f3f3f3f3f3f;
str[i] = CHARS[r.b[i & 7]];
}
str[strsize] = 0;
return str;
}
static inline void addRandomString(StdVec& vec, const char* str) {
vec.push_back(str);
}
static inline void addRandomString(StcVec& vec, const char* str) {
StcVec_emplace(&vec, str);
}
static inline void addRandomString(StdSet& set, const char* str) {
set.insert(str);
}
static inline void addRandomString(StcSet& set, const char* str) {
StcSet_emplace(&set, str);
}
static inline bool getRandomString(const StdSet& set, const char* str) {
return set.find(str) != set.end();
}
static inline bool getRandomString(const StcSet& set, const char* str) {
return StcSet_contains(&set, str);
}
template <class C>
int benchmark(C& container, const int n, const int strsize) {
time_point t1 = std::chrono::high_resolution_clock::now();
for (int i = 0; i < n; i++)
addRandomString(container, randomString(strsize));
time_point t2 = std::chrono::high_resolution_clock::now();
const auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count();
std::cerr << (strsize ? strsize : 32) << "\t" << duration;
return (int)duration;
}
template <class C>
int benchmark_lookup(C& container, const int n, const int strsize) {
for (int i = 0; i < n; i++)
addRandomString(container, randomString(strsize));
time_point t1 = std::chrono::high_resolution_clock::now();
int found = 0;
for (int i = 0; i < n; i++)
found += (int)getRandomString(container, randomString(strsize));
time_point t2 = std::chrono::high_resolution_clock::now();
const auto duration = std::chrono::duration_cast<std::chrono::milliseconds>(t2 - t1).count();
std::cerr << (strsize ? strsize : 32) << "\t" << duration << '\t' << found;
return (int)duration;
}
#include <time.h>
int main(void) {
uint64_t seed = time(NULL); // 4321;
int sum, n;
// VECTOR WITH STRINGS
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tstd::vector<std::string>, size=" << BENCHMARK_SIZE << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 4) {
StdVec vec; vec.reserve(BENCHMARK_SIZE);
sum += benchmark(vec, BENCHMARK_SIZE, strsize), ++n;
std::cout << '\t' << vec.front() << '\n';
}
std::cout << "Avg:\t" << sum/n << "ms\n";
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tcvec<cstr>, size=" << BENCHMARK_SIZE << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 4) {
StcVec vec = StcVec_with_capacity(BENCHMARK_SIZE);
sum += benchmark(vec, BENCHMARK_SIZE, strsize), ++n;
std::cout << '\t' << cstr_str(&vec.data[0]) << '\n';
StcVec_drop(&vec);
}
std::cout << "Avg:\t" << sum/n << "ms\n";
// INSERT: SORTED SET WITH STRINGS
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tinsert: robin_hood::unordered_flat_set<std::string>, size=" << BENCHMARK_SIZE/2 << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 4) {
StdSet set; set.reserve(BENCHMARK_SIZE/2);
sum += benchmark(set, BENCHMARK_SIZE/2, strsize), ++n;
std::cout << '\t' << *set.begin() << '\n';
}
std::cout << "Avg:\t" << sum/n << "ms\n";
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tinsert: cset<cstr>, size=" << BENCHMARK_SIZE/2 << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 4) {
StcSet set = StcSet_with_capacity(BENCHMARK_SIZE/2);
sum += benchmark(set, BENCHMARK_SIZE/2, strsize), ++n;
std::cout << '\t' << cstr_str(StcSet_begin(&set).ref) << '\n';
StcSet_drop(&set);
}
std::cout << "Avg:\t" << sum/n << "ms\n";
// LOOKUP: SORTED SET WITH STRINGS
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tfind: robin_hood::unordered_flat_set<std::string>, size=" << BENCHMARK_SIZE/2 << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 2) {
StdSet set; set.reserve(BENCHMARK_SIZE/2);
sum += benchmark_lookup(set, BENCHMARK_SIZE/2, strsize), ++n;
std::cout << '\t' << *set.begin() << '\n';
}
std::cout << "Avg:\t" << sum/n << "ms\n";
csrand(seed);
sum = 0, n = 0;
std::cerr << "\nstrsize\tmsecs\tfind: cset<cstr>, size=" << BENCHMARK_SIZE/2 << "\n";
for (int strsize = 1; strsize <= MAX_STRING_SIZE; strsize += 2) {
StcSet set = StcSet_with_capacity(BENCHMARK_SIZE/2);
sum += benchmark_lookup(set, BENCHMARK_SIZE/2, strsize), ++n;
std::cout << '\t' << cstr_str(StcSet_begin(&set).ref) << '\n';
StcSet_drop(&set);
}
std::cout << "Avg:\t" << sum/n << "ms\n";
std::cerr << "sizeof(std::string) : " << sizeof(std::string) << std::endl
<< "sizeof(cstr) : " << sizeof(cstr) << std::endl
<< "sizeof(StdSet) : " << sizeof(StdSet) << std::endl
<< "sizeof(StcSet) : " << sizeof(StcSet) << std::endl;
return 0;
}
|
