STD::__DEBUG::UNORDERED_SET(3cxx)

📦
version 14-20240412 · 21 versions
, in ubuntu noble

🎀 std::__debug::unordered_set< _Value, _Hash, _Pred, _Alloc > 🎀

Okay so this is a libstdc++ manual page, bestie, and it's for std::__debug::unordered_set< _Value, _Hash, _Pred, _Alloc >. The vibe is literally: a std::unordered_set with safety/checking/debug instrumentation. No cap. ✨

✨ NAME ✨

std::__debug::unordered_set< _Value, _Hash, _Pred, _Alloc > - Class std::unordered_set with safety/checking/debug instrumentation.

🌸 SYNOPSIS 🌸

#include <unordered_set>

Inherits __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >, and unordered_set< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >.

🦋 Public Types 🦋

  • typedef _Base::allocator_type allocator_type — the allocator type, exactly as listed 💅
  • typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, unordered_set > const_iterator — the const iterator type
  • typedef __gnu_debug::_Safe_local_iterator< _Base_const_local_iterator, unordered_set > const_local_iterator — the const local iterator type
  • typedef _Base::const_pointer const_pointer — const pointer type
  • typedef _Base::const_reference const_reference — const reference type
  • typedef _Base::difference_type difference_type — difference type
  • typedef _Base::hasher hasher — hasher type
  • using insert_return_type = _Node_insert_return< iterator, node_type > — insert return type
  • typedef __gnu_debug::_Safe_iterator< _Base_iterator, unordered_set > iterator — iterator type
  • typedef _Base::key_equal key_equal — key equality type
  • typedef _Base::key_type key_type — key type
  • typedef __gnu_debug::_Safe_local_iterator< _Base_local_iterator, unordered_set > local_iterator — local iterator type
  • using node_type = typename _Base::node_type — node type
  • typedef _Base::pointer pointer — pointer type
  • typedef _Base::reference reference — reference type
  • typedef _Base::size_type size_type — size type
  • typedef _Base::value_type value_type — value type

💖 Public Member Functions 💖

Here's the full roster, bestie — every single signature, no skips:

  • unordered_set (_Base_ref __x)
  • template<typename _InputIterator > unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a)
  • template<typename _InputIterator > unordered_set (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a)
  • template<typename _InputIterator > unordered_set (_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_set (const allocator_type &__a)
  • unordered_set (const unordered_set &)=default
  • unordered_set (const unordered_set &__uset, const allocator_type &__a)
  • unordered_set (initializer_list< value_type > __l, size_type __n, const allocator_type &__a)
  • unordered_set (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a)
  • unordered_set (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_set (size_type __n, const allocator_type &__a)
  • unordered_set (size_type __n, const hasher &__hf, const allocator_type &__a)
  • unordered_set (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
  • unordered_set (unordered_set &&)=default
  • unordered_set (unordered_set &&__uset, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__uset), __a)))
  • const _Base & _M_base () const noexcept
  • _Base & _M_base () noexcept
  • const_iterator begin () const noexcept
  • iterator begin () noexcept
  • local_iterator begin (size_type __b)
  • const_local_iterator begin (size_type __b) const
  • size_type bucket_size (size_type __b) const
  • const_iterator cbegin () const noexcept
  • const_local_iterator cbegin (size_type __b) const
  • const_iterator cend () const noexcept
  • const_local_iterator cend (size_type __b) const
  • void clear () noexcept
  • template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
  • template<typename... _Args> iterator emplace_hint (const_iterator __hint, _Args &&... __args)
  • const_iterator end () const noexcept
  • iterator end () noexcept
  • local_iterator end (size_type __b)
  • const_local_iterator end (size_type __b) const
  • template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> std::pair< iterator, iterator > equal_range (const _Kt &__k)
  • template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> std::pair< const_iterator, const_iterator > equal_range (const _Kt &__k) const
  • std::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)
  • size_type erase (const key_type &__key)
  • iterator erase (const_iterator __first, const_iterator __last)
  • iterator erase (const_iterator __it)
  • iterator erase (iterator __it)
  • node_type extract (const key_type &__key)
  • node_type extract (const_iterator __position)
  • template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> iterator find (const _Kt &__k)
  • template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> const_iterator find (const _Kt &__k) const
  • iterator find (const key_type &__key)
  • const_iterator find (const key_type &__key) const
  • template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last)
  • std::pair< iterator, bool > insert (const value_type &__obj)
  • iterator insert (const_iterator __hint, const value_type &__obj)
  • iterator insert (const_iterator __hint, node_type &&__nh)
  • iterator insert (const_iterator __hint, value_type &&__obj)
  • insert_return_type insert (node_type &&__nh)
  • void insert (std::initializer_list< value_type > __l)
  • std::pair< iterator, bool > insert (value_type &&__obj)
  • float max_load_factor () const noexcept
  • void max_load_factor (float __f)
  • template<typename _H2 , typename _P2 > void merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &&__source)
  • template<typename _H2 , typename _P2 > void merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &__source)
  • template<typename _H2 , typename _P2 > void merge (unordered_set< _Value, _H2, _P2, _Alloc > &&__source)
  • template<typename _H2 , typename _P2 > void merge (unordered_set< _Value, _H2, _P2, _Alloc > &__source)
  • unordered_set & operator= (const unordered_set &)=default
  • unordered_set & operator= (initializer_list< value_type > __l)
  • unordered_set & operator= (unordered_set &&)=default
  • void swap (unordered_set &__x) noexcept(noexcept(declval< _Base & >().swap(__x)))

🌈 Protected Member Functions 🌈

  • constexpr void _M_swap (_Safe_container &__x) noexcept

🫶 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_set< _Value, _Hash, _Pred, _Alloc >
"Class std::unordered_set with safety/checking/debug instrumentation."

💜 Author 💜

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

Okay that's the whole page, bestie. Cute sign-off: it's from libstdc++; the original footer line is literally libstdstd::__debug::..._Pred, _Alloc >(3cxx), and the page doesn't print a separate date, so I'm not inventing one. 💖✨

📦 where this page comes from