std::unordered_set< _Value, _Hash, _Pred, _Alloc > - A standard container composed of unique keys

       Generated automatically by Doxygen for libstdc++ from the source code.

                                                    libststd::unordered_set<_Va..._Hash,_Pred,_Alloc>(3cxx)

template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set()[default]
       Default constructor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(size_type__n,consthasher&__hf=hasher(),constkey_equal&__eql=key_equal(),constallocator_type&__a=allocator_type())[inline],[explicit]
       Default constructor creates no elements.

       Parameters__n Minimal initial number of buckets.
           __hf A hash functor.
           __eql A key equality functor.
           __a An allocator object.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_InputIterator>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(_InputIterator__first,_InputIterator__last,size_type__n=0,consthasher&__hf=hasher(),constkey_equal&__eql=key_equal(),constallocator_type&__a=allocator_type())[inline]
       Builds an unordered_set from a range.

       Parameters__first An input iterator.
           __last An input iterator.
           __n Minimal initial number of buckets.
           __hf A hash functor.
           __eql A key equality functor.
           __a An allocator object.

       Create an unordered_set consisting of copies of the elements from [__first,__last). This is linear in N
       (where N is distance(__first,__last)).

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(constunordered_set<_Value,_Hash,_Pred,_Alloc>&)[default]
       Copy constructor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(unordered_set<_Value,_Hash,_Pred,_Alloc>&&)[default]
       Move constructor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(constallocator_type&__a)[inline],[explicit]
       Creates an unordered_set with no elements.

       Parameters__a An allocator object.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::unordered_set(initializer_list<value_type>__l,size_type__n=0,consthasher&__hf=hasher(),constkey_equal&__eql=key_equal(),constallocator_type&__a=allocator_type())[inline]
       Builds an unordered_set from an initializer_list.

       Parameters__l An initializer_list.
           __n Minimal initial number of buckets.
           __hf A hash functor.
           __eql A key equality functor.
           __a An allocator object.

       Create an unordered_set consisting of copies of the elements in the list. This is linear in N (where N is
       __l.size()).

template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>
       class std::unordered_set< _Value, _Hash, _Pred, _Alloc >"A standard container composed of unique keys
       (containing at most one of each key value) in which the elements' keys are the elements themselves.

       Since
           C++11

       TemplateParameters_Value Type of key objects.
           _Hash Hashing function object type, defaults to hash<_Value>.
           _Pred Predicate function object type, defaults to equal_to<_Value>.
           _Alloc Allocator type, defaults to allocator<_Key>.

       Meets the requirements of a container, and unordered associative container

       Base is _Hashtable, dispatched at compile time via template alias __uset_hashtable.

