Modifier and Type | Field and Description |
---|---|
IntVar |
Reified.b
It specifies variable b which stores status of the constraint (0 - for certain not satisfied, 1 - for certain satisfied).
|
IntVar |
Xor.b
It specifies variable b, which boolean status must satisfy xor relationship with status of constraint c.
|
IntVar |
SoftGCC.costVar |
IntVar |
SoftAlldifferent.costVar |
IntVar |
Count.counter
It specifies variable counter to count the number of occurences of the specified value in a list.
|
IntVar[] |
GCC.counters
It species variables counters for counting occurences of each possible value from the
intial domain of x variables.
|
IntVar[] |
Assignment.d
It specifies a list of variables d.
|
IntVar[] |
Cumulative.durations
It specifies/stores duration variables for each corresponding task.
|
IntVar[] |
SoftGCC.hardCounters |
IntVar |
ElementVariable.index
It specifies variable index within an element constraint list[index - indexOffset] = value.
|
IntVar |
ElementInteger.index
It specifies variable index within an element constraint list[index-indexOffset] = value.
|
IntVar[] |
Rectangle.length
It specifies the length of the rectangle in each dimension.
|
IntVar |
Cumulative.limit
It specifies the limit of the profile of cumulative use of resources.
|
IntVar[] |
ElementVariable.list
It specifies list of variables within an element constraint list[index - indexOffset] = value.
|
IntVar[] |
Alldifferent.list
It specifies a list of variables which must take different values.
|
IntVar[] |
ExtensionalConflictVA.list
It stores variables within this extensional constraint, order does
matter.
|
IntVar[] |
Max.list
It specifies a list of variables among which a maximum value is being searched for.
|
IntVar[] |
AndBool.list
It specifies a list of variables which all must be equal to 1 to set result variable to 1.
|
IntVar[] |
Count.list
The list of variables which are checked and counted if equal to specified value.
|
IntVar[] |
Among.list
It specifies the list of variables whose values are checked.
|
IntVar[] |
Sum.list
It specifies the variables to be summed.
|
IntVar[] |
Linear.list
It specifies a list of variables being summed.
|
IntVar[] |
SumWeightDom.list
It specifies a list of variables being summed.
|
IntVar[] |
SumWeight.list
It specifies a list of variables being summed.
|
IntVar[] |
OrBool.list
It specifies a list of variables among which one must be equal to 1 to set result variable to 1.
|
IntVar[] |
ExtensionalSupportSTR.list
It stores variables within this extensional constraint, order does
matter.
|
IntVar[] |
Min.list
It specifies a list of variables among which the minimum value is being searched for.
|
IntVar[] |
EqBool.list
It specifies x variables in the constraint.
|
IntVar[] |
Alldistinct.list
It specifies all variables which have to have different values.
|
IntVar[] |
ExtensionalSupportVA.list
It stores variables within this extensional constraint, order does
matter.
|
protected IntVar[] |
Alldiff.listAlldiff |
IntVar[] |
NoGood.listOfVars
It specifies a list of variables in no-good constraint.
|
IntVar[] |
AmongVar.listOfX
List of variables x which values are checked against values of variables y.
|
IntVar[] |
AmongVar.listOfY
It specifies what values we are counting in the list of x's.
|
IntVar |
Max.max
It specifies variable max which stores the maximum value present in the list.
|
IntVar |
Min.min
It specifies variable min, which stores the minimum value within the whole list.
|
IntVar |
AmongVar.n
It specifies the number of x variables equal to at least one value present in the list of y.
|
IntVar |
Among.n
It is a counter variable.
|
IntVar[] |
Rectangle.origin
It specifies the origin of the rectangle in each dimension.
|
IntVar |
XplusYplusQgtC.q
It specifies variable q in constraint x+y+q > c.
|
IntVar |
XplusYplusQeqZ.q
It specifies variable q in constraint x + y + q = z.
|
IntVar[] |
Cumulative.resources
It specifies/stores resource variable for each corresponding task.
|
IntVar |
AndBool.result
It specifies variable result, storing the result of and function performed a list of variables.
|
IntVar |
OrBool.result
It specifies variable result, storing the result of or function performed a list of variables.
|
IntVar |
EqBool.result
It specifies variable result in the constraint.
|
IntVar[] |
SoftGCC.softCounters |
IntVar[] |
Cumulative.starts
It specifies/stores start variables for each corresponding task.
|
IntVar |
Sum.sum
It specifies variable sum to store the overall sum of the variables being summed up.
|
IntVar |
SumWeight.sum
It specifies variable for the overall sum.
|
IntVar |
ElementVariable.value
It specifies variable value within an element constraint list[index - indexOffset] = value.
|
IntVar |
ElementInteger.value
It specifies variable value within an element constraint list[index-indexOffset] = value.
|
IntVar |
XplusYplusQgtC.x
It specifies variable x in constraint x+y+q > c.
|
IntVar |
XmulCeqZ.x
It specifies variable x in constraint x * c = z.
|
IntVar |
XlteqY.x
It specifies variable x in the constraint x <= y.
|
IntVar[] |
GCC.x
It specifies variables x whose values are counted.
|
IntVar |
XgteqY.x
It specifies variable x which must be greater or equal to variable Y.
|
IntVar |
XeqY.x
It specifies a left hand variable in equality constraint.
|
IntVar |
XltY.x
It specifies x variable in constraint x < y.
|
IntVar |
Distance.x
It specifes variable x in constraint |x-y|=z.
|
IntVar |
XmodYeqZ.x
It specifies variable x in constraint x mod y = z.
|
IntVar |
XltC.x
It specifies variable x to be lower than a given constant.
|
IntVar |
AbsXeqY.x
It contains variable x.
|
IntVar |
XgteqC.x
It specifies variables x which must be greater or equal to a given constant.
|
IntVar |
XplusCeqZ.x
It specifies variable x in constraint x+c=z.
|
IntVar |
XplusYplusQeqZ.x
It specifies variable x in constraint x + y + q = z.
|
IntVar[] |
Assignment.x
It specifies a list of variables x.
|
IntVar |
XeqC.x
It specifies the variable which is constrained to be equal to the specified value.
|
IntVar |
XplusYeqZ.x
It specifies variable x in constraint x+y=z.
|
IntVar |
XgtY.x
It specifies variable x which must be greater than variable y.
|
IntVar |
XplusYgtC.x
It specifies variable x in constraint x + y > c.
|
IntVar[] |
XorBool.x
It specifies variables x for the constraint.
|
IntVar |
In.x
It specifies variable x whose domain must lie within a specified domain.
|
IntVar |
XexpYeqZ.x
It specifies the variable x in equation x^y = z.
|
IntVar |
XneqC.x
It specifies variable x in constraint x != c.
|
IntVar |
XneqY.x
It specifies variable x in the constraint x != y.
|
IntVar[] |
LexOrder.x
Two vectors that have to be lexicographically ordered.
|
IntVar[][] |
Lex.x
A two dimensional array containing arrays which have to be lexicographically ordered.
|
IntVar |
XplusClteqZ.x
It specifies variable x in constraint x+c<=z.
|
IntVar |
XplusYeqC.x
It specifies variable x in constraint x+y=c.
|
IntVar |
XmulYeqC.x
It specifies variable x in constraint x * y = c.
|
IntVar |
XlteqC.x
It specifies variable x which must be smaller or equal to a given constant.
|
IntVar |
XdivYeqZ.x
It specifies variable x in constraint x / y = z.
|
IntVar |
XgtC.x
It specifies variable x which must be greater than a given constraint.
|
IntVar |
IfThenBool.x
It specifies variable x in constraint ( X => Y ) <=> Z.
|
IntVar |
XmulYeqZ.x
It specifies variable x in constraint x * y = z.
|
IntVar |
XplusYlteqZ.x
It specifies variable x in constraint x + y <= z.
|
IntVar[] |
SoftGCC.xVars |
IntVar[] |
SoftAlldifferent.xVars |
IntVar |
XplusYplusQgtC.y
It specifies variable y in constraint x+y+q > c.
|
IntVar |
XlteqY.y
It specifies variable y in the constraint x <= y.
|
IntVar |
XgteqY.y
It specifies variable y from which variable x must be greater or equal.
|
IntVar |
XeqY.y
It specifies a right hand variable in equality constraint.
|
IntVar |
XltY.y
It specifies y variable in constraint x < y.
|
IntVar |
Distance.y
It specifes variable y in constraint |x-y|=z.
|
IntVar |
XmodYeqZ.y
It specifies variable y in constraint x mod y = z.
|
IntVar |
AbsXeqY.y
It contains variable y.
|
IntVar |
XplusYplusQeqZ.y
It specifies variable y in constraint x + y + q = z.
|
IntVar |
XplusYeqZ.y
It specifies variable x in constraint x+y=z.
|
IntVar |
XgtY.y
It specifies variable y which must be smaller than variable x.
|
IntVar |
XplusYgtC.y
It specifies variable y in constraint x + y > c.
|
IntVar |
XorBool.y |
IntVar |
XexpYeqZ.y
It specifies the variable y in equation x^y = z.
|
IntVar |
XneqY.y
It specifies variable y in the constraint x != y.
|
IntVar[] |
LexOrder.y |
IntVar |
XplusYeqC.y
It specifies variable y in constraint x+y=c.
|
IntVar |
XmulYeqC.y
It specifies variable y in constraint x * y = c.
|
IntVar |
XdivYeqZ.y
It specifies variable y in constraint x / y = z.
|
IntVar |
IfThenBool.y
It specifies variable y in constraint ( X => Y ) <=> Z.
|
IntVar |
XmulYeqZ.y
It specifies variable y in constraint x * y = z.
|
IntVar |
XplusYlteqZ.y
It specifies variable x in constraint x + y <= z.
|
IntVar |
XmulCeqZ.z
It specifies variable x in constraint x * c = z.
|
IntVar |
Distance.z
It specifes variable z in constraint |x-y|=z.
|
IntVar |
XmodYeqZ.z
It specifies variable z in constraint x mod y = z.
|
IntVar |
XplusCeqZ.z
It specifies variable z in constraint x+c=z.
|
IntVar |
XplusYplusQeqZ.z
It specifies variable z in constraint x + y + q = z.
|
IntVar |
XplusYeqZ.z
It specifies variable x in constraint x+y=z.
|
IntVar |
XexpYeqZ.z
It specifies the variable z in equation x^y = z.
|
IntVar |
XplusClteqZ.z
It specifies variable z in constraint x+c<=z.
|
IntVar |
XdivYeqZ.z
It specifies variable z in constraint x / y = z.
|
IntVar |
IfThenBool.z
It specifies variable z in constraint ( X => Y ) <=> Z.
|
IntVar |
XmulYeqZ.z
It specifies variable z in constraint x * y = z.
|
IntVar |
XplusYlteqZ.z
It specifies variable x in constraint x + y <= z.
|
Modifier and Type | Field and Description |
---|---|
protected ArrayList<IntVar> |
Alldistinct.freeVariablesAtFailure |
protected HashMap<IntVar,Integer> |
Alldifferent.positionMapping |
Constructor and Description |
---|
AbsXeqY(IntVar x,
IntVar y)
It constructs |X| = Y constraints.
|
AbsXeqY(IntVar x,
IntVar y,
boolean domConsistency)
It constructs |X| = Y constraints.
|
Alldiff(IntVar[] variables)
It constructs the alldiff constraint for the supplied variable.
|
Alldifferent(IntVar[] list)
It constructs the alldifferent constraint for the supplied variable.
|
Alldistinct(IntVar[] list)
It constructs an alldistinct constraint.
|
Among(ArrayList<IntVar> list,
IntervalDomain kSet,
IntVar n)
It constructs an Among constraint.
|
Among(IntVar[] list,
IntervalDomain kSet,
IntVar n)
It constructs an Among constraint.
|
Among(IntVar[] list,
IntervalDomain kSet,
IntVar n)
It constructs an Among constraint.
|
AmongVar(ArrayList<IntVar> listOfX,
ArrayList<IntVar> listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AmongVar(IntVar[] listOfX,
IntVar[] listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AmongVar(IntVar[] listOfX,
IntVar[] listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AmongVar(IntVar[] listOfX,
IntVar[] listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AndBool(ArrayList<IntVar> list,
IntVar result)
It constructs AndBool.
|
AndBool(IntVar[] list,
IntVar result)
It constructs AndBool.
|
AndBool(IntVar[] list,
IntVar result)
It constructs AndBool.
|
Assignment(IntVar[] xs,
IntVar[] ds)
It constructs an Assignment constraint with shift equal 0.
|
Assignment(IntVar[] xs,
IntVar[] ds)
It constructs an Assignment constraint with shift equal 0.
|
Assignment(IntVar[] xs,
IntVar[] ds,
int min)
It enforces the relationship x[d[i]-min]=i+min and
d[x[i]-min]=i+min.
|
Assignment(IntVar[] xs,
IntVar[] ds,
int min)
It enforces the relationship x[d[i]-min]=i+min and
d[x[i]-min]=i+min.
|
Assignment(IntVar[] xs,
IntVar[] ds,
int shiftX,
int shiftD)
It enforces the relationship x[d[i]-shiftX]=i+shiftD and
d[x[i]-shiftD]=i+shiftX.
|
Assignment(IntVar[] xs,
IntVar[] ds,
int shiftX,
int shiftD)
It enforces the relationship x[d[i]-shiftX]=i+shiftD and
d[x[i]-shiftD]=i+shiftX.
|
Circuit(IntVar[] list)
It constructs a circuit constraint.
|
Count(ArrayList<? extends IntVar> list,
IntVar counter,
int value)
It constructs a Count constraint.
|
Count(IntVar[] list,
IntVar counter,
int value)
It constructs a Count constraint.
|
Count(IntVar[] list,
IntVar counter,
int value)
It constructs a Count constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding,
boolean profile)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile,
boolean setLimit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile,
boolean setLimit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile,
boolean setLimit)
It creates a cumulative constraint.
|
Cumulative(IntVar[] starts,
IntVar[] durations,
IntVar[] resources,
IntVar limit,
boolean doEdgeFinding,
boolean doProfile,
boolean setLimit)
It creates a cumulative constraint.
|
Diff(IntVar[][] rectangles)
It specifies a diff constraint.
|
Diff(IntVar[][] rectangles,
boolean profile)
It specifies a diff constraint.
|
Diff(IntVar[] origin1,
IntVar[] origin2,
IntVar[] length1,
IntVar[] length2)
It constructs a diff constraint.
|
Diff(IntVar[] origin1,
IntVar[] origin2,
IntVar[] length1,
IntVar[] length2)
It constructs a diff constraint.
|
Diff(IntVar[] origin1,
IntVar[] origin2,
IntVar[] length1,
IntVar[] length2)
It constructs a diff constraint.
|
Diff(IntVar[] origin1,
IntVar[] origin2,
IntVar[] length1,
IntVar[] length2)
It constructs a diff constraint.
|
Diff(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It constructs a diff constraint.
|
Diff(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It constructs a diff constraint.
|
Diff(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It constructs a diff constraint.
|
Diff(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It constructs a diff constraint.
|
Diff2(IntVar[][] rectangles)
It creates a diff2 constraint.
|
Diff2(IntVar[][] rect,
ArrayList<ArrayList<Integer>> exclusive)
Conditional Diff2.
|
Diff2(IntVar[][] rectangles,
boolean profile)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(IntVar[][] rectangles,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(Store store,
IntVar[][] rectangles)
It creates a diff2 constraint.
|
DisjointConditional(IntVar[][] rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It creates Disjoint conditional constraint.
|
DisjointConditional(IntVar[][] rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It creates Disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
Distance(IntVar x,
IntVar y,
IntVar z) |
Element(IntVar index,
ArrayList<? extends IntVar> variables,
IntVar value)
It constructs element constraint based on variables.
|
Element(IntVar index,
ArrayList<? extends IntVar> variables,
IntVar value,
int shift)
It constructs element constraint based on variables.
|
Element(IntVar index,
int[] values,
IntVar value)
It constructs element constraint based on variables.
|
Element(IntVar index,
int[] values,
IntVar value,
int shift)
It constructs element constraint based on variables.
|
Element(IntVar index,
IntVar[] variables,
IntVar value) |
Element(IntVar index,
IntVar[] variables,
IntVar value) |
Element(IntVar index,
IntVar[] variables,
IntVar value,
int shift)
It constructs element constraint based on variables.
|
Element(IntVar index,
IntVar[] variables,
IntVar value,
int shift)
It constructs element constraint based on variables.
|
ElementInteger(IntVar index,
ArrayList<Integer> list,
IntVar value)
It constructs an element constraint with default indexOffset equal 0.
|
ElementInteger(IntVar index,
ArrayList<Integer> list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
ElementInteger(IntVar index,
int[] list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
ElementVariable(IntVar index,
ArrayList<? extends IntVar> list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
ElementVariable(IntVar index,
IntVar[] list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
ElementVariable(IntVar index,
IntVar[] list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
EqBool(ArrayList<? extends IntVar> list,
IntVar result)
It constructs eqBool.
|
EqBool(IntVar[] list,
IntVar result)
It constructs eqBool.
|
EqBool(IntVar[] list,
IntVar result)
It constructs eqBool.
|
ExtensionalConflictVA(IntVar[] list)
Partial constructor which stores variables involved in a constraint but
does not get information about tuples yet.
|
ExtensionalConflictVA(IntVar[] list,
int[][] tuples)
Constructor stores reference to tuples until imposition, any changes to
tuples parameter will be reflected in the constraint behavior.
|
ExtensionalSupportMDD(IntVar[] vars,
int[][] table)
It constructs extensional support constraint.
|
ExtensionalSupportSTR(IntVar[] list,
boolean reinsertBefore,
boolean residuesBefore)
Partial constructor which stores variables involved in a constraint but
does not get information about tuples yet.
|
ExtensionalSupportSTR(IntVar[] variables,
int[][] tuples)
It creates an extensional constraint.
|
ExtensionalSupportSTR(IntVar[] list,
int[][] tuples,
boolean reinsertBefore,
boolean residuesBefore)
It constructs an extensional constraint.
|
ExtensionalSupportVA(IntVar[] list)
Partial constructor which stores variables involved in a constraint but
does not get information about tuples yet.
|
ExtensionalSupportVA(IntVar[] variables,
int[][] tuples)
Constructor stores reference to tuples until imposition, any changes to
tuples parameter will be reflected in the constraint behavior.
|
GCC(IntVar[] x,
IntVar[] counters)
It constructs global cardinality constraint.
|
GCC(IntVar[] x,
IntVar[] counters)
It constructs global cardinality constraint.
|
IfThenBool(IntVar x,
IntVar y,
IntVar z)
It constructs constraint ( X => Y ) <=> Z.
|
In(IntVar x,
IntDomain dom)
It constructs an In constraint to restrict the domain of the variable.
|
Lex(IntVar[][] x)
It creates a lexicographical order for vectors x[i], i.e.
|
Lex(IntVar[][] x,
boolean lt) |
LexOrder(IntVar[] x,
IntVar[] y)
It creates a lexicographical order for vectors x and y,
vectors x and does not need to be of the same size.
|
LexOrder(IntVar[] x,
IntVar[] y)
It creates a lexicographical order for vectors x and y,
vectors x and does not need to be of the same size.
|
LexOrder(IntVar[] x,
IntVar[] y,
boolean lt) |
LexOrder(IntVar[] x,
IntVar[] y,
boolean lt) |
Linear(Store store,
IntVar[] list,
int[] weights,
String rel,
int sum) |
Max(ArrayList<? extends IntVar> variables,
IntVar max)
It constructs max constraint.
|
Max(IntVar[] list,
IntVar max)
It constructs max constraint.
|
Max(IntVar[] list,
IntVar max)
It constructs max constraint.
|
Min(ArrayList<? extends IntVar> list,
IntVar min)
It constructs min constraint.
|
Min(IntVar[] list,
IntVar min)
It constructs min constraint.
|
Min(IntVar[] list,
IntVar min)
It constructs min constraint.
|
NoGood(IntVar[] listOfVars,
int[] listOfValues)
It creates a no-good constraint.
|
OrBool(ArrayList<? extends IntVar> list,
IntVar result)
It constructs orBool.
|
OrBool(IntVar[] list,
IntVar result)
It constructs orBool.
|
OrBool(IntVar[] list,
IntVar result)
It constructs orBool.
|
Rectangle(IntVar[] list)
It constructs a rectangle.
|
Rectangle(IntVar[] length,
IntVar[] origin)
It constructs a rectangle.
|
Rectangle(IntVar[] length,
IntVar[] origin)
It constructs a rectangle.
|
Reified(PrimitiveConstraint c,
IntVar b)
It creates Reified constraint.
|
Sequence(IntVar[] list,
IntervalDomain set,
int q,
int min,
int max)
It creates a Sequence constraint.
|
SoftAlldifferent(IntVar[] xVars,
IntVar costVar,
ViolationMeasure violationMeasure) |
SoftAlldifferent(IntVar[] xVars,
IntVar costVar,
ViolationMeasure violationMeasure) |
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
int[] hardLowerBound,
int[] hardUpperBound,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] softLowerBound,
int[] softUpperBound,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
int[] countedValue,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
SoftGCC(IntVar[] xVars,
IntVar[] hardCounters,
IntVar[] softCounters,
IntVar costVar,
ViolationMeasure violationMeasure)
It specifies soft-GCC constraint.
|
Stretch(int[] values,
int[] min,
int[] max,
IntVar[] x)
It creates a Stretch constraint.
|
Subcircuit(IntVar[] list)
It constructs a circuit constraint.
|
Sum(ArrayList<? extends IntVar> list,
IntVar sum)
It creates a sum constraints which sums all variables and makes it equal to variable sum.
|
Sum(IntVar[] list,
IntVar sum)
It constructs sum constraint which sums all variables and makes it equal to variable sum.
|
Sum(IntVar[] list,
IntVar sum)
It constructs sum constraint which sums all variables and makes it equal to variable sum.
|
SumWeight(ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
IntVar sum)
It constructs the constraint SumWeight.
|
SumWeight(IntVar[] list,
int[] weights,
IntVar sum) |
SumWeight(IntVar[] list,
int[] weights,
IntVar sum) |
SumWeightDom(ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
IntVar sum)
It constructs the constraint SumWeightDom.
|
SumWeightDom(IntVar[] list,
int[] weights,
int sum) |
SumWeightDom(IntVar[] list,
int[] weights,
IntVar sum) |
SumWeightDom(IntVar[] list,
int[] weights,
IntVar sum) |
Values(ArrayList<? extends IntVar> list,
IntVar count)
It constructs Values constraint.
|
Values(IntVar[] list,
IntVar count)
It constructs Values constraint.
|
Values(IntVar[] list,
IntVar count)
It constructs Values constraint.
|
XdivYeqZ(IntVar x,
IntVar y,
IntVar z)
It constructs a constraint X div Y = Z.
|
XeqC(IntVar x,
int c)
It constructs the constraint X = C.
|
XeqY(IntVar x,
IntVar y)
It constructs constraint X = Y.
|
XexpYeqZ(IntVar x,
IntVar y,
IntVar z)
It constructs constraint X^Y=Z.
|
XgtC(IntVar x,
int c)
It constructs constraint X > C.
|
XgteqC(IntVar x,
int c)
It constructs constraint X >= C.
|
XgteqY(IntVar x,
IntVar y)
It constructs constraint X >= Y.
|
XgtY(IntVar x,
IntVar y)
It constructs a constraint X > Y.
|
XltC(IntVar x,
int c)
It constructs constraint X < C.
|
XlteqC(IntVar x,
int c)
It constructs constraint X <= C.
|
XlteqY(IntVar x,
IntVar y)
It constructs the constraint X <= Y.
|
XltY(IntVar x,
IntVar y)
It constructs the constraint X < Y.
|
XmodYeqZ(IntVar x,
IntVar y,
IntVar z)
It constructs a constraint X mod Y = Z.
|
XmulCeqZ(IntVar x,
int c,
IntVar z)
It constructs a constraint X * C = Z.
|
XmulYeqC(IntVar x,
IntVar y,
int c)
It constructs constraint X * Y = C.
|
XmulYeqZ(IntVar x,
IntVar y,
IntVar z)
It constructs a constraint X * Y = Z.
|
XneqC(IntVar x,
int c)
It constructs x != c constraint.
|
XneqY(IntVar x,
IntVar y)
It constructs X != Y constraint.
|
Xor(PrimitiveConstraint c,
IntVar b)
It constructs a xor constraint.
|
XorBool(IntVar[] x,
IntVar y)
It constructs constraint (x_0 xor x_1 xor ...
|
XorBool(IntVar[] x,
IntVar y)
It constructs constraint (x_0 xor x_1 xor ...
|
XplusCeqZ(IntVar x,
int c,
IntVar z)
It constructs a constraint x+c=z.
|
XplusClteqZ(IntVar x,
int c,
IntVar z)
It constructs constraint X+C<=Z.
|
XplusYeqC(IntVar x,
IntVar y,
int c)
It constructs the constraint X+Y=C.
|
XplusYeqZ(IntVar x,
IntVar y,
IntVar z)
It constructs constraint X+Y=Z.
|
XplusYgtC(IntVar x,
IntVar y,
int c)
It constructs X+Y>C constraint.
|
XplusYlteqZ(IntVar x,
IntVar y,
IntVar z)
It constructs X + Y <= Z constraint.
|
XplusYplusCeqZ(IntVar x,
IntVar y,
int c,
IntVar z)
It constructs constraint X+Y+C=Z.
|
XplusYplusQeqZ(IntVar x,
IntVar y,
IntVar q,
IntVar z)
It constructs X+Y+Q=Z constraint.
|
XplusYplusQgtC(IntVar x,
IntVar y,
IntVar q,
int c)
It creates X+Y+Q>=C constraint.
|
Constructor and Description |
---|
Alldiff(ArrayList<? extends IntVar> variables)
It constructs the alldiff constraint for the supplied variable.
|
Alldifferent(ArrayList<? extends IntVar> variables)
It constructs the alldifferent constraint for the supplied variable.
|
Alldistinct(ArrayList<? extends IntVar> list)
It constructs an alldistinct constraint.
|
Among(ArrayList<IntVar> list,
IntervalDomain kSet,
IntVar n)
It constructs an Among constraint.
|
AmongVar(ArrayList<IntVar> listOfX,
ArrayList<IntVar> listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AmongVar(ArrayList<IntVar> listOfX,
ArrayList<IntVar> listOfY,
IntVar n)
It constructs an AmongVar constraint.
|
AndBool(ArrayList<IntVar> list,
IntVar result)
It constructs AndBool.
|
Assignment(ArrayList<? extends IntVar> xs,
ArrayList<? extends IntVar> ds)
It constructs an Assignment constraint with shift equal 0.
|
Assignment(ArrayList<? extends IntVar> xs,
ArrayList<? extends IntVar> ds)
It constructs an Assignment constraint with shift equal 0.
|
Assignment(ArrayList<? extends IntVar> xs,
ArrayList<? extends IntVar> ds,
int shiftX,
int shiftD)
It enforces the relationship x[d[i]-shiftX]=i+shiftD and
d[x[i]-shiftD]=i+shiftX.
|
Assignment(ArrayList<? extends IntVar> xs,
ArrayList<? extends IntVar> ds,
int shiftX,
int shiftD)
It enforces the relationship x[d[i]-shiftX]=i+shiftD and
d[x[i]-shiftD]=i+shiftX.
|
Circuit(ArrayList<IntVar> list)
It constructs a circuit constraint.
|
Count(ArrayList<? extends IntVar> list,
IntVar counter,
int value)
It constructs a Count constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding,
boolean profile)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding,
boolean profile)
It creates a cumulative constraint.
|
Cumulative(ArrayList<? extends IntVar> starts,
ArrayList<? extends IntVar> durations,
ArrayList<? extends IntVar> resources,
IntVar limit,
boolean edgeFinding,
boolean profile)
It creates a cumulative constraint.
|
Diff(ArrayList<? extends ArrayList<? extends IntVar>> rectangles)
It specifies a diffn constraint.
|
Diff(ArrayList<? extends ArrayList<? extends IntVar>> rectangles,
boolean profile)
It specifies a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
boolean profile)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
boolean profile)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
boolean profile)
It constructs a diff constraint.
|
Diff(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
boolean profile)
It constructs a diff constraint.
|
Diff2(ArrayList<? extends ArrayList<? extends IntVar>> rectangles)
It creates a diff2 constraint.
|
Diff2(ArrayList<? extends ArrayList<? extends IntVar>> rectangles,
boolean profile)
It creates a diff2 constraint.
|
Diff2(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Diff2(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Diff2(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Diff2(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Diff2(ArrayList<ArrayList<IntVar>> rect,
ArrayList<ArrayList<Integer>> exclusiveList)
Conditional Diff2.
|
Diff2(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Diff2(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends ArrayList<? extends IntVar>> rectangles)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends ArrayList<? extends IntVar>> rectangles,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Disjoint(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2)
It creates a diff2 constraint.
|
Disjoint(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
Disjoint(ArrayList<IntVar> o1,
ArrayList<IntVar> o2,
ArrayList<IntVar> l1,
ArrayList<IntVar> l2,
boolean profile)
It creates a diff2 constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<? extends IntVar> o1,
ArrayList<? extends IntVar> o2,
ArrayList<? extends IntVar> l1,
ArrayList<? extends IntVar> l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
DisjointConditional(ArrayList<ArrayList<? extends IntVar>> rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It creates Disjoint conditional constraint.
|
DisjointConditional(ArrayList<ArrayList<? extends IntVar>> rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It creates Disjoint conditional constraint.
|
DisjointConditional(ArrayList<ArrayList<? extends IntVar>> rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It creates Disjoint conditional constraint.
|
DisjointConditional(ArrayList<ArrayList<? extends IntVar>> rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It creates Disjoint conditional constraint.
|
DisjointConditional(IntVar[][] rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It creates Disjoint conditional constraint.
|
DisjointConditional(IntVar[][] rectangles,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It creates Disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition)
It constructs a disjoint conditional constraint.
|
DisjointConditional(IntVar[] o1,
IntVar[] o2,
IntVar[] l1,
IntVar[] l2,
ArrayList<ArrayList<Integer>> exceptionIndices,
ArrayList<? extends IntVar> exceptionCondition,
boolean profile)
It constructs a disjoint conditional constraint.
|
Element(IntVar index,
ArrayList<? extends IntVar> variables,
IntVar value)
It constructs element constraint based on variables.
|
Element(IntVar index,
ArrayList<? extends IntVar> variables,
IntVar value,
int shift)
It constructs element constraint based on variables.
|
ElementVariable(IntVar index,
ArrayList<? extends IntVar> list,
IntVar value,
int indexOffset)
It constructs an element constraint.
|
EqBool(ArrayList<? extends IntVar> list,
IntVar result)
It constructs eqBool.
|
ExtensionalConflictVA(ArrayList<? extends IntVar> variables,
int[][] tuples)
The constructor does not create local copy of tuples array.
|
ExtensionalSupportVA(ArrayList<? extends IntVar> variables,
int[][] tuples)
The constructor does not create local copy of tuples array.
|
GCC(ArrayList<? extends IntVar> x,
ArrayList<? extends IntVar> counters)
It constructs global cardinality constraint.
|
GCC(ArrayList<? extends IntVar> x,
ArrayList<? extends IntVar> counters)
It constructs global cardinality constraint.
|
Linear(Store store,
ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
String rel,
int sum)
It constructs the constraint Linear.
|
Max(ArrayList<? extends IntVar> variables,
IntVar max)
It constructs max constraint.
|
Min(ArrayList<? extends IntVar> list,
IntVar min)
It constructs min constraint.
|
NoGood(ArrayList<? extends IntVar> listOfVars,
ArrayList<Integer> listOfValues)
It creates a no-good constraint.
|
OrBool(ArrayList<? extends IntVar> list,
IntVar result)
It constructs orBool.
|
Rectangle(ArrayList<? extends IntVar> list)
It constructs a rectangle.
|
Subcircuit(ArrayList<IntVar> list)
It constructs a circuit constraint.
|
Sum(ArrayList<? extends IntVar> list,
IntVar sum)
It creates a sum constraints which sums all variables and makes it equal to variable sum.
|
SumWeight(ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
IntVar sum)
It constructs the constraint SumWeight.
|
SumWeightDom(ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
int sum)
It constructs the constraint SumWeightDom.
|
SumWeightDom(ArrayList<? extends IntVar> variables,
ArrayList<Integer> weights,
IntVar sum)
It constructs the constraint SumWeightDom.
|
Values(ArrayList<? extends IntVar> list,
IntVar count)
It constructs Values constraint.
|
Modifier and Type | Field and Description |
---|---|
IntVar[] |
Binpacking.load
It specifies a list of variables which define bin load.
|
Constructor and Description |
---|
Binpacking(IntVar[] bin,
IntVar[] load,
int[] w)
It constructs the binpacking constraint for the supplied variable.
|
Binpacking(IntVar[] bin,
IntVar[] load,
int[] w)
It constructs the binpacking constraint for the supplied variable.
|
Constructor and Description |
---|
Binpacking(ArrayList<? extends IntVar> bin,
ArrayList<? extends IntVar> load,
int[] w)
It constructs the binpacking constraint for the supplied variable.
|
Binpacking(ArrayList<? extends IntVar> bin,
ArrayList<? extends IntVar> load,
int[] w)
It constructs the binpacking constraint for the supplied variable.
|
Modifier and Type | Field and Description |
---|---|
IntVar[] |
GeostObject.coords
It specifies the coordinates in k-dimensional space at which the object is fixed.
|
IntVar |
GeostObject.duration
It specifies the duration time of this object.
|
IntVar |
GeostObject.end
It specifies the end time of this object.
|
IntVar |
GeostObject.shapeID
It specifies the possible shape ids to be taken by this object.
|
IntVar |
GeostObject.start
It specifies the start time of this object in time dimension.
|
Constructor and Description |
---|
GeostObject(int no,
IntVar[] coords,
IntVar shapeID,
IntVar start,
IntVar duration,
IntVar end)
It constructs a Geost object with all the attributes needed by the Geost
constraint.
|
GeostObject(int no,
IntVar[] coords,
IntVar shapeID,
IntVar start,
IntVar duration,
IntVar end)
It constructs a Geost object with all the attributes needed by the Geost
constraint.
|
Modifier and Type | Field and Description |
---|---|
IntVar |
Knapsack.knapsackCapacity
This is a finite domain variable to specify the knapsack capacity.
|
IntVar |
Knapsack.knapsackProfit
This is a finite domain variable to specify the knapsack profit.
|
IntVar |
KnapsackItem.quantity
It is a finite domain variable specifying the possible quantity of that item.
|
IntVar |
TreeLeaf.quantity
It specifies the finite domain variable denoting the allowed
quantity of the item,
|
Modifier and Type | Field and Description |
---|---|
HashMap<IntVar,TreeLeaf> |
Knapsack.variableLeafMapping
It specifies mapping from variables into the leaf of the knapsack tree.
|
Modifier and Type | Method and Description |
---|---|
IntVar |
KnapsackItem.getVariable()
t returns quantity variable associated with that item.
|
IntVar |
TreeLeaf.getVariable() |
Constructor and Description |
---|
Knapsack(int[] profits,
int[] weights,
IntVar[] quantity,
IntVar knapsackCapacity,
IntVar knapsackProfit)
It constructs the knapsack constraint.
|
Knapsack(int[] profits,
int[] weights,
IntVar[] quantity,
IntVar knapsackCapacity,
IntVar knapsackProfit)
It constructs the knapsack constraint.
|
Knapsack(KnapsackItem[] items,
IntVar knapsackCapacity,
IntVar knapsackProfit)
It constructs an knapsack constraint.
|
KnapsackItem(IntVar quantity,
int weight,
int profit)
It constructs an item.
|
Tree(KnapsackItem[] items,
HashMap<IntVar,TreeLeaf> varPositionMaping,
TreeLeaf[] leaves,
IntVar zero)
It constructs a tree out of the list of items and creates
proper supporting structures.
|
TreeLeaf(IntVar quantity,
int weight,
int profit,
int positionInTheTree)
It creates a leaf in the tree of items.
|
Constructor and Description |
---|
Tree(KnapsackItem[] items,
HashMap<IntVar,TreeLeaf> varPositionMaping,
TreeLeaf[] leaves,
IntVar zero)
It constructs a tree out of the list of items and creates
proper supporting structures.
|
Modifier and Type | Field and Description |
---|---|
IntVar |
NetworkBuilder.costVariable |
IntVar |
NetworkFlow.costVariable
The cost variable
|
static IntVar |
Arithmetic.NULL_VAR |
IntVar |
DomainStructure.variable |
IntVar |
ArcCompanion.wVar
The FDV for lower and upper cost
|
IntVar |
ArcCompanion.xVar
The FDV for lower and upper capacity
|
Modifier and Type | Field and Description |
---|---|
Map<IntVar,VarHandler> |
NetworkFlow.map
The variables and their handlers
|
Set<IntVar> |
NetworkFlow.queue
The set of queued variables
|
Modifier and Type | Method and Description |
---|---|
ArrayList<IntVar> |
NetworkBuilder.listVariables() |
List<IntVar> |
MultiVarHandler.listVariables() |
List<IntVar> |
DomainStructure.listVariables() |
List<IntVar> |
ArcCompanion.listVariables() |
List<IntVar> |
VarHandler.listVariables() |
Modifier and Type | Method and Description |
---|---|
Arc |
NetworkBuilder.addArc(Node from,
Node to,
int weight,
IntVar xVar) |
Arc |
NetworkBuilder.addArc(Node from,
Node to,
IntVar wVar,
int lowerCapacity,
int upperCapacity) |
Arc |
NetworkBuilder.addArc(Node from,
Node to,
IntVar wVar,
IntVar xVar) |
void |
Arithmetic.addEquation(IntVar[] vars,
int[] coeffs) |
void |
Arithmetic.addEquation(IntVar[] vars,
int[] coeffs,
int constant) |
void |
Arithmetic.addSum(IntVar[] vars,
IntVar sum) |
void |
Arithmetic.addSum(IntVar[] vars,
IntVar sum) |
void |
Arithmetic.addXplusYeqZ(IntVar x,
IntVar y,
IntVar z) |
void |
Arithmetic.addXsubYeqZ(IntVar x,
IntVar y,
IntVar z) |
void |
MultiVarHandler.processEvent(IntVar variable,
MutableNetwork network) |
void |
DomainStructure.processEvent(IntVar variable,
MutableNetwork network) |
void |
ArcCompanion.processEvent(IntVar variable,
MutableNetwork network) |
void |
VarHandler.processEvent(IntVar variable,
MutableNetwork network)
Informs the handler that one of its variable has changed and asks the
handler to update the state of the network accordingly.
|
void |
NetworkBuilder.setCostVariable(IntVar costVariable) |
Node[][] |
NetworkBuilder.valueGraph(IntVar[] vars,
IntDomain[] domains)
Returns two arrays containing the nodes for each variable and the nodes
for each domain, respectively.
|
Constructor and Description |
---|
DomainStructure(IntVar variable,
IntDomain[] domains,
Arc[] arcs) |
DomainStructure(IntVar variable,
IntDomain[] domains,
Arc[] arcs,
DomainStructure.Behavior behavior) |
DomainStructure(IntVar variable,
List<Domain> domList,
List<Arc> arcList)
Creates an S-variable
|
MultiVarHandler(IntVar variable,
VarHandler... handlers) |
NetworkBuilder(IntVar costVariable) |
Modifier and Type | Field and Description |
---|---|
IntVar[] |
Regular.list
Array of the variables of the graph levels
|
Constructor and Description |
---|
Regular(FSM fsm,
IntVar[] list)
Constructor need Store to initialize the time-stamps
|
Modifier and Type | Class and Description |
---|---|
class |
BooleanVar
Defines a variable and related operations on it.
|
Modifier and Type | Method and Description |
---|---|
boolean |
IntVar.eq(IntVar var)
It checks if the domains of variables are equal.
|
void |
IntDomain.inValue(int level,
IntVar var,
int value)
It reduces domain to a single value.
|
Modifier and Type | Field and Description |
---|---|
IntVar[][] |
DeBruijn.binary |
IntVar |
ExampleFD.cost
It specifies the cost function, null if no cost function is used.
|
IntVar[][] |
Kakro.elements |
IntVar[] |
DeBruijn.x |
IntVar[] |
Diet.x |
Modifier and Type | Field and Description |
---|---|
Search<IntVar> |
ExampleFD.search
It specifies the search procedure used by a given example.
|
ArrayList<IntVar> |
Golomb.subs
It contains all differences between all possible pairs of marks.
|
ArrayList<IntVar> |
ExampleFD.vars
It contains all variables used within a specific example.
|
Modifier and Type | Method and Description |
---|---|
Search<IntVar> |
ExampleFD.getSearch()
It returns the search used within an example.
|
ArrayList<IntVar> |
ExampleFD.getSearchVariables()
It returns an array list of variables used to model the example.
|
Modifier and Type | Method and Description |
---|---|
static void |
SurvoPuzzle.printMatrix(IntVar[][] matrix,
int rows,
int cols)
It prints a matrix of variables.
|
static void |
ExampleFD.printMatrix(IntVar[][] matrix,
int rows,
int cols)
It prints a matrix of variables.
|
Modifier and Type | Method and Description |
---|---|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeConstraints(Store store,
Filter filter,
int addNum,
int mulNum)
It creates constraint model for scheduling of filter operations.
|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeConstraintsChain(Store store,
Filter filter,
int addNum,
int mulNum,
int clk)
It creates constraint model for scheduling of filter operation in fashion allowing
chaining of operations within one clock cycle.
|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeConstraintsPipeline(Store store,
Filter filter,
int addNum,
int mulNum)
It creates a model for optimization of scheduling of operations of a given filter.
|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeConstraintsPipeMultiplier(Store store,
Filter filter,
int addNum,
int mulNum)
It creates constraint model for scheduling of filter operation in fashion allowing
pipelining of multiplication operations.
|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeLabelingList(IntVar[] T,
IntVar[] R)
It creates an array of arrays using two arrays.
|
Modifier and Type | Method and Description |
---|---|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeLabelingList(IntVar[] T,
IntVar[] R)
It creates an array of arrays using two arrays.
|
static ArrayList<ArrayList<IntVar>> |
FilterBenchmark.makeLabelingList(IntVar[] T,
IntVar[] R)
It creates an array of arrays using two arrays.
|
Modifier and Type | Field and Description |
---|---|
IntVar[][] |
MUCA.deltasI
For each transition and each good it specifies the
delta change of that good before the transition takes place.
|
IntVar[][] |
MUCA.deltasO
For each transition and each good it specifies the
delta change of that good after the transition takes place.
|
IntVar[] |
MUCA.sum
It specifies the number of goods after the last transition.
|
IntVar[] |
MUCA.transitions
It specifies the sequence of transitions used by an auctioneer.
|
Modifier and Type | Field and Description |
---|---|
ArrayList<IntVar> |
MUCA.bidCosts
For each bidder it specifies variable representing
the cost of the chosen xor bid.
|
Modifier and Type | Field and Description |
---|---|
IntVar[][] |
Nonogram.board
A board to be painted in white/black dots.
|
Modifier and Type | Method and Description |
---|---|
void |
Nonogram.printMatrix(IntVar[][] matrix)
It prints a matrix of variables.
|
Modifier and Type | Field and Description |
---|---|
IntVar |
ExampleSet.cost
It specifies the cost function, null if no cost function is used.
|
Modifier and Type | Method and Description |
---|---|
static void |
ExampleSet.printMatrix(IntVar[][] matrix,
int rows,
int cols)
It prints a matrix of variables.
|
Modifier and Type | Field and Description |
---|---|
IntVar |
ElementFloat.index
It specifies variable index within an element constraint list[index-indexOffset] = value.
|
IntVar |
XeqP.x
It specifies a left hand variable in equality constraint.
|
Constructor and Description |
---|
ElementFloat(IntVar index,
ArrayList<Double> list,
FloatVar value)
It constructs an element constraint with default indexOffset equal 0.
|
ElementFloat(IntVar index,
ArrayList<Double> list,
FloatVar value,
int indexOffset)
It constructs an element constraint.
|
ElementFloat(IntVar index,
double[] list,
FloatVar value)
It constructs an element constraint with indexOffset by default set to 0.
|
ElementFloat(IntVar index,
double[] list,
FloatVar value,
int indexOffset)
It constructs an element constraint.
|
XeqP(IntVar x,
FloatVar p)
It constructs constraint X = P.
|
Modifier and Type | Method and Description |
---|---|
IntVar |
Tables.getVariable(String ident)
It returns the variable of the given identity.
|
IntVar[] |
Tables.getVariableArray(String ident)
It returns the variable array of the given identity.
|
Modifier and Type | Method and Description |
---|---|
void |
Tables.addVariable(String ident,
IntVar var)
It adds a variable with a given identity to the storage.
|
void |
Tables.addVariableArray(String ident,
IntVar[] array)
It adds a variable array to the storage.
|
Modifier and Type | Class and Description |
---|---|
class |
IndomainList<T extends IntVar>
IndomainHierarchical - implements enumeration method based on the selection
of the preferred indomain for each variable.
|
class |
IndomainMax<T extends IntVar>
IndomainMax - implements enumeration method based on the selection of the
maximal value in the domain of the variable.
|
class |
IndomainMedian<T extends IntVar>
IndomainMedian - implements enumeration method based on the selection of the
median value in the domain of FD variable and then right and left values.
|
class |
IndomainMiddle<T extends IntVar>
IndomainMiddle - implements enumeration method based on the selection of the
middle value in the domain of FD variable and then right and left values.
|
class |
IndomainMin<T extends IntVar>
IndomainMin - implements enumeration method based on the selection of the
minimal value in the domain of variable
|
class |
IndomainRandom<T extends IntVar>
IndomainRandom - implements enumeration method based on the selection of the
random value in the domain of FD variable.
|
class |
IndomainSimpleRandom<T extends IntVar>
IndomainRandom - implements enumeration method based on the selection of the
random value in the domain of FD variable.
|
class |
LargestMax<T extends IntVar>
Defines a LargestMax comparator for Variables.
|
class |
LargestMin<T extends IntVar>
Defines a LargestMin comparator for Variables.
|
class |
MaxRegret<T extends IntVar>
Defines a MaxRegret comparator for Variables.
|
class |
NoGoodsCollector<T extends IntVar>
NoGoodCollector collects no-goods from search when timeout has occurred.
|
class |
Shaving<T extends IntVar>
Defines functionality of shaving.
|
class |
SmallestMax<T extends IntVar>
Defines a SmallestMax comparator for Variables.
|
class |
SmallestMin<T extends IntVar>
Defines a SmallestMin comparator for variables.
|
class |
SplitSelect<T extends IntVar>
It is simple and customizable selector of decisions (constraints) which will
be enforced by search.
|
Modifier and Type | Field and Description |
---|---|
ArrayList<IntVar> |
TransformExtensional.variablesTransformationScope
It contains all the information which will become variables in
the scope of the extensional constraint produced by this search
listener.
|
HashSet<IntVar> |
Shaving.varsOfFailedConstraint
It stores the variables of the last failed constraints.
|
Modifier and Type | Method and Description |
---|---|
int |
IndomainMedian.indomain(IntVar var)
It requires IntVar variable.
|
int |
IndomainSimpleRandom.indomain(IntVar var) |
int |
IndomainRandom.indomain(IntVar var) |
int |
IndomainMin.indomain(IntVar var) |
int |
IndomainMiddle.indomain(IntVar var)
It requires IntVar variable.
|
boolean |
Shaving.leftChild(IntVar var,
int value,
boolean status) |
void |
Shaving.rightChild(IntVar var,
int value,
boolean status) |
Constructor and Description |
---|
SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect,
Indomain<T> indomain)
It constructs a simple selection mechanism for choice points.
|
SplitSelect(T[] variables,
ComparatorVariable<T> varSelect,
Indomain<T> indomain)
The constructor to create a simple choice select mechanism.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleImprovementSearch<T extends IntVar>
Defines an interface for defining different methods for selecting next search
decision to be taken.
|
class |
SimpleImprovementSearch.CostListener<T extends IntVar>
Saves the cost produced by a given search
|
Modifier and Type | Field and Description |
---|---|
IntVar |
SGMPCSearch.cost
Cost variable
|
IntVar[] |
SimpleImprovementSearch.vars |
IntVar[] |
SGMPCSearch.vars
Variables for search
|
Constructor and Description |
---|
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost) |
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost) |
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost,
ImproveSolution search) |
SGMPCSearch(Store store,
IntVar[] vars,
IntVar cost,
ImproveSolution search) |
SimpleImprovementSearch(Store store,
IntVar[] vars,
IntVar cost) |
SimpleImprovementSearch(Store store,
IntVar[] vars,
IntVar cost) |
Modifier and Type | Field and Description |
---|---|
IntVar |
CardAeqX.cardinality
It specifies integer variable c specifying the possible cardinality of set variable a.
|
IntVar |
ElementSet.index
It specifies what element from the list of sets is equal to set variable value.
|
IntVar[] |
Match.list
It specifies the list of integer variables which value is being matched against
elements from a set variable a.
|
IntVar |
SumWeightedSet.totalWeight
Integer variable containing the total weight of all elements within a set variable a.
|
IntVar |
XeqA.x
It specifies variable a.
|
IntVar |
XinA.x
It specifies variable a.
|
Constructor and Description |
---|
CardAeqX(SetVar a,
IntVar cardinality)
It constructs a cardinality constraint to restrict the number of elements
in the set assigned to set variable a.
|
ElementSet(IntVar index,
IntDomain[] list,
SetVar value)
It constructs an elementSet constraint to restrict the domains of the variables index and value.
|
ElementSet(IntVar index,
IntDomain[] list,
SetVar value,
int indexOffset)
It constructs a constraint to restrict the domains of the variables index and value.
|
Match(SetVar a,
IntVar[] list)
It constructs a match constraint to connect the value of set variable a
to the values of integer variables provided in the list.
|
SumWeightedSet(SetVar a,
int[] elements,
int[] weights,
IntVar totalWeight)
It constructs a weighted set sum constraint.
|
SumWeightedSet(SetVar a,
int[] weights,
IntVar totalWeight)
It constructs a weighted set sum constraint.
|
SumWeightedSet(SetVar a,
IntVar totalWeight)
It constructs a weighted set sum constraint.
|
XeqA(IntVar x,
SetVar a)
It constructs an XeqA constraint to restrict the domain of the integer variables x and set variable a.
|
XinA(IntVar x,
SetVar a)
It constructs an XinA constraint to restrict the domain of the variables X and A.
|
XinA(IntVar x,
SetVar a,
boolean strict)
It constructs an XinY constraint to restrict the domain of the variables X and Y.
|
Constructor and Description |
---|
PrintSchedule(ArrayList<String> name,
IntVar[] t,
int[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
IntVar[] t,
int[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(String[] name,
IntVar[] t,
int[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(String[] name,
IntVar[] t,
int[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(String[] name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(String[] name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
PrintSchedule(String[] name,
IntVar[] t,
IntVar[] d,
IntVar[] r)
It constructs PrintSchedule object.
|
Constructor and Description |
---|
PrintSchedule(ArrayList<String> name,
ArrayList<? extends IntVar> t,
ArrayList<Integer> d,
ArrayList<? extends IntVar> r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
ArrayList<? extends IntVar> t,
ArrayList<Integer> d,
ArrayList<? extends IntVar> r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
ArrayList<? extends IntVar> t,
int[] d,
ArrayList<? extends IntVar> r)
It constructs PrintSchedule object.
|
PrintSchedule(ArrayList<String> name,
ArrayList<? extends IntVar> t,
int[] d,
ArrayList<? extends IntVar> r)
It constructs PrintSchedule object.
|
Modifier and Type | Field and Description |
---|---|
IntVar[] |
MDD.vars
The ordered list of variables participating in MDD.
|
Modifier and Type | Method and Description |
---|---|
MDD |
MDD.reuse(IntVar[] vars)
If possible it will return an MDD which reuse an array representation
of the current MDD.
|
Constructor and Description |
---|
IndexDomainView(IntVar var,
boolean forceSparse)
It creates an index domain view for a given variable.
|
IndexDomainView(IntVar var,
int[] valuesInFocus)
It creates an index domain view with only given values being in focus
of the index domain view.
|
MDD(IntVar[] vars)
It creates and MDD representation given the list of variables.
|
MDD(IntVar[] vars,
int[][] table)
It creates and MDD representation given the list of variables
and (dis)allowed tuples.
|
MDD(IntVar[] vars,
int[] diagram,
int[] domainLimits)
It creates an MDD.
|
MDD(IntVar[] vars,
int[] minimumDomainLimits,
int[][] table)
It creates and MDD representation given the list of variables
and (dis)allowed tuples.
|
Modifier and Type | Method and Description |
---|---|
MDD |
FSM.transformDirectlyIntoMDD(IntVar[] vars)
It generates one by one tuples allowed by a Regular constraint, which are added
to the MDD being built.
|
MDD |
FSM.transformIntoMDD(IntVar[] vars)
It generates one by one tuples allowed by a Regular constraint, which are added
to the MDD being built.
|
int[][] |
FSM.transformIntoTuples(IntVar[] vars)
It creates an array of tuples representing this Regular context.
|
Copyright © 2015. All rights reserved.