Chris@16
|
1
|
Chris@16
|
2 // Copyright (C) 2008-2011 Daniel James.
|
Chris@16
|
3 // Distributed under the Boost Software License, Version 1.0. (See accompanying
|
Chris@16
|
4 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
Chris@16
|
5
|
Chris@16
|
6 #ifndef BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
|
Chris@16
|
7 #define BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
|
Chris@16
|
8
|
Chris@101
|
9 #include <boost/config.hpp>
|
Chris@101
|
10 #if defined(BOOST_HAS_PRAGMA_ONCE)
|
Chris@101
|
11 #pragma once
|
Chris@16
|
12 #endif
|
Chris@16
|
13
|
Chris@16
|
14 #include <memory>
|
Chris@16
|
15 #include <functional>
|
Chris@16
|
16 #include <boost/functional/hash_fwd.hpp>
|
Chris@16
|
17 #include <boost/unordered/detail/fwd.hpp>
|
Chris@16
|
18
|
Chris@16
|
19 namespace boost
|
Chris@16
|
20 {
|
Chris@16
|
21 namespace unordered
|
Chris@16
|
22 {
|
Chris@16
|
23 template <class T,
|
Chris@16
|
24 class H = boost::hash<T>,
|
Chris@16
|
25 class P = std::equal_to<T>,
|
Chris@16
|
26 class A = std::allocator<T> >
|
Chris@16
|
27 class unordered_set;
|
Chris@16
|
28
|
Chris@16
|
29 template <class T, class H, class P, class A>
|
Chris@16
|
30 inline bool operator==(unordered_set<T, H, P, A> const&,
|
Chris@16
|
31 unordered_set<T, H, P, A> const&);
|
Chris@16
|
32 template <class T, class H, class P, class A>
|
Chris@16
|
33 inline bool operator!=(unordered_set<T, H, P, A> const&,
|
Chris@16
|
34 unordered_set<T, H, P, A> const&);
|
Chris@16
|
35 template <class T, class H, class P, class A>
|
Chris@16
|
36 inline void swap(unordered_set<T, H, P, A> &m1,
|
Chris@16
|
37 unordered_set<T, H, P, A> &m2);
|
Chris@16
|
38
|
Chris@16
|
39 template <class T,
|
Chris@16
|
40 class H = boost::hash<T>,
|
Chris@16
|
41 class P = std::equal_to<T>,
|
Chris@16
|
42 class A = std::allocator<T> >
|
Chris@16
|
43 class unordered_multiset;
|
Chris@16
|
44
|
Chris@16
|
45 template <class T, class H, class P, class A>
|
Chris@16
|
46 inline bool operator==(unordered_multiset<T, H, P, A> const&,
|
Chris@16
|
47 unordered_multiset<T, H, P, A> const&);
|
Chris@16
|
48 template <class T, class H, class P, class A>
|
Chris@16
|
49 inline bool operator!=(unordered_multiset<T, H, P, A> const&,
|
Chris@16
|
50 unordered_multiset<T, H, P, A> const&);
|
Chris@16
|
51 template <class T, class H, class P, class A>
|
Chris@16
|
52 inline void swap(unordered_multiset<T, H, P, A> &m1,
|
Chris@16
|
53 unordered_multiset<T, H, P, A> &m2);
|
Chris@16
|
54 }
|
Chris@16
|
55
|
Chris@16
|
56 using boost::unordered::unordered_set;
|
Chris@16
|
57 using boost::unordered::unordered_multiset;
|
Chris@16
|
58 using boost::unordered::swap;
|
Chris@16
|
59 using boost::unordered::operator==;
|
Chris@16
|
60 using boost::unordered::operator!=;
|
Chris@16
|
61 }
|
Chris@16
|
62
|
Chris@16
|
63 #endif
|