STD::__DEBUG::SET(3cxx)

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

🌸 NAME 🌸

okay so this is the std::__debug::set< _Key, _Compare, _Allocator > page from manual section 3cxx. The header/manual string is literally std::__debug::...e, _Allocator >(3cxx) — yes, it’s truncated like that, and the actual class name is std::__debug::set< _Key, _Compare, _Allocator >. 💅

The one-line summary is: Class std::set with safety/checking/debug instrumentation. iconic, no cap.

✨ SYNOPSIS ✨

#include <set>

Inherits __gnu_debug::_Safe_container< _SafeContainer, _Alloc, _SafeBase, _IsCxx11AllocatorAware >, and set< _Key, std::less< _Key >, std::allocator< _Key > >.

🎀 Public Types 🎀

bestie, here’s the whole type roster:

  • typedef _Allocator allocator_type
  • typedef __gnu_debug::_Safe_iterator< _Base_const_iterator, set > const_iterator
  • typedef _Base::const_pointer const_pointer
  • typedef _Base::const_reference const_reference
  • typedef std::reverse_iterator< const_iterator > const_reverse_iterator
  • typedef _Base::difference_type difference_type
  • using insert_return_type = _Node_insert_return< iterator, node_type >
  • typedef __gnu_debug::_Safe_iterator< _Base_iterator, set > iterator
  • typedef _Compare key_compare
  • typedef _Key key_type
  • using node_type = typename _Base::node_type
  • typedef _Base::pointer pointer
  • typedef _Base::reference reference
  • typedef std::reverse_iterator< iterator > reverse_iterator
  • typedef _Base::size_type size_type
  • typedef _Compare value_compare
  • typedef _Key value_type

💅 Public Member Functions 💅

every single member function, no skips, periodt:

  • set (_Base_ref __x)
  • template<typename _InputIterator > set (_InputIterator __first, _InputIterator __last, const _Compare &__comp=_Compare(), const _Allocator &__a=_Allocator())
  • template<typename _InputIterator > set (_InputIterator __first, _InputIterator __last, const allocator_type &__a)
  • set (const _Compare &__comp, const _Allocator &__a=_Allocator())
  • set (const allocator_type &__a)
  • set (const set &)=default
  • set (const set &__x, const __type_identity_t< allocator_type > &__a)
  • set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
  • set (initializer_list< value_type > __l, const allocator_type &__a)
  • set (set &&)=default
  • set (set &&__x, const __type_identity_t< allocator_type > &__a) noexcept(noexcept(_Base(std::move(__x), __a)))
  • const _Base & _M_base () const noexcept
  • _Base & _M_base () noexcept
  • const_iterator begin () const noexcept
  • iterator begin () noexcept
  • const_iterator cbegin () const noexcept
  • const_iterator cend () const noexcept
  • void clear () noexcept
  • const_reverse_iterator crbegin () const noexcept
  • const_reverse_iterator crend () const noexcept
  • template<typename... _Args> std::pair< iterator, bool > emplace (_Args &&... __args)
  • template<typename... _Args> iterator emplace_hint (const_iterator __pos, _Args &&... __args)
  • const_iterator end () const noexcept
  • iterator end () noexcept
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> std::pair< iterator, iterator > equal_range (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> std::pair< const_iterator, const_iterator > equal_range (const _Kt &__x) const
  • std::pair< iterator, iterator > equal_range (const key_type &__x)
  • std::pair< const_iterator, const_iterator > equal_range (const key_type &__x) const
  • _Base_iterator erase (_Base_const_iterator __position)
  • size_type erase (const key_type &__x)
  • _GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __first, const_iterator __last)
  • _GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __position)
  • node_type extract (const key_type &__key)
  • node_type extract (const_iterator __position)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> iterator find (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator find (const _Kt &__x) const
  • iterator find (const key_type &__x)
  • const_iterator find (const key_type &__x) const
  • template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last)
  • std::pair< iterator, bool > insert (const value_type &__x)
  • iterator insert (const_iterator __hint, node_type &&__nh)
  • iterator insert (const_iterator __position, const value_type &__x)
  • iterator insert (const_iterator __position, value_type &&__x)
  • void insert (initializer_list< value_type > __l)
  • insert_return_type insert (node_type &&__nh)
  • std::pair< iterator, bool > insert (value_type &&__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> iterator lower_bound (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator lower_bound (const _Kt &__x) const
  • iterator lower_bound (const key_type &__x)
  • const_iterator lower_bound (const key_type &__x) const
  • set & operator= (const set &)=default
  • set & operator= (initializer_list< value_type > __l)
  • set & operator= (set &&)=default
  • const_reverse_iterator rbegin () const noexcept
  • reverse_iterator rbegin () noexcept
  • const_reverse_iterator rend () const noexcept
  • reverse_iterator rend () noexcept
  • void swap (set &__x) noexcept(/*conditional */)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> iterator upper_bound (const _Kt &__x)
  • template<typename _Kt , typename _Req = typename __has_is_transparent<_Compare, _Kt>::type> const_iterator upper_bound (const _Kt &__x) const
  • iterator upper_bound (const key_type &__x)
  • const_iterator upper_bound (const key_type &__x) const

🫶 Protected Member Functions 🫶

  • constexpr void _M_swap (_Safe_container &__x) noexcept

🦋 Friends 🦋

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

🔥 Detailed Description 🔥

the detailed-description template moment is literally this:

template<typename _Key, typename _Compare = std::less<_Key>, typename
    _Allocator = std::allocator<_Key>>
    class std::__debug::set< _Key, _Compare, _Allocator >"Class std::set
    with safety/checking/debug instrumentation.

So yeah: Class std::set with safety/checking/debug instrumentation. the debug checks are the whole main character energy here. 💖

👑 Author 👑

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

kisses bestie, this was generated automatically by Doxygen for libstdc++ from the source code. The footer bit says libstdstd::__debug::...e, _Allocator >(3cxx), and there’s no date listed on the page, so I’m not inventing one — slay responsibly 💅✨

📦 where this page comes from