30 #ifndef _UNORDERED_MAP_H
31 #define _UNORDERED_MAP_H
33 namespace std _GLIBCXX_VISIBILITY(default)
35 _GLIBCXX_BEGIN_NAMESPACE_VERSION
36 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
42 template<
typename _Key,
49 _Alloc, __detail::_Select1st,
59 template<
typename _Key,
66 _Alloc, __detail::_Select1st,
72 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
98 template<
typename _Key,
typename _Tp,
114 typedef typename _Hashtable::hasher
hasher;
133 #if __cplusplus > 201402L
134 using node_type =
typename _Hashtable::node_type;
135 using insert_return_type =
typename _Hashtable::insert_return_type;
155 : _M_h(__n, __hf, __eql, __a)
171 template<
typename _InputIterator>
177 : _M_h(__first, __last, __n, __hf, __eql, __a)
202 : _M_h(__umap._M_h, __a)
212 noexcept( noexcept(_Hashtable(std::move(__umap._M_h), __a)) )
213 : _M_h(
std::move(__umap._M_h), __a)
232 : _M_h(__l, __n, __hf, __eql, __a)
244 template<
typename _InputIterator>
251 template<
typename _InputIterator>
299 {
return _M_h.get_allocator(); }
304 _GLIBCXX_NODISCARD
bool
306 {
return _M_h.empty(); }
311 {
return _M_h.size(); }
316 {
return _M_h.max_size(); }
326 {
return _M_h.begin(); }
335 {
return _M_h.begin(); }
339 {
return _M_h.begin(); }
348 {
return _M_h.end(); }
357 {
return _M_h.end(); }
361 {
return _M_h.end(); }
386 template<
typename... _Args>
389 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
417 template<
typename... _Args>
420 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
422 #if __cplusplus > 201402L
427 __glibcxx_assert(__pos !=
end());
428 return _M_h.extract(__pos);
434 {
return _M_h.extract(__key); }
439 {
return _M_h._M_reinsert_node(std::move(__nh)); }
444 {
return _M_h._M_reinsert_node(std::move(__nh)).position; }
446 #define __cpp_lib_unordered_map_try_emplace 201411
469 template <
typename... _Args>
471 try_emplace(
const key_type& __k, _Args&&... __args)
479 std::forward<_Args>(__args)...))
487 template <
typename... _Args>
489 try_emplace(
key_type&& __k, _Args&&... __args)
497 std::forward<_Args>(__args)...))
532 template <
typename... _Args>
542 std::forward<_Args>(__args)...));
547 template <
typename... _Args>
556 std::forward<_Args>(__args)...));
581 {
return _M_h.insert(__x); }
587 {
return _M_h.insert(std::move(__x)); }
589 template<
typename _Pair>
590 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
593 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
620 {
return _M_h.insert(__hint, __x); }
626 {
return _M_h.insert(__hint, std::move(__x)); }
628 template<
typename _Pair>
629 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
iterator>
631 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
643 template<
typename _InputIterator>
645 insert(_InputIterator __first, _InputIterator __last)
646 { _M_h.insert(__first, __last); }
657 { _M_h.insert(__l); }
660 #if __cplusplus > 201402L
661 #define __cpp_lib_unordered_map_insertion 201411 // non-standard macro
682 template <
typename _Obj>
684 insert_or_assign(
const key_type& __k, _Obj&& __obj)
695 (*__i).second = std::forward<_Obj>(__obj);
700 template <
typename _Obj>
702 insert_or_assign(
key_type&& __k, _Obj&& __obj)
713 (*__i).second = std::forward<_Obj>(__obj);
743 template <
typename _Obj>
754 std::forward<_Obj>(__obj)));
756 (*__i).second = std::forward<_Obj>(__obj);
761 template <
typename _Obj>
771 std::forward<_Obj>(__obj)));
773 (*__i).second = std::forward<_Obj>(__obj);
794 {
return _M_h.erase(__position); }
799 {
return _M_h.erase(__position); }
816 {
return _M_h.erase(__x); }
834 {
return _M_h.erase(__first, __last); }
858 noexcept( noexcept(_M_h.swap(__x._M_h)) )
859 { _M_h.swap(__x._M_h); }
861 #if __cplusplus > 201402L
862 template<
typename,
typename,
typename>
863 friend class std::_Hash_merge_helper;
865 template<
typename _H2,
typename _P2>
869 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
870 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
873 template<
typename _H2,
typename _P2>
875 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
878 template<
typename _H2,
typename _P2>
880 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
882 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
883 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
886 template<
typename _H2,
typename _P2>
888 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
898 {
return _M_h.hash_function(); }
904 {
return _M_h.key_eq(); }
922 {
return _M_h.find(__x); }
926 {
return _M_h.find(__x); }
940 {
return _M_h.count(__x); }
942 #if __cplusplus > 201703L
950 {
return _M_h.find(__x) != _M_h.end(); }
964 {
return _M_h.equal_range(__x); }
968 {
return _M_h.equal_range(__x); }
986 {
return _M_h[__k]; }
990 {
return _M_h[std::move(__k)]; }
1003 {
return _M_h.at(__k); }
1007 {
return _M_h.at(__k); }
1015 {
return _M_h.bucket_count(); }
1020 {
return _M_h.max_bucket_count(); }
1029 {
return _M_h.bucket_size(__n); }
1037 bucket(
const key_type& __key)
const
1038 {
return _M_h.bucket(__key); }
1048 {
return _M_h.begin(__n); }
1059 {
return _M_h.begin(__n); }
1063 {
return _M_h.cbegin(__n); }
1074 {
return _M_h.end(__n); }
1085 {
return _M_h.end(__n); }
1089 {
return _M_h.cend(__n); }
1097 {
return _M_h.load_factor(); }
1103 {
return _M_h.max_load_factor(); }
1111 { _M_h.max_load_factor(__z); }
1122 { _M_h.rehash(__n); }
1133 { _M_h.reserve(__n); }
1135 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1142 #if __cpp_deduction_guides >= 201606
1144 template<
typename _InputIterator,
1145 typename _Hash = hash<__iter_key_t<_InputIterator>>,
1146 typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
1147 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
1148 typename = _RequireInputIter<_InputIterator>,
1149 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1150 typename = _RequireNotAllocator<_Pred>,
1151 typename = _RequireAllocator<_Allocator>>
1152 unordered_map(_InputIterator, _InputIterator,
1154 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1155 -> unordered_map<__iter_key_t<_InputIterator>,
1156 __iter_val_t<_InputIterator>,
1157 _Hash, _Pred, _Allocator>;
1159 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
1160 typename _Pred = equal_to<_Key>,
1161 typename _Allocator = allocator<pair<const _Key, _Tp>>,
1162 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1163 typename = _RequireNotAllocator<_Pred>,
1164 typename = _RequireAllocator<_Allocator>>
1165 unordered_map(initializer_list<pair<_Key, _Tp>>,
1167 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1168 -> unordered_map<_Key, _Tp, _Hash, _Pred, _Allocator>;
1170 template<
typename _InputIterator,
typename _Allocator,
1171 typename = _RequireInputIter<_InputIterator>,
1172 typename = _RequireAllocator<_Allocator>>
1173 unordered_map(_InputIterator, _InputIterator,
1175 -> unordered_map<__iter_key_t<_InputIterator>,
1176 __iter_val_t<_InputIterator>,
1177 hash<__iter_key_t<_InputIterator>>,
1178 equal_to<__iter_key_t<_InputIterator>>,
1181 template<
typename _InputIterator,
typename _Allocator,
1182 typename = _RequireInputIter<_InputIterator>,
1183 typename = _RequireAllocator<_Allocator>>
1184 unordered_map(_InputIterator, _InputIterator, _Allocator)
1185 -> unordered_map<__iter_key_t<_InputIterator>,
1186 __iter_val_t<_InputIterator>,
1187 hash<__iter_key_t<_InputIterator>>,
1188 equal_to<__iter_key_t<_InputIterator>>,
1191 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
1192 typename = _RequireInputIter<_InputIterator>,
1193 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1194 typename = _RequireAllocator<_Allocator>>
1195 unordered_map(_InputIterator, _InputIterator,
1198 -> unordered_map<__iter_key_t<_InputIterator>,
1199 __iter_val_t<_InputIterator>, _Hash,
1200 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
1202 template<
typename _Key,
typename _Tp,
typename _Allocator,
1203 typename = _RequireAllocator<_Allocator>>
1204 unordered_map(initializer_list<pair<_Key, _Tp>>,
1207 -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
1209 template<
typename _Key,
typename _Tp,
typename _Allocator,
1210 typename = _RequireAllocator<_Allocator>>
1211 unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)
1212 -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
1214 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
1215 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1216 typename = _RequireAllocator<_Allocator>>
1217 unordered_map(initializer_list<pair<_Key, _Tp>>,
1220 -> unordered_map<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
1247 template<
typename _Key,
typename _Tp,
1248 typename _Hash = hash<_Key>,
1249 typename _Pred = equal_to<_Key>,
1250 typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
1251 class unordered_multimap
1253 typedef __ummap_hashtable<_Key, _Tp, _Hash, _Pred, _Alloc> _Hashtable;
1282 #if __cplusplus > 201402L
1283 using node_type =
typename _Hashtable::node_type;
1303 : _M_h(__n, __hf, __eql, __a)
1319 template<
typename _InputIterator>
1325 : _M_h(__first, __last, __n, __hf, __eql, __a)
1350 : _M_h(__ummap._M_h, __a)
1360 noexcept( noexcept(_Hashtable(std::move(__ummap._M_h), __a)) )
1361 : _M_h(
std::move(__ummap._M_h), __a)
1380 : _M_h(__l, __n, __hf, __eql, __a)
1392 template<
typename _InputIterator>
1399 template<
typename _InputIterator>
1447 {
return _M_h.get_allocator(); }
1452 _GLIBCXX_NODISCARD
bool
1454 {
return _M_h.empty(); }
1459 {
return _M_h.size(); }
1464 {
return _M_h.max_size(); }
1474 {
return _M_h.begin(); }
1483 {
return _M_h.begin(); }
1487 {
return _M_h.begin(); }
1496 {
return _M_h.end(); }
1505 {
return _M_h.end(); }
1509 {
return _M_h.end(); }
1529 template<
typename... _Args>
1532 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1556 template<
typename... _Args>
1559 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1573 {
return _M_h.insert(__x); }
1577 {
return _M_h.insert(std::move(__x)); }
1579 template<
typename _Pair>
1580 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
iterator>
1582 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
1607 {
return _M_h.insert(__hint, __x); }
1613 {
return _M_h.insert(__hint, std::move(__x)); }
1615 template<
typename _Pair>
1616 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
iterator>
1618 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
1630 template<
typename _InputIterator>
1632 insert(_InputIterator __first, _InputIterator __last)
1633 { _M_h.insert(__first, __last); }
1645 { _M_h.insert(__l); }
1647 #if __cplusplus > 201402L
1652 __glibcxx_assert(__pos !=
end());
1653 return _M_h.extract(__pos);
1659 {
return _M_h.extract(__key); }
1664 {
return _M_h._M_reinsert_node_multi(
cend(), std::move(__nh)); }
1669 {
return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }
1688 {
return _M_h.erase(__position); }
1693 {
return _M_h.erase(__position); }
1709 {
return _M_h.erase(__x); }
1728 {
return _M_h.erase(__first, __last); }
1752 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1753 { _M_h.swap(__x._M_h); }
1755 #if __cplusplus > 201402L
1756 template<
typename,
typename,
typename>
1757 friend class std::_Hash_merge_helper;
1759 template<
typename _H2,
typename _P2>
1764 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1765 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1768 template<
typename _H2,
typename _P2>
1770 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1771 { merge(__source); }
1773 template<
typename _H2,
typename _P2>
1775 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1778 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1779 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1782 template<
typename _H2,
typename _P2>
1784 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1785 { merge(__source); }
1794 {
return _M_h.hash_function(); }
1800 {
return _M_h.key_eq(); }
1818 {
return _M_h.find(__x); }
1822 {
return _M_h.find(__x); }
1832 {
return _M_h.count(__x); }
1834 #if __cplusplus > 201703L
1841 contains(
const key_type& __x)
const
1842 {
return _M_h.find(__x) != _M_h.end(); }
1854 {
return _M_h.equal_range(__x); }
1858 {
return _M_h.equal_range(__x); }
1866 {
return _M_h.bucket_count(); }
1871 {
return _M_h.max_bucket_count(); }
1880 {
return _M_h.bucket_size(__n); }
1888 bucket(
const key_type& __key)
const
1889 {
return _M_h.bucket(__key); }
1899 {
return _M_h.begin(__n); }
1910 {
return _M_h.begin(__n); }
1914 {
return _M_h.cbegin(__n); }
1925 {
return _M_h.end(__n); }
1936 {
return _M_h.end(__n); }
1940 {
return _M_h.cend(__n); }
1948 {
return _M_h.load_factor(); }
1954 {
return _M_h.max_load_factor(); }
1962 { _M_h.max_load_factor(__z); }
1973 { _M_h.rehash(__n); }
1984 { _M_h.reserve(__n); }
1986 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1990 _Hash1, _Pred1, _Alloc1>&,
1992 _Hash1, _Pred1, _Alloc1>&);
1995 #if __cpp_deduction_guides >= 201606
1997 template<
typename _InputIterator,
1998 typename _Hash = hash<__iter_key_t<_InputIterator>>,
1999 typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
2000 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
2001 typename = _RequireInputIter<_InputIterator>,
2002 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2003 typename = _RequireNotAllocator<_Pred>,
2004 typename = _RequireAllocator<_Allocator>>
2005 unordered_multimap(_InputIterator, _InputIterator,
2007 _Hash = _Hash(), _Pred = _Pred(),
2008 _Allocator = _Allocator())
2009 -> unordered_multimap<__iter_key_t<_InputIterator>,
2010 __iter_val_t<_InputIterator>, _Hash, _Pred,
2013 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
2014 typename _Pred = equal_to<_Key>,
2015 typename _Allocator = allocator<pair<const _Key, _Tp>>,
2016 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2017 typename = _RequireNotAllocator<_Pred>,
2018 typename = _RequireAllocator<_Allocator>>
2019 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2021 _Hash = _Hash(), _Pred = _Pred(),
2022 _Allocator = _Allocator())
2023 -> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Allocator>;
2025 template<
typename _InputIterator,
typename _Allocator,
2026 typename = _RequireInputIter<_InputIterator>,
2027 typename = _RequireAllocator<_Allocator>>
2028 unordered_multimap(_InputIterator, _InputIterator,
2030 -> unordered_multimap<__iter_key_t<_InputIterator>,
2031 __iter_val_t<_InputIterator>,
2032 hash<__iter_key_t<_InputIterator>>,
2033 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2035 template<
typename _InputIterator,
typename _Allocator,
2036 typename = _RequireInputIter<_InputIterator>,
2037 typename = _RequireAllocator<_Allocator>>
2038 unordered_multimap(_InputIterator, _InputIterator, _Allocator)
2039 -> unordered_multimap<__iter_key_t<_InputIterator>,
2040 __iter_val_t<_InputIterator>,
2041 hash<__iter_key_t<_InputIterator>>,
2042 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2044 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
2045 typename = _RequireInputIter<_InputIterator>,
2046 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2047 typename = _RequireAllocator<_Allocator>>
2048 unordered_multimap(_InputIterator, _InputIterator,
2051 -> unordered_multimap<__iter_key_t<_InputIterator>,
2052 __iter_val_t<_InputIterator>, _Hash,
2053 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2055 template<
typename _Key,
typename _Tp,
typename _Allocator,
2056 typename = _RequireAllocator<_Allocator>>
2057 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2060 -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2062 template<
typename _Key,
typename _Tp,
typename _Allocator,
2063 typename = _RequireAllocator<_Allocator>>
2064 unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
2065 -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2067 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
2068 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2069 typename = _RequireAllocator<_Allocator>>
2070 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2073 -> unordered_multimap<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
2077 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2079 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2080 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2081 noexcept(noexcept(__x.swap(__y)))
2084 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2086 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2087 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2088 noexcept(noexcept(__x.swap(__y)))
2091 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2093 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2094 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2095 {
return __x._M_h._M_equal(__y._M_h); }
2097 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2099 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2100 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2101 {
return !(__x == __y); }
2103 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2105 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2106 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2107 {
return __x._M_h._M_equal(__y._M_h); }
2109 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2111 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2112 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2113 {
return !(__x == __y); }
2115 _GLIBCXX_END_NAMESPACE_CONTAINER
2117 #if __cplusplus > 201402L
2119 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2120 typename _Alloc,
typename _Hash2,
typename _Eq2>
2121 struct _Hash_merge_helper<
2122 _GLIBCXX_STD_C::unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2126 template<
typename... _Tp>
2127 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2128 template<
typename... _Tp>
2129 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2131 friend unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2134 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2135 {
return __map._M_h; }
2138 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2139 {
return __map._M_h; }
2143 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2144 typename _Alloc,
typename _Hash2,
typename _Eq2>
2145 struct _Hash_merge_helper<
2146 _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2150 template<
typename... _Tp>
2151 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2152 template<
typename... _Tp>
2153 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2155 friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2158 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2159 {
return __map._M_h; }
2162 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2163 {
return __map._M_h; }
2167 _GLIBCXX_END_NAMESPACE_VERSION