Loading...
Searching...
No Matches
SLListBase::iterator Class Reference

A primitive non-const node iterator. More...

#include <SLListBase.H>

Public Member Functions

 iterator (const iterator &)=default
 Copy construct.
 iterator (SLListBase *list, link *item)
 Construct for a node on the list.
linkget_node () const noexcept
 The storage node.
bool good () const noexcept
 Pointing at a valid storage node.
void prev ()=delete
 Cannot move backward through list.
void next ()
 Move forward through list.
void operator= (const iterator &iter)
 Copy assignment.
bool operator== (const iterator &iter) const
bool operator!= (const iterator &iter) const

Friends

class SLListBase
class const_iterator

Detailed Description

A primitive non-const node iterator.

Must normally be extended by inheriting classes.

Definition at line 248 of file SLListBase.H.

Constructor & Destructor Documentation

◆ iterator() [1/2]

iterator ( const iterator & )
default

Copy construct.

References good(), iterator(), Foam::noexcept, and SLListBase.

Referenced by iterator(), operator!=(), operator=(), operator==(), and prev().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ iterator() [2/2]

iterator ( SLListBase * list,
SLListBase::link * item )
inline

Construct for a node on the list.

Definition at line 162 of file SLListBaseI.H.

References SLListBase.

Here is the call graph for this function:

Member Function Documentation

◆ get_node()

Foam::SLListBase::link * get_node ( ) const
inlinenoexcept

The storage node.

Definition at line 180 of file SLListBaseI.H.

References Foam::noexcept.

Referenced by SLListBase::remove().

Here is the caller graph for this function:

◆ good()

bool good ( ) const
inlinenoexcept

Pointing at a valid storage node.

Definition at line 186 of file SLListBaseI.H.

References Foam::noexcept.

Referenced by iterator().

Here is the caller graph for this function:

◆ prev()

void prev ( )
inlinedelete

Cannot move backward through list.

References iterator(), next(), and prev().

Referenced by prev().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ next()

void next ( )
inline

Move forward through list.

Definition at line 192 of file SLListBaseI.H.

Referenced by prev(), and SLListBase::remove().

Here is the caller graph for this function:

◆ operator=()

void operator= ( const iterator & iter)
inline

Copy assignment.

Definition at line 209 of file SLListBaseI.H.

References iterator().

Here is the call graph for this function:

◆ operator==()

bool operator== ( const iterator & iter) const
inline

Definition at line 217 of file SLListBaseI.H.

References iterator().

Here is the call graph for this function:

◆ operator!=()

bool operator!= ( const iterator & iter) const
inline

Definition at line 223 of file SLListBaseI.H.

References iterator().

Here is the call graph for this function:

◆ SLListBase

friend class SLListBase
friend

Definition at line 250 of file SLListBase.H.

References SLListBase.

Referenced by const_iterator, iterator(), iterator(), and SLListBase.

◆ const_iterator

friend class const_iterator
friend

Definition at line 251 of file SLListBase.H.

References const_iterator, and SLListBase.

Referenced by const_iterator.


The documentation for this class was generated from the following files:
  • src/OpenFOAM/containers/LinkedLists/linkTypes/SLListBase/SLListBase.H
  • src/OpenFOAM/containers/LinkedLists/linkTypes/SLListBase/SLListBaseI.H