Lines Matching refs:unordered_set
2 //===-------------------------- 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&)
186 void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
187 unordered_set<Value, Hash, Pred, Alloc>& y)
192 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
193 const unordered_set<Value, Hash, Pred, Alloc>& y);
197 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
198 const unordered_set<Value, Hash, Pred, Alloc>& y);
311 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
313 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
368 typename unordered_set<K, T, H, P, A>::size_type
369 erase_if(unordered_set<K, T, H, P, A>& c, Predicate pred); // C++20
408 class _LIBCPP_TEMPLATE_VIS unordered_set
444 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
449 unordered_set()
456 explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
460 unordered_set(size_type __n, const allocator_type& __a)
461 : unordered_set(__n, hasher(), key_equal(), __a) {}
463 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
464 : unordered_set(__n, __hf, key_equal(), __a) {}
466 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
469 unordered_set(_InputIterator __first, _InputIterator __last);
471 unordered_set(_InputIterator __first, _InputIterator __last,
475 unordered_set(_InputIterator __first, _InputIterator __last,
481 unordered_set(_InputIterator __first, _InputIterator __last,
483 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
485 unordered_set(_InputIterator __first, _InputIterator __last,
487 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
490 explicit unordered_set(const allocator_type& __a);
491 unordered_set(const unordered_set& __u);
492 unordered_set(const unordered_set& __u, const allocator_type& __a);
495 unordered_set(unordered_set&& __u)
497 unordered_set(unordered_set&& __u, const allocator_type& __a);
498 unordered_set(initializer_list<value_type> __il);
499 unordered_set(initializer_list<value_type> __il, size_type __n,
502 unordered_set(initializer_list<value_type> __il, size_type __n,
507 unordered_set(initializer_list<value_type> __il, size_type __n,
509 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
511 unordered_set(initializer_list<value_type> __il, size_type __n,
513 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
517 ~unordered_set() {
522 unordered_set& operator=(const unordered_set& __u)
529 unordered_set& operator=(unordered_set&& __u)
532 unordered_set& operator=(initializer_list<value_type> __il);
570 "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
571 " referring to this unordered_set");
587 "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
588 " referring to this unordered_set");
608 … "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
609 " referring to this unordered_set");
635 "node_type with incompatible allocator passed to unordered_set::insert()");
643 "node_type with incompatible allocator passed to unordered_set::insert()");
660 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
668 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)
693 void swap(unordered_set& __u)
808 unordered_set(_InputIterator, _InputIterator, typename allocator_traits<_Allocator>::size_type = 0,
810 -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
819 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type = 0,
821 -> unordered_set<_Tp, _Hash, _Pred, _Allocator>;
825 unordered_set(_InputIterator, _InputIterator,
827 -> unordered_set<__iter_value_type<_InputIterator>,
836 unordered_set(_InputIterator, _InputIterator,
838 -> unordered_set<__iter_value_type<_InputIterator>, _Hash,
844 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Allocator)
845 -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
851 unordered_set(initializer_list<_Tp>, typename allocator_traits<_Allocator>::size_type, _Hash, _Allo…
852 -> unordered_set<_Tp, _Hash, equal_to<_Tp>, _Allocator>;
856 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
867 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
879 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
890 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
904 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
918 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
928 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
929 const unordered_set& __u)
940 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
941 const unordered_set& __u, const allocator_type& __a)
955 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
956 unordered_set&& __u)
967 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
968 unordered_set&& __u, const allocator_type& __a)
987 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
997 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1010 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
1024 unordered_set<_Value, _Hash, _Pred, _Alloc>&
1025 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u)
1034 unordered_set<_Value, _Hash, _Pred, _Alloc>&
1035 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(
1048 unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
1058 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1059 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1069 typename unordered_set<_Value, _Hash, _Pred, _Alloc>::size_type
1070 erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c,
1078 operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1079 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1083 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
1098 operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
1099 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1141 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
1332 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
1340 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)