safe_multimap.h
3.2 KB
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
/*
* Copyright 2002-2014 the original author or authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* CC/LICENSE
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#pragma once
#include <map>
#include "const_define.h"
using namespace std;
template<class K, class T>
class SafeMultimap {
private:
multimap<K, T> mMultimap;
bgcc::Mutex mLocker;
public:
SafeMultimap();
~SafeMultimap();
bool Empty();
typename multimap<K, T>::size_type Size();
void Clear();
bool Find(const K& key);
bool Find(const K& key, T& value);
void Insert(const K& key, const T& value);
typename multimap<K, T>::size_type Erase(const K& key);
bool EraseSingle(const K& key);
template<class F>
void Remove(F function);
};
template<class K, class T>
SafeMultimap<K, T>::SafeMultimap() {
}
template<class K, class T>
SafeMultimap<K, T>::~SafeMultimap() {
}
template<class K, class T>
bool SafeMultimap<K, T>::Empty() {
SingleLocker s(&mLocker);
return mMultimap.empty();
}
template<class K, class T>
typename multimap<K, T>::size_type SafeMultimap<K, T>::Size() {
SingleLocker s(&mLocker);
return mMultimap.size();
}
template<class K, class T>
void SafeMultimap<K, T>::Clear() {
SingleLocker s(&mLocker);
mMultimap.clear();
}
template<class K, class T>
bool SafeMultimap<K, T>::Find(const K& key) {
SingleLocker s(&mLocker);
typename multimap<K, T>::iterator it = mMultimap.find(key);
return it != mMultimap.end();
}
template<class K, class T>
bool SafeMultimap<K, T>::Find(const K& key, T& value) {
SingleLocker s(&mLocker);
typename multimap<K, T>::iterator it = mMultimap.find(key);
if (it != mMultimap.end()) {
value = it->second;
return true;
}
return false;
}
template<class K, class T>
void SafeMultimap<K, T>::Insert(const K& key, const T& value) {
SingleLocker s(&mLocker);
typename multimap<K, T>::iterator it = mMultimap.insert(typename multimap<K, T>::value_type(key,
value));
}
template<class K, class T>
typename multimap<K, T>::size_type SafeMultimap<K, T>::Erase(const K& key) {
SingleLocker s(&mLocker);
return mMultimap.erase(key);
}
template<class K, class T>
bool SafeMultimap<K, T>::EraseSingle(const K& key) {
SingleLocker s(&mLocker);
typename multimap<K, T>::iterator it = mMultimap.find(key);
if (it != mMultimap.end()) {
mMultimap.erase(it);
return true;
}
return false;
}
template<class K, class T>
template<class F>
void SafeMultimap<K, T>::Remove(F function) {
SingleLocker s(&mLocker);
for (typename multimap<K, T>::iterator it = mMultimap.begin(); it != mMultimap.end();) {
if (function(it->second)) {
mMultimap.erase(it++);
} else {
it++;
}
}
}