class RefTriePostOrderIterator Postorder Iterator on a trie. More...

Annotated List  Files  Globals  Hierarchy  Index  Top

Public Types

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

Public Methods

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

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.

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 PreOrderIterator

[const]

[const]

[const]

[const]

[const]

[const]