48 lines
1.6 KiB
C++
48 lines
1.6 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_SET_FWD_HPP_INCLUDED
|
||
|
|
#define BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
|
||
|
|
|
||
|
|
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
||
|
|
# pragma once
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#include <boost/unordered/detail/fwd.hpp>
|
||
|
|
|
||
|
|
namespace boost
|
||
|
|
{
|
||
|
|
namespace unordered
|
||
|
|
{
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline bool operator==(unordered_set<T, H, P, A> const&,
|
||
|
|
unordered_set<T, H, P, A> const&);
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline bool operator!=(unordered_set<T, H, P, A> const&,
|
||
|
|
unordered_set<T, H, P, A> const&);
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline void swap(unordered_set<T, H, P, A> &m1,
|
||
|
|
unordered_set<T, H, P, A> &m2);
|
||
|
|
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline bool operator==(unordered_multiset<T, H, P, A> const&,
|
||
|
|
unordered_multiset<T, H, P, A> const&);
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline bool operator!=(unordered_multiset<T, H, P, A> const&,
|
||
|
|
unordered_multiset<T, H, P, A> const&);
|
||
|
|
template <class T, class H, class P, class A>
|
||
|
|
inline void swap(unordered_multiset<T, H, P, A> &m1,
|
||
|
|
unordered_multiset<T, H, P, A> &m2);
|
||
|
|
}
|
||
|
|
|
||
|
|
using boost::unordered::unordered_set;
|
||
|
|
using boost::unordered::unordered_multiset;
|
||
|
|
using boost::unordered::swap;
|
||
|
|
using boost::unordered::operator==;
|
||
|
|
using boost::unordered::operator!=;
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif
|