-
Notifications
You must be signed in to change notification settings - Fork 0
/
cachemultimap.h
248 lines (196 loc) · 5.47 KB
/
cachemultimap.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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
// Copyright (c) 2014-2017 The Dash Core developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef CACHEMULTIMAP_H_
#define CACHEMULTIMAP_H_
#include <cstddef>
#include <map>
#include <list>
#include <set>
#include "serialize.h"
#include "cachemap.h"
/**
* Map like container that keeps the N most recently added items
*/
template<typename K, typename V, typename Size = uint32_t>
class CacheMultiMap
{
public:
typedef Size size_type;
typedef CacheItem<K,V> item_t;
typedef std::list<item_t> list_t;
typedef typename list_t::iterator list_it;
typedef typename list_t::const_iterator list_cit;
typedef std::map<V,list_it> it_map_t;
typedef typename it_map_t::iterator it_map_it;
typedef typename it_map_t::const_iterator it_map_cit;
typedef std::map<K, it_map_t> map_t;
typedef typename map_t::iterator map_it;
typedef typename map_t::const_iterator map_cit;
private:
size_type nMaxSize;
list_t listItems;
map_t mapIndex;
public:
CacheMultiMap(size_type nMaxSizeIn = 0)
: nMaxSize(nMaxSizeIn),
listItems(),
mapIndex()
{}
CacheMultiMap(const CacheMap<K,V>& other)
: nMaxSize(other.nMaxSize),
listItems(other.listItems),
mapIndex()
{
RebuildIndex();
}
void Clear()
{
mapIndex.clear();
listItems.clear();
}
void SetMaxSize(size_type nMaxSizeIn)
{
nMaxSize = nMaxSizeIn;
}
size_type GetMaxSize() const {
return nMaxSize;
}
size_type GetSize() const {
return listItems.size();
}
bool Insert(const K& key, const V& value)
{
map_it mit = mapIndex.find(key);
if(mit == mapIndex.end()) {
mit = mapIndex.emplace(key, it_map_t()).first;
}
it_map_t& mapIt = mit->second;
if(mapIt.count(value) > 0) {
// Don't insert duplicates
return false;
}
if(listItems.size() == nMaxSize) {
PruneLast();
}
listItems.push_front(item_t(key, value));
mapIt.emplace(value, listItems.begin());
return true;
}
bool HasKey(const K& key) const
{
return (mapIndex.find(key) != mapIndex.end());
}
bool Get(const K& key, V& value) const
{
map_cit it = mapIndex.find(key);
if(it == mapIndex.end()) {
return false;
}
const it_map_t& mapIt = it->second;
const item_t& item = *(mapIt.begin()->second);
value = item.value;
return true;
}
bool GetAll(const K& key, std::vector<V>& vecValues)
{
map_cit mit = mapIndex.find(key);
if(mit == mapIndex.end()) {
return false;
}
const it_map_t& mapIt = mit->second;
for(it_map_cit it = mapIt.begin(); it != mapIt.end(); ++it) {
const item_t& item = *(it->second);
vecValues.push_back(item.value);
}
return true;
}
void GetKeys(std::vector<K>& vecKeys)
{
for(map_cit it = mapIndex.begin(); it != mapIndex.end(); ++it) {
vecKeys.push_back(it->first);
}
}
void Erase(const K& key)
{
map_it mit = mapIndex.find(key);
if(mit == mapIndex.end()) {
return;
}
it_map_t& mapIt = mit->second;
for(it_map_it it = mapIt.begin(); it != mapIt.end(); ++it) {
listItems.erase(it->second);
}
mapIndex.erase(mit);
}
void Erase(const K& key, const V& value)
{
map_it mit = mapIndex.find(key);
if(mit == mapIndex.end()) {
return;
}
it_map_t& mapIt = mit->second;
it_map_it it = mapIt.find(value);
if(it == mapIt.end()) {
return;
}
listItems.erase(it->second);
mapIt.erase(it);
if(mapIt.empty()) {
mapIndex.erase(mit);
}
}
const list_t& GetItemList() const {
return listItems;
}
CacheMap<K,V>& operator=(const CacheMap<K,V>& other)
{
nMaxSize = other.nMaxSize;
listItems = other.listItems;
RebuildIndex();
return *this;
}
ADD_SERIALIZE_METHODS;
template <typename Stream, typename Operation>
inline void SerializationOp(Stream& s, Operation ser_action)
{
READWRITE(nMaxSize);
READWRITE(listItems);
if(ser_action.ForRead()) {
RebuildIndex();
}
}
private:
void PruneLast()
{
if(listItems.empty()) {
return;
}
list_it lit = listItems.end();
--lit;
item_t& item = *lit;
map_it mit = mapIndex.find(item.key);
if(mit != mapIndex.end()) {
it_map_t& mapIt = mit->second;
mapIt.erase(item.value);
if(mapIt.empty()) {
mapIndex.erase(item.key);
}
}
listItems.pop_back();
}
void RebuildIndex()
{
mapIndex.clear();
for(list_it lit = listItems.begin(); lit != listItems.end(); ++lit) {
item_t& item = *lit;
map_it mit = mapIndex.find(item.key);
if(mit == mapIndex.end()) {
mit = mapIndex.emplace(item.key, it_map_t()).first;
}
it_map_t& mapIt = mit->second;
mapIt.emplace(item.value, lit);
}
}
};
#endif /* CACHEMULTIMAP_H_ */