Aleph::HTList::Iterator Class Reference

#include <htlist.H>

Inheritance diagram for Aleph::HTList::Iterator:

Public Member Functions
	Iterator (const HTList &list) noexcept
void	reset () noexcept
long	get_pos () const noexcept
void	reset_first () noexcept
void	reset_last ()
	It has O(n) of performance.
void	end () noexcept
Iterator &	operator= (const Iterator &it) noexcept
	Assignation.
bool	has_curr () const noexcept
bool	is_last () const noexcept
bool	is_in_first () const noexcept
	Return true if the iterator is positioned on the first item.
bool	is_in_last () const noexcept
	Return true if the iterator is positioned on the last item.
Slinknc *	get_curr () const
Slinknc *	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.
void	next_ne () noexcept
void	next ()
Slinknc *	del_ne () noexcept
Slinknc *	del ()

Detailed Description

Iterator on HTList.

Constructor & Destructor Documentation

Iterator()

Aleph::HTList::Iterator::Iterator ( const HTList &  list )

inlinenoexcept

Initialize iterator on at the first item of list

Member Function Documentation

del()

Slinknc* Aleph::HTList::Iterator::del ( )

inline

Remove the current item.

del() removes the current item of iterator and advaces it a position forward.

Returns

a valid pointer to the removed item

Exceptions

overflow_error

if iterator has not current item

Here is the caller graph for this function:

end()

void Aleph::HTList::Iterator::end ( )

inlinenoexcept

Set the iterator to its end position, which has not current item.

get_curr()

Slinknc* Aleph::HTList::Iterator::get_curr ( ) const

inline

Return the current node on which the iterator is positioned

Exceptions

overflow_error

if iterator has not current node

Here is the caller graph for this function:

get_pos()

long Aleph::HTList::Iterator::get_pos ( ) const

inlinenoexcept

Return the current position

has_curr()

bool Aleph::HTList::Iterator::has_curr ( ) const

inlinenoexcept

Return true if iterator has current item

Here is the call graph for this function:

Here is the caller graph for this function:

next()

void Aleph::HTList::Iterator::next ( )

inline

Move the iterator one item forward. Throw overflow_error if iterator has not current item

next_ne()

void Aleph::HTList::Iterator::next_ne ( )

inlinenoexcept

Move the iterator one position forward guaranteeing no exception. Be careful.

Here is the caller graph for this function:

reset()

void Aleph::HTList::Iterator::reset ( )

inlinenoexcept

Reset the iterator at the first item

reset_first()

void Aleph::HTList::Iterator::reset_first ( )

inlinenoexcept

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Here is the call graph for this function:

---

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

• htlist.H