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