Uses of Class
org.jacop.constraints.DecomposedConstraint
Packages that use DecomposedConstraint
Package
Description
-
Uses of DecomposedConstraint in org.jacop.api
Methods in org.jacop.api that return DecomposedConstraintModifier and TypeMethodDescription -
Uses of DecomposedConstraint in org.jacop.constraints
Subclasses of DecomposedConstraint in org.jacop.constraintsModifier and TypeClassDescriptionclass
Constraints |X| #= Yclass
Alldiff constraint assures that all FDVs has different values.class
Alldifferent constraint assures that all FDVs has differnet values.class
Alldistinct constraint assures that all FDVs have different values.class
Among constraint in its simplest form.class
Among constraint in its general form.class
Constraint c1 /\ c2 ...class
AndBool constraint implements logic and operation on its arguments and returns result.class
If both a and b are equal 1 then result variable is equal 1 too.class
class
ArgMax constraint provides the index of the maximum variable from all variables on the list.class
ArgMin constraint provides the index of the maximum variable from all variables on the list.class
Assignment constraint implements facility to improve channeling constraints between dual viewpoints of permutation models.class
class
class
I defines a boolean clause for 0/1 variables x_i and y_i.class
ChannelImply constraints "B => constraint".class
ChannelReif constraints "constraint" <=> B.class
Circuit constraint assures that all variables build a Hamiltonian circuit.class
Conditional constraint implements conditional constraint satisfiability.class
class
Count constraint implements the counting over number of occurrences of a given value in a list of variables.class
CountBounds constraint implements the counting over number of occurrences of a given value in a list of variables.class
class
CountValuesBounds constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.class
class
Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.class
Decreasing constraint assures that all variables are in decreasing order.class
Diff constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Diff2 constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Disjoint constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
DisjointConditional constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Constraint |X - Y| #= Zclass
Element constraint implements the element/4 constraint (both with integer list and variables list).class
ElementInteger constraint defines a relation list[index - indexOffset] = value.class
class
ElementVariable constraint defines a relation list[index - indexOffset] = value.class
class
Constraint "constraint1"#<=> "constraint2"class
If all x's are equal to each other then result variable is equal 1.class
Extensional constraint assures that none of the tuples explicitly given is enforced in the relation.class
Extensional constraint assures that one of the tuples is enforced in the relation.class
Extensional constraint assures that one of the tuples is enforced in the relation.class
Extensional constraint assures that one of the tuples is enforced in the relation.class
GCC constraint counts the number of occurences of given values in x variables.class
Constraint if constraint1 then constraint2class
Constraint ( X => Y ) <=> Z.class
Constraint if constraint1 then constraint2 else constraint3 *class
class
Constraints X to belong to a specified domain.class
Increasing constraint assures that all variables are in increasing order.class
It constructs a Lex (lexicographical order) constraint.class
It constructs a LexOrder (lexicographical order) constraint.class
Deprecated.As of release 4.3.1 replaced by LinearInt constraint.class
class
LinearIntDom constraint implements the weighted summation over several variables.class
Max constraint implements the Maximum/2 constraint.class
MaxSimple constraint implements the Maximum/2 constraint.class
Member constraint implements the membership of element e on list x.class
Min constraint implements the minimum/2 constraint.class
MinSimple constraint implements the minimum/2 constraint.class
NoGood constraints implements a constraint which disallows given combination of values for given variables.class
Constraint "not costraint"class
Constraint c1 \/ c2 \/ ...class
OrBool constraint implements logic and operation on its arguments and returns result.class
If at least one variable is equal 1 then result variable is equal 1 too.class
If at least one variable from the list is equal 1 then result variable is equal 1 too.class
Standard unified interface for all primitive constraints.class
class
It constructs a Sequence constraint.class
This class provides soft-alldifferent constraint by decomposing it either into a network flow constraint or a set of primitive constraints.class
This class provides soft-gcc constraint by decomposing it either into a network flow constraint or a set of primitive constraints.class
It constructs a Stretch constraint based on Regular constraint.class
Subcircuit constraint assures that all variables build a subcircuit.class
class
class
SumInt constraint implements the summation over several variables.class
class
Deprecated.As of release 4.3.1 replaced by LinearIntDom constraint.class
class
Constraint Values counts number of different values on a list of Variables.class
VariableTrace is a daemon that prints information on variables whenever they are changed.class
Constraint X div Y #= Zclass
class
Constraints X #= Yclass
Constraint X ^ Y #= Zclass
Constraint X > Cclass
Constraints X >= Cclass
Constraints X >= Yclass
Constraint X > Yclass
Constraint X < Cclass
Constraint X <= Cclass
Constraint X <= Yclass
Constraint X < Yclass
class
class
Constraint X * Y #= Cclass
class
class
Constraints X #\= Yclass
Xor constraint - xor("constraint", B).class
Constraint ( x_0 xor x_1 xor ...class
Constraint X + C #= Z.class
Constraints X + C<= Z.class
Constraint X + Y #= Cclass
Constraint X + Y = Zclass
Constraint X + Y> Cclass
Constraint X + Y=< Z -
Uses of DecomposedConstraint in org.jacop.constraints.binpacking
Subclasses of DecomposedConstraint in org.jacop.constraints.binpackingModifier and TypeClassDescriptionclass
Binpacking constraint implements bin packing problem. -
Uses of DecomposedConstraint in org.jacop.constraints.cumulative
Subclasses of DecomposedConstraint in org.jacop.constraints.cumulativeModifier and TypeClassDescriptionclass
class
(package private) class
class
-
Uses of DecomposedConstraint in org.jacop.constraints.diffn
Subclasses of DecomposedConstraint in org.jacop.constraints.diffnModifier and TypeClassDescriptionclass
Diffn constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
Diffn constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.class
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 -
Uses of DecomposedConstraint in org.jacop.constraints.knapsack
Subclasses of DecomposedConstraint in org.jacop.constraints.knapsack -
Uses of DecomposedConstraint in org.jacop.constraints.netflow
Subclasses of DecomposedConstraint in org.jacop.constraints.netflow -
Uses of DecomposedConstraint in org.jacop.constraints.regular
Subclasses of DecomposedConstraint in org.jacop.constraints.regularModifier and TypeClassDescriptionclass
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 DecomposedConstraintModifier and TypeMethodDescription -
Uses of DecomposedConstraint in org.jacop.constraints.table
Subclasses of DecomposedConstraint in org.jacop.constraints.tableModifier and TypeClassDescriptionclass
SimpleTable implements the table constraint using a method presented inclass
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 DecomposedConstraintModifier and TypeMethodDescriptionvoid
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
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.constraintsModifier and TypeClassDescriptionclass
Constraints |P| #= Rclass
Constraints acos(P) = Rclass
Constraints asin(P) = Rclass
Constraints atan(P) = Rclass
Constraints cos(P) = Rclass
Constraints cos(P) = Rclass
ElementFloat constraint defines a relation list[index - indexOffset] = value.class
ElementFloatVariable constraint defines a relation list[index - indexOffset] = value.class
EquationSystem constraint implements the multivariate interval Newton method for pruning domains of variables in a system of non-linear equations.class
Constraints exp(P) #= Q for P and Q floatsclass
LinearFloat constraint implements the weighted summation over several Variable's .class
Constraints Ln(P) #= Q for P and Q floatsclass
Max constraint implements the Maximum/2 constraint.class
Min constraint implements the minimum/2 constraint.class
Constraint P / C = R for floatsclass
Constraint P / Q = R for floatsclass
Constraints P #= Cclass
Constraints P #= Q for P and Q floatsclass
Constraint P > Cclass
Constraints P >= C for floatsclass
Constraints P >= Q for floatsclass
Constraint P > Q for floatsclass
Constraint P < C for floatsclass
Constraint X <= C for floatsclass
Constraint P <= Q for floatsclass
Constraint P < Q for floatsclass
Constraint P - C = Rclass
Constraint P - Q = Rclass
Constraint P * C = R for floatsclass
Constraint P * Q = R for floatsclass
Constraints P != Cclass
Constraints P #= Q for P and Q floatsclass
Constraint P + C #= Rclass
Constraint P + Q = Rclass
Constraints sin(P) = Rclass
Constraint sqrt(P) = R for floatsclass
SumFloat constraint implements the weighted summation over several Variable's .class
Constraints sin(P) = Rclass
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.linearModifier and TypeClassDescriptionclass
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 -
Uses of DecomposedConstraint in org.jacop.satwrapper
Subclasses of DecomposedConstraint in org.jacop.satwrapperModifier and TypeClassDescriptionfinal class
wrapper to communicate between SAT solver and CP solver. -
Uses of DecomposedConstraint in org.jacop.set.constraints
Subclasses of DecomposedConstraint in org.jacop.set.constraintsModifier and TypeClassDescriptionclass
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
The disjoint set constraint makes sure that two set variables do not contain any common element.class
It creates an equality constraint to make sure that two set variables have the same value.class
It creates an equality constraint to make sure that a set variable is equal to a given set.class
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
It creates a constraint that makes sure that value of the variable A is included within a provided set.class
It creates a constraint that makes sure that A intersected with B is equal to C.class
It creates a <= b constraint on two set variables.class
It creates a < b constraint on two set variables.class
It creates a constraint that makes sure that A union B is equal to C.class
The set cardinality constraint.class
The set cardinality constraint.class
It constructs a constraint which makes sure that a given element is in the domain of the set variable.class
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 constraint defines a relation list[index - indexOffset] = value.class
Deprecated.As of release 4.5.1 replaced by AltB and AleB constraints.class
This constraint matches the elements of the given set variable onto a list of integer variables.class
It creates an inclusion set constraint to make sure that provided set is included in a set variable a.class
It computes a weighted sum of the elements in the domain of the given set variable.class
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
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.