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

#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
using	Item_Type = T

Public Member Functions
	Iterator (const ArrayQueue &q)
T *	get_base () noexcept
bool	has_curr () const noexcept
bool	is_last () const noexcept
long	get_pos () const noexcept
T &	get_curr_ne () const noexcept
T &	get_curr () const
void	next_ne () noexcept
void	next ()
void	prev_ne () noexcept
void	prev ()
void	reset () noexcept
void	reset_first () noexcept
void	reset_last () noexcept
void	end () noexcept

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

---

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

• tpl_arrayQueue.H