/
hash.h
120 lines (100 loc) · 3.26 KB
/
hash.h
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
/** @file hash.h Efficient key-value container with unordered keys.
*
* @authors Copyright (c) 2018 Jaakko Keränen <jaakko.keranen@iki.fi>
*
* @par License
* LGPL: http://www.gnu.org/licenses/lgpl.html
*
* <small>This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation; either version 3 of the License, or (at your
* option) any later version. This program is distributed in the hope that it
* will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
* General Public License for more details. You should have received a copy of
* the GNU Lesser General Public License along with this program; if not, see:
* http://www.gnu.org/licenses</small>
*/
#ifndef LIBCORE_HASH_H
#define LIBCORE_HASH_H
#include <unordered_map>
namespace de {
/**
* Efficient key-value container with unordered keys (based on std::unordered_map).
* @ingroup data
*/
template <typename Key,
typename Value,
typename HashFn = std::hash<Key>,
typename KeyEqual = std::equal_to<Key>>
class Hash : public std::unordered_map<Key, Value, HashFn, KeyEqual>
{
using Base = std::unordered_map<Key, Value, HashFn, KeyEqual>;
public:
Hash() {}
Hash(Hash &&moved) : Base(moved) {}
Hash(const std::initializer_list<typename Base::value_type> &init)
{
for (const auto &v : init) Base::insert(v);
}
using Base::empty;
using Base::find;
bool isEmpty() const { return empty(); }
void insert(const Key &key, const Value &value) { Base::insert(std::make_pair(key, value)); }
void remove(const Key &key) { Base::erase(key); }
bool contains(const Key &key) const { return Base::find(key) != Base::end(); }
Value & operator[](const Key &key) { return Base::operator[](key); }
const Value &operator[](const Key &key) const { return Base::find(key)->second; }
Hash & operator=(Hash &&moved) { Base::operator=(moved); return *this; }
Value take(const Key &key)
{
auto found = find(key);
Value v = std::move(found->second);
Base::erase(found);
return v;
}
void deleteAll()
{
for (auto &i : *this) { delete i.second; }
}
};
template <typename Key,
typename Value,
typename HashFn = std::hash<Key>,
typename KeyEqual = std::equal_to<Key>>
class MutableHashIterator
{
using Container = Hash<Key, Value, HashFn, KeyEqual>;
using Iterator = typename Container::iterator;
Container _hash;
Iterator _iter;
Iterator _cur;
public:
MutableHashIterator(Container &c) : _hash(c)
{
_iter = _hash.begin();
}
bool hasNext() const
{
return _iter != _hash.end();
}
Iterator &next()
{
_cur = _iter++;
return _cur;
}
const typename Container::key_type &key() const
{
return _cur->first;
}
const typename Container::value_type::second_type &value() const
{
return _cur->second;
}
void remove()
{
_iter = _hash.erase(_cur);
}
};
} // namespace de
#endif // LIBCORE_HASH_H