class TrieIterator Iterator on a trie. More... Definition #include <trie.hh> Template form TrieIterator<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

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

Detailed Description

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. This does not 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.

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]