1 // Copyright (c) 2010 Google Inc.
2 // All rights reserved.
3 //
4 // Redistribution and use in source and binary forms, with or without
5 // modification, are permitted provided that the following conditions are
6 // met:
7 //
8 //     * Redistributions of source code must retain the above copyright
9 // notice, this list of conditions and the following disclaimer.
10 //     * Redistributions in binary form must reproduce the above
11 // copyright notice, this list of conditions and the following disclaimer
12 // in the documentation and/or other materials provided with the
13 // distribution.
14 //     * Neither the name of Google Inc. nor the names of its
15 // contributors may be used to endorse or promote products derived from
16 // this software without specific prior written permission.
17 //
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 
30 // Include this file to use unordered_map and unordered_set.  If tr1
31 // or C++11 is not available, you can switch to using hash_set and
32 // hash_map by defining BP_USE_HASH_SET.
33 
34 #ifndef COMMON_UNORDERED_H_
35 #define COMMON_UNORDERED_H_
36 
37 #if defined(BP_USE_HASH_SET)
38 #include <hash_map>
39 #include <hash_set>
40 
41 // For hash<string>.
42 #include "util/hash/hash.h"
43 
44 template <class T, class U, class H = __gnu_cxx::hash<T> >
45 struct unordered_map : public __gnu_cxx::hash_map<T, U, H> {};
46 template <class T, class H = __gnu_cxx::hash<T> >
47 struct unordered_set : public __gnu_cxx::hash_set<T, H> {};
48 
49 #elif defined(_LIBCPP_VERSION)  // c++11
50 #include <unordered_map>
51 #include <unordered_set>
52 using std::unordered_map;
53 using std::unordered_set;
54 
55 #else  // Fallback to tr1::unordered
56 #include <tr1/unordered_map>
57 #include <tr1/unordered_set>
58 using std::tr1::unordered_map;
59 using std::tr1::unordered_set;
60 #endif
61 
62 #endif  // COMMON_UNORDERED_H_
63