NAME

       std::__debug::unordered_set< _Value, _Hash, _Pred, _Alloc > - Class std::unordered_set
       with safety/checking/debug instrumentation.

SYNOPSIS

   Public Types
       typedef _Base::allocator_type allocator_type
       typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_set > const_iterator
       typedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_set >
           const_local_iterator
       typedef _Base::hasher hasher
       typedef __gnu_debug::_Safe_iterator< _Base_iterator, unordered_set > iterator
       typedef _Base::key_equal key_equal
       typedef _Base::key_type key_type
       typedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_set >
           local_iterator
       typedef _Base::size_type size_type
       typedef _Base::value_type value_type

   Public Member Functions
       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())
       unordered_set (const _Base &__x)
       unordered_set (const allocator_type &__a)
       unordered_set (const unordered_set &)=default
       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())
       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())
       unordered_set (unordered_set &&)=default
       unordered_set (unordered_set &&__uset, const allocator_type &__a)
           noexcept(noexcept(_Base(std::move(__uset._M_base()), __a)))
       const _Base & _M_base () const noexcept
       _Base & _M_base () noexcept
       const_iterator begin () const noexcept
       iterator begin () noexcept
       local_iterator begin (size_type __b)
       const_local_iterator begin (size_type __b) const
       size_type bucket_size (size_type __b) const
       const_iterator cbegin () const noexcept
       const_local_iterator cbegin (size_type __b) const
       const_iterator cend () const noexcept
       const_local_iterator cend (size_type __b) const
       void clear () noexcept
       template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
       template<typename... _Args> iterator emplace_hint (const_iterator __hint, _Args &&...
           __args)
       const_iterator end () const noexcept
       iterator end () noexcept
       local_iterator end (size_type __b)
       const_local_iterator end (size_type __b) const
       std::pair< iterator, iterator > equal_range (const key_type &__key)
       std::pair< const_iterator, const_iterator > equal_range (const key_type &__key) const
       size_type erase (const key_type &__key)
       iterator erase (const_iterator __first, const_iterator __last)
       iterator erase (const_iterator __it)
       iterator erase (iterator __it)
       iterator find (const key_type &__key)
       const_iterator find (const key_type &__key) const
       template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator
           __last)
       std::pair< iterator, bool > insert (const value_type &__obj)
       iterator insert (const_iterator __hint, const value_type &__obj)
       iterator insert (const_iterator __hint, value_type &&__obj)
       void insert (std::initializer_list< value_type > __l)
       std::pair< iterator, bool > insert (value_type &&__obj)
       float max_load_factor () const noexcept
       void max_load_factor (float __f)
       unordered_set & operator= (const unordered_set &)=default
       unordered_set & operator= (initializer_list< value_type > __l)
       unordered_set & operator= (unordered_set &&)=default
       void swap (unordered_set &__x) noexcept(noexcept(declval< _Base & >().swap(__x)))

   Friends
       template<typename _ItT , typename _SeqT , typename _CatT > class
           ::__gnu_debug::_Safe_iterator
       template<typename _ItT , typename _SeqT > class ::__gnu_debug::_Safe_local_iterator

Detailed Description

   template<typename _Value, typename _Hash = std::hash<_Value>, typename _Pred =
       std::equal_to<_Value>, typename _Alloc = std::allocator<_Value>>
       class std::__debug::unordered_set< _Value, _Hash, _Pred, _Alloc >" Class
       std::unordered_set with safety/checking/debug instrumentation.

       Definition at line 40 of file debug/unordered_set.

Author

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

libstdc++                       std::__debug::unordered2set< _Value, _Hash, _Pred, _Alloc >(3cxx)