1
1
// Protocol Buffers - Google's data interchange format
2
// Copyright 2008 Google Inc.
2
// Copyright 2008 Google Inc. All rights reserved.
3
3
// http://code.google.com/p/protobuf/
5
// Licensed under the Apache License, Version 2.0 (the "License");
6
// you may not use this file except in compliance with the License.
7
// You may obtain a copy of the License at
9
// http://www.apache.org/licenses/LICENSE-2.0
11
// Unless required by applicable law or agreed to in writing, software
12
// distributed under the License is distributed on an "AS IS" BASIS,
13
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14
// See the License for the specific language governing permissions and
15
// limitations under the License.
5
// Redistribution and use in source and binary forms, with or without
6
// modification, are permitted provided that the following conditions are
9
// * Redistributions of source code must retain the above copyright
10
// notice, this list of conditions and the following disclaimer.
11
// * Redistributions in binary form must reproduce the above
12
// copyright notice, this list of conditions and the following disclaimer
13
// in the documentation and/or other materials provided with the
15
// * Neither the name of Google Inc. nor the names of its
16
// contributors may be used to endorse or promote products derived from
17
// this software without specific prior written permission.
19
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
17
31
// Author: kenton@google.com (Kenton Varda)
29
43
#include HASH_MAP_H
30
44
#include HASH_SET_H
32
// TODO(kenton): Deal with non-existence of hash_map somehow. Maybe emulate
34
#error "Your STL implementation lacks hash_map and/or hash_set."
38
52
namespace protobuf {
56
// This system doesn't have hash_map or hash_set. Emulate them using map and
59
// Make hash<T> be the same as less<T>. Note that everywhere where custom
60
// hash functions are defined in the protobuf code, they are also defined such
61
// that they can be used as "less" functions, which is required by MSVC anyway.
62
template <typename Key>
64
// Dummy, just to make derivative hash functions compile.
65
int operator()(const Key& key) {
66
GOOGLE_LOG(FATAL) << "Should never be called.";
70
inline bool operator()(const Key& a, const Key& b) const {
75
// Make sure char* is compared by value.
77
struct hash<const char*> {
78
// Dummy, just to make derivative hash functions compile.
79
int operator()(const char* key) {
80
GOOGLE_LOG(FATAL) << "Should never be called.";
84
inline bool operator()(const char* a, const char* b) const {
85
return strcmp(a, b) < 0;
89
template <typename Key, typename Data,
90
typename HashFcn = hash<Key>,
91
typename EqualKey = int >
92
class hash_map : public std::map<Key, Data, HashFcn> {
95
template <typename Key,
96
typename HashFcn = hash<Key>,
97
typename EqualKey = int >
98
class hash_set : public std::set<Key, HashFcn> {
101
#elif defined(_MSC_VER)
42
103
template <typename Key>
43
104
struct hash : public HASH_NAMESPACE::hash_compare<Key> {