#include <tpl_dynSetTree.H>

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

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

Public Member Functions
	Iterator ()

	Iterator (DynSetTree< Key, Rand_Tree, Compare > &tree)

Public Member Functions inherited from Aleph::DynSetTree< Key, Tree, Compare >::Iterator
	Iterator () noexcept=default
	Default constructor creates an "end" iterator.

	Iterator (const DynSetTree &tree)

const Key &	get_curr_ne () const noexcept

Key &	get_curr_ne () noexcept

const Key &	get_curr () const

Key &	get_curr ()

Public Member Functions inherited from Aleph::Gen_Rand_Tree< NodeType, Key, Compare >::Iterator
	Iterator (Gen_Rand_Tree &t)

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.

Additional Inherited Members
Public Types inherited from Aleph::DynSetTree< Key, Tree, Compare >::Iterator
using	Base = typename Tree_Type::Iterator

using	Set_Type = DynSetTree

Detailed Description

template<typename Key, class Compare = Aleph::less<Key>>
class Aleph::DynSetRandTree< Key, Compare >::Iterator

Definition at line 1607 of file tpl_dynSetTree.H.

Constructor & Destructor Documentation

◆ Iterator() [1/2]

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

Aleph::DynSetRandTree< Key, Compare >::Iterator::Iterator ( )

inline

Definition at line 1610 of file tpl_dynSetTree.H.

◆ Iterator() [2/2]

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

Aleph::DynSetRandTree< Key, Compare >::Iterator::Iterator ( DynSetTree< Key, Rand_Tree, Compare > & tree )

inline

Definition at line 1614 of file tpl_dynSetTree.H.

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

tpl_dynSetTree.H

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ Iterator() [1/2]

◆ Iterator() [2/2]