.TH "__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >" 3cxx "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
__gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc > \- Functor updating ranks of entrees\&.  

.SH SYNOPSIS
.br
.PP
.PP
\fC#include <trie_policy\&.hpp>\fP
.PP
Inherits \fB__gnu_pbds::detail::trie_policy_base< Node_CItr, Node_Itr, _ATraits, _Alloc >\fP\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef access_traits::const_iterator \fBa_const_iterator\fP"
.br
.ti -1c
.RI "typedef _ATraits \fBaccess_traits\fP"
.br
.ti -1c
.RI "typedef _Alloc \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef node_const_iterator::value_type \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef node_iterator::value_type \fBiterator\fP"
.br
.ti -1c
.RI "typedef base_type::key_const_reference \fBkey_const_reference\fP"
.br
.ti -1c
.RI "typedef base_type::key_type \fBkey_type\fP"
.br
.ti -1c
.RI "typedef size_type \fBmetadata_type\fP"
.br
.ti -1c
.RI "typedef Node_CItr \fBnode_const_iterator\fP"
.br
.ti -1c
.RI "typedef Node_Itr \fBnode_iterator\fP"
.br
.ti -1c
.RI "typedef allocator_type::size_type \fBsize_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "iterator \fBfind_by_order\fP (size_type)"
.br
.RI "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\&. "
.ti -1c
.RI "const_iterator \fBfind_by_order\fP (size_type) const"
.br
.RI "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\&. "
.ti -1c
.RI "size_type \fBorder_of_key\fP (key_const_reference) const"
.br
.RI "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\&. "
.ti -1c
.RI "size_type \fBorder_of_prefix\fP (a_const_iterator, a_const_iterator) const"
.br
.RI "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\&. "
.in -1c
.SS "Protected Member Functions"

.in +1c
.ti -1c
.RI "void \fBoperator()\fP (node_iterator, node_const_iterator) const"
.br
.RI "Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator\&. "
.in -1c
.SS "Private Member Functions"

.in +1c
.ti -1c
.RI "virtual const_iterator \fBend\fP () const =0"
.br
.ti -1c
.RI "virtual const access_traits & \fBget_access_traits\fP () const =0"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename Node_CItr, typename Node_Itr, typename _ATraits, typename _Alloc>
.br
class __gnu_pbds::trie_order_statistics_node_update< Node_CItr, Node_Itr, _ATraits, _Alloc >"Functor updating ranks of entrees\&. 
.SH "Member Function Documentation"
.PP 
.SS "template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc > iterator \fB__gnu_pbds::trie_order_statistics_node_update\fP< Node_CItr, Node_Itr, _ATraits, _Alloc >::find_by_order (size_type)\fC [inline]\fP"

.PP
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\&. 
.SS "template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc > const_iterator \fB__gnu_pbds::trie_order_statistics_node_update\fP< Node_CItr, Node_Itr, _ATraits, _Alloc >::find_by_order (size_type) const\fC [inline]\fP"

.PP
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\&. 
.SS "template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc > void \fB__gnu_pbds::trie_order_statistics_node_update\fP< Node_CItr, Node_Itr, _ATraits, _Alloc >::operator() (node_iterator, node_const_iterator) const\fC [inline]\fP, \fC [protected]\fP"

.PP
Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator\&. 
.SS "template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc > size_type \fB__gnu_pbds::trie_order_statistics_node_update\fP< Node_CItr, Node_Itr, _ATraits, _Alloc >::order_of_key (key_const_reference) const\fC [inline]\fP"

.PP
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\&. 
.SS "template<typename Node_CItr , typename Node_Itr , typename _ATraits , typename _Alloc > size_type \fB__gnu_pbds::trie_order_statistics_node_update\fP< Node_CItr, Node_Itr, _ATraits, _Alloc >::order_of_prefix (a_const_iterator, a_const_iterator) const\fC [inline]\fP"

.PP
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\&. 

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.