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

class 
And
Constraint c1 /\ c2 ...

class 
AndBoolSimple
If both a and b are equal 1 then result variable is equal 1 too.

class 
AndBoolVector 
class 
AtLeast 
class 
AtMost 
class 
BoolClause
I defines a boolean clause for 0/1 variables x_i and y_i.

class 
Count
Count constraint implements the counting over number of occurrences of
a given value in a list of variables.

class 
CountBounds
CountBounds constraint implements the counting over number of occurrences of
a given value in a list of variables.

class 
CountVar 
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 
Implies 
class 
In
Constraints X to belong to a specified domain.

class 
LinearInt 
class 
LinearIntDom
LinearIntDom constraint implements the weighted summation over several
variables.

class 
Member
Member constraint implements the membership of element e on list x.

class 
Not
Constraint "not costraint"

class 
Or
Constraint c1 \/ c2 \/ ...

class 
OrBoolSimple
If at least one variable is equal 1 then result variable is equal 1 too.

class 
OrBoolVector
If at least one variable from the list is equal 1 then result variable is equal 1 too.

class 
Reified 
class 
SumBool 
class 
SumInt
SumInt constraint implements the summation over several variables.

class 
XeqC 
class 
XeqY
Constraints X #= Y

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 
class 
XmulYeqC
Constraint X * Y #= C

class 
XneqC 
class 
XneqY
Constraints X #\= Y

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

class 
XplusYgtC
Constraint X + Y> C

class 
XplusYlteqZ
Constraint X + Y=< Z

Modifier and Type  Field and Description 

PrimitiveConstraint[] 
Conditional.c
The list of constraints that are to be selected.

PrimitiveConstraint 
Implies.c
It specifies constraint in the Implies constraint.

PrimitiveConstraint 
Not.c
It specifies the constraint which negation is being created.

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 
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 
IfThen.condC
It specifies constraint condC in the IfThen constraint.

PrimitiveConstraint 
IfThenElse.condC
It specifies constraint condC in the IfThenElse constraint.

PrimitiveConstraint 
IfThenElse.elseC
It specifies constraint elseC in the IfThenElse constraint.

protected PrimitiveConstraint[] 
And.listOfC
It specifies a list of constraints which must be satisfied to keep And constraint satisfied.

PrimitiveConstraint[] 
Or.listOfC
It specifies a list of constraints from which one constraint must be satisfied.

PrimitiveConstraint 
IfThen.thenC
It specifies constraint condC in the IfThen constraint.

PrimitiveConstraint 
IfThenElse.thenC
It specifies constraint condC in the IfThenElse constraint.

Modifier and Type  Field and Description 

Set<PrimitiveConstraint> 
Constraint.constraintScope 
QueueForward<PrimitiveConstraint> 
Eq.queueForward 
QueueForward<PrimitiveConstraint> 
IfThen.queueForward 
QueueForward<PrimitiveConstraint> 
IfThenElse.queueForward 
QueueForward<PrimitiveConstraint> 
Or.queueForward 
Modifier and Type  Method and Description 

List<PrimitiveConstraint> 
AndBool.decompose(Store store) 
List<PrimitiveConstraint> 
OrBool.decompose(Store store) 
Modifier and Type  Method and Description 

protected void 
Constraint.setConstraintScope(PrimitiveConstraint... primitiveConstraints) 
protected void 
Constraint.setScope(PrimitiveConstraint[] constraints) 
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.

Conditional(IntVar[] b,
PrimitiveConstraint[] c)
It constructs a Conditional constraint.

Constraint(PrimitiveConstraint[] 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.

Implies(IntVar b,
PrimitiveConstraint c)
It constructs ifthen 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(List<PrimitiveConstraint> listOfC)
It constructs an And constraint based on primitive constraints.

Conditional(List<? extends IntVar> b,
List<? extends PrimitiveConstraint> c)
It constructs a Conditional constraint.

Or(List<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

class 
PeqQ
Constraints P #= Q for P and Q floats

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

class 
PminusQeqR
Constraint P  Q = R

class 
PneqC
Constraints P != C

class 
PneqQ
Constraints P #= Q for P and Q floats

class 
PplusCeqR
Constraint P + C #= R

class 
PplusQeqR
Constraint P + Q = R

class 
SumFloat
SumFloat constraint implements the weighted summation over several
Variable's .

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 
SplitRandomSelectFloat.getChoiceConstraint(int index) 
PrimitiveConstraint 
SplitSelectFloat.getChoiceConstraint(int index) 
Modifier and Type  Method and Description 

PrimitiveConstraint 
InputOrderSelect.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 
SelectChoicePoint.getChoiceConstraint(int index)
It returns the constraint which is the base of the choice point.

PrimitiveConstraint 
SimpleMatrixSelect.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 
SplitRandomSelect.getChoiceConstraint(int index) 
PrimitiveConstraint 
SplitSelect.getChoiceConstraint(int index) 
PrimitiveConstraint 
TraceGenerator.getChoiceConstraint(int index) 
PrimitiveConstraint[] 
SimpleSolutionListener.returnSolution() 
PrimitiveConstraint[] 
SolutionListener.returnSolution()
It returns a collection of constraints which represent the last found
solution.

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 
CreditCalculator.leftChild(PrimitiveConstraint choice,
boolean status)
It is executed after exiting the left child.

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 
NoGoodsCollector.leftChild(PrimitiveConstraint choice,
boolean status) 
boolean 
Shaving.leftChild(PrimitiveConstraint choice,
boolean status) 
boolean 
TraceGenerator.leftChild(PrimitiveConstraint choice,
boolean status) 
void 
CreditCalculator.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 
NoGoodsCollector.rightChild(PrimitiveConstraint choice,
boolean status) 
void 
Shaving.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 
AleB
It creates a <= b constraint on two set variables.

class 
AltB
It creates a < b constraint on two set variables.

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 © 2022. All rights reserved.