Uses of Class
org.jacop.constraints.Constraint

Packages that use Constraint

Package	Description
org.jacop.api
org.jacop.constraints
org.jacop.constraints.binpacking
org.jacop.constraints.cumulative
org.jacop.constraints.diffn
org.jacop.constraints.geost
org.jacop.constraints.knapsack
org.jacop.constraints.netflow
org.jacop.constraints.regular
org.jacop.constraints.replace
org.jacop.constraints.table
org.jacop.core
org.jacop.examples.fd
org.jacop.examples.fd.qcp
org.jacop.floats.constraints
org.jacop.floats.constraints.linear
org.jacop.floats.core
org.jacop.fz
org.jacop.fz.constraints
org.jacop.satwrapper
org.jacop.search
org.jacop.set.constraints
org.jacop.set.core
org.jacop.util

Uses of Constraint in org.jacop.api

Classes in org.jacop.api with type parameters of type Constraint

Modifier and Type	Interface	Description
interface	Replaceable<T extends Constraint>	Interface that provides ability to configure constraint store to replace a particular type of constraints into another one.

Methods in org.jacop.api that return types with arguments of type Constraint

Modifier and Type	Method	Description
DecomposedConstraint<Constraint>	Replaceable.replace(T constraint)

Uses of Constraint in org.jacop.constraints

Classes in org.jacop.constraints with type parameters of type Constraint

Modifier and Type	Class	Description
class	DecomposedConstraint<T extends Constraint>	Standard unified interface/abstract class for constraints, which can only be decomposed.

Subclasses of Constraint in org.jacop.constraints

Modifier and Type	Class	Description
class	AbsXeqY	Constraints |X| #= Y
class	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	AllEqual	Constraints forall i != j: x[i] #= x[j]
class	Among	Among constraint in its simplest form.
class	AmongVar	Among constraint in its general form.
class	And	Constraint c1 /\ c2 ...
class	AndBoolSimple	If both a and b are equal 1 then result variable is equal 1 too.
class	AndBoolVector
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
class	AtMost
class	BoolClause	I defines a boolean clause for 0/1 variables x_i and y_i.
class	ChannelImply	ChannelImply constraints "B => constraint".
class	ChannelReif	ChannelReif constraints "constraint" <=> B.
class	Circuit	Circuit constraint assures that all variables build a Hamiltonian circuit.
class	Conditional	Conditional constraint implements conditional constraint satisfiability.
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
class	CountValuesBounds	CountValuesBounds constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.
class	CountVar
class	Cumulative	Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.
class	Decreasing	Decreasing constraint assures that all variables are in decreasing order.
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| #= Z
class	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
class	ElementVariable	ElementVariable constraint defines a relation list[index - indexOffset] = value.
class	ElementVariableFast
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 constraint2
class	IfThenBool	Constraint ( X => Y ) <=> Z.
class	IfThenElse	Constraint if constraint1 then constraint2 else constraint3 *
class	Implies
class	In	Constraints X to belong to a specified domain.
class	Increasing	Increasing constraint assures that all variables are in increasing order.
class	LexOrder	It constructs a LexOrder (lexicographical order) constraint.
class	Linear	Deprecated. As of release 4.3.1 replaced by LinearInt constraint.
class	LinearInt
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	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
class	SeqPrecedeChain
class	Subcircuit	Subcircuit constraint assures that all variables build a subcircuit.
class	Sum
class	SumBool
class	SumInt	SumInt constraint implements the summation over several variables.
class	SumWeight
class	SumWeightDom	Deprecated. As of release 4.3.1 replaced by LinearIntDom constraint.
class	ValuePrecede
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 #= Z
class	XeqC
class	XeqY	Constraints X #= Y
class	XexpYeqZ	Constraint X ^ Y #= Z
class	XgtC	Constraint X > C
class	XgteqC	Constraints X >= C
class	XgteqY	Constraints X >= Y
class	XgtY	Constraint X > Y
class	XltC	Constraint X < C
class	XlteqC	Constraint X <= C
class	XlteqY	Constraint X <= Y
class	XltY	Constraint X < Y
class	XmodYeqZ
class	XmulCeqZ
class	XmulYeqC	Constraint X * Y #= C
class	XmulYeqZ
class	XneqC
class	XneqY	Constraints X #\= Y
class	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 #= C
class	XplusYeqZ	Constraint X + Y = Z
class	XplusYgtC	Constraint X + Y> C
class	XplusYlteqZ	Constraint X + Y=< Z

