GQCP
|
#include <StepCollection.hpp>
Public Types | |
using | Environment = _Environment |
![]() | |
using | Environment = _Environment |
Public Member Functions | |
std::string | description () const override |
void | execute (Environment &environment) override |
template<typename Z = Step<Environment>> | |
enable_if_t< std::is_same< Environment, typename Z::Environment >::value, StepCollection< Environment > & > | add (const Z &step) |
template<typename Z = Step<Environment>> | |
enable_if_t< std::is_same< Environment, typename Z::Environment >::value, void > | insert (const Z &step, const size_t index) |
size_t | numberOfSteps () const |
void | remove (const size_t index) |
template<typename Z = Step<Environment>> | |
enable_if_t< std::is_same< Environment, typename Z::Environment >::value, void > | replace (const Z &step, const size_t index) |
![]() | |
virtual | ~Step ()=default |
virtual std::string | description () const =0 |
virtual void | execute (Environment &environment)=0 |
A collection of steps to be executed in a consecutive order.
This iteration cycle maintains the ownership of its constituting steps.
_Environment | the type of the environment that this iteration step can read from and write to |
using GQCP::StepCollection< _Environment >::Environment = _Environment |
|
inline |
Add a new step to the collection of steps.
|
inlineoverridevirtual |
Implements GQCP::Step< _Environment >.
|
inlineoverridevirtual |
Execute all the steps in this collection.
environment | the environment that this step can read from and write to |
Implements GQCP::Step< _Environment >.
|
inline |
Insert an algorithm step at the given index.
step | the step that should be inserted into this algorithm step collection |
index | the zero-based index that the given step should be performed at in the total collection of steps |
|
inline |
|
inline |
Remove the step at the given index.
index | the zero-based index of the step in this collection that should be removed |
|
inline |
Replace an algorithm step at the given index.
step | the step that should be inserted into this algorithm |
index | the zero-based index of the step that should be replaced |