class RefTriePreOrderIterator
 
LOGO
 Annotated List  Files  Globals  Hierarchy  Index  Top

Public Types

Public Methods

Detailed Description

typedef IPNet<A> Key

Key

typedef ::RefTrie<A, Payload> RefTrie

RefTrie

typedef RefTrieNode<A, Payload> Node

Node

 RefTriePreOrderIterator ()

RefTriePreOrderIterator

Constructors

explicit  RefTriePreOrderIterator (const RefTrie* trie, Node *n)

RefTriePreOrderIterator

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

 RefTriePreOrderIterator (const RefTrie* trie, Node *n, const Key &k)

RefTriePreOrderIterator

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

 RefTriePreOrderIterator (const RefTriePreOrderIterator& x)

RefTriePreOrderIterator

 ~RefTriePreOrderIterator ()

~RefTriePreOrderIterator

RefTriePreOrderIterator *  begin ()

begin

move to the starting position according to the visiting order

RefTriePreOrderIterator  operator ++ (int)

operator ++

Postfix increment

Updates position of iterator in tree.

Returns: position of iterator before increment.

RefTriePreOrderIterator&  operator ++ ()

operator ++

Prefix increment

Updates position of iterator in tree.

Returns: position of iterator after increment.

operator  RefTriePostOrderIterator ()

RefTriePostOrderIterator

[const]

Conversion operator

Converts into a PostOrderIterator

void  next ()

next

[const]

void  force_valid ()

force_valid

[const]

Node * cur ()

cur

[const]

bool  operator== (const RefTriePreOrderIterator & x)

operator==

[const]

bool  operator!= (const RefTriePreOrderIterator & x)

operator!=

[const]

Payload &  payload ()

payload

const Key &  key ()

key

[const]

RefTriePreOrderIterator&  operator= (const RefTriePreOrderIterator& x)

operator=

Generated by: bms on anglepoise.lon.incunabulum.net on Wed Jul 23 10:05:24 2008, using kdoc 2.0a54+XORP.