STD::__DEBUG::UNORDERED_MULTISET(3)

💖 std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc > 💖

okay bestie, you've landed in the Library Functions Manual section, and this page is specifically about the debug version of std::unordered_multiset — like, the same container you already know and love, but wearing a little safety vest. 🦺✨

---

🌸 NAME 🌸

std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc > — a Class, and it's literally std::unordered_multiset with safety/checking/debug instrumentation on top. no cap, that's the whole vibe. 💅

---

✨ SYNOPSIS ✨

#include <unordered_set>

Inherits from: __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware > — so like, all that safe-container energy is inherited, periodt.

---

🎀 Public Types 🎀

not me listing every single one, but bestie they all matter:

• typedef _Base::allocator_type allocator_type — the allocator type, straight from _Base. 🫶
• typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_multiset > const_iterator — const iterator, but the safe/debug kind. ✨
• typedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_multiset > const_local_iterator — the const local iterator, also safety-instrumented.
• typedef _Base::const_pointer const_pointer — const pointer, inherited from _Base.
• typedef _Base::const_reference const_reference — const reference, also from _Base.
• typedef _Base::difference_type difference_type — difference type, _Base's own.
• typedef _Base::hasher hasher — the hasher type. yes queen, hashing.
• typedef __gnu_debug::_Safe_iterator< _Base_iterator, unordered_multiset > iterator — the main-character iterator, safe flavour. 👑
• typedef _Base::key_equal key_equal — key equality predicate type.
• typedef _Base::key_type key_type — the key type.
• typedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_multiset > local_iterator — local iterator with the debug instrumentation. 🔥
• typedef _Base::pointer pointer — pointer, from _Base.
• typedef _Base::reference reference — reference, from _Base.
• typedef _Base::size_type size_type — size type, from _Base.
• typedef _Base::value_type value_type — value type, from _Base.

---

👑 Public Member Functions 👑

bestie there are SO many constructors. buckle up, we're going through every single one, fr fr:

• unordered_multiset (_Base_ref __x) — takes a _Base_ref __x.
• template<typename _InputIterator> unordered_multiset (_InputIterator __first, _InputIterator __last, const allocator_type &__a) — range-y constructor, first to last, plus an allocator.
• template<typename _InputIterator> unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) — same range energy, now with size_type __n in the mix too.
• template<typename _InputIterator> unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) — range, __n, a hasher __hf, and an allocator. the whole squad. 💖
• template<typename _InputIterator> unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) — the fully-loaded range constructor, with defaults on literally everything after the iterators.
• unordered_multiset (const allocator_type &__a) — allocator-only constructor.
• unordered_multiset (const unordered_multiset &)=default — copy constructor, =default. iconic.
• unordered_multiset (const unordered_multiset &__uset, const allocator_type &__a) — copy from __uset, but with your own allocator.
• unordered_multiset (initializer_list< value_type > __l, const allocator_type &__a) — from an initializer_list< value_type > __l plus an allocator.
• unordered_multiset (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) — the initializer list, __n, and an allocator.
• unordered_multiset (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) — init list, __n, hasher, allocator. all four, slay.
• unordered_multiset (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()) — the deluxe init-list constructor, defaults everywhere.
• unordered_multiset (size_type __n, const allocator_type &__a) — sized, with an allocator.
• unordered_multiset (size_type __n, const hasher &__hf, const allocator_type &__a) — sized, hasher, allocator.
• unordered_multiset (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) — sized, with all the defaults doing their thing.
• unordered_multiset (unordered_multiset &&)=default — move constructor, =default. 🦋
• unordered_multiset (unordered_multiset &&__uset, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__uset), __a))) — move with an allocator, and yes that noexcept spec is exactly what it says.

and now the actual member functions, no skips, we don't do that here:

