Aleph::BinNodeInfixIterator< Node > Class Template Reference

#include <tpl_binNodeUtils.H>

Inheritance diagram for Aleph::BinNodeInfixIterator< Node >:

Public Member Functions
void	swap (BinNodeInfixIterator &it)
	BinNodeInfixIterator (Node *__root) noexcept
	Initialize an iterator on the first node inorder sense.
	BinNodeInfixIterator (const BinNodeInfixIterator &it)
	BinNodeInfixIterator (BinNodeInfixIterator &&it)
void	reset_first () noexcept
	Reset the iterator to the first node inorder sense.
void	reset_last () noexcept
	Reset the iterator to the first node inorder sense.
void	end () noexcept
BinNodeInfixIterator &	operator= (const BinNodeInfixIterator &it)
BinNodeInfixIterator &	operator= (BinNodeInfixIterator &&it)
bool	has_curr () const noexcept
	Return true the iterator has current node.
bool	is_last () const noexcept
Node *	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.
Node *	get_curr () const
	Return the current node. Throw overflow_error if there is no current.
size_t	get_pos () const
	Return the current position of iterator. Only valid if has_curr() == true.
void	next_ne () noexcept
void	next ()

Detailed Description

template<class Node>
class Aleph::BinNodeInfixIterator< Node >

Inorder 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 inorder sense.

Member Function Documentation

next()

template<class Node >

void Aleph::BinNodeInfixIterator< Node >::next ( )

inline

Move the iterator one position forward. Throw overflow_error if there is no current

---

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

• tpl_binNodeUtils.H