MassiveAtoms/hashmap-bench
2
1
Fork 1
Code Issues Pull Requests Releases Wiki Activity

for real agian

Browse Source
This commit is contained in:
TinyAtoms 2020-02-05 15:17:59 -03:00
parent f633833af1
commit f12d25a595
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
main.cpp
View File

@ -18,10 +18,10 @@ typedef std::unordered_map<string, string> stringmap;
int main() { int main() {
time_point<steady_clock> start_test = steady_clock::now(); time_point<steady_clock> start_test = steady_clock::now();
// string_test(stringmap{}, 1); // process gets killed for sizes >35000 // string_test(stringmap{}, 1); // process gets killed for sizes >35000
int_test_aggregate(intmap{}, 1); int_test_aggregate(intmap{}, 30);
string_test_aggregate(stringmap{}, 1); string_test_aggregate(stringmap{}, 30);
time_point<steady_clock> end_test = steady_clock::now(); time_point<steady_clock> end_test = steady_clock::now();
std::cout << "\n\n 30 runs for all tests for 1 map: " << duration_cast<seconds>(end_test-start_test).count() << " seconds"; std::cout << "\n\n 30 runs for all tests for 1 map: " << duration_cast<seconds>(end_test-start_test).count() << " seconds\n\n";
// test takes 52 mins for 10 runs for one hashmap // test takes 52 mins for 10 runs for one hashmap
// so it'll take ~3 hours per map if we want 30 runs per test // so it'll take ~3 hours per map if we want 30 runs per test