Fields in org.jacop.constraints declared as Constraint

Modifier and Type	Field	Description
(package private) Constraint	Element.c

Fields in org.jacop.constraints with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) List<Constraint>	AndBoolVector.constraints
(package private) List<Constraint>	EqBool.constraints
protected List<Constraint>	Increasing.constraints
(package private) List<Constraint>	Lex.constraints	It contains constraints of the lex constraint decomposition.
(package private) List<Constraint>	OrBoolVector.constraints
(package private) List<Constraint>	Sequence.constraints
(package private) List<Constraint>	Stretch.constraints
List<Constraint>	SoftAlldifferent.decomposition
List<Constraint>	SoftGCC.decomposition

Methods in org.jacop.constraints that return Constraint

Modifier and Type	Method	Description
static Constraint	Element.choose(IntVar index, int[] values, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, int[] values, IntVar value, int shift)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value, int shift)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, IntVar[] variables, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, IntVar[] variables, IntVar value, int shift)	It constructs element constraint based on variables.
Constraint	Alldistinct.getGuideConstraint()
Constraint	Constraint.getGuideConstraint()	It specifies a constraint which if imposed by search will enhance propagation of this constraint.
Constraint	In.getGuideConstraint()
Constraint	Sum.getGuideConstraint()
Constraint	SumInt.getGuideConstraint()

Methods in org.jacop.constraints that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	AndBoolVector.decompose(Store store)
List<Constraint>	Constraint.decompose(Store store)	It returns an array list of constraint which are used to decompose this constraint.
List<Constraint>	EqBool.decompose(Store store)
List<Constraint>	Increasing.decompose(Store store)
List<Constraint>	Lex.decompose(Store store)
List<Constraint>	OrBoolVector.decompose(Store store)
List<Constraint>	Sequence.decompose(Store store)
List<Constraint>	SoftAlldifferent.decompose(Store store)
List<Constraint>	SoftGCC.decompose(Store store)
List<Constraint>	Stretch.decompose(Store store)
static List<Constraint>	Sequence.decomposeByRegular(Sequence sequence)	Preferred and default option of decomposing Sequence constraint.
List<Constraint>	Lex.decomposeLE(Store store)
List<Constraint>	Lex.decomposeLERegular(Store store)
List<Constraint>	Lex.decomposeLT(Store store)
List<Constraint>	Lex.decomposeLTRegular(Store store)
List<Constraint>	SoftAlldifferent.primitiveDecomposition(Store store)
List<Constraint>	SoftGCC.primitiveDecomposition(Store store)

Methods in org.jacop.constraints with parameters of type Constraint

Modifier and Type	Method	Description
private Set<RemoveLevelLate>	Constraint.computeFixpoint(Constraint c, Set<RemoveLevelLate> fixpoint)

Method parameters in org.jacop.constraints with type arguments of type Constraint

Modifier and Type	Method	Description
void	Constraint.updateAFC(Set<Constraint> allConstraints, double decay)

Uses of Constraint in org.jacop.constraints.binpacking

Subclasses of Constraint in org.jacop.constraints.binpacking

Modifier and Type	Class	Description
class	Binpacking	Binpacking constraint implements bin packing problem.

Uses of Constraint in org.jacop.constraints.cumulative

Subclasses of Constraint in org.jacop.constraints.cumulative

Modifier and Type	Class	Description
class	Cumulative
class	CumulativeBasic
class	CumulativeOptional
(package private) class	CumulativePrimary
class	CumulativeUnary
class	CumulativeUnaryOptional

Uses of Constraint in org.jacop.constraints.diffn

Subclasses of Constraint 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	Nooverlap	Nooverlap constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.

Fields in org.jacop.constraints.diffn with type parameters of type Constraint

Modifier and Type	Field	Description
protected List<Constraint>	Diffn.constraints
protected List<Constraint>	DiffnDecomposed.constraints

Methods in org.jacop.constraints.diffn that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	Diffn.decompose(Store store)
List<Constraint>	DiffnDecomposed.decompose(Store store)

Uses of Constraint in org.jacop.constraints.geost

Subclasses of Constraint in org.jacop.constraints.geost

Modifier and Type	Class	Description
class	Geost

Uses of Constraint in org.jacop.constraints.knapsack

Subclasses of Constraint in org.jacop.constraints.knapsack

Modifier and Type	Class	Description
class	Knapsack	It specifies a knapsack constraint.

Uses of Constraint in org.jacop.constraints.netflow

Subclasses of Constraint in org.jacop.constraints.netflow

Modifier and Type	Class	Description
class	NetworkFlow	The network flow constraint.

Fields in org.jacop.constraints.netflow with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) List<Constraint>	Arithmetic.decomposition

Methods in org.jacop.constraints.netflow that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	Arithmetic.decompose(Store store)
List<Constraint>	Arithmetic.primitiveDecomposition(Store store)
List<Constraint>	NetworkBuilder.primitiveDecomposition(Store store)	Generally speaking, especially in case of multiple arcs between two nodes and structure constraints imposed on arcs makes it hard to decompose network flow constraint into primitive ones.

Method parameters in org.jacop.constraints.netflow with type arguments of type Constraint

Modifier and Type	Method	Description
private void	NetworkBuilder.sumC(List<Constraint> list, Store store, List<IntVar> vars, IntVar result)

Uses of Constraint in org.jacop.constraints.regular

Subclasses of Constraint 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.

Fields in org.jacop.constraints.regular with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) List<Constraint>	Regular.constraints

Methods in org.jacop.constraints.regular that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	Regular.decompose(Store store)

Uses of Constraint in org.jacop.constraints.replace

Methods in org.jacop.constraints.replace that return types with arguments of type Constraint

Modifier and Type	Method	Description
DecomposedConstraint<Constraint>	ReifiedIfThen.replace(Reified constraint)

Uses of Constraint in org.jacop.constraints.table

Subclasses of Constraint in org.jacop.constraints.table

Modifier and Type	Class	Description
class	SimpleTable	SimpleTable implements the table constraint using a method presented in
class	Table	Table implements the table constraint using a method presented in

Uses of Constraint in org.jacop.core

Fields in org.jacop.core declared as Constraint

Modifier and Type	Field	Description
Constraint	Store.currentConstraint	It stores constraint which is currently re-evaluated.
Constraint[][]	Domain.modelConstraints	It specifies constraints which are attached to current domain, each array has different pruning event.
Constraint	Store.recentlyFailedConstraint	It stores constraint that has recently failed during store.consistency() execution.

Fields in org.jacop.core with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) Set<Constraint>	Store.allConstraints
private Map<Class<? extends Constraint>,Set<Replaceable>>	Store.replacements	It stores all the active replacements of constraints that are being applied upon constraint imposition.
List<Constraint>	Domain.searchConstraints	It specifies constraints which are attached to current domain.
Map<Var,Set<Constraint>>	Store.watchedConstraints	This keeps information about watched constraints by given variable.

Methods in org.jacop.core with type parameters of type Constraint

Modifier and Type	Method	Description
<T extends Constraint> void	Store.imposeDecomposition(DecomposedConstraint<T> c)	This function imposes a decomposable constraint to a store.
<T extends Constraint> void	Store.imposeDecomposition(DecomposedConstraint<T> c, int queueIndex)	This function imposes a constraint decomposition to a store.
<T extends Constraint> void	Store.imposeDecompositionWithConsistency(DecomposedConstraint<T> c)	In some special cases it may be beneficial to compute consistency of constraint store immediately after the decomposed constraint is imposed.

