Aleph::DynListQueue< T >::Iterator Struct Reference

Iterator on elements of a queue. More...

#include <tpl_dynListQueue.H>

Inheritance diagram for Aleph::DynListQueue< T >::Iterator:

Collaboration diagram for Aleph::DynListQueue< T >::Iterator:

Public Types
using	Base = typename DynList< T >::Iterator
Public Types inherited from Aleph::DynList< T >::Iterator
using	Item_Type = T
using	Iterator_Type = Iterator
	The type of elements of list.
using	Set_Type = DynList

Public Member Functions
	Iterator (const DynListQueue< T > &q) noexcept
Public Member Functions inherited from Aleph::DynList< T >::Iterator
	Iterator () noexcept=default
	The type of container.
	Iterator (const DynList &list) noexcept
	Initiliaze an iterator on the first item of list
T &	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.
T &	get_curr () const
	Return the current item.
T	del ()
	Remove the current item of the iterator.
Public Member Functions inherited from Aleph::HTList::Iterator
	Iterator () noexcept=default
	Iterator (const HTList &list) noexcept
	Initialize iterator on at the first item of list
void	reset () noexcept
	Reset the iterator at the first item.
long	get_pos () const noexcept
	Return the current position.
void	reset_first () noexcept
void	reset_last ()
	It has O(n) of performance.
void	end () noexcept
	Set the iterator to its end position, which has not current item.
Iterator &	operator= (const Iterator &it) noexcept
	Assignation.
bool	has_curr () const noexcept
	Return true if iterator has current item.
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
	Return the current node on which the iterator is positioned.
Slinknc *	get_curr_ne () const noexcept
	Return the current link guaranteeing no exception. Be careful.
void	next_ne () noexcept
	Move the iterator one position forward guaranteeing no exception.
void	next ()
	Move the iterator one item forward.
Slinknc *	del_ne () noexcept
Slinknc *	del ()
	Remove the current item.

Detailed Description

template<typename T>
struct Aleph::DynListQueue< T >::Iterator

Iterator on elements of a queue.

The visit order is from the oldest (front) to the youngest (rear) item.

Definition at line 316 of file tpl_dynListQueue.H.

Member Typedef Documentation

Base

template<typename T >

using Aleph::DynListQueue< T >::Iterator::Base = typename DynList<T>::Iterator

Definition at line 318 of file tpl_dynListQueue.H.

Constructor & Destructor Documentation

Iterator()

template<typename T >

Aleph::DynListQueue< T >::Iterator::Iterator ( const DynListQueue< T > &  q )

inlinenoexcept

Definition at line 321 of file tpl_dynListQueue.H.

---

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

• tpl_dynListQueue.H