-
Notifications
You must be signed in to change notification settings - Fork 0
/
swiss_table_test.cpp
91 lines (73 loc) · 2.68 KB
/
swiss_table_test.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
#include "swiss_table.h"
#include <iostream>
#include <fstream>
#include <unordered_set>
#include <vector>
#include <chrono>
#include <type_traits>
using namespace std;
using namespace std::chrono;
const char* ANSI_RESET = "\u001B[0m";
const char* GREEN = "\u001B[32m";
template <class T>
std::vector<T> read_data(std::string filename) {
std::vector<T> data;
T line;
ifstream data_file(filename);
while (data_file >> line) {
data.push_back(line);
}
data_file.close();
return data;
}
void print_time(std::string operation, int64_t duration) {
printf("%s: %s%ld μs%s\n", operation.c_str(), GREEN, duration, ANSI_RESET);
}
template <class T, template <class> class S>
void benchmark_set(vector<T> &data) {
S<T> set;
// insert
auto start = high_resolution_clock::now();
for (T &t : data) {
set.insert(t);
}
auto duration = duration_cast<microseconds>(high_resolution_clock::now() - start);
print_time("Insert", duration.count());
// find
start = high_resolution_clock::now();
for (T &t : data) {
set.find(t);
}
duration = duration_cast<microseconds>(high_resolution_clock::now() - start);
print_time("Find", duration.count());
// erase
start = high_resolution_clock::now();
for (T &t : data) {
set.erase(t);
}
duration = duration_cast<microseconds>(high_resolution_clock::now() - start);
print_time("Erase", duration.count());
}
template <class T>
void test(std::string filename, std::string testname) {
cout << "\n*** " << testname << " ***" << endl;
auto words = read_data<T>(filename);
cout << "Testing: sst::swiss_table_set" << endl;
benchmark_set<T, sst::swiss_table_set>(words);
cout << "Testing: std::unordered_set" << endl;
benchmark_set<T, std::unordered_set>(words);
}
int main(int argc, char const *argv[]) {
test<std::string>("tests/words.txt", "Words Test"); // Unique words
test<std::string>("tests/oliver_twist.txt", "Words Test <Oliver Twist>"); // Duplicate words
test<int16_t>("tests/short_ints_1000.txt", "Short Ints Test <1000>");
test<int32_t>("tests/ints_1000.txt", "Ints Test <1000>");
test<int64_t>("tests/long_ints_1000.txt", "Long Ints Test <1000>");
test<int16_t>("tests/short_ints_50000.txt", "Short Ints Test <50000>");
test<int32_t>("tests/ints_50000.txt", "Ints Test <50000>");
test<int64_t>("tests/long_ints_50000.txt", "Long Ints Test <50000>");
test<int16_t>("tests/short_ints_1000000.txt", "Short Ints Test <1000000>");
test<int32_t>("tests/ints_1000000.txt", "Ints Test <1000000>");
test<int64_t>("tests/long_ints_1000000.txt", "Long Ints Test <1000000>");
return 0;
}