Uses of Interface
javax.constraints.Var

Packages that use Var

javax.constraints	This package describes a generic Java programming interface for Constraint Programming (CP API) - see www.jcp.org .
javax.constraints.extra
javax.constraints.impl
javax.constraints.impl.constraint
javax.constraints.impl.search
javax.constraints.impl.search.goal
javax.constraints.impl.search.selectors

Uses of Var in javax.constraints

Subinterfaces of Var in javax.constraints

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.

Methods in javax.constraints that return Var

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(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	ProblemDelegator.element(VarList list, Var indexVar)
Var	Problem.element(VarList list, Var 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.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(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(VarList listOfVariables)
Var	Problem.max(VarList listOfVariables)
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(VarList listOfVariables)
Var	Problem.min(VarList listOfVariables)
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, Var[] arrayOfVariables)
Var	Problem.scalProd(int[] arrayOfValues, Var[] arrayOfVariables) Returns a constrained variable equal to the scalar product of an array of values "arrayOfValues" and an array of variables "arrayOfVariables".
Var	ProblemDelegator.scalProd(int[] arrayOfValues, VarList listOfVariables)
Var	Problem.scalProd(int[] arrayOfValues, VarList listOfVariables)
Var	Var.sqr() Returns a new Var that is constrained to be the product of this variable and itself, i.e.
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(VarList vars)
Var	Problem.sum(VarList vars) Returns a constrained integer variable that is constrained to be the sum of the variables in the VarList "vars".
Var[]	VarList.toArray()
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.

Methods in javax.constraints with parameters of type Var

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	VarList.add(Var[] vars)
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.
int	Var.compareTo(Var var)
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(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".
Var	ProblemDelegator.element(VarList list, Var indexVar)
Var	Problem.element(VarList list, Var 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(int[] array, Var[] vars, java.lang.String oper, int value)
Constraint	Problem.post(int[] array, Var[] vars, java.lang.String oper, int value) Creates and posts a constraint: array*vars value
Constraint	ProblemDelegator.post(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	ProblemDelegator.post(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	Problem.post(int[] array, Var[] vars, java.lang.String oper, Var var) Creates and posts a constraint: array*vars var
Constraint	Problem.post(int[] array, Var[] vars, java.lang.String oper, Var var) Creates and posts a constraint: array*vars var
Constraint	ProblemDelegator.post(Var[] vars, java.lang.String oper, int value)
Constraint	Problem.post(Var[] vars, java.lang.String oper, int value) Creates and posts a constraint: sum of vars value
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) Creates and posts a constraint: sum of vars "oper" var
Constraint	Problem.post(Var[] vars, java.lang.String oper, Var var) Creates and posts a constraint: sum of vars "oper" var
Constraint	ProblemDelegator.post(VarList vars, java.lang.String oper, Var var)
Constraint	Problem.post(VarList vars, java.lang.String oper, Var var) Creates and posts a constraint: sum of vars "oper" var
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, Var var2, java.lang.String oper, int value)
Constraint	Problem.post(Var var1, Var var2, java.lang.String oper, int value) Creates and posts a constraint: (var1 + var2) "oper" value
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) Creates and posts a constraint: (var1 + var2) "oper" var
Constraint	ProblemDelegator.postAllDiff(Var[] vars)
Constraint	Problem.postAllDiff(Var[] vars) This constraint is a synonym for constraintAllDifferent
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(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) < 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.postCardinality(VarList vars, int cardValue, java.lang.String oper, Var var)
Constraint	Problem.postCardinality(VarList vars, int cardValue, java.lang.String oper, Var var)
Constraint	ProblemDelegator.postCardinality(VarList vars, Var cardVar, java.lang.String oper, int value)
Constraint	Problem.postCardinality(VarList vars, Var cardVar, java.lang.String oper, int value)
Constraint	ProblemDelegator.postCardinality(VarList vars, Var cardVar, java.lang.String oper, Var var)
Constraint	Problem.postCardinality(VarList vars, Var cardVar, java.lang.String oper, Var var)
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] 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] 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] 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] value
Constraint	Problem.postElement(Var[] vars, Var indexVar, java.lang.String oper, int value) Posts a constraint: vars[indexVar] 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] var
Constraint	Problem.postElement(Var[] vars, Var indexVar, java.lang.String oper, Var var) Posts a new constraint: vars[indexVar] var
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.postGlobalCardinality(VarList vars, int[] values, Var[] cardinalityVars)
Constraint	Problem.postGlobalCardinality(VarList vars, int[] values, Var[] cardinalityVars)
Constraint	ProblemDelegator.postLinear(int[] array, Var[] vars, java.lang.String oper, int value)
Constraint	Problem.postLinear(int[] array, Var[] vars, java.lang.String oper, int value) Synonym for constraint(int[] array, Var[] vars, String oper, int value)
Constraint	ProblemDelegator.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	ProblemDelegator.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	Problem.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var) Synonym for constraint(int[] array, Var[] vars, String oper, Var var)
Constraint	Problem.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var) Synonym for constraint(int[] array, Var[] vars, String oper, Var var)
Constraint	ProblemDelegator.postLinear(Var[] vars, java.lang.String oper, int value)
Constraint	Problem.postLinear(Var[] vars, java.lang.String oper, int value) Synonym for constraint(Var[] vars, String oper, int value)
Constraint	ProblemDelegator.postLinear(Var[] vars, java.lang.String oper, Var var)
Constraint	ProblemDelegator.postLinear(Var[] vars, java.lang.String oper, Var var)
Constraint	Problem.postLinear(Var[] vars, java.lang.String oper, Var var) Synonym for constraint(Var[] vars, String oper, Var var)
Constraint	Problem.postLinear(Var[] vars, java.lang.String oper, Var var) Synonym for constraint(Var[] vars, String oper, Var var)
Constraint	ProblemDelegator.postLinear(Var var, java.lang.String oper, int value)
Constraint	Problem.postLinear(Var var, java.lang.String oper, int value) Synonym for constraint(Var var, String oper, int value)
Constraint	ProblemDelegator.postLinear(Var var1, java.lang.String oper, Var var2)
Constraint	Problem.postLinear(Var var1, java.lang.String oper, Var var2) Synonym for constraint(Var var1, String oper, Var var2)
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.
VarReal	VarReal.power(Var var) Adds and returns a new VarReal that is constrained to be this variable raised to the power of the given variable, i.e.
Var	ProblemDelegator.scalProd(int[] arrayOfValues, Var[] arrayOfVariables)
Var	Problem.scalProd(int[] arrayOfValues, Var[] arrayOfVariables) Returns a 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".
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"

