A primitive const node iterator (bidirectional). More...
Public Member Functions | |
const_iterator (const const_iterator &)=default | |
Copy construct. More... | |
const_iterator (const DLListBase *list, const link *item) | |
Construct for a node on a list. More... | |
const_iterator (const DLListBase::iterator &iter) | |
Copy construct from a non-const iterator. More... | |
const link * | get_node () const noexcept |
The storage node. More... | |
bool | good () const noexcept |
Pointing at a valid storage node. More... | |
void | prev () |
Move backward through list. More... | |
void | next () |
Move forward through list. More... | |
const_iterator & | operator= (const const_iterator &)=default |
Copy assignment. More... | |
bool | operator== (const const_iterator &) const |
bool | operator!= (const const_iterator &) const |
A primitive const node iterator (bidirectional).
Must normally be extended by inheriting classes. Since this iterator works bidirectionally, it can be used as the basis for a derived const_reverse_iterator
Definition at line 262 of file DLListBase.H.
|
default |
Copy construct.
|
inline |
Construct for a node on a list.
Definition at line 339 of file DLListBaseI.H.
|
inline |
Copy construct from a non-const iterator.
Definition at line 350 of file DLListBaseI.H.
|
inlinenoexcept |
The storage node.
Definition at line 361 of file DLListBaseI.H.
|
inlinenoexcept |
Pointing at a valid storage node.
Definition at line 367 of file DLListBaseI.H.
|
inline |
Move backward through list.
Definition at line 373 of file DLListBaseI.H.
|
inline |
Move forward through list.
Definition at line 389 of file DLListBaseI.H.
|
default |
Copy assignment.
|
inline |
Definition at line 405 of file DLListBaseI.H.
|
inline |
Definition at line 414 of file DLListBaseI.H.