STD::__DEBUG::UNORDERED_MULTIMAP(3)
πΈ NAME πΈ
std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > β bestie, this is the Class std::unordered_multimap with safety/checking/debug instrumentation. Like the regular unordered_multimap but she went to therapy and now she checks things. π
Oh and this page lives in the Library Functions Manual, page 3, just so you know where you are. π«Ά
β¨ SYNOPSIS β¨
#include <unordered_map>
She inherits from __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > β whole family tree, iconic, we love her. π
π Public Types π
typedef _Base::allocator_type allocator_typetypedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_multimap > const_iteratortypedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_multimap > 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_multimap > iteratortypedef _Base::key_equal key_equaltypedef _Base::key_type key_typetypedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_multimap > local_iteratortypedef _Base::mapped_type mapped_typetypedef _Base::pointer pointertypedef _Base::reference referencetypedef _Base::size_type size_typetypedef _Base::value_type value_type
Sixteen typedefs, all of them serving π
π Public Member Functions π
The constructors, aka her many many entrances:
unordered_multimap (_Base_ref __x)template<typename _InputIterator> unordered_multimap (_InputIterator __first, _InputIterator __last, const allocator_type &__a)template<typename _InputIterator> unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a)template<typename _InputIterator> unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a)template<typename _InputIterator> unordered_multimap (_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_multimap (const allocator_type &__a)unordered_multimap (const unordered_multimap &)=defaultunordered_multimap (const unordered_multimap &__umap, const allocator_type &__a)unordered_multimap (initializer_list< value_type > __l, const allocator_type &__a)unordered_multimap (initializer_list< value_type > __l, size_type __n, const allocator_type &__a)unordered_multimap (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a)unordered_multimap (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_multimap (size_type __n, const allocator_type &__a)unordered_multimap (size_type __n, const hasher &__hf, const allocator_type &__a)unordered_multimap (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())unordered_multimap (unordered_multimap &&)=defaultunordered_multimap (unordered_multimap &&__umap, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__umap), __a)))
Then the whole rest of her resume:
const _Base & _M_base () const noexcept_Base & _M_base () noexceptconst_iterator begin () const noexceptiterator begin () noexceptlocal_iterator begin (size_type __b)const_local_iterator begin (size_type __b) constsize_type bucket_size (size_type __b) constconst_iterator cbegin () const noexceptconst_local_iterator cbegin (size_type __b) constconst_iterator cend () const noexceptconst_local_iterator cend (size_type __b) constvoid clear () noexcepttemplate<typename... _Args> iterator emplace (_Args &&... __args)template<typename... _Args> iterator emplace_hint (const_iterator __hint, _Args &&... __args)const_iterator end () const noexceptiterator end () noexceptlocal_iterator end (size_type __b)const_local_iterator end (size_type __b) conststd::pair< iterator, iterator > equal_range (const key_type &__key)std::pair< const_iterator, const_iterator > equal_range (const key_type &__key) const_Base_iterator erase (_Base_const_iterator __it)template<__heterogeneous_hash_key< unordered_multimap > _Kt> size_type erase (_Kt &&__key)size_type erase (const key_type &__key)iterator erase (const_iterator __first, const_iterator __last)iterator erase (const_iterator __it)iterator erase (iterator __it)iterator find (const key_type &__key)const_iterator find (const key_type &__key) consttemplate<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 &&__obj)iterator insert (const value_type &__obj)template<typename _Pair, typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> iterator insert (const_iterator __hint, _Pair &&__obj)iterator insert (const_iterator __hint, const value_type &__obj)iterator insert (const_iterator __hint, value_type &&__x)void insert (std::initializer_list< value_type > __l)iterator insert (value_type &&__x)float max_load_factor () const noexceptvoid max_load_factor (float __f)unordered_multimap & operator= (const unordered_multimap &)=defaultunordered_multimap & operator= (initializer_list< value_type > __l)unordered_multimap & operator= (unordered_multimap &&)=defaultvoid swap (unordered_multimap &__x) noexcept(noexcept(declval< _Base & >().swap(__x)))
Not the noexcept(noexcept(...)) nesting, that's her whole personality fr fr π
π Protected Member Functions π
constexpr void _M_swap (const _Safe_container &__x) const noexcept
Just the one, and she's protected β mind your business, respectfully π
π«Ά Friends π«Ά
template<typename _ItT, typename _SeqT, typename _CatT> class ::__gnu_debug::_Safe_iteratortemplate<typename _ItT, typename _SeqT> class ::__gnu_debug::_Safe_local_iterator
Her two ride-or-dies π
π Detailed Description π
Okay so the actual declaration, verbatim, no cap:
template<typename _Key, typename _Tp, typename _Hash = std::hash<_Key>,
typename _Pred = std::equal_to<_Key>, typename _Alloc =
std::allocator<std::pair<const _Key, _Tp> >>
class std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >
And what she is, one more time for the people in the back: "Class std::unordered_multimap with safety/checking/debug instrumentation." π
πΈ Author πΈ
Generated automatically by Doxygen for libstdc++ from the source code. So technically nobody wrote her, she simply materialised, main character energy, and we're all just living in her world β¨
And that's the whole page bestie β this is libstdc++, std::__debug::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >, manual page 3, and yes the footer says exactly that, so go forth and be safe out there πππ¦
π¦ where this page comes from
- arch rolling: gcc 16.2.1+r23+gd564253eb6c8-1 Β· GPL-3.0-or-later WITH GCC-exception-3.1 AND GFDL-1.3-or-later
- fedora 44: libstdc++-docs 16.2.1-2.fc44
- fedora 44: libstdc++-docs 16.2.1-3.fc44 Β· GPL-3.0-or-later AND LGPL-3.0-or-later AND (GPL-3.0-or-later WITH GCC-exception-3.1) AND (GPL-3.0-or-later WITH Texinfo-exception) AND (LGPL-2.1-or-later WITH GCC-exception-2.0) AND (GPL-2.0-or-later WITH GCC-exception-2.0) AND (GPL-2.0-or-later WITH GNU-compiler-exception) AND BSL-1.0 AND GFDL-1.3-or-later AND Linux-man-pages-copyleft-2-para AND SunPro AND BSD-1-Clause AND BSD-2-Clause AND BSD-2-Clause-Views AND BSD-3-Clause AND BSD-4-Clause AND BSD-Source-Code AND Zlib AND MIT AND Apache-2.0 AND (Apache-2.0 WITH LLVM-Exception) AND ZPL-2.1 AND ISC AND LicenseRef-Fedora-Public-Domain AND HP-1986 AND curl AND Martin-Birgmeier AND HPND-Markus-Kuhn AND dtoa AND SMLNJ AND AMD-newlib AND OAR AND HPND-merchantability-variant AND HPND-Intel
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms