Uses of Class
org.jacop.constraints.PrimitiveConstraint
-
Packages that use PrimitiveConstraint 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 -
-
Uses of PrimitiveConstraint in org.jacop.constraints
Subclasses of PrimitiveConstraint in org.jacop.constraints Modifier and Type Class Description classAbsXeqYConstraints |X| #= YclassAndConstraint c1 /\ c2 ...classAndBoolSimpleIf both a and b are equal 1 then result variable is equal 1 too.classAndBoolVectorIf all x's are equal 1 then result variable is equal 1 too.classAtLeastAtLeast constraint implements the counting over number of occurrences of a given value in a list of variables.classAtMostAtMost constraint implements the counting over number of occurrences of a given value in a list of variables.classBoolClauseI defines a boolean clause for 0/1 variables x_i and y_i.classCountCount constraint implements the counting over number of occurrences of a given value in a list of variables.classCountBoundsCountBounds constraint implements the counting over number of occurrences of a given value in a list of variables.classCountVarCountVar constraint implements the counting over number of occurrences of a given value in a list of variables.classDistanceConstraint |X - Y| #= ZclassEqConstraint "constraint1"#<=> "constraint2"classEqBoolIf all x's are equal to each other then result variable is equal 1.classIfThenConstraint if constraint1 then constraint2classIfThenBoolConstraint ( X => Y ) <=> Z.classIfThenElseConstraint if constraint1 then constraint2 else constraint3 *classImpliesConstraint b => c (implication or half-reification)classInConstraints X to belong to a specified domain.classLinearIntLinearInt constraint implements the weighted summation over several variables .classLinearIntDomLinearIntDom constraint implements the weighted summation over several variables.classMemberMember constraint implements the membership of element e on list x.classNotConstraint "not costraint"classOrConstraint c1 \/ c2 \/ ...classOrBoolSimpleIf at least one variable is equal 1 then result variable is equal 1 too.classOrBoolVectorIf at least one variable from the list is equal 1 then result variable is equal 1 too.classReifiedReified constraints "constraint" <=> BclassSumBoolSumBool constraint implements the summation over several 0/1 variables.classSumIntSumInt constraint implements the summation over several variables.classXeqCConstraints X #= CclassXeqYConstraints X #= YclassXgtCConstraint X > CclassXgteqCConstraints X >= CclassXgteqYConstraints X >= YclassXgtYConstraint X > YclassXltCConstraint X < CclassXlteqCConstraint X <= CclassXlteqYConstraint X <= YclassXltYConstraint X < YclassXmulCeqZConstraint X * C #= ZclassXmulYeqCConstraint X * Y #= CclassXneqCConstraints X #\= CclassXneqYConstraints X #\= YclassXorXor constraint - xor("constraint", B).classXorBoolConstraint ( x_0 xor x_1 xor ...classXplusCeqZConstraint X + C #= Z.classXplusClteqZConstraints X + C<= Z.classXplusYeqCConstraint X + Y #= CclassXplusYeqZConstraint X + Y = ZclassXplusYgtCConstraint X + Y> CclassXplusYlteqZConstraint X + Y=< ZFields in org.jacop.constraints declared as PrimitiveConstraint Modifier and Type Field Description (package private) PrimitiveConstraintAndBool. cPrimitiveConstraint[]Conditional. cThe list of constraints that are to be selected.PrimitiveConstraintImplies. cIt specifies constraint in the Implies constraint.PrimitiveConstraintNot. cIt specifies the constraint which negation is being created.(package private) PrimitiveConstraintOrBool. cPrimitiveConstraintReified. cIt specifies constraint c which status is being checked.PrimitiveConstraintXor. cIt specifies constraint c, which status must satisfy xor relationship with variable b.PrimitiveConstraintEq. c1It specifies the first constraint which status must be equivalent to the status of the second constraint.PrimitiveConstraintEq. c2It specifies the second constraint which status must be equivalent to the status of the first constraint.PrimitiveConstraintIfThen. condCIt specifies constraint condC in the IfThen constraint.PrimitiveConstraintIfThenElse. condCIt specifies constraint condC in the IfThenElse constraint.PrimitiveConstraintIfThenElse. elseCIt specifies constraint elseC in the IfThenElse constraint.protected PrimitiveConstraint[]And. listOfCIt specifies a list of constraints which must be satisfied to keep And constraint satisfied.PrimitiveConstraint[]Or. listOfCIt specifies a list of constraints from which one constraint must be satisfied.PrimitiveConstraintIfThen. thenCIt specifies constraint condC in the IfThen constraint.PrimitiveConstraintIfThenElse. thenCIt specifies constraint condC in the IfThenElse constraint.Fields in org.jacop.constraints with type parameters of type PrimitiveConstraint Modifier and Type Field Description java.util.Set<PrimitiveConstraint>Constraint. constraintScopeprivate QueueForward<PrimitiveConstraint>And. queueForwardQueueForward<PrimitiveConstraint>Eq. queueForwardQueueForward<PrimitiveConstraint>IfThen. queueForwardQueueForward<PrimitiveConstraint>IfThenElse. queueForwardprivate QueueForward<PrimitiveConstraint>Implies. queueForwardprivate QueueForward<PrimitiveConstraint>Not. queueForwardQueueForward<PrimitiveConstraint>Or. queueForwardprivate QueueForward<PrimitiveConstraint>Reified. queueForwardprivate QueueForward<PrimitiveConstraint>Xor. queueForwardMethods in org.jacop.constraints that return types with arguments of type PrimitiveConstraint Modifier and Type Method Description java.util.List<PrimitiveConstraint>AndBool. decompose(Store store)java.util.List<PrimitiveConstraint>OrBool. decompose(Store store)Methods in org.jacop.constraints with parameters of type PrimitiveConstraint Modifier and Type Method Description protected voidConstraint. setConstraintScope(PrimitiveConstraint... primitiveConstraints)protected voidConstraint. setScope(PrimitiveConstraint[] constraints)Constructors in org.jacop.constraints with parameters of type PrimitiveConstraint Constructor 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 parameters in org.jacop.constraints with type arguments of type PrimitiveConstraint Constructor Description And(java.util.List<PrimitiveConstraint> listOfC)It constructs an And constraint based on primitive constraints.Or(java.util.List<PrimitiveConstraint> listOfC)It constructs Or constraint. -
Uses of PrimitiveConstraint in org.jacop.floats.constraints
Subclasses of PrimitiveConstraint in org.jacop.floats.constraints Modifier and Type Class Description classLinearFloatLinearFloat constraint implements the weighted summation over several Variable's .classPeqCConstraints P #= CclassPeqQConstraints P #= Q for P and Q floatsclassPgtCConstraint P > CclassPgteqCConstraints P >= C for floatsclassPgteqQConstraints P >= Q for floatsclassPgtQConstraint P > Q for floatsclassPltCConstraint P < C for floatsclassPlteqCConstraint X <= C for floatsclassPlteqQConstraint P <= Q for floatsclassPltQConstraint P < Q for floatsclassPminusCeqRConstraint P - C = RclassPminusQeqRConstraint P - Q = RclassPneqCConstraints P != CclassPneqQConstraints P #= Q for P and Q floatsclassPplusCeqRConstraint P + C #= RclassPplusQeqRConstraint P + Q = RclassSumFloatSumFloat constraint implements the weighted summation over several Variable's . -
Uses of PrimitiveConstraint in org.jacop.floats.constraints.linear
Subclasses of PrimitiveConstraint in org.jacop.floats.constraints.linear Modifier and Type Class Description classLinearLinear constraint implements the weighted summation over several Variable's . -
Uses of PrimitiveConstraint in org.jacop.floats.search
Methods in org.jacop.floats.search that return PrimitiveConstraint Modifier and Type Method Description PrimitiveConstraintSplitRandomSelectFloat. getChoiceConstraint(int index)PrimitiveConstraintSplitSelectFloat. getChoiceConstraint(int index) -
Uses of PrimitiveConstraint in org.jacop.search
Fields in org.jacop.search declared as PrimitiveConstraint Modifier and Type Field Description (package private) PrimitiveConstraintTraceGenerator.SearchNode. cMethods in org.jacop.search that return PrimitiveConstraint Modifier and Type Method Description PrimitiveConstraintInputOrderSelect. getChoiceConstraint(int index)It always returns null as choice point is obtained by getChoiceVariable and getChoiceValue.PrimitiveConstraintRandomSelect. getChoiceConstraint(int index)It always returns null as choice point is obtained by getChoiceVariable and getChoiceValue.PrimitiveConstraintSelectChoicePoint. getChoiceConstraint(int index)It returns the constraint which is the base of the choice point.PrimitiveConstraintSimpleMatrixSelect. getChoiceConstraint(int index)It always returns null as choice point is obtained by getChoiceVariable and getChoiceValue.PrimitiveConstraintSimpleSelect. getChoiceConstraint(int index)It always returns null as choice point is obtained by getChoiceVariable and getChoiceValue.PrimitiveConstraintSplitRandomSelect. getChoiceConstraint(int index)PrimitiveConstraintSplitSelect. getChoiceConstraint(int index)PrimitiveConstraintTraceGenerator. getChoiceConstraint(int index)PrimitiveConstraint[]SimpleSolutionListener. returnSolution()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.PrimitiveConstraint[]SolutionListener. returnSolution()It returns a collection of constraints which represent the last found solution.Methods in org.jacop.search with parameters of type PrimitiveConstraint Modifier and Type Method Description (package private) voidTraceGenerator. generateFailcNode(int searchNodeId, int parentNode, PrimitiveConstraint c)(package private) voidTraceGenerator. generateTrycNode(int searchNodeId, int parentNode, PrimitiveConstraint c)booleanCreditCalculator. leftChild(PrimitiveConstraint choice, boolean status)It is executed after exiting the left child.booleanExitChildListener. leftChild(PrimitiveConstraint choice, boolean status)It is executed after exiting the left child.booleanLDS. leftChild(PrimitiveConstraint choice, boolean status)It is executed after exiting the left child.booleanNoGoodsCollector. leftChild(PrimitiveConstraint choice, boolean status)booleanShaving. leftChild(PrimitiveConstraint choice, boolean status)booleanTraceGenerator. leftChild(PrimitiveConstraint choice, boolean status)voidCreditCalculator. rightChild(PrimitiveConstraint choice, boolean status)voidExitChildListener. rightChild(PrimitiveConstraint choice, boolean status)It is executed after exiting the right child.voidLDS. rightChild(PrimitiveConstraint choice, boolean status)voidNoGoodsCollector. rightChild(PrimitiveConstraint choice, boolean status)voidShaving. rightChild(PrimitiveConstraint choice, boolean status)voidTraceGenerator. rightChild(PrimitiveConstraint choice, boolean status) -
Uses of PrimitiveConstraint in org.jacop.set.constraints
Subclasses of PrimitiveConstraint in org.jacop.set.constraints Modifier and Type Class Description classAeqBIt creates an equality constraint to make sure that two set variables have the same value.classAeqSIt creates an equality constraint to make sure that a set variable is equal to a given set.classAinBIt creates a constraint that makes sure that the set value of set variable A is included in the set value of set variable B.classAinSIt creates a constraint that makes sure that value of the variable A is included within a provided set.classAleBIt creates a <= b constraint on two set variables.classAltBIt creates a < b constraint on two set variables.classEinAIt constructs a constraint which makes sure that a given element is in the domain of the set variable.classSinAIt creates an inclusion set constraint to make sure that provided set is included in a set variable a.classXeqAIt 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.classXinAIt 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.
-