Package de.uka.ipd.sdq.tcfmoop.config
Class NoNewParetoOptimalCandidatesFoundConfig
- java.lang.Object
-
- de.uka.ipd.sdq.tcfmoop.config.AbstractConfiguration
-
- de.uka.ipd.sdq.tcfmoop.config.NoNewParetoOptimalCandidatesFoundConfig
-
- All Implemented Interfaces:
IConfiguration
public class NoNewParetoOptimalCandidatesFoundConfig extends AbstractConfiguration
Configuration class for NoNewParetoOptimalCandidatesFound termination criterion.
-
-
Constructor Summary
Constructors Constructor Description NoNewParetoOptimalCandidatesFoundConfig()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
getIterationsWithoutNewCandidates()
Get the required number of iterations without new pareto optimal candidates in the pareto optimal set.void
setIterationsWithoutNewCandidates(int numberOfIterations)
Set the required number of iterations without new pareto optimal candidates in the pareto optimal set.boolean
validateConfiguration()
Checks the configuration object for correctness.-
Methods inherited from class de.uka.ipd.sdq.tcfmoop.config.AbstractConfiguration
getTerminationCriterionName
-
-
-
-
Method Detail
-
validateConfiguration
public boolean validateConfiguration()
Checks the configuration object for correctness. Should be called before accessing any of the data of the configuration object- Returns:
- true - The configuration is correct false - The configuration is incomplete or wrong
-
setIterationsWithoutNewCandidates
public void setIterationsWithoutNewCandidates(int numberOfIterations) throws InvalidConfigException
Set the required number of iterations without new pareto optimal candidates in the pareto optimal set.- Parameters:
numberOfIterations
- required number of iterations without new pareto optimal candidates in the pareto optimal set. Must be a >=1.- Throws:
InvalidConfigException
- if the supplied parameter do not conform to the required conditions.
-
getIterationsWithoutNewCandidates
public int getIterationsWithoutNewCandidates()
Get the required number of iterations without new pareto optimal candidates in the pareto optimal set.- Returns:
- the required number of iterations without new pareto optimal candidates in the pareto optimal set. Guaranteed to be >=1
-
-