__GNU_PBDS::TRIE_ORDER_STATISTICS_NODE_UPDATE(3)

✨ NAME ✨

hiii bestie, welcome to the Library Functions Manual 💖 and say hello to the main character:

__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >

she's a functor updating ranks of entrees ✨ (yes, entrees — that's literally what it says, we are not fixing it, it's iconic)

---

🎀 SYNOPSIS 🎀

she lives in this header, bestie:

#include <trie_policy.hpp

and she inherits from:

__gnu_pbds::detail::trie_policy_base< Node_CItr, Node_Itr, _ATraits, _Alloc >

🦋 Public Types 🦋

• a_const_iterator — typedef access_traits::const_iterator, the const-iterator vibe of her access traits 🌸
• access_traits — typedef _ATraits, the access traits she's templated on
• allocator_type — typedef _Alloc, the allocator she's templated on
• const_iterator — typedef node_const_iterator::value_type, the const iterator type
• iterator — typedef node_iterator::value_type, the iterator type
• key_const_reference — typedef base_type::key_const_reference, a const reference to a key
• key_type — typedef base_type::key_type, the key type itself
• metadata_type — typedef size_type, the metadata is literally a size type, periodt
• node_const_iterator — typedef Node_CItr, the const node iterator she's templated on
• node_iterator — typedef Node_Itr, the node iterator she's templated on
• size_type — typedef allocator_type::size_type, the size type borrowed from the allocator

💅 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 — same quest, const flavor: 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 exapmle, 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 💀
• size_type order_of_prefix (a_const_iterator, a_const_iterator) const — returns the order of a prefix within a sequence. For exapmle, if [b, e] is the smallest prefix, 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 💀

ngl "exapmle" is in the original and I refuse to gaslight you about it. she's quirky, we love her 🙈

🦄 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 👑

🌈 Private Member Functions 🌈

• virtual const_iterator end () const =0 — pure virtual, she's not implementing this one, it's giving "you do it" 💅
• virtual const access_traits & get_access_traits () const =0 — also pure virtual, also "you do it", and she wants a const reference back 🎀

---

👑 Detailed Description 👑

the template situation, verbatim, no notes:

template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
class __gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >

"Functor updating ranks of entrees." — that's the whole detailed description bestie, she said what she said 🦋

---

💖 Member Function Documentation 💖

⭐ find_by_order (non-const, [inline])

template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >::iterator
__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _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 🌸

⭐ find_by_order (const, [inline])

template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >::const_iterator
__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _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 ✨

⭐ operator() ([inline], [protected])

template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
void __gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >::operator() (node_iterator nd_it, node_const_iterator ) const [inline],  [protected]

Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator 👑 (yes, the parameter is called nd_it in the signature and node_it in the prose. she contains multitudes.)

⭐ order_of_key ([inline])

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

Returns the order of a key within a sequence. For exapmle, 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 💀

⭐ order_of_prefix ([inline])

template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >::size_type
__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >::order_of_prefix (a_const_iterator b, a_const_iterator e) const [inline]

Returns the order of a prefix within a sequence. For exapmle, if [b, e] is the smallest prefix, 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 💀

---

🌟 Author 🌟

Generated automatically by Doxygen for libstdc++ from the source code. not a human, just a little robot doing her best 🧚

---

okay that's the whole page bestie, no cap, every single typedef, flag, iterator and r_c accounted for 💖 this libstdc++ page was brought to you by Doxygen (the automatic generation icon) — go forth and order your keys, you absolute queen 👑✨