libstdc++
unordered_map
Go to the documentation of this file.
1 // <unordered_map> -*- C++ -*-
2 
3 // Copyright (C) 2007-2024 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 #define __glibcxx_want_erase_if
50 #define __glibcxx_want_generic_unordered_lookup
51 #define __glibcxx_want_node_extract
52 #define __glibcxx_want_nonmember_container_access
53 #define __glibcxx_want_unordered_map_try_emplace
54 #define __glibcxx_want_tuple_like
55 #include <bits/version.h>
56 
57 #if __cplusplus >= 201703L
58 #include <bits/memory_resource.h>
59 namespace std _GLIBCXX_VISIBILITY(default)
60 {
61 _GLIBCXX_BEGIN_NAMESPACE_VERSION
62  namespace pmr
63  {
64  template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
65  typename _Pred = std::equal_to<_Key>>
66  using unordered_map
67  = std::unordered_map<_Key, _Tp, _Hash, _Pred,
68  polymorphic_allocator<pair<const _Key, _Tp>>>;
69  template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
70  typename _Pred = std::equal_to<_Key>>
71  using unordered_multimap
72  = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
73  polymorphic_allocator<pair<const _Key, _Tp>>>;
74  } // namespace pmr
75 _GLIBCXX_END_NAMESPACE_VERSION
76 } // namespace std
77 #endif // C++17
78 
79 #if __cplusplus > 201703L
80 namespace std _GLIBCXX_VISIBILITY(default)
81 {
82 _GLIBCXX_BEGIN_NAMESPACE_VERSION
83  template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
84  typename _Alloc, typename _Predicate>
85  inline typename unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>::size_type
86  erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
87  _Predicate __pred)
88  {
89  _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
90  __ucont = __cont;
91  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
92  }
93 
94  template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
95  typename _Alloc, typename _Predicate>
96  inline typename unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>::
97  size_type
98  erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
99  _Predicate __pred)
100  {
101  _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
102  __ucont = __cont;
103  return __detail::__erase_nodes_if(__cont, __ucont, __pred);
104  }
105 _GLIBCXX_END_NAMESPACE_VERSION
106 } // namespace std
107 #endif // C++20
108 
109 #endif // C++11
110 
111 #endif // _GLIBCXX_UNORDERED_MAP