29#ifndef _GLIBCXX_UNORDERED_MAP
30#define _GLIBCXX_UNORDERED_MAP 1
33#pragma GCC system_header
38#if __cplusplus < 201103L
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
62#if __cplusplus >= 201703L
64namespace std _GLIBCXX_VISIBILITY(default)
66_GLIBCXX_BEGIN_NAMESPACE_VERSION
69 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
70 typename _Pred = std::equal_to<_Key>>
72 = std::unordered_map<_Key, _Tp, _Hash, _Pred,
74 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
75 typename _Pred = std::equal_to<_Key>>
76 using unordered_multimap
77 = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
80_GLIBCXX_END_NAMESPACE_VERSION
84#ifdef __cpp_lib_erase_if
85namespace std _GLIBCXX_VISIBILITY(default)
87_GLIBCXX_BEGIN_NAMESPACE_VERSION
88 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
89 typename _Alloc,
typename _Predicate>
90 inline typename _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash,
91 _CPred, _Alloc>::size_type
92 erase_if(_GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash,
93 _CPred, _Alloc>& __cont,
95 {
return __detail::__erase_nodes_if(__cont, __cont, __pred); }
97 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
98 typename _Alloc,
typename _Predicate>
99 inline typename _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash,
100 _CPred, _Alloc>::size_type
101 erase_if(_GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash,
102 _CPred, _Alloc>& __cont,
104 {
return __detail::__erase_nodes_if(__cont, __cont, __pred); }
105_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
Class template polymorphic_allocator.