Package org.jacop.constraints

Class Summary

Class	Description
AbsXeqY	Constraints |X| #= Y Domain and bounds consistency can be used; third parameter of constructor controls this.
Alldiff	Alldiff constraint assures that all FDVs has different values.
Alldifferent	Alldifferent constraint assures that all FDVs has differnet values.
Alldistinct	Alldistinct constraint assures that all FDVs have different values.
Among	Among constraint in its simplest form.
AmongVar	Among constraint in its general form.
And	Constraint c1 /\ c2 ...
AndBool	If all x's are equal 1 then result variable is equal 1 too.
Assignment	Assignment constraint implements facility to improve channeling constraints between dual viewpoints of permutation models.
Circuit	Circuit constraint assures that all variables build a Hamiltonian circuit.
Constraint	Standard unified interface/abstract class for all constraints.
Count	Count constraint implements the counting over number of occurrences of a given value in a list of variables.
Cumulative	Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.
DecomposedConstraint	Standard unified interface/abstract class for constraints, which can only be decomposed.
Diff	Diff constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
Diff2	Diff2 constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
Disjoint	Disjoint constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
DisjointConditional	DisjointConditional constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
Distance	Constraint |X - Y| #= Z
Element	Element constraint implements the element/4 constraint (both with integer list and variables list).
ElementInteger	ElementInteger constraint defines a relation list[index - indexOffset] = value.
ElementVariable	ElementVariable constraint defines a relation list[index - indexOffset] = value.
Eq	Constraint "constraint1" #<=> "constraint2"
EqBool	If all x's are equal to each other then result variable is equal 1.
ExtensionalConflictVA	Extensional constraint assures that none of the tuples explicitly given is enforced in the relation.
ExtensionalSupportMDD	Extensional constraint assures that one of the tuples is enforced in the relation.
ExtensionalSupportSTR	Extensional constraint assures that one of the tuples is enforced in the relation.
ExtensionalSupportVA	Extensional constraint assures that one of the tuples is enforced in the relation.
GCC	GCC constraint counts the number of occurences of given values in x variables.
IfThen	Constraint if constraint1 then constraint2
IfThenBool	Constraint ( X => Y ) <=> Z.
IfThenElse	Constraint if constraint1 then constraint2 else constraint3 *
In	Constraints X to belong to a specified domain.
Lex	It constructs a Lex (lexicographical order) constraint.
LexOrder	It constructs a LexOrder (lexicographical order) constraint.
Linear	Linear constraint implements the weighted summation over several variables .
Max	Max constraint implements the Maximum/2 constraint.
Min	Min constraint implements the minimum/2 constraint.
NoGood	NoGood constraints implements a constraint which disallows given combination of values for given variables.
Not	Constraint "not costraint"
Or	Constraint c1 \/ c2 \/ ...
OrBool	If at least one variable from the list is equal 1 then result variable is equal 1 too.
PrimitiveConstraint	Standard unified interface for all primitive constraints.
Profile	Defines a basic data structure to keep the profile for the diffn/1 and cumulative/4 constraints.
ProfileItem	Defines a basic structure used to update profile for cumulative constraint.
Rectangle	Defines a rectangle used in the diffn constraint.
Reified	Reified constraints "constraint" #<=> B
Sequence	It constructs a Sequence constraint.
SoftAlldifferent	This class provides soft-alldifferent constraint by decomposing it either into a network flow constraint or a set of primitive constraints.
SoftGCC	This class provides soft-gcc constraint by decomposing it either into a network flow constraint or a set of primitive constraints.
Stretch	It constructs a Stretch constraint based on Regular constraint.
Subcircuit	Subcircuit constraint assures that all variables build a subcircuit.
Sum	Sum constraint implements the summation over several Variable's .
SumWeight	SumWeight constraint implements the weighted summation over several variables .
SumWeightDom	SumWeightDom constraint implements the weighted summation over several variables .
Values	Constraint Values counts number of different values on a list of Variables.
XdivYeqZ	Constraint X div Y #= Z
XeqC	Constraints X #= C Domain consistency is used.
XeqY	Constraints X #= Y Domain consistency is used.
XexpYeqZ	Constraint X ^ Y #= Z Boundary consistecny is used.
XgtC	Constraint X #> C
XgteqC	Constraints X #>= C
XgteqY	Constraints X #>= Y
XgtY	Constraint X #> Y
XltC	Constraint X #< C
XlteqC	Constraint X #<= C
XlteqY	Constraint X #<= Y
XltY	Constraint X #< Y
XmodYeqZ	Constraint X mod Y = Z
XmulCeqZ	Constraint X * C #= Z Boundary consistency is used.
XmulYeqC	Constraint X * Y #= C Boundary consistency is used.
XmulYeqZ	Constraint X * Y #= Z Boundary consistency is used.
XneqC	Constraints X #\= C
XneqY	Constraints X #\= Y Domain consistency is used.
Xor	Xor constraint - xor("constraint", B).
XorBool	Constraint ( x_0 xor x_1 xor ...
XplusCeqZ	Constraint X + C #= Z.
XplusClteqZ	Constraints X + C #<= Z.
XplusYeqC	Constraint X + Y #= C
XplusYeqZ	Constraint X + Y #= Z Bound consistency is used.
XplusYgtC	Constraint X + Y #> C
XplusYlteqZ	Constraint X + Y =< Z Bound consistency is used.
XplusYplusCeqZ	Constraints X + Y + C #= Z.
XplusYplusQeqZ	Constraint X + Y + Q = Z Bound consistency is used.
XplusYplusQgtC	Constraint X + Y + Q > C

Enum Summary

Enum	Description
ViolationMeasure