|
libstdc++
|
#include <tree_policy.hpp>
Public Types | |
| typedef _Alloc | allocator_type |
| typedef Cmp_Fn | cmp_fn |
| typedef node_const_iterator::value_type | const_iterator |
| typedef node_iterator::value_type | iterator |
| typedef base_type::key_const_reference | key_const_reference |
| typedef base_type::key_type | key_type |
| typedef size_type | metadata_type |
| typedef Node_CItr | node_const_iterator |
| typedef Node_Itr | node_iterator |
| typedef allocator_type::size_type | size_type |
Public Member Functions | |
| iterator | find_by_order (size_type) |
| const_iterator | find_by_order (size_type) const |
| size_type | order_of_key (key_const_reference) const |
Protected Member Functions | |
| void | operator() (node_iterator, node_const_iterator) const |
Functor updating ranks of entrees.
Definition at line 64 of file tree_policy.hpp.
| typedef _Alloc __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::allocator_type |
Definition at line 71 of file tree_policy.hpp.
| typedef Cmp_Fn __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::cmp_fn |
Definition at line 70 of file tree_policy.hpp.
| typedef node_const_iterator::value_type __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::const_iterator |
Definition at line 79 of file tree_policy.hpp.
| typedef node_iterator::value_type __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::iterator |
Definition at line 80 of file tree_policy.hpp.
| typedef base_type::key_const_reference __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::key_const_reference |
Definition at line 74 of file tree_policy.hpp.
| typedef base_type::key_type __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::key_type |
Definition at line 73 of file tree_policy.hpp.
| typedef size_type __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::metadata_type |
Definition at line 76 of file tree_policy.hpp.
| typedef Node_CItr __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::node_const_iterator |
Definition at line 77 of file tree_policy.hpp.
| typedef Node_Itr __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::node_iterator |
Definition at line 78 of file tree_policy.hpp.
| typedef allocator_type::size_type __gnu_pbds::tree_order_statistics_node_update< Node_CItr, Node_Itr, Cmp_Fn, _Alloc >::size_type |
Definition at line 72 of file tree_policy.hpp.
|
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.
|
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.
|
inlineprotected |
Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
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.