Aleph::Gen_Rb_Tree< NodeType, Key, Compare >::Iterator Struct Reference

#include <tpl_rb_tree.H>

Inheritance diagram for Aleph::Gen_Rb_Tree< NodeType, Key, Compare >::Iterator:

Collaboration diagram for Aleph::Gen_Rb_Tree< NodeType, Key, Compare >::Iterator:

Public Member Functions
	Iterator (Gen_Rb_Tree &t)
void	swap (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
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<template< typename > class NodeType, typename Key, class Compare>
struct Aleph::Gen_Rb_Tree< NodeType, Key, Compare >::Iterator

Iterador sobre los nodos.

Esta clase permite recorrer los nodos del árbol en forma ordenada según el criterio de comparación especificado en el momento de instanciación del árbol.

Member Function Documentation

next()

template<class Node >

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

inlineinherited

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

---

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

• tpl_rb_tree.H