STD::__PROFILE::MULTIMAP(3cxx)

📦
version 9.5.0 · 3 versions
, in ubuntu noble

🦋 std::__profile::multimap 🦋

okay bestie, welcome to the 3cxx manual page for this absolute icon 💖 it's giving wrapper, it's giving performance instrumentation, and honestly it's a lot, so grab a snack. we're doing this together, no cap.

🌸 NAME 🌸

std::__profile::multimap< _Key, _Tp, _Compare, _Allocator > — a Class, specifically a std::multimap wrapper with performance instrumentation. that's literally the whole vibe. periodt. 💅

🎀 SYNOPSIS 🎀

first thing you gotta do, always:

#include <multimap.h>

this baddie Inherits from:

  • multimap< _Key, _Tp, std::less< _Key >, std::allocator< std::pair< const _Key, _Tp > > >
  • std::__profile::_Ordered_profile< _Cont >

🌟 Public Types 🌟

these are the little name aliases it keeps in its purse:

  • const_iterator — typedef __iterator_tracker< _Base_const_iterator, multimap > const_iterator
  • const_reference — typedef _Base::const_reference const_reference
  • const_reverse_iterator — typedef std::reverse_iterator< const_iterator > const_reverse_iterator
  • difference_type — typedef _Base::difference_type difference_type
  • iterator — typedef __iterator_tracker< _Base_iterator, multimap > iterator
  • key_compare — typedef _Compare key_compare
  • key_type — typedef _Key key_type
  • mapped_type — typedef _Tp mapped_type
  • reference — typedef _Base::reference reference
  • reverse_iterator — typedef std::reverse_iterator< iterator > reverse_iterator
  • size_type — typedef _Base::size_type size_type
  • value_type — typedef std::pair< const _Key, _Tp > value_type

🦄 Public Member Functions 🦄

the main character energy section, fr fr. every single one, right here:

  • template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last, const _Allocator &__a)
  • template<typename _InputIterator , typename = std::_RequireInputIter<_InputIterator>> multimap (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())
  • multimap (const _Allocator &__a)
  • multimap (const _Base &__x)
  • multimap (const _Compare &__comp, const _Allocator &__a=_Allocator())
  • multimap (const multimap &)=default — the copy constructor, defaulted like the universe intended ✨
  • multimap (const multimap &__x, const _Allocator &__a)
  • multimap (initializer_list< value_type > __l, const _Allocator &__a)
  • multimap (initializer_list< value_type > __l, const _Compare &__c=_Compare(), const _Allocator &__a=_Allocator())
  • multimap (multimap &&)=default — move constructor, also defaulted, we love a shortcut 💅
  • multimap (multimap &&__x, const _Allocator &__a) noexcept(noexcept(_Base(std::move(__x), __a)))
  • const _Base & _M_base () const noexcept — hands you back the _Base reference, const flavour
  • _Base & _M_base () noexcept — same thing but non-const, okayyy
  • void _M_profile_iterate (int __rewind=0) const — takes an int __rewind that defaults to 0
  • const_iterator begin () const noexcept
  • iterator begin () noexcept
  • const_iterator cbegin () const noexcept
  • const_iterator cend () const noexcept
  • void clear () noexcept
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> size_type count (const _Kt &__x) const
  • size_type count (const key_type &__x) const
  • 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
  • size_type erase (const key_type &__x)
  • iterator erase (const_iterator __first, const_iterator __last)
  • iterator erase (const_iterator __pos)
  • iterator erase (iterator __pos)
  • 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)
  • template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> iterator insert (const_iterator __pos, _Pair &&__x)
  • iterator insert (const_iterator __pos, const value_type &__x)
  • void insert (std::initializer_list< value_type > __list)
  • 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 behind-the-scenes girls, they don't perform for the public but they work:

  • void _M_profile_construct () noexcept
  • void _M_profile_destruct () noexcept
  • void _M_swap (_Ordered_profile &__other)

