blob: d3f8f903e16f9b5a12f5e0873a75458164485c5a (
plain) (
blame)
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
|
#ifndef MULTIMAPWDEF
#define MULTIMAPWDEF
#include <map>
using namespace std;
// multmap that still lets you use [] to reference FIRST
// entry of a key if multiples exist
template <class Key, class T, class Compare>
class multimapwithdefault : public multimap<Key, T, Compare> {
public:
typedef pair<const Key, T> value_type;
T& getWithDefault(const Key& k, const T& defaultValue) {
if (find(k) == end()) {
insert(value_type(k, defaultValue));
}
return (*(find(k))).second;
}
T& operator[](const Key& k) {
if (find(k) == end()) {
insert(value_type(k, T()));
}
return (*(find(k))).second;
}
bool has(const Key& k, const T &val) const {
typename multimap<Key, T, Compare>::const_iterator start = lower_bound(k);
typename multimap<Key, T, Compare>::const_iterator end = upper_bound(k);
for (; start!=end; start++) {
if (start->second == val)
return true;
}
return false;
}
};
#endif
|
