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 : _M_h(std::move(__umap._M_h), __a)
228 const hasher& __hf =
hasher(),
231 : _M_h(__l, __n, __hf, __eql, __a)
239 const allocator_type& __a)
243 template<
typename _InputIterator>
246 const allocator_type& __a)
250 template<
typename _InputIterator>
252 size_type __n,
const hasher& __hf,
253 const allocator_type& __a)
259 const allocator_type& __a)
264 size_type __n,
const hasher& __hf,
265 const allocator_type& __a)
298 {
return _M_h.get_allocator(); }
305 {
return _M_h.empty(); }
310 {
return _M_h.size(); }
315 {
return _M_h.max_size(); }
325 {
return _M_h.begin(); }
334 {
return _M_h.begin(); }
338 {
return _M_h.begin(); }
347 {
return _M_h.end(); }
356 {
return _M_h.end(); }
360 {
return _M_h.end(); }
385 template<
typename... _Args>
388 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
416 template<
typename... _Args>
419 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
421 #if __cplusplus > 201402L 424 extract(const_iterator __pos)
426 __glibcxx_assert(__pos !=
end());
427 return _M_h.extract(__pos);
432 extract(
const key_type& __key)
433 {
return _M_h.extract(__key); }
438 {
return _M_h._M_reinsert_node(std::move(__nh)); }
442 insert(const_iterator, node_type&& __nh)
443 {
return _M_h._M_reinsert_node(std::move(__nh)).position; }
445 #define __cpp_lib_unordered_map_try_emplace 201411 468 template <
typename... _Args>
470 try_emplace(
const key_type& __k, _Args&&... __args)
472 iterator __i =
find(__k);
478 std::forward<_Args>(__args)...))
486 template <
typename... _Args>
488 try_emplace(key_type&& __k, _Args&&... __args)
490 iterator __i =
find(__k);
496 std::forward<_Args>(__args)...))
531 template <
typename... _Args>
533 try_emplace(const_iterator __hint,
const key_type& __k,
536 iterator __i =
find(__k);
541 std::forward<_Args>(__args)...));
546 template <
typename... _Args>
548 try_emplace(const_iterator __hint, key_type&& __k, _Args&&... __args)
550 iterator __i =
find(__k);
555 std::forward<_Args>(__args)...));
580 {
return _M_h.insert(__x); }
586 {
return _M_h.insert(std::move(__x)); }
588 template<
typename _Pair>
589 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
592 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
618 insert(const_iterator __hint,
const value_type& __x)
619 {
return _M_h.insert(__hint, __x); }
624 insert(const_iterator __hint, value_type&& __x)
625 {
return _M_h.insert(__hint, std::move(__x)); }
627 template<
typename _Pair>
628 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
629 insert(const_iterator __hint, _Pair&& __x)
630 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
642 template<
typename _InputIterator>
644 insert(_InputIterator __first, _InputIterator __last)
645 { _M_h.insert(__first, __last); }
656 { _M_h.insert(__l); }
659 #if __cplusplus > 201402L 660 #define __cpp_lib_unordered_map_insertion 201411 681 template <
typename _Obj>
683 insert_or_assign(
const key_type& __k, _Obj&& __obj)
685 iterator __i =
find(__k);
694 (*__i).second = std::forward<_Obj>(__obj);
699 template <
typename _Obj>
701 insert_or_assign(key_type&& __k, _Obj&& __obj)
703 iterator __i =
find(__k);
712 (*__i).second = std::forward<_Obj>(__obj);
742 template <
typename _Obj>
744 insert_or_assign(const_iterator __hint,
const key_type& __k,
747 iterator __i =
find(__k);
753 std::forward<_Obj>(__obj)));
755 (*__i).second = std::forward<_Obj>(__obj);
760 template <
typename _Obj>
762 insert_or_assign(const_iterator __hint, key_type&& __k, _Obj&& __obj)
764 iterator __i =
find(__k);
770 std::forward<_Obj>(__obj)));
772 (*__i).second = std::forward<_Obj>(__obj);
793 {
return _M_h.erase(__position); }
798 {
return _M_h.erase(__position); }
815 {
return _M_h.erase(__x); }
832 erase(const_iterator __first, const_iterator __last)
833 {
return _M_h.erase(__first, __last); }
857 noexcept( noexcept(_M_h.swap(__x._M_h)) )
858 { _M_h.swap(__x._M_h); }
860 #if __cplusplus > 201402L 861 template<
typename,
typename,
typename>
862 friend class std::_Hash_merge_helper;
864 template<
typename _H2,
typename _P2>
868 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
869 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
872 template<
typename _H2,
typename _P2>
877 template<
typename _H2,
typename _P2>
881 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
882 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
885 template<
typename _H2,
typename _P2>
897 {
return _M_h.hash_function(); }
903 {
return _M_h.key_eq(); }
921 {
return _M_h.find(__x); }
924 find(
const key_type& __x)
const 925 {
return _M_h.find(__x); }
939 {
return _M_h.count(__x); }
941 #if __cplusplus > 201703L 948 contains(
const key_type& __x)
const 949 {
return _M_h.find(__x) != _M_h.end(); }
963 {
return _M_h.equal_range(__x); }
967 {
return _M_h.equal_range(__x); }
985 {
return _M_h[__k]; }
989 {
return _M_h[std::move(__k)]; }
1002 {
return _M_h.at(__k); }
1005 at(
const key_type& __k)
const 1006 {
return _M_h.at(__k); }
1014 {
return _M_h.bucket_count(); }
1019 {
return _M_h.max_bucket_count(); }
1027 bucket_size(size_type __n)
const 1028 {
return _M_h.bucket_size(__n); }
1036 bucket(
const key_type& __key)
const 1037 {
return _M_h.bucket(__key); }
1047 {
return _M_h.begin(__n); }
1056 const_local_iterator
1058 {
return _M_h.begin(__n); }
1060 const_local_iterator
1062 {
return _M_h.cbegin(__n); }
1073 {
return _M_h.end(__n); }
1082 const_local_iterator
1084 {
return _M_h.end(__n); }
1086 const_local_iterator
1088 {
return _M_h.cend(__n); }
1096 {
return _M_h.load_factor(); }
1102 {
return _M_h.max_load_factor(); }
1110 { _M_h.max_load_factor(__z); }
1121 { _M_h.rehash(__n); }
1132 { _M_h.reserve(__n); }
1134 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1141 #if __cpp_deduction_guides >= 201606 1143 template<
typename _InputIterator,
1147 typename = _RequireInputIter<_InputIterator>,
1148 typename = _RequireAllocator<_Allocator>>
1151 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1153 __iter_val_t<_InputIterator>,
1154 _Hash, _Pred, _Allocator>;
1156 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
1157 typename _Pred = equal_to<_Key>,
1158 typename _Allocator = allocator<pair<const _Key, _Tp>>,
1159 typename = _RequireAllocator<_Allocator>>
1162 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
1165 template<
typename _InputIterator,
typename _Allocator,
1166 typename = _RequireInputIter<_InputIterator>,
1167 typename = _RequireAllocator<_Allocator>>
1171 __iter_val_t<_InputIterator>,
1176 template<
typename _InputIterator,
typename _Allocator,
1177 typename = _RequireInputIter<_InputIterator>,
1178 typename = _RequireAllocator<_Allocator>>
1181 __iter_val_t<_InputIterator>,
1182 hash<__iter_key_t<_InputIterator>>,
1183 equal_to<__iter_key_t<_InputIterator>>,
1186 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
1187 typename = _RequireInputIter<_InputIterator>,
1188 typename = _RequireAllocator<_Allocator>>
1193 __iter_val_t<_InputIterator>, _Hash,
1194 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
1196 template<
typename _Key,
typename _Tp,
typename _Allocator,
1197 typename = _RequireAllocator<_Allocator>>
1203 template<
typename _Key,
typename _Tp,
typename _Allocator,
1204 typename = _RequireAllocator<_Allocator>>
1208 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
1209 typename = _RequireAllocator<_Allocator>>
1240 template<
typename _Key,
typename _Tp,
1242 typename _Pred = equal_to<_Key>,
1275 #if __cplusplus > 201402L 1276 using node_type =
typename _Hashtable::node_type;
1293 const hasher& __hf =
hasher(),
1296 : _M_h(__n, __hf, __eql, __a)
1312 template<
typename _InputIterator>
1315 const hasher& __hf =
hasher(),
1318 : _M_h(__first, __last, __n, __hf, __eql, __a)
1342 const allocator_type& __a)
1343 : _M_h(__ummap._M_h, __a)
1352 const allocator_type& __a)
1353 : _M_h(std::move(__ummap._M_h), __a)
1369 const hasher& __hf =
hasher(),
1372 : _M_h(__l, __n, __hf, __eql, __a)
1380 const allocator_type& __a)
1384 template<
typename _InputIterator>
1387 const allocator_type& __a)
1391 template<
typename _InputIterator>
1393 size_type __n,
const hasher& __hf,
1394 const allocator_type& __a)
1400 const allocator_type& __a)
1405 size_type __n,
const hasher& __hf,
1406 const allocator_type& __a)
1439 {
return _M_h.get_allocator(); }
1446 {
return _M_h.empty(); }
1451 {
return _M_h.size(); }
1456 {
return _M_h.max_size(); }
1466 {
return _M_h.begin(); }
1475 {
return _M_h.begin(); }
1479 {
return _M_h.begin(); }
1488 {
return _M_h.end(); }
1497 {
return _M_h.end(); }
1501 {
return _M_h.end(); }
1521 template<
typename... _Args>
1524 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1548 template<
typename... _Args>
1551 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1565 {
return _M_h.insert(__x); }
1569 {
return _M_h.insert(std::move(__x)); }
1571 template<
typename _Pair>
1572 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
1574 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
1598 insert(const_iterator __hint,
const value_type& __x)
1599 {
return _M_h.insert(__hint, __x); }
1604 insert(const_iterator __hint, value_type&& __x)
1605 {
return _M_h.insert(__hint, std::move(__x)); }
1607 template<
typename _Pair>
1608 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
1610 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
1622 template<
typename _InputIterator>
1624 insert(_InputIterator __first, _InputIterator __last)
1625 { _M_h.insert(__first, __last); }
1637 { _M_h.insert(__l); }
1639 #if __cplusplus > 201402L 1642 extract(const_iterator __pos)
1644 __glibcxx_assert(__pos !=
end());
1645 return _M_h.extract(__pos);
1650 extract(
const key_type& __key)
1651 {
return _M_h.extract(__key); }
1656 {
return _M_h._M_reinsert_node_multi(
cend(), std::move(__nh)); }
1660 insert(const_iterator __hint, node_type&& __nh)
1661 {
return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }
1680 {
return _M_h.erase(__position); }
1685 {
return _M_h.erase(__position); }
1701 {
return _M_h.erase(__x); }
1719 erase(const_iterator __first, const_iterator __last)
1720 {
return _M_h.erase(__first, __last); }
1744 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1745 { _M_h.swap(__x._M_h); }
1747 #if __cplusplus > 201402L 1748 template<
typename,
typename,
typename>
1749 friend class std::_Hash_merge_helper;
1751 template<
typename _H2,
typename _P2>
1756 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1757 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1760 template<
typename _H2,
typename _P2>
1763 { merge(__source); }
1765 template<
typename _H2,
typename _P2>
1770 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1771 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1774 template<
typename _H2,
typename _P2>
1777 { merge(__source); }
1786 {
return _M_h.hash_function(); }
1792 {
return _M_h.key_eq(); }
1810 {
return _M_h.find(__x); }
1814 {
return _M_h.find(__x); }
1824 {
return _M_h.count(__x); }
1826 #if __cplusplus > 201703L 1833 contains(
const key_type& __x)
const 1834 {
return _M_h.find(__x) != _M_h.end(); }
1846 {
return _M_h.equal_range(__x); }
1850 {
return _M_h.equal_range(__x); }
1858 {
return _M_h.bucket_count(); }
1863 {
return _M_h.max_bucket_count(); }
1871 bucket_size(size_type __n)
const 1872 {
return _M_h.bucket_size(__n); }
1880 bucket(
const key_type& __key)
const 1881 {
return _M_h.bucket(__key); }
1891 {
return _M_h.begin(__n); }
1900 const_local_iterator
1902 {
return _M_h.begin(__n); }
1904 const_local_iterator
1906 {
return _M_h.cbegin(__n); }
1917 {
return _M_h.end(__n); }
1926 const_local_iterator
1928 {
return _M_h.end(__n); }
1930 const_local_iterator
1932 {
return _M_h.cend(__n); }
1940 {
return _M_h.load_factor(); }
1946 {
return _M_h.max_load_factor(); }
1954 { _M_h.max_load_factor(__z); }
1965 { _M_h.rehash(__n); }
1976 { _M_h.reserve(__n); }
1978 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1982 _Hash1, _Pred1, _Alloc1>&,
1984 _Hash1, _Pred1, _Alloc1>&);
1987 #if __cpp_deduction_guides >= 201606 1989 template<
typename _InputIterator,
1990 typename _Hash = hash<__iter_key_t<_InputIterator>>,
1991 typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
1993 typename = _RequireInputIter<_InputIterator>,
1994 typename = _RequireAllocator<_Allocator>>
1997 _Hash = _Hash(), _Pred = _Pred(),
1998 _Allocator = _Allocator())
2000 __iter_val_t<_InputIterator>, _Hash, _Pred,
2003 template<
typename _Key,
typename _Tp,
typename _Hash = hash<_Key>,
2004 typename _Pred = equal_to<_Key>,
2005 typename _Allocator = allocator<pair<const _Key, _Tp>>,
2006 typename = _RequireAllocator<_Allocator>>
2009 _Hash = _Hash(), _Pred = _Pred(),
2010 _Allocator = _Allocator())
2013 template<
typename _InputIterator,
typename _Allocator,
2014 typename = _RequireInputIter<_InputIterator>,
2015 typename = _RequireAllocator<_Allocator>>
2019 __iter_val_t<_InputIterator>,
2020 hash<__iter_key_t<_InputIterator>>,
2021 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2023 template<
typename _InputIterator,
typename _Allocator,
2024 typename = _RequireInputIter<_InputIterator>,
2025 typename = _RequireAllocator<_Allocator>>
2028 __iter_val_t<_InputIterator>,
2029 hash<__iter_key_t<_InputIterator>>,
2030 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2032 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
2033 typename = _RequireInputIter<_InputIterator>,
2034 typename = _RequireAllocator<_Allocator>>
2039 __iter_val_t<_InputIterator>, _Hash,
2040 equal_to<__iter_key_t<_InputIterator>>, _Allocator>;
2042 template<
typename _Key,
typename _Tp,
typename _Allocator,
2043 typename = _RequireAllocator<_Allocator>>
2049 template<
typename _Key,
typename _Tp,
typename _Allocator,
2050 typename = _RequireAllocator<_Allocator>>
2054 template<
typename _Key,
typename _Tp,
typename _Hash,
typename _Allocator,
2055 typename = _RequireAllocator<_Allocator>>
2063 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2067 noexcept(noexcept(__x.
swap(__y)))
2070 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2074 noexcept(noexcept(__x.
swap(__y)))
2077 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2081 {
return __x._M_h._M_equal(__y._M_h); }
2083 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2087 {
return !(__x == __y); }
2089 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2093 {
return __x._M_h._M_equal(__y._M_h); }
2095 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
2099 {
return !(__x == __y); }
2101 _GLIBCXX_END_NAMESPACE_CONTAINER
2103 #if __cplusplus > 201402L 2105 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2106 typename _Alloc,
typename _Hash2,
typename _Eq2>
2107 struct _Hash_merge_helper<
2108 _GLIBCXX_STD_C::
unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,
2112 template<
typename... _Tp>
2113 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2114 template<
typename... _Tp>
2121 {
return __map._M_h; }
2125 {
return __map._M_h; }
2129 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
2130 typename _Alloc,
typename _Hash2,
typename _Eq2>
2131 struct _Hash_merge_helper<
2136 template<
typename... _Tp>
2137 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
2138 template<
typename... _Tp>
2145 {
return __map._M_h; }
2149 {
return __map._M_h; }
2153 _GLIBCXX_END_NAMESPACE_VERSION
_GLIBCXX17_INLINE constexpr piecewise_construct_t piecewise_construct
piecewise_construct
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...
void swap(unordered_map &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
constexpr tuple< _Elements &&... > forward_as_tuple(_Elements &&... __args) noexcept
std::forward_as_tuple
size_type count(const key_type &__x) const
Finds the number of elements.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
key_equal key_eq() const
Returns the key comparison object with which the unordered_multimap was constructed.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_multimap.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
_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.
const_iterator end() const noexcept
_Hashtable::iterator iterator
Iterator-related typedefs.
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...
bool empty() const noexcept
Returns true if the unordered_multimap is empty.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_map.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
_Hashtable::key_type key_type
Public typedefs.
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of the unordered_multimap.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
size_type size() const noexcept
Returns the size of the unordered_map.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
const_iterator cend() const noexcept
const_iterator end() const noexcept
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
_Hashtable::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
iterator insert(const_iterator __hint, value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::size_type size_type
Iterator-related typedefs.
_Hashtable::allocator_type allocator_type
Public typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
_Hashtable::key_equal key_equal
Public typedefs.
iterator erase(const_iterator __position)
Erases an element from an unordered_multimap.
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
iterator begin() noexcept
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_map.
Primary class template hash.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
ISO C++ entities toplevel namespace is std.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_multimap.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
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.
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.
void swap(unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
The standard allocator, as per [20.4].
const_iterator cbegin() const noexcept
mapped_type & at(const key_type &__k)
Access to unordered_map data.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
One of the comparison functors.
_Hashtable::hasher hasher
Public typedefs.
Struct holding two objects of arbitrary type.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
iterator erase(iterator __position)
Erases an element from an unordered_multimap.
const_iterator cbegin() const noexcept
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
size_type size() const noexcept
Returns the size of the unordered_multimap.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
iterator emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_multimap.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
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 > insert(value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_map.
unordered_map()=default
Default constructor.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_map.
__enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > insert(const_iterator __hint, _Pair &&__x)
Inserts a std::pair into the unordered_multimap.
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
size_type count(const key_type &__x) const
Finds the number of elements.
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
_Hashtable::allocator_type allocator_type
Public typedefs.
iterator begin() noexcept
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
unordered_map(const allocator_type &__a)
Creates an unordered_map with no elements.
_Hashtable::pointer pointer
Iterator-related typedefs.
iterator erase(iterator __position)
Erases an element from an unordered_map.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
void reserve(size_type __n)
Prepare the unordered_map for a specified number of elements.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_map.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
float load_factor() const noexcept
Returns the average number of elements per bucket.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
iterator emplace_hint(const_iterator __pos, _Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
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 erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
_Hashtable::mapped_type mapped_type
Public typedefs.
_Hashtable::iterator iterator
Iterator-related typedefs.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
const_iterator begin() const noexcept
size_type erase(const key_type &__x)
Erases elements according to the provided key.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
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.
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the 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.
__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.
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.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
float load_factor() const noexcept
Returns the average number of elements per bucket.
_Hashtable::mapped_type mapped_type
Public typedefs.
Default ranged hash function H. In principle it should be a function object composed from objects of ...
_Hashtable::const_reference const_reference
Iterator-related typedefs.
_Hashtable::pointer pointer
Iterator-related typedefs.
void rehash(size_type __n)
May rehash the unordered_multimap.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
const_iterator begin() const noexcept
std::pair< iterator, bool > emplace(_Args &&... __args)
Attempts to build and insert a std::pair into the unordered_map.
void rehash(size_type __n)
May rehash the unordered_map.
A standard container composed of unique keys (containing at most one of each key value) that associat...
_Hashtable::hasher hasher
Public typedefs.
_Hashtable::key_equal key_equal
Public typedefs.
iterator insert(const_iterator __hint, value_type &&__x)
Inserts a std::pair into the unordered_multimap.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
_Hashtable::size_type size_type
Iterator-related typedefs.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
size_type bucket_count() const noexcept
Returns the number of buckets of 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...
_Hashtable::value_type value_type
Public typedefs.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into the unordered_multimap.
bool empty() const noexcept
Returns true if the unordered_map is empty.
Default range hashing function: use division to fold a large number into the range [0...
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
const_iterator cend() const noexcept
_Hashtable::key_type key_type
Public typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
_Hashtable::value_type value_type
Public typedefs.