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
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* 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
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*/
#ifndef ART_RUNTIME_BASE_HASH_MAP_H_
#define ART_RUNTIME_BASE_HASH_MAP_H_
#include <utility>
#include "hash_set.h"
namespace art {
template <typename Fn>
class HashMapWrapper {
public:
// Hash function.
template <class Key, class Value>
size_t operator()(const std::pair<Key, Value>& pair) const {
return fn_(pair.first);
}
template <class Key>
size_t operator()(const Key& key) const {
return fn_(key);
}
template <class Key, class Value>
bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const {
return fn_(a.first, b.first);
}
template <class Key, class Value, class Element>
bool operator()(const std::pair<Key, Value>& a, const Element& element) const {
return fn_(a.first, element);
}
private:
Fn fn_;
};
template <class Key, class Value, class EmptyFn = DefaultEmptyFn<Key>,
class HashFn = std::hash<Key>, class Pred = std::equal_to<Key>,
class Alloc = std::allocator<std::pair<Key, Value>>>
class HashMap : public HashSet<std::pair<Key, Value>, EmptyFn, HashMapWrapper<HashFn>,
HashMapWrapper<Pred>, Alloc> {
};
} // namespace art
#endif // ART_RUNTIME_BASE_HASH_MAP_H_
|
