30#ifndef _UNORDERED_MAP_H
31#define _UNORDERED_MAP_H
37#if __glibcxx_containers_ranges
41namespace std _GLIBCXX_VISIBILITY(default)
43_GLIBCXX_BEGIN_NAMESPACE_VERSION
44_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
50 template<
typename _Key,
57 _Alloc, __detail::_Select1st,
59 __detail::_Mod_range_hashing,
60 __detail::_Default_ranged_hash,
61 __detail::_Prime_rehash_policy,
_Tr>;
67 template<
typename _Key,
74 _Alloc, __detail::_Select1st,
76 __detail::_Mod_range_hashing,
77 __detail::_Default_ranged_hash,
78 __detail::_Prime_rehash_policy,
_Tr>;
80 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
108 template<
typename _Key,
typename _Tp,
124 typedef typename _Hashtable::hasher
hasher;
143#ifdef __glibcxx_node_extract
144 using node_type =
typename _Hashtable::node_type;
145 using insert_return_type =
typename _Hashtable::insert_return_type;
181 template<
typename _InputIterator>
187 : _M_h(__first, __last, __n,
__hf,
__eql, __a)
222 noexcept(
noexcept(_Hashtable(
std::move(__umap._M_h), __a)) )
254 template<
typename _InputIterator>
261 template<
typename _InputIterator>
280#if __glibcxx_containers_ranges
294 template<__detail::__container_compatible_range<value_type> _Rg>
300 : _M_h(__n, __hf, __eql, __a)
305 template<__detail::__container_compatible_range<value_type> _Rg>
310 template<__detail::__container_compatible_range<value_type> _Rg>
316 template<__detail::__container_compatible_range<value_type> _Rg>
352 {
return _M_h.get_allocator(); }
357 _GLIBCXX_NODISCARD
bool
359 {
return _M_h.empty(); }
364 {
return _M_h.size(); }
369 {
return _M_h.max_size(); }
379 {
return _M_h.begin(); }
388 {
return _M_h.begin(); }
392 {
return _M_h.begin(); }
401 {
return _M_h.end(); }
410 {
return _M_h.end(); }
414 {
return _M_h.end(); }
439 template<
typename...
_Args>
470 template<
typename...
_Args>
475#ifdef __glibcxx_node_extract
481 return _M_h.extract(
__pos);
487 {
return _M_h.extract(
__key); }
500#ifdef __glibcxx_unordered_map_try_emplace
523 template <
typename...
_Args>
531 template <
typename...
_Args>
567 template <
typename... _Args>
577 template <
typename...
_Args>
606 {
return _M_h.insert(__x); }
614 template<
typename _Pair>
645 {
return _M_h.insert(
__hint, __x); }
653 template<
typename _Pair>
668 template<
typename _InputIterator>
671 { _M_h.insert(__first, __last); }
682 { _M_h.insert(
__l); }
684#if __glibcxx_containers_ranges
691 template<__detail::__container_compatible_range<value_type> _Rg>
695 auto __first = ranges::begin(
__rg);
696 const auto __last = ranges::end(
__rg);
697 for (; __first != __last; ++__first)
698 _M_h.emplace(*__first);
702#ifdef __glibcxx_unordered_map_try_emplace
723 template <
typename _Obj>
735 template <
typename _Obj>
772 template <
typename _Obj>
784 template <
typename _Obj>
834 {
return _M_h.erase(__x); }
852 {
return _M_h.erase(__first, __last); }
876 noexcept(
noexcept(_M_h.swap(__x._M_h)) )
877 { _M_h.swap(__x._M_h); }
879#ifdef __glibcxx_node_extract
880 template<
typename,
typename,
typename>
881 friend class std::_Hash_merge_helper;
883 template<
typename _H2,
typename _P2>
892 _M_h._M_merge_unique(_Merge_helper::_S_get_table(
__source));
895 template<
typename _H2,
typename _P2>
897 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
899 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
900 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
903 template<
typename _H2,
typename _P2>
905 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
907 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
908 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
911 template<
typename _H2,
typename _P2>
913 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
923 {
return _M_h.hash_function(); }
929 {
return _M_h.key_eq(); }
947 {
return _M_h.find(__x); }
949#if __cplusplus > 201703L
950 template<
typename _Kt>
952 find(
const _Kt& __x) ->
decltype(_M_h._M_find_tr(__x))
953 {
return _M_h._M_find_tr(__x); }
958 {
return _M_h.find(__x); }
960#if __cplusplus > 201703L
961 template<
typename _Kt>
963 find(
const _Kt& __x)
const ->
decltype(_M_h._M_find_tr(__x))
964 {
return _M_h._M_find_tr(__x); }
980 {
return _M_h.count(__x); }
982#if __cplusplus > 201703L
983 template<
typename _Kt>
985 count(
const _Kt& __x)
const ->
decltype(_M_h._M_count_tr(__x))
986 {
return _M_h._M_count_tr(__x); }
990#if __cplusplus > 201703L
999 {
return _M_h.find(__x) != _M_h.end(); }
1001 template<
typename _Kt>
1004 ->
decltype(_M_h._M_find_tr(__x),
void(),
true)
1005 {
return _M_h._M_find_tr(__x) != _M_h.end(); }
1020 {
return _M_h.equal_range(__x); }
1022#if __cplusplus > 201703L
1023 template<
typename _Kt>
1026 ->
decltype(_M_h._M_equal_range_tr(__x))
1027 {
return _M_h._M_equal_range_tr(__x); }
1032 {
return _M_h.equal_range(__x); }
1034#if __cplusplus > 201703L
1035 template<
typename _Kt>
1038 ->
decltype(_M_h._M_equal_range_tr(__x))
1039 {
return _M_h._M_equal_range_tr(__x); }
1058 {
return _M_h[
__k]; }
1075 {
return _M_h.at(
__k); }
1079 {
return _M_h.at(
__k); }
1087 {
return _M_h.bucket_count(); }
1092 {
return _M_h.max_bucket_count(); }
1101 {
return _M_h.bucket_size(__n); }
1109 bucket(
const key_type& __key)
const
1110 {
return _M_h.bucket(__key); }
1120 {
return _M_h.begin(__n); }
1131 {
return _M_h.begin(__n); }
1135 {
return _M_h.cbegin(__n); }
1146 {
return _M_h.end(__n); }
1157 {
return _M_h.end(__n); }
1161 {
return _M_h.cend(__n); }
1169 {
return _M_h.load_factor(); }
1175 {
return _M_h.max_load_factor(); }
1183 { _M_h.max_load_factor(
__z); }
1194 { _M_h.rehash(__n); }
1205 { _M_h.reserve(__n); }
1214#if __cpp_deduction_guides >= 201606
1216 template<
typename _InputIterator,
1217 typename _Hash = hash<__iter_key_t<_InputIterator>>,
1218 typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
1219 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
1220 typename = _RequireInputIter<_InputIterator>,
1221 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1222 typename = _RequireNotAllocator<_Pred>,
1223 typename = _RequireAllocator<_Allocator>>
1224 unordered_map(_InputIterator, _InputIterator,
1226 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1227 -> unordered_map<__iter_key_t<_InputIterator>,
1228 __iter_val_t<_InputIterator>,
1229 _Hash, _Pred, _Allocator>;
1231 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
1232 typename _Pred = equal_to<_Key>,
1233 typename _Allocator = allocator<pair<const _Key, _Tp>>,
1234 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1235 typename = _RequireNotAllocator<_Pred>,
1236 typename = _RequireAllocator<_Allocator>>
1237 unordered_map(initializer_list<pair<_Key, _Tp>>,
1239 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1240 -> unordered_map<_Key, _Tp, _Hash, _Pred, _Allocator>;
1242 template<
typename _InputIterator,
typename _Allocator,
1243 typename = _RequireInputIter<_InputIterator>,
1244 typename = _RequireAllocator<_Allocator>>
1245 unordered_map(_InputIterator, _InputIterator,
1247 -> unordered_map<__iter_key_t<_InputIterator>,
1248 __iter_val_t<_InputIterator>,
1249 hash<__iter_key_t<_InputIterator>>,
1250 equal_to<__iter_key_t<_InputIterator>>,
1253 template<
typename _InputIterator,
typename _Allocator,
1254 typename = _RequireInputIter<_InputIterator>,
1255 typename = _RequireAllocator<_Allocator>>
1256 unordered_map(_InputIterator, _InputIterator, _Allocator)
1257 -> unordered_map<__iter_key_t<_InputIterator>,
1258 __iter_val_t<_InputIterator>,
1259 hash<__iter_key_t<_InputIterator>>,
1260 equal_to<__iter_key_t<_InputIterator>>,
1263 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
1264 typename = _RequireInputIter<_InputIterator>,
1265 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1266 typename = _RequireAllocator<_Allocator>>
1267 unordered_map(_InputIterator, _InputIterator,
1270 -> unordered_map<__iter_key_t<_InputIterator>,
1271 __iter_val_t<_InputIterator>, _Hash,
1272 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
1274 template<
typename _Key,
typename _Tp,
typename _Allocator,
1275 typename = _RequireAllocator<_Allocator>>
1276 unordered_map(initializer_list<pair<_Key, _Tp>>,
1279 -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
1281 template<
typename _Key,
typename _Tp,
typename _Allocator,
1282 typename = _RequireAllocator<_Allocator>>
1283 unordered_map(initializer_list<pair<_Key, _Tp>>, _Allocator)
1284 -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
1286 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
1287 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1288 typename = _RequireAllocator<_Allocator>>
1289 unordered_map(initializer_list<pair<_Key, _Tp>>,
1292 -> unordered_map<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
1294#if __glibcxx_containers_ranges
1295 template<ranges::input_range _Rg,
1296 __not_allocator_like _Hash = hash<__detail::__range_key_type<_Rg>>,
1297 __not_allocator_like _Pred = equal_to<__detail::__range_key_type<_Rg>>,
1298 __allocator_like _Allocator =
1299 allocator<__detail::__range_to_alloc_type<_Rg>>>
1301 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1302 -> unordered_map<__detail::__range_key_type<_Rg>,
1303 __detail::__range_mapped_type<_Rg>,
1304 _Hash, _Pred, _Allocator>;
1306 template<ranges::input_range _Rg,
1307 __allocator_like _Allocator>
1310 -> unordered_map<__detail::__range_key_type<_Rg>,
1311 __detail::__range_mapped_type<_Rg>,
1312 hash<__detail::__range_key_type<_Rg>>,
1313 equal_to<__detail::__range_key_type<_Rg>>,
1316 template<ranges::input_range _Rg,
1317 __allocator_like _Allocator>
1318 unordered_map(from_range_t, _Rg&&, _Allocator)
1319 -> unordered_map<__detail::__range_key_type<_Rg>,
1320 __detail::__range_mapped_type<_Rg>,
1321 hash<__detail::__range_key_type<_Rg>>,
1322 equal_to<__detail::__range_key_type<_Rg>>,
1325 template<ranges::input_range _Rg,
1326 __not_allocator_like _Hash,
1327 __allocator_like _Allocator>
1330 -> unordered_map<__detail::__range_key_type<_Rg>,
1331 __detail::__range_mapped_type<_Rg>,
1332 _Hash, equal_to<__detail::__range_key_type<_Rg>>,
1362 template<
typename _Key,
typename _Tp,
1363 typename _Hash = hash<_Key>,
1364 typename _Pred = equal_to<_Key>,
1365 typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
1397#ifdef __glibcxx_node_extract
1398 using node_type =
typename _Hashtable::node_type;
1434 template<
typename _InputIterator>
1440 : _M_h(__first, __last, __n,
__hf,
__eql, __a)
1475 noexcept(
noexcept(_Hashtable(
std::move(__ummap._M_h), __a)) )
1507 template<
typename _InputIterator>
1514 template<
typename _InputIterator>
1533#if __glibcxx_containers_ranges
1547 template<__detail::__container_compatible_range<value_type> _Rg>
1553 : _M_h(__n, __hf, __eql, __a)
1558 template<__detail::__container_compatible_range<value_type> _Rg>
1563 template<__detail::__container_compatible_range<value_type> _Rg>
1569 template<__detail::__container_compatible_range<value_type> _Rg>
1605 {
return _M_h.get_allocator(); }
1610 _GLIBCXX_NODISCARD
bool
1612 {
return _M_h.empty(); }
1617 {
return _M_h.size(); }
1622 {
return _M_h.max_size(); }
1632 {
return _M_h.begin(); }
1641 {
return _M_h.begin(); }
1645 {
return _M_h.begin(); }
1654 {
return _M_h.end(); }
1663 {
return _M_h.end(); }
1667 {
return _M_h.end(); }
1687 template<
typename...
_Args>
1714 template<
typename...
_Args>
1731 {
return _M_h.insert(__x); }
1737 template<
typename _Pair>
1765 {
return _M_h.insert(
__hint, __x); }
1773 template<
typename _Pair>
1788 template<
typename _InputIterator>
1791 { _M_h.insert(__first, __last); }
1803 { _M_h.insert(
__l); }
1805#if __glibcxx_containers_ranges
1812 template<__detail::__container_compatible_range<value_type> _Rg>
1816 auto __first = ranges::begin(
__rg);
1817 const auto __last = ranges::end(
__rg);
1818 if (__first == __last)
1821 if constexpr (ranges::forward_range<_Rg> || ranges::sized_range<_Rg>)
1824 _M_h._M_rehash_insert(1);
1826 for (; __first != __last; ++__first)
1827 _M_h.emplace(*__first);
1831#ifdef __glibcxx_node_extract
1837 return _M_h.extract(
__pos);
1843 {
return _M_h.extract(
__key); }
1893 {
return _M_h.erase(__x); }
1912 {
return _M_h.erase(__first, __last); }
1936 noexcept(
noexcept(_M_h.swap(__x._M_h)) )
1937 { _M_h.swap(__x._M_h); }
1939#ifdef __glibcxx_node_extract
1940 template<
typename,
typename,
typename>
1941 friend class std::_Hash_merge_helper;
1943 template<
typename _H2,
typename _P2>
1953 _M_h._M_merge_multi(_Merge_helper::_S_get_table(
__source));
1956 template<
typename _H2,
typename _P2>
1958 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1961 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1962 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1965 template<
typename _H2,
typename _P2>
1967 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1970 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1971 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1974 template<
typename _H2,
typename _P2>
1976 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1977 { merge(__source); }
1986 {
return _M_h.hash_function(); }
1992 {
return _M_h.key_eq(); }
2010 {
return _M_h.find(__x); }
2012#if __cplusplus > 201703L
2013 template<
typename _Kt>
2015 find(
const _Kt& __x) ->
decltype(_M_h._M_find_tr(__x))
2016 {
return _M_h._M_find_tr(__x); }
2021 {
return _M_h.find(__x); }
2023#if __cplusplus > 201703L
2024 template<
typename _Kt>
2026 find(
const _Kt& __x)
const ->
decltype(_M_h._M_find_tr(__x))
2027 {
return _M_h._M_find_tr(__x); }
2039 {
return _M_h.count(__x); }
2041#if __cplusplus > 201703L
2042 template<
typename _Kt>
2044 count(
const _Kt& __x)
const ->
decltype(_M_h._M_count_tr(__x))
2045 {
return _M_h._M_count_tr(__x); }
2049#if __cplusplus > 201703L
2058 {
return _M_h.find(__x) != _M_h.end(); }
2060 template<
typename _Kt>
2063 ->
decltype(_M_h._M_find_tr(__x),
void(),
true)
2064 {
return _M_h._M_find_tr(__x) != _M_h.end(); }
2077 {
return _M_h.equal_range(__x); }
2079#if __cplusplus > 201703L
2080 template<
typename _Kt>
2083 ->
decltype(_M_h._M_equal_range_tr(__x))
2084 {
return _M_h._M_equal_range_tr(__x); }
2089 {
return _M_h.equal_range(__x); }
2091#if __cplusplus > 201703L
2092 template<
typename _Kt>
2095 ->
decltype(_M_h._M_equal_range_tr(__x))
2096 {
return _M_h._M_equal_range_tr(__x); }
2105 {
return _M_h.bucket_count(); }
2110 {
return _M_h.max_bucket_count(); }
2119 {
return _M_h.bucket_size(__n); }
2127 bucket(
const key_type& __key)
const
2128 {
return _M_h.bucket(__key); }
2138 {
return _M_h.begin(__n); }
2149 {
return _M_h.begin(__n); }
2153 {
return _M_h.cbegin(__n); }
2164 {
return _M_h.end(__n); }
2175 {
return _M_h.end(__n); }
2179 {
return _M_h.cend(__n); }
2187 {
return _M_h.load_factor(); }
2193 {
return _M_h.max_load_factor(); }
2201 { _M_h.max_load_factor(
__z); }
2212 { _M_h.rehash(__n); }
2223 { _M_h.reserve(__n); }
2234#if __cpp_deduction_guides >= 201606
2236 template<
typename _InputIterator,
2237 typename _Hash = hash<__iter_key_t<_InputIterator>>,
2238 typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
2239 typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
2240 typename = _RequireInputIter<_InputIterator>,
2241 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2242 typename = _RequireNotAllocator<_Pred>,
2243 typename = _RequireAllocator<_Allocator>>
2244 unordered_multimap(_InputIterator, _InputIterator,
2246 _Hash = _Hash(), _Pred = _Pred(),
2247 _Allocator = _Allocator())
2248 -> unordered_multimap<__iter_key_t<_InputIterator>,
2249 __iter_val_t<_InputIterator>, _Hash, _Pred,
2252 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
2253 typename _Pred = equal_to<_Key>,
2254 typename _Allocator = allocator<pair<const _Key, _Tp>>,
2255 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2256 typename = _RequireNotAllocator<_Pred>,
2257 typename = _RequireAllocator<_Allocator>>
2258 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2260 _Hash = _Hash(), _Pred = _Pred(),
2261 _Allocator = _Allocator())
2262 -> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Allocator>;
2264 template<
typename _InputIterator,
typename _Allocator,
2265 typename = _RequireInputIter<_InputIterator>,
2266 typename = _RequireAllocator<_Allocator>>
2267 unordered_multimap(_InputIterator, _InputIterator,
2269 -> unordered_multimap<__iter_key_t<_InputIterator>,
2270 __iter_val_t<_InputIterator>,
2271 hash<__iter_key_t<_InputIterator>>,
2272 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2274 template<
typename _InputIterator,
typename _Allocator,
2275 typename = _RequireInputIter<_InputIterator>,
2276 typename = _RequireAllocator<_Allocator>>
2277 unordered_multimap(_InputIterator, _InputIterator, _Allocator)
2278 -> unordered_multimap<__iter_key_t<_InputIterator>,
2279 __iter_val_t<_InputIterator>,
2280 hash<__iter_key_t<_InputIterator>>,
2281 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2283 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
2284 typename = _RequireInputIter<_InputIterator>,
2285 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2286 typename = _RequireAllocator<_Allocator>>
2287 unordered_multimap(_InputIterator, _InputIterator,
2290 -> unordered_multimap<__iter_key_t<_InputIterator>,
2291 __iter_val_t<_InputIterator>, _Hash,
2292 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2294 template<
typename _Key,
typename _Tp,
typename _Allocator,
2295 typename = _RequireAllocator<_Allocator>>
2296 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2299 -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2301 template<
typename _Key,
typename _Tp,
typename _Allocator,
2302 typename = _RequireAllocator<_Allocator>>
2303 unordered_multimap(initializer_list<pair<_Key, _Tp>>, _Allocator)
2304 -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
2306 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
2307 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2308 typename = _RequireAllocator<_Allocator>>
2309 unordered_multimap(initializer_list<pair<_Key, _Tp>>,
2312 -> unordered_multimap<_Key, _Tp, _Hash, equal_to<_Key>, _Allocator>;
2314#if __glibcxx_containers_ranges
2315 template<ranges::input_range _Rg,
2316 __not_allocator_like _Hash = hash<__detail::__range_key_type<_Rg>>,
2317 __not_allocator_like _Pred = equal_to<__detail::__range_key_type<_Rg>>,
2318 __allocator_like _Allocator =
2319 allocator<__detail::__range_to_alloc_type<_Rg>>>
2320 unordered_multimap(from_range_t, _Rg&&,
2322 _Hash = _Hash(), _Pred = _Pred(),
2323 _Allocator = _Allocator())
2324 -> unordered_multimap<__detail::__range_key_type<_Rg>,
2325 __detail::__range_mapped_type<_Rg>,
2326 _Hash, _Pred, _Allocator>;
2328 template<ranges::input_range _Rg,
2329 __allocator_like _Allocator>
2332 -> unordered_multimap<__detail::__range_key_type<_Rg>,
2333 __detail::__range_mapped_type<_Rg>,
2334 hash<__detail::__range_key_type<_Rg>>,
2335 equal_to<__detail::__range_key_type<_Rg>>,
2338 template<ranges::input_range _Rg,
2339 __allocator_like _Allocator>
2340 unordered_multimap(from_range_t, _Rg&&, _Allocator)
2341 -> unordered_multimap<__detail::__range_key_type<_Rg>,
2342 __detail::__range_mapped_type<_Rg>,
2343 hash<__detail::__range_key_type<_Rg>>,
2344 equal_to<__detail::__range_key_type<_Rg>>,
2347 template<ranges::input_range _Rg,
2348 __not_allocator_like _Hash,
2349 __allocator_like _Allocator>
2350 unordered_multimap(from_range_t, _Rg&&,
2353 -> unordered_multimap<__detail::__range_key_type<_Rg>,
2354 __detail::__range_mapped_type<_Rg>,
2355 _Hash, equal_to<__detail::__range_key_type<_Rg>>,
2360 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2362 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2363 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2364 noexcept(
noexcept(__x.swap(__y)))
2367 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2369 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2370 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2371 noexcept(
noexcept(__x.swap(__y)))
2374 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2376 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2377 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2378 {
return __x._M_h._M_equal(__y._M_h); }
2380#if __cpp_impl_three_way_comparison < 201907L
2381 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2383 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2384 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2385 {
return !(__x == __y); }
2388 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2390 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2391 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2392 {
return __x._M_h._M_equal(__y._M_h); }
2394#if __cpp_impl_three_way_comparison < 201907L
2395 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2397 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
2398 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
2399 {
return !(__x == __y); }
2402_GLIBCXX_END_NAMESPACE_CONTAINER
2404#ifdef __glibcxx_node_extract
2406 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2407 typename _Alloc,
typename _Hash2,
typename _Eq2>
2408 struct _Hash_merge_helper<
2409 _GLIBCXX_STD_C::unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2413 template<
typename... _Tp>
2414 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2415 template<
typename... _Tp>
2416 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2418 friend unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2421 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2422 {
return __map._M_h; }
2425 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2426 {
return __map._M_h; }
2430 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2431 typename _Alloc,
typename _Hash2,
typename _Eq2>
2432 struct _Hash_merge_helper<
2433 _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2437 template<
typename... _Tp>
2438 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2439 template<
typename... _Tp>
2440 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
2442 friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
2445 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2446 {
return __map._M_h; }
2449 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
2450 {
return __map._M_h; }
2454_GLIBCXX_END_NAMESPACE_VERSION
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
ISO C++ entities toplevel namespace is std.
__detail::_Hashtable_traits< _Cache, false, false > __ummap_traits
Base types for unordered_multimap.
__detail::_Hashtable_traits< _Cache, false, true > __umap_traits
Base types for unordered_map.
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
float load_factor() const noexcept
Returns the average number of elements per bucket.
_Hashtable::reference reference
Iterator-related typedefs.
iterator erase(iterator __position)
Erases an element from an unordered_multimap.
const_iterator end() const noexcept
size_type erase(const key_type &__x)
Erases elements according to the provided key.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
_Hashtable::iterator iterator
Iterator-related typedefs.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multimap.
iterator begin() noexcept
const_iterator begin() const noexcept
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
iterator insert(const_iterator __hint, node_type &&__nh)
Re-insert an extracted node.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(const_iterator __hint, _Pair &&__x)
Inserts a std::pair into the unordered_multimap.
unordered_multimap & operator=(const unordered_multimap &)=default
Copy assignment operator.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multimap was constructed.
size_type count(const key_type &__x) const
Finds the number of elements.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
_Hashtable::mapped_type mapped_type
Public typedefs.
auto find(const _Kt &__x) -> decltype(_M_h._M_find_tr(__x))
Tries to locate an element in an unordered_multimap.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
unordered_multimap(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Default constructor creates no elements.
_Hashtable::value_type value_type
Public typedefs.
iterator emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
node_type extract(const key_type &__key)
Extract a node.
bool contains(const key_type &__x) const
Finds whether an element with the given key exists.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
iterator insert(node_type &&__nh)
Re-insert an extracted node.
iterator erase(const_iterator __position)
Erases an element from an unordered_multimap.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
float max_load_factor() const noexcept
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equa...
unordered_multimap()=default
Default constructor.
iterator insert(value_type &&__x)
Inserts a std::pair into the unordered_multimap.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
unordered_multimap & operator=(unordered_multimap &&)=default
Move assignment operator.
_Hashtable::hasher hasher
Public typedefs.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
unordered_multimap(_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Builds an unordered_multimap from a range.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multimap.
unordered_multimap(initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Builds an unordered_multimap from an initializer_list.
auto count(const _Kt &__x) const -> decltype(_M_h._M_count_tr(__x))
Finds the number of elements.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
_Hashtable::pointer pointer
Iterator-related typedefs.
_Hashtable::allocator_type allocator_type
Public typedefs.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
auto find(const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x))
Tries to locate an element in an unordered_multimap.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
unordered_multimap(unordered_multimap &&)=default
Move constructor.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
auto contains(const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x), void(), true)
Finds whether an element with the given key exists.
void swap(unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
void rehash(size_type __n)
May rehash the unordered_multimap.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_multimap.
const_iterator cend() const noexcept
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
bool empty() const noexcept
Returns true if the unordered_multimap is empty.
const_iterator cbegin() const noexcept
_Hashtable::key_type key_type
Public typedefs.
node_type extract(const_iterator __pos)
Extract a node.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into the unordered_multimap.
size_type size() const noexcept
Returns the size of the unordered_multimap.
unordered_multimap(const unordered_multimap &)=default
Copy constructor.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
iterator insert(const_iterator __hint, value_type &&__x)
Inserts a std::pair into the unordered_multimap.
auto equal_range(const _Kt &__x) -> decltype(_M_h._M_equal_range_tr(__x))
Finds a subsequence matching given key.
_Hashtable::key_equal key_equal
Public typedefs.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_multimap.
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
auto equal_range(const _Kt &__x) const -> decltype(_M_h._M_equal_range_tr(__x))
Finds a subsequence matching given key.
A standard container composed of unique keys (containing at most one of each key value) that associat...
iterator insert(const_iterator __hint, value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::iterator iterator
Iterator-related typedefs.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
bool contains(const key_type &__x) const
Finds whether an element with the given key exists.
node_type extract(const key_type &__key)
Extract a node.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_map.
auto find(const _Kt &__x) -> decltype(_M_h._M_find_tr(__x))
Tries to locate an element in an unordered_map.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
auto find(const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x))
Tries to locate an element in an unordered_map.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_map.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(const_iterator __hint, _Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
mapped_type & at(const key_type &__k)
Access to unordered_map data.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_map.
iterator try_emplace(const_iterator __hint, const key_type &__k, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
node_type extract(const_iterator __pos)
Extract a node.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
void reserve(size_type __n)
Prepare the unordered_map for a specified number of elements.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
iterator insert(const_iterator, node_type &&__nh)
Re-insert an extracted node.
_Hashtable::reference reference
Iterator-related typedefs.
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::allocator_type allocator_type
Public typedefs.
unordered_map(const unordered_map &)=default
Copy constructor.
size_type count(const key_type &__x) const
Finds the number of elements.
bool empty() const noexcept
Returns true if the unordered_map is empty.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_map.
unordered_map(unordered_map &&)=default
Move constructor.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
auto equal_range(const _Kt &__x) -> decltype(_M_h._M_equal_range_tr(__x))
Finds a subsequence matching given key.
auto contains(const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x), void(), true)
Finds whether an element with the given key exists.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
const_iterator end() const noexcept
unordered_map()=default
Default constructor.
_Hashtable::mapped_type mapped_type
Public typedefs.
unordered_map & operator=(unordered_map &&)=default
Move assignment operator.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
unordered_map(size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Default constructor creates no elements.
std::pair< iterator, bool > emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
size_type size() const noexcept
Returns the size of the unordered_map.
__enable_if_t< is_constructible< value_type, _Pair && >::value, pair< iterator, bool > > insert(_Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
std::pair< iterator, bool > insert(value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::hasher hasher
Public typedefs.
pair< iterator, bool > insert_or_assign(const key_type &__k, _Obj &&__obj)
Attempts to insert a std::pair into the unordered_map.
unordered_map(_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Builds an unordered_map from a range.
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to unordered_map data.
pair< iterator, bool > try_emplace(const key_type &__k, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
const_iterator begin() const noexcept
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
_Hashtable::key_equal key_equal
Public typedefs.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
iterator erase(iterator __position)
Erases an element from an unordered_map.
const_iterator cend() const noexcept
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
_Hashtable::pointer pointer
Iterator-related typedefs.
iterator insert_or_assign(const_iterator __hint, const key_type &__k, _Obj &&__obj)
Attempts to insert a std::pair into the unordered_map.
unordered_map(const allocator_type &__a)
Creates an unordered_map with no elements.
_Hashtable::key_type key_type
Public typedefs.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_map.
iterator begin() noexcept
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
auto equal_range(const _Kt &__x) const -> decltype(_M_h._M_equal_range_tr(__x))
Finds a subsequence matching given key.
unordered_map(initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
Builds an unordered_map from an initializer_list.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
float load_factor() const noexcept
Returns the average number of elements per bucket.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
void swap(unordered_map &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
float max_load_factor() const noexcept
Returns a positive number that the unordered_map tries to keep the load factor less than or equal to.
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
auto count(const _Kt &__x) const -> decltype(_M_h._M_count_tr(__x))
Finds the number of elements.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_map.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
insert_return_type insert(node_type &&__nh)
Re-insert an extracted node.
_Hashtable::value_type value_type
Public typedefs.
void rehash(size_type __n)
May rehash the unordered_map.
const_iterator cbegin() const noexcept