63 lines
2.4 KiB
C
63 lines
2.4 KiB
C
|
// Copyright (c) 2010 Google Inc.
|
||
|
|
// All rights reserved.
|
||
|
|
//
|
||
|
|
// Redistribution and use in source and binary forms, with or without
|
||
|
|
// modification, are permitted provided that the following conditions are
|
||
|
|
// met:
|
||
|
|
//
|
||
|
|
// * Redistributions of source code must retain the above copyright
|
||
|
|
// notice, this list of conditions and the following disclaimer.
|
||
|
|
// * Redistributions in binary form must reproduce the above
|
||
|
|
// copyright notice, this list of conditions and the following disclaimer
|
||
|
|
// in the documentation and/or other materials provided with the
|
||
|
|
// distribution.
|
||
|
|
// * Neither the name of Google Inc. nor the names of its
|
||
|
|
// contributors may be used to endorse or promote products derived from
|
||
|
|
// this software without specific prior written permission.
|
||
|
|
//
|
||
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
|
||
|
|
// Include this file to use unordered_map and unordered_set. If tr1
|
||
|
|
// or C++11 is not available, you can switch to using hash_set and
|
||
|
|
// hash_map by defining BP_USE_HASH_SET.
|
||
|
|
|
||
|
|
#ifndef COMMON_UNORDERED_H_
|
||
|
|
#define COMMON_UNORDERED_H_
|
||
|
|
|
||
|
|
#if defined(BP_USE_HASH_SET)
|
||
|
|
#include <hash_map>
|
||
|
|
#include <hash_set>
|
||
|
|
|
||
|
|
// For hash<string>.
|
||
|
|
#include "util/hash/hash.h"
|
||
|
|
|
||
|
|
template <class T, class U, class H = __gnu_cxx::hash<T> >
|
||
|
|
struct unordered_map : public hash_map<T, U, H> {};
|
||
|
|
template <class T, class H = __gnu_cxx::hash<T> >
|
||
|
|
struct unordered_set : public hash_set<T, H> {};
|
||
|
|
|
||
|
|
#elif defined(_LIBCPP_VERSION) // c++11
|
||
|
|
#include <unordered_map>
|
||
|
|
#include <unordered_set>
|
||
|
|
using std::unordered_map;
|
||
|
|
using std::unordered_set;
|
||
|
|
|
||
|
|
#else // Fallback to tr1::unordered
|
||
|
|
#include <tr1/unordered_map>
|
||
|
|
#include <tr1/unordered_set>
|
||
|
|
using std::tr1::unordered_map;
|
||
|
|
using std::tr1::unordered_set;
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif // COMMON_UNORDERED_H_
|