Method parameters in javax.constraints with type arguments of type Var

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

Uses of Var in javax.constraints.extra

Constructors in javax.constraints.extra with parameters of type Var

ConstraintElementAtOnSets(VarSet setVar, java.util.Set[] sets, Var indexVar)

ConstraintTraceVar(Var var, PropagationEvent event)

Uses of Var in javax.constraints.impl

Classes in javax.constraints.impl that implement Var

class

AbstractVar

Methods in javax.constraints.impl that return Var

Var	AbstractProblem.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	AbstractProblem.add(Var var) Adds a Var variable "var" to the problem, and returns the newly added Var.
Var[]	AbstractProblem.addVarArray(java.lang.String arrayName, java.lang.String[] varNames) Creates an array of Var variables with name "arrayName".
Var[]	AbstractProblem.addVarArray(java.lang.String name, Var[] vars) Gives the array of Var variables "vars" a new name "name", adds the array of variables to the problem, and returns the newly added Var array.
Var[]	BasicVarMatrix.column(int j)
abstract Var	AbstractProblem.createVariable(java.lang.String name, int min, int max)
Var[]	BasicVarMatrix.diagonal1()
Var[]	BasicVarMatrix.diagonal2()
Var	AbstractVar.divide(int value)
Var	AbstractVar.divide(Var var)
Var	AbstractProblem.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	AbstractProblem.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	AbstractProblem.element(VarList list, Var indexVar)
Var[]	BasicVarMatrix.flat()
Var	BasicVarMatrix.get(int i, int j)
Var	BasicVarSet.getCardinality()
Var	BasicVarString.getInt() Returns the underlying integer constrained variable.
Var	BasicVarSet.getRequiredVar(int value)
Var[]	BasicVarSet.getRequiredVars()
Var	AbstractProblem.getVar(java.lang.String name) Returns the Var variable with the name "name", or null if no such variable exists in the problem.
Var[]	AbstractProblem.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[]	AbstractProblem.getVars() Returns an array containing the Var variables previously added to the problem.
Var	AbstractProblem.max(Var[] vars) Returns a constrained integer variable that is equal to the maximal variable in the array "arrayOfVariables" when they are all instantiated.
Var	AbstractProblem.max(VarList listOfVariables)
Var	AbstractProblem.max(Var var1, Var var2)
Var	AbstractProblem.min(Var[] vars) Returns a constrained integer variable that is equal to the minimal variable in the array "arrayOfVariables" when they are all instantiated.
Var	AbstractProblem.min(VarList listOfVariables)
Var	AbstractProblem.min(Var var1, Var var2)
Var	AbstractVar.minus(int value)
Var	AbstractVar.minus(Var var)
Var	AbstractVar.mod(int value)
Var	AbstractVar.negative()
Var	AbstractVar.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[]	BasicVarMatrix.row(int i)
Var	AbstractProblem.scalProd(int[] arrayOfValues, VarList vars)
Var	AbstractVar.sqr() Returns a new Var that is constrained to be the product of this variable and itself, i.e.
Var	AbstractProblem.sum(Var[] vars) Returns a constrained integer variable that is constrained to be the sum of the variables in the array "vars".
Var	AbstractProblem.sum(VarList vars) Returns a constrained integer variable that is constrained to be the sum of the variables in the VarList "vars".
Var	AbstractProblem.var(java.lang.String name, java.lang.String symbolicExpression) Creates a Var variable based on the symbolicExpression, adds this variable to the problem, and returns the newly added Var.
Var	AbstractProblem.variable(int[] domain)
Var	AbstractProblem.variable(int min, int max)
Var	AbstractProblem.variable(java.lang.String name, int[] domain) Creates a Var with the name "name", and domain int[]
Var	AbstractProblem.variable(java.lang.String name, int min, int max)
Var	AbstractProblem.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[]	AbstractProblem.variableArray(java.lang.String name, int min, int max, int size) Adds an array of Var variables with the name "name" and domains [min;max] of domain type "type", adds this array of variables to the problem, and returns the newly added Var array.
Var[]	AbstractProblem.varSquare(java.lang.String name, int min, int max, int size) Creates a 2-dimensional array of Var variables, with dimensions "size"x"size".

