---

deml::tree::iterator Class Template Reference

#include <detree.h>

List of all members.

Public Methods
	iterator (void)
	iterator (const iterator &i)
iterator &	operator++ (void)
iterator &	operator-- (void)
T	operator * (void)
T *	operator-> (void)
bool	operator== (const iterator &)
bool	operator!= (const iterator &)
iterator	step_in (void)
iterator	step_out (void)
iterator	begin (void)
iterator	end (void)
bool	valid (void)
Public Attributes
friend	tree

---

Detailed Description

template<class T>
class deml::tree< T >::iterator

The tree::iterator class operates much like a vector iterator with on exception, it can move up and down in the structure.

Definition at line 59 of file detree.h.

---

Constructor & Destructor Documentation

template<class T> deml::tree< T >::iterator::iterator (  void )

Default constructor, nothing fancy Definition at line 186 of file detree.h. Referenced by begin(), end(), step_in(), and step_out().

template<class T> deml::tree< T >::iterator::iterator (  const iterator & i )

Copies this iterator in every fashion Definition at line 196 of file detree.h.

---

Member Function Documentation

template<class T> tree< T >::iterator deml::tree< T >::iterator::begin (  void )

Returns: an iterator starting at the beginning of the current sibling list Definition at line 271 of file detree.h.

template<class T> tree< T >::iterator deml::tree< T >::iterator::end (  void )

Returns: an iterator starting at the beginning of the current sibling list Definition at line 281 of file detree.h.

template<class T> T deml::tree< T >::iterator::operator * (  void )

Returns: the current node Definition at line 221 of file detree.h.

template<class T> bool deml::tree< T >::iterator::operator!= (  const iterator & i )

Returns: true if both iterators are looking at different nodes Definition at line 239 of file detree.h.

template<class T> tree< T >::iterator & deml::tree< T >::iterator::operator++ (  void )

moves the iterator forward one in the sibling list Definition at line 201 of file detree.h.

template<class T> tree< T >::iterator & deml::tree< T >::iterator::operator-- (  void )

moves the iterator backward one in the sibling list Definition at line 211 of file detree.h.

template<class T> T * deml::tree< T >::iterator::operator-> (  void )

Returns: a pointer to the current node Definition at line 226 of file detree.h.

template<class T> bool deml::tree< T >::iterator::operator== (  const iterator & i )

Returns: true if both iterators are looking at the same node Definition at line 231 of file detree.h.

template<class T> tree< T >::iterator deml::tree< T >::iterator::step_in (  void )

moves this iterator down one in the structure so as to it begins iterating at the first of the current node's children Definition at line 247 of file detree.h.

template<class T> tree< T >::iterator deml::tree< T >::iterator::step_out (  void )

moves this iterator up one in the structure so as to iterate the siblings of the current node's parent. Definition at line 259 of file detree.h.

template<class T> bool deml::tree< T >::iterator::valid (  void )

Returns: true if the iterator is pointing to a valid node Definition at line 291 of file detree.h.

---

Member Data Documentation

template<class T> friend deml::tree::iterator::tree

Definition at line 92 of file detree.h.

---

The documentation for this class was generated from the following file:

• detree.h

---