template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::begin()const[inline],[noexcept]
       Returns a read-only (constant) iterator that points to the first element in the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::begin()[inline],[noexcept]
       Returns a read-only (constant) iterator that points to the first element in the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::begin(size_type__n)[inline]
       Returns a read-only (constant) iterator pointing to the first bucket element.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::begin(size_type__n)const[inline]
       Returns a read-only (constant) iterator pointing to the first bucket element.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::bucket_count()const[inline],[noexcept]
       Returns the number of buckets of the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::cbegin()const[inline],[noexcept]
       Returns a read-only (constant) iterator that points to the first element in the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::cbegin(size_type__n)const[inline]
       Returns a read-only (constant) iterator pointing to the first bucket element.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::cend()const[inline],[noexcept]
       Returns a read-only (constant) iterator that points one past the last element in the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::cend(size_type__n)const[inline]
       Returns a read-only (constant) iterator pointing to one past the last bucket elements.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::clear()[inline],[noexcept]
       Erases all elements in an unordered_set. Note that this function only erases the elements, and that if
       the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the
       pointer is the user's responsibility.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::contains(const_Kt&__k)const->decltype(_M_h._M_find_tr(__k),void(),true)
             [inline]"

       Finds whether an element with the given key exists.

       Parameters__x Key of elements to be located.

       Returns
           True if there is any element with the specified key.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>boolstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::contains(constkey_type&__x)const[inline]
       Finds whether an element with the given key exists.

       Parameters__x Key of elements to be located.

       Returns
           True if there is any element with the specified key.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::count(const_Kt&__k)const->decltype(_M_h._M_count_tr(__k))
             [inline]"

       Finds the number of elements.

       Parameters__x Element to located.

       Returns
           Number of elements with specified key.

       This function only makes sense for unordered_multisets; for unordered_set the result will either be 0
       (not present) or 1 (present).

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::count(constkey_type&__x)const[inline]
       Finds the number of elements.

       Parameters__x Element to located.

       Returns
           Number of elements with specified key.

       This function only makes sense for unordered_multisets; for unordered_set the result will either be 0
       (not present) or 1 (present).

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename..._Args>std::pair<iterator,bool>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::emplace(_Args&&...__args)[inline]
       Attempts to build and insert an element into the unordered_set.

       Parameters__args Arguments used to generate an element.

       Returns
           A pair, of which the first element is an iterator that points to the possibly inserted element, and
           the second is a bool that is true if the element was actually inserted.

       This function attempts to build and insert an element into the unordered_set. An unordered_set relies on
       unique keys and thus an element is only inserted if it is not already present in the unordered_set.

       Insertion requires amortized constant time.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename..._Args>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::emplace_hint(const_iterator__pos,_Args&&...__args)[inline]
       Attempts to insert an element into the unordered_set.

       Parameters__pos An iterator that serves as a hint as to where the element should be inserted.
           __args Arguments used to generate the element to be inserted.

       Returns
           An iterator that points to the element with key equivalent to the one generated from __args (may or
           may not be the element itself).

       This function is not concerned about whether the insertion took place, and thus does not return a boolean
       like the single-argument emplace() does. Note that the first parameter is only a hint and can potentially
       improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

       For more on hinting, see:
       https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints

       Insertion requires amortized constant time.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>boolstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::empty()const[inline],[noexcept]
       Returns true if the unordered_set is empty.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::end()const[inline],[noexcept]
       Returns a read-only (constant) iterator that points one past the last element in the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::end()[inline],[noexcept]
       Returns a read-only (constant) iterator that points one past the last element in the unordered_set.

       Referenced by std::unordered_set<_Value,_Hash,_Pred,_Alloc>::extract().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::end(size_type__n)[inline]
       Returns a read-only (constant) iterator pointing to one past the last bucket elements.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::end(size_type__n)const[inline]
       Returns a read-only (constant) iterator pointing to one past the last bucket elements.

       Parameters__n The bucket index.

       Returns
           A read-only local iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::equal_range(const_Kt&__k)->decltype(_M_h._M_equal_range_tr(__k))
             [inline]"

       Finds a subsequence matching given key.

       Parameters__x Key to be located.

       Returns
           Pair of iterators that possibly points to the subsequence matching given key.

       This function probably only makes sense for multisets.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::equal_range(const_Kt&__k)const->decltype(_M_h._M_equal_range_tr(__k))
             [inline]"

       Finds a subsequence matching given key.

       Parameters__x Key to be located.

       Returns
           Pair of iterators that possibly points to the subsequence matching given key.

       This function probably only makes sense for multisets.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::pair<iterator,iterator>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::equal_range(constkey_type&__x)[inline]
       Finds a subsequence matching given key.

       Parameters__x Key to be located.

       Returns
           Pair of iterators that possibly points to the subsequence matching given key.

       This function probably only makes sense for multisets.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::pair<const_iterator,const_iterator>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::equal_range(constkey_type&__x)const[inline]
       Finds a subsequence matching given key.

       Parameters__x Key to be located.

       Returns
           Pair of iterators that possibly points to the subsequence matching given key.

       This function probably only makes sense for multisets.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::erase(constkey_type&__x)[inline]
       Erases elements according to the provided key.

       Parameters__x Key of element to be erased.

       Returns
           The number of elements erased.

       This function erases all the elements located by the given key from an unordered_set. For an
       unordered_set the result of this function can only be 0 (not present) or 1 (present). Note that this
       function only erases the element, and that if the element is itself a pointer, the pointed-to memory is
       not touched in any way. Managing the pointer is the user's responsibility.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::erase(const_iterator__first,const_iterator__last)[inline]
       Erases a [__first,__last) range of elements from an unordered_set.

       Parameters__first Iterator pointing to the start of the range to be erased.
           __last Iterator pointing to the end of the range to be erased.

       Returns
           The iterator __last.

       This function erases a sequence of elements from an unordered_set. Note that this function only erases
       the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any
       way. Managing the pointer is the user's responsibility.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::erase(const_iterator__position)[inline]
       Erases an element from an unordered_set.

       Parameters__position An iterator pointing to the element to be erased.

       Returns
           An iterator pointing to the element immediately following __position prior to the element being
           erased. If no such element exists, end() is returned.

       This function erases an element, pointed to by the given iterator, from an unordered_set. Note that this
       function only erases the element, and that if the element is itself a pointer, the pointed-to memory is
       not touched in any way. Managing the pointer is the user's responsibility.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::erase(iterator__position)[inline]
       Erases an element from an unordered_set.

       Parameters__position An iterator pointing to the element to be erased.

       Returns
           An iterator pointing to the element immediately following __position prior to the element being
           erased. If no such element exists, end() is returned.

       This function erases an element, pointed to by the given iterator, from an unordered_set. Note that this
       function only erases the element, and that if the element is itself a pointer, the pointed-to memory is
       not touched in any way. Managing the pointer is the user's responsibility.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>node_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::extract(constkey_type&__key)[inline]
       Extract a node.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>node_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::extract(const_iterator__pos)[inline]
       Extract a node.

       References std::unordered_set<_Value,_Hash,_Pred,_Alloc>::end().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::find(const_Kt&__k)->decltype(_M_h._M_find_tr(__k))
             [inline]"

       Tries to locate an element in an unordered_set.

       Parameters__x Element to be located.

       Returns
           Iterator pointing to sought-after element, or end() if not found.

       This function takes a key and tries to locate the element with which the key matches. If successful the
       function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
       the-end ( end() ) iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_Kt>autostd::unordered_set<_Value,_Hash,_Pred,_Alloc>::find(const_Kt&__k)const->decltype(_M_h._M_find_tr(__k))
             [inline]"

       Tries to locate an element in an unordered_set.

       Parameters__x Element to be located.

       Returns
           Iterator pointing to sought-after element, or end() if not found.

       This function takes a key and tries to locate the element with which the key matches. If successful the
       function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
       the-end ( end() ) iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::find(constkey_type&__x)[inline]
       Tries to locate an element in an unordered_set.

       Parameters__x Element to be located.

       Returns
           Iterator pointing to sought-after element, or end() if not found.

       This function takes a key and tries to locate the element with which the key matches. If successful the
       function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
       the-end ( end() ) iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::find(constkey_type&__x)const[inline]
       Tries to locate an element in an unordered_set.

       Parameters__x Element to be located.

       Returns
           Iterator pointing to sought-after element, or end() if not found.

       This function takes a key and tries to locate the element with which the key matches. If successful the
       function returns an iterator pointing to the sought after element. If unsuccessful it returns the past-
       the-end ( end() ) iterator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>allocator_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::get_allocator()const[inline],[noexcept]
       Returns the allocator object used by the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>hasherstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::hash_function()const[inline]
       Returns the hash functor object with which the unordered_set was constructed.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>template<typename_InputIterator>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(_InputIterator__first,_InputIterator__last)[inline]
       A template function that attempts to insert a range of elements.

       Parameters__first Iterator pointing to the start of the range to be inserted.
           __last Iterator pointing to the end of the range.

       Complexity similar to that of the range constructor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::pair<iterator,bool>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(constvalue_type&__x)[inline]
       Attempts to insert an element into the unordered_set.

       Parameters__x Element to be inserted.

       Returns
           A pair, of which the first element is an iterator that points to the possibly inserted element, and
           the second is a bool that is true if the element was actually inserted.

       This function attempts to insert an element into the unordered_set. An unordered_set relies on unique
       keys and thus an element is only inserted if it is not already present in the unordered_set.

       Insertion requires amortized constant time.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(const_iterator__hint,constvalue_type&__x)[inline]
       Attempts to insert an element into the unordered_set.

       Parameters__hint An iterator that serves as a hint as to where the element should be inserted.
           __x Element to be inserted.

       Returns
           An iterator that points to the element with key of __x (may or may not be the element passed in).

       This function is not concerned about whether the insertion took place, and thus does not return a boolean
       like the single-argument insert() does. Note that the first parameter is only a hint and can potentially
       improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

       For more on hinting, see:
       https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints

       Insertion requires amortized constant.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(const_iterator__hint,value_type&&__x)[inline]
       Attempts to insert an element into the unordered_set.

       Parameters__hint An iterator that serves as a hint as to where the element should be inserted.
           __x Element to be inserted.

       Returns
           An iterator that points to the element with key of __x (may or may not be the element passed in).

       This function is not concerned about whether the insertion took place, and thus does not return a boolean
       like the single-argument insert() does. Note that the first parameter is only a hint and can potentially
       improve the performance of the insertion process. A bad hint would cause no gains in efficiency.

       For more on hinting, see:
       https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints

       Insertion requires amortized constant.

       References std::move().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(const_iterator,node_type&&__nh)[inline]
       Re-insert an extracted node.

       References std::move().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(initializer_list<value_type>__l)[inline]
       Attempts to insert a list of elements into the unordered_set.

       Parameters__l A std::initializer_list<value_type> of elements to be inserted.

       Complexity similar to that of the range constructor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>insert_return_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(node_type&&__nh)[inline]
       Re-insert an extracted node.

       References std::move().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>std::pair<iterator,bool>std::unordered_set<_Value,_Hash,_Pred,_Alloc>::insert(value_type&&__x)[inline]
       Attempts to insert an element into the unordered_set.

       Parameters__x Element to be inserted.

       Returns
           A pair, of which the first element is an iterator that points to the possibly inserted element, and
           the second is a bool that is true if the element was actually inserted.

       This function attempts to insert an element into the unordered_set. An unordered_set relies on unique
       keys and thus an element is only inserted if it is not already present in the unordered_set.

       Insertion requires amortized constant time.

       References std::move().

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>key_equalstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::key_eq()const[inline]
       Returns the key comparison object with which the unordered_set was constructed.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>floatstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::load_factor()const[inline],[noexcept]
       Returns the average number of elements per bucket.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::max_bucket_count()const[inline],[noexcept]
       Returns the maximum number of buckets of the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>floatstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::max_load_factor()const[inline],[noexcept]
       Returns a positive number that the unordered_set tries to keep the load factor less than or equal to.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::max_load_factor(float__z)[inline]
       Change the unordered_set maximum load factor.

       Parameters__z The new maximum load factor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::max_size()const[inline],[noexcept]
       Returns the maximum size of the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>unordered_set&std::unordered_set<_Value,_Hash,_Pred,_Alloc>::operator=(constunordered_set<_Value,_Hash,_Pred,_Alloc>&)[default]
       Copy assignment operator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>unordered_set&std::unordered_set<_Value,_Hash,_Pred,_Alloc>::operator=(initializer_list<value_type>__l)[inline]
       Unordered_set list assignment operator.

       Parameters__l An initializer_list.

       This function fills an unordered_set with copies of the elements in the initializer list __l.

       Note that the assignment completely changes the unordered_set and that the resulting unordered_set's size
       is the same as the number of elements assigned.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>unordered_set&std::unordered_set<_Value,_Hash,_Pred,_Alloc>::operator=(unordered_set<_Value,_Hash,_Pred,_Alloc>&&)[default]
       Move assignment operator.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::rehash(size_type__n)[inline]
       May rehash the unordered_set.

       Parameters__n The new number of buckets.

       Rehash will occur only if the new number of buckets respect the unordered_set maximum load factor.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::reserve(size_type__n)[inline]
       Prepare the unordered_set for a specified number of elements.

       Parameters__n Number of elements required.

       Same as rehash(ceil(n / max_load_factor())).

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::size()const[inline],[noexcept]
       Returns the size of the unordered_set.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>voidstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::swap(unordered_set<_Value,_Hash,_Pred,_Alloc>&__x)[inline],[noexcept]
       Swaps data with another unordered_set.

       Parameters__x An unordered_set of the same element and allocator types.

       This exchanges the elements between two sets in constant time. Note that the global std::swap() function
       is specialized such that std::swap(s1,s2) will feed to this function.

