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 |
size_type | order_of_prefix (a_const_iterator, a_const_iterator) 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 const_iterator | end () const =0 |
it_type | end_iterator () const |
virtual const access_traits & | get_access_traits () const =0 |
Functor updating ranks of entrees.
Definition at line 253 of file trie_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 81 of file trie_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 trie_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 154 of file trie_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 87 of file trie_policy.hpp.
|
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 98 of file trie_policy.hpp.