__GNU_CXX::RB_TREE(3)

📦
version 16.2.1+r23+gd564253eb6c8 · 12 versions
, in arch rolling, fedora 44

🦋 __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > 🦋

okay so this is the __gnu_cxx:...e, _Alloc >(3) page from the Library Functions Manual, and it's giving major SGI extension energy 💅

🌸 NAME 🌸

__gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >

✨ SYNOPSIS ✨

#include <rb_tree>

🌈 Public Types 🌈

  • template<typename _Iter> using __same_value_type — a lil alias template, no cap.
  • typedef std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > _Base — the base class, periodt.
  • typedef _Base::allocator_type allocator_type — allocator type, we love.
  • typedef _Node_traits::_Const_iterator const_iterator — const iterator vibes.
  • typedef const value_type * const_pointer — pointer to const value_type, iconic.
  • typedef const value_type & const_reference — reference to const value_type.
  • typedef std::reverse_iterator< const_iterator > const_reverse_iterator — const reverse iterator, slay.
  • typedef ptrdiff_t difference_type — difference type, fr fr.
  • typedef _Node_traits::_Iterator iterator — iterator, main character energy.
  • typedef _Key key_type — key type, obviously.
  • typedef value_type * pointer — pointer, bestie.
  • typedef value_type & reference — reference, yes.
  • typedef std::reverse_iterator< iterator > reverse_iterator — reverse iterator, we stan.
  • typedef size_t size_type — size type, periodt.
  • typedef _Val value_type — value type, the moment.

💖 Public Member Functions 💖

  • rb_tree (const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type()) — constructor, bestie.
  • bool __rb_verify () const — verify vibes.
  • template<typename _Iterator> void _M_assign_equal (_Iterator, _Iterator) — assign equal.
  • template<typename _Iterator> void _M_assign_unique (_Iterator, _Iterator) — assign unique.
  • template<typename... _Args> iterator _M_emplace_equal (_Args &&... __args) — emplace equal.
  • template<typename... _Args> iterator _M_emplace_here (bool __place_left, _Base_ptr __node, _Args &&... __args) — emplace here.
  • template<typename... _Args> iterator _M_emplace_hint_equal (const_iterator __pos, _Args &&... __args) — emplace hint equal.
  • template<typename... _Args> iterator _M_emplace_hint_unique (const_iterator __pos, _Args &&... __args) — emplace hint unique.
  • template<typename... _Args> pair< iterator, bool > _M_emplace_unique (_Args &&... __args) — emplace unique.
  • template<typename _Kt> size_type _M_erase_tr (const _Kt &__x) — erase tr.
  • size_type _M_erase_unique (const key_type &__x) — erase unique.
  • pair< _Base_ptr, _Base_ptr > _M_get_insert_equal_pos (const key_type &__k) — get insert equal pos.
  • pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_equal_pos (const_iterator __pos, const key_type &__k) — get insert hint equal pos.
  • pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_unique_pos (const_iterator __pos, const key_type &__k) — get insert hint unique pos.
  • template<typename _Kt> pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_unique_pos_tr (const_iterator, const _Kt &__k) — get insert hint unique pos tr.
  • pair< _Base_ptr, _Base_ptr > _M_get_insert_unique_pos (const key_type &__k) — get insert unique pos.
  • template<typename _Kt> pair< _Base_ptr, _Base_ptr > _M_get_insert_unique_pos_tr (const _Kt &__k) — get insert unique pos tr.
  • const _Node_allocator & _M_get_Node_allocator () const noexcept — get Node allocator const.
  • _Node_allocator & _M_get_Node_allocator () noexcept — get Node allocator.
  • template<typename _Arg> iterator _M_insert_equal (_Arg &&__x) — insert equal.
  • template<typename _Arg> iterator _M_insert_equal_ (const_iterator __pos, _Arg &&__x) — insert equal with pos.
  • template<typename _Arg, typename _NodeGen> iterator _M_insert_equal_ (const_iterator __pos, _Arg &&__x, _NodeGen &) — insert equal with pos and node gen.
  • template<typename _InputIterator> __enable_if_t<!__same_value_type< _InputIterator >::value > _M_insert_range_equal (_InputIterator __first, _InputIterator __last) — insert range equal (not same value type).
  • template<typename _InputIterator> __enable_if_t< __same_value_type< _InputIterator >::value > _M_insert_range_equal (_InputIterator __first, _InputIterator __last) — insert range equal (same value type).
  • template<typename _InputIterator> __enable_if_t<!__same_value_type< _InputIterator >::value > _M_insert_range_unique (_InputIterator __first, _InputIterator __last) — insert range unique (not same value type).
  • template<typename _InputIterator> __enable_if_t< __same_value_type< _InputIterator >::value > _M_insert_range_unique (_InputIterator __first, _InputIterator __last) — insert range unique (same value type).
  • template<typename _Arg> pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, bool > _M_insert_unique (_Arg &&__v) — insert unique with _Rb_tree iterator.
  • template<typename _Arg> pair< iterator, bool > _M_insert_unique (_Arg &&__x) — insert unique.
  • template<typename _Arg> iterator _M_insert_unique_ (const_iterator __pos, _Arg &&__x) — insert unique with pos.
  • template<typename _Arg, typename _NodeGen> iterator _M_insert_unique_ (const_iterator __pos, _Arg &&__x, _NodeGen &) — insert unique with pos and node gen.
  • const_iterator begin () const noexcept — begin const.
  • iterator begin () noexcept — begin.
  • void clear () noexcept — clear.
  • size_type count (const key_type &__k) const — count.
  • bool empty () const noexcept — empty.
  • const_iterator end () const noexcept — end const.
  • iterator end () noexcept — end.
  • pair< iterator, iterator > equal_range (const key_type &__k) — equal range.
  • pair< const_iterator, const_iterator > equal_range (const key_type &__k) const — equal range const.
  • size_type erase (const key_type &__x) — erase by key.
  • iterator erase (const_iterator __first, const_iterator __last) — erase range.
  • iterator erase (const_iterator __position) — erase const iterator.
  • iterator erase (iterator __position) — erase iterator.
  • iterator find (const key_type &__k) — find.
  • const_iterator find (const key_type &__k) const — find const.
  • allocator_type get_allocator () const noexcept — get allocator.
  • _Compare key_comp () const — key comp.
  • iterator lower_bound (const key_type &__k) — lower bound.
  • const_iterator lower_bound (const key_type &__k) const — lower bound const.
  • size_type max_size () const noexcept — max size.
  • const_reverse_iterator rbegin () const noexcept — rbegin const.
  • reverse_iterator rbegin () noexcept — rbegin.
  • const_reverse_iterator rend () const noexcept — rend const.
  • reverse_iterator rend () noexcept — rend.
  • size_type size () const noexcept — size.
  • void swap (_Rb_tree &__t) noexcept(/*conditional */) — swap, conditional noexcept.
  • iterator upper_bound (const key_type &__k) — upper bound.
  • const_iterator upper_bound (const key_type &__k) const — upper bound const.