Methods in org.jacop.core that return Constraint

Modifier and Type	Method	Description
Constraint	Store.getCurrentConstraint()	This function returns the constraint which is currently reevaluated.
Constraint	Store.getFirstChanged()	This function returns the constraint scheduled for re-evaluation.

Methods in org.jacop.core that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	Domain.constraints()	It returns all the constraints attached currently to the domain.
Set<Constraint>	Store.getConstraints()
List<Constraint>	Domain.searchConstraints()

Methods in org.jacop.core with parameters of type Constraint

Modifier and Type	Method	Description
void	Store.addChanged(Constraint c)	This function schedules given constraint for re-evaluation.
void	Store.deregisterWatchedLiteralConstraint(Constraint c)	Watched constraint given as parameter is being removed, no variable will be watching it.
void	Store.deregisterWatchedLiteralConstraint(Var v, Constraint c)	Variable given as a parameter no longer watches constraint given as parameter.
void	Store.impose(Constraint c)	This function imposes a constraint to a store.
void	Store.impose(Constraint c, int queueIndex)	This function imposes a constraint to a store.
void	Store.imposeWithConsistency(Constraint c)	In some special cases it may be beneficial to compute consistency of constraint store immediately after the constraint is imposed.
void	Store.imposeWithConsistency(Constraint c, int queueIndex)	In some special cases it may be beneficial to compute consistency of constraint store immediately after the constraint is imposed.
void	BooleanVar.putConstraint(Constraint c)
void	IntVar.putConstraint(Constraint c)
abstract void	Var.putConstraint(Constraint c)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
void	BooleanVar.putModelConstraint(Constraint constraint, int pruningEvent)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
abstract void	Domain.putModelConstraint(int storeLevel, Var var, Constraint C, int pruningEvent)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	IntDomain.putModelConstraint(int storeLevel, Var var, Constraint c, int pruningEvent)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	IntVar.putModelConstraint(Constraint c, int pruningEvent)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
abstract void	Var.putModelConstraint(Constraint c, int pruningEvent)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
void	BooleanVar.putSearchConstraint(Constraint constraint)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
abstract void	Domain.putSearchConstraint(int storeLevel, Var var, Constraint C)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	IntDomain.putSearchConstraint(int storeLevel, Var var, Constraint c)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	IntVar.putSearchConstraint(Constraint c)	It registers constraint with current variable, so always when this variable is changed the constraint is reevaluated.
abstract void	Var.putSearchConstraint(Constraint c)	It registers constraint with current variable, so always when this variable is changed the constraint is reevaluated.
void	Store.registerWatchedLiteralConstraint(Var v, Constraint c)	It register variable to watch given constraint.
void	BooleanVar.removeConstraint(Constraint constraint)	It unregisters constraint with current variable, so change in variable will not cause constraint reevaluation.
void	IntVar.removeConstraint(Constraint c)	It detaches constraint from the current variable, so change in variable will not cause constraint reevaluation.
abstract void	Var.removeConstraint(Constraint c)	It detaches constraint from the current variable, so change in variable will not cause constraint reevaluation.
abstract void	Domain.removeModelConstraint(int storeLevel, Var var, Constraint c)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
void	IntDomain.removeModelConstraint(int storeLevel, Var var, Constraint c)
abstract void	Domain.removeSearchConstraint(int storeLevel, Var var, int position, Constraint c)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
void	IntDomain.removeSearchConstraint(int storeLevel, Var var, int position, Constraint c)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
void	IntDomain.removeSearchConstraint(int storeLevel, Var var, Constraint c)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
(package private) void	Store.updateActivities(Constraint constraint)

Method parameters in org.jacop.core with type arguments of type Constraint

Modifier and Type	Method	Description
boolean	Store.deregisterReplacement(Replaceable<? extends Constraint> replacement)	It makes it possible to deregister the replacement.
boolean	Store.registerReplacement(Replaceable<? extends Constraint> replacement)	It makes it possible to register replacement for a particular constraint type.

