__GNU_PBDS::TREE_ORDER_STATISTICS_NODE_UPDATE(3)

💖 __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > 💖

okay bestie, come closer — this one's from the Library Functions Manual, section 3, and it's a whole entire template class living inside __gnu_pbds. It's giving "functor that updates the ranks of entrees" and honestly? iconic. Let's get into it. 🦋

---

✨ NAME ✨

__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > — a functor updating ranks of entrees. yes that's the whole job description, and she does it flawlessly. 💅

---

🎀 SYNOPSIS 🎀

#include <tree_policy.hpp>

Inherits __gnu_pbds::detail::branch_policy< Node_CItr, Node_Itr, _Alloc >. lowkey a nepo baby but she earned it. 💜

🌸 Public Types 🌸

• allocator_type — typedef for _Alloc
• cmp_fn — typedef for Cmp_Fn
• const_iterator — typedef for node_const_iterator::value_type
• iterator — typedef for node_iterator::value_type
• key_const_reference — typedef for base_type::key_const_reference
• key_type — typedef for base_type::key_type
• metadata_type — typedef for size_type
• node_const_iterator — typedef for Node_CItr
• node_iterator — typedef for Node_Itr
• size_type — typedef for allocator_type::size_type

🌈 Public Member Functions 🌈

• iterator find_by_order(size_type) — Finds an entry by __order. Returns an iterator to the entry with the __order order, or an iterator to the container object's end if order is at least the size of the container object.
• const_iterator find_by_order(size_type) const — Finds an entry by __order. Returns a const_iterator to the entry with the __order order, or a const_iterator to the container object's end if order is at least the size of the container object.
• size_type order_of_key(key_const_reference) const — Returns the order of a key within a sequence. For example, if r_key is the smallest key, this method will return 0; if r_key is a key between the smallest and next key, this method will return 1; if r_key is a key larger than the largest key, this method will return the size of r_c.

🧚 Protected Member Functions 🧚

• void operator()(node_iterator, node_const_iterator) const — Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.

---

💫 Detailed Description 💫

template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
class __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >

"Functor updating ranks of entrees." — that's the vibe, that's the whole assignment, no notes. ✨

---

👑 Member Function Documentation 👑

find_by_order

template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::iterator
__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::find_by_order (size_type order) [inline]

Finds an entry by __order. Returns an iterator to the entry with the __order order, or an iterator to the container object's end if order is at least the size of the container object. no cap, it just hands you the iterator. 🫶

find_by_order (the const one, she's different)

template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::const_iterator
__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::find_by_order (size_type order) const [inline]

Finds an entry by __order. Returns a const_iterator to the entry with the __order order, or a const_iterator to the container object's end if order is at least the size of the container object. same energy, const edition. 💅

operator()

template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
void __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::operator() (node_iterator node_it, node_const_iterator end_nd_it) const [inline], [protected]

Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator. she's protected bestie, so hands off unless you're family. 🙈

order_of_key

template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::size_type
__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::order_of_key (key_const_reference r_key) const [inline]

Returns the order of a key within a sequence. For example, if r_key is the smallest key, this method will return 0; if r_key is a key between the smallest and next key, this method will return 1; if r_key is a key larger than the largest key, this method will return the size of r_c. literally just counting, but make it fancy. 🔥

---

🎀 Author 🎀

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

---

and that's the whole page bestie — this one came to you straight out of the libstdc++ manual, section 3, generated automatically by Doxygen for libstdc++ straight from the source code. go forth and rank your entrees. slay. 💖✨🎀🦋🌸