-
Notifications
You must be signed in to change notification settings - Fork 0
/
bimap.h
365 lines (305 loc) · 7.46 KB
/
bimap.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
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
#ifndef BIMAP_H
#define BIMAP_H
#include <map>
#include <set>
#include <utility>
#include <iterator>
using namespace std;
template<class Key, class T, class Cmp_key = less<Key>, class Cmp_value = less<T>, class A = allocator<pair<const Key, T> > >
class BiMap
{
map<key_type, mapped_type, Cmp_key, A> _left;
map<mapped_type, key_type, Cmp_value, A> _right;
public:
typedef Key key_type;
typedef T mapped_type;
typedef pair<const Key, T> value_type;
typedef pair<const T, Key> value_type_right;
typedef Cmp_key key_compare;
typedef Cmp_value value_compare;
typedef A allocator_type;
typedef typename A::reference reference;
typedef typename A::const_reference const_reference;
struct iterator
{
typedef typename std::map<key_type, mapped_type, key_compare, allocator_type>::iterator Iter;
iterator() : _iter() {}
iterator(value_type* p) : _iter(p) {}
iterator(const iterator& other) : _iter(other._iter) {}
iterator(const Iter& other) : _iter(other) {};
iterator& operator =(const iterator& other)
{
if (this != &other) {
_iter = other._iter;
}
return *this;
}
iterator& operator ++()
{
++_iter;
return *this;
}
iterator operator ++(int)
{
iterator tmp(*this);
++(*this);
return tmp;
}
bool operator == (iterator const& i)
{
return *(_iter) == *(i._iter);
}
bool operator != (iterator const& i)
{
return !(*this == i);
}
reference operator *() { return *(_iter); }
value_type* operator ->() { return &(*_iter); }
Iter get_iter()
{
return _iter;
}
Iter get_iter() const
{
return _iter;
}
void change_iter(Iter tmp)
{
_iter = tmp;
}
private:
Iter _iter;
};
//òèïû
typedef const iterator const_iterator; //tmp
typedef typename A::size_type size_type;
typedef typename A::difference_type difference_type;
typedef std::reverse_iterator<iterator> reverse_iterator;//tmp
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;//tmp
//èòåðàòîðû
iterator begin()
{
iterator tmp;
tmp.change_iter(_left.begin());
return tmp;
}
const_iterator begin() const
{
const_iterator tmp;
tmp.change_iter(_left.begin());
return tmp;
}
iterator end()
{
iterator tmp;
tmp.change_iter(_left.end());
return tmp;
}
const_iterator end() const
{
const_iterator tmp;
tmp.change_iter(_left.end());
return tmp;
}
reverse_iterator rbegin()
{
reverse_iterator tmp;
tmp.change_iter(_left.rbegin());
return tmp;
}
const_reverse_iterator rbegin() const
{
const_reverse_iterator tmp;
tmp.change_iter = (_left.rbegin());
return tmp;
}
reverse_iterator rend()
{
reverse_iterator tmp;
tmp.change_iter(_left.rend());
return tmp;
}
const_reverse_iterator rend() const
{
const_reverse_iterator tmp;
tmp.change_iter(_left.rend());
return tmp;
}
// äîñòóï ê ýëåìåíòó ñ êëþ÷îì k
mapped_type& operator[] (const key_type& k)
{
return _left.find(k)->second;
}
//êîíñòðóêòîðû
explicit BiMap(const Cmp_key& ck = Cmp_key(), const Cmp_value& cv = Cmp_value(), const A& a = A()) : _left(ck, a), _right(cv, a) {} //empty
template <class InputIterator>
BiMap(InputIterator first, InputIterator last,
const key_compare& ck = key_compare(),
const value_compare& cv = value_compare(),
const allocator_type& a = allocator_type()) : _left(ck, a), _right(cv, a) //range
{
insert(first, last);
}
BiMap(const BiMap& x) : _left(x._left), _right(x._right) {} //copy
~BiMap()
{
_left.~map();
_right.~map();
}
BiMap& operator= (const BiMap& x)
{
_left = x._left;
_right = x._right;
return *this;
}
// íàõîäèò ýëåìåíò ñ êëþ÷îì k
iterator find(const key_type& k)
{
iterator tmp(_left.find(k));
return tmp;
}
const_iterator find(const key_type& k) const
{
const_iterator tmp(_left.find(k));
return tmp;
}
// íàõîäèò ýëåìåíò ïî çíà÷åíèþ m
iterator find_value(const mapped_type& m)
{
iterator tmp(_left.find(_right.find(m)->second));
return tmp;
}
const_iterator find_value(const mapped_type& m) const
{
const_iterator tmp(_left.find(_right.find(m)->second));
return tmp;
}
pair<iterator, bool> insert(const value_type& val) //âñòàâèòü ïàðó (key, value)
{
if ((find(val.first).get_iter() == _left.end()) && (_right.find(val.second) == _right.end())) {
_left.insert(val);
const value_type_right tmp = make_pair(val.second, val.first);
_right.insert(tmp);
return make_pair(find(val.first), true);
}
else {
return make_pair(end(), false);
}
}
iterator insert(iterator position, const value_type& val)
{
if (find(val.first) == _left.end() && find_value(val.second) == _right.end()) {
_left.insert(position._iter, val);
_right.insert(val.swap());
return find(val.first);
}
return end();
}
//âñòàâèòü ýëåìåíòû èç ïîñëåäîâàòåëüíîñòè
template <class InputIterator>
void insert(InputIterator first, InputIterator last)
{
while (first != last) {
insert(*first);
++first;
}
}
//óäàëèòü âûáðàííûé ýëåìåíò
void erase(iterator pos)
{
if (find(*pos) != end())
{
_left.erase(pos->first);
_right.erase(pos->second);
}
}
//óäàëèòü ýëåìåíò ñ êëþ÷îì k
void erase(const key_type& k)
{
erase(find(k));
}
//óäàëèòü äèàïàçîí
void erase(iterator first, iterator last)
{
while (first != last) {
iterator tmp = ++first;
erase(first);
first = tmp;
}
}
//óäàëèòü ýëåìåíò ñî çíà÷åíèåì m
void erase_value(const mapped_type& m)
{
erase(find_value(m));
}
//óäàëèòü âñå ýëåìåíòû
void clear()
{
_left.clear();
_right.clear();
}
//÷èñëî ýëåìåíòîâ
size_type size() const
{
return _left.size();
}
// ðàçìåð ìàêñèìàëüíî âîçìîæíîãî BiMap
size_type max_size() const
{
return _left.max_size();
}
// ïðîâåðêà ïóñòîòû bimap-à
bool empty() const
{
return size() == 0;
}
//çàìåíà
void swap(BiMap& x)
{
BiMap c(x);
x = *this;
*this = c;
}
const map<key_type, mapped_type, Cmp_key, A>& get_left() const
{
return _left;
}
};
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator== (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() == rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator!= (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() != rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator< (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() < rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator<= (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() <= rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator> (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() > rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
bool operator>= (const BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, const BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
return lhs.get_left() >= rhs.get_left();
}
template <class Key, class T, class Cmp_key, class Cmp_value, class A>
void swap(BiMap<Key, T, Cmp_key, Cmp_value, A>& lhs, BiMap<Key, T, Cmp_key, Cmp_value, A>& rhs)
{
BiMap<Key, T, Cmp_key, Cmp_value, A> c(lhs);
lhs = rhs;
rhs = c;
}
#endif