__GNU_CXX::HASH_MULTISET(3cxx)

πŸ’– NAME πŸ’–

okay so the manual name is __gnu_cxx::hash_multiset(3cxx) β€” yes bestie, section 3cxx. The actual class it’s hyping is __gnu_cxx::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >. That’s the whole name, no cap. πŸ’…

✨ SYNOPSIS ✨

#include <hash_set>

🌸 Public Types 🌸

These are the typedefs it’s serving, in order:

  • typedef _Ht::allocator_type allocator_type β€” allocator type typedef.
  • typedef _Ht::const_iterator const_iterator β€” const iterator typedef.
  • typedef _Alloc::const_pointer const_pointer β€” const pointer typedef.
  • typedef _Alloc::const_reference const_reference β€” const reference typedef.
  • typedef _Ht::difference_type difference_type β€” difference type typedef.
  • typedef _Ht::hasher hasher β€” hasher typedef.
  • typedef _Ht::const_iterator iterator β€” iterator typedef, and yes it says const_iterator.
  • typedef _Ht::key_equal key_equal β€” key-equal typedef.
  • typedef _Ht::key_type key_type β€” key type typedef.
  • typedef _Alloc::pointer pointer β€” pointer typedef.
  • typedef _Alloc::reference reference β€” reference typedef.
  • typedef _Ht::size_type size_type β€” size type typedef.
  • typedef _Ht::value_type value_type β€” value type typedef.

πŸŽ€ Public Member Functions πŸŽ€

One per bullet, exactly as listed, bestie:

  • template<class _InputIterator > hash_multiset (_InputIterator __f, _InputIterator __l) β€” constructor from an iterator range.
  • template<class _InputIterator > hash_multiset (_InputIterator __f, _InputIterator __l, size_type __n) β€” constructor from an iterator range plus size_type __n.
  • template<class _InputIterator > hash_multiset (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf) β€” constructor from an iterator range plus size_type __n and const hasher &__hf.
  • template<class _InputIterator > hash_multiset (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type()) β€” constructor from an iterator range plus size_type __n, const hasher &__hf, const key_equal &__eql, and const allocator_type &__a=allocator_type().
  • hash_multiset (size_type __n) β€” constructor from size_type __n.
  • hash_multiset (size_type __n, const hasher &__hf) β€” constructor from size_type __n and const hasher &__hf.
  • hash_multiset (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type()) β€” constructor from size_type __n, const hasher &__hf, const key_equal &__eql, and const allocator_type &__a=allocator_type().
  • iterator begin () const β€” begin () const member.
  • size_type bucket_count () const β€” bucket_count () const member.
  • void clear () β€” clear () member.
  • size_type count (const key_type &__key) const β€” count member taking const key_type &__key.
  • size_type elems_in_bucket (size_type __n) const β€” elems_in_bucket member taking size_type __n.
  • bool empty () const β€” empty () const member.
  • iterator end () const β€” end () const member.
  • pair< iterator, iterator > equal_range (const key_type &__key) const β€” equal_range member taking const key_type &__key.
  • size_type erase (const key_type &__key) β€” erase member taking const key_type &__key.
  • void erase (iterator __f, iterator __l) β€” erase member taking iterator __f, iterator __l.
  • void erase (iterator __it) β€” erase member taking iterator __it.
  • iterator find (const key_type &__key) const β€” find member taking const key_type &__key.
  • allocator_type get_allocator () const β€” get_allocator () const member.
  • hasher hash_funct () const β€” hash_funct () const member.
  • template<class _InputIterator > void insert (_InputIterator __f, _InputIterator __l) β€” insert member taking _InputIterator __f, _InputIterator __l.
  • iterator insert (const value_type &__obj) β€” insert member taking const value_type &__obj.
  • iterator insert_noresize (const value_type &__obj) β€” insert_noresize member taking const value_type &__obj.
  • key_equal key_eq () const β€” key_eq () const member.
  • size_type max_bucket_count () const β€” max_bucket_count () const member.
  • size_type max_size () const β€” max_size () const member.
  • void resize (size_type __hint) β€” resize member taking size_type __hint.
  • size_type size () const β€” size () const member.
  • void swap (hash_multiset &hs) β€” swap member taking hash_multiset &hs.

πŸ¦‹ Friends πŸ¦‹

  • template<class _Val , class _HF , class _EqK , class _Al > bool operator== (const hash_multiset< _Val, _HF, _EqK, _Al > &, const hash_multiset< _Val, _HF, _EqK, _Al > &) β€” the friend operator==.

🌈 Detailed Description 🌈

The template situation is literally this:

template<class _Value, class _HashFcn = hash<_Value>, class _EqualKey = equal_to<_Value>, class _Alloc = allocator<_Value>>
class __gnu_cxx::hash_multiset< _Value, _HashFcn, _EqualKey, _Alloc >

And then it says: β€œThis is an SGI extension.” iconic official tea. 🫢

🧚 Todo 🧚

πŸ‘‘ Author πŸ‘‘

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


k bye bestie πŸ’– the footer/source-version stamp is libstd__gnu_cxx::has...alKey, _Alloc >(3cxx) β€” libstdc++ biz β€” and the date field is literally not printed on this page, so I’m not inventing one. periodt. ✨🫢