Uses of Constraint in org.jacop.examples.fd

Fields in org.jacop.examples.fd with type parameters of type Constraint

Modifier and Type	Field	Description
List<Constraint>	MagicSquares.guidingShaving	It specifies the list of constraints which can be used for guiding shaving.
List<Constraint>	NonTransitiveDice.shavingConstraints	It contains constraints which can be used for shaving guidance.

Methods in org.jacop.examples.fd that return Constraint

Modifier and Type	Method	Description
static Constraint	Gates.tableConstraintProviderUsingExtensionalSTR(IntVar[] vars, int[][] tuples)
static Constraint	Gates.tableConstraintProviderUsingSimpleTable(IntVar[] vars, int[][] tuples)

Method parameters in org.jacop.examples.fd with type arguments of type Constraint

Modifier and Type	Method	Description
void	Gates.and(BooleanVar in1, BooleanVar in2, BooleanVar out, BiFunction<IntVar[],int[][],Constraint> tableConstraintProvider)	It imposes an extensional constraint enforcing an and relationship between two input parameters and an output parameter.
void	Gates.model(BiFunction<IntVar[],int[][],Constraint> tableConstraintProvider)
void	Gates.not(BooleanVar in, BooleanVar out, BiFunction<IntVar[],int[][],Constraint> tableConstraintProvider)	It imposes an extensional constraint enforcing an not relationship between input parameter and an output parameter.
void	Gates.or(BooleanVar in1, BooleanVar in2, BooleanVar out, BiFunction<IntVar[],int[][],Constraint> tableConstraintProvider)	It imposes an extensional constraint enforcing an or relationship between two input parameters and an output parameter.
boolean	ExampleFD.shavingSearch(List<Constraint> guidingShaving, boolean printInfo)	It searches with shaving which is guided by supplied constraints.
void	Gates.xor(BooleanVar in1, BooleanVar in2, BooleanVar out, BiFunction<IntVar[],int[][],Constraint> tableConstraintProvider)	It imposes an extensional constraint enforcing an xor relationship between two input parameters and an output parameter.

Uses of Constraint in org.jacop.examples.fd.qcp

Fields in org.jacop.examples.fd.qcp with type parameters of type Constraint

Modifier and Type	Field	Description
List<Constraint>	QCP.shavingConstraints	It contains constraints which can be used to guide shaving.

Uses of Constraint in org.jacop.floats.constraints

Subclasses of Constraint in org.jacop.floats.constraints

Modifier and Type	Class	Description
class	AbsPeqR	Constraints |P| #= R
class	AcosPeqR	Constraints acos(P) = R
class	AsinPeqR	Constraints asin(P) = R
class	AtanPeqR	Constraints atan(P) = R
class	CeilPeqX	Constraints ceil(P) #= X for integer variable X and float variable P.
class	CosPeqR	Constraints cos(P) = R
class	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 floats
class	FloorPeqX	Constraints floor(P) #= X for integer variable X and float variable P.
class	LinearFloat	LinearFloat constraint implements the weighted summation over several Variable's .
class	LnPeqR	Constraints Ln(P) #= Q for P and Q floats
class	Max	Max constraint implements the Maximum/2 constraint.
class	Min	Min constraint implements the minimum/2 constraint.
class	PdivCeqR	Constraint P / C = R for floats
class	PdivQeqR	Constraint P / Q = R for floats
class	PeqC	Constraints P #= C
class	PeqQ	Constraints P #= Q for P and Q floats
class	PgtC	Constraint P > C
class	PgteqC	Constraints P >= C for floats
class	PgteqQ	Constraints P >= Q for floats
class	PgtQ	Constraint P > Q for floats
class	PltC	Constraint P < C for floats
class	PlteqC	Constraint X <= C for floats
class	PlteqQ	Constraint P <= Q for floats
class	PltQ	Constraint P < Q for floats
class	PminusCeqR	Constraint P - C = R
class	PminusQeqR	Constraint P - Q = R
class	PmulCeqR	Constraint P * C = R for floats
class	PmulQeqR	Constraint P * Q = R for floats
class	PneqC	Constraints P != C
class	PneqQ	Constraints P #= Q for P and Q floats
class	PplusCeqR	Constraint P + C #= R
class	PplusQeqR	Constraint P + Q = R
class	RoundPeqX	Constraints round(P) #= X for integer variable X and float variable P.
class	SinPeqR	Constraints sin(P) = R
class	SqrtPeqR	Constraint sqrt(P) = R for floats
class	SumFloat	SumFloat constraint implements the weighted summation over several Variable's .
class	TanPeqR	Constraints sin(P) = R
class	XeqP	Constraints X #= P for X and P floats

