class TriePreOrderIterator Preorder Iterator on a trie. More... Definition #include <trie.hh> Template form TriePreOrderIterator<class A, class Payload> List of all Methods

Annotated List Files Globals Hierarchy Index

Public Types

• typedef IPNet<A> Key
• typedef TrieNode<A, Payload> Node

Public Methods

•  TriePreOrderIterator ()
• explicit  TriePreOrderIterator (Node *n)
•  TriePreOrderIterator (Node *n, const Key &k)
• TriePreOrderIterator *  begin ()
• TriePreOrderIterator  operator ++ (int)
• TriePreOrderIterator&  operator ++ ()
• Node * cur () const
• bool  operator== (const TriePreOrderIterator & x) const
• bool  has_payload () const
• Payload &  payload ()
• const Key &  key () const

Detailed Description

Preorder 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 does preorder traversal, that is, current node first, then left then right. This guarantees that keys returned are 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]

[const]

[const]

[const]