STD::__DEBUG::MAP(3)

💖 NAME 💖

std::__debug::map< _Key, _Tp, _Compare, _Allocator > — bestie, it's a class std::map but with safety/checking/debug instrumentation baked in. She's the same girl, just wearing a helmet 🪖✨

---

✨ SYNOPSIS ✨

#include <map>

Inherits __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >.

🎀 Public Types 🎀

• typedef _Allocator allocator_type
• typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, map > const_iterator
• typedef _Base::const_pointer const_pointer
• typedef _Base::const_reference const_reference
• typedef std::reverse_iterator< const_iterator > const_reverse_iterator
• typedef _Base::difference_type difference_type
• typedef __gnu_debug::_Safe_iterator< _Base_iterator, map > iterator
• typedef _Compare key_compare
• typedef _Key key_type
• typedef _Tp mapped_type
• typedef _Base::pointer pointer
• typedef _Base::reference reference
• typedef std::reverse_iterator< iterator > reverse_iterator
• typedef _Base::size_type size_type
• typedef std::pair< const _Key, _Tp > value_type

🌸 Public Member Functions 🌸

Constructors first, because she's gotta arrive 💅

• map (_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 &)=default
• map (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 &&)=default
• map (map &&__m, const __type_identity_t< allocator_type > &__a) noexcept(noexcept(_Base(std::move(__m), __a)))

Then the base access, the iterators, the whole rest of the squad:

• const _Base & _M_base () const noexcept
• _Base & _M_base () noexcept
• const_iterator begin () const noexcept
• iterator begin () noexcept
• const_iterator cbegin () const noexcept
• const_iterator cend () const noexcept
• void clear () noexcept
• const_reverse_iterator crbegin () const noexcept
• const_reverse_iterator crend () const noexcept
• template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
• template<typename... _Args> iterator emplace_hint (const_iterator __pos, _Args &&... __args)
• const_iterator end () const noexcept
• iterator end () noexcept
• std::pair< iterator, iterator > equal_range (const key_type &__x)
• std::pair< const_iterator, const_iterator > equal_range (const key_type &__x) const
• _Base_iterator erase (_Base_const_iterator __position)
• template<__heterogeneous_tree_key< map > _Kt> size_type erase (_Kt &&__x)
• size_type erase (const key_type &__x)
• iterator erase (const_iterator __first, const_iterator __last)
• iterator erase (const_iterator __position)
• iterator erase (iterator __position)
• iterator find (const key_type &__x)
• const_iterator find (const key_type &__x) const
• template<typename _InputIterator> void insert (_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)
• template<typename _Pair, typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> iterator insert (const_iterator __position, _Pair &&__x)
• iterator insert (const_iterator __position, const value_type &__x)
• iterator insert (const_iterator __position, value_type &&__x)
• void insert (std::initializer_list< value_type > __list)
• std::pair< iterator, bool > insert (value_type &&__x)
• iterator lower_bound (const key_type &__x)
• const_iterator lower_bound (const key_type &__x) const
• map & operator= (const map &)=default
• map & operator= (initializer_list< value_type > __l)
• map & operator= (map &&)=default
• const_reverse_iterator rbegin () const noexcept
• reverse_iterator rbegin () noexcept
• const_reverse_iterator rend () const noexcept
• reverse_iterator rend () noexcept
• void swap (map &__x) noexcept(/*conditional */)
• iterator upper_bound (const key_type &__x)
• const_iterator upper_bound (const key_type &__x) const

🔒 Protected Member Functions 🔒

• constexpr void _M_swap (const _Safe_container &__x) const noexcept

🫶 Friends 🫶

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

---

👑 Detailed Description 👑

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. Like, that's the whole thing, that's the vibe — it's your regular map but she does a vibe check on every iterator before she lets you use it 🔥👑

---

💜 Author 💜

Generated automatically by Doxygen for libstdc++ from the source code. Not a human, not a bestie, just a robot doing its little job 🤖✨

---

okay that's the whole page, no cap 💖 this one came out of libstdc++ and honestly? she ate. go build something cute with it, bestie — mwah 🎀🦋💅