class RefTriePostOrderIterator
|
|
Postorder Iterator on a trie. More... |
|
|
Public Types
- typedef IPNet<A> Key
- typedef RefTrie<A, Payload> RefTrie
- typedef RefTrieNode<A, Payload> Node
Public Methods
Postorder Iterator on a trie.
_cur points to the current object, _root contains the search key for
root of the subtree we want to scan. The iterator skips over empty
nodes, and visits the subtree in depth-first, left-to-right order.
The keys returned by this iterator are not sorted by prefix length.
| typedef RefTrie<A, Payload> RefTrie | RefTrie |
RefTriePostOrderIterator ()
| RefTriePostOrderIterator |
Constructors
RefTriePostOrderIterator (const RefTrie* trie, Node *n)
| RefTriePostOrderIterator |
constructor for exact searches: both the current node and the search
key are taken from n, so the iterator will only loop once.
RefTriePostOrderIterator (const RefTrie* trie, Node *n, const Key &k)
| RefTriePostOrderIterator |
construct for subtree scanning: the root key is set explicitly,
and the current node is set according to the search order.
~RefTriePostOrderIterator ()
| ~RefTriePostOrderIterator |
move to the starting position according to the visiting order
Postfix increment
Updates position of iterator in tree.
Returns: position of iterator before increment.
Prefix increment
Updates position of iterator in tree.
Returns: position of iterator after increment.
operator RefTriePreOrderIterator ()
| RefTriePreOrderIterator |
[const]
Conversion operator
Converts into a PreOrderIterator
[const]
inline void force_valid ()
| force_valid |
[const]
[const]
[const]
[const]
Payload & payload ()
| payload |
[const]
Generated by: pavlin on possum.icir.org on Thu Mar 9 04:41:55 2006, using kdoc $.
