__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 saysconst_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 plussize_type __n.template<class _InputIterator > hash_multiset (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf)β constructor from an iterator range plussize_type __nandconst 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 plussize_type __n,const hasher &__hf,const key_equal &__eql, andconst allocator_type &__a=allocator_type().hash_multiset (size_type __n)β constructor fromsize_type __n.hash_multiset (size_type __n, const hasher &__hf)β constructor fromsize_type __nandconst hasher &__hf.hash_multiset (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())β constructor fromsize_type __n,const hasher &__hf,const key_equal &__eql, andconst allocator_type &__a=allocator_type().iterator begin () constβbegin () constmember.size_type bucket_count () constβbucket_count () constmember.void clear ()βclear ()member.size_type count (const key_type &__key) constβcountmember takingconst key_type &__key.size_type elems_in_bucket (size_type __n) constβelems_in_bucketmember takingsize_type __n.bool empty () constβempty () constmember.iterator end () constβend () constmember.pair< iterator, iterator > equal_range (const key_type &__key) constβequal_rangemember takingconst key_type &__key.size_type erase (const key_type &__key)βerasemember takingconst key_type &__key.void erase (iterator __f, iterator __l)βerasemember takingiterator __f, iterator __l.void erase (iterator __it)βerasemember takingiterator __it.iterator find (const key_type &__key) constβfindmember takingconst key_type &__key.allocator_type get_allocator () constβget_allocator () constmember.hasher hash_funct () constβhash_funct () constmember.template<class _InputIterator > void insert (_InputIterator __f, _InputIterator __l)βinsertmember taking_InputIterator __f, _InputIterator __l.iterator insert (const value_type &__obj)βinsertmember takingconst value_type &__obj.iterator insert_noresize (const value_type &__obj)βinsert_noresizemember takingconst value_type &__obj.key_equal key_eq () constβkey_eq () constmember.size_type max_bucket_count () constβmax_bucket_count () constmember.size_type max_size () constβmax_size () constmember.void resize (size_type __hint)βresizemember takingsize_type __hint.size_type size () constβsize () constmember.void swap (hash_multiset &hs)βswapmember takinghash_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 friendoperator==.
π 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 π§
- Needs documentation! See
http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.html
π 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. β¨π«Ά
π¦ where this page comes from
- debian trixie: libstdc++-12-doc 12.4.0-5
- debian trixie: libstdc++-13-doc 13.3.0-16
- ubuntu noble: libstdc++-12-doc 12.3.0-17ubuntu1
- ubuntu noble: libstdc++-12-doc 12.4.0-2ubuntu1~24.04.1
- ubuntu noble: libstdc++-13-doc 13.2.0-23ubuntu4
- ubuntu noble: libstdc++-13-doc 13.3.0-6ubuntu2~24.04.1
- ubuntu noble: libstdc++-14-doc 14-20240412-0ubuntu1
- ubuntu questing: libstdc++-12-doc 12.5.0-6ubuntu1
- ubuntu questing: libstdc++-13-doc 13.4.0-4ubuntu1
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms