class RefTriePreOrderIterator Definition #include <ref_trie.hh> Template form RefTriePreOrderIterator<class A, class Payload> List of all Methods

Annotated List Files Globals Hierarchy Index

Public Types

• typedef IPNet<A> Key
• typedef RefTrie<A, Payload> RefTrie
• typedef RefTrieNode<A, Payload> Node

Public Methods

•  RefTriePreOrderIterator ()
• explicit  RefTriePreOrderIterator (const RefTrie* trie, Node *n)
•  RefTriePreOrderIterator (const RefTrie* trie, Node *n, const Key &k)
•  RefTriePreOrderIterator (const RefTriePreOrderIterator& x)
•  ~RefTriePreOrderIterator ()
• RefTriePreOrderIterator *  begin ()
• RefTriePreOrderIterator  operator ++ (int)
• RefTriePreOrderIterator&  operator ++ ()
• operator  RefTriePostOrderIterator<A, Payload> () const
• void  next () const
• inline void  force_valid () const
• Node * cur () const
• bool  operator== (const RefTriePreOrderIterator & x) const
• bool  operator!= (const RefTriePreOrderIterator & x) const
• Payload &  payload ()
• const Key &  key () const
• RefTriePreOrderIterator&  operator= (const RefTriePreOrderIterator& x)

Detailed Description

Constructors

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

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

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.

[const]

Conversion operator

Converts into a PostOrderIterator

[const]

[const]

[const]

[const]

[const]

[const]