STD::__DEBUG::MULTIMAP(3cxx)

📦
version 14-20240412 · 23 versions
, in ubuntu noble

💖 NAME 💖

Okay bestie, welcome to the 3cxx manual page for std::__debug::multimap< _Key, _Tp, _Compare, _Allocator > — literally Class std::multimap with safety/checking/debug instrumentation. That’s the whole name vibe: it’s the debug/safety-instrumented flavor of std::multimap, and the class name is exactly as above, no rebranding, no cap.

✨ SYNOPSIS ✨

#include <map>

Inherits:

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

🎀 Public Types 🎀

Type roster, in order, no skips:

  • typedef _Allocator allocator_type
  • typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, multimap > 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, multimap > iterator
  • typedef _Compare key_compare
  • typedef _Key key_type
  • typedef _Tp mapped_type
  • using node_type = typename _Base::node_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 🌸

Okay this is the big one — every public member function, exactly in the order the page gives them. No merging, no renaming, no “close enough,” periodt:

  • multimap (_Base_ref __x)
  • template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())
  • template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last, const allocator_type &__a)
  • multimap (const _Compare &__comp, const _Allocator &__a=_Allocator())
  • multimap (const allocator_type &__a)
  • multimap (const multimap &)=default
  • multimap (const multimap &__m, const __type_identity_t< allocator_type > &__a)
  • multimap (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const allocator_type &__a=allocator_type())
  • multimap (initializer_list< value_type > __l, const allocator_type &__a)
  • multimap (multimap &&)=default
  • multimap (multimap &&__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_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> iterator emplace (_Args &&... __args)
  • template<typename... _Args> iterator emplace_hint (const_iterator __pos, _Args &&... __args)
  • const_iterator end () const noexcept
  • iterator end () 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_iterator erase (_Base_const_iterator __position)
  • size_type erase (const key_type &__x)
  • iterator erase (const_iterator __first, const_iterator __last)
  • iterator erase (const_iterator __position)
  • _GLIBCXX_ABI_TAG_CXX11 iterator erase (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> iterator find (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator find (const _Kt &__x) const
  • 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> iterator insert (_Pair &&__x)
  • iterator insert (const value_type &__x)
  • iterator insert (const_iterator __hint, node_type &&__nh)
  • 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)
  • iterator insert (node_type &&__nh)
  • void insert (std::initializer_list< value_type > __list)
  • iterator insert (value_type &&__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> iterator lower_bound (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator lower_bound (const _Kt &__x) const
  • iterator lower_bound (const key_type &__x)
  • const_iterator lower_bound (const key_type &__x) const
  • multimap & operator= (const multimap &)=default
  • multimap & operator= (initializer_list< value_type > __l)
  • multimap & operator= (multimap &&)=default
  • const_reverse_iterator rbegin () const noexcept
  • reverse_iterator rbegin () noexcept
  • const_reverse_iterator rend () const noexcept
  • reverse_iterator rend () noexcept
  • void swap (multimap &__x) noexcept(/*conditional */)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> iterator upper_bound (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator upper_bound (const _Kt &__x) const
  • iterator upper_bound (const key_type &__x)
  • const_iterator upper_bound (const key_type &__x) const

🛡️ Protected Member Functions 🛡️

The protected-era section, keeping it exactly as listed:

  • constexpr void _M_swap (_Safe_container &__x) noexcept

🫂 Friends 🫂

Friend list, tiny but iconic:

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

👑 Detailed Description 👑

Here’s the exact detailed-description block, template signature and all — including the quirky >"Class bit, because we do not edit the lore:

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
    typename _Allocator = std::allocator<std::pair<const _Key, _Tp> > >
    class std::__debug::multimap< _Key, _Tp, _Compare, _Allocator >"Class
    std::multimap with safety/checking/debug instrumentation.

So yeah: it’s std::multimap with safety/checking/debug instrumentation. That’s the main-character energy. 💅

💌 Author 💌

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

Robots wrote that part, not me — iconic behavior, honestly. 🤖✨

💖 That’s the whole page, bestie. Source/version sign-off: libstdc++, with the 3cxx manual name in the mix; the supplied footer doesn’t print a separate date, so I’m not inventing one — this cute sign-off is standing in for the raw footer. 🫶✨

📦 where this page comes from