src/CouplingIterationInterface.cpp
Flag CouplingIterationInterface::oneIteration(AdaptInfo& adaptInfo, Flag toDo)
  {
    Flag flag = 0;

    for (size_t i = 0; i < problems.size(); ++i)
    {
      if (solveProblem[i])
      {
        problems[i]->beginIteration(adaptInfo);
        flag |= problems[i]->oneIteration(adaptInfo, toDo);
        problems[i]->endIteration(adaptInfo);
      }
    }

    return flag;
  }
/** \brief
    * Determines the execution order of the single adaption steps. If adapt is
    * true, mesh adaption will be performed. This allows to avoid mesh adaption,
    * e.g. in timestep adaption loops of timestep adaptive strategies.
    */
\brief
Determines the execution order of the single adaption steps. If adapt is
true, mesh adaption will be performed. This allows to avoid mesh adaption,
e.g. in timestep adaption loops of timestep adaptive strategies.
\ brief Determines the execution order of the single adaption steps . If adapt is true mesh adaption will be performed . This allows to avoid mesh adaption e . g . in timestep adaption loops of timestep adaptive strategies .
Flag CouplingIterationInterface::oneIteration(AdaptInfo& adaptInfo, Flag toDo)
  {
    Flag flag = 0;
    for (size_t i = 0; i < problems.size(); ++i)
    {
      if (solveProblem[i])
      {
        problems[i]->beginIteration(adaptInfo);
        flag |= problems[i]->oneIteration(adaptInfo, toDo);
        problems[i]->endIteration(adaptInfo);
      }
    }
    return flag;
  }
Flag CouplingIterationInterface :: oneIteration ( AdaptInfo & adaptInfo , Flag toDo ) { Flag flag = 0 ; for ( size_t i = 0 ; i < problems . size ( ) ; ++ i ) { if ( solveProblem [ i ] ) { problems [ i ] -> beginIteration ( adaptInfo ) ; flag |= problems [ i ] -> oneIteration ( adaptInfo , toDo ) ; problems [ i ] -> endIteration ( adaptInfo ) ; } } return flag ; }
\brief
 Determines the execution order of the single adaption steps.
\ brief Determines the execution order of the single adaption steps .