task_definition.inl

Go to the documentation of this file.

/*!
 * \file task_definition.inl
 * \brief In-Line subroutines of the <i>task_definition.hpp</i> file.
 * \author E. van der Weide, T. Economon
 * \version 8.5.0 "Harrier"
 *
 * SU2 Project Website: https://su2code.github.io
 *
 * The SU2 Project is maintained by the SU2 Foundation
 * (http://su2foundation.org)
 *
 * Copyright 2012-2026, SU2 Contributors (cf. AUTHORS.md)
 *
 * SU2 is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * SU2 is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with SU2. If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
inline CTaskDefinition::CTaskDefinition(void) {
  task                = NO_TASK;
  timeLevel           = 0;
  nIndMustBeCompleted = 0;
  for(int i=0; i<5; ++i) indMustBeCompleted[i] = -1;
 
  intPointADER = 0;
  secondPartTimeIntADER = false;
}
 
inline CTaskDefinition::CTaskDefinition(SOLVER_TASK    val_task,
                                        unsigned short val_timeLevel,
                                        int            val_ind0MustBeCompleted,
                                        int            val_ind1MustBeCompleted,
                                        int            val_ind2MustBeCompleted,
                                        int            val_ind3MustBeCompleted,
                                        int            val_ind4MustBeCompleted) {
 
  /* Copy the data from the arguments. */
  task                  = val_task;
  timeLevel             = val_timeLevel;
  indMustBeCompleted[0] = val_ind0MustBeCompleted;
  indMustBeCompleted[1] = val_ind1MustBeCompleted;
  indMustBeCompleted[2] = val_ind2MustBeCompleted;
  indMustBeCompleted[3] = val_ind3MustBeCompleted;
  indMustBeCompleted[4] = val_ind4MustBeCompleted;
 
  /* Make sure that the -1 values are numbered last. */
  sort(indMustBeCompleted, indMustBeCompleted+5, greater<int>());
 
  /* Determine the actual number of tasks that must be completed. */
  for(nIndMustBeCompleted=0; nIndMustBeCompleted<5; ++nIndMustBeCompleted) {
    if(indMustBeCompleted[nIndMustBeCompleted] < 0) break;
  }
 
  /* Initialize the other member variables to their default values. */
  intPointADER = 0;
  secondPartTimeIntADER = false;
}
 
inline CTaskDefinition::~CTaskDefinition(void) {}
 
inline CTaskDefinition::CTaskDefinition(const CTaskDefinition &other){Copy(other);}
 
inline CTaskDefinition& CTaskDefinition::operator=(const CTaskDefinition &other){Copy(other); return (*this);}
 
inline void CTaskDefinition::Copy(const CTaskDefinition &other) {
  task                  = other.task;
  timeLevel             = other.timeLevel;
  intPointADER          = other.intPointADER;
  secondPartTimeIntADER = other.secondPartTimeIntADER;
  nIndMustBeCompleted   = other.nIndMustBeCompleted;
 
  for(int i=0; i<5; ++i)
    indMustBeCompleted[i] = other.indMustBeCompleted[i];
}