std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc > - Class std::unordered_multiset with

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

                                                    libststd::__debug::unordered..._Hash,_Pred,_Alloc>(3cxx)

template<typename_Value,typename_Hash=std::hash<_Value>,typename_Pred=std::equal_to<_Value>,typename_Alloc=std::allocator<_Value>>
       class std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >"Class std::unordered_multiset with
       safety/checking/debug instrumentation.

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

       #include <unordered_set>

       Inherits __gnu_debug::_Safe_container<_SafeContainer,_Alloc,_SafeBase,_IsCxx11AllocatorAware>, and
       unordered_multiset< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >.

   PublicTypestypedef _Base::allocator_type allocator_typetypedef__gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_multiset > const_iteratortypedef__gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_multiset >
           const_local_iteratortypedef _Base::const_pointer const_pointertypedef _Base::const_reference const_referencetypedef _Base::difference_type difference_typetypedef _Base::hasher hashertypedef__gnu_debug::_Safe_iterator< _Base_iterator, unordered_multiset > iteratortypedef _Base::key_equal key_equaltypedef _Base::key_type key_typetypedef__gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_multiset > local_iteratorusingnode_type = typename _Base::node_type
       typedef _Base::pointer pointertypedef _Base::reference referencetypedef _Base::size_type size_typetypedef _Base::value_type value_typePublicMemberFunctionsunordered_multiset (_Base_ref __x)
       template<typename_InputIterator > unordered_multiset (_InputIterator __first, _InputIterator __last,
           size_type __n, const allocator_type &__a)
       template<typename_InputIterator > unordered_multiset (_InputIterator __first, _InputIterator __last,
           size_type __n, const hasher &__hf, const allocator_type &__a)
       template<typename_InputIterator > unordered_multiset (_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_multiset (const allocator_type &__a)
       unordered_multiset (const unordered_multiset &)=defaultunordered_multiset (const unordered_multiset &__uset, const allocator_type &__a)
       unordered_multiset (initializer_list< value_type > __l, size_type __n, const allocator_type &__a)
       unordered_multiset (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const
           allocator_type &__a)
       unordered_multiset (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_multiset (size_type __n, const allocator_type &__a)
       unordered_multiset (size_type __n, const hasher &__hf, const allocator_type &__a)
       unordered_multiset (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const
           allocator_type &__a=allocator_type())
       unordered_multiset (unordered_multiset &&)=defaultunordered_multiset (unordered_multiset &&__uset, const allocator_type &__a)
           noexcept(noexcept(_Base(std::move(__uset), __a)))
       const _Base & _M_base () const noexcept
       _Base & _M_base () noexcept
       const_iteratorbegin () const noexcept
       iteratorbegin () noexcept
       local_iteratorbegin (size_type __b)
       const_local_iteratorbegin (size_type __b) const
       size_type bucket_size (size_type __b) const
       const_iteratorcbegin () const noexcept
       const_local_iteratorcbegin (size_type __b) const
       const_iteratorcend () const noexcept
       const_local_iteratorcend (size_type __b) const
       voidclear () noexcept
       template<typename... _Args> iteratoremplace (_Args &&... __args)
       template<typename... _Args> iteratoremplace_hint (const_iterator__hint, _Args &&... __args)
       const_iteratorend () const noexcept
       iteratorend () noexcept
       local_iteratorend (size_type __b)
       const_local_iteratorend (size_type __b) const
       template<typename_Kt , typename  = std::__has_is_transparent_t<_Hash, _Kt>, typename  =
           std::__has_is_transparent_t<_Pred, _Kt>> std::pair< iterator, iterator > equal_range (const _Kt &__k)
       template<typename_Kt , typename  = std::__has_is_transparent_t<_Hash, _Kt>, typename  =
           std::__has_is_transparent_t<_Pred, _Kt>> std::pair< const_iterator, const_iterator > equal_range
           (const _Kt &__k) const
       std::pair< iterator, iterator > equal_range (const key_type &__key)
       std::pair< const_iterator, const_iterator > equal_range (const key_type &__key) const
       _Base_iteratorerase (_Base_const_iterator__it)
       size_type erase (const key_type &__key)
       iteratorerase (const_iterator __first, const_iterator __last)
       iteratorerase (const_iterator__it)
       iteratorerase (iterator__it)
       node_type extract (const key_type &__key)
       node_type extract (const_iterator__position)
       template<typename_Kt , typename  = std::__has_is_transparent_t<_Hash, _Kt>, typename  =
           std::__has_is_transparent_t<_Pred, _Kt>> iteratorfind (const _Kt &__k)
       template<typename_Kt , typename  = std::__has_is_transparent_t<_Hash, _Kt>, typename  =
           std::__has_is_transparent_t<_Pred, _Kt>> const_iteratorfind (const _Kt &__k) const
       iteratorfind (const key_type &__key)
       const_iteratorfind (const key_type &__key) const
       template<typename_InputIterator > voidinsert (_InputIterator __first, _InputIterator __last)
       iteratorinsert (const value_type &__obj)
       iteratorinsert (const_iterator__hint, const value_type &__obj)
       iteratorinsert (const_iterator__hint, node_type &&__nh)
       iteratorinsert (const_iterator__hint, value_type &&__obj)
       iteratorinsert (node_type &&__nh)
       voidinsert (std::initializer_list< value_type > __l)
       iteratorinsert (value_type &&__obj)
       float max_load_factor () const noexcept
       voidmax_load_factor (float __f)
       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_multiset & operator= (const unordered_multiset &)=defaultunordered_multiset & operator= (initializer_list< value_type > __l)
       unordered_multiset & operator= (unordered_multiset &&)=defaultvoidswap (unordered_multiset &__x) noexcept(noexcept(declval< _Base & >().swap(__x)))

   ProtectedMemberFunctionsvoid_M_swap (_Safe_container &__x) noexcept

   Friends
       template<typename_ItT , typename_SeqT , typename_CatT > class::__gnu_debug::_Safe_iterator
       template<typename_ItT , typename_SeqT > class::__gnu_debug::_Safe_local_iterator