| AbsXeqY |
Constraints |X| #= Y
|
| Alldiff |
Alldiff constraint assures that all FDVs has different values.
|
| Alldiff.Element |
|
| 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 |
AndBool constraint implements logic and operation on its arguments
and returns result.
|
| AndBoolSimple |
If both a and b are equal 1 then result variable is equal 1 too.
|
| AndBoolVector |
If all x's are equal 1 then result variable is equal 1 too.
|
| ArgMax |
ArgMax constraint provides the index of the maximum
variable from all variables on the list.
|
| ArgMin |
ArgMin constraint provides the index of the maximum
variable from all variables on the list.
|
| Assignment |
Assignment constraint implements facility to improve channeling constraints
between dual viewpoints of permutation models.
|
| AtLeast |
AtLeast constraint implements the counting over number of occurrences of
a given value in a list of variables.
|
| AtMost |
AtMost constraint implements the counting over number of occurrences of
a given value in a list of variables.
|
| BoolClause |
I defines a boolean clause for 0/1 variables x_i and y_i.
|
| Channel |
Channel constraints "constraint" <=> B
|
| Channel.Item |
|
| Circuit |
Circuit constraint assures that all variables build a Hamiltonian
circuit.
|
| CircuitVar |
Defines a Variable for Circuit constraints and related operations on it.
|
| CircuitVarValue |
Defines a current value of the CircuitVar and related operations on it.
|
| Conditional |
Conditional constraint implements conditional constraint
satisfiability.
|
| 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.
|
| CountBounds |
CountBounds constraint implements the counting over number of occurrences of
a given value in a list of variables.
|
| CountValues |
CountValues constraint implements the counting over numbers of occurrences of a given
vector of values in a list of variables.
|
| CountValuesBounds |
CountValuesBounds constraint implements the counting over numbers of occurrences of a given
vector of values in a list of variables.
|
| CountValuesBounds.Bounds |
|
| CountVar |
CountVar 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.
|
| CumulativeProfiles |
Defines a basic data structure to keep two profiles for the cumulative
constraints.
|
| DecomposedConstraint<T extends Constraint> |
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.
|
| Diff.Pair |
|
| Diff2 |
Diff2 constraint assures that any two rectangles from a vector of
rectangles does not overlap in at least one direction.
|
| Diff2Var |
Defines a Variable for Diff2 constraints and related operations on it.
|
| Diff2VarValue |
Defines a current value of the Diff2Var and related operations on it.
|
| DiffnProfile |
Defines a basic data structure to keep the profile for the diff2/1
constraints.
|
| 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.
|
| DisjointConditionalProfile |
Defines a basic data structure to keep the profile for the diffn/1
constraints.
|
| DisjointCondVar |
Defines a Variable for Diff2 constraints and related operations on it.
|
| DisjointCondVarValue |
Defines a current value of the Diff2Var and related operations on it.
|
| 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.
|
| ElementIntegerFast |
ElementIntegerFast constraint defines a relation
list[index - indexOffset] = value.
|
| ElementVariable |
ElementVariable constraint defines a relation
list[index - indexOffset] = value.
|
| ElementVariableFast |
ElementVariableFast 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.
|
| ExclusiveItem |
Defines a basic structure for exsclusive rectangles used in
DisjointConditional
|
| ExclusiveList |
Defines a list of exclusive items.
|
| 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.
|
| GCC.Component |
|
| GCC.XDomain |
|
| IfThen |
Constraint if constraint1 then constraint2
|
| IfThenBool |
Constraint ( X => Y ) <=> Z.
|
| IfThenElse |
Constraint if constraint1 then constraint2 else constraint3
*
|
| Implies |
Constraint b => c (implication or half-reification)
|
| In |
Constraints X to belong to a specified domain.
|
| IntRectangle |
Defines a rectangle with integer origine and length used in the diffn
constraint.
|
| IntTask |
Represents tasks with integer start, duration and resource valurs for
cumulative constraint
|
| Lex |
It constructs a Lex (lexicographical order) constraint.
|
| LexOrder |
It constructs a LexOrder (lexicographical order) constraint.
|
| Linear |
Deprecated.
|
| LinearInt |
LinearInt constraint implements the weighted summation over several
variables .
|
| LinearIntDom |
LinearIntDom constraint implements the weighted summation over several
variables.
|
| Max |
Max constraint implements the Maximum/2 constraint.
|
| MaxSimple |
MaxSimple constraint implements the Maximum/2 constraint.
|
| Member |
Member constraint implements the membership of element e on list x.
|
| Min |
Min constraint implements the minimum/2 constraint.
|
| MinSimple |
MinSimple 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 |
OrBool constraint implements logic and operation on its arguments
and returns result.
|
| OrBoolSimple |
If at least one variable is equal 1 then result variable is equal 1 too.
|
| OrBoolVector |
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.
|
| ProfileConditional |
Defines a basic data structure to keep the profile for the
disjointConditonal/2
|
| ProfileItem |
Defines a basic structure used to update profile for cumulative constraint.
|
| ProfileItemCondition |
Defines a basic structure used to update profile DisjointConditional when
some rectangles can share the same place.
|
| Rectangle |
Defines a rectangle used in the diffn constraint.
|
| RectangleWithCondition |
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 |
Deprecated.
|
| SumBool |
SumBool constraint implements the summation over several
0/1 variables.
|
| SumInt |
SumInt constraint implements the summation over several variables.
|
| SumWeight |
SumWeight constraint implements the weighted summation over several
variables .
|
| SumWeightDom |
Deprecated.
|
| Task |
Represents tasks for cumulative constraint
|
| ValuePrecede |
It defines Value Precedence constraint for integers.
|
| Values |
Constraint Values counts number of different values on a list of Variables.
|
| VariableTrace |
VariableTrace is a daemon that prints information on variables whenever they are changed.
|
| XdivYeqZ |
Constraint X div Y #= Z
|
| XeqC |
Constraints X #= C
|
| XeqY |
Constraints X #= Y
|
| XexpYeqZ |
Constraint X ^ Y #= Z
|
| 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
|
| XmulYeqC |
Constraint X * Y #= C
|
| XmulYeqZ |
Constraint X * Y #= Z
|
| XneqC |
Constraints X #\= C
|
| XneqY |
Constraints X #\= Y
|
| 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
|
| XplusYgtC |
Constraint X + Y> C
|
| XplusYlteqZ |
Constraint X + Y=< Z
|