template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::allocator_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::allocator_type
       Public typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::const_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::const_iterator
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::const_local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::const_local_iterator
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::const_pointerstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::const_pointer
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::const_referencestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::const_reference
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::difference_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::difference_type
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::hasherstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::hasher
       Public typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::iterator
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::key_equalstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::key_equal
       Public typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::key_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::key_type
       Public typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::local_iteratorstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::local_iterator
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::pointerstd::unordered_set<_Value,_Hash,_Pred,_Alloc>::pointer
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::referencestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::reference
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::size_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::size_type
       Iterator-related typedefs.

   template<typename_Value,typename_Hash=hash<_Value>,typename_Pred=equal_to<_Value>,typename_Alloc=allocator<_Value>>typedef_Hashtable::value_typestd::unordered_set<_Value,_Hash,_Pred,_Alloc>::value_type
       Public typedefs.

       std::unordered_set< _Value, _Hash, _Pred, _Alloc > - A standard container composed of unique keys
       (containing at most one of each key value) in which the elements' keys are the elements themselves.

       #include <unordered_set>

   PublicTypesusinginsert_return_type = typename _Hashtable::insert_return_type
       usingnode_type = typename _Hashtable::node_type

           typedef _Hashtable::key_type key_type
               Public typedefs.
           typedef _Hashtable::value_type value_type
               Public typedefs.
           typedef _Hashtable::hasher hasher
               Public typedefs.
           typedef _Hashtable::key_equal key_equal
               Public typedefs.
           typedef _Hashtable::allocator_type allocator_type
               Public typedefs.

           typedef _Hashtable::pointer pointer
               Iterator-related typedefs.
           typedef _Hashtable::const_pointer const_pointer
               Iterator-related typedefs.
           typedef _Hashtable::reference reference
               Iterator-related typedefs.
           typedef _Hashtable::const_reference const_reference
               Iterator-related typedefs.
           typedef _Hashtable::iterator iterator
               Iterator-related typedefs.
           typedef _Hashtable::const_iterator const_iterator
               Iterator-related typedefs.
           typedef _Hashtable::local_iterator local_iterator
               Iterator-related typedefs.
           typedef _Hashtable::const_local_iterator const_local_iterator
               Iterator-related typedefs.
           typedef _Hashtable::size_type size_type
               Iterator-related typedefs.
           typedef _Hashtable::difference_type difference_type
               Iterator-related typedefs.

   PublicMemberFunctionsunordered_set ()=default
           Default constructor.
       template<typename_InputIterator > unordered_set (_InputIterator __first, _InputIterator __last,
           size_type __n, const allocator_type &__a)
       template<typename_InputIterator > unordered_set (_InputIterator __first, _InputIterator __last,
           size_type __n, const hasher &__hf, const allocator_type &__a)
       template<typename_InputIterator > unordered_set (_InputIterator __first, _InputIterator __last,
           size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const
           allocator_type &__a=allocator_type())
           Builds an unordered_set from a range.
       unordered_set (const allocator_type &__a)
           Creates an unordered_set with no elements.
       unordered_set (const unordered_set &)=default
           Copy constructor.
       unordered_set (const unordered_set &__uset, const allocator_type &__a)
       unordered_set (initializer_list< value_type > __l, size_type __n, const allocator_type &__a)
       unordered_set (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const
           allocator_type &__a)
       unordered_set (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const
           key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
           Builds an unordered_set from an initializer_list.
       unordered_set (size_type __n, const allocator_type &__a)
       unordered_set (size_type __n, const hasher &__hf, const allocator_type &__a)
       unordered_set (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const
           allocator_type &__a=allocator_type())
           Default constructor creates no elements.
       unordered_set (unordered_set &&)=default
           Move constructor.
       unordered_set (unordered_set &&__uset, const allocator_type &__a)
           noexcept(noexcept(_Hashtable(std::move(__uset._M_h), __a)))
       size_typebucket (const key_type &__key) const
       size_typebucket_count () const noexcept
           Returns the number of buckets of the unordered_set.
       size_typebucket_size (size_type __n) const
       const_iteratorcbegin () const noexcept
       const_iteratorcend () const noexcept
       voidclear () noexcept
       template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
           Attempts to build and insert an element into the unordered_set.
       template<typename... _Args> iteratoremplace_hint (const_iterator__pos, _Args &&... __args)
           Attempts to insert an element into the unordered_set.
       bool empty () const noexcept
           Returns true if the unordered_set is empty.
       size_typeerase (const key_type &__x)
           Erases elements according to the provided key.
       iteratorerase (const_iterator __first, const_iterator __last)
           Erases a [__first,__last) range of elements from an unordered_set.
       node_type extract (const key_type &__key)
           Extract a node.
       node_type extract (const_iterator__pos)
           Extract a node.
       allocator_typeget_allocator () const noexcept
           Returns the allocator object used by the unordered_set.
       hasherhash_function () const
           Returns the hash functor object with which the unordered_set was constructed.
       template<typename_InputIterator > voidinsert (_InputIterator __first, _InputIterator __last)
           A template function that attempts to insert a range of elements.
       iteratorinsert (const_iterator, node_type &&__nh)
           Re-insert an extracted node.
       voidinsert (initializer_list< value_type > __l)
           Attempts to insert a list of elements into the unordered_set.
       insert_return_type insert (node_type &&__nh)
           Re-insert an extracted node.
       key_equalkey_eq () const
           Returns the key comparison object with which the unordered_set was constructed.
       float load_factor () const noexcept
           Returns the average number of elements per bucket.
       size_typemax_bucket_count () const noexcept
           Returns the maximum number of buckets of the unordered_set.
       float max_load_factor () const noexcept
           Returns a positive number that the unordered_set tries to keep the load factor less than or equal to.
       voidmax_load_factor (float __z)
           Change the unordered_set maximum load factor.
       size_typemax_size () const noexcept
           Returns the maximum size of the unordered_set.
       template<typename_H2 , typename_P2 > voidmerge (unordered_multiset< _Value, _H2, _P2, _Alloc >
           &&__source)
       template<typename_H2 , typename_P2 > voidmerge (unordered_multiset< _Value, _H2, _P2, _Alloc >
           &__source)
       template<typename_H2 , typename_P2 > voidmerge (unordered_set< _Value, _H2, _P2, _Alloc > &&__source)
       template<typename_H2 , typename_P2 > voidmerge (unordered_set< _Value, _H2, _P2, _Alloc > &__source)
       unordered_set & operator= (const unordered_set &)=default
           Copy assignment operator.
       unordered_set & operator= (initializer_list< value_type > __l)
           Unordered_set list assignment operator.
       unordered_set & operator= (unordered_set &&)=default
           Move assignment operator.
       voidrehash (size_type __n)
           May rehash the unordered_set.
       voidreserve (size_type __n)
           Prepare the unordered_set for a specified number of elements.
       size_typesize () const noexcept
           Returns the size of the unordered_set.
       voidswap (unordered_set &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))
           Swaps data with another unordered_set.

           iteratorbegin () noexcept
           const_iteratorbegin () const noexcept

           iteratorend () noexcept
           const_iteratorend () const noexcept

           std::pair< iterator, bool > insert (const value_type &__x)
               Attempts to insert an element into the unordered_set.
           std::pair< iterator, bool > insert (value_type &&__x)
               Attempts to insert an element into the unordered_set.

           iteratorinsert (const_iterator__hint, const value_type &__x)
               Attempts to insert an element into the unordered_set.
           iteratorinsert (const_iterator__hint, value_type &&__x)
               Attempts to insert an element into the unordered_set.

           iteratorerase (const_iterator__position)
               Erases an element from an unordered_set.
           iteratorerase (iterator__position)
               Erases an element from an unordered_set.

           iteratorfind (const key_type &__x)
               Tries to locate an element in an unordered_set.
           template<typename_Kt > autofind (const _Kt &__k) -> decltype(_M_h._M_find_tr(__k))
               Tries to locate an element in an unordered_set.
           const_iteratorfind (const key_type &__x) const
               Tries to locate an element in an unordered_set.
           template<typename_Kt > autofind (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k))
               Tries to locate an element in an unordered_set.

           size_typecount (const key_type &__x) const
               Finds the number of elements.
           template<typename_Kt > autocount (const _Kt &__k) const -> decltype(_M_h._M_count_tr(__k))
               Finds the number of elements.

           bool contains (const key_type &__x) const
               Finds whether an element with the given key exists.
           template<typename_Kt > autocontains (const _Kt &__k) const -> decltype(_M_h._M_find_tr(__k),
               void(), true)
               Finds whether an element with the given key exists.

           std::pair< iterator, iterator > equal_range (const key_type &__x)
               Finds a subsequence matching given key.
           template<typename_Kt > autoequal_range (const _Kt &__k) -> decltype(_M_h._M_equal_range_tr(__k))
               Finds a subsequence matching given key.
           std::pair< const_iterator, const_iterator > equal_range (const key_type &__x) const
               Finds a subsequence matching given key.
           template<typename_Kt > autoequal_range (const _Kt &__k) const ->
               decltype(_M_h._M_equal_range_tr(__k))
               Finds a subsequence matching given key.

           local_iteratorbegin (size_type __n)
               Returns a read-only (constant) iterator pointing to the first bucket element.
           const_local_iteratorbegin (size_type __n) const
               Returns a read-only (constant) iterator pointing to the first bucket element.
           const_local_iteratorcbegin (size_type __n) const
               Returns a read-only (constant) iterator pointing to the first bucket element.

           local_iteratorend (size_type __n)
               Returns a read-only (constant) iterator pointing to one past the last bucket elements.
           const_local_iteratorend (size_type __n) const
               Returns a read-only (constant) iterator pointing to one past the last bucket elements.
           const_local_iteratorcend (size_type __n) const
               Returns a read-only (constant) iterator pointing to one past the last bucket elements.

   Friends
       template<typename_Value1 , typename_Hash1 , typename_Pred1 , typename _Alloc1 > bool operator== (const
           unordered_set< _Value1, _Hash1, _Pred1, _Alloc1 > &, const unordered_set< _Value1, _Hash1, _Pred1,
           _Alloc1 > &)
       template<typename , typename , typename > classstd::_Hash_merge_helper