Uses of Class
org.jacop.constraints.DecomposedConstraint
-
-
Uses of DecomposedConstraint in org.jacop.api
Methods in org.jacop.api that return DecomposedConstraint Modifier and Type Method Description DecomposedConstraint<Constraint>
Replaceable. replace(T constraint)
-
Uses of DecomposedConstraint in org.jacop.constraints
Subclasses of DecomposedConstraint in org.jacop.constraints Modifier and Type Class Description class
AbsXeqY
Constraints |X| #= Yclass
Alldiff
Alldiff constraint assures that all FDVs has different values.class
Alldifferent
Alldifferent constraint assures that all FDVs has differnet values.class
Alldistinct
Alldistinct constraint assures that all FDVs have different values.class
Among
Among constraint in its simplest form.class
AmongVar
Among constraint in its general form.class
And
Constraint c1 /\ c2 ...class
AndBool
AndBool constraint implements logic and operation on its arguments and returns result.class
AndBoolSimple
If both a and b are equal 1 then result variable is equal 1 too.class
AndBoolVector
If all x's are equal 1 then result variable is equal 1 too.class
ArgMax
ArgMax constraint provides the index of the maximum variable from all variables on the list.class
ArgMin
ArgMin constraint provides the index of the maximum variable from all variables on the list.class
Assignment
Assignment constraint implements facility to improve channeling constraints between dual viewpoints of permutation models.class
AtLeast
AtLeast constraint implements the counting over number of occurrences of a given value in a list of variables.class
AtMost
AtMost constraint implements the counting over number of occurrences of a given value in a list of variables.class
BoolClause
I defines a boolean clause for 0/1 variables x_i and y_i.class
Channel
Channel constraints "constraint" <=> Bclass
Circuit
Circuit constraint assures that all variables build a Hamiltonian circuit.class
Conditional
Conditional constraint implements conditional constraint satisfiability.class
Constraint
Standard unified interface/abstract class for all constraints.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
CountValues
CountValues constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.class
CountValuesBounds
CountValuesBounds constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.class
CountVar
CountVar constraint implements the counting over number of occurrences of a given value in a list of variables.class
Cumulative
Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.class
Diff
Diff constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Diff2
Diff2 constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Disjoint
Disjoint constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
DisjointConditional
DisjointConditional constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Distance
Constraint |X - Y| #= Zclass
Element
Element constraint implements the element/4 constraint (both with integer list and variables list).class
ElementInteger
ElementInteger constraint defines a relation list[index - indexOffset] = value.class
ElementIntegerFast
ElementIntegerFast constraint defines a relation list[index - indexOffset] = value.class
ElementVariable
ElementVariable constraint defines a relation list[index - indexOffset] = value.class
ElementVariableFast
ElementVariableFast constraint defines a relation list[index - indexOffset] = value.class
Eq
Constraint "constraint1"#<=> "constraint2"class
EqBool
If all x's are equal to each other then result variable is equal 1.class
ExtensionalConflictVA
Extensional constraint assures that none of the tuples explicitly given is enforced in the relation.class
ExtensionalSupportMDD
Extensional constraint assures that one of the tuples is enforced in the relation.class
ExtensionalSupportSTR
Extensional constraint assures that one of the tuples is enforced in the relation.class
ExtensionalSupportVA
Extensional constraint assures that one of the tuples is enforced in the relation.class
GCC
GCC constraint counts the number of occurences of given values in x variables.class
IfThen
Constraint if constraint1 then constraint2class
IfThenBool
Constraint ( X => Y ) <=> Z.class
IfThenElse
Constraint if constraint1 then constraint2 else constraint3 *class
Implies
Constraint b => c (implication or half-reification)class
In
Constraints X to belong to a specified domain.class
Lex
It constructs a Lex (lexicographical order) constraint.class
LexOrder
It constructs a LexOrder (lexicographical order) constraint.class
Linear
Deprecated.As of release 4.3.1 replaced by LinearInt constraint.class
LinearInt
LinearInt constraint implements the weighted summation over several variables .class
LinearIntDom
LinearIntDom constraint implements the weighted summation over several variables.class
Max
Max constraint implements the Maximum/2 constraint.class
MaxSimple
MaxSimple constraint implements the Maximum/2 constraint.class
Member
Member constraint implements the membership of element e on list x.class
Min
Min constraint implements the minimum/2 constraint.class
MinSimple
MinSimple constraint implements the minimum/2 constraint.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
OrBool constraint implements logic and operation on its arguments and returns result.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
PrimitiveConstraint
Standard unified interface for all primitive constraints.class
Reified
Reified constraints "constraint" <=> Bclass
Sequence
It constructs a Sequence constraint.class
SoftAlldifferent
This class provides soft-alldifferent constraint by decomposing it either into a network flow constraint or a set of primitive constraints.class
SoftGCC
This class provides soft-gcc constraint by decomposing it either into a network flow constraint or a set of primitive constraints.class
Stretch
It constructs a Stretch constraint based on Regular constraint.class
Subcircuit
Subcircuit constraint assures that all variables build a subcircuit.class
Sum
Deprecated.As of release 4.3.1 replaced by SumInt constraint.class
SumBool
SumBool constraint implements the summation over several 0/1 variables.class
SumInt
SumInt constraint implements the summation over several variables.class
SumWeight
SumWeight constraint implements the weighted summation over several variables .class
SumWeightDom
Deprecated.As of release 4.3.1 replaced by LinearIntDom constraint.class
ValuePrecede
It defines Value Precedence constraint for integers.class
Values
Constraint Values counts number of different values on a list of Variables.class
VariableTrace
VariableTrace is a daemon that prints information on variables whenever they are changed.class
XdivYeqZ
Constraint X div Y #= Zclass
XeqC
Constraints X #= Cclass
XeqY
Constraints X #= Yclass
XexpYeqZ
Constraint X ^ Y #= Zclass
XgtC
Constraint X > Cclass
XgteqC
Constraints X >= Cclass
XgteqY
Constraints X >= Yclass
XgtY
Constraint X > Yclass
XltC
Constraint X < Cclass
XlteqC
Constraint X <= Cclass
XlteqY
Constraint X <= Yclass
XltY
Constraint X < Yclass
XmodYeqZ
Constraint X mod Y = Zclass
XmulCeqZ
Constraint X * C #= Zclass
XmulYeqC
Constraint X * Y #= Cclass
XmulYeqZ
Constraint X * Y #= Zclass
XneqC
Constraints X #\= Cclass
XneqY
Constraints X #\= Yclass
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 #= Cclass
XplusYeqZ
Constraint X + Y = Zclass
XplusYgtC
Constraint X + Y> Cclass
XplusYlteqZ
Constraint X + Y=< Z -
Uses of DecomposedConstraint in org.jacop.constraints.binpacking
Subclasses of DecomposedConstraint in org.jacop.constraints.binpacking Modifier and Type Class Description class
Binpacking
Binpacking constraint implements bin packing problem. -
Uses of DecomposedConstraint in org.jacop.constraints.cumulative
Subclasses of DecomposedConstraint in org.jacop.constraints.cumulative Modifier and Type Class Description class
Cumulative
Cumulative implements the scheduling constraint usingclass
CumulativeBasic
CumulativeBasic implements the cumulative constraint using time tabling algorithm.(package private) class
CumulativePrimary
CumulativePrimary implements the cumulative constraint using time tabling algorithm.class
CumulativeUnary
CumulativeUnary implements the scheduling constraint for unary resources using -
Uses of DecomposedConstraint in org.jacop.constraints.diffn
Subclasses of DecomposedConstraint in org.jacop.constraints.diffn Modifier and Type Class Description class
Diffn
Diffn constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
DiffnDecomposed
Diffn constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Nooverlap
Nooverlap constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction. -
Uses of DecomposedConstraint in org.jacop.constraints.geost
Subclasses of DecomposedConstraint in org.jacop.constraints.geost Modifier and Type Class Description class
Geost
-
Uses of DecomposedConstraint in org.jacop.constraints.knapsack
Subclasses of DecomposedConstraint in org.jacop.constraints.knapsack Modifier and Type Class Description class
Knapsack
It specifies a knapsack constraint. -
Uses of DecomposedConstraint in org.jacop.constraints.netflow
Subclasses of DecomposedConstraint in org.jacop.constraints.netflow Modifier and Type Class Description class
Arithmetic
class
NetworkFlow
The network flow constraint. -
Uses of DecomposedConstraint in org.jacop.constraints.regular
Subclasses of DecomposedConstraint in org.jacop.constraints.regular Modifier and Type Class Description class
Regular
Regular constraint accepts only the assignment to variables which is accepted by an automaton. -
Uses of DecomposedConstraint in org.jacop.constraints.replace
Methods in org.jacop.constraints.replace that return DecomposedConstraint Modifier and Type Method Description DecomposedConstraint<Constraint>
ReifiedIfThen. replace(Reified constraint)
-
Uses of DecomposedConstraint in org.jacop.constraints.table
Subclasses of DecomposedConstraint in org.jacop.constraints.table Modifier and Type Class Description class
SimpleTable
SimpleTable implements the table constraint using a method presented inclass
Table
Table implements the table constraint using a method presented in -
Uses of DecomposedConstraint in org.jacop.core
Methods in org.jacop.core with parameters of type DecomposedConstraint Modifier and Type Method Description void
Store. imposeDecomposition(DecomposedConstraint c)
This function imposes a decomposable constraint to a store.void
Store. imposeDecomposition(DecomposedConstraint c, int queueIndex)
This function imposes a constraint decomposition to a store.void
Store. imposeDecompositionWithConsistency(DecomposedConstraint c)
In some special cases it may be beneficial to compute consistency of constraint store immediately after the decomposed constraint is imposed. -
Uses of DecomposedConstraint in org.jacop.floats.constraints
Subclasses of DecomposedConstraint in org.jacop.floats.constraints Modifier and Type Class Description class
AbsPeqR
Constraints |P| #= Rclass
AcosPeqR
Constraints acos(P) = Rclass
AsinPeqR
Constraints asin(P) = Rclass
AtanPeqR
Constraints atan(P) = Rclass
CosPeqR
Constraints cos(P) = Rclass
CosPeqR_decomposed
Constraints cos(P) = Rclass
ElementFloat
ElementFloat constraint defines a relation list[index - indexOffset] = value.class
ElementFloatVariable
ElementFloatVariable constraint defines a relation list[index - indexOffset] = value.class
EquationSystem
EquationSystem constraint implements the multivariate interval Newton method for pruning domains of variables in a system of non-linear equations.class
ExpPeqR
Constraints exp(P) #= Q for P and Q floatsclass
LinearFloat
LinearFloat constraint implements the weighted summation over several Variable's .class
LnPeqR
Constraints Ln(P) #= Q for P and Q floatsclass
Max
Max constraint implements the Maximum/2 constraint.class
Min
Min constraint implements the minimum/2 constraint.class
PdivCeqR
Constraint P / C = R for floatsclass
PdivQeqR
Constraint P / Q = R for floatsclass
PeqC
Constraints P #= Cclass
PeqQ
Constraints P #= Q for P and Q floatsclass
PgtC
Constraint P > Cclass
PgteqC
Constraints P >= C for floatsclass
PgteqQ
Constraints P >= Q for floatsclass
PgtQ
Constraint P > Q for floatsclass
PltC
Constraint P < C for floatsclass
PlteqC
Constraint X <= C for floatsclass
PlteqQ
Constraint P <= Q for floatsclass
PltQ
Constraint P < Q for floatsclass
PminusCeqR
Constraint P - C = Rclass
PminusQeqR
Constraint P - Q = Rclass
PmulCeqR
Constraint P * C = R for floatsclass
PmulQeqR
Constraint P * Q = R for floatsclass
PneqC
Constraints P != Cclass
PneqQ
Constraints P #= Q for P and Q floatsclass
PplusCeqR
Constraint P + C #= Rclass
PplusQeqR
Constraint P + Q = Rclass
SinPeqR
Constraints sin(P) = Rclass
SqrtPeqR
Constraint sqrt(P) = R for floatsclass
SumFloat
SumFloat constraint implements the weighted summation over several Variable's .class
TanPeqR
Constraints sin(P) = Rclass
XeqP
Constraints X #= P for X and P floats -
Uses of DecomposedConstraint in org.jacop.floats.constraints.linear
Subclasses of DecomposedConstraint in org.jacop.floats.constraints.linear Modifier and Type Class Description class
Linear
Linear constraint implements the weighted summation over several Variable's . -
Uses of DecomposedConstraint in org.jacop.fz.constraints
Methods in org.jacop.fz.constraints with parameters of type DecomposedConstraint Modifier and Type Method Description (package private) void
Support. poseDC(DecomposedConstraint c)
-
Uses of DecomposedConstraint in org.jacop.satwrapper
Subclasses of DecomposedConstraint in org.jacop.satwrapper Modifier and Type Class Description class
SatWrapper
wrapper to communicate between SAT solver and CP solver. -
Uses of DecomposedConstraint in org.jacop.set.constraints
Subclasses of DecomposedConstraint in org.jacop.set.constraints Modifier and Type Class Description class
AdiffBeqC
It creates a constraints that subtracts from set variable A the elements from of the set variable B and assigns the result to set variable C.class
AdisjointB
The disjoint set constraint makes sure that two set variables do not contain any common element.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
AintersectBeqC
It creates a constraint that makes sure that A intersected with B is equal to C.class
AleB
It creates a <= b constraint on two set variables.class
AltB
It creates a < b constraint on two set variables.class
AunionBeqC
It creates a constraint that makes sure that A union B is equal to C.class
CardA
The set cardinality constraint.class
CardAeqX
The set cardinality constraint.class
EinA
It constructs a constraint which makes sure that a given element is in the domain of the set variable.class
ElementSet
It is an element constraint that make sure that set variable value has a domain equal to the index-th element of the supplied list of sets.class
ElementSetVariable
ElementSetVariable constraint defines a relation list[index - indexOffset] = value.class
Lex
Deprecated.As of release 4.5.1 replaced by AltB and AleB constraints.class
Match
This constraint matches the elements of the given set variable onto a list of integer variables.class
SinA
It creates an inclusion set constraint to make sure that provided set is included in a set variable a.class
SumWeightedSet
It computes a weighted sum of the elements in the domain of the given set variable.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.
-