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
61#if __cplusplus >= 201703L
63namespace std _GLIBCXX_VISIBILITY(default)
65_GLIBCXX_BEGIN_NAMESPACE_VERSION
68 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
69 typename _Pred = std::equal_to<_Key>>
71 = std::unordered_map<_Key, _Tp, _Hash, _Pred,
73 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
74 typename _Pred = std::equal_to<_Key>>
75 using unordered_multimap
76 = std::unordered_multimap<_Key, _Tp, _Hash, _Pred,
79_GLIBCXX_END_NAMESPACE_VERSION
83#if __cplusplus > 201703L
84namespace std _GLIBCXX_VISIBILITY(default)
86_GLIBCXX_BEGIN_NAMESPACE_VERSION
87 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
88 typename _Alloc,
typename _Predicate>
93 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
95 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
98 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
99 typename _Alloc,
typename _Predicate>
105 _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
107 return __detail::__erase_nodes_if(__cont, __ucont, __pred);
109_GLIBCXX_END_NAMESPACE_VERSION
ISO C++ entities toplevel namespace is std.
Class template polymorphic_allocator.
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.