|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <tpl_snode_nc.H>
Public Member Functions | |
| Iterator () | |
| Iterator (Snode_Nc< T > *head_ptr) | |
| Instantiates iterator in list whose head node is head_ptr. | |
| Iterator (Snode_Nc< T > &head) | |
| Instantiates iterator in list whose head node is head. | |
| Iterator (Snode_Nc< T > *head_ptr, Snode_Nc< T > *curr_ptr) | |
| Snode_Nc * | get_curr () const |
| Returns pointer to the current node. | |
Public Member Functions inherited from Aleph::Slink_Nc::Iterator | |
| Iterator () | |
| Iterator (Slink_Nc *head_ptr) | |
| Iterator (Slink_Nc &_head) | |
| Iterator (Slink_Nc *head_ptr, Slink_Nc *curr_ptr) | |
| void | reset_first () |
| Resets iterator to the first node of the list. | |
| void | set (Slink_Nc *new_curr) |
| void | reset (Slink_Nc *new_head) |
| bool | has_curr () const |
| Slink_Nc * | get_curr_ne () const noexcept |
| Returns current node address. | |
| Slink_Nc * | get_curr () const |
| bool | is_in_first () const |
| Returns true if iterator is on the first element. | |
| void | next_ne () noexcept |
| Advances iterator by one position. | |
| void | next () |
| bool | operator== (const Iterator &it) const |
| Returns true if iterators are on the same element. | |
| bool | operator!= (const Iterator &it) const |
| Returns true if iterators have different states. | |
| bool | verify (Slink_Nc *l) const |
| bool | verify (const Iterator &it) const |
Definition at line 95 of file tpl_snode_nc.H.
|
inline |
Definition at line 98 of file tpl_snode_nc.H.
Instantiates iterator in list whose head node is head_ptr.
Definition at line 101 of file tpl_snode_nc.H.
Instantiates iterator in list whose head node is head.
Definition at line 108 of file tpl_snode_nc.H.
|
inline |
Definition at line 112 of file tpl_snode_nc.H.
|
inline |
Returns pointer to the current node.
Definition at line 118 of file tpl_snode_nc.H.
References Aleph::Slink_Nc::Iterator::get_curr().