/
handle_bench.cpp
113 lines (90 loc) · 2.51 KB
/
handle_bench.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
/*
* Copyright 2010-2024 Branimir Karadzic. All rights reserved.
* License: https://github.com/bkaradzic/bx/blob/master/LICENSE
*/
#include <bx/timer.h>
#include <bx/handlealloc.h>
#include <bx/maputil.h>
#include <tinystl/allocator.h>
#include <tinystl/unordered_map.h>
#include <unordered_map>
#include <stdio.h>
#include <assert.h>
int main()
{
const uint32_t numElements = 4<<10;
const uint32_t numIterations = 16;
//
{
int64_t elapsed = -bx::getHPCounter();
for (uint32_t ii = 0; ii < numIterations; ++ii)
{
typedef tinystl::unordered_map<uint64_t, uint16_t> TinyStlUnorderedMap;
TinyStlUnorderedMap map;
// map.reserve(numElements);
for (uint32_t jj = 0; jj < numElements; ++jj)
{
tinystl::pair<TinyStlUnorderedMap::iterator, bool> ok = map.insert(tinystl::make_pair(uint64_t(jj), uint16_t(jj) ) );
assert(ok.second); BX_UNUSED(ok);
}
for (uint32_t jj = 0; jj < numElements; ++jj)
{
bool ok = bx::mapRemove(map, uint64_t(jj) );
assert(ok); BX_UNUSED(ok);
}
assert(map.size() == 0);
}
elapsed += bx::getHPCounter();
printf(" TinyStl: %15f\n", double(elapsed) );
}
///
{
int64_t elapsed = -bx::getHPCounter();
for (uint32_t ii = 0; ii < numIterations; ++ii)
{
typedef std::unordered_map<uint64_t, uint16_t> StdUnorderedMap;
StdUnorderedMap map;
map.reserve(numElements);
for (uint32_t jj = 0; jj < numElements; ++jj)
{
std::pair<StdUnorderedMap::iterator, bool> ok = map.insert(std::make_pair(uint64_t(jj), uint16_t(jj) ) );
assert(ok.second); BX_UNUSED(ok);
}
for (uint32_t jj = 0; jj < numElements; ++jj)
{
bool ok = bx::mapRemove(map, uint64_t(jj) );
assert(ok); BX_UNUSED(ok);
}
assert(map.size() == 0);
}
elapsed += bx::getHPCounter();
printf(" STL: %15f\n", double(elapsed) );
}
///
{
int64_t elapsed = -bx::getHPCounter();
for (uint32_t ii = 0; ii < numIterations; ++ii)
{
typedef bx::HandleHashMapT<numElements+numElements/2, uint64_t> HandleHashMap;
HandleHashMap map;
for (uint32_t jj = 0; jj < numElements; ++jj)
{
bool ok = map.insert(jj, uint16_t(jj) );
assert(ok); BX_UNUSED(ok);
}
for (uint32_t jj = 0; jj < numElements; ++jj)
{
bool ok = map.removeByKey(uint64_t(jj) );
assert(ok); BX_UNUSED(ok);
}
assert(map.getNumElements() == 0);
}
elapsed += bx::getHPCounter();
printf("HandleHashMap: %15f\n", double(elapsed) );
}
extern void simd_bench();
simd_bench();
extern void math_bench();
math_bench();
return bx::kExitSuccess;
}