class TriePostOrderIterator

Postorder Iterator on a trie. More...

 
LOGO
 Annotated List  Files  Globals  Hierarchy  Index  Top

Public Types

Public Methods


Detailed Description

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 IPNet<A> Key

Key

typedef TrieNode<A, Payload> Node

Node

 TriePostOrderIterator ()

TriePostOrderIterator

Constructors

explicit  TriePostOrderIterator (Node *n)

TriePostOrderIterator

constructor for exact searches: both the current node and the search key are taken from n, so the iterator will only loop once.

 TriePostOrderIterator (Node *n, const Key &k)

TriePostOrderIterator

construct for subtree scanning: the root key is set explicitly, and the current node is set according to the search order.

TriePostOrderIterator *  begin ()

begin

move to the starting position according to the visiting order

TriePostOrderIterator  operator ++ (int)

operator ++

Postfix increment

Updates position of iterator in tree.

Returns: position of iterator before increment.

TriePostOrderIterator&  operator ++ ()

operator ++

Prefix increment

Updates position of iterator in tree.

Returns: position of iterator after increment.

Node * cur ()

cur

[const]

bool  operator== (const TriePostOrderIterator & x)

operator==

[const]

bool  has_payload ()

has_payload

[const]

Payload &  payload ()

payload

const Key &  key ()

key

[const]


Generated by: pavlin on possum.icir.org on Wed Apr 13 21:52:49 2005, using kdoc $.