29#ifndef _GLIBCXX_UNORDERED_MAP
30#define _GLIBCXX_UNORDERED_MAP 1
32#pragma GCC system_header
34#if __cplusplus < 201103L
55#if __cplusplus >= 201703L
56namespace std _GLIBCXX_VISIBILITY(default)
58_GLIBCXX_BEGIN_NAMESPACE_VERSION
61 template<
typename _Tp>
class polymorphic_allocator;
62 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
63 typename _Pred = std::equal_to<_Key>>
66 polymorphic_allocator<pair<const _Key, _Tp>>>;
67 template<
typename _Key,
typename _Tp,
typename _Hash = std::hash<_Key>,
68 typename _Pred = std::equal_to<_Key>>
69 using unordered_multimap
71 polymorphic_allocator<pair<const _Key, _Tp>>>;
73_GLIBCXX_END_NAMESPACE_VERSION
77#if __cplusplus > 201703L
78namespace std _GLIBCXX_VISIBILITY(default)
80_GLIBCXX_BEGIN_NAMESPACE_VERSION
81 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
82 typename _Alloc,
typename _Predicate>
84 erase_if(unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
__cont,
87 const _GLIBCXX_STD_C::unordered_map<_Key, _Tp, _Hash, _CPred, _Alloc>&
89 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
92 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _CPred,
93 typename _Alloc,
typename _Predicate>
94 inline typename unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>::
96 erase_if(unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
__cont,
99 const _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _CPred, _Alloc>&
101 return __detail::__erase_nodes_if(
__cont, __ucont, __pred);
103_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.