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