30 #ifndef _UNORDERED_MAP_H
31 #define _UNORDERED_MAP_H
33 namespace std _GLIBCXX_VISIBILITY(default)
35 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
41 template<
typename _Key,
48 _Alloc, __detail::_Select1st,
58 template<
typename _Key,
65 _Alloc, __detail::_Select1st,
71 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
97 template<
class _Key,
class _Tp,
113 typedef typename _Hashtable::hasher
hasher;
132 #if __cplusplus > 201402L
133 using node_type =
typename _Hashtable::node_type;
134 using insert_return_type =
typename _Hashtable::insert_return_type;
154 : _M_h(__n, __hf, __eql, __a)
170 template<
typename _InputIterator>
176 : _M_h(__first, __last, __n, __hf, __eql, __a)
201 : _M_h(__umap._M_h, __a)
211 : _M_h(std::move(__umap._M_h), __a)
230 : _M_h(__l, __n, __hf, __eql, __a)
242 template<
typename _InputIterator>
249 template<
typename _InputIterator>
297 {
return _M_h.get_allocator(); }
304 {
return _M_h.empty(); }
309 {
return _M_h.size(); }
314 {
return _M_h.max_size(); }
324 {
return _M_h.begin(); }
333 {
return _M_h.begin(); }
337 {
return _M_h.begin(); }
346 {
return _M_h.end(); }
355 {
return _M_h.end(); }
359 {
return _M_h.end(); }
384 template<
typename... _Args>
387 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
415 template<
typename... _Args>
418 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
420 #if __cplusplus > 201402L
425 __glibcxx_assert(__pos !=
end());
426 return _M_h.extract(__pos);
432 {
return _M_h.extract(__key); }
437 {
return _M_h._M_reinsert_node(std::move(__nh)); }
442 {
return _M_h._M_reinsert_node(std::move(__nh)).position; }
444 #define __cpp_lib_unordered_map_try_emplace 201411
467 template <
typename... _Args>
469 try_emplace(
const key_type& __k, _Args&&... __args)
475 std::forward_as_tuple(__k),
476 std::forward_as_tuple(
477 std::forward<_Args>(__args)...))
485 template <
typename... _Args>
487 try_emplace(
key_type&& __k, _Args&&... __args)
493 std::forward_as_tuple(std::move(__k)),
494 std::forward_as_tuple(
495 std::forward<_Args>(__args)...))
530 template <
typename... _Args>
538 std::forward_as_tuple(__k),
539 std::forward_as_tuple(
540 std::forward<_Args>(__args)...));
545 template <
typename... _Args>
552 std::forward_as_tuple(std::move(__k)),
553 std::forward_as_tuple(
554 std::forward<_Args>(__args)...));
579 {
return _M_h.insert(__x); }
585 {
return _M_h.insert(std::move(__x)); }
587 template<
typename _Pair,
typename =
typename
588 std::enable_if<std::is_constructible<
value_type,
589 _Pair&&>::value>::type>
592 {
return _M_h.insert(std::forward<_Pair>(__x)); }
619 {
return _M_h.insert(__hint, __x); }
625 {
return _M_h.insert(__hint, std::move(__x)); }
627 template<
typename _Pair,
typename =
typename
628 std::enable_if<std::is_constructible<
value_type,
629 _Pair&&>::value>::type>
632 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
644 template<
typename _InputIterator>
646 insert(_InputIterator __first, _InputIterator __last)
647 { _M_h.insert(__first, __last); }
658 { _M_h.insert(__l); }
661 #if __cplusplus > 201402L
662 #define __cpp_lib_unordered_map_insertion 201411
683 template <
typename _Obj>
685 insert_or_assign(
const key_type& __k, _Obj&& __obj)
691 std::forward_as_tuple(__k),
692 std::forward_as_tuple(std::forward<_Obj>(__obj)))
696 (*__i).second = std::forward<_Obj>(__obj);
701 template <
typename _Obj>
703 insert_or_assign(
key_type&& __k, _Obj&& __obj)
709 std::forward_as_tuple(std::move(__k)),
710 std::forward_as_tuple(std::forward<_Obj>(__obj)))
714 (*__i).second = std::forward<_Obj>(__obj);
744 template <
typename _Obj>
753 std::forward_as_tuple(__k),
754 std::forward_as_tuple(
755 std::forward<_Obj>(__obj)));
757 (*__i).second = std::forward<_Obj>(__obj);
762 template <
typename _Obj>
770 std::forward_as_tuple(std::move(__k)),
771 std::forward_as_tuple(
772 std::forward<_Obj>(__obj)));
774 (*__i).second = std::forward<_Obj>(__obj);
795 {
return _M_h.erase(__position); }
800 {
return _M_h.erase(__position); }
817 {
return _M_h.erase(__x); }
835 {
return _M_h.erase(__first, __last); }
860 { _M_h.swap(__x._M_h); }
862 #if __cplusplus > 201402L
863 template<
typename,
typename,
typename>
864 friend class _Hash_merge_helper;
866 template<
typename _H2,
typename _P2>
870 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
871 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
874 template<
typename _H2,
typename _P2>
876 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
879 template<
typename _H2,
typename _P2>
881 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
883 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
884 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
887 template<
typename _H2,
typename _P2>
889 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
899 {
return _M_h.hash_function(); }
905 {
return _M_h.key_eq(); }
923 {
return _M_h.find(__x); }
927 {
return _M_h.find(__x); }
941 {
return _M_h.count(__x); }
954 {
return _M_h.equal_range(__x); }
958 {
return _M_h.equal_range(__x); }
976 {
return _M_h[__k]; }
980 {
return _M_h[std::move(__k)]; }
993 {
return _M_h.at(__k); }
997 {
return _M_h.at(__k); }
1005 {
return _M_h.bucket_count(); }
1010 {
return _M_h.max_bucket_count(); }
1019 {
return _M_h.bucket_size(__n); }
1027 bucket(
const key_type& __key)
const
1028 {
return _M_h.bucket(__key); }
1038 {
return _M_h.begin(__n); }
1049 {
return _M_h.begin(__n); }
1053 {
return _M_h.cbegin(__n); }
1064 {
return _M_h.end(__n); }
1075 {
return _M_h.end(__n); }
1079 {
return _M_h.cend(__n); }
1087 {
return _M_h.load_factor(); }
1093 {
return _M_h.max_load_factor(); }
1101 { _M_h.max_load_factor(__z); }
1112 { _M_h.rehash(__n); }
1123 { _M_h.reserve(__n); }
1125 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1155 template<
class _Key,
class _Tp,
1156 class _Hash = hash<_Key>,
1159 class unordered_multimap
1161 typedef __ummap_hashtable<_Key, _Tp, _Hash, _Pred, _Alloc> _Hashtable;
1190 #if __cplusplus > 201402L
1191 using node_type =
typename _Hashtable::node_type;
1211 : _M_h(__n, __hf, __eql, __a)
1227 template<
typename _InputIterator>
1233 : _M_h(__first, __last, __n, __hf, __eql, __a)
1258 : _M_h(__ummap._M_h, __a)
1268 : _M_h(std::move(__ummap._M_h), __a)
1287 : _M_h(__l, __n, __hf, __eql, __a)
1299 template<
typename _InputIterator>
1306 template<
typename _InputIterator>
1354 {
return _M_h.get_allocator(); }
1361 {
return _M_h.empty(); }
1366 {
return _M_h.size(); }
1371 {
return _M_h.max_size(); }
1381 {
return _M_h.begin(); }
1390 {
return _M_h.begin(); }
1394 {
return _M_h.begin(); }
1403 {
return _M_h.end(); }
1412 {
return _M_h.end(); }
1416 {
return _M_h.end(); }
1436 template<
typename... _Args>
1439 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1463 template<
typename... _Args>
1466 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1480 {
return _M_h.insert(__x); }
1484 {
return _M_h.insert(std::move(__x)); }
1486 template<
typename _Pair,
typename =
typename
1487 std::enable_if<std::is_constructible<
value_type,
1488 _Pair&&>::value>::type>
1491 {
return _M_h.insert(std::forward<_Pair>(__x)); }
1516 {
return _M_h.insert(__hint, __x); }
1522 {
return _M_h.insert(__hint, std::move(__x)); }
1524 template<
typename _Pair,
typename =
typename
1525 std::enable_if<std::is_constructible<
value_type,
1526 _Pair&&>::value>::type>
1529 {
return _M_h.insert(__hint, std::forward<_Pair>(__x)); }
1541 template<
typename _InputIterator>
1543 insert(_InputIterator __first, _InputIterator __last)
1544 { _M_h.insert(__first, __last); }
1556 { _M_h.insert(__l); }
1558 #if __cplusplus > 201402L
1563 __glibcxx_assert(__pos !=
end());
1564 return _M_h.extract(__pos);
1570 {
return _M_h.extract(__key); }
1575 {
return _M_h._M_reinsert_node_multi(
cend(), std::move(__nh)); }
1580 {
return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }
1599 {
return _M_h.erase(__position); }
1604 {
return _M_h.erase(__position); }
1620 {
return _M_h.erase(__x); }
1639 {
return _M_h.erase(__first, __last); }
1664 { _M_h.swap(__x._M_h); }
1666 #if __cplusplus > 201402L
1667 template<
typename,
typename,
typename>
1668 friend class _Hash_merge_helper;
1670 template<
typename _H2,
typename _P2>
1675 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1676 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1679 template<
typename _H2,
typename _P2>
1681 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1682 { merge(__source); }
1684 template<
typename _H2,
typename _P2>
1686 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1689 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1690 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1693 template<
typename _H2,
typename _P2>
1695 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1696 { merge(__source); }
1705 {
return _M_h.hash_function(); }
1711 {
return _M_h.key_eq(); }
1729 {
return _M_h.find(__x); }
1733 {
return _M_h.find(__x); }
1743 {
return _M_h.count(__x); }
1754 {
return _M_h.equal_range(__x); }
1758 {
return _M_h.equal_range(__x); }
1766 {
return _M_h.bucket_count(); }
1771 {
return _M_h.max_bucket_count(); }
1780 {
return _M_h.bucket_size(__n); }
1788 bucket(
const key_type& __key)
const
1789 {
return _M_h.bucket(__key); }
1799 {
return _M_h.begin(__n); }
1810 {
return _M_h.begin(__n); }
1814 {
return _M_h.cbegin(__n); }
1825 {
return _M_h.end(__n); }
1836 {
return _M_h.end(__n); }
1840 {
return _M_h.cend(__n); }
1848 {
return _M_h.load_factor(); }
1854 {
return _M_h.max_load_factor(); }
1862 { _M_h.max_load_factor(__z); }
1873 { _M_h.rehash(__n); }
1884 { _M_h.reserve(__n); }
1886 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1890 _Hash1, _Pred1, _Alloc1>&,
1892 _Hash1, _Pred1, _Alloc1>&);
1895 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1897 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1898 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1899 noexcept(noexcept(__x.swap(__y)))
1902 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1904 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1905 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1906 noexcept(noexcept(__x.swap(__y)))
1909 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1911 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1912 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1913 {
return __x._M_h._M_equal(__y._M_h); }
1915 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1917 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1918 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1919 {
return !(__x == __y); }
1921 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1923 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1924 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1925 {
return __x._M_h._M_equal(__y._M_h); }
1927 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1929 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1930 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1931 {
return !(__x == __y); }
1933 _GLIBCXX_END_NAMESPACE_CONTAINER
1935 #if __cplusplus > 201402L
1936 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1938 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
1939 typename _Alloc,
typename _Hash2,
typename _Eq2>
1940 struct _Hash_merge_helper<
1941 _GLIBCXX_STD_C::unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,
1945 template<
typename... _Tp>
1946 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
1947 template<
typename... _Tp>
1948 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
1950 friend unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>;
1953 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1954 {
return __map._M_h; }
1957 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1958 {
return __map._M_h; }
1962 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
1963 typename _Alloc,
typename _Hash2,
typename _Eq2>
1964 struct _Hash_merge_helper<
1965 _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
1969 template<
typename... _Tp>
1970 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
1971 template<
typename... _Tp>
1972 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
1974 friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
1977 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1978 {
return __map._M_h; }
1981 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1982 {
return __map._M_h; }
1984 _GLIBCXX_END_NAMESPACE_VERSION
const_iterator cend() const noexcept
Default value for rehash policy. Bucket size is (usually) the smallest prime that keeps the load fact...
iterator insert(const_iterator __hint, value_type &&__x)
Inserts a std::pair into the unordered_multimap.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
mapped_type & operator[](const key_type &__k)
Subscript ( [] ) access to unordered_map data.
_Hashtable::allocator_type allocator_type
Public typedefs.
hasher hash_function() const
Returns the hash functor object with which the unordered_multimap was constructed.
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::const_local_iterator const_local_iterator
Iterator-related typedefs.
_Hashtable::mapped_type mapped_type
Public typedefs.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
const_iterator end() const noexcept
hasher hash_function() const
Returns the hash functor object with which the unordered_map was constructed.
const_iterator cend() const noexcept
_Hashtable::value_type value_type
Public typedefs.
const_iterator begin() const noexcept
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...
std::pair< iterator, iterator > equal_range(const key_type &__x)
Finds a subsequence matching given key.
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.
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_map.
unordered_map()=default
Default constructor.
float load_factor() const noexcept
Returns the average number of elements per bucket.
void max_load_factor(float __z)
Change the unordered_map maximum load factor.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_multimap.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_map.
iterator insert(const_iterator __hint, _Pair &&__x)
Inserts a std::pair into the unordered_multimap.
A standard container composed of unique keys (containing at most one of each key value) that associat...
_Hashtable::allocator_type allocator_type
Public typedefs.
size_type count(const key_type &__x) const
Finds the number of elements.
const_local_iterator end(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket 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(const_iterator __position)
Erases an element from an unordered_multimap.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
_Hashtable::key_equal key_equal
Public typedefs.
void noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_map.
Primary class template hash.
mapped_type & operator[](key_type &&__k)
Subscript ( [] ) access to unordered_map data.
iterator insert(const_iterator __hint, const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
const_iterator end() const noexcept
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
const_local_iterator cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
std::pair< iterator, bool > insert(value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
The standard allocator, as per [20.4].
_Hashtable::local_iterator local_iterator
Iterator-related typedefs.
_GLIBCXX17_INLINE constexpr piecewise_construct_t piecewise_construct
piecewise_construct
mapped_type & at(const key_type &__k)
Access to unordered_map data.
const mapped_type & at(const key_type &__k) const
Access to unordered_map data.
allocator_type get_allocator() const noexcept
Returns the allocator object used by the unordered_multimap.
_Hashtable::hasher hasher
Public typedefs.
One of the comparison functors.
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
std::pair< iterator, bool > insert(_Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
iterator erase(const_iterator __position)
Erases an element from an unordered_map.
_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.
const_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
size_type size() const noexcept
Returns the size of the unordered_multimap.
_Hashtable::key_type key_type
Public typedefs.
_Hashtable::mapped_type mapped_type
Public typedefs.
void rehash(size_type __n)
May rehash the unordered_multimap.
const_iterator cbegin() const noexcept
void insert(initializer_list< value_type > __l)
Attempts to insert a list of elements into the unordered_multimap.
_Hashtable::hasher hasher
Public typedefs.
const_iterator cbegin() const noexcept
_Hashtable::const_pointer const_pointer
Iterator-related typedefs.
void noexcept(noexcept(_M_h.swap(__x._M_h)))
Swaps data with another unordered_multimap.
_Hashtable::iterator iterator
Iterator-related typedefs.
float load_factor() const noexcept
Returns the average number of elements per bucket.
_Hashtable::key_equal key_equal
Public typedefs.
iterator insert(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_multimap.
iterator begin() noexcept
size_type max_bucket_count() const noexcept
Returns the maximum number of buckets of 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_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
size_type size() const noexcept
Returns the size of the unordered_map.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_map.
iterator emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
size_type max_size() const noexcept
Returns the maximum size of the unordered_multimap.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
void reserve(size_type __n)
Prepare the unordered_multimap for a specified number of elements.
_Hashtable::size_type size_type
Iterator-related typedefs.
unordered_map(const allocator_type &__a)
Creates an unordered_map with no elements.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
_Hashtable::const_reference const_reference
Iterator-related typedefs.
size_type max_size() const noexcept
Returns the maximum size of the unordered_map.
std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const
Finds a subsequence matching given key.
size_type count(const key_type &__x) const
Finds the number of elements.
unordered_multimap()=default
Default constructor.
Default range hashing function: use division to fold a large number into the range [0...
unordered_multimap & operator=(initializer_list< value_type > __l)
Unordered_multimap list assignment operator.
key_equal key_eq() const
Returns the key comparison object with which the unordered_map was constructed.
unordered_multimap(const allocator_type &__a)
Creates an unordered_multimap with no elements.
bool empty() const noexcept
Returns true if the unordered_map is empty.
iterator erase(iterator __position)
Erases an element from an unordered_map.
iterator find(const key_type &__x)
Tries to locate an element in an unordered_map.
_Hashtable::value_type value_type
Public typedefs.
iterator insert(const value_type &__x)
Inserts a std::pair into the unordered_multimap.
_Hashtable::pointer pointer
Iterator-related typedefs.
size_type erase(const key_type &__x)
Erases elements according to the provided key.
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.
iterator insert(_Pair &&__x)
Inserts a std::pair into the unordered_multimap.
size_type bucket_count() const noexcept
Returns the number of buckets of the unordered_map.
_Hashtable::size_type size_type
Iterator-related typedefs.
iterator emplace_hint(const_iterator __pos, _Args &&...__args)
Attempts to build and insert a std::pair into the unordered_multimap.
local_iterator end(size_type __n)
Returns a read/write iterator pointing to one past the last bucket elements.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
iterator insert(const_iterator __hint, const value_type &__x)
Inserts a std::pair into 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.
void insert(_InputIterator __first, _InputIterator __last)
A template function that attempts to insert a range of elements.
_Hashtable::iterator iterator
Iterator-related typedefs.
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 cend(size_type __n) const
Returns a read-only (constant) iterator pointing to one past the last bucket 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.
std::pair< iterator, bool > emplace(_Args &&...__args)
Attempts to build and insert a std::pair into the unordered_map.
void max_load_factor(float __z)
Change the unordered_multimap maximum load factor.
iterator insert(const_iterator __hint, value_type &&__x)
Attempts to insert a std::pair into the unordered_map.
Struct holding two objects of arbitrary type.
iterator insert(const_iterator __hint, _Pair &&__x)
Attempts to insert a std::pair into the unordered_map.
unordered_map & operator=(const unordered_map &)=default
Copy assignment operator.
const_local_iterator begin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
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.
_Hashtable::key_type key_type
Public typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
bool empty() const noexcept
Returns true if the unordered_multimap is empty.
_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_local_iterator cbegin(size_type __n) const
Returns a read-only (constant) iterator pointing to the first bucket element.
iterator erase(iterator __position)
Erases an element from an unordered_multimap.
iterator erase(const_iterator __first, const_iterator __last)
Erases a [__first,__last) range of elements from an unordered_multimap.
void rehash(size_type __n)
May rehash the unordered_map.
_Hashtable::const_iterator const_iterator
Iterator-related typedefs.
unordered_map & operator=(initializer_list< value_type > __l)
Unordered_map list assignment operator.
std::pair< iterator, bool > insert(const value_type &__x)
Attempts to insert a std::pair into the unordered_map.
const_iterator find(const key_type &__x) const
Tries to locate an element in an unordered_multimap.
_Hashtable::pointer pointer
Iterator-related typedefs.
_Hashtable::reference reference
Iterator-related typedefs.
iterator begin() noexcept
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.
Default ranged hash function H. In principle it should be a function object composed from objects of ...
local_iterator begin(size_type __n)
Returns a read/write iterator pointing to the first bucket element.
_Hashtable::difference_type difference_type
Iterator-related typedefs.
const_iterator begin() const noexcept
A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...