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

Simple iterator on elements of a queue. More...

#include <tpl_arrayQueue.H>

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

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

Public Types
using	Base = typename MemArray< T >::Iterator
using	Set_Type = ArrayQueue
Public Types inherited from Aleph::MemArray< T >::Iterator
using	Base = Array_Iterator< T >
Public Types inherited from Aleph::Array_Iterator< T >
using	Item_Type = T
	The type of elements being iterated.

Public Member Functions
	Iterator (const ArrayQueue &q)
Public Member Functions inherited from Aleph::MemArray< T >::Iterator
	Iterator (const MemArray< T > &a) noexcept
	Construct an iterator on array a
Public Member Functions inherited from Aleph::Array_Iterator< T >
T *	get_base () noexcept
	Get the base pointer of the array.
constexpr const T *	get_base () const noexcept
	Get the base pointer of the array (const version).
	Array_Iterator ()=default
	Default constructor - creates an invalid iterator.
	Array_Iterator (T *p, const size_t sz, const size_t n)
	Construct an iterator over an array.
	Array_Iterator (NoExceptionCtor, T *p, const size_t sz, const size_t n)
	Construct an iterator without exception checking.
	Array_Iterator (T *p, const size_t sz, const size_t n, const long f, const long l)
	Construct an iterator over a circular array region.
	Array_Iterator (NoExceptionCtor, T *p, const size_t sz, const size_t n, const long f, const long l)
	Construct a circular iterator without exception checking.
	Array_Iterator (const Array_Container< T > &c)
	Construct an iterator from an Array_Container.
bool	has_curr () const noexcept
	Check if there is a current valid item.
bool	is_last () const noexcept
	Check if positioned at the last item.
constexpr long	get_pos () const noexcept
	Get the current position index.
T &	get_curr_ne () const noexcept
	Get the current item without bounds checking.
T &	get_curr () const
	Get the current item with bounds checking.
void	next_ne () noexcept
	Advance to the next item without bounds checking.
void	next ()
	Advance to the next item with bounds checking.
void	prev_ne () noexcept
	Move to the previous item without bounds checking.
void	prev ()
	Move to the previous item with bounds checking.
void	reset () noexcept
	Reset the iterator to the first item.
void	reset_first () noexcept
	Reset the iterator to the first item (alias for reset()).
void	reset_last () noexcept
	Reset the iterator to the last item.
void	end () noexcept
	Put the iterator at the end (past the last item).

Detailed Description

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

Simple iterator on elements of a queue.

The visit order is from the youngest to the oldest item

Definition at line 360 of file tpl_arrayQueue.H.

Member Typedef Documentation

Base

template<typename T >

using Aleph::ArrayQueue< T >::Iterator::Base = typename MemArray<T>::Iterator

Definition at line 362 of file tpl_arrayQueue.H.

Set_Type

template<typename T >

using Aleph::ArrayQueue< T >::Iterator::Set_Type = ArrayQueue

Definition at line 364 of file tpl_arrayQueue.H.

Constructor & Destructor Documentation

Iterator()

template<typename T >

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

inline

Definition at line 366 of file tpl_arrayQueue.H.

---

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

• tpl_arrayQueue.H