std::__debug::map< _Key, _Tp, _Compare, _Allocator > - Class std::map with safety/checking/debug

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

                                                    libststd::__debug::map<_Key..._Compare,_Allocator>(3cxx)

template<typename_Key,typename_Tp,typename_Compare=std::less<_Key>,typename_Allocator=std::allocator<std::pair<const_Key,_Tp>>>
       class std::__debug::map< _Key, _Tp, _Compare, _Allocator >"Class std::map with safety/checking/debug
       instrumentation.

       std::__debug::map< _Key, _Tp, _Compare, _Allocator > - Class std::map with safety/checking/debug
       instrumentation.

       #include <map>

       Inherits __gnu_debug::_Safe_container<_SafeContainer,_Alloc,_SafeBase,_IsCxx11AllocatorAware>, and
       map< _Key, _Tp, std::less< _Key >, std::allocator< std::pair< const _Key, _Tp > > >.

   PublicTypestypedef_Allocatorallocator_typetypedef__gnu_debug::_Safe_iterator< _Base_const_iterator, map > const_iteratortypedef _Base::const_pointer const_pointertypedef _Base::const_reference const_referencetypedefstd::reverse_iterator< const_iterator > const_reverse_iteratortypedef _Base::difference_type difference_typeusinginsert_return_type = _Node_insert_return< iterator, node_type >
       typedef__gnu_debug::_Safe_iterator< _Base_iterator, map > iteratortypedef _Compare key_comparetypedef_Keykey_typetypedef _Tp mapped_typeusingnode_type = typename _Base::node_type
       typedef _Base::pointer pointertypedef _Base::reference referencetypedefstd::reverse_iterator< iterator > reverse_iteratortypedef _Base::size_type size_typetypedefstd::pair< const _Key, _Tp > value_typePublicMemberFunctionsmap (_Base_ref __x)
       template<typename_InputIterator > map (_InputIterator __first, _InputIterator __last, const _Compare
           &__comp=_Compare(), const _Allocator &__a=_Allocator())
       template<typename_InputIterator > map (_InputIterator __first, _InputIterator __last, const
           allocator_type &__a)
       map (const _Compare &__comp, const _Allocator &__a=_Allocator())
       map (const allocator_type &__a)
       map (const map &)=defaultmap (const map &__m, const __type_identity_t< allocator_type > &__a)
       map (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const allocator_type
           &__a=allocator_type())
       map (initializer_list< value_type > __l, const allocator_type &__a)
       map (map &&)=defaultmap (map &&__m, const __type_identity_t< allocator_type > &__a) noexcept(noexcept(_Base(std::move(__m),
           __a)))
       const _Base & _M_base () const noexcept
       _Base & _M_base () noexcept
       const_iteratorbegin () const noexcept
       iteratorbegin () noexcept
       const_iteratorcbegin () const noexcept
       const_iteratorcend () const noexcept
       voidclear () noexcept
       const_reverse_iteratorcrbegin () const noexcept
       const_reverse_iteratorcrend () const noexcept
       template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
       template<typename... _Args> iteratoremplace_hint (const_iterator__pos, _Args &&... __args)
       const_iteratorend () const noexcept
       iteratorend () noexcept
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type> std::pair<
           iterator, iterator > equal_range (const _Kt &__x)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type> std::pair<
           const_iterator, const_iterator > equal_range (const _Kt &__x) const
       std::pair< iterator, iterator > equal_range (const key_type &__x)
       std::pair< const_iterator, const_iterator > equal_range (const key_type &__x) const
       _Base_iteratorerase (_Base_const_iterator__position)
       size_type erase (const key_type &__x)
       iteratorerase (const_iterator __first, const_iterator __last)
       iteratorerase (const_iterator__position)
       _GLIBCXX_ABI_TAG_CXX11 iteratorerase (iterator__position)
       node_type extract (const key_type &__key)
       node_type extract (const_iterator__position)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type> iteratorfind (const _Kt &__x)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type>
           const_iteratorfind (const _Kt &__x) const
       iteratorfind (const key_type &__x)
       const_iteratorfind (const key_type &__x) const
       template<typename_InputIterator > voidinsert (_InputIterator __first, _InputIterator __last)
       template<typename_Pair , typename  = typename
           std::enable_if<std::is_constructible<value_type,
           _Pair&&>::value>::type> std::pair< iterator, bool > insert (_Pair &&__x)
       std::pair< iterator, bool > insert (const value_type &__x)
       iteratorinsert (const_iterator__hint, node_type &&__nh)
       template<typename_Pair , typename  = typename
           std::enable_if<std::is_constructible<value_type,
           _Pair&&>::value>::type> iteratorinsert (const_iterator__position, _Pair &&__x)
       iteratorinsert (const_iterator__position, const value_type &__x)
       iteratorinsert (const_iterator__position, value_type &&__x)
       insert_return_typeinsert (node_type &&__nh)
       voidinsert (std::initializer_list< value_type > __list)
       std::pair< iterator, bool > insert (value_type &&__x)
       template<typename _Obj > std::pair< iterator, bool > insert_or_assign (const key_type &__k, _Obj &&__obj)
       template<typename _Obj > iteratorinsert_or_assign (const_iterator__hint, const key_type &__k, _Obj
           &&__obj)
       template<typename _Obj > iteratorinsert_or_assign (const_iterator__hint, key_type &&__k, _Obj &&__obj)
       template<typename _Obj > std::pair< iterator, bool > insert_or_assign (key_type &&__k, _Obj &&__obj)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type> iteratorlower_bound (const _Kt &__x)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type>
           const_iteratorlower_bound (const _Kt &__x) const
       iteratorlower_bound (const key_type &__x)
       const_iteratorlower_bound (const key_type &__x) const
       map & operator= (const map &)=defaultmap & operator= (initializer_list< value_type > __l)
       map & operator= (map &&)=defaultconst_reverse_iteratorrbegin () const noexcept
       reverse_iteratorrbegin () noexcept
       const_reverse_iteratorrend () const noexcept
       reverse_iteratorrend () noexcept
       voidswap (map &__x) noexcept(/*conditional */)
       template<typename... _Args> pair< iterator, bool > try_emplace (const key_type &__k, _Args &&... __args)
       template<typename... _Args> iteratortry_emplace (const_iterator__hint, const key_type &__k, _Args &&...
           __args)
       template<typename... _Args> iteratortry_emplace (const_iterator__hint, key_type &&__k, _Args &&...
           __args)
       template<typename... _Args> pair< iterator, bool > try_emplace (key_type &&__k, _Args &&... __args)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type> iteratorupper_bound (const _Kt &__x)
       template<typename_Kt , typename_Req  = typename __has_is_transparent<_Compare, _Kt>::type>
           const_iteratorupper_bound (const _Kt &__x) const
       iteratorupper_bound (const key_type &__x)
       const_iteratorupper_bound (const key_type &__x) const

   ProtectedMemberFunctionsvoid_M_swap (_Safe_container &__x) noexcept

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