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,
68 __detail::_Mod_range_hashing,
69 __detail::_Default_ranged_hash,
70 __detail::_Prime_rehash_policy, _Tr>;
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;
152 const hasher& __hf =
hasher(),
155 : _M_h(__n, __hf, __eql, __a)
171 template<
typename _InputIterator>
174 const hasher& __hf =
hasher(),
177 : _M_h(__first, __last, __n, __hf, __eql, __a)
201 const allocator_type& __a)
202 : _M_h(__umap._M_h, __a)
211 const allocator_type& __a)
212 noexcept( noexcept(_Hashtable(std::move(__umap._M_h), __a)) )
213 : _M_h(std::move(__umap._M_h), __a)
229 const hasher& __hf =
hasher(),
232 : _M_h(__l, __n, __hf, __eql, __a)
240 const allocator_type& __a)
244 template<
typename _InputIterator>
247 const allocator_type& __a)
251 template<
typename _InputIterator>
253 size_type __n,
const hasher& __hf,
254 const allocator_type& __a)
260 const allocator_type& __a)
265 size_type __n,
const hasher& __hf,
266 const allocator_type& __a)
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 425 extract(const_iterator __pos)
427 __glibcxx_assert(__pos !=
end());
428 return _M_h.extract(__pos);
433 extract(
const key_type& __key)
434 {
return _M_h.extract(__key); }
439 {
return _M_h._M_reinsert_node(std::move(__nh)); }
443 insert(const_iterator, node_type&& __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)
473 iterator __i =
find(__k);
479 std::forward<_Args>(__args)...))
487 template <
typename... _Args>
489 try_emplace(key_type&& __k, _Args&&... __args)
491 iterator __i =
find(__k);
497 std::forward<_Args>(__args)...))
532 template <
typename... _Args>
534 try_emplace(const_iterator __hint,
const key_type& __k,
537 iterator __i =
find(__k);
542 std::forward<_Args>(__args)...));
547 template <
typename... _Args>
549 try_emplace(const_iterator __hint, key_type&& __k, _Args&&... __args)
551 iterator __i =
find(__k);
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)); }
619 insert(const_iterator __hint,
const value_type& __x)
620 {
return _M_h.insert(__hint, __x); }
625 insert(const_iterator __hint, value_type&& __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>
630 insert(const_iterator __hint, _Pair&& __x)
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)
686 iterator __i =
find(__k);
695 (*__i).second = std::forward<_Obj>(__obj);
700 template <
typename _Obj>
702 insert_or_assign(key_type&& __k, _Obj&& __obj)
704 iterator __i =
find(__k);
713 (*__i).second = std::forward<_Obj>(__obj);
743 template <
typename _Obj>
745 insert_or_assign(const_iterator __hint,
const key_type& __k,
748 iterator __i =
find(__k);
754 std::forward<_Obj>(__obj)));
756 (*__i).second = std::forward<_Obj>(__obj);
761 template <
typename _Obj>
763 insert_or_assign(const_iterator __hint, key_type&& __k, _Obj&& __obj)
765 iterator __i =
find(__k);
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); }
833 erase(const_iterator __first, const_iterator __last)
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>
878 template<
typename _H2,
typename _P2>
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>
898 {
return _M_h.hash_function(); }
904 {
return _M_h.key_eq(); }
922 {
return _M_h.find(__x); }
925 find(
const key_type& __x)
const 926 {
return _M_h.find(__x); }
940 {
return _M_h.count(__x); }
942 #if __cplusplus > 201703L 949 contains(
const key_type& __x)
const 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); }
1006 at(
const key_type& __k)
const 1007 {
return _M_h.at(__k); }
1015 {
return _M_h.bucket_count(); }
1020 {
return _M_h.max_bucket_count(); }
1028 bucket_size(size_type __n)
const 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); }
1057 const_local_iterator
1059 {
return _M_h.begin(__n); }
1061 const_local_iterator
1063 {
return _M_h.cbegin(__n); }
1074 {
return _M_h.end(__n); }
1083 const_local_iterator
1085 {
return _M_h.end(__n); }
1087 const_local_iterator
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,
1148 typename = _RequireInputIter<_InputIterator>,
1149 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1150 typename = _RequireNotAllocator<_Pred>,
1151 typename = _RequireAllocator<_Allocator>>
1154 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
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>>
1167 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1170 template<
typename _InputIterator,
typename _Allocator,
1171 typename = _RequireInputIter<_InputIterator>,
1172 typename = _RequireAllocator<_Allocator>>
1176 __iter_val_t<_InputIterator>,
1181 template<
typename _InputIterator,
typename _Allocator,
1182 typename = _RequireInputIter<_InputIterator>,
1183 typename = _RequireAllocator<_Allocator>>
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>>
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>>
1209 template<
typename _Key,
typename _Tp,
typename _Allocator,
1210 typename = _RequireAllocator<_Allocator>>
1214 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
1215 typename = _RequireNotAllocatorOrIntegral<_Hash>,
1216 typename = _RequireAllocator<_Allocator>>
1247 template<
typename _Key,
typename _Tp,
1249 typename _Pred = equal_to<_Key>,
1282 #if __cplusplus > 201402L 1283 using node_type =
typename _Hashtable::node_type;
1300 const hasher& __hf =
hasher(),
1303 : _M_h(__n, __hf, __eql, __a)
1319 template<
typename _InputIterator>
1322 const hasher& __hf =
hasher(),
1325 : _M_h(__first, __last, __n, __hf, __eql, __a)
1349 const allocator_type& __a)
1350 : _M_h(__ummap._M_h, __a)
1359 const allocator_type& __a)
1360 noexcept( noexcept(_Hashtable(std::move(__ummap._M_h), __a)) )
1361 : _M_h(std::move(__ummap._M_h), __a)
1377 const hasher& __hf =
hasher(),
1380 : _M_h(__l, __n, __hf, __eql, __a)
1388 const allocator_type& __a)
1392 template<
typename _InputIterator>
1395 const allocator_type& __a)
1399 template<
typename _InputIterator>
1401 size_type __n,
const hasher& __hf,
1402 const allocator_type& __a)
1408 const allocator_type& __a)
1413 size_type __n,
const hasher& __hf,
1414 const allocator_type& __a)
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)); }
1606 insert(const_iterator __hint,
const value_type& __x)
1607 {
return _M_h.insert(__hint, __x); }
1612 insert(const_iterator __hint, value_type&& __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 1650 extract(const_iterator __pos)
1652 __glibcxx_assert(__pos !=
end());
1653 return _M_h.extract(__pos);
1658 extract(
const key_type& __key)
1659 {
return _M_h.extract(__key); }
1664 {
return _M_h._M_reinsert_node_multi(
cend(), std::move(__nh)); }
1668 insert(const_iterator __hint, node_type&& __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); }
1727 erase(const_iterator __first, const_iterator __last)
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>
1771 { merge(__source); }
1773 template<
typename _H2,
typename _P2>
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>
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(); }
1879 bucket_size(size_type __n)
const 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); }
1908 const_local_iterator
1910 {
return _M_h.begin(__n); }
1912 const_local_iterator
1914 {
return _M_h.cbegin(__n); }
1925 {
return _M_h.end(__n); }
1934 const_local_iterator
1936 {
return _M_h.end(__n); }
1938 const_local_iterator
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>>,
2001 typename = _RequireInputIter<_InputIterator>,
2002 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2003 typename = _RequireNotAllocator<_Pred>,
2004 typename = _RequireAllocator<_Allocator>>
2007 _Hash = _Hash(), _Pred = _Pred(),
2008 _Allocator = _Allocator())
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>>
2021 _Hash = _Hash(), _Pred = _Pred(),
2022 _Allocator = _Allocator())
2025 template<
typename _InputIterator,
typename _Allocator,
2026 typename = _RequireInputIter<_InputIterator>,
2027 typename = _RequireAllocator<_Allocator>>
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>>
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>>
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>>
2062 template<
typename _Key,
typename _Tp,
typename _Allocator,
2063 typename = _RequireAllocator<_Allocator>>
2067 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
2068 typename = _RequireNotAllocatorOrIntegral<_Hash>,
2069 typename = _RequireAllocator<_Allocator>>
2077 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2081 noexcept(noexcept(__x.
swap(__y)))
2084 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2088 noexcept(noexcept(__x.
swap(__y)))
2091 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2095 {
return __x._M_h._M_equal(__y._M_h); }
2097 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2101 {
return !(__x == __y); }
2103 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2107 {
return __x._M_h._M_equal(__y._M_h); }
2109 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
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>
2135 {
return __map._M_h; }
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<
2150 template<
typename... _Tp>
2151 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2152 template<
typename... _Tp>
2159 {
return __map._M_h; }
2163 {
return __map._M_h; }
2167 _GLIBCXX_END_NAMESPACE_VERSION
_Hashtable::mapped_type mapped_type
Public typedefs.
iterator erase(const_iterator __position)
Erases an element from an unordered_multimap.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
_Hashtable::iterator iterator
Iterator-related typedefs.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_map.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
size_type count(const key_type &__x) const
Finds the number of elements.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
std::pair< iterator, bool > emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
float load_factor() const noexcept
Returns the average number of elements per bucket.
ISO C++ entities toplevel namespace is std.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::iterator iterator
Iterator-related typedefs.
void rehash(size_type __n)
May rehash the unordered_multimap.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
void swap(unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
iterator insert(value_type &&__x)
Inserts a std::pair into the unordered_multimap.
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to unordered_map data.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
One of the comparison functors.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
Struct holding two objects of arbitrary type.
unordered_map()=default
Default constructor.
The standard allocator, as per [20.4].
const_iterator end() const noexcept
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
size_type count(const key_type &__x) const
Finds the number of elements.
_Hashtable::size_type size_type
Iterator-related typedefs.
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
void swap(unordered_map &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::key_equal key_equal
Public typedefs.
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.
iterator begin() noexcept
_Hashtable::allocator_type allocator_type
Public typedefs.
const_iterator find(const key_type &__x) const
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.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
size_type size() const noexcept
Returns the size of the unordered_map.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
float load_factor() const noexcept
Returns the average number of elements per bucket.
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multimap.
__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(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.
_Hashtable::reference reference
Iterator-related typedefs.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into the unordered_multimap.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
void reserve(size_type __n)
Prepare the unordered_map for a specified number of elements.
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.
iterator erase(iterator __position)
Erases an element from an unordered_map.
_Hashtable::size_type size_type
Iterator-related typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
constexpr tuple< _Elements &&... > forward_as_tuple(_Elements &&... __args) noexcept
std::forward_as_tuple
iterator erase(iterator __position)
Erases an element from an unordered_multimap.
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.
Primary class template hash.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
_Hashtable::mapped_type mapped_type
Public typedefs.
_Hashtable::pointer pointer
Iterator-related typedefs.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
_Hashtable::value_type value_type
Public typedefs.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
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...
const_iterator cbegin() const noexcept
_Hashtable::const_reference const_reference
Iterator-related typedefs.
__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.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
iterator emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
_GLIBCXX17_INLINE constexpr piecewise_construct_t piecewise_construct
piecewise_construct
unordered_map(const allocator_type &__a)
Creates an unordered_map with no elements.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
std::pair< iterator, bool > insert(value_type &&__x)
Attempts to 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.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_map.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_multimap.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
_Hashtable::hasher hasher
Public typedefs.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_multimap.
_GLIBCXX_NODISCARD bool empty() const noexcept
Returns true if the unordered_map is empty.
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
void rehash(size_type __n)
May rehash the unordered_map.
_Hashtable::key_type key_type
Public typedefs.
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.
const_iterator begin() const noexcept
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multimap.
iterator insert(const_iterator __hint, value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
float max_load_factor() const noexcept
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equa...
size_type erase(const key_type &__x)
Erases elements according to the provided key.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
_Hashtable::allocator_type allocator_type
Public typedefs.
_Hashtable::pointer pointer
Iterator-related typedefs.
iterator insert(const_iterator __hint, value_type &&__x)
Inserts a std::pair into the unordered_multimap.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_map.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_map.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
const_iterator cend() const noexcept
size_type size() const noexcept
Returns the size of the unordered_multimap.
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
const_iterator begin() const noexcept
const_iterator cbegin() const noexcept
Default ranged hash function H. In principle it should be a function object composed from objects of ...
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.
_Hashtable::hasher hasher
Public typedefs.
mapped_type & at(const key_type &__k)
Access to unordered_map data.
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
A standard container composed of unique keys (containing at most one of each key value) that associat...
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
_Hashtable::key_equal key_equal
Public typedefs.
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
_GLIBCXX_NODISCARD bool empty() const noexcept
Returns true if the unordered_multimap is empty.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multimap was constructed.
_Hashtable::value_type value_type
Public typedefs.
__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.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
const_iterator end() const noexcept
Default range hashing function: use division to fold a large number into the range [0...
_Hashtable::key_type key_type
Public typedefs.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
iterator begin() noexcept
const_iterator cend() const noexcept
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.