.TH "__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >" 3cxx "Mon May 22 2017" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
__gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc > \- Functor updating ranks of entrees\&.  

.SH SYNOPSIS
.br
.PP
.PP
Inherits \fB__gnu_pbds::detail::branch_policy< Node_CItr, Node_Itr, _Alloc >\fP\&.
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Alloc \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef Cmp_Fn \fBcmp_fn\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 "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 "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 "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\&. "
.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 Types"

.in +1c
.ti -1c
.RI "typedef Node_Itr::value_type \fBit_type\fP"
.br
.ti -1c
.RI "typedef remove_const< key_type >::type \fBrckey_type\fP"
.br
.ti -1c
.RI "typedef remove_const< value_type >::type \fBrcvalue_type\fP"
.br
.ti -1c
.RI "typedef _Alloc::template rebind< rckey_type >::other \fBrebind_k\fP"
.br
.ti -1c
.RI "typedef _Alloc::template rebind< rcvalue_type >::other \fBrebind_v\fP"
.br
.ti -1c
.RI "typedef rebind_v::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef std::iterator_traits< it_type >::value_type \fBvalue_type\fP"
.br
.in -1c
.SS "Private Member Functions"

.in +1c
.ti -1c
.RI "virtual it_type \fBend\fP ()=0"
.br
.ti -1c
.RI "it_type \fBend_iterator\fP () const"
.br
.in -1c
.SS "Static Private Member Functions"

.in +1c
.ti -1c
.RI "static key_const_reference \fBextract_key\fP (const_reference r_val)"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename Node_CItr, typename Node_Itr, typename Cmp_Fn, typename _Alloc>
.br
class __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >"
Functor updating ranks of entrees\&. 
.PP
Definition at line 64 of file tree_policy\&.hpp\&.
.SH "Member Function Documentation"
.PP 
.SS "template<typename Node_CItr , typename Node_Itr , typename Cmp_Fn , typename _Alloc > \fBtree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::const_iterator \fB__gnu_pbds::tree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::find_by_order (size_type order) 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\&. 
.PP
Definition at line 72 of file tree_policy\&.hpp\&.
.SS "template<typename Node_CItr , typename Node_Itr , typename Cmp_Fn , typename _Alloc > \fBtree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::iterator \fB__gnu_pbds::tree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::find_by_order (size_type order)\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\&. 
.PP
Definition at line 45 of file tree_policy\&.hpp\&.
.SS "template<typename Node_CItr , typename Node_Itr , typename Cmp_Fn , typename _Alloc > void \fB__gnu_pbds::tree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::operator() (node_iterator node_it, node_const_iterator end_nd_it) 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\&. 
.PP
Definition at line 108 of file tree_policy\&.hpp\&.
.SS "template<typename Node_CItr , typename Node_Itr , typename Cmp_Fn , typename _Alloc > \fBtree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::size_type \fB__gnu_pbds::tree_order_statistics_node_update\fP< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::order_of_key (key_const_reference r_key) 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\&. 
.PP
Definition at line 78 of file tree_policy\&.hpp\&.

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