Lines Matching refs:unordered_set
15 unordered_set synopsis
24 class unordered_set
48 unordered_set()
53 explicit unordered_set(size_type n, const hasher& hf = hasher(),
57 unordered_set(InputIterator f, InputIterator l,
61 explicit unordered_set(const allocator_type&);
62 unordered_set(const unordered_set&);
63 unordered_set(const unordered_set&, const Allocator&);
64 unordered_set(unordered_set&&)
69 unordered_set(unordered_set&&, const Allocator&);
70 unordered_set(initializer_list<value_type>, size_type n = 0,
73 unordered_set(size_type n, const allocator_type& a); // C++14
74 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
76 … unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
78 unordered_set(InputIterator f, InputIterator l, size_type n,
80 unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
81 unordered_set(initializer_list<value_type> il, size_type n,
83 ~unordered_set();
84 unordered_set& operator=(const unordered_set&);
85 unordered_set& operator=(unordered_set&&)
91 unordered_set& operator=(initializer_list<value_type>);
130 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
132 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
138 void swap(unordered_set&)
189 unordered_set(InputIterator, InputIterator, typename see below::size_type = see below,
191 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
196 unordered_set(initializer_list<T>, typename see below::size_type = see below,
198 -> unordered_set<T, Hash, Pred, Allocator>; // C++17
201 unordered_set(InputIterator, InputIterator, typename see below::size_type, Allocator)
202 -> unordered_set<typename iterator_traits<InputIterator>::value_type,
208 unordered_set(InputIterator, InputIterator, typename see below::size_type,
210 -> unordered_set<typename iterator_traits<InputIterator>::value_type, Hash,
215 unordered_set(initializer_list<T>, typename see below::size_type, Allocator)
216 -> unordered_set<T, hash<T>, equal_to<T>, Allocator>; // C++17
219 unordered_set(initializer_list<T>, typename see below::size_type, Hash, Allocator)
220 -> unordered_set<T, Hash, equal_to<T>, Allocator>; // C++17
223 void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
224 unordered_set<Value, Hash, Pred, Alloc>& y)
229 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
230 const unordered_set<Value, Hash, Pred, Alloc>& y);
234 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
235 const unordered_set<Value, Hash, Pred, Alloc>& y);
348 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
350 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
441 typename unordered_set<K, T, H, P, A>::size_type
442 erase_if(unordered_set<K, T, H, P, A>& c, Predicate pred); // C++20
506 class _LIBCPP_TEMPLATE_VIS unordered_set
542 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
547 unordered_set()
552 explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
556 unordered_set(size_type __n, const allocator_type& __a)
557 : unordered_set(__n, hasher(), key_equal(), __a) {}
559 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
560 : unordered_set(__n, __hf, key_equal(), __a) {}
562 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
565 unordered_set(_InputIterator __first, _InputIterator __last);
567 unordered_set(_InputIterator __first, _InputIterator __last,
571 unordered_set(_InputIterator __first, _InputIterator __last,
577 unordered_set(_InputIterator __first, _InputIterator __last,
579 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
581 unordered_set(_InputIterator __first, _InputIterator __last,
583 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
586 explicit unordered_set(const allocator_type& __a);
587 unordered_set(const unordered_set& __u);
588 unordered_set(const unordered_set& __u, const allocator_type& __a);
591 unordered_set(unordered_set&& __u)
593 unordered_set(unordered_set&& __u, const allocator_type& __a);
594 unordered_set(initializer_list<value_type> __il);
595 unordered_set(initializer_list<value_type> __il, size_type __n,
598 unordered_set(initializer_list<value_type> __il, size_type __n,
603 unordered_set(initializer_list<value_type> __il, size_type __n,
605 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
607 unordered_set(initializer_list<value_type> __il, size_type __n,
609 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
613 ~unordered_set() {
618 unordered_set& operator=(const unordered_set& __u)
625 unordered_set& operator=(unordered_set&& __u)
628 unordered_set& operator=(initializer_list<value_type> __il);
664 "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
665 " referring to this unordered_set");
676 "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
677 " referring to this unordered_set");
693 "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
694 " referring to this unordered_set");
717 "node_type with incompatible allocator passed to unordered_set::insert()");
725 "node_type with incompatible allocator passed to unordered_set::insert()");
742 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
750 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)
775 void swap(unordered_set& __u)
890 unordered_set(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
892 -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
901 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type = 0,
903 -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
908 unordered_set(_InputIterator, _InputIterator,
910 -> unordered_set<__iter_value_type<_InputIterator>,
920 unordered_set(_InputIterator, _InputIterator,
922 -> unordered_set<__iter_value_type<_InputIterator>, _Hash,
928 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Allocator)
929 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
935 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allo…
936 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
940 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
949 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
959 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
968 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
980 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
992 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1000 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1001 const unordered_set& __u)
1010 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1011 const unordered_set& __u, const allocator_type& __a)
1023 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1024 unordered_set&& __u)
1033 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1034 unordered_set&& __u, const allocator_type& __a)
1049 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1057 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1068 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1080 unordered_set<_Value, _Hash, _Pred, _Alloc>&
1081 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u)
1090 unordered_set<_Value, _Hash, _Pred, _Alloc>&
1091 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(
1104 unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
1114 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1115 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1125 typename unordered_set<_Value, _Hash, _Pred, _Alloc>::size_type
1126 erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c,
1134 operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1135 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1139 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
1154 operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1155 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1197 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
1386 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
1394 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)