Fields in org.jacop.floats.constraints with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) List<Constraint>	CosPeqR_decomposed.constraints	It contains constraints of the CosPeqR_decomposed constraint decomposition.
(package private) static Map<FloatVar,Constraint>	Derivative.definitionConstraint
(package private) static Set<Constraint>	Derivative.derivateConstraints
(package private) static Stack<Constraint>	Derivative.eval
(package private) Stack<Constraint>	MultivariateIntervalNewton.eval

Methods in org.jacop.floats.constraints that return Constraint

Modifier and Type	Method	Description
(package private) Constraint	MultivariateIntervalNewton.constraint(FloatVar v)
(package private) static Constraint	Derivative.resolveConstraint(FloatVar f, List<Constraint> cs)

Methods in org.jacop.floats.constraints that return types with arguments of type Constraint

Modifier and Type	Method	Description
List<Constraint>	CosPeqR_decomposed.decompose(Store store)
static final Set<Constraint>	Derivative.derivativeConstraints()

Methods in org.jacop.floats.constraints with parameters of type Constraint

Modifier and Type	Method	Description
static void	Derivative.defineConstraint(FloatVar f, Constraint c)
(package private) static final void	Derivative.poseDerivativeConstraint(Constraint c)

Method parameters in org.jacop.floats.constraints with type arguments of type Constraint

Modifier and Type	Method	Description
(package private) static Constraint	Derivative.resolveConstraint(FloatVar f, List<Constraint> cs)

Uses of Constraint in org.jacop.floats.constraints.linear

Subclasses of Constraint 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 Constraint in org.jacop.floats.core

Methods in org.jacop.floats.core with parameters of type Constraint

Modifier and Type	Method	Description
void	FloatVar.putConstraint(Constraint c)
void	FloatDomain.putModelConstraint(int storeLevel, Var var, Constraint C, int pruningEvent)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	FloatVar.putModelConstraint(Constraint c, int pruningEvent)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
void	FloatIntervalDomain.putSearchConstraint(int storeLevel, Var var, Constraint C)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	FloatVar.putSearchConstraint(Constraint c)	It registers constraint with current variable, so always when this variable is changed the constraint is reevaluated.
void	FloatVar.removeConstraint(Constraint c)	It detaches constraint from the current variable, so change in variable will not cause constraint reevaluation.
void	FloatDomain.removeModelConstraint(int storeLevel, Var var, Constraint C)
void	FloatIntervalDomain.removeSearchConstraint(int storeLevel, Var var, int position, Constraint C)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
void	FloatIntervalDomain.removeSearchConstraint(int storeLevel, Var var, Constraint C)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.

Uses of Constraint in org.jacop.fz

Methods in org.jacop.fz with parameters of type Constraint

Modifier and Type	Method	Description
(package private) void	Solve.pose(Constraint c)
(package private) void	VariablesParameters.pose(Store store, Constraint c)

Uses of Constraint in org.jacop.fz.constraints

Fields in org.jacop.fz.constraints with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) ArrayList<Constraint>	Support.delayedConstraints

Methods in org.jacop.fz.constraints with type parameters of type Constraint

