Inheritance diagram for Aleph::DynArrayHeap< T, Compare >::Iterator:

Collaboration diagram for Aleph::DynArrayHeap< T, Compare >::Iterator:

Public Types
using	Base = typename DynArray< T >::Iterator

Public Types inherited from Aleph::DynArray< T >::Iterator
using	Set_Type = DynArray

using	aleph_random_access_iterator = Iterator
	Opt-in marker for StlIterator random-access promotion.

Public Member Functions
	Iterator (const DynArrayHeap &h) noexcept

	Iterator ()=default

bool	has_curr () const noexcept

long	get_pos () const noexcept

Public Member Functions inherited from Aleph::DynArray< T >::Iterator
	Iterator () noexcept=default
	Default constructor creates an "end" iterator.

	Iterator (const DynArray &array) noexcept
	Initializes an iterator on `array`

bool	has_curr () const noexcept
	Check whether the iterator refers to an item.

bool	is_last () const noexcept
	Check whether the current item is the last item.

T &	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.

T &	get_curr () const
	Return the current item.

long	get_pos () const noexcept
	Return the ordinal position of current item.

void	next_ne () noexcept
	Move the iterator one position forward guaranteeing no exception.

void	next ()
	Advance one position, from the last item to the end if needed.

void	prev_ne () noexcept
	exception. Be careful.

void	prev ()
	Move the current a position backward.

void	reset_last () noexcept
	Reset the iterator to the last item.

void	end () noexcept
	Put the iterator in the end state.

void	reset_first () noexcept
	Reset the iterator to the first item.

void	set_pos (const long pos) noexcept

Additional Inherited Members
Protected Attributes inherited from Aleph::DynArray< T >::Iterator
DynArray *	array_ptr = nullptr

long	curr_idx = 0

Detailed Description

template<typename T, class Compare = Aleph::less<T>>
struct Aleph::DynArrayHeap< T, Compare >::Iterator

Definition at line 312 of file tpl_dynArrayHeap.H.