forked from boostorg/unordered
5867994b8c
- Remove use of BOOST_DEDUCED_TYPENAME and BOOST_UNORDERED_PAIR_CAST, it's unlikely that the compilers which require them will be able to cope with the new version of unordered. - Use the old equality algorithm if BOOST_UNORDERED_DEPRECATED_EQUALITY is defined. - Use SFINAE to control which overloads of `construct_impl` are available. Fixes problems with differing overload resolution on different compilers. - Support for piecewise pair construction. - Only support the old variadic pair construction when BOOST_UNORDERED_DEPRECATED_PAIR_CONSTRUCT is defined (also fixed some bugs). - Avoid instantiating BOOST_RV_REF for non-classes. - Support optional allocator member functions for compilers with SFINAE expressions and Visual C++ 9.0/10.0 - Follow boost macro naming conventions. - Improved portability for `allocator_traits` emulation. Current compiler support: - Full support for GCC 4.4+, Visual C++ 9.0+, Clang. - All other compilers odn't support optional allocator members. - No other errors for GCC 3.4.6+, Visual C++ 8.0, Intel, Pathscale. - Visual Age has a compile error if `select_on_container_copy_construction` isn't `const` (it should ignore it). - `select_on_container_copy_construction` detection doesn't work on Sun. - `unnecessary_copy_tests` is failling for vacpp on AIX, but not on linux. - Warnings causing failures for Visual C++ with STLport and WM5. [SVN r74234]
54 lines
1.3 KiB
C++
54 lines
1.3 KiB
C++
|
|
// Copyright (C) 2008-2011 Daniel James.
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#ifndef BOOST_UNORDERED_FWD_HPP_INCLUDED
|
|
#define BOOST_UNORDERED_FWD_HPP_INCLUDED
|
|
|
|
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
|
# pragma once
|
|
#endif
|
|
|
|
#include <boost/config.hpp>
|
|
#include <memory>
|
|
#include <functional>
|
|
#include <boost/functional/hash_fwd.hpp>
|
|
|
|
namespace boost
|
|
{
|
|
namespace unordered
|
|
{
|
|
template <class K,
|
|
class T,
|
|
class H = hash<K>,
|
|
class P = std::equal_to<K>,
|
|
class A = std::allocator<std::pair<const K, T> > >
|
|
class unordered_map;
|
|
|
|
template <class K,
|
|
class T,
|
|
class H = hash<K>,
|
|
class P = std::equal_to<K>,
|
|
class A = std::allocator<std::pair<const K, T> > >
|
|
class unordered_multimap;
|
|
|
|
template <class T,
|
|
class H = hash<T>,
|
|
class P = std::equal_to<T>,
|
|
class A = std::allocator<T> >
|
|
class unordered_set;
|
|
|
|
template <class T,
|
|
class H = hash<T>,
|
|
class P = std::equal_to<T>,
|
|
class A = std::allocator<T> >
|
|
class unordered_multiset;
|
|
|
|
struct piecewise_construct_t {};
|
|
const piecewise_construct_t piecewise_construct = piecewise_construct_t();
|
|
}
|
|
}
|
|
|
|
#endif
|