iterator.hxx

Go to the documentation of this file.

#ifndef TREE_ITERATOR_HXX
# define TREE_ITERATOR_HXX

# include <tree/iterator.hh>
# include <misc/contract.hh>

namespace tree
{

  inline
  Iterator::Iterator(const rTree& entry)
    : entry_(entry)
  {}

  inline void
  Iterator::first()
  {
    list_.clear();
    list_.push_front(entry_);
  }

  inline bool
  Iterator::is_ok() const
  {
    return !list_.empty();
  }

  inline rTree
  Iterator::tree_get() const
  {
    precondition(is_ok());
    return list_.front();
  }

  inline void
  Iterator::next()
  {
    precondition(is_ok());

    rTree cur_tree = list_.front();
    const tree_list_type& children = cur_tree->children_get();
    list_.pop_front();

    // Push all the children of this tree onto the stack, leaving
    // the leftmost child on the top.
    for (tree_list_type::const_reverse_iterator ichild = children.rbegin();
         ichild != children.rend();
         ++ichild)
      list_.push_front(*ichild);
  }

}


#endif // !TREE_ITERATOR_HXX