]>
Commit | Line | Data |
---|---|---|
b32b8144 FG |
1 | |
2 | // Copyright (C) 2008-2011 Daniel James. | |
f51cf556 | 3 | // Copyright (C) 2022 Christian Mazakas |
b32b8144 FG |
4 | // Distributed under the Boost Software License, Version 1.0. (See accompanying |
5 | // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) | |
6 | ||
7 | #ifndef BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED | |
8 | #define BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED | |
9 | ||
10 | #include <boost/config.hpp> | |
11 | #if defined(BOOST_HAS_PRAGMA_ONCE) | |
12 | #pragma once | |
13 | #endif | |
14 | ||
15 | #include <boost/functional/hash_fwd.hpp> | |
16 | #include <boost/unordered/detail/fwd.hpp> | |
17 | #include <functional> | |
18 | #include <memory> | |
19 | ||
20 | namespace boost { | |
21 | namespace unordered { | |
22 | template <class K, class T, class H = boost::hash<K>, | |
23 | class P = std::equal_to<K>, | |
24 | class A = std::allocator<std::pair<const K, T> > > | |
25 | class unordered_map; | |
26 | ||
27 | template <class K, class T, class H, class P, class A> | |
28 | inline bool operator==( | |
29 | unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&); | |
30 | template <class K, class T, class H, class P, class A> | |
31 | inline bool operator!=( | |
32 | unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&); | |
33 | template <class K, class T, class H, class P, class A> | |
34 | inline void swap( | |
35 | unordered_map<K, T, H, P, A>& m1, unordered_map<K, T, H, P, A>& m2) | |
36 | BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2))); | |
37 | ||
1e59de90 TL |
38 | template <class K, class T, class H, class P, class A, class Predicate> |
39 | typename unordered_map<K, T, H, P, A>::size_type erase_if( | |
40 | unordered_map<K, T, H, P, A>& c, Predicate pred); | |
41 | ||
b32b8144 FG |
42 | template <class K, class T, class H = boost::hash<K>, |
43 | class P = std::equal_to<K>, | |
44 | class A = std::allocator<std::pair<const K, T> > > | |
45 | class unordered_multimap; | |
46 | ||
47 | template <class K, class T, class H, class P, class A> | |
48 | inline bool operator==(unordered_multimap<K, T, H, P, A> const&, | |
49 | unordered_multimap<K, T, H, P, A> const&); | |
50 | template <class K, class T, class H, class P, class A> | |
51 | inline bool operator!=(unordered_multimap<K, T, H, P, A> const&, | |
52 | unordered_multimap<K, T, H, P, A> const&); | |
53 | template <class K, class T, class H, class P, class A> | |
54 | inline void swap(unordered_multimap<K, T, H, P, A>& m1, | |
55 | unordered_multimap<K, T, H, P, A>& m2) | |
56 | BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(m1.swap(m2))); | |
57 | ||
1e59de90 TL |
58 | template <class K, class T, class H, class P, class A, class Predicate> |
59 | typename unordered_multimap<K, T, H, P, A>::size_type erase_if( | |
60 | unordered_multimap<K, T, H, P, A>& c, Predicate pred); | |
61 | ||
b32b8144 | 62 | template <class N, class K, class T, class A> class node_handle_map; |
f51cf556 | 63 | template <class Iter, class NodeType> struct insert_return_type_map; |
b32b8144 FG |
64 | } |
65 | ||
66 | using boost::unordered::unordered_map; | |
67 | using boost::unordered::unordered_multimap; | |
68 | using boost::unordered::swap; | |
69 | using boost::unordered::operator==; | |
70 | using boost::unordered::operator!=; | |
71 | } | |
72 | ||
73 | #endif |