|
static size_type | common_prefix_len (node_iterator, e_const_iterator, e_const_iterator, const access_traits &) |
|
static key_const_reference | extract_key (const_reference r_val) |
|
static iterator | leftmost_it (node_iterator) |
|
static bool | less (e_const_iterator, e_const_iterator, e_const_iterator, e_const_iterator, const access_traits &) |
|
static iterator | rightmost_it (node_iterator) |
|
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.
Definition at line 253 of file trie_policy.hpp.
template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc >
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.
Definition at line 85 of file trie_policy.hpp.
template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc >
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.
Definition at line 96 of file trie_policy.hpp.