Iterator class for RtLayout.
More...
#include <CD_RtIterator.H>
|
|
| RtIterator ()=delete |
| | Empty constructor.
|
| |
| | RtIterator (RtLayout< T > &a_layout) |
| | Full constructor.
|
| |
|
virtual | ~RtIterator () |
| | Destructor (does nothing)
|
| |
| virtual int | getNumberOfSolvers () |
| | Get number of solvers.
|
| |
| virtual int | index () const |
| | Get current solver number/index.
|
| |
|
virtual void | reset () |
| | Reset iterator to first solver.
|
| |
| virtual bool | ok () |
| | Check if we can cycle further through the solvers.
|
| |
|
virtual void | operator++ () |
| | Incrementation operator. Cycles to next solver.
|
| |
| virtual RefCountedPtr< T > & | operator() () |
| | Get the solver pointed to by the iterator.
|
| |
| virtual RefCountedPtr< RtSpecies > & | getSpecies () |
| | Get current species pointed to by the iterator.
|
| |
|
|
int | m_isolver |
| | Solver currently pointed to.
|
| |
|
int | m_num |
| | Number of solvers.
|
| |
|
Vector< RefCountedPtr< T > > | m_solvers |
| | Ion solvers.
|
| |
|
Vector< RefCountedPtr< RtSpecies > > | m_species |
| | Ions.
|
| |
template<class T>
class RtIterator< T >
Iterator class for RtLayout.
◆ RtIterator()
Full constructor.
Iterator class for RtLayout.
- Parameters
-
| [in,out] | a_layout | Description |
◆ getNumberOfSolvers()
Get number of solvers.
- Returns
- Number of solvers
◆ getSpecies()
Get current species pointed to by the iterator.
- Returns
- Species
◆ index()
Get current solver number/index.
- Returns
- Return value
◆ ok()
Check if we can cycle further through the solvers.
- Returns
- Return value
◆ operator()()
template<class T >
| RefCountedPtr< T > & RtIterator< T >::operator() |
( |
| ) |
|
|
virtual |
Get the solver pointed to by the iterator.
- Returns
- Return value
The documentation for this class was generated from the following files: