Lines Matching refs:unordered_set
17 unordered_set synopsis
26 class unordered_set
50 unordered_set()
55 explicit unordered_set(size_type n, const hasher& hf = hasher(),
59 unordered_set(InputIterator f, InputIterator l,
64 unordered_set(from_range_t, R&& rg, size_type n = see below,
67 explicit unordered_set(const allocator_type&);
68 unordered_set(const unordered_set&);
69 unordered_set(const unordered_set&, const Allocator&);
70 unordered_set(unordered_set&&)
75 unordered_set(unordered_set&&, const Allocator&);
76 unordered_set(initializer_list<value_type>, size_type n = 0,
79 unordered_set(size_type n, const allocator_type& a); // C++14
80 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
82 unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
84 unordered_set(InputIterator f, InputIterator l, size_type n,
87 unordered_set(from_range_t, R&& rg, size_type n, const allocator_type& a)
88 : unordered_set(from_range, std::forward<R>(rg), n, hasher(), key_equal(), a) { } // C++23
90 unordered_set(from_range_t, R&& rg, size_type n, const hasher& hf, const allocator_type& a)
91 : unordered_set(from_range, std::forward<R>(rg), n, hf, key_equal(), a) { } // C++23
92 unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
93 unordered_set(initializer_list<value_type> il, size_type n,
95 ~unordered_set();
96 unordered_set& operator=(const unordered_set&);
97 unordered_set& operator=(unordered_set&&)
103 unordered_set& operator=(initializer_list<value_type>);
144 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
146 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
152 void swap(unordered_set&)
203 unordered_set(InputIterator, InputIterator, typename see below::size_type = see below,
205 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
212 unordered_set(from_range_t, R&&, typename see below::size_type = see below, Hash = Hash(), Pred = Pred(), Allocator = Allocator())
213 -> unordered_set<ranges::range_value_t<R>, Hash, Pred, Allocator>; // C++23
217 unordered_set(initializer_list<T>, typename see below::size_type = see below,
219 -> unordered_set<T, Hash, Pred, Allocator>; // C++17
222 unordered_set(InputIterator, InputIterator, typename see below::size_type, Allocator)
223 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
229 unordered_set(InputIterator, InputIterator, typename see below::size_type,
231 -> unordered_set<typename iterator_traits<InputIterator>::value_type, Hash,
236 unordered_set(from_range_t, R&&, typename see below::size_type, Allocator)
237 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
241 unordered_set(from_range_t, R&&, Allocator)
242 -> unordered_set<ranges::range_value_t<R>, hash<ranges::range_value_t<R>>,
246 unordered_set(from_range_t, R&&, typename see below::size_type, Hash, Allocator)
247 -> unordered_set<ranges::range_value_t<R>, Hash,
251 unordered_set(initializer_list<T>, typename see below::size_type, Allocator)
252 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
255 unordered_set(initializer_list<T>, typename see below::size_type, Hash, Allocator)
256 -> unordered_set<T, Hash, equal_to<T>, Allocator>; // C++17
259 void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
260 unordered_set<Value, Hash, Pred, Alloc>& y)
265 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
266 const unordered_set<Value, Hash, Pred, Alloc>& y);
270 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
271 const unordered_set<Value, Hash, Pred, Alloc>& y); // removed in C++20
396 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
398 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
511 typename unordered_set<K, T, H, P, A>::size_type
512 erase_if(unordered_set<K, T, H, P, A>& c, Predicate pred); // C++20
581 class _LIBCPP_TEMPLATE_VIS unordered_set {
617 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
621 _LIBCPP_HIDE_FROM_ABI unordered_set() _NOEXCEPT_(is_nothrow_default_constructible<__table>::value) {}
623 unordered_set(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal());
625 inline _LIBCPP_HIDE_FROM_ABI unordered_set(size_type __n, const allocator_type& __a)
626 : unordered_set(__n, hasher(), key_equal(), __a) {}
627 inline _LIBCPP_HIDE_FROM_ABI unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
628 : unordered_set(__n, __hf, key_equal(), __a) {}
631 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a);
633 _LIBCPP_HIDE_FROM_ABI unordered_set(_InputIterator __first, _InputIterator __last);
636 unordered_set(_InputIterator __first,
642 _LIBCPP_HIDE_FROM_ABI unordered_set(
652 _LIBCPP_HIDE_FROM_ABI unordered_set(
670 unordered_set(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a)
671 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
673 _LIBCPP_HIDE_FROM_ABI unordered_set(
675 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
680 _LIBCPP_HIDE_FROM_ABI unordered_set(from_range_t, _Range&& __range, size_type __n, const allocator_type& __a)
681 : unordered_set(from_range, std::forward<_Range>(__range), __n, hasher(), key_equal(), __a) {}
685 unordered_set(from_range_t, _Range&& __range, size_type __n, const hasher& __hf, const allocator_type& __a)
686 : unordered_set(from_range, std::forward<_Range>(__range), __n, __hf, key_equal(), __a) {}
689 _LIBCPP_HIDE_FROM_ABI explicit unordered_set(const allocator_type& __a);
690 _LIBCPP_HIDE_FROM_ABI unordered_set(const unordered_set& __u);
691 _LIBCPP_HIDE_FROM_ABI unordered_set(const unordered_set& __u, const allocator_type& __a);
693 _LIBCPP_HIDE_FROM_ABI unordered_set(unordered_set&& __u) _NOEXCEPT_(is_nothrow_move_constructible<__table>::value);
694 _LIBCPP_HIDE_FROM_ABI unordered_set(unordered_set&& __u, const allocator_type& __a);
695 _LIBCPP_HIDE_FROM_ABI unordered_set(initializer_list<value_type> __il);
697 unordered_set(initializer_list<value_type> __il,
701 _LIBCPP_HIDE_FROM_ABI unordered_set(
709 unordered_set(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
710 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
712 unordered_set(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const allocator_type& __a)
713 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
716 _LIBCPP_HIDE_FROM_ABI ~unordered_set() {
720 _LIBCPP_HIDE_FROM_ABI unordered_set& operator=(const unordered_set& __u) {
725 _LIBCPP_HIDE_FROM_ABI unordered_set& operator=(unordered_set&& __u)
727 _LIBCPP_HIDE_FROM_ABI unordered_set& operator=(initializer_list<value_type> __il);
787 "node_type with incompatible allocator passed to unordered_set::insert()");
792 "node_type with incompatible allocator passed to unordered_set::insert()");
803 _LIBCPP_HIDE_FROM_ABI void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source) {
809 _LIBCPP_HIDE_FROM_ABI void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source) {
828 _LIBCPP_HIDE_FROM_ABI void swap(unordered_set& __u) _NOEXCEPT_(__is_nothrow_swappable_v<__table>) {
912 unordered_set(_InputIterator,
917 _Allocator = _Allocator()) -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
928 unordered_set(
934 _Allocator = _Allocator()) -> unordered_set<ranges::range_value_t<_Range>, _Hash, _Pred, _Allocator>; // C++23
945 unordered_set(initializer_list<_Tp>,
949 _Allocator = _Allocator()) -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
955 unordered_set(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Allocator)
956 -> unordered_set<__iter_value_type<_InputIterator>,
968 unordered_set(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
969 -> unordered_set<__iter_value_type<_InputIterator>, _Hash, equal_to<__iter_value_type<_InputIterator>>, _Allocator>;
974 unordered_set(from_range_t, _Range&&, typename allocator_traits<_Allocator>::size_type, _Allocator)
975 -> unordered_set<ranges::range_value_t<_Range>,
981 unordered_set(from_range_t, _Range&&, _Allocator)
982 -> unordered_set<ranges::range_value_t<_Range>,
993 unordered_set(from_range_t, _Range&&, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
994 -> unordered_set<ranges::range_value_t<_Range>, _Hash, equal_to<ranges::range_value_t<_Range>>, _Allocator>;
999 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Allocator)
1000 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
1008 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allocator)
1009 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
1013 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql)
1019 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1027 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(_InputIterator __first, _InputIterator __last) {
1033 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1042 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1055 inline unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(const allocator_type& __a) : __table_(__a) {}
1058 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(const unordered_set& __u) : __table_(__u.__table_) {
1064 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(const unordered_set& __u, const allocator_type& __a)
1073 inline unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(unordered_set&& __u)
1078 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(unordered_set&& __u, const allocator_type& __a)
1088 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(initializer_list<value_type> __il) {
1093 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1101 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1113 inline unordered_set<_Value, _Hash, _Pred, _Alloc>&
1114 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u)
1121 inline unordered_set<_Value, _Hash, _Pred, _Alloc>&
1122 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(initializer_list<value_type> __il) {
1131 inline void unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first, _InputIterator __last) {
1138 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x, unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1145 inline _LIBCPP_HIDE_FROM_ABI typename unordered_set<_Value, _Hash, _Pred, _Alloc>::size_type
1146 erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c, _Predicate __pred) {
1152 _LIBCPP_HIDE_FROM_ABI bool operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1153 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) {
1156 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator const_iterator;
1168 inline _LIBCPP_HIDE_FROM_ABI bool operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1169 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y) {
1210 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
1405 _LIBCPP_HIDE_FROM_ABI void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source) {
1411 _LIBCPP_HIDE_FROM_ABI void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source) {
1791 using unordered_set _LIBCPP_AVAILABILITY_PMR = std::unordered_set<_KeyT, _HashT, _PredT, polymorphic_allocator<_KeyT>>;