| Modifier and Type | Interface and Description |
|---|---|
interface |
VarBool
This interface represents constrained boolean variables that can be seen
as integer constrained variables with the domain { 0, 1 } but with
a potentially more efficient implementation.
|
| Modifier and Type | Method and Description |
|---|---|
Var |
Var.abs()
Returns a new Var that is constrained to be the absolute value
of this variable.
|
Var |
ProblemDelegator.add(java.lang.String name,
Var var) |
Var |
Problem.add(java.lang.String name,
Var var)
Gives the Var variable "var" a new name "name", adds it to the problem,
and returns the newly added Var.
|
Var |
ProblemDelegator.add(Var var) |
Var |
Problem.add(Var var)
Adds a Var variable "var" to the problem, and returns the newly added Var.
|
Var[] |
VarMatrix.column(int j) |
Var |
ProblemDelegator.createVariable(java.lang.String name,
int min,
int max) |
Var |
Problem.createVariable(java.lang.String name,
int min,
int max)
Creates a Var with the name "name" and domain [min;max] of the default domain type,
and returns the newly added Var.
|
Var[] |
VarMatrix.diagonal1() |
Var[] |
VarMatrix.diagonal2() |
Var |
Var.divide(int value)
Returns a new Var that is constrained to be the division of this
variable by the given value, i.e.
|
Var |
Var.divide(Var var)
Returns a new Var that is constrained to be the division of this
variable by the given variable, i.e.
|
Var |
ProblemDelegator.element(java.util.ArrayList<Var> list,
Var indexVar) |
Var |
Problem.element(java.util.ArrayList<Var> list,
Var indexVar) |
Var |
ProblemDelegator.element(int[] array,
Var indexVar) |
Var |
Problem.element(int[] array,
Var indexVar)
Returns a constrained integer variable that is an element of the integer "array"
with index defined as another constrained integer variable "indexVar".
|
Var |
ProblemDelegator.element(Var[] array,
Var indexVar) |
Var |
Problem.element(Var[] array,
Var indexVar)
Returns a constrained integer variable that is an element of the "array" of variables
with index defined as another constrained integer variable "indexVar".
|
Var[] |
VarMatrix.flat() |
Var |
VarMatrix.get(int i,
int j) |
Var |
VarSet.getCardinality() |
Var |
VarString.getInt()
Returns the underlying integer constrained variable.
|
Var |
ProblemDelegator.getTotalConstraintViolation() |
Var |
Problem.getTotalConstraintViolation() |
Var |
ProblemDelegator.getVar(java.lang.String name) |
Var |
Problem.getVar(java.lang.String name)
Returns the Var variable with the name "name", or null if no such variable exists in the problem.
|
Var[] |
ProblemDelegator.getVarArray(java.lang.String name) |
Var[] |
Problem.getVarArray(java.lang.String name)
Returns the array of Var variables with the name "name", or null if no such array exists in the problem.
|
Var[] |
VarSelector.getVars()
Returns the array of constrained variables upon which this selector was defined.
|
Var[] |
SearchStrategy.getVars()
Returns a an array of integer variables that is in use by this strategy
|
Var[] |
ProblemDelegator.getVars() |
Var[] |
Problem.getVars()
Returns an array containing the Var variables previously added to the problem.
|
Var |
ProblemDelegator.max(java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.max(java.util.ArrayList<Var> listOfVariables) |
Var |
ProblemDelegator.max(Var[] arrayOfVariables) |
Var |
Problem.max(Var[] arrayOfVariables)
Returns a constrained integer variable that is equal to the maximal variable in the array
"arrayOfVariables" when they are all instantiated.
|
Var |
ProblemDelegator.max(Var var1,
Var var2) |
Var |
Problem.max(Var var1,
Var var2)
Returns a constrained integer variable that is equal to the maximal of two variablea
var1 or var 2 when they are both instantiated.
|
Var |
ProblemDelegator.min(java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.min(java.util.ArrayList<Var> listOfVariables) |
Var |
ProblemDelegator.min(Var[] arrayOfVariables) |
Var |
Problem.min(Var[] arrayOfVariables)
Returns a constrained integer variable that is equal to the minimal variable in the array
"arrayOfVariables" when they are all instantiated.
|
Var |
ProblemDelegator.min(Var var1,
Var var2) |
Var |
Problem.min(Var var1,
Var var2)
Returns a constrained integer variable that is equal to the minimal of two variablea
var1 or var 2 when they are both instantiated.
|
Var |
Var.minus(int value)
Returns a new Var that is constrained to be the difference of
this variable and the given value, i.e.
|
Var |
Var.minus(Var var)
Returns a new Var that is constrained to be the difference of
this variable and the given variable, i.e.
|
Var |
Var.mod(int value)
Returns a new Var that is constrained to be the remainder after
performing integer division of this variable by the given value, i.e.
|
Var |
Var.multiply(int value)
Returns a new Var that is constrained to be the product of this
variable and the given value, i.e.
|
Var |
Var.multiply(Var var)
Returns a new Var that is constrained to be the product of this
variable and the given variable, i.e.
|
Var |
Var.negative()
Returns a new Var that is constrained to be the negation of
this variable, i.e.
|
Var |
Var.plus(int value)
Returns a new Var that is constrained to be the sum of this
variable and the given value, i.e.
|
Var |
Var.plus(Var var)
Returns a new Var that is constrained to be the sum of this
variable and the given variable, i.e.
|
Var |
Var.power(int value)
Returns a new Var that is constrained to be this variable raised
to the power of the given value, i.e.
|
Var[] |
VarMatrix.row(int i) |
Var |
ProblemDelegator.scalProd(int[] arrayOfValues,
java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.scalProd(int[] arrayOfValues,
java.util.ArrayList<Var> listOfVariables) |
Var |
ProblemDelegator.scalProd(int[] arrayOfValues,
Var[] arrayOfVariables) |
Var |
Problem.scalProd(int[] arrayOfValues,
Var[] arrayOfVariables)
Returns an integer constrained variable equal to the scalar product of an array of values "arrayOfValues"
and an array of variables "arrayOfVariables".
|
Var |
Var.sqr()
Returns a new Var that is constrained to be the product of this
variable and itself, i.e.
|
Var |
ProblemDelegator.sum(java.util.ArrayList<Var> vars) |
Var |
Problem.sum(java.util.ArrayList<Var> vars)
Returns a constrained integer variable that is constrained to be
the sum of the variables in the ArrayList of Var "vars".
|
Var |
ProblemDelegator.sum(Var[] vars) |
Var |
Problem.sum(Var[] vars)
Returns a constrained integer variable that is constrained to be
the sum of the variables in the array "vars".
|
Var |
ProblemDelegator.sum(Var var1,
Var var2) |
Var |
Problem.sum(Var var1,
Var var2)
Returns a constrained integer variable that is constrained to be
the sum of the variables var1 and var2.
|
Var |
ProblemDelegator.sum(Var var1,
Var var2,
Var var3) |
Var |
Problem.sum(Var var1,
Var var2,
Var var3)
Returns a constrained integer variable that is constrained to be
the sum of the variables var1, var2, and var3.
|
Var |
ProblemDelegator.variable(int[] domain) |
Var |
Problem.variable(int[] domain)
An equivalent of var("",domain)
|
Var |
ProblemDelegator.variable(int min,
int max) |
Var |
Problem.variable(int min,
int max)
Creates a Var with domain [min;max].
|
Var |
ProblemDelegator.variable(java.lang.String name,
int[] domain) |
Var |
Problem.variable(java.lang.String name,
int[] domain)
Creates a Var with the name "name" and domain containing the values in the array "domain"
of the default domain type, adds this variable to the problem, and returns the newly added Var.
|
Var |
ProblemDelegator.variable(java.lang.String name,
int min,
int max) |
Var |
Problem.variable(java.lang.String name,
int min,
int max)
Creates a Var by calling createVariable(name,min,max) and
adds this variable to the problem.
|
Var |
ProblemDelegator.variable(java.lang.String name,
int min,
int max,
DomainType domainType) |
Var |
Problem.variable(java.lang.String name,
int min,
int max,
DomainType domainType)
Similar to variable(String name, int min, int max) but also has one more parameter
that defines the default domain type.
|
Var[] |
ProblemDelegator.variableArray(java.lang.String name,
int min,
int max,
int size) |
Var[] |
Problem.variableArray(java.lang.String name,
int min,
int max,
int size)
Creates an array of Var variables with the name "name" and domains [min;max], adds
this array of variables to the problem, and returns the newly added Var array.
|
| Modifier and Type | Method and Description |
|---|---|
Var |
ProblemDelegator.add(java.lang.String name,
Var var) |
Var |
Problem.add(java.lang.String name,
Var var)
Gives the Var variable "var" a new name "name", adds it to the problem,
and returns the newly added Var.
|
Var |
ProblemDelegator.add(Var var) |
Var |
Problem.add(Var var)
Adds a Var variable "var" to the problem, and returns the newly added Var.
|
void |
Solver.addSearchStrategy(Var[] vars)
This methods takes the default search strategy, resets its
vars, and adds this strategy to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
ValueSelector valueSelector)
This methods takes the default search strategy, resets its
vars and valueSelector, and adds this strategy to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
ValueSelectorType valueSelectorType)
This methods takes the default search strategy, resets its
vars and valueSelector, and adds this strategy to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
VarSelector varSelector)
This methods takes the default search strategy, resets its
vars and varSelector, and adds this strategy to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
VarSelectorType varSelectorType)
This methods takes the default search strategy, resets its
vars and varSelector, and adds this strategy to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
VarSelectorType varSelectorType,
ValueSelectorType valueSelectorType)
This methods takes the default search strategy, resets its
vars, varSelector, and valueSelector, and then adds this strategy
to the end of the strategy execution lists.
|
void |
Solver.addSearchStrategy(Var[] vars,
VarSelector varSelector,
ValueSelector valueSelector)
This methods takes the default search strategy, resets its
vars, varSelector, and valueSelector, and then adds this strategy
to the end of the strategy execution lists.
|
Constraint |
ProblemDelegator.allDiff(Var[] vars) |
Constraint |
Problem.allDiff(Var[] vars)
This method create a new Constraint stating that all of the elements of
the array of variables "vars" must take different values from each other.
|
VarReal |
VarReal.divide(Var var)
Adds and returns a new VarReal that is constrained to be the division of this variable
by the given variable, i.e.
|
Var |
Var.divide(Var var)
Returns a new Var that is constrained to be the division of this
variable by the given variable, i.e.
|
Var |
ProblemDelegator.element(java.util.ArrayList<Var> list,
Var indexVar) |
Var |
Problem.element(java.util.ArrayList<Var> list,
Var indexVar) |
Var |
ProblemDelegator.element(int[] array,
Var indexVar) |
Var |
Problem.element(int[] array,
Var indexVar)
Returns a constrained integer variable that is an element of the integer "array"
with index defined as another constrained integer variable "indexVar".
|
VarSet |
ProblemDelegator.element(java.util.Set<java.lang.Integer>[] sets,
Var indexVar) |
VarSet |
Problem.element(java.util.Set<java.lang.Integer>[] sets,
Var indexVar)
Creates a set variable that corresponds to sets[index]
|
Var |
ProblemDelegator.element(Var[] array,
Var indexVar) |
Var |
ProblemDelegator.element(Var[] array,
Var indexVar) |
Var |
Problem.element(Var[] array,
Var indexVar)
Returns a constrained integer variable that is an element of the "array" of variables
with index defined as another constrained integer variable "indexVar".
|
Var |
Problem.element(Var[] array,
Var indexVar)
Returns a constrained integer variable that is an element of the "array" of variables
with index defined as another constrained integer variable "indexVar".
|
Solution |
Solver.findOptimalSolution(Objective objective,
Var objectiveVar)
This method is equivalent to
findOptimalSolution(Objective.MINIMIZE,objectiveVar,OptimizationStrategy.NATIVE)
It is usually overridden by an implementation
|
Solution |
Solver.findOptimalSolution(Objective objective,
Var objectiveVar,
OptimizationStrategy optStrategy)
This method attempts to find the solution that minimizes/maximizes the objective variable.
|
Solution |
Solver.findOptimalSolution(Var objectiveVar)
This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar)
|
Constraint |
ProblemDelegator.linear(Var var,
java.lang.String oper,
int value) |
Constraint |
Problem.linear(Var var,
java.lang.String oper,
int value)
Creates a constraint: var "oper" value without posting
|
Constraint |
ProblemDelegator.linear(Var var1,
java.lang.String oper,
Var var2) |
Constraint |
Problem.linear(Var var1,
java.lang.String oper,
Var var2)
Creates a constraint: var1 "oper" var2 without posting
|
void |
ProblemDelegator.log(Var[] vars) |
void |
Problem.log(Var[] vars)
Logs the integer constrained variables contained in the array "vars".
|
Var |
ProblemDelegator.max(Var[] arrayOfVariables) |
Var |
Problem.max(Var[] arrayOfVariables)
Returns a constrained integer variable that is equal to the maximal variable in the array
"arrayOfVariables" when they are all instantiated.
|
Var |
ProblemDelegator.max(Var var1,
Var var2) |
Var |
Problem.max(Var var1,
Var var2)
Returns a constrained integer variable that is equal to the maximal of two variablea
var1 or var 2 when they are both instantiated.
|
Var |
ProblemDelegator.min(Var[] arrayOfVariables) |
Var |
Problem.min(Var[] arrayOfVariables)
Returns a constrained integer variable that is equal to the minimal variable in the array
"arrayOfVariables" when they are all instantiated.
|
Var |
ProblemDelegator.min(Var var1,
Var var2) |
Var |
Problem.min(Var var1,
Var var2)
Returns a constrained integer variable that is equal to the minimal of two variablea
var1 or var 2 when they are both instantiated.
|
VarReal |
VarReal.minus(Var var)
Adds and returns a new VarReal that is constrained to be the difference of this variable
and the given variable, i.e.
|
Var |
Var.minus(Var var)
Returns a new Var that is constrained to be the difference of
this variable and the given variable, i.e.
|
VarReal |
VarReal.multiply(Var var)
Adds and returns a new VarReal that is constrained to be the product of this variable
and the given variable, i.e.
|
Var |
Var.multiply(Var var)
Returns a new Var that is constrained to be the product of this
variable and the given variable, i.e.
|
VarReal |
VarReal.plus(Var var)
Adds and returns a new VarReal that is constrained to be the sum of this variable
and the given variable, i.e.
|
Var |
Var.plus(Var var)
Returns a new Var that is constrained to be the sum of this
variable and the given variable, i.e.
|
Constraint |
ProblemDelegator.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
Var var) |
Constraint |
Problem.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.post(double[] coefficients,
Var[] vars,
java.lang.String oper,
double value) |
Constraint |
ProblemDelegator.post(int[] array,
Var[] vars,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
Problem.post(int[] array,
Var[] vars,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
ProblemDelegator.post(int[] array,
Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.post(int[] array,
Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
Problem.post(int[] array,
Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
Problem.post(int[] array,
Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.post(Var[] vars,
java.lang.String oper,
int value) |
Constraint |
Problem.post(Var[] vars,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
ProblemDelegator.post(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.post(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
Problem.post(Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
Problem.post(Var[] vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.post(VarReal var1,
java.lang.String oper,
Var var2) |
Constraint |
Problem.post(VarReal var1,
java.lang.String oper,
Var var2)
Creates and posts a constraint: var1 "oper" var2
|
Constraint |
ProblemDelegator.post(Var var,
java.lang.String oper,
int value) |
Constraint |
Problem.post(Var var,
java.lang.String oper,
int value)
Creates and posts a constraint: var "oper" value
|
Constraint |
ProblemDelegator.post(Var var1,
java.lang.String oper,
Var var2) |
Constraint |
Problem.post(Var var1,
java.lang.String oper,
Var var2)
Creates and posts a constraint: var1 "oper" var2
|
Constraint |
ProblemDelegator.post(Var var1,
java.lang.String oper,
VarReal var2) |
Constraint |
Problem.post(Var var1,
java.lang.String oper,
VarReal var2)
Creates and posts a constraint: var1 "oper" var2
|
Constraint |
ProblemDelegator.post(Var var1,
Var var2,
java.lang.String oper,
int value) |
Constraint |
Problem.post(Var var1,
Var var2,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
ProblemDelegator.post(Var var1,
Var var2,
java.lang.String oper,
Var var) |
Constraint |
Problem.post(Var var1,
Var var2,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.postAllDiff(Var[] vars) |
Constraint |
Problem.postAllDiff(Var[] vars)
This constraint is a synonym for postAllDifferent
|
Constraint |
ProblemDelegator.postAllDifferent(Var[] vars) |
Constraint |
Problem.postAllDifferent(Var[] vars)
Creates and posts a new Constraint stating that all of the elements of
the array of variables "vars" must take different values from each other.
|
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
int value) |
Constraint |
Problem.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
int value)
This method creates and posts a new cardinality constraint
“cardinality(vars,cardValue) 'oper' value”.
|
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
Var var)
This method is similar to the one above but instead of “value”
the “cardinality(vars,cardValue)” is being constrained by “var”.
|
Constraint |
Problem.postCardinality(Var[] vars,
int cardValue,
java.lang.String oper,
Var var)
This method is similar to the one above but instead of “value”
the “cardinality(vars,cardValue)” is being constrained by “var”.
|
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
Problem.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
int value)
This method is similar to the one above but instead of “var”
it uses "value"
|
Constraint |
Problem.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
int value)
This method is similar to the one above but instead of “var”
it uses "value"
|
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
Var var)
This method is similar to the one above but instead of “cardValue”
it uses "cardVar"
|
Constraint |
Problem.postCardinality(Var[] vars,
Var cardVar,
java.lang.String oper,
Var var)
This method is similar to the one above but instead of “cardValue”
it uses "cardVar"
|
Constraint |
ProblemDelegator.postElement(int[] array,
Var indexVar,
java.lang.String oper,
int value) |
Constraint |
Problem.postElement(int[] array,
Var indexVar,
java.lang.String oper,
int value)
Creates and posts a new constraint: array[indexVar] 'oper' value
Here "array[indexVar]" denotes a constrained integer variable, which domain
consists of integers array[i] where i is within domain of the "indexVar".
|
Constraint |
ProblemDelegator.postElement(int[] array,
Var indexVar,
java.lang.String oper,
Var var) |
Constraint |
Problem.postElement(int[] array,
Var indexVar,
java.lang.String oper,
Var var)
Creates and posts a constraint: array[indexVar] 'oper' var
Here "array[indexVar]" denotes a constrained integer variable, which domain
consists of integers array[i] where i is within domain of the "indexVar".
|
Constraint |
ProblemDelegator.postElement(java.util.Set[] arrayOfSets,
Var indexVar,
java.lang.String oper,
VarSet var) |
Constraint |
Problem.postElement(java.util.Set[] arrayOfSets,
Var indexVar,
java.lang.String oper,
VarSet var)
Creates and posts a constraint: arrayOfSets[indexVar] 'oper' setVar
Here "arrayOfSets[indexVar]" denotes a constrained set variable, which domain
consists of sets of integers arrayOfSets[i] where i is within domain of the "indexVar".
|
Constraint |
ProblemDelegator.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
int value) |
Constraint |
ProblemDelegator.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
int value) |
Constraint |
Problem.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
int value)
Posts a constraint: vars[indexVar] 'oper' value
|
Constraint |
Problem.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
int value)
Posts a constraint: vars[indexVar] 'oper' value
|
Constraint |
ProblemDelegator.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
Var var) |
Constraint |
Problem.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
Var var)
Posts a new constraint: vars[indexVar] 'oper' var
|
Constraint |
Problem.postElement(Var[] vars,
Var indexVar,
java.lang.String oper,
Var var)
Posts a new constraint: vars[indexVar] 'oper' var
|
Constraint |
ProblemDelegator.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
Var[] cardinalityVars) |
Constraint |
Problem.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
Var[] cardinalityVars) |
Constraint |
ProblemDelegator.postGlobalCardinality(Var[] vars,
int[] values,
int[] cardMin,
int[] cardMax) |
Constraint |
Problem.postGlobalCardinality(Var[] vars,
int[] values,
int[] cardMin,
int[] cardMax)
Creates and posts a new global cardinality constraint that states:
|
Constraint |
ProblemDelegator.postGlobalCardinality(Var[] vars,
int[] values,
Var[] cardinalityVars) |
Constraint |
ProblemDelegator.postGlobalCardinality(Var[] vars,
int[] values,
Var[] cardinalityVars) |
Constraint |
Problem.postGlobalCardinality(Var[] vars,
int[] values,
Var[] cardinalityVars)
Creates and posts a new global cardinality constraint that states:
|
Constraint |
Problem.postGlobalCardinality(Var[] vars,
int[] values,
Var[] cardinalityVars)
Creates and posts a new global cardinality constraint that states:
|
Constraint |
ProblemDelegator.postMax(Var[] vars,
java.lang.String oper,
int value) |
Constraint |
Problem.postMax(Var[] vars,
java.lang.String oper,
int value)
Creates and posts a constraint: max(vars) "oper" value
where max(vars) is a maximal variable in the array "vars"
when they are all instantiated.
|
Constraint |
ProblemDelegator.postMax(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postMax(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
Problem.postMax(Var[] vars,
java.lang.String oper,
Var var)
Creates and posts a constraint: max(vars) "oper" var
where max(vars) is a maximal variable in the array "vars"
when they are all instantiated.
|
Constraint |
Problem.postMax(Var[] vars,
java.lang.String oper,
Var var)
Creates and posts a constraint: max(vars) "oper" var
where max(vars) is a maximal variable in the array "vars"
when they are all instantiated.
|
Constraint |
ProblemDelegator.postMin(Var[] vars,
java.lang.String oper,
int value) |
Constraint |
Problem.postMin(Var[] vars,
java.lang.String oper,
int value)
Creates and posts a constraint: min(vars) "oper" value
where max(vars) is a minimal variable in the array "vars"
when they are all instantiated.
|
Constraint |
ProblemDelegator.postMin(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postMin(Var[] vars,
java.lang.String oper,
Var var) |
Constraint |
Problem.postMin(Var[] vars,
java.lang.String oper,
Var var)
Creates and posts a constraint: min(vars) "oper" var
where max(vars) is a minimal variable in the array "vars"
when they are all instantiated.
|
Constraint |
Problem.postMin(Var[] vars,
java.lang.String oper,
Var var)
Creates and posts a constraint: min(vars) "oper" var
where max(vars) is a minimal variable in the array "vars"
when they are all instantiated.
|
Constraint |
ProblemDelegator.postScalProd(Var var,
java.lang.String oper,
int[] arrayOfValues,
Var[] arrayOfVariables) |
Constraint |
ProblemDelegator.postScalProd(Var var,
java.lang.String oper,
int[] arrayOfValues,
Var[] arrayOfVariables) |
Constraint |
Problem.postScalProd(Var var,
java.lang.String oper,
int[] arrayOfValues,
Var[] arrayOfVariables)
Creates and posts a constraint: var "oper" scalProd(arrayOfValues,arrayOfVariables)
|
Constraint |
Problem.postScalProd(Var var,
java.lang.String oper,
int[] arrayOfValues,
Var[] arrayOfVariables)
Creates and posts a constraint: var "oper" scalProd(arrayOfValues,arrayOfVariables)
|
Var |
ProblemDelegator.scalProd(int[] arrayOfValues,
Var[] arrayOfVariables) |
Var |
Problem.scalProd(int[] arrayOfValues,
Var[] arrayOfVariables)
Returns an integer constrained variable equal to the scalar product of an array of values "arrayOfValues"
and an array of variables "arrayOfVariables".
|
int |
ValueSelector.select(Var var) |
void |
Solver.setSearchStrategy(Var[] vars)
Define a searchStrategy that will be used by find solutions methods.
|
void |
Solver.setSearchStrategy(Var[] vars,
ValueSelector valueSelector)
Define a searchStrategy that will be used by find solutions methods.
|
void |
Solver.setSearchStrategy(Var[] vars,
VarSelector varSelector)
Define a searchStrategy that will be used by find solutions methods.
|
void |
Solver.setSearchStrategy(Var[] vars,
VarSelector varSelector,
ValueSelector valueSelector)
Define a searchStrategy that will be used by find solutions methods.
|
void |
SearchStrategy.setVars(Var[] vars)
Defines an array of integer variables that may be used (or not) by this strategy
|
Var |
ProblemDelegator.sum(Var[] vars) |
Var |
Problem.sum(Var[] vars)
Returns a constrained integer variable that is constrained to be
the sum of the variables in the array "vars".
|
Var |
ProblemDelegator.sum(Var var1,
Var var2) |
Var |
Problem.sum(Var var1,
Var var2)
Returns a constrained integer variable that is constrained to be
the sum of the variables var1 and var2.
|
Var |
ProblemDelegator.sum(Var var1,
Var var2,
Var var3) |
Var |
Problem.sum(Var var1,
Var var2,
Var var3)
Returns a constrained integer variable that is constrained to be
the sum of the variables var1, var2, and var3.
|
void |
Solver.trace(Var var)
This method forces to trace (to log) all modification events for
the variable "var".
|
void |
Solver.trace(Var[] vars)
This method forces to trace (to log) all modification events for
all variables "vars"
|
| Modifier and Type | Method and Description |
|---|---|
Constraint |
ProblemDelegator.allDiff(java.util.ArrayList<Var> vars) |
Constraint |
Problem.allDiff(java.util.ArrayList<Var> vars)
This method create a new Constraint stating that all of the elements of
the list of variables "vars" must take different values from each other.
|
Var |
ProblemDelegator.element(java.util.ArrayList<Var> list,
Var indexVar) |
Var |
Problem.element(java.util.ArrayList<Var> list,
Var indexVar) |
void |
ProblemDelegator.log(java.util.ArrayList<Var> vars) |
void |
Problem.log(java.util.ArrayList<Var> vars) |
Var |
ProblemDelegator.max(java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.max(java.util.ArrayList<Var> listOfVariables) |
Var |
ProblemDelegator.min(java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.min(java.util.ArrayList<Var> listOfVariables) |
Constraint |
ProblemDelegator.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
int value) |
Constraint |
Problem.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
ProblemDelegator.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
Var var) |
Constraint |
Problem.post(java.util.ArrayList<Var> vars,
java.lang.String oper,
Var var)
Deprecated.
|
Constraint |
ProblemDelegator.post(int[] array,
java.util.ArrayList<Var> vars,
java.lang.String oper,
int value) |
Constraint |
Problem.post(int[] array,
java.util.ArrayList<Var> vars,
java.lang.String oper,
int value)
Deprecated.
|
Constraint |
ProblemDelegator.postAllDiff(java.util.ArrayList<Var> vars) |
Constraint |
Problem.postAllDiff(java.util.ArrayList<Var> vars)
Similar to postAllDiff for variables saved in the ArrayList vars
|
Constraint |
ProblemDelegator.postAllDifferent(java.util.ArrayList<Var> vars) |
Constraint |
Problem.postAllDifferent(java.util.ArrayList<Var> vars)
Similar to postAllDifferent for variables saved in the ArrayList vars
|
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
int value) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
int value) |
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
int cardValue,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
int value) |
Constraint |
ProblemDelegator.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
Problem.postCardinality(java.util.ArrayList<Var> vars,
Var cardVar,
java.lang.String oper,
Var var) |
Constraint |
ProblemDelegator.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
int[] cardMin,
int[] cardMax) |
Constraint |
Problem.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
int[] cardMin,
int[] cardMax) |
Constraint |
ProblemDelegator.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
Var[] cardinalityVars) |
Constraint |
Problem.postGlobalCardinality(java.util.ArrayList<Var> vars,
int[] values,
Var[] cardinalityVars) |
Var |
ProblemDelegator.scalProd(int[] arrayOfValues,
java.util.ArrayList<Var> listOfVariables) |
Var |
Problem.scalProd(int[] arrayOfValues,
java.util.ArrayList<Var> listOfVariables) |
void |
SearchStrategy.setVars(java.util.ArrayList<Var> vars)
Defines an array of integer variables that may be used (or not) by this strategy
|
Var |
ProblemDelegator.sum(java.util.ArrayList<Var> vars) |
Var |
Problem.sum(java.util.ArrayList<Var> vars)
Returns a constrained integer variable that is constrained to be
the sum of the variables in the ArrayList of Var "vars".
|