29#ifndef _GLIBCXX_UNORDERED_MAP
30#define _GLIBCXX_UNORDERED_MAP 1
32#pragma GCC system_header
36#if __cplusplus < 201103L
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
56#if __cplusplus >= 201703L
58namespace std _GLIBCXX_VISIBILITY(default)
60_GLIBCXX_BEGIN_NAMESPACE_VERSION
63 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
64 typename _Pred = std::equal_to<_Key>>
67 polymorphic_allocator<pair<const _Key, _Tp>>>;
68 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
69 typename _Pred = std::equal_to<_Key>>
70 using unordered_multimap
72 polymorphic_allocator<pair<const _Key, _Tp>>>;
74_GLIBCXX_END_NAMESPACE_VERSION
78#if __cplusplus > 201703L
79namespace std _GLIBCXX_VISIBILITY(default)
81_GLIBCXX_BEGIN_NAMESPACE_VERSION
82 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
83 typename _Alloc,
typename _Predicate>
85 erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
__cont,
88 _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
90 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
93 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
94 typename _Alloc,
typename _Predicate>
95 inline typename unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>::
97 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
__cont,
100 _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
102 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
104_GLIBCXX_END_NAMESPACE_VERSION
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.