libstdc++
|
Public Member Functions | |
const_iterator | find_by_order (size_type) const |
iterator | find_by_order (size_type) |
size_type | order_of_key (key_const_reference) const |
Protected Member Functions | |
void | operator() (node_iterator, node_const_iterator) const |
Private Types | |
typedef Node_Itr::value_type | it_type |
typedef remove_const< key_type >::type | rckey_type |
typedef remove_const< value_type >::type | rcvalue_type |
typedef rebind_traits< _Alloc, rckey_type > | rebind_k |
typedef rebind_traits< _Alloc, rcvalue_type > | rebind_v |
typedef rebind_v::reference | reference |
typedef std::iterator_traits< it_type >::value_type | value_type |
Private Member Functions | |
virtual it_type | end ()=0 |
it_type | end_iterator () const |
Static Private Member Functions | |
static key_const_reference | extract_key (const_reference r_val) |
Functor updating ranks of entrees.
Definition at line 64 of file tree_policy.hpp.
|
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 74 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.
Definition at line 47 of file tree_policy.hpp.
|
inlineprotected |
Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
Definition at line 110 of file tree_policy.hpp.
|
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 80 of file tree_policy.hpp.