libstdc++: unordered_map Source File

libstdc++

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