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,
111 typedef typename _Hashtable::value_type value_type;
112 typedef typename _Hashtable::mapped_type mapped_type;
113 typedef typename _Hashtable::hasher hasher;
114 typedef typename _Hashtable::key_equal key_equal;
115 typedef typename _Hashtable::allocator_type allocator_type;
121 typedef typename _Hashtable::const_pointer const_pointer;
122 typedef typename _Hashtable::reference reference;
123 typedef typename _Hashtable::const_reference const_reference;
124 typedef typename _Hashtable::iterator iterator;
125 typedef typename _Hashtable::const_iterator const_iterator;
126 typedef typename _Hashtable::local_iterator local_iterator;
127 typedef typename _Hashtable::const_local_iterator const_local_iterator;
128 typedef typename _Hashtable::size_type size_type;
129 typedef typename _Hashtable::difference_type difference_type;
132 #if __cplusplus > 201402L
133 using node_type =
typename _Hashtable::node_type;
134 using insert_return_type =
typename _Hashtable::insert_return_type;
151 const hasher& __hf = hasher(),
152 const key_equal& __eql = key_equal(),
153 const allocator_type& __a = allocator_type())
154 : _M_h(__n, __hf, __eql, __a)
170 template<
typename _InputIterator>
173 const hasher& __hf = hasher(),
174 const key_equal& __eql = key_equal(),
175 const allocator_type& __a = allocator_type())
176 : _M_h(__first, __last, __n, __hf, __eql, __a)
200 const allocator_type& __a)
201 : _M_h(__umap._M_h, __a)
210 const allocator_type& __a)
211 : _M_h(
std::move(__umap._M_h), __a)
227 const hasher& __hf = hasher(),
228 const key_equal& __eql = key_equal(),
229 const allocator_type& __a = allocator_type())
230 : _M_h(__l, __n, __hf, __eql, __a)
238 const allocator_type& __a)
242 template<
typename _InputIterator>
245 const allocator_type& __a)
246 :
unordered_map(__first, __last, __n, hasher(), key_equal(), __a)
249 template<
typename _InputIterator>
251 size_type __n,
const hasher& __hf,
252 const allocator_type& __a)
253 :
unordered_map(__first, __last, __n, __hf, key_equal(), __a)
258 const allocator_type& __a)
263 size_type __n,
const hasher& __hf,
264 const allocator_type& __a)
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(); }
336 cbegin() const noexcept
337 {
return _M_h.begin(); }
346 {
return _M_h.end(); }
355 {
return _M_h.end(); }
358 cend() const noexcept
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
423 extract(const_iterator __pos)
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)); }
441 insert(const_iterator, node_type&& __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)
471 iterator __i =
find(__k);
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)
489 iterator __i =
find(__k);
493 std::forward_as_tuple(std::move(__k)),
494 std::forward_as_tuple(
495 std::forward<_Args>(__args)...))
530 template <
typename... _Args>
532 try_emplace(const_iterator __hint,
const key_type& __k,
535 iterator __i =
find(__k);
538 std::forward_as_tuple(__k),
539 std::forward_as_tuple(
540 std::forward<_Args>(__args)...));
545 template <
typename... _Args>
547 try_emplace(const_iterator __hint,
key_type&& __k, _Args&&... __args)
549 iterator __i =
find(__k);
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>
588 __enable_if_t<is_constructible<value_type, _Pair&&>::value,
589 pair<iterator, bool>>
591 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
617 insert(const_iterator __hint,
const value_type& __x)
618 {
return _M_h.insert(__hint, __x); }
623 insert(const_iterator __hint, value_type&& __x)
624 {
return _M_h.insert(__hint, std::move(__x)); }
626 template<
typename _Pair>
627 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
628 insert(const_iterator __hint, _Pair&& __x)
629 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
641 template<
typename _InputIterator>
643 insert(_InputIterator __first, _InputIterator __last)
644 { _M_h.insert(__first, __last); }
655 { _M_h.insert(__l); }
658 #if __cplusplus > 201402L
659 #define __cpp_lib_unordered_map_insertion 201411
680 template <
typename _Obj>
682 insert_or_assign(
const key_type& __k, _Obj&& __obj)
688 std::forward_as_tuple(__k),
689 std::forward_as_tuple(std::forward<_Obj>(__obj)))
693 (*__i).second = std::forward<_Obj>(__obj);
698 template <
typename _Obj>
700 insert_or_assign(
key_type&& __k, _Obj&& __obj)
702 iterator __i =
find(__k);
706 std::forward_as_tuple(std::move(__k)),
707 std::forward_as_tuple(std::forward<_Obj>(__obj)))
711 (*__i).second = std::forward<_Obj>(__obj);
741 template <
typename _Obj>
743 insert_or_assign(const_iterator __hint,
const key_type& __k,
746 iterator __i =
find(__k);
750 std::forward_as_tuple(__k),
751 std::forward_as_tuple(
752 std::forward<_Obj>(__obj)));
754 (*__i).second = std::forward<_Obj>(__obj);
759 template <
typename _Obj>
761 insert_or_assign(const_iterator __hint,
key_type&& __k, _Obj&& __obj)
763 iterator __i =
find(__k);
767 std::forward_as_tuple(std::move(__k)),
768 std::forward_as_tuple(
769 std::forward<_Obj>(__obj)));
771 (*__i).second = std::forward<_Obj>(__obj);
792 {
return _M_h.erase(__position); }
797 {
return _M_h.erase(__position); }
814 {
return _M_h.erase(__x); }
831 erase(const_iterator __first, const_iterator __last)
832 {
return _M_h.erase(__first, __last); }
856 noexcept( noexcept(_M_h.swap(__x._M_h)) )
857 { _M_h.swap(__x._M_h); }
859 #if __cplusplus > 201402L
860 template<
typename,
typename,
typename>
861 friend class _Hash_merge_helper;
863 template<
typename _H2,
typename _P2>
867 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
868 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
871 template<
typename _H2,
typename _P2>
873 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
876 template<
typename _H2,
typename _P2>
878 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>& __source)
880 using _Merge_helper = _Hash_merge_helper<unordered_map, _H2, _P2>;
881 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
884 template<
typename _H2,
typename _P2>
886 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
896 {
return _M_h.hash_function(); }
902 {
return _M_h.key_eq(); }
920 {
return _M_h.find(__x); }
924 {
return _M_h.find(__x); }
938 {
return _M_h.count(__x); }
951 {
return _M_h.equal_range(__x); }
955 {
return _M_h.equal_range(__x); }
973 {
return _M_h[__k]; }
977 {
return _M_h[std::move(__k)]; }
990 {
return _M_h.at(__k); }
994 {
return _M_h.at(__k); }
1002 {
return _M_h.bucket_count(); }
1007 {
return _M_h.max_bucket_count(); }
1015 bucket_size(size_type __n)
const
1016 {
return _M_h.bucket_size(__n); }
1024 bucket(
const key_type& __key)
const
1025 {
return _M_h.bucket(__key); }
1035 {
return _M_h.begin(__n); }
1044 const_local_iterator
1046 {
return _M_h.begin(__n); }
1048 const_local_iterator
1049 cbegin(size_type __n)
const
1050 {
return _M_h.cbegin(__n); }
1061 {
return _M_h.end(__n); }
1070 const_local_iterator
1072 {
return _M_h.end(__n); }
1074 const_local_iterator
1075 cend(size_type __n)
const
1076 {
return _M_h.cend(__n); }
1084 {
return _M_h.load_factor(); }
1090 {
return _M_h.max_load_factor(); }
1098 { _M_h.max_load_factor(__z); }
1109 { _M_h.rehash(__n); }
1120 { _M_h.reserve(__n); }
1122 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1152 template<
class _Key,
class _Tp,
1153 class _Hash = hash<_Key>,
1166 typedef typename _Hashtable::value_type value_type;
1167 typedef typename _Hashtable::mapped_type mapped_type;
1168 typedef typename _Hashtable::hasher hasher;
1169 typedef typename _Hashtable::key_equal key_equal;
1170 typedef typename _Hashtable::allocator_type allocator_type;
1176 typedef typename _Hashtable::const_pointer const_pointer;
1177 typedef typename _Hashtable::reference reference;
1178 typedef typename _Hashtable::const_reference const_reference;
1179 typedef typename _Hashtable::iterator iterator;
1180 typedef typename _Hashtable::const_iterator const_iterator;
1181 typedef typename _Hashtable::local_iterator local_iterator;
1182 typedef typename _Hashtable::const_local_iterator const_local_iterator;
1183 typedef typename _Hashtable::size_type size_type;
1184 typedef typename _Hashtable::difference_type difference_type;
1187 #if __cplusplus > 201402L
1188 using node_type =
typename _Hashtable::node_type;
1205 const hasher& __hf = hasher(),
1206 const key_equal& __eql = key_equal(),
1207 const allocator_type& __a = allocator_type())
1208 : _M_h(__n, __hf, __eql, __a)
1224 template<
typename _InputIterator>
1227 const hasher& __hf = hasher(),
1228 const key_equal& __eql = key_equal(),
1229 const allocator_type& __a = allocator_type())
1230 : _M_h(__first, __last, __n, __hf, __eql, __a)
1254 const allocator_type& __a)
1255 : _M_h(__ummap._M_h, __a)
1264 const allocator_type& __a)
1265 : _M_h(
std::move(__ummap._M_h), __a)
1281 const hasher& __hf = hasher(),
1282 const key_equal& __eql = key_equal(),
1283 const allocator_type& __a = allocator_type())
1284 : _M_h(__l, __n, __hf, __eql, __a)
1292 const allocator_type& __a)
1296 template<
typename _InputIterator>
1299 const allocator_type& __a)
1303 template<
typename _InputIterator>
1305 size_type __n,
const hasher& __hf,
1306 const allocator_type& __a)
1312 const allocator_type& __a)
1317 size_type __n,
const hasher& __hf,
1318 const allocator_type& __a)
1351 {
return _M_h.get_allocator(); }
1358 {
return _M_h.empty(); }
1363 {
return _M_h.size(); }
1368 {
return _M_h.max_size(); }
1378 {
return _M_h.begin(); }
1387 {
return _M_h.begin(); }
1390 cbegin() const noexcept
1391 {
return _M_h.begin(); }
1400 {
return _M_h.end(); }
1409 {
return _M_h.end(); }
1412 cend() const noexcept
1413 {
return _M_h.end(); }
1433 template<
typename... _Args>
1436 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1460 template<
typename... _Args>
1463 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1477 {
return _M_h.insert(__x); }
1481 {
return _M_h.insert(std::move(__x)); }
1483 template<
typename _Pair>
1484 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
1486 {
return _M_h.emplace(std::forward<_Pair>(__x)); }
1510 insert(const_iterator __hint,
const value_type& __x)
1511 {
return _M_h.insert(__hint, __x); }
1516 insert(const_iterator __hint, value_type&& __x)
1517 {
return _M_h.insert(__hint, std::move(__x)); }
1519 template<
typename _Pair>
1520 __enable_if_t<is_constructible<value_type, _Pair&&>::value, iterator>
1521 insert(const_iterator __hint, _Pair&& __x)
1522 {
return _M_h.emplace_hint(__hint, std::forward<_Pair>(__x)); }
1534 template<
typename _InputIterator>
1536 insert(_InputIterator __first, _InputIterator __last)
1537 { _M_h.insert(__first, __last); }
1549 { _M_h.insert(__l); }
1551 #if __cplusplus > 201402L
1554 extract(const_iterator __pos)
1556 __glibcxx_assert(__pos !=
end());
1557 return _M_h.extract(__pos);
1563 {
return _M_h.extract(__key); }
1568 {
return _M_h._M_reinsert_node_multi(cend(), std::move(__nh)); }
1572 insert(const_iterator __hint, node_type&& __nh)
1573 {
return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }
1592 {
return _M_h.erase(__position); }
1597 {
return _M_h.erase(__position); }
1613 {
return _M_h.erase(__x); }
1631 erase(const_iterator __first, const_iterator __last)
1632 {
return _M_h.erase(__first, __last); }
1656 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1657 { _M_h.swap(__x._M_h); }
1659 #if __cplusplus > 201402L
1660 template<
typename,
typename,
typename>
1661 friend class _Hash_merge_helper;
1663 template<
typename _H2,
typename _P2>
1668 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1669 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1672 template<
typename _H2,
typename _P2>
1674 merge(unordered_multimap<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1675 { merge(__source); }
1677 template<
typename _H2,
typename _P2>
1679 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>& __source)
1682 = _Hash_merge_helper<unordered_multimap, _H2, _P2>;
1683 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1686 template<
typename _H2,
typename _P2>
1688 merge(unordered_map<_Key, _Tp, _H2, _P2, _Alloc>&& __source)
1689 { merge(__source); }
1698 {
return _M_h.hash_function(); }
1704 {
return _M_h.key_eq(); }
1722 {
return _M_h.find(__x); }
1726 {
return _M_h.find(__x); }
1736 {
return _M_h.count(__x); }
1747 {
return _M_h.equal_range(__x); }
1751 {
return _M_h.equal_range(__x); }
1759 {
return _M_h.bucket_count(); }
1764 {
return _M_h.max_bucket_count(); }
1772 bucket_size(size_type __n)
const
1773 {
return _M_h.bucket_size(__n); }
1781 bucket(
const key_type& __key)
const
1782 {
return _M_h.bucket(__key); }
1792 {
return _M_h.begin(__n); }
1801 const_local_iterator
1803 {
return _M_h.begin(__n); }
1805 const_local_iterator
1806 cbegin(size_type __n)
const
1807 {
return _M_h.cbegin(__n); }
1818 {
return _M_h.end(__n); }
1827 const_local_iterator
1829 {
return _M_h.end(__n); }
1831 const_local_iterator
1832 cend(size_type __n)
const
1833 {
return _M_h.cend(__n); }
1841 {
return _M_h.load_factor(); }
1847 {
return _M_h.max_load_factor(); }
1855 { _M_h.max_load_factor(__z); }
1866 { _M_h.rehash(__n); }
1877 { _M_h.reserve(__n); }
1879 template<
typename _Key1,
typename _Tp1,
typename _Hash1,
typename _Pred1,
1883 _Hash1, _Pred1, _Alloc1>&,
1885 _Hash1, _Pred1, _Alloc1>&);
1888 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1890 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1891 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1892 noexcept(noexcept(__x.swap(__y)))
1895 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1897 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1898 unordered_multimap<_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 operator==(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1905 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1906 {
return __x._M_h._M_equal(__y._M_h); }
1908 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1910 operator!=(
const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1911 const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1912 {
return !(__x == __y); }
1914 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1916 operator==(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1917 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1918 {
return __x._M_h._M_equal(__y._M_h); }
1920 template<
class _Key,
class _Tp,
class _Hash,
class _Pred,
class _Alloc>
1922 operator!=(
const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
1923 const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
1924 {
return !(__x == __y); }
1926 _GLIBCXX_END_NAMESPACE_CONTAINER
1928 #if __cplusplus > 201402L
1929 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1931 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
1932 typename _Alloc,
typename _Hash2,
typename _Eq2>
1933 struct _Hash_merge_helper<
1934 _GLIBCXX_STD_C::unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>,
1938 template<
typename... _Tp>
1939 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
1940 template<
typename... _Tp>
1941 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
1943 friend unordered_map<_Key, _Val, _Hash1, _Eq1, _Alloc>;
1946 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1947 {
return __map._M_h; }
1950 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1951 {
return __map._M_h; }
1955 template<
typename _Key,
typename _Val,
typename _Hash1,
typename _Eq1,
1956 typename _Alloc,
typename _Hash2,
typename _Eq2>
1957 struct _Hash_merge_helper<
1958 _GLIBCXX_STD_C::unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>,
1962 template<
typename... _Tp>
1963 using unordered_map = _GLIBCXX_STD_C::unordered_map<_Tp...>;
1964 template<
typename... _Tp>
1965 using unordered_multimap = _GLIBCXX_STD_C::unordered_multimap<_Tp...>;
1967 friend unordered_multimap<_Key, _Val, _Hash1, _Eq1, _Alloc>;
1970 _S_get_table(unordered_map<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1971 {
return __map._M_h; }
1974 _S_get_table(unordered_multimap<_Key, _Val, _Hash2, _Eq2, _Alloc>& __map)
1975 {
return __map._M_h; }
1977 _GLIBCXX_END_NAMESPACE_VERSION