#include <tpl_arrayStack.H>
Inheritance diagram for Aleph::ArrayStack< T >::Iterator:
Collaboration diagram for Aleph::ArrayStack< T >::Iterator:Public Types | |
| using | Base = typename MemArray< T >::Iterator |
| using | Set_Type = ArrayStack |
| using | Item_Type = T |
Public Member Functions | |
| Iterator (const ArrayStack< T > &s) | |
Initialize an iterator on stack s | |
| 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 |
Iterator on the items of a stack.
The visit order goes from the oldest to the youngest item