Methods in javax.constraints.impl with parameters of type Var

Var	AbstractProblem.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	AbstractProblem.add(Var var) Adds a Var variable "var" to the problem, and returns the newly added Var.
Var[]	AbstractProblem.addVarArray(java.lang.String name, Var[] vars) Gives the array of Var variables "vars" a new name "name", adds the array of variables to the problem, and returns the newly added Var array.
int	AbstractVar.compareTo(Var var)
Var	AbstractVar.divide(Var var)
Var	AbstractProblem.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	AbstractProblem.element(java.util.Set<java.lang.Integer>[] sets, Var indexVar) Creates a set variable that corresponds to sets[index]
Var	AbstractProblem.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	AbstractProblem.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	AbstractProblem.element(VarList list, Var indexVar)
void	AbstractProblem.log(java.lang.String text, Var[] vars) Logs the String "text" and then all integer constrained variables added to the problem.
void	AbstractProblem.log(Var[] vars) Logs the integer constrained variables contained in the array "vars".
Var	AbstractProblem.max(Var[] vars) Returns a constrained integer variable that is equal to the maximal variable in the array "arrayOfVariables" when they are all instantiated.
Var	AbstractProblem.max(Var var1, Var var2)
Var	AbstractProblem.min(Var[] vars) Returns a constrained integer variable that is equal to the minimal variable in the array "arrayOfVariables" when they are all instantiated.
Var	AbstractProblem.min(Var var1, Var var2)
Var	AbstractVar.minus(Var var)
Constraint	AbstractProblem.post(int[] array, VarList vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.post(VarList vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.post(Var var1, Var var2, java.lang.String oper, int value) Creates and posts a constraint: (var1 + var2) "oper" value
Constraint	AbstractProblem.post(Var var1, Var var2, java.lang.String oper, Var var) Creates and posts a constraint: (var1 + var2) "oper" var
Constraint	AbstractProblem.postAllDiff(Var[] vars) This constraint is a synonym for constraintAllDifferent
Constraint	AbstractProblem.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	AbstractProblem.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	AbstractProblem.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	AbstractProblem.postCardinality(Var[] vars, Var cardVar, java.lang.String oper, Var var) This method creates a new cardinality constraint “cardinality(vars,cardVar) < value”.
Constraint	AbstractProblem.postCardinality(Var[] vars, Var cardVar, java.lang.String oper, Var var) This method creates a new cardinality constraint “cardinality(vars,cardVar) < value”.
Constraint	AbstractProblem.postCardinality(VarList vars, int cardValue, java.lang.String oper, Var var)
Constraint	AbstractProblem.postCardinality(VarList vars, Var cardVar, java.lang.String oper, int value)
Constraint	AbstractProblem.postCardinality(VarList vars, Var cardVar, java.lang.String oper, Var var)
Constraint	AbstractProblem.postElement(java.util.Set[] arrayOfSets, Var indexVar, java.lang.String oper, VarSet var) Creates and posts a constraint: arrayOfSets[indexVar] 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	AbstractProblem.postGlobalCardinality(Var[] vars, int[] values, int[] cardMin, int[] cardMax) For each index i the number of times the value "values[i]" occurs in the array "vars" should be cardMin[i] and cardMax[i] (inclusive)
Constraint	AbstractProblem.postGlobalCardinality(Var[] vars, int[] values, Var[] cardinalityVars)
Constraint	AbstractProblem.postGlobalCardinality(Var[] vars, int[] values, Var[] cardinalityVars)
Constraint	AbstractProblem.postGlobalCardinality(VarList vars, int[] values, Var[] cardinalityVars)
Constraint	AbstractProblem.postLinear(int[] array, Var[] vars, java.lang.String oper, int value)
Constraint	AbstractProblem.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.postLinear(int[] array, Var[] vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.postLinear(int[] array, VarList vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.postLinear(Var[] vars, java.lang.String oper, int value)
Constraint	AbstractProblem.postLinear(Var[] vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.postLinear(Var[] vars, java.lang.String oper, Var var)
Constraint	AbstractProblem.postLinear(Var var, java.lang.String oper, int value)
Constraint	AbstractProblem.postLinear(Var var1, java.lang.String oper, Var var2)
Constraint	AbstractProblem.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	AbstractProblem.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	AbstractProblem.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	AbstractProblem.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	AbstractProblem.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	AbstractProblem.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.
Var	AbstractProblem.sum(Var[] vars) Returns a constrained integer variable that is constrained to be the sum of the variables in the array "vars".

Method parameters in javax.constraints.impl with type arguments of type Var

Constraint	AbstractProblem.postAllDiff(java.util.ArrayList<Var> vars)
Constraint	AbstractProblem.postAllDifferent(java.util.ArrayList<Var> vars)

Uses of Var in javax.constraints.impl.constraint

Methods in javax.constraints.impl.constraint that return Var

Var	ConstraintMax.getMaxVar()
Var	ConstraintMin.getMinVar()

Constructors in javax.constraints.impl.constraint with parameters of type Var

ConstraintGlobalCardinality(Var[] vars, int[] values, Var[] cardinalityVars)

ConstraintGlobalCardinality(Var[] vars, int[] values, Var[] cardinalityVars)

ConstraintMax(Var[] vars, java.lang.String oper, int value)

ConstraintMax(Var[] vars, java.lang.String oper, Var var)

ConstraintMax(Var[] vars, java.lang.String oper, Var var)

ConstraintMin(Var[] vars, java.lang.String oper, int value)

ConstraintMin(Var[] vars, java.lang.String oper, Var var)

ConstraintMin(Var[] vars, java.lang.String oper, Var var)

ConstraintNotAllEqual(Var[] vars)

ConstraintNotAllEqual(Var[] vars, int[] values)

ConstraintTable(Var[] vars, int[][] table, int mode)
Creates and returns a new constraint stating that all variables from "vars" must take values compatible with the table "table", which represents the set of (permitted)/(not permitted) combinations.

Uses of Var in javax.constraints.impl.search

Methods in javax.constraints.impl.search that return Var

Var[]

AbstractSearchStrategy.getVars()

Methods in javax.constraints.impl.search with parameters of type Var

void	AbstractSolver.addSearchStrategy(Var[] vars) This method creates a new instance of the default search strategy, resets its vars, and adds this strategy to the end of the strategy execution lists.
void	AbstractSolver.addSearchStrategy(Var[] vars, ValueSelector valueSelector) This method creates a new instance of the default search strategy, resets its vars and valueSelector, and adds this strategy to the end of the strategy execution lists.
void	AbstractSolver.addSearchStrategy(Var[] vars, ValueSelectorType valueSelectorType) This method creates a new instance of the default search strategy, resets its vars and valueSelector, and adds this strategy to the end of the strategy execution lists.
void	AbstractSolver.addSearchStrategy(Var[] vars, VarSelector varSelector) This method creates a new instance of the default search strategy, resets its vars and varSelector, and adds this strategy to the end of the strategy execution lists.
void	AbstractSolver.addSearchStrategy(Var[] vars, VarSelectorType varSelectorType) This method creates a new instance of the default search strategy, resets its vars and varSelector, and adds this strategy to the end of the strategy execution lists.
void	AbstractSolver.addSearchStrategy(Var[] vars, VarSelectorType varSelectorType, ValueSelectorType valueSelectorType) This method creates a new instance of the default search strategy, resets its vars, varSelector, and valueSelector, and then adds this strategy to the end of the strategy execution list.
void	AbstractSolver.addSearchStrategy(Var[] vars, VarSelector varSelector, ValueSelector valueSelector) This method creates a new instance of the default search strategy, resets its vars, varSelector, and valueSelector, and then adds this strategy to the end of the strategy execution list.
Solution	AbstractSolver.findOptimalSolution(Objective objective, Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar,OptimizationStrategy.NATIVE) It is usually overridden by an implementation.
Solution	AbstractSolver.findOptimalSolution(Objective objective, Var objectiveVar, OptimizationStrategy optStrategy) This method attempts to find the solution that minimizes/maximizes the objective variable.
Solution	AbstractSolver.findOptimalSolution(Var objectiveVar) This method is equivalent to findOptimalSolution(Objective.MINIMIZE,objectiveVar)
Solution	AbstractSolver.findOptimalSolutionBasic(Objective objective, Var objectiveVar) This method is similar to findOptimalSolution(Objective objective, Var objectiveVar) but uses the common (no solver-specific) implementation
Solution	AbstractSolver.findOptimalSolutionDichotomize(Objective objective, Var objectiveVar) The actual minimization algorithm executes a dichotomized search.
Solution	AbstractSolver.findOptimalSolutionDichotomize(Var objectiveVar) This method is equivalent to findOptimalSolutionCommon(Objective.MINIMIZE,objectiveVar)
void	AbstractSolver.setSearchStrategy(Var[] vars) Define a searchStrategy that will be used by find solutions methods.
void	AbstractSolver.setSearchStrategy(Var[] vars, ValueSelector valueSelector) Define a searchStrategy that will be used by find solutions methods.
void	AbstractSolver.setSearchStrategy(Var[] vars, VarSelector varSelector) Define a searchStrategy that will be used by find solutions methods.
void	AbstractSolver.setSearchStrategy(Var[] vars, VarSelector varSelector, ValueSelector valueSelector) Define a searchStrategy that will be used by find solutions methods.
void	AbstractSearchStrategy.setVars(Var[] vars)

Constructors in javax.constraints.impl.search with parameters of type Var

StrategyLogVar(java.lang.String text, Var var)

StrategyLogVariables(Var[] vars)

Uses of Var in javax.constraints.impl.search.goal

Methods in javax.constraints.impl.search.goal with parameters of type Var

void	GoalAssignValuesTimeLimit.createGoals(Var[] vars)
Solution	SolverWithGoals.findOptimalSolutionDichotomize(Objective objective, Var objectiveVar) The actual minimization algorithm executes a dichotomized search.
Goal	SolverWithGoals.goalVarEqValue(Var var, int value)
Goal	SolverWithGoals.goalVarGeValue(Var var, int value)
Goal	SolverWithGoals.goalVarLeValue(Var var, int value)
Goal	SolverWithGoals.goalVarNeqValue(Var var, int value)
void	GoalAssignValuesTimeLimit.init(Var[] vars, VarSelector varSelector, ValueSelector valueSelector)
void	GoalAssignValues.setGoals(Var[] vars)
void	GoalAssignValuesTimeLimit.setVars(Var[] vars)
void	GoalAssignValues.setVars(Var[] vars)
void	SolverWithGoals.trace(Var var) This method forces to trace (to log) all modification events for the variable "var".
void	SolverWithGoals.trace(Var[] vars) This method forces to trace (to log) all modification events for all variables "vars"
void	SolverWithGoals.trace(Var[] vars, PropagationEvent event) This method forces solver to trace (to log) the modification "event" for all variables "var".
void	SolverWithGoals.trace(Var var, PropagationEvent event) This method forces to trace (to log) the modification "event" for the variable "var".

Constructors in javax.constraints.impl.search.goal with parameters of type Var

Dichotomize(SolverWithGoals solver, Var objective)

GoalAddSolution(Solver solver, int solutionNumber, Var objective)

GoalAddSolution(Solver solver, Var objective)

GoalAssignValue(Var var)

GoalAssignValue(Var var, ValueSelector valueSelector)

GoalAssignValues(Solver solver, Var[] vars)

GoalAssignValues(Var[] vars, VarSelector varSelector)
This is equivalent to GoalAssignValues(vars,varSelector,new ValueSelectorMin());

GoalAssignValues(Var[] vars, VarSelector varSelector, ValueSelector valueSelector)
Creates a Goal that instantiates (assign values to) all variables inside the array "vars".

GoalAssignValuesTimeLimit(Solver solver, Var[] vars)

GoalAssignValuesTimeLimit(Var[] vars, VarSelector varSelector, ValueSelector valueSelector)

GoalAssignValueTimeLimit(Var var, ValueSelector valueSelector)

GoalLog(java.lang.String text, Var var)

GoalLog(java.lang.String text, Var[] vars)

GoalLog(Var var)

GoalLog(Var[] vars)

Uses of Var in javax.constraints.impl.search.selectors

Methods in javax.constraints.impl.search.selectors that return Var

Var[]

AbstractVarSelector.getVars()

Methods in javax.constraints.impl.search.selectors with parameters of type Var

int	ValueSelectorMinMaxAlternate.select(Var var)
int	ValueSelectorMin.select(Var var)
int	ValueSelectorMax.select(Var var)