Modifier and Type	Method	Description
(package private) <T extends Constraint> void	GraphConstraints.gen_jacop_graph_isomorphism(SimpleNode node)
(package private) <T extends Constraint> void	Support.poseDC(DecomposedConstraint<T> c)

Methods in org.jacop.fz.constraints that return Constraint

Modifier and Type	Method	Description
(package private) Constraint	Support.fzXeqCImplied(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXeqCReified(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXneqCImplied(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXneqCReified(IntVar x, int c, IntVar b)

Methods in org.jacop.fz.constraints with parameters of type Constraint

Modifier and Type	Method	Description
(package private) void	Support.pose(Constraint c)

Uses of Constraint in org.jacop.satwrapper

Subclasses of Constraint in org.jacop.satwrapper

Modifier and Type	Class	Description
final class	SatWrapper	wrapper to communicate between SAT solver and CP solver.

Methods in org.jacop.satwrapper with parameters of type Constraint

Modifier and Type	Method	Description
final void	SatWrapper.impose(Constraint constraint)	add the constraint to the wrapper (ie, constraint.imposeToSat(this))

Uses of Constraint in org.jacop.search

Fields in org.jacop.search declared as Constraint

Modifier and Type	Field	Description
(package private) Constraint	DepthFirstSearch.cost	It represents the constraint which enforces that next solution is better than currently best solution.
(package private) Constraint	Shaving.recentlyFailedConstraint

Fields in org.jacop.search with type parameters of type Constraint

Modifier and Type	Field	Description
(package private) List<Constraint>	Shaving.shavingConstraints	It contains list of constraints which suggest shaving explorations.

Methods in org.jacop.search with parameters of type Constraint

Modifier and Type	Method	Description
void	Shaving.addShavingConstraint(Constraint c)	It adds shaving constraint to the list of constraints guiding shaving.
(package private) void	FailConstraintsStatistics.collectFailStatistics(Constraint currentConstraint)

Uses of Constraint in org.jacop.set.constraints

Subclasses of Constraint 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	ChannelBoolSet	Channel constraint reqires the array of Booleans b to be a representation of the set s: i in s <-> b[i].
class	ChannelIntSet	Channel constraint requires that array of int variables x and array of set variables y are related such that (x[i] = j) <-> (i in s[j]).
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	PartitionSet	Channel constraint requires that array of int variables x and array of set variables y are related such that (x[i] = j) <-> (i in s[j]).
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.

Uses of Constraint in org.jacop.set.core

Methods in org.jacop.set.core with parameters of type Constraint

Modifier and Type	Method	Description
void	SetVar.putConstraint(Constraint c)
void	SetDomain.putModelConstraint(int storeLevel, Var var, Constraint C, int pruningEvent)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	SetVar.putModelConstraint(Constraint c, int pruningEvent)	It registers constraint with current variable, so anytime this variable is changed the constraint is reevaluated.
void	SetDomain.putSearchConstraint(int storeLevel, Var var, Constraint C)	It adds a constraint to a domain, it should only be called by putConstraint function of Variable object.
void	SetVar.putSearchConstraint(Constraint c)	It registers constraint with current variable, so always when this variable is changed the constraint is reevaluated.
void	SetVar.removeConstraint(Constraint c)	It detaches constraint from the current variable, so change in variable will not cause constraint reevaluation.
void	SetDomain.removeModelConstraint(int storeLevel, Var var, Constraint C)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.
void	SetDomain.removeSearchConstraint(int storeLevel, Var var, int position, Constraint C)	It removes a constraint from a domain, it should only be called by removeConstraint function of Variable object.

Uses of Constraint in org.jacop.util

Classes in org.jacop.util with type parameters of type Constraint

Modifier and Type	Class	Description
class	QueueForward<T extends Constraint>	Utility class that allows for constraints like Xor, Reified, etc that take other constraints as parameters to forward any changes of variables to the constraints that were provided as arguments.

Constructors in org.jacop.util with parameters of type Constraint

Modifier	Constructor	Description
	QueueForward(T[] constraints, Collection<Var> vars)
	QueueForward(T[] constraints, Var[] vars)