libstdc++
unordered_map
Go to the documentation of this file.
1// <unordered_map> -*- C++ -*-
2
3// Copyright (C) 2007-2025 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#ifdef _GLIBCXX_SYSHDR
33#pragma GCC system_header
34#endif
35
36#include <bits/requires_hosted.h> // container
37
38#if __cplusplus < 201103L
39# include <bits/c++0x_warning.h>
40#else
41
42#include <initializer_list>
43#include <bits/unordered_map.h>
44#include <bits/range_access.h>
45#include <bits/erase_if.h>
46
47#ifdef _GLIBCXX_DEBUG
48# include <debug/unordered_map>
49#endif
50
51#define __glibcxx_want_allocator_traits_is_always_equal
52#define __glibcxx_want_erase_if
53#define __glibcxx_want_generic_unordered_lookup
54#define __glibcxx_want_node_extract
55#define __glibcxx_want_nonmember_container_access
56#define __glibcxx_want_unordered_map_try_emplace
57#define __glibcxx_want_tuple_like
58#include <bits/version.h>
59
60#if __cplusplus >= 201703L
62namespace std _GLIBCXX_VISIBILITY(default)
63{
64_GLIBCXX_BEGIN_NAMESPACE_VERSION
65 namespace pmr
66 {
67 template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
68 typename _Pred = std::equal_to<_Key>>
69 using unordered_map
70 = std::unordered_map<_Key, _Tp, _Hash, _Pred,
71 polymorphic_allocator<pair<const _Key, _Tp>>>;
72 template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
73 typename _Pred = std::equal_to<_Key>>
74 using unordered_multimap
75 = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
76 polymorphic_allocator<pair<const _Key, _Tp>>>;
77 } // namespace pmr
78_GLIBCXX_END_NAMESPACE_VERSION
79} // namespace std
80#endif // C++17
81
82#if __cplusplus > 201703L
83namespace std _GLIBCXX_VISIBILITY(default)
84{
85_GLIBCXX_BEGIN_NAMESPACE_VERSION
86 template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
87 typename _Alloc, typename _Predicate>
89 erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
90 _Predicate __pred)
91 {
92 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
93 __ucont = __cont;
94 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
95 }
96
97 template<typename _Key, typename _Tp, typename _Hash, typename _CPred,
98 typename _Alloc, typename _Predicate>
99 inline typename unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>::
100 size_type
101 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
102 _Predicate __pred)
103 {
104 _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
105 __ucont = __cont;
106 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
107 }
108_GLIBCXX_END_NAMESPACE_VERSION
109} // namespace std
110#endif // C++20
111
112#endif // C++11
113
114#endif // _GLIBCXX_UNORDERED_MAP
ISO C++ entities toplevel namespace is std.
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
A standard container composed of unique keys (containing at most one of each key value) that associat...
_Hashtable::size_type size_type
Iterator-related typedefs.