]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/include/std/unordered_map
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / include / std / unordered_map
1 // <unordered_map> -*- C++ -*-
2
3 // Copyright (C) 2007-2023 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
9 // any later version.
10
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
15
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
19
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
24
25 /** @file include/unordered_map
26 * This is a Standard C++ Library header.
27 */
28
29 #ifndef _GLIBCXX_UNORDERED_MAP
30 #define _GLIBCXX_UNORDERED_MAP 1
31
32 #pragma GCC system_header
33
34 #include <bits/requires_hosted.h> // container
35
36 #if __cplusplus < 201103L
37 # include <bits/c++0x_warning.h>
38 #else
39
40 #include <initializer_list>
41 #include <bits/unordered_map.h>
42 #include <bits/range_access.h>
43 #include <bits/erase_if.h>
44
45 #ifdef _GLIBCXX_DEBUG
46 # include <debug/unordered_map>
47 #endif
48
49 #if __cplusplus >= 201703L
50 #include <bits/memory_resource.h>
51 namespace std _GLIBCXX_VISIBILITY(default)
52 {
53 _GLIBCXX_BEGIN_NAMESPACE_VERSION
54 namespace pmr
55 {
56 template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
57 typename _Pred = std::equal_to<_Key>>
58 using unordered_map
59 = std::unordered_map<_Key, _Tp, _Hash, _Pred,
60 polymorphic_allocator<pair<const _Key, _Tp>>>;
61 template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
62 typename _Pred = std::equal_to<_Key>>
63 using unordered_multimap
64 = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
65 polymorphic_allocator<pair<const _Key, _Tp>>>;
66 } // namespace pmr
67 _GLIBCXX_END_NAMESPACE_VERSION
68 } // namespace std
69 #endif // C++17
70
71 #if __cplusplus > 201703L
72 namespace std _GLIBCXX_VISIBILITY(default)
73 {
74 _GLIBCXX_BEGIN_NAMESPACE_VERSION
75 template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
76 typename _Alloc, typename _Predicate>
77 inline typename unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>::size_type
78 erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
79 _Predicate __pred)
80 {
81 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
82 __ucont = __cont;
83 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
84 }
85
86 template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
87 typename _Alloc, typename _Predicate>
88 inline typename unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>::
89 size_type
90 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
91 _Predicate __pred)
92 {
93 _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
94 __ucont = __cont;
95 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
96 }
97 _GLIBCXX_END_NAMESPACE_VERSION
98 } // namespace std
99 #endif // C++20
100
101 #endif // C++11
102
103 #endif // _GLIBCXX_UNORDERED_MAP