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
module juptune.core.ds.hashmap;
struct RobinHoodHashMapBase(
alias Alloc,
ulong DefaultInitSize,
alias GetGrowSize,
alias GetLoadFactor,
alias Hasher,
alias KeyT_,
alias ValueT_
)
{
/++ STRUCTS ++/
///
struct Kvp
{
/++ VARIABLES ++/
///
bool isSet;
///
KeyT key;
///
ushort psl;
///
ValueT value;
}
///
struct Map
{
/++ ALIASES ++/
///
alias Grow = !();
///
alias ShouldShrink = !();
///
alias Shrink = !();
/++ VARIABLES ++/
///
array;
///
size_t length;
}
/++ ALIASES ++/
///
alias KeyT = KeyT_;
///
alias ValueT = ValueT_;
/++ FUNCTIONS ++/
///
Kvp* _getPtr(KeyT key, uint index, typeof(TODO) map);
///
void _put(VT : ValueT)(KeyT initKey, VT initValue, typeof(TODO) map);
///
auto byKeyValue();
///
void clear();
///
ValueT get(KeyT key, ValueT default_ = ValueT.init);
///
uint getHash(alias Hasher)(KeyT key);
///
ValueT* getPtr(KeyT key);
///
size_t length();
///
bool moveToNewMap(size_t newMapSize);
///
ValueT* opBinaryRight(string op)(KeyT key);
///
ValueT opIndex(KeyT key);
///
void opIndexAssign(ValueT value, KeyT key);
///
void opIndexOpAssign(string op, T)(T value, KeyT key);
///
void put(VT : ValueT)(KeyT key, VT value);
///
ValueT remove(KeyT key, ValueT default_ = ValueT.init);
///
ValueT tryGet(KeyT key, bool wasFound);
///
ValueT tryRemove(KeyT key, bool wasFound);
/++ VARIABLES ++/
///
size_t _loadFactor;
///
Map _map;
}