__GNU_PBDS::DETAIL::RC_BINOMIAL_HEAP(3)

NAME 💖

okay so bestie, this page is all about __gnu_pbds::detail::rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > — the redundant-counter binomial heap. We're in the Library Functions Manual, section (3), and the header title is __gnu_pbds..., _Alloc >(3). It's giving data-structure main character energy, fr fr. 🫶

---

SYNOPSIS ✨

#include <rc_binomial_heap_.hpp>

Inherits __gnu_pbds::detail::binomial_heap_base< Value_Type, Cmp_Fn, _Alloc >.

Public Types 🎀

• typedef base_type::allocator_type allocator_type — the allocator type, straight from base_type.
• typedef base_type::cmp_fn cmp_fn — comparison function type, also from base_type.
• typedef base_type::const_iterator const_iterator — const iterator, from base_type.
• typedef base_type::const_pointer const_pointer — const pointer, from base_type.
• typedef base_type::const_reference const_reference — const reference, from base_type.
• typedef _Alloc::difference_type difference_type — difference type, from _Alloc.
• typedef base_type::iterator iterator — iterator, from base_type.
• typedef base_type::point_const_iterator point_const_iterator — point const iterator, from base_type.
• typedef base_type::point_iterator point_iterator — point iterator, from base_type.
• typedef base_type::pointer pointer — pointer, from base_type.
• typedef base_type::reference reference — reference, from base_type.
• typedef _Alloc::size_type size_type — size type, from _Alloc.
• typedef Value_Type value_type — the value type, periodt.

Public Member Functions 💅

• rc_binomial_heap (const Cmp_Fn &) — constructor, takes a const Cmp_Fn &.
• rc_binomial_heap (const rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &) — another constructor, takes a const reference to the same rc_binomial_heap type.
• iterator begin () — begin iterator.
• void clear () — clear it.
• bool empty () const — tells you if it's empty.
• iterator end () — end iterator.
• void erase (point_iterator) — erase by point_iterator.
• template<typename Pred> size_type erase_if (Pred) — erase-if with a Pred, returns size_type.
• Cmp_Fn & get_cmp_fn () — get the comparison function, returns Cmp_Fn &.
• void join (binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &) — join with a binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &.
• void join (rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &) — join with an rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &.
• size_type max_size () const — max size, returns size_type.
• void modify (point_iterator, const_reference) — modify with a point_iterator and a const_reference.
• void pop () — pop it.
• point_iterator push (const_reference) — push a const_reference, returns point_iterator.
• size_type size () const — size, returns size_type.
• template<typename Pred> void split (Pred, binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &) — split with a Pred and a binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &.
• template<typename Pred> void split (Pred, rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &) — split with a Pred and an rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &.
• void swap (left_child_next_sibling_heap< Value_Type, Cmp_Fn, _Alloc::size_type, _Alloc > &) — swap with a left_child_next_sibling_heap< Value_Type, Cmp_Fn, _Alloc::size_type, _Alloc > &.
• void swap (rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &) — swap with an rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc > &.
• const_reference top () const — top, returns const_reference.

Protected Types 🦋

• typedef base_type::node node — node type, from base_type.
• typedef alloc_traits::allocator_type node_allocator — node allocator, from alloc_traits.
• typedef _Alloc::size_type node_metadata — node metadata, from _Alloc.
• typedef std::pair< node_pointer, node_pointer > node_pointer_pair — a pair of node_pointers.

Protected Member Functions 🌸

• void actual_erase_node (node_pointer) — actually erase a node, takes a node_pointer.
• void bubble_to_top (node_pointer) — bubble to top, takes a node_pointer.
• void clear_imp (node_pointer) — clear implementation, takes a node_pointer.
• template<typename It> void copy_from_range (It, It) — copy from range, takes two Its.
• void find_max () — find max.
• node_pointer get_new_node_for_insert (const_reference) — get a new node for insert, takes a const_reference, returns node_pointer.
• node_pointer prune (Pred) — prune with a Pred, returns node_pointer.
• void swap (binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &) — swap with a binomial_heap_base< Value_Type, Cmp_Fn, _Alloc > &.
• void swap_with_parent (node_pointer, node_pointer) — swap with parent, takes two node_pointers.
• void to_linked_list () — convert to linked list.
• void value_swap (left_child_next_sibling_heap &) — value swap with a left_child_next_sibling_heap &.

Static Protected Member Functions ⭐

• static void make_child_of (node_pointer, node_pointer) — static, make child of, takes two node_pointers.
• static node_pointer parent (node_pointer) — static, parent, takes a node_pointer, returns node_pointer.

Protected Attributes 🍓

• node_pointer m_p_max — protected attribute.
• node_pointer m_p_root — protected attribute.
• size_type m_size — protected attribute.

---

Detailed Description 🌈

   template<typename Value_Type, typename Cmp_Fn, typename _Alloc>
       class __gnu_pbds::detail::rc_binomial_heap< Value_Type, Cmp_Fn, _Alloc
       >"Redundant-counter binomial heap.

So the class is literally described as the redundant-counter binomial heap. Yes, that stray " is in the original, and we're not fixing code here — code is sacred, bestie. 💅

Author 🫶

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

---

bye bestie 🎀 this was libstdc++'s page, __gnu_pbds..., _Alloc >(3), from the Library Functions Manual. No date on the page, just the source/version and title. xoxo 💖✨