Package | Description |
---|---|
org.jacop.constraints | |
org.jacop.floats.constraints | |
org.jacop.floats.constraints.linear | |
org.jacop.floats.search | |
org.jacop.search | |
org.jacop.set.constraints |
Modifier and Type | Class and Description |
---|---|
class |
AbsXeqY
Constraints |X| #= Y
Domain and bounds consistency can be used; third parameter of constructor controls this.
|
class |
And
Constraint c1 /\ c2 ...
|
class |
AndBool
If all x's are equal 1 then result variable is equal 1 too.
|
class |
Distance
Constraint |X - Y| #= Z
|
class |
Eq
Constraint "constraint1" #<=> "constraint2"
|
class |
EqBool
If all x's are equal to each other then result variable is equal 1.
|
class |
IfThen
Constraint if constraint1 then constraint2
|
class |
IfThenBool
Constraint ( X => Y ) <=> Z.
|
class |
IfThenElse
Constraint if constraint1 then constraint2 else constraint3
*
|
class |
In
Constraints X to belong to a specified domain.
|
class |
NoGood
NoGood constraints implements a constraint which disallows given combination
of values for given variables.
|
class |
Not
Constraint "not costraint"
|
class |
Or
Constraint c1 \/ c2 \/ ...
|
class |
OrBool
If at least one variable from the list is equal 1 then result variable is equal 1 too.
|
class |
XeqC
Constraints X #= C
Domain consistency is used.
|
class |
XeqY
Constraints X #= Y
Domain consistency is used.
|
class |
XgtC
Constraint X #> C
|
class |
XgteqC
Constraints X #>= C
|
class |
XgteqY
Constraints X #>= Y
|
class |
XgtY
Constraint X #> Y
|
class |
XltC
Constraint X #< C
|
class |
XlteqC
Constraint X #<= C
|
class |
XlteqY
Constraint X #<= Y
|
class |
XltY
Constraint X #< Y
|
class |
XmulCeqZ
Constraint X * C #= Z
Boundary consistency is used.
|
class |
XmulYeqC
Constraint X * Y #= C
Boundary consistency is used.
|
class |
XneqC
Constraints X #\= C
|
class |
XneqY
Constraints X #\= Y
Domain consistency is used.
|
class |
Xor
Xor constraint - xor("constraint", B).
|
class |
XorBool
Constraint ( x_0 xor x_1 xor ...
|
class |
XplusCeqZ
Constraint X + C #= Z.
|
class |
XplusClteqZ
Constraints X + C #<= Z.
|
class |
XplusYeqC
Constraint X + Y #= C
|
class |
XplusYeqZ
Constraint X + Y #= Z
Bound consistency is used.
|
class |
XplusYgtC
Constraint X + Y #> C
|
class |
XplusYlteqZ
Constraint X + Y =< Z
Bound consistency is used.
|
class |
XplusYplusCeqZ
Constraints X + Y + C #= Z.
|
class |
XplusYplusQeqZ
Constraint X + Y + Q = Z
Bound consistency is used.
|
class |
XplusYplusQgtC
Constraint X + Y + Q > C
|
Modifier and Type | Field and Description |
---|---|
PrimitiveConstraint |
Reified.c
It specifies constraint c which status is being checked.
|
PrimitiveConstraint |
Xor.c
It specifies constraint c, which status must satisfy xor relationship with variable b.
|
PrimitiveConstraint |
Not.c
It specifies the constraint which negation is being created.
|
PrimitiveConstraint |
Eq.c1
It specifies the first constraint which status must be equivalent to the status of the second constraint.
|
PrimitiveConstraint |
Eq.c2
It specifies the second constraint which status must be equivalent to the status of the first constraint.
|
PrimitiveConstraint |
IfThenElse.condC
It specifies constraint condC in the IfThenElse constraint.
|
PrimitiveConstraint |
IfThen.condC
It specifies constraint condC in the IfThen constraint.
|
PrimitiveConstraint |
IfThenElse.elseC
It specifies constraint elseC in the IfThenElse constraint.
|
PrimitiveConstraint[] |
Or.listOfC
It specifies a list of constraints from which one constraint must be satisfied.
|
PrimitiveConstraint[] |
And.listOfC
It specifies a list of constraints which must be satisfied to keep And constraint satisfied.
|
PrimitiveConstraint |
IfThenElse.thenC
It specifies constraint condC in the IfThenElse constraint.
|
PrimitiveConstraint |
IfThen.thenC
It specifies constraint condC in the IfThen constraint.
|
Constructor and Description |
---|
And(PrimitiveConstraint[] c)
It constructs an And constraint over an array of primitive constraints.
|
And(PrimitiveConstraint c1,
PrimitiveConstraint c2)
It constructs a simple And constraint based on two primitive constraints.
|
Eq(PrimitiveConstraint c1,
PrimitiveConstraint c2)
It constructs equality constraint between two constraints.
|
IfThen(PrimitiveConstraint condC,
PrimitiveConstraint thenC)
It constructs ifthen constraint.
|
IfThenElse(PrimitiveConstraint condC,
PrimitiveConstraint thenC,
PrimitiveConstraint elseC)
It creates ifthenelse constraint.
|
Not(PrimitiveConstraint c)
It constructs not constraint.
|
Or(PrimitiveConstraint[] listOfC)
It constructs Or constraint.
|
Or(PrimitiveConstraint c1,
PrimitiveConstraint c2)
It constructs an Or constraint, at least one constraint has to be satisfied.
|
Reified(PrimitiveConstraint c,
IntVar b)
It creates Reified constraint.
|
Xor(PrimitiveConstraint c,
IntVar b)
It constructs a xor constraint.
|
Constructor and Description |
---|
And(ArrayList<PrimitiveConstraint> listOfC)
It constructs an And constraint based on primitive constraints.
|
Or(ArrayList<PrimitiveConstraint> listOfC)
It constructs Or constraint.
|
Modifier and Type | Class and Description |
---|---|
class |
LinearFloat
LinearFloat constraint implements the weighted summation over several
Variable's .
|
class |
PeqC
Constraints P #= C
Domain consistency is used.
|
class |
PeqQ
Constraints P #= Q for P and Q floats
Domain consistency is used.
|
class |
PgtC
Constraint P #> C
|
class |
PgteqC
Constraints P #>= C for floats
|
class |
PgteqQ
Constraints P >= Q for floats
|
class |
PgtQ
Constraint P > Q for floats
|
class |
PltC
Constraint P #< C for floats
|
class |
PlteqC
Constraint X #<= C for floats
|
class |
PlteqQ
Constraint P <= Q for floats
|
class |
PltQ
Constraint P < Q for floats
|
class |
PminusCeqR
Constraint P - C = R
Bound consistency is used.
|
class |
PminusQeqR
Constraint P - Q = R
Bound consistency is used.
|
class |
PneqC
Constraints P != C
Domain consistency is used.
|
class |
PneqQ
Constraints P #= Q for P and Q floats
Domain consistency is used.
|
class |
PplusCeqR
Constraint P + C #= R
Bound consistency is used.
|
class |
PplusQeqR
Constraint P + Q = R
Bound consistency is used.
|
Modifier and Type | Class and Description |
---|---|
class |
Linear
Linear constraint implements the weighted summation over several
Variable's .
|
Modifier and Type | Method and Description |
---|---|
PrimitiveConstraint |
SplitSelectFloat.getChoiceConstraint(int index) |
Modifier and Type | Method and Description |
---|---|
PrimitiveConstraint |
SimpleMatrixSelect.getChoiceConstraint(int index)
It always returns null as choice point is obtained by getChoiceVariable
and getChoiceValue.
|
PrimitiveConstraint |
RandomSelect.getChoiceConstraint(int index)
It always returns null as choice point is obtained by getChoiceVariable
and getChoiceValue.
|
PrimitiveConstraint |
SplitSelect.getChoiceConstraint(int index) |
PrimitiveConstraint |
SelectChoicePoint.getChoiceConstraint(int index)
It returns the constraint which is the base of the choice point.
|
PrimitiveConstraint |
TraceGenerator.getChoiceConstraint(int index) |
PrimitiveConstraint |
InputOrderSelect.getChoiceConstraint(int index)
It always returns null as choice point is obtained by getChoiceVariable
and getChoiceValue.
|
PrimitiveConstraint |
SimpleSelect.getChoiceConstraint(int index)
It always returns null as choice point is obtained by getChoiceVariable
and getChoiceValue.
|
PrimitiveConstraint[] |
SolutionListener.returnSolution()
It returns a collection of constraints which represent the last found
solution.
|
PrimitiveConstraint[] |
SimpleSolutionListener.returnSolution() |
PrimitiveConstraint[] |
SimpleSolutionListener.returnSolution(int number)
It returns the solution with the given number (value 0 denotes the first solution) as
a set of primitive constraints.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Shaving.leftChild(PrimitiveConstraint choice,
boolean status) |
boolean |
NoGoodsCollector.leftChild(PrimitiveConstraint choice,
boolean status) |
boolean |
ExitChildListener.leftChild(PrimitiveConstraint choice,
boolean status)
It is executed after exiting the left child.
|
boolean |
LDS.leftChild(PrimitiveConstraint choice,
boolean status)
It is executed after exiting the left child.
|
boolean |
CreditCalculator.leftChild(PrimitiveConstraint choice,
boolean status)
It is executed after exiting the left child.
|
boolean |
TraceGenerator.leftChild(PrimitiveConstraint choice,
boolean status) |
void |
Shaving.rightChild(PrimitiveConstraint choice,
boolean status) |
void |
NoGoodsCollector.rightChild(PrimitiveConstraint choice,
boolean status) |
void |
ExitChildListener.rightChild(PrimitiveConstraint choice,
boolean status)
It is executed after exiting the right child.
|
void |
LDS.rightChild(PrimitiveConstraint choice,
boolean status) |
void |
CreditCalculator.rightChild(PrimitiveConstraint choice,
boolean status) |
void |
TraceGenerator.rightChild(PrimitiveConstraint choice,
boolean status) |
Modifier and Type | Class and Description |
---|---|
class |
AeqB
It creates an equality constraint to make sure that two set variables
have the same value.
|
class |
AeqS
It creates an equality constraint to make sure that a set variable
is equal to a given set.
|
class |
AinB
It creates a constraint that makes sure that the set value of set variable A is included
in the set value of set variable B.
|
class |
AinS
It creates a constraint that makes sure that value of the variable A is included within
a provided set.
|
class |
EinA
It constructs a constraint which makes sure that a given element is
in the domain of the set variable.
|
class |
SinA
It creates an inclusion set constraint to make sure that provided set is
included in a set variable a.
|
class |
XeqA
It creates a constraint that makes sure that the value assigned to the integer variable x
is the only element of the set assigned to a set variable a.
|
class |
XinA
It creates a constraint that makes sure that the value assigned to integer variable x is
included in the set assigned to the set variable a.
|
Copyright © 2015. All rights reserved.