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
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
|
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2015 Red Hat, Inc
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef CEPH_COMPACT_MAP_H
#define CEPH_COMPACT_MAP_H
#include "buffer.h"
#include "encoding.h"
#include <map>
#include <memory>
#include "include/encoding.h"
template <class Key, class T, class Map>
class compact_map_base {
protected:
std::unique_ptr<Map> map;
void alloc_internal() {
if (!map)
map.reset(new Map);
}
void free_internal() {
map.reset();
}
template <class It>
class const_iterator_base {
const compact_map_base *map;
It it;
const_iterator_base() : map(0) { }
const_iterator_base(const compact_map_base* m) : map(m) { }
const_iterator_base(const compact_map_base *m, const It& i) : map(m), it(i) { }
friend class compact_map_base;
friend class iterator_base;
public:
const_iterator_base(const const_iterator_base& o) {
map = o.map;
it = o.it;
}
bool operator==(const const_iterator_base& o) const {
return (map == o.map) && (!map->map || it == o.it);
}
bool operator!=(const const_iterator_base& o) const {
return !(*this == o);;
}
const_iterator_base& operator=(const const_iterator_base& o) {
map = o.map;
it = o.it;
return *this;
}
const_iterator_base& operator++() {
++it;
return *this;
}
const_iterator_base& operator--() {
--it;
return *this;
}
const std::pair<const Key,T>& operator*() {
return *it;
}
const std::pair<const Key,T>* operator->() {
return it.operator->();
}
};
template <class It>
class iterator_base {
private:
const compact_map_base* map;
It it;
iterator_base() : map(0) { }
iterator_base(compact_map_base* m) : map(m) { }
iterator_base(compact_map_base* m, const It& i) : map(m), it(i) { }
friend class compact_map_base;
public:
iterator_base(const iterator_base& o) {
map = o.map;
it = o.it;
}
bool operator==(const iterator_base& o) const {
return (map == o.map) && (!map->map || it == o.it);
}
bool operator!=(const iterator_base& o) const {
return !(*this == o);;
}
iterator_base& operator=(const iterator_base& o) {
map = o.map;
it = o.it;
return *this;
}
iterator_base& operator++() {
++it;
return *this;
}
iterator_base operator++(int) {
iterator_base tmp = *this;
++it;
return tmp;
}
iterator_base& operator--() {
--it;
return *this;
}
std::pair<const Key,T>& operator*() {
return *it;
}
std::pair<const Key,T>* operator->() {
return it.operator->();
}
operator const_iterator_base<It>() const {
return const_iterator_base<It>(map, it);
}
};
public:
class iterator : public iterator_base<typename Map::iterator> {
public:
iterator() { }
iterator(const iterator_base<typename Map::iterator>& o)
: iterator_base<typename Map::iterator>(o) { }
iterator(compact_map_base* m) : iterator_base<typename Map::iterator>(m) { }
iterator(compact_map_base* m, const typename Map::iterator& i)
: iterator_base<typename Map::iterator>(m, i) { }
};
class const_iterator : public const_iterator_base<typename Map::const_iterator> {
public:
const_iterator() { }
const_iterator(const iterator_base<typename Map::const_iterator>& o)
: const_iterator_base<typename Map::const_iterator>(o) { }
const_iterator(const compact_map_base* m) : const_iterator_base<typename Map::const_iterator>(m) { }
const_iterator(const compact_map_base* m, const typename Map::const_iterator& i)
: const_iterator_base<typename Map::const_iterator>(m, i) { }
};
class reverse_iterator : public iterator_base<typename Map::reverse_iterator> {
public:
reverse_iterator() { }
reverse_iterator(const iterator_base<typename Map::reverse_iterator>& o)
: iterator_base<typename Map::reverse_iterator>(o) { }
reverse_iterator(compact_map_base* m) : iterator_base<typename Map::reverse_iterator>(m) { }
reverse_iterator(compact_map_base* m, const typename Map::reverse_iterator& i)
: iterator_base<typename Map::reverse_iterator>(m, i) { }
};
class const_reverse_iterator : public const_iterator_base<typename Map::const_reverse_iterator> {
public:
const_reverse_iterator() { }
const_reverse_iterator(const iterator_base<typename Map::const_reverse_iterator>& o)
: iterator_base<typename Map::const_reverse_iterator>(o) { }
const_reverse_iterator(const compact_map_base* m) : const_iterator_base<typename Map::const_reverse_iterator>(m) { }
const_reverse_iterator(const compact_map_base* m, const typename Map::const_reverse_iterator& i)
: const_iterator_base<typename Map::const_reverse_iterator>(m, i) { }
};
compact_map_base(const compact_map_base& o) {
if (o.map) {
alloc_internal();
*map = *o.map;
}
}
compact_map_base() {}
~compact_map_base() {}
bool empty() const {
return !map || map->empty();
}
size_t size() const {
return map ? map->size() : 0;
}
bool operator==(const compact_map_base& o) const {
return (empty() && o.empty()) || (map && o.map && *map == *o.map);
}
bool operator!=(const compact_map_base& o) const {
return !(*this == o);
}
size_t count (const Key& k) const {
return map ? map->count(k) : 0;
}
iterator erase (iterator p) {
if (map) {
ceph_assert(this == p.map);
auto it = map->erase(p.it);
if (map->empty()) {
free_internal();
return iterator(this);
} else {
return iterator(this, it);
}
} else {
return iterator(this);
}
}
size_t erase (const Key& k) {
if (!map)
return 0;
size_t r = map->erase(k);
if (map->empty())
free_internal();
return r;
}
void clear() {
free_internal();
}
void swap(compact_map_base& o) {
map.swap(o.map);
}
compact_map_base& operator=(const compact_map_base& o) {
if (o.map) {
alloc_internal();
*map = *o.map;
} else
free_internal();
return *this;
}
iterator insert(const std::pair<const Key, T>& val) {
alloc_internal();
return iterator(this, map->insert(val));
}
template <class... Args>
std::pair<iterator,bool> emplace ( Args&&... args ) {
alloc_internal();
auto em = map->emplace(std::forward<Args>(args)...);
return std::pair<iterator,bool>(iterator(this, em.first), em.second);
}
iterator begin() {
if (!map)
return iterator(this);
return iterator(this, map->begin());
}
iterator end() {
if (!map)
return iterator(this);
return iterator(this, map->end());
}
reverse_iterator rbegin() {
if (!map)
return reverse_iterator(this);
return reverse_iterator(this, map->rbegin());
}
reverse_iterator rend() {
if (!map)
return reverse_iterator(this);
return reverse_iterator(this, map->rend());
}
iterator find(const Key& k) {
if (!map)
return iterator(this);
return iterator(this, map->find(k));
}
iterator lower_bound(const Key& k) {
if (!map)
return iterator(this);
return iterator(this, map->lower_bound(k));
}
iterator upper_bound(const Key& k) {
if (!map)
return iterator(this);
return iterator(this, map->upper_bound(k));
}
const_iterator begin() const {
if (!map)
return const_iterator(this);
return const_iterator(this, map->begin());
}
const_iterator end() const {
if (!map)
return const_iterator(this);
return const_iterator(this, map->end());
}
const_reverse_iterator rbegin() const {
if (!map)
return const_reverse_iterator(this);
return const_reverse_iterator(this, map->rbegin());
}
const_reverse_iterator rend() const {
if (!map)
return const_reverse_iterator(this);
return const_reverse_iterator(this, map->rend());
}
const_iterator find(const Key& k) const {
if (!map)
return const_iterator(this);
return const_iterator(this, map->find(k));
}
const_iterator lower_bound(const Key& k) const {
if (!map)
return const_iterator(this);
return const_iterator(this, map->lower_bound(k));
}
const_iterator upper_bound(const Key& k) const {
if (!map)
return const_iterator(this);
return const_iterator(this, map->upper_bound(k));
}
void encode(ceph::buffer::list &bl) const {
using ceph::encode;
if (map)
encode(*map, bl);
else
encode((uint32_t)0, bl);
}
void encode(ceph::buffer::list &bl, uint64_t features) const {
using ceph::encode;
if (map)
encode(*map, bl, features);
else
encode((uint32_t)0, bl);
}
void decode(ceph::buffer::list::const_iterator& p) {
using ceph::decode;
using ceph::decode_nohead;
uint32_t n;
decode(n, p);
if (n > 0) {
alloc_internal();
decode_nohead(n, *map, p);
} else
free_internal();
}
};
template<class Key, class T, class Map>
inline void encode(const compact_map_base<Key, T, Map>& m, ceph::buffer::list& bl) {
m.encode(bl);
}
template<class Key, class T, class Map>
inline void encode(const compact_map_base<Key, T, Map>& m, ceph::buffer::list& bl,
uint64_t features) {
m.encode(bl, features);
}
template<class Key, class T, class Map>
inline void decode(compact_map_base<Key, T, Map>& m, ceph::buffer::list::const_iterator& p) {
m.decode(p);
}
template <class Key, class T, class Compare = std::less<Key>, class Alloc = std::allocator< std::pair<const Key, T> > >
class compact_map : public compact_map_base<Key, T, std::map<Key,T,Compare,Alloc> > {
public:
T& operator[](const Key& k) {
this->alloc_internal();
return (*(this->map))[k];
}
};
template <class Key, class T, class Compare = std::less<Key>, class Alloc = std::allocator< std::pair<const Key, T> > >
inline std::ostream& operator<<(std::ostream& out, const compact_map<Key, T, Compare, Alloc>& m)
{
out << "{";
bool first = true;
for (const auto &p : m) {
if (!first)
out << ",";
out << p.first << "=" << p.second;
first = false;
}
out << "}";
return out;
}
template <class Key, class T, class Compare = std::less<Key>, class Alloc = std::allocator< std::pair<const Key, T> > >
class compact_multimap : public compact_map_base<Key, T, std::multimap<Key,T,Compare,Alloc> > {
};
template <class Key, class T, class Compare = std::less<Key>, class Alloc = std::allocator< std::pair<const Key, T> > >
inline std::ostream& operator<<(std::ostream& out, const compact_multimap<Key, T, Compare, Alloc>& m)
{
out << "{{";
bool first = true;
for (const auto &p : m) {
if (!first)
out << ",";
out << p.first << "=" << p.second;
first = false;
}
out << "}}";
return out;
}
#endif
|
