__GNU_CXX::HASH_MAP(3cxx)
π NAME π
okay so welcome to the 3cxx manual page, bestie β this is the whole vibe for __gnu_cxx::hash_map< _Key, _Tp, _HashFn, _EqualKey, _Alloc >. Itβs giving βSGI extensionβ energy, and we are keeping every single deet, no cap. π
β¨ SYNOPSIS β¨
First up, the include line is literally this, bestie:
#include <hash_map>
π Public Types π
These are the public type aliases, copied exactly character-for-character. Slay, but make it precise. β¨
typedef _Ht::allocator_type allocator_typeβ type alias, exactly as listed.typedef _Ht::const_iterator const_iteratorβ type alias, exactly as listed.typedef _Ht::const_pointer const_pointerβ type alias, exactly as listed.typedef _Ht::const_reference const_referenceβ type alias, exactly as listed.typedef _Tp data_typeβ type alias, exactly as listed.typedef _Ht::difference_type difference_typeβ type alias, exactly as listed.typedef _Ht::hasher hasherβ type alias, exactly as listed.typedef _Ht::iterator iteratorβ type alias, exactly as listed.typedef _Ht::key_equal key_equalβ type alias, exactly as listed.typedef _Ht::key_type key_typeβ type alias, exactly as listed.typedef _Tp mapped_typeβ type alias, exactly as listed.typedef _Ht::pointer pointerβ type alias, exactly as listed.typedef _Ht::reference referenceβ type alias, exactly as listed.typedef _Ht::size_type size_typeβ type alias, exactly as listed.typedef _Ht::value_type value_typeβ type alias, exactly as listed.
π Public Member Functions π
Hereβs the full member-function lineup, bestie β every signature is kept exactly as written, no edits, no βhelpfulβ fixes, periodt. π«Ά
template<class _InputIterator > hash_map (_InputIterator __f, _InputIterator __l)β constructor overload, exact.template<class _InputIterator > hash_map (_InputIterator __f, _InputIterator __l, size_type __n)β constructor overload, exact.template<class _InputIterator > hash_map (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf)β constructor overload, exact.template<class _InputIterator > hash_map (_InputIterator __f, _InputIterator __l, size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())β constructor overload, exact.hash_map (size_type __n)β constructor overload, exact.hash_map (size_type __n, const hasher &__hf)β constructor overload, exact.hash_map (size_type __n, const hasher &__hf, const key_equal &__eql, const allocator_type &__a=allocator_type())β constructor overload, exact.iterator begin ()β member function, exact.const_iterator begin () constβ member function, exact.size_type bucket_count () constβ member function, exact.void clear ()β member function, exact.size_type count (const key_type &__key) constβ member function, exact.size_type elems_in_bucket (size_type __n) constβ member function, exact.bool empty () constβ member function, exact.iterator end ()β member function, exact.const_iterator end () constβ member function, exact.pair< iterator, iterator > equal_range (const key_type &__key)β member function, exact.pair< const_iterator, const_iterator > equal_range (const key_type &__key) constβ member function, exact.size_type erase (const key_type &__key)β member function, exact.void erase (iterator __f, iterator __l)β member function, exact.void erase (iterator __it)β member function, exact.iterator find (const key_type &__key)β member function, exact.const_iterator find (const key_type &__key) constβ member function, exact.allocator_type get_allocator () constβ member function, exact.hasher hash_funct () constβ member function, exact.template<class _InputIterator > void insert (_InputIterator __f, _InputIterator __l)β member function, exact.pair< iterator, bool > insert (const value_type &__obj)β member function, exact.pair< iterator, bool > insert_noresize (const value_type &__obj)β member function, exact.key_equal key_eq () constβ member function, exact.size_type max_bucket_count () constβ member function, exact.size_type max_size () constβ member function, exact._Tp & operator[] (const key_type &__key)β member function, exact.void resize (size_type __hint)β member function, exact.size_type size () constβ member function, exact.void swap (hash_map &__hs)β member function, exact.
π«Ά Friends π«Ά
There is exactly one friend listed, and itβs this equality-operator template. Bestie, Iβm putting it in a code block so the spacing survives the group chat. π
template<class _K1 , class _T1 , class _HF , class _EqK , class _Al >
bool operator== (const hash_map< _K1, _T1, _HF, _EqK, _Al > &, const
hash_map< _K1, _T1, _HF, _EqK, _Al > &)
π Detailed Description π
okay so the detailed description is short but iconic. The class template is this, exactly:
template<class _Key, class _Tp, class _HashFn = hash<_Key>, class _EqualKey
= equal_to<_Key>, class _Alloc = allocator<_Tp>>
class __gnu_cxx::hash_map< _Key, _Tp, _HashFn, _EqualKey, _Alloc >
And the official note is: βThis is an SGI extension.β Thatβs the whole sentence, bestie β no extra lore added, fr fr. β¨
π Todo π
The todo is literally: βNeeds documentation! See http://gcc.gnu.org/onlinedocs/libstdc++/manual/documentation_style.htmlβ. So yeah β documentation vibes are pending. π«
π Author π
βGenerated automatically by Doxygen for libstdc++ from the source code.β Thatβs the whole author note, exactly as given. π
okurrr bye bestie π
β this page is from libstdc++ and the 3cxx section, generated automatically by Doxygen from the source code. The footer source/version text is this wild little string: libst__gnu_cxx::hash...alKey, _Alloc >(3cxx), and no separate date is listed. π
π¦ 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