30 #ifndef _UNORDERED_SET_H
31 #define _UNORDERED_SET_H
33 namespace std _GLIBCXX_VISIBILITY(default)
35 _GLIBCXX_BEGIN_NAMESPACE_VERSION
36 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
42 template<
typename _Value,
48 __detail::_Identity, _Pred, _Hash,
57 template<
typename _Value,
69 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
93 template<
typename _Value,
107 typedef typename _Hashtable::value_type value_type;
108 typedef typename _Hashtable::hasher hasher;
109 typedef typename _Hashtable::key_equal key_equal;
110 typedef typename _Hashtable::allocator_type allocator_type;
116 typedef typename _Hashtable::const_pointer const_pointer;
117 typedef typename _Hashtable::reference reference;
118 typedef typename _Hashtable::const_reference const_reference;
119 typedef typename _Hashtable::iterator iterator;
120 typedef typename _Hashtable::const_iterator const_iterator;
121 typedef typename _Hashtable::local_iterator local_iterator;
122 typedef typename _Hashtable::const_local_iterator const_local_iterator;
123 typedef typename _Hashtable::size_type size_type;
124 typedef typename _Hashtable::difference_type difference_type;
127 #if __cplusplus > 201402L
128 using node_type =
typename _Hashtable::node_type;
129 using insert_return_type =
typename _Hashtable::insert_return_type;
146 const hasher& __hf = hasher(),
147 const key_equal& __eql = key_equal(),
148 const allocator_type& __a = allocator_type())
149 : _M_h(__n, __hf, __eql, __a)
165 template<
typename _InputIterator>
168 const hasher& __hf = hasher(),
169 const key_equal& __eql = key_equal(),
170 const allocator_type& __a = allocator_type())
171 : _M_h(__first, __last, __n, __hf, __eql, __a)
195 const allocator_type& __a)
196 : _M_h(__uset._M_h, __a)
205 const allocator_type& __a)
206 : _M_h(
std::move(__uset._M_h), __a)
222 const hasher& __hf = hasher(),
223 const key_equal& __eql = key_equal(),
224 const allocator_type& __a = allocator_type())
225 : _M_h(__l, __n, __hf, __eql, __a)
233 const allocator_type& __a)
237 template<
typename _InputIterator>
240 const allocator_type& __a)
241 :
unordered_set(__first, __last, __n, hasher(), key_equal(), __a)
244 template<
typename _InputIterator>
246 size_type __n,
const hasher& __hf,
247 const allocator_type& __a)
248 :
unordered_set(__first, __last, __n, __hf, key_equal(), __a)
253 const allocator_type& __a)
258 size_type __n,
const hasher& __hf,
259 const allocator_type& __a)
292 {
return _M_h.get_allocator(); }
299 {
return _M_h.empty(); }
304 {
return _M_h.size(); }
309 {
return _M_h.max_size(); }
320 {
return _M_h.begin(); }
323 begin() const noexcept
324 {
return _M_h.begin(); }
334 {
return _M_h.end(); }
338 {
return _M_h.end(); }
347 {
return _M_h.begin(); }
355 {
return _M_h.end(); }
374 template<
typename... _Args>
377 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
400 template<
typename... _Args>
403 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
421 {
return _M_h.insert(__x); }
425 {
return _M_h.insert(std::move(__x)); }
449 insert(const_iterator __hint,
const value_type& __x)
450 {
return _M_h.insert(__hint, __x); }
453 insert(const_iterator __hint, value_type&& __x)
454 {
return _M_h.insert(__hint, std::move(__x)); }
466 template<
typename _InputIterator>
468 insert(_InputIterator __first, _InputIterator __last)
469 { _M_h.insert(__first, __last); }
480 { _M_h.insert(__l); }
482 #if __cplusplus > 201402L
485 extract(const_iterator __pos)
487 __glibcxx_assert(__pos !=
end());
488 return _M_h.extract(__pos);
494 {
return _M_h.extract(__key); }
499 {
return _M_h._M_reinsert_node(std::move(__nh)); }
503 insert(const_iterator, node_type&& __nh)
504 {
return _M_h._M_reinsert_node(std::move(__nh)).position; }
523 {
return _M_h.erase(__position); }
528 {
return _M_h.erase(__position); }
545 {
return _M_h.erase(__x); }
562 erase(const_iterator __first, const_iterator __last)
563 {
return _M_h.erase(__first, __last); }
586 noexcept( noexcept(_M_h.swap(__x._M_h)) )
587 { _M_h.swap(__x._M_h); }
589 #if __cplusplus > 201402L
590 template<
typename,
typename,
typename>
591 friend class std::_Hash_merge_helper;
593 template<
typename _H2,
typename _P2>
597 using _Merge_helper = _Hash_merge_helper<unordered_set, _H2, _P2>;
598 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
601 template<
typename _H2,
typename _P2>
603 merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)
606 template<
typename _H2,
typename _P2>
608 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>& __source)
610 using _Merge_helper = _Hash_merge_helper<unordered_set, _H2, _P2>;
611 _M_h._M_merge_unique(_Merge_helper::_S_get_table(__source));
614 template<
typename _H2,
typename _P2>
616 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)
626 {
return _M_h.hash_function(); }
632 {
return _M_h.key_eq(); }
650 {
return _M_h.find(__x); }
654 {
return _M_h.find(__x); }
668 {
return _M_h.count(__x); }
681 {
return _M_h.equal_range(__x); }
685 {
return _M_h.equal_range(__x); }
693 {
return _M_h.bucket_count(); }
698 {
return _M_h.max_bucket_count(); }
706 bucket_size(size_type __n)
const
707 {
return _M_h.bucket_size(__n); }
716 {
return _M_h.bucket(__key); }
727 {
return _M_h.begin(__n); }
730 begin(size_type __n)
const
731 {
return _M_h.begin(__n); }
734 cbegin(size_type __n)
const
735 {
return _M_h.cbegin(__n); }
747 {
return _M_h.end(__n); }
750 end(size_type __n)
const
751 {
return _M_h.end(__n); }
754 cend(size_type __n)
const
755 {
return _M_h.cend(__n); }
763 {
return _M_h.load_factor(); }
769 {
return _M_h.max_load_factor(); }
777 { _M_h.max_load_factor(__z); }
788 { _M_h.rehash(__n); }
799 { _M_h.reserve(__n); }
801 template<
typename _Value1,
typename _Hash1,
typename _Pred1,
808 #if __cpp_deduction_guides >= 201606
810 template<
typename _InputIterator,
812 hash<typename iterator_traits<_InputIterator>::value_type>,
814 equal_to<typename iterator_traits<_InputIterator>::value_type>,
815 typename _Allocator =
816 allocator<typename iterator_traits<_InputIterator>::value_type>,
817 typename = _RequireInputIter<_InputIterator>,
818 typename = _RequireAllocator<_Allocator>>
819 unordered_set(_InputIterator, _InputIterator,
820 unordered_set<int>::size_type = {},
821 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
822 -> unordered_set<
typename iterator_traits<_InputIterator>::value_type,
823 _Hash, _Pred, _Allocator>;
825 template<
typename _Tp,
typename _Hash = hash<_Tp>,
826 typename _Pred = equal_to<_Tp>,
827 typename _Allocator = allocator<_Tp>,
828 typename = _RequireAllocator<_Allocator>>
829 unordered_set(initializer_list<_Tp>,
830 unordered_set<int>::size_type = {},
831 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
832 -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
834 template<
typename _InputIterator,
typename _Allocator,
835 typename = _RequireInputIter<_InputIterator>,
836 typename = _RequireAllocator<_Allocator>>
837 unordered_set(_InputIterator, _InputIterator,
838 unordered_set<int>::size_type, _Allocator)
839 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
841 typename iterator_traits<_InputIterator>::value_type>,
843 typename iterator_traits<_InputIterator>::value_type>,
846 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
847 typename = _RequireInputIter<_InputIterator>,
848 typename = _RequireAllocator<_Allocator>>
849 unordered_set(_InputIterator, _InputIterator,
850 unordered_set<int>::size_type,
852 -> unordered_set<typename iterator_traits<_InputIterator>::value_type,
855 typename iterator_traits<_InputIterator>::value_type>,
858 template<
typename _Tp,
typename _Allocator,
859 typename = _RequireAllocator<_Allocator>>
860 unordered_set(initializer_list<_Tp>,
861 unordered_set<int>::size_type, _Allocator)
862 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
864 template<
typename _Tp,
typename _Hash,
typename _Allocator,
865 typename = _RequireAllocator<_Allocator>>
866 unordered_set(initializer_list<_Tp>,
867 unordered_set<int>::size_type, _Hash, _Allocator)
868 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
891 template<
typename _Value,
892 typename _Hash = hash<_Value>,
893 typename _Pred = equal_to<_Value>,
894 typename _Alloc = allocator<_Value>>
905 typedef typename _Hashtable::value_type value_type;
906 typedef typename _Hashtable::hasher hasher;
907 typedef typename _Hashtable::key_equal key_equal;
908 typedef typename _Hashtable::allocator_type allocator_type;
914 typedef typename _Hashtable::const_pointer const_pointer;
915 typedef typename _Hashtable::reference reference;
916 typedef typename _Hashtable::const_reference const_reference;
917 typedef typename _Hashtable::iterator iterator;
918 typedef typename _Hashtable::const_iterator const_iterator;
919 typedef typename _Hashtable::local_iterator local_iterator;
920 typedef typename _Hashtable::const_local_iterator const_local_iterator;
921 typedef typename _Hashtable::size_type size_type;
922 typedef typename _Hashtable::difference_type difference_type;
925 #if __cplusplus > 201402L
926 using node_type =
typename _Hashtable::node_type;
943 const hasher& __hf = hasher(),
944 const key_equal& __eql = key_equal(),
945 const allocator_type& __a = allocator_type())
946 : _M_h(__n, __hf, __eql, __a)
962 template<
typename _InputIterator>
965 const hasher& __hf = hasher(),
966 const key_equal& __eql = key_equal(),
967 const allocator_type& __a = allocator_type())
968 : _M_h(__first, __last, __n, __hf, __eql, __a)
990 const hasher& __hf = hasher(),
991 const key_equal& __eql = key_equal(),
992 const allocator_type& __a = allocator_type())
993 : _M_h(__l, __n, __hf, __eql, __a)
1019 const allocator_type& __a)
1020 : _M_h(__umset._M_h, __a)
1029 const allocator_type& __a)
1030 : _M_h(
std::move(__umset._M_h), __a)
1038 const allocator_type& __a)
1042 template<
typename _InputIterator>
1045 const allocator_type& __a)
1049 template<
typename _InputIterator>
1051 size_type __n,
const hasher& __hf,
1052 const allocator_type& __a)
1058 const allocator_type& __a)
1063 size_type __n,
const hasher& __hf,
1064 const allocator_type& __a)
1089 {
return _M_h.get_allocator(); }
1096 {
return _M_h.empty(); }
1101 {
return _M_h.size(); }
1106 {
return _M_h.max_size(); }
1117 {
return _M_h.begin(); }
1120 begin() const noexcept
1121 {
return _M_h.begin(); }
1131 {
return _M_h.end(); }
1134 end() const noexcept
1135 {
return _M_h.end(); }
1144 {
return _M_h.begin(); }
1152 {
return _M_h.end(); }
1163 template<
typename... _Args>
1166 {
return _M_h.emplace(std::forward<_Args>(__args)...); }
1185 template<
typename... _Args>
1188 {
return _M_h.emplace_hint(__pos, std::forward<_Args>(__args)...); }
1200 {
return _M_h.insert(__x); }
1204 {
return _M_h.insert(std::move(__x)); }
1225 insert(const_iterator __hint,
const value_type& __x)
1226 {
return _M_h.insert(__hint, __x); }
1229 insert(const_iterator __hint, value_type&& __x)
1230 {
return _M_h.insert(__hint, std::move(__x)); }
1241 template<
typename _InputIterator>
1243 insert(_InputIterator __first, _InputIterator __last)
1244 { _M_h.insert(__first, __last); }
1255 { _M_h.insert(__l); }
1257 #if __cplusplus > 201402L
1260 extract(const_iterator __pos)
1262 __glibcxx_assert(__pos !=
end());
1263 return _M_h.extract(__pos);
1269 {
return _M_h.extract(__key); }
1274 {
return _M_h._M_reinsert_node_multi(
cend(), std::move(__nh)); }
1278 insert(const_iterator __hint, node_type&& __nh)
1279 {
return _M_h._M_reinsert_node_multi(__hint, std::move(__nh)); }
1299 {
return _M_h.erase(__position); }
1304 {
return _M_h.erase(__position); }
1322 {
return _M_h.erase(__x); }
1341 erase(const_iterator __first, const_iterator __last)
1342 {
return _M_h.erase(__first, __last); }
1366 noexcept( noexcept(_M_h.swap(__x._M_h)) )
1367 { _M_h.swap(__x._M_h); }
1369 #if __cplusplus > 201402L
1370 template<
typename,
typename,
typename>
1371 friend class std::_Hash_merge_helper;
1373 template<
typename _H2,
typename _P2>
1378 = _Hash_merge_helper<unordered_multiset, _H2, _P2>;
1379 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1382 template<
typename _H2,
typename _P2>
1384 merge(unordered_multiset<_Value, _H2, _P2, _Alloc>&& __source)
1385 { merge(__source); }
1387 template<
typename _H2,
typename _P2>
1389 merge(unordered_set<_Value, _H2, _P2, _Alloc>& __source)
1392 = _Hash_merge_helper<unordered_multiset, _H2, _P2>;
1393 _M_h._M_merge_multi(_Merge_helper::_S_get_table(__source));
1396 template<
typename _H2,
typename _P2>
1398 merge(unordered_set<_Value, _H2, _P2, _Alloc>&& __source)
1399 { merge(__source); }
1408 {
return _M_h.hash_function(); }
1414 {
return _M_h.key_eq(); }
1432 {
return _M_h.find(__x); }
1436 {
return _M_h.find(__x); }
1446 {
return _M_h.count(__x); }
1457 {
return _M_h.equal_range(__x); }
1461 {
return _M_h.equal_range(__x); }
1469 {
return _M_h.bucket_count(); }
1474 {
return _M_h.max_bucket_count(); }
1482 bucket_size(size_type __n)
const
1483 {
return _M_h.bucket_size(__n); }
1491 bucket(
const key_type& __key)
const
1492 {
return _M_h.bucket(__key); }
1503 {
return _M_h.begin(__n); }
1505 const_local_iterator
1506 begin(size_type __n)
const
1507 {
return _M_h.begin(__n); }
1509 const_local_iterator
1510 cbegin(size_type __n)
const
1511 {
return _M_h.cbegin(__n); }
1523 {
return _M_h.end(__n); }
1525 const_local_iterator
1526 end(size_type __n)
const
1527 {
return _M_h.end(__n); }
1529 const_local_iterator
1530 cend(size_type __n)
const
1531 {
return _M_h.cend(__n); }
1539 {
return _M_h.load_factor(); }
1545 {
return _M_h.max_load_factor(); }
1553 { _M_h.max_load_factor(__z); }
1564 { _M_h.rehash(__n); }
1575 { _M_h.reserve(__n); }
1577 template<
typename _Value1,
typename _Hash1,
typename _Pred1,
1585 #if __cpp_deduction_guides >= 201606
1587 template<
typename _InputIterator,
1589 hash<typename iterator_traits<_InputIterator>::value_type>,
1591 equal_to<typename iterator_traits<_InputIterator>::value_type>,
1592 typename _Allocator =
1593 allocator<typename iterator_traits<_InputIterator>::value_type>,
1594 typename = _RequireInputIter<_InputIterator>,
1595 typename = _RequireAllocator<_Allocator>>
1596 unordered_multiset(_InputIterator, _InputIterator,
1597 unordered_multiset<int>::size_type = {},
1598 _Hash = _Hash(), _Pred = _Pred(),
1599 _Allocator = _Allocator())
1600 -> unordered_multiset<
typename iterator_traits<_InputIterator>::value_type,
1601 _Hash, _Pred, _Allocator>;
1603 template<
typename _Tp,
typename _Hash = hash<_Tp>,
1604 typename _Pred = equal_to<_Tp>,
1605 typename _Allocator = allocator<_Tp>,
1606 typename = _RequireAllocator<_Allocator>>
1607 unordered_multiset(initializer_list<_Tp>,
1608 unordered_multiset<int>::size_type = {},
1609 _Hash = _Hash(), _Pred = _Pred(),
1610 _Allocator = _Allocator())
1611 -> unordered_multiset<_Tp, _Hash, _Pred, _Allocator>;
1613 template<
typename _InputIterator,
typename _Allocator,
1614 typename = _RequireInputIter<_InputIterator>,
1615 typename = _RequireAllocator<_Allocator>>
1616 unordered_multiset(_InputIterator, _InputIterator,
1617 unordered_multiset<int>::size_type, _Allocator)
1618 -> unordered_multiset<typename iterator_traits<_InputIterator>::value_type,
1620 iterator_traits<_InputIterator>::value_type>,
1622 iterator_traits<_InputIterator>::value_type>,
1625 template<
typename _InputIterator,
typename _Hash,
typename _Allocator,
1626 typename = _RequireInputIter<_InputIterator>,
1627 typename = _RequireAllocator<_Allocator>>
1628 unordered_multiset(_InputIterator, _InputIterator,
1629 unordered_multiset<int>::size_type,
1631 -> unordered_multiset<
typename
1632 iterator_traits<_InputIterator>::value_type,
1636 iterator_traits<_InputIterator>::value_type>,
1639 template<
typename _Tp,
typename _Allocator,
1640 typename = _RequireAllocator<_Allocator>>
1641 unordered_multiset(initializer_list<_Tp>,
1642 unordered_multiset<int>::size_type, _Allocator)
1643 -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1645 template<
typename _Tp,
typename _Hash,
typename _Allocator,
1646 typename = _RequireAllocator<_Allocator>>
1647 unordered_multiset(initializer_list<_Tp>,
1648 unordered_multiset<int>::size_type, _Hash, _Allocator)
1649 -> unordered_multiset<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1653 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1655 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1656 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1657 noexcept(noexcept(__x.swap(__y)))
1660 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1662 swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1663 unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1664 noexcept(noexcept(__x.swap(__y)))
1667 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1669 operator==(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1670 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1671 {
return __x._M_h._M_equal(__y._M_h); }
1673 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1675 operator!=(
const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1676 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1677 {
return !(__x == __y); }
1679 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1681 operator==(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1682 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1683 {
return __x._M_h._M_equal(__y._M_h); }
1685 template<
class _Value,
class _Hash,
class _Pred,
class _Alloc>
1687 operator!=(
const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
1688 const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
1689 {
return !(__x == __y); }
1691 _GLIBCXX_END_NAMESPACE_CONTAINER
1693 #if __cplusplus > 201402L
1695 template<
typename _Val,
typename _Hash1,
typename _Eq1,
typename _Alloc,
1696 typename _Hash2,
typename _Eq2>
1697 struct _Hash_merge_helper<
1698 _GLIBCXX_STD_C::unordered_set<_Val, _Hash1, _Eq1, _Alloc>, _Hash2, _Eq2>
1701 template<
typename... _Tp>
1702 using unordered_set = _GLIBCXX_STD_C::unordered_set<_Tp...>;
1703 template<
typename... _Tp>
1704 using unordered_multiset = _GLIBCXX_STD_C::unordered_multiset<_Tp...>;
1706 friend unordered_set<_Val, _Hash1, _Eq1, _Alloc>;
1709 _S_get_table(unordered_set<_Val, _Hash2, _Eq2, _Alloc>& __set)
1710 {
return __set._M_h; }
1713 _S_get_table(unordered_multiset<_Val, _Hash2, _Eq2, _Alloc>& __set)
1714 {
return __set._M_h; }
1718 template<
typename _Val,
typename _Hash1,
typename _Eq1,
typename _Alloc,
1719 typename _Hash2,
typename _Eq2>
1720 struct _Hash_merge_helper<
1721 _GLIBCXX_STD_C::unordered_multiset<_Val, _Hash1, _Eq1, _Alloc>,
1725 template<
typename... _Tp>
1726 using unordered_set = _GLIBCXX_STD_C::unordered_set<_Tp...>;
1727 template<
typename... _Tp>
1728 using unordered_multiset = _GLIBCXX_STD_C::unordered_multiset<_Tp...>;
1730 friend unordered_multiset<_Val, _Hash1, _Eq1, _Alloc>;
1733 _S_get_table(unordered_set<_Val, _Hash2, _Eq2, _Alloc>& __set)
1734 {
return __set._M_h; }
1737 _S_get_table(unordered_multiset<_Val, _Hash2, _Eq2, _Alloc>& __set)
1738 {
return __set._M_h; }
1742 _GLIBCXX_END_NAMESPACE_VERSION