• const _Base & _M_base () const noexcept — hands you the _Base back, const and noexcept.
• _Base & _M_base () noexcept — the non-const one.
• const_iterator begin () const noexcept — const begin, noexcept.
• iterator begin () noexcept — begin, noexcept.
• local_iterator begin (size_type __b) — local begin for bucket __b.
• const_local_iterator begin (size_type __b) const — const local begin for bucket __b.
• size_type bucket_size (size_type __b) const — bucket size for bucket __b.
• const_iterator cbegin () const noexcept — cbegin, const, noexcept.
• const_local_iterator cbegin (size_type __b) const — const local cbegin for bucket __b.
• const_iterator cend () const noexcept — cend, const, noexcept.
• const_local_iterator cend (size_type __b) const — const local cend for bucket __b.
• void clear () noexcept — clear, and it's noexcept. 🧚
• template<typename... _Args> iterator emplace (_Args &&... __args) — variadic emplace, forwards __args.
• template<typename... _Args> iterator emplace_hint (const_iterator __hint, _Args &&... __args) — emplace with a __hint up front.
• const_iterator end () const noexcept — const end, noexcept.
• iterator end () noexcept — end, noexcept.
• local_iterator end (size_type __b) — local end for bucket __b.
• const_local_iterator end (size_type __b) const — const local end for bucket __b.
• std::pair< iterator, iterator > equal_range (const key_type &__key) — equal_range on __key, gives you a pair of iterators.
• std::pair< const_iterator, const_iterator > equal_range (const key_type &__key) const — the const version, pair of const iterators.
• _Base_iterator erase (_Base_const_iterator __it) — erase at __it, returns a _Base_iterator.
• template<__heterogeneous_hash_key< unordered_multiset > _Kt> size_type erase (_Kt &&__key) — the templated heterogeneous-key erase, returns a size_type.
• size_type erase (const key_type &__key) — erase by __key, returns a size_type.
• iterator erase (const_iterator __first, const_iterator __last) — erase the range __first to __last.
• iterator erase (const_iterator __it) — erase at a const_iterator.
• iterator erase (iterator __it) — erase at a plain iterator.
• iterator find (const key_type &__key) — find your __key.
• const_iterator find (const key_type &__key) const — const find your __key.
• template<typename _InputIterator> void insert (_InputIterator __first, _InputIterator __last) — range insert, __first to __last.
• iterator insert (const value_type &__obj) — insert __obj, get an iterator back.
• iterator insert (const_iterator __hint, const value_type &__obj) — insert __obj with a __hint.
• iterator insert (const_iterator __hint, value_type &&__obj) — same but __obj is an rvalue ref. 🔥
• void insert (std::initializer_list< value_type > __l) — insert a whole initializer_list< value_type > __l.
• iterator insert (value_type &&__obj) — rvalue __obj, iterator back.
• float max_load_factor () const noexcept — get the max load factor, noexcept.
• void max_load_factor (float __f) — set the max load factor to __f.
• unordered_multiset & operator= (const unordered_multiset &)=default — copy assignment, =default.
• unordered_multiset & operator= (initializer_list< value_type > __l) — assign from an initializer_list< value_type > __l.
• unordered_multiset & operator= (unordered_multiset &&)=default — move assignment, =default.
• void swap (unordered_multiset &__x) noexcept(noexcept(declval< _Base & >().swap(__x))) — swap with __x, with that very specific noexcept clause. 💀

---

🛡️ Protected Member Functions 🛡️

• constexpr void _M_swap (const _Safe_container &__x) const noexcept — protected, constexpr, const, noexcept. the whole résumé. ✨

---

🫶 Friends 🫶

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

---

🔥 Detailed Description 🔥

template<typename _Value, typename _Hash = std::hash<_Value>, typename _Pred = std::equal_to<_Value>, typename _Alloc = std::allocator<_Value>>
class std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >

"Class std::unordered_multiset with safety/checking/debug instrumentation."

like, that's the whole point of this thing bestie — same container, but with the safety, checking and debug instrumentation turned all the way up. 💅

---

📚 Author 📚

Generated automatically by Doxygen for libstdc++ from the source code. so not a human, just a lil robot doing its thing. 🤖

---

okay that's the whole page!! 🎀 this was brought to you by libstdc++, and it's the std::__deb..., _Alloc >(3) page — mwah, go forth and debug safely bestie 💖✨🦋