Aleph::BinNodePrefixIterator< Node > Class Template Reference

#include <tpl_binNodeUtils.H>

Public Member Functions
void	swap (BinNodePrefixIterator &it)
	Swap thiswith it
	BinNodePrefixIterator (Node *__root) noexcept
	BinNodePrefixIterator (const BinNodePrefixIterator &it)
	BinNodePrefixIterator (BinNodePrefixIterator &&it)
void	reset_first () noexcept
	Reset the iterator to the first node in preorder sense.
void	reset_last () noexcept
	Reset the iterator to the last node in preorder.
void	end () noexcept
	Put the iterator in end state.
BinNodePrefixIterator &	operator= (const BinNodePrefixIterator &it)
BinNodePrefixIterator &	operator= (BinNodePrefixIterator &&it)
bool	has_curr () const noexcept
	Return true if iterator has current node.
Node *	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.
Node *	get_curr () const
	Return a pointer to current node.
void	next_ne () noexcept
void	next ()
	Move the iterator one position forward.

Detailed Description

template<class Node>
class Aleph::BinNodePrefixIterator< Node >

Preorder iterator on the nodes of a binary tree.

This class export a full iterator for the nodes of a binary tree where the visit order corresponds to a preorder sense.

Constructor & Destructor Documentation

BinNodePrefixIterator()

template<class Node >

Aleph::BinNodePrefixIterator< Node >::BinNodePrefixIterator ( Node *  __root )

inlinenoexcept

Initialize an iterator on the first node in preorder for the tree with root __root

Member Function Documentation

next_ne()

template<class Node >

void Aleph::BinNodePrefixIterator< Node >::next_ne ( )

inlinenoexcept

Move the iterator one position forward guaranteeing no exception. Be careful.

Here is the call graph for this function:

---

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

• tpl_binNodeUtils.H