🍓 Protected Attributes 🍓

  • __gnu_profile::__map2umap_info * _M_map2umap_info — a whole pointer, minding its own business

🫶 Friends 🫶

the ones it trusts with its life:

  • template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool operator< (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &)
  • template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool operator== (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &)

💜 Detailed Description 💜

the actual template, look at her:

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>,
    typename _Allocator = std::allocator<std::pair<const _Key, _Tp> >>
class std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >

Class std::multimap wrapper with performance instrumentation.

Definition at line 42 of file profile/multimap.h.

✨ Member Typedef Documentation ✨

okay so now we get the receipts for every single typedef, each one with its own little home in the source file. obsessed 🫶

🌈 const_iterator

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef __iterator_tracker<_Base_const_iterator, multimap> std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::const_iterator

Definition at line 63 of file profile/multimap.h.

🌈 const_reference

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Base::const_reference std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::const_reference

Definition at line 58 of file profile/multimap.h.

🌈 const_reverse_iterator

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef std::reverse_iterator<const_iterator> std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::const_reverse_iterator

Definition at line 65 of file profile/multimap.h.

🌈 difference_type

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Base::difference_type std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::difference_type

Definition at line 68 of file profile/multimap.h.

🌈 iterator

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef __iterator_tracker<_Base_iterator, multimap> std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::iterator

Definition at line 61 of file profile/multimap.h.

🌈 key_compare

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Compare std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::key_compare

Definition at line 56 of file profile/multimap.h.

🌈 key_type

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Key std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::key_type

Definition at line 53 of file profile/multimap.h.

🌈 mapped_type

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Tp std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::mapped_type

Definition at line 54 of file profile/multimap.h.

🌈 reference

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Base::reference std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::reference

Definition at line 57 of file profile/multimap.h.

🌈 reverse_iterator

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef std::reverse_iterator<iterator> std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::reverse_iterator

Definition at line 64 of file profile/multimap.h.

🌈 size_type

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef _Base::size_type std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::size_type

Definition at line 67 of file profile/multimap.h.

🌈 value_type

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >> typedef std::pair<const _Key, _Tp> std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::value_type

Definition at line 55 of file profile/multimap.h.

💖 Constructor & Destructor Documentation 💖

okay so real talk bestie, almost every single constructor down there is wrapped in the exact same gigantic template header, and I am NOT typing it out forty times. So here it is, once, and you just mentally staple it onto everything below, mmk? 🫶

template<typename _Key , typename _Tp , typename _Compare  =
    std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const
    _Key, _Tp> >>

