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
|
#pragma once
#include <AK/HashTable.h>
#include <AK/Optional.h>
#include <AK/StdLibExtras.h>
#include <AK/Vector.h>
#include <AK/kstdio.h>
namespace AK {
template<typename K, typename V, typename KeyTraits = Traits<K>>
class HashMap {
private:
struct Entry {
K key;
V value;
};
struct EntryTraits {
static unsigned hash(const Entry& entry) { return KeyTraits::hash(entry.key); }
static bool equals(const Entry& a, const Entry& b) { return KeyTraits::equals(a.key, b.key); }
static void dump(const Entry& entry)
{
kprintf("key=");
KeyTraits::dump(entry.key);
kprintf(" value=");
Traits<V>::dump(entry.value);
}
};
public:
HashMap() {}
bool is_empty() const { return m_table.is_empty(); }
int size() const { return m_table.size(); }
int capacity() const { return m_table.capacity(); }
void clear() { m_table.clear(); }
void set(const K& key, const V& value) { m_table.set({ key, value }); }
void set(const K& key, V&& value) { m_table.set({ key, move(value) }); }
void remove(const K& key)
{
auto it = find(key);
if (it != end())
m_table.remove(it);
}
void remove_one_randomly() { m_table.remove(m_table.begin()); }
typedef HashTable<Entry, EntryTraits> HashTableType;
typedef typename HashTableType::Iterator IteratorType;
typedef typename HashTableType::ConstIterator ConstIteratorType;
IteratorType begin() { return m_table.begin(); }
IteratorType end() { return m_table.end(); }
IteratorType find(const K& key)
{
return m_table.find(KeyTraits::hash(key), [&](auto& entry) { return KeyTraits::equals(key, entry.key); });
}
template<typename Finder>
IteratorType find(unsigned hash, Finder finder)
{
return m_table.find(hash, finder);
}
ConstIteratorType begin() const { return m_table.begin(); }
ConstIteratorType end() const { return m_table.end(); }
ConstIteratorType find(const K& key) const
{
return m_table.find(KeyTraits::hash(key), [&](auto& entry) { return KeyTraits::equals(key, entry.key); });
}
template<typename Finder>
ConstIteratorType find(unsigned hash, Finder finder) const
{
return m_table.find(hash, finder);
}
void ensure_capacity(int capacity) { m_table.ensure_capacity(capacity); }
void dump() const { m_table.dump(); }
Optional<typename Traits<V>::PeekType> get(const K& key) const
{
auto it = find(key);
if (it == end())
return {};
return (*it).value;
}
bool contains(const K& key) const
{
return find(key) != end();
}
void remove(IteratorType it)
{
m_table.remove(it);
}
V& ensure(const K& key)
{
auto it = find(key);
if (it == end())
set(key, V());
return find(key)->value;
}
Vector<K> keys() const
{
Vector<K> list;
list.ensure_capacity(size());
for (auto& it : *this)
list.unchecked_append(it.key);
return list;
}
private:
HashTableType m_table;
};
}
using AK::HashMap;
|
