Lines Matching refs:unordered_set
2 //===-------------------------- unordered_set -----------------------------===//
16 unordered_set synopsis
25 class unordered_set
49 unordered_set()
54 explicit unordered_set(size_type n, const hasher& hf = hasher(),
58 unordered_set(InputIterator f, InputIterator l,
62 explicit unordered_set(const allocator_type&);
63 unordered_set(const unordered_set&);
64 unordered_set(const unordered_set&, const Allocator&);
65 unordered_set(unordered_set&&)
70 unordered_set(unordered_set&&, const Allocator&);
71 unordered_set(initializer_list<value_type>, size_type n = 0,
74 unordered_set(size_type n, const allocator_type& a); // C++14
75 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
77 … unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
79 unordered_set(InputIterator f, InputIterator l, size_type n,
81 unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
82 unordered_set(initializer_list<value_type> il, size_type n,
84 ~unordered_set();
85 unordered_set& operator=(const unordered_set&);
86 unordered_set& operator=(unordered_set&&)
92 unordered_set& operator=(initializer_list<value_type>);
131 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
133 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
139 void swap(unordered_set&)
174 void swap(unordered_set<Value, Hash, Pred, Alloc>& x,
175 unordered_set<Value, Hash, Pred, Alloc>& y)
180 operator==(const unordered_set<Value, Hash, Pred, Alloc>& x,
181 const unordered_set<Value, Hash, Pred, Alloc>& y);
185 operator!=(const unordered_set<Value, Hash, Pred, Alloc>& x,
186 const unordered_set<Value, Hash, Pred, Alloc>& y);
299 void merge(unordered_set<Key, H2, P2, Allocator>& source); // C++17
301 void merge(unordered_set<Key, H2, P2, Allocator>&& source); // C++17
343 void erase_if(unordered_set<K, T, H, P, A>& c, Predicate pred); // C++20
381 class _LIBCPP_TEMPLATE_VIS unordered_set
418 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
423 unordered_set()
430 explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
434 unordered_set(size_type __n, const allocator_type& __a)
435 : unordered_set(__n, hasher(), key_equal(), __a) {}
437 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
438 : unordered_set(__n, __hf, key_equal(), __a) {}
440 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
443 unordered_set(_InputIterator __first, _InputIterator __last);
445 unordered_set(_InputIterator __first, _InputIterator __last,
449 unordered_set(_InputIterator __first, _InputIterator __last,
455 unordered_set(_InputIterator __first, _InputIterator __last,
457 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
459 unordered_set(_InputIterator __first, _InputIterator __last,
461 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
464 explicit unordered_set(const allocator_type& __a);
465 unordered_set(const unordered_set& __u);
466 unordered_set(const unordered_set& __u, const allocator_type& __a);
469 unordered_set(unordered_set&& __u)
471 unordered_set(unordered_set&& __u, const allocator_type& __a);
472 unordered_set(initializer_list<value_type> __il);
473 unordered_set(initializer_list<value_type> __il, size_type __n,
476 unordered_set(initializer_list<value_type> __il, size_type __n,
481 unordered_set(initializer_list<value_type> __il, size_type __n,
483 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
485 unordered_set(initializer_list<value_type> __il, size_type __n,
487 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
490 // ~unordered_set() = default;
492 unordered_set& operator=(const unordered_set& __u)
499 unordered_set& operator=(unordered_set&& __u)
502 unordered_set& operator=(initializer_list<value_type> __il);
540 "unordered_set::emplace_hint(const_iterator, args...) called with an iterator not"
541 " referring to this unordered_set");
557 "unordered_set::insert(const_iterator, value_type&&) called with an iterator not"
558 " referring to this unordered_set");
578 … "unordered_set::insert(const_iterator, const value_type&) called with an iterator not"
579 " referring to this unordered_set");
605 "node_type with incompatible allocator passed to unordered_set::insert()");
613 "node_type with incompatible allocator passed to unordered_set::insert()");
630 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
638 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)
663 void swap(unordered_set& __u)
735 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
746 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
758 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
769 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
783 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
797 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
807 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
808 const unordered_set& __u)
819 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
820 const unordered_set& __u, const allocator_type& __a)
834 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
835 unordered_set&& __u)
846 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
847 unordered_set&& __u, const allocator_type& __a)
866 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
876 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
889 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
903 unordered_set<_Value, _Hash, _Pred, _Alloc>&
904 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(unordered_set&& __u)
913 unordered_set<_Value, _Hash, _Pred, _Alloc>&
914 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(
927 unordered_set<_Value, _Hash, _Pred, _Alloc>::insert(_InputIterator __first,
937 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
938 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
947 void erase_if(unordered_set<_Value, _Hash, _Pred, _Alloc>& __c, _Predicate __pred)
953 operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
954 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
958 typedef typename unordered_set<_Value, _Hash, _Pred, _Alloc>::const_iterator
973 operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
974 const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1017 friend class _LIBCPP_TEMPLATE_VIS unordered_set;
1204 void merge(unordered_set<key_type, _H2, _P2, allocator_type>& __source)
1212 void merge(unordered_set<key_type, _H2, _P2, allocator_type>&& __source)