That's the vibe. Every constructor here belongs to std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >. Periodt. 💅

  • multimap(const _Compare & __comp, const _Allocator & __a = _Allocator()) — takes your comparator __comp and an allocator __a that defaults to _Allocator(). Tags: [inline], [explicit] (so no sneaky implicit conversions, we don't do that here 🙈). Definition at line 85 of file profile/multimap.h.
  • multimap(_InputIterator __first, _InputIterator __last, const _Compare & __comp = _Compare(), const _Allocator & __a = _Allocator()) — the iterator-range one 🦋. It's got its own extra template header riding on top: template<typename _InputIterator, typename = std::_RequireInputIter<_InputIterator>>. Tag: [inline]. Definition at line 95 of file profile/multimap.h.
  • multimap(initializer_list<value_type> __l, const _Compare & __c = _Compare(), const _Allocator & __a = _Allocator()) — the curly-brace-girlie one ✨. Takes an initializer_list<value_type> __l, plus __c defaulting to _Compare() and __a defaulting to _Allocator(). Tag: [inline]. Definition at line 101 of file profile/multimap.h.
  • multimap(const _Allocator & __a) — allocator-only, no notes. Tags: [inline], [explicit]. Definition at line 107 of file profile/multimap.h.
  • multimap(const multimap< _Key, _Tp, _Compare, _Allocator > & __x, const _Allocator & __a) — copy-constructs from __x, and yeah you also pass the allocator __a, no default here, she said what she said. Tag: [inline]. Definition at line 110 of file profile/multimap.h.
  • multimap(multimap< _Key, _Tp, _Compare, _Allocator > && __x, const _Allocator & __a) — the move one 🔥. Rvalue ref __x plus allocator __a. Tags: [inline], [noexcept]. Definition at line 113 of file profile/multimap.h.
  • multimap(initializer_list<value_type> __l, const _Allocator & __a) — init-list __l plus allocator __a, and that's the whole guest list. Tag: [inline]. Definition at line 117 of file profile/multimap.h.
  • multimap(_InputIterator __first, _InputIterator __last, const _Allocator & __a) — iterator range plus allocator, no comparator in sight 🧚. Extra template header: template<typename _InputIterator>. Tag: [inline]. Definition at line 121 of file profile/multimap.h.
  • multimap(const _Base & __x) — builds off a const _Base & __x, and that's literally it. Tag: [inline]. Definition at line 126 of file profile/multimap.h.

🌸 Member Function Documentation 🌸

same deal, same template header as above for the multimap ones — consider it re-stapled. Go 👑

  • const _Base & _M_base() const — returns const _Base &. Tags: [inline], [noexcept]. Definition at line 573 of file profile/multimap.h.
  • _Base & _M_base() — the non-const twin, returns _Base &. Tags: [inline], [noexcept]. Definition at line 570 of file profile/multimap.h.

🫶 inherited from _Ordered_profile< _Cont > 🫶

these four don't live in multimap at all, they're inherited, and they all carry template<typename _Cont > up front. Main character cameo energy ⭐

  • void std::__profile::_Ordered_profile< _Cont >::_M_profile_construct() — takes no arguments, returns void. Tags: [inline], [protected], [noexcept], [inherited]. Definition at line 75 of file ordered_base.h.
  • void std::__profile::_Ordered_profile< _Cont >::_M_profile_destruct() — takes no arguments, returns void. Tags: [inline], [protected], [noexcept], [inherited]. Definition at line 79 of file ordered_base.h.
  • void std::__profile::_Ordered_profile< _Cont >::_M_profile_iterate(int __rewind = 0) const — takes int __rewind = 0, returns void, and it's const. Tags: [inline], [inherited]. Definition at line 40 of file ordered_base.h.
  • void std::__profile::_Ordered_profile< _Cont >::_M_swap(_Ordered_profile< _Cont > & __other) — takes _Ordered_profile< _Cont > & __other, returns void. Tags: [inline], [protected], [inherited]. Definition at line 86 of file ordered_base.h.

back to the multimap girlies 💜

  • const_iterator begin() const — the const one, returns const_iterator. Tags: [inline], [noexcept]. Definition at line 161 of file profile/multimap.h.
  • iterator begin() — the non-const one, returns iterator. Tags: [inline], [noexcept]. Definition at line 157 of file profile/multimap.h.
  • const_iterator cbegin() const — returns const_iterator, always const, always has been 💅. Tags: [inline], [noexcept]. Definition at line 174 of file profile/multimap.h.
  • const_iterator cend() const — returns const_iterator. Tags: [inline], [noexcept]. Definition at line 178 of file profile/multimap.h.
  • void clear() — no args, returns void. Tags: [inline], [noexcept]. Definition at line 374 of file profile/multimap.h.
  • size_type count(const _Kt & __x) const — the transparent-comparator one 🔍. Its own extra template header: template<typename _Kt, typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>. Takes const _Kt & __x, returns size_type, const. Tag: [inline]. Definition at line 432 of file profile/multimap.h.
  • size_type count(const key_type & __x) const — the plain one. Takes const key_type & __x, returns size_type, const. Tag: [inline]. Definition at line 421 of file profile/multimap.h.
  • const_reverse_iterator crbegin() const — returns const_reverse_iterator. Tags: [inline], [noexcept]. Definition at line 212 of file profile/multimap.h.
  • const_reverse_iterator crend() const — returns const_reverse_iterator. Tags: [inline], [noexcept]. Definition at line 219 of file profile/multimap.h.
  • iterator emplace(_Args &&... __args) — variadic, returns iterator. Extra template header: template<typename... _Args>. Tag: [inline]. Definition at line 230 of file profile/multimap.h.
  • iterator emplace_hint(const_iterator __pos, _Args &&... __args) — takes const_iterator __pos plus the variadic __args, returns iterator. Extra template header: template<typename... _Args>. Tag: [inline]. Definition at line 238 of file profile/multimap.h.
  • const_iterator end() const — the const one, returns const_iterator. Tags: [inline], [noexcept]. Definition at line 169 of file profile/multimap.h.
  • iterator end() — the non-const one, returns iterator. Tags: [inline], [noexcept]. Definition at line 165 of file profile/multimap.h.
  • std::pair< iterator, iterator > equal_range(const _Kt & __x) — transparent version, returns std::pair< iterator, iterator >. Extra template header: template<typename _Kt, typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>. Tag: [inline]. Definition at line 538 of file profile/multimap.h.
  • std::pair< const_iterator, const_iterator > equal_range(const _Kt & __x) const — transparent and const, returns std::pair< const_iterator, const_iterator >. Extra template header: template<typename _Kt, typename _Req = typename __has_is_transparent<_Compare, _Kt>::type>. Tag: [inline]. Definition at line 561 of file profile/multimap.h.
  • std::pair< iterator, iterator > equal_range(const key_type & __x) — plain key version, returns std::pair< iterator, iterator >. Tag: [inline]. Definition at line 524 of file profile/multimap.h.
  • std::pair< const_iterator, const_iterator > equal_range(const key_type & __x) const — plain key + const, returns std::pair< const_iterator, const_iterator >. Tag: [inline]. Definition at line 547 of file profile/multimap.h.
  • size_type erase(const key_type & __x) — takes const key_type & __x, returns size_type. Tag: [inline]. Definition at line 335 of file profile/multimap.h.

okay bestie, we're deep in the member function zone now — buckle up, this is the part with all the erase / find / insert / bound / reverse-iterator overloads 💅

first tho, the tea: every single one of these is wrapped in the exact same template sandwich, so imma show it to you once instead of copy-pasting it 27 times like a menace. this exact thing sits in front of literally all of them:

template<typename _Key , typename _Tp , typename _Compare  = std::less<_Key>, typename _Allocator  = std::allocator<std::pair<const _Key, _Tp> >>

cool? cool. now the overloads, in order, no skipping, no cap:

  • erase — the range one 🗑️
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::erase (const_iterator __first, const_iterator __last) [inline]

Definition at line 344 of file profile/multimap.h.

  • erase — const_iterator edition ✂️
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::erase (const_iterator __pos) [inline]

Definition at line 313 of file profile/multimap.h.

  • erase — regular iterator edition ✂️
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::erase (iterator __pos) [inline]

Definition at line 320 of file profile/multimap.h.

  • find — transparent, non-const 🔍
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::find (const _Kt & __x) [inline]

Definition at line 394 of file profile/multimap.h.

  • find — transparent, const 🔍
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::find (const _Kt & __x) const [inline]

Definition at line 413 of file profile/multimap.h.

  • find — plain key_type, non-const 🔎
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::find (const key_type & __x) [inline]

Definition at line 383 of file profile/multimap.h.

  • find — plain key_type, const 🔎
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::find (const key_type & __x) const [inline]

Definition at line 402 of file profile/multimap.h.

  • insert — the iterator range one 📥
template<typename _InputIterator >
void std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (_InputIterator __first, _InputIterator __last) [inline]

Definition at line 305 of file profile/multimap.h.

  • insert — rvalue _Pair with the enable_if gate 🚪
template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (_Pair && __x) [inline]

Definition at line 261 of file profile/multimap.h.

  • insert — const value_type ref 🍓
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (const value_type & __x) [inline]

Definition at line 250 of file profile/multimap.h.

  • insert — hint position + rvalue _Pair 🎀
template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type>
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (const_iterator __pos, _Pair && __x) [inline]

Definition at line 293 of file profile/multimap.h.

  • insert — hint position + const value_type ref 🎀
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (const_iterator __pos, const value_type & __x) [inline]

Definition at line 276 of file profile/multimap.h.

  • insert — the initializer_list glow-up ✨
void std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::insert (std::initializer_list< value_type > __list) [inline]

Definition at line 270 of file profile/multimap.h.

  • lower_bound — transparent, non-const ⬇️
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::lower_bound (const _Kt & __x) [inline]

Definition at line 452 of file profile/multimap.h.

  • lower_bound — transparent, const ⬇️
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::lower_bound (const _Kt & __x) const [inline]

Definition at line 473 of file profile/multimap.h.

  • lower_bound — plain key_type, non-const 🌸
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::lower_bound (const key_type & __x) [inline]

Definition at line 440 of file profile/multimap.h.

  • lower_bound — plain key_type, const 🌸
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::lower_bound (const key_type & __x) const [inline]

Definition at line 461 of file profile/multimap.h.

  • operator= — assign straight from an initializer_list 🫶
multimap & std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::operator= (initializer_list< value_type > __l) [inline]

Definition at line 146 of file profile/multimap.h.

  • rbegin — const reverse iterator 🦋
const_reverse_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::rbegin () const [inline],  [noexcept]

Definition at line 190 of file profile/multimap.h.

  • rbegin — non-const reverse iterator 🦋
reverse_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::rbegin () [inline],  [noexcept]

Definition at line 183 of file profile/multimap.h.

  • rend — const reverse iterator 🌈
const_reverse_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::rend () const [inline],  [noexcept]

Definition at line 204 of file profile/multimap.h.

  • rend — non-const reverse iterator 🌈
reverse_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::rend () [inline],  [noexcept]

Definition at line 197 of file profile/multimap.h.

  • swap — swap with another multimap, and yes it's noexcept 🔄
void std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::swap (multimap< _Key, _Tp, _Compare, _Allocator > & __x) [inline],  [noexcept]

Definition at line 366 of file profile/multimap.h.

  • upper_bound — transparent, non-const ⬆️
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::upper_bound (const _Kt & __x) [inline]

Definition at line 494 of file profile/multimap.h.

  • upper_bound — transparent, const ⬆️
template<typename _Kt , typename _Req  = typename __has_is_transparent<_Compare, _Kt>::type>
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::upper_bound (const _Kt & __x) const [inline]

Definition at line 515 of file profile/multimap.h.

  • upper_bound — plain key_type, non-const 💜
iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::upper_bound (const key_type & __x) [inline]

Definition at line 482 of file profile/multimap.h.

  • upper_bound — plain key_type, const 💜
const_iterator std::__profile::multimap< _Key, _Tp, _Compare, _Allocator >::upper_bound (const key_type & __x) const [inline]

Definition at line 503 of file profile/multimap.h.

and that's the whole overload roster, bestie — 27 of them, all living their best lives in profile/multimap.h 🫡

💾 MEMBER DATA DOCUMENTATION 💾

one (1) lonely data member, and honestly? she's doing great:

  • std::__profile::_Ordered_profile< _Cont >::_M_map2umap_info 🗂️
template<typename _Cont >
__gnu_profile::__map2umap_info* std::__profile::_Ordered_profile< _Cont >::_M_map2umap_info

she's protected and she's inherited — [protected], [inherited], the whole vibe.

Definition at line 89 of file ordered_base.h.

👑 AUTHOR 👑

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

like, nobody hand-wrote this. a robot did. and the robot ate, fr fr 🤖✨

and that's a wrap on the whole page, bestie!! 🎀 this was libstdc++, tag 3cxx — that's the source and version stamped on the bottom of this thing, generated straight from the source code by Doxygen and lovingly screamed into your terminal by me 💖 go forth and profile your multimaps, you absolute icon 👑💅🦋

📦 where this page comes from