__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >(3cxx) | __gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >(3cxx) |
NAME¶
__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc > -SYNOPSIS¶
Inherits __gnu_pbds::detail::trie_policy_base< Node_CItr, Node_Itr, _ATraits, _Alloc >.Public Types¶
typedef
Public Member Functions¶
const_iterator find_by_order (size_type) const
Protected Member Functions¶
void operator() (node_iterator, node_const_iterator) const
Private Types¶
typedef Node_Itr::value_type it_type
Private Member Functions¶
virtual const_iterator end () const =0
Static Private Member Functions¶
static size_type common_prefix_len (node_iterator, e_const_iterator, e_const_iterator, const access_traits &)
Detailed Description¶
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.Member Function Documentation¶
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_typeorder) 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. Definition at line 79 of file trie_policy.hpp.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_typeorder) [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. Definition at line 45 of file trie_policy.hpp.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_iteratornd_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. Definition at line 152 of file trie_policy.hpp.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_referencer_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. Definition at line 85 of file trie_policy.hpp.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_iteratorb, a_const_iteratore) 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. Definition at line 96 of file trie_policy.hpp.Author¶
Generated automatically by Doxygen for libstdc++ from the source code.Wed Jan 31 2018 | libstdc++ |