1// <unordered_map> -*- C++ -*-
3// Copyright (C) 2007-2024 Free Software Foundation, Inc.
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)
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.
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.
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/>.
25/** @file include/unordered_map
26 * This is a Standard C++ Library header.
29#ifndef _GLIBCXX_UNORDERED_MAP
30#define _GLIBCXX_UNORDERED_MAP 1
32#pragma GCC system_header
34#include <bits/requires_hosted.h> // container
36#if __cplusplus < 201103L
37# include <bits/c++0x_warning.h>
40#include <initializer_list>
41#include <bits/unordered_map.h>
42#include <bits/range_access.h>
43#include <bits/erase_if.h>
46# include <debug/unordered_map>
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>
57#if __cplusplus >= 201703L
58#include <bits/memory_resource.h>
59namespace std _GLIBCXX_VISIBILITY(default)
61_GLIBCXX_BEGIN_NAMESPACE_VERSION
64 template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
65 typename _Pred = std::equal_to<_Key>>
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>>>;
75_GLIBCXX_END_NAMESPACE_VERSION
79#if __cplusplus > 201703L
80namespace std _GLIBCXX_VISIBILITY(default)
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,
89 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
91 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
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>::
98 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>& __cont,
101 _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
103 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
105_GLIBCXX_END_NAMESPACE_VERSION
111#endif // _GLIBCXX_UNORDERED_MAP