🔒 Protected Types 🔒

  • typedef _Node_traits::_Base_ptr _Base_ptr — base ptr.
  • typedef _Node_traits::_Header_t _Header_t — header type.
  • typedef _Node_traits::_Node_ptr _Node_ptr — node ptr.

🛡️ Protected Member Functions 🛡️

  • _Base_ptr _M_begin () const noexcept — begin.
  • _Node_ptr _M_begin_node () const noexcept — begin node.
  • template<bool _MoveValue, typename _NodeGen> _Node_ptr _M_clone_node (_Node_ptr __x, _NodeGen &__node_gen) — clone node.
  • template<typename... _Args> void _M_construct_node (_Node_ptr __node, _Args &&... __args) — construct node.
  • template<typename... _Args> _Node_ptr _M_create_node (_Args &&... __args) — create node.
  • void _M_destroy_node (_Node_ptr __p) noexcept — destroy node.
  • void _M_drop_node (_Node_ptr __p) noexcept — drop node.
  • _Base_ptr _M_end () const noexcept — end.
  • _Node_ptr _M_get_node () — get node.
  • template<typename _Key1, typename _Key2> bool _M_key_compare (const _Key1 &__k1, const _Key2 &__k2) const — key compare.
  • _Base_ptr _M_leftmost () const noexcept — leftmost const.
  • _Base_ptr & _M_leftmost () noexcept — leftmost.
  • void _M_put_node (_Node_ptr __p) noexcept — put node.
  • _Base_ptr _M_rightmost () const noexcept — rightmost const.
  • _Base_ptr & _M_rightmost () noexcept — rightmost.
  • _Base_ptr _M_root () const noexcept — root const.
  • _Base_ptr & _M_root () noexcept — root.

✨ Static Protected Member Functions ✨

  • static const _Key & _S_key (_Base_ptr __x) — S key base ptr.
  • static const _Key & _S_key (_Node_ptr __x) — S key node ptr.
  • static const _Key & _S_key (const _Node &__node) — S key node ref.
  • static _Base_ptr _S_left (_Base_ptr __x) noexcept — S left base ptr.
  • static _Node_ptr _S_left (_Node_ptr __x) — S left node ptr.
  • static _Base_ptr _S_right (_Base_ptr __x) noexcept — S right base ptr.
  • static _Node_ptr _S_right (_Node_ptr __x) noexcept — S right node ptr.

📦 Protected Attributes 📦

  • _Rb_tree_impl< _Compare > _M_impl — the impl, periodt.

💅 DETAILED DESCRIPTION 💅

template<class _Key, class _Value, class _KeyOfValue, class _Compare, class
    _Alloc = std::allocator<_Value>>
    struct __gnu_cxx::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc
    >"This is an SGI extension.

📝 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.

that's the whole page, bestie! this manual page is from libstdc++ and the footer says libstdc++ __gnu_cxx:...e, _Alloc >(3) — no date stamped, so that's the vibe 💅✨

📦 where this page comes from
  • arch rolling: gcc 16.2.1+r23+gd564253eb6c8-1 · GPL-3.0-or-later WITH GCC-exception-3.1 AND GFDL-1.3-or-later
  • fedora 44: libstdc++-docs 16.2.1-2.fc44
  • fedora 44: libstdc++-docs 16.2.1-3.fc44 · GPL-3.0-or-later AND LGPL-3.0-or-later AND (GPL-3.0-or-later WITH GCC-exception-3.1) AND (GPL-3.0-or-later WITH Texinfo-exception) AND (LGPL-2.1-or-later WITH GCC-exception-2.0) AND (GPL-2.0-or-later WITH GCC-exception-2.0) AND (GPL-2.0-or-later WITH GNU-compiler-exception) AND BSL-1.0 AND GFDL-1.3-or-later AND Linux-man-pages-copyleft-2-para AND SunPro AND BSD-1-Clause AND BSD-2-Clause AND BSD-2-Clause-Views AND BSD-3-Clause AND BSD-4-Clause AND BSD-Source-Code AND Zlib AND MIT AND Apache-2.0 AND (Apache-2.0 WITH LLVM-Exception) AND ZPL-2.1 AND ISC AND LicenseRef-Fedora-Public-Domain AND HP-1986 AND curl AND Martin-Birgmeier AND HPND-Markus-Kuhn AND dtoa AND SMLNJ AND AMD-newlib AND OAR AND HPND-merchantability-variant AND HPND-Intel
  • 💖 girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms