In-order iterator. More...

Inheritance diagram for Aleph::HtdRbTreeRk< Key, Compare >::Iterator:

Collaboration diagram for Aleph::HtdRbTreeRk< Key, Compare >::Iterator:

Public Member Functions
	Iterator (HtdRbTreeRk &t) noexcept

	Iterator (const HtdRbTreeRk &t) noexcept

Public Member Functions inherited from Aleph::BinNodeInfixIterator< Node >
bool	is_in_first () const noexcept
	Return `true` if the iterator is on the first node.

bool	is_last () const noexcept

void	swap (BinNodeInfixIterator &it) noexcept

	BinNodeInfixIterator ()=default

	BinNodeInfixIterator (Node *r) noexcept
	Initialize an iterator on the first node inorder.

	BinNodeInfixIterator (const BinNodeInfixIterator &it)

	BinNodeInfixIterator (BinNodeInfixIterator &&it) noexcept

void	reset_first () noexcept
	Reset the iterator to the first node inorder.

void	reset_last () noexcept
	Reset the iterator to the first node inorder.

void	end () noexcept

BinNodeInfixIterator &	operator= (const BinNodeInfixIterator &it)

BinNodeInfixIterator &	operator= (BinNodeInfixIterator &&it) noexcept

bool	has_curr () const noexcept
	Return `true` the iterator has current node.

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 ()
	Move the iterator one position forward.

Detailed Description

template<class Key, class Compare = Aleph::less<Key>>
struct Aleph::HtdRbTreeRk< Key, Compare >::Iterator

In-order iterator.

Definition at line 967 of file tpl_hRbTreeRk.H.

Constructor & Destructor Documentation

template<class Key , class Compare = Aleph::less<Key>>

Aleph::HtdRbTreeRk< Key, Compare >::Iterator::Iterator ( HtdRbTreeRk & t )

inlinenoexcept

Definition at line 969 of file tpl_hRbTreeRk.H.

template<class Key , class Compare = Aleph::less<Key>>

Aleph::HtdRbTreeRk< Key, Compare >::Iterator::Iterator ( const HtdRbTreeRk & t )

inlinenoexcept

Definition at line 972 of file tpl_hRbTreeRk.H.

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