Modifier and Type | Class and Description |
---|---|
class |
AbsXeqY
Constraints |X| #= Y
Domain and bounds consistency can be used; third parameter of constructor controls this.
|
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 |
Among
Among constraint in its simplest form.
|
class |
AmongVar
Among constraint in its general form.
|
class |
And
Constraint c1 /\ c2 ...
|
class |
AndBool
If all x's are equal 1 then result variable is equal 1 too.
|
class |
Assignment
Assignment constraint implements facility to improve channeling constraints
between dual viewpoints of permutation models.
|
class |
Circuit
Circuit constraint assures that all variables build a Hamiltonian
circuit.
|
class |
Count
Count 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| #= 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 |
ElementVariable
ElementVariable 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 constraint2
|
class |
IfThenBool
Constraint ( X => Y ) <=> Z.
|
class |
IfThenElse
Constraint if constraint1 then constraint2 else constraint3
*
|
class |
In
Constraints X to belong to a specified domain.
|
class |
LexOrder
It constructs a LexOrder (lexicographical order) 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
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" #<=> B
|
class |
Subcircuit
Subcircuit constraint assures that all variables build a
subcircuit.
|
class |
Sum
Sum constraint implements the summation over several Variable's .
|
class |
SumWeight
SumWeight constraint implements the weighted summation over several
variables .
|
class |
SumWeightDom
SumWeightDom constraint implements the weighted summation over several
variables .
|
class |
Values
Constraint Values counts number of different values on a list of Variables.
|
class |
XdivYeqZ
Constraint X div Y #= Z
|
class |
XeqC
Constraints X #= C
Domain consistency is used.
|
class |
XeqY
Constraints X #= Y
Domain consistency is used.
|
class |
XexpYeqZ
Constraint X ^ Y #= Z
Boundary consistecny is used.
|
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
Constraint X mod Y = Z
|
class |
XmulCeqZ
Constraint X * C #= Z
Boundary consistency is used.
|
class |
XmulYeqC
Constraint X * Y #= C
Boundary consistency is used.
|
class |
XmulYeqZ
Constraint X * Y #= Z
Boundary consistency is used.
|
class |
XneqC
Constraints X #\= C
|
class |
XneqY
Constraints X #\= Y
Domain consistency is used.
|
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
Bound consistency is used.
|
class |
XplusYgtC
Constraint X + Y #> C
|
class |
XplusYlteqZ
Constraint X + Y =< Z
Bound consistency is used.
|
class |
XplusYplusCeqZ
Constraints X + Y + C #= Z.
|
class |
XplusYplusQeqZ
Constraint X + Y + Q = Z
Bound consistency is used.
|
class |
XplusYplusQgtC
Constraint X + Y + Q > C
|
Modifier and Type | Field and Description |
---|---|
ArrayList<Constraint> |
SoftGCC.decomposition |
ArrayList<Constraint> |
SoftAlldifferent.decomposition |
Modifier and Type | Method and Description |
---|---|
Constraint |
Constraint.getGuideConstraint()
It specifies a constraint which if imposed by search will enhance
propagation of this constraint.
|
Constraint |
Sum.getGuideConstraint() |
Constraint |
In.getGuideConstraint() |
Constraint |
Alldistinct.getGuideConstraint() |
Modifier and Type | Class and Description |
---|---|
class |
Binpacking
Binpacking constraint implements bin packing problem.
|
Modifier and Type | Class and Description |
---|---|
class |
Geost |
Modifier and Type | Class and Description |
---|---|
class |
Knapsack
It specifies a knapsack constraint.
|
Modifier and Type | Class and Description |
---|---|
class |
NetworkFlow
The network flow constraint.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<Constraint> |
Arithmetic.decompose(Store store) |
ArrayList<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.
|
ArrayList<Constraint> |
Arithmetic.primitiveDecomposition(Store store) |
Modifier and Type | Class and Description |
---|---|
class |
Regular
Regular constraint accepts only the assignment to variables which is accepted by
an automaton.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<Constraint> |
Regular.decompose(Store store) |
Modifier and Type | Field and 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.
|
Modifier and Type | Field and Description |
---|---|
ArrayList<Constraint> |
Store.removeLevelLateListeners
More advanced constraints may require to be informed of a backtrack to be
able to recover the older versions of the data structures.
|
ArrayList<Constraint> |
Store.removeLevelListeners
More advanced constraints may require to be informed of a backtrack to be
able to recover the older versions of the data structures.
|
ArrayList<Constraint> |
Domain.searchConstraints
It specifies constraints which are attached to current domain.
|
HashMap<Var,HashSet<Constraint>> |
Store.watchedConstraints
This keeps information about watched constraints by given variable.
|
Modifier and Type | Method and 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.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<Constraint> |
Domain.constraints()
It returns all the constraints attached currently to the domain.
|
ArrayList<Constraint> |
Domain.searchConstraints() |
ArrayList<Constraint> |
Store.select(Class<Constraint> classname)
It selects constraints of a given type from queue changed.
|
Modifier and Type | Method and Description |
---|---|
void |
Store.addChanged(Constraint c)
This function schedules given constraint for re-evaluation.
|
boolean |
Store.deRegisterRemoveLevelListener(Constraint C)
This function deregisters a constraint from the listeners queue.
|
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 |
IntVar.putConstraint(Constraint c) |
void |
BooleanVar.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 |
IntVar.putModelConstraint(Constraint c,
int pruningEvent)
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 |
Var.putModelConstraint(Constraint c,
int pruningEvent)
It registers constraint with current variable, so anytime this variable
is changed the constraint is reevaluated.
|
void |
SmallDenseDomain.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 |
IntervalDomain.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.
|
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 |
BoundDomain.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.putSearchConstraint(Constraint c)
It registers constraint with current variable, so always when 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 |
Var.putSearchConstraint(Constraint c)
It registers constraint with current variable, so always when this variable
is changed the constraint is reevaluated.
|
void |
SmallDenseDomain.putSearchConstraint(int storeLevel,
Var var,
Constraint C) |
void |
IntervalDomain.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.
|
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 |
BoundDomain.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.
|
boolean |
Store.registerRemoveLevelLateListener(Constraint C)
Any constraint in general may need information what variables have changed
since the last time a consistency was called.
|
boolean |
Store.registerRemoveLevelListener(Constraint C)
Any constraint in general may need information what variables have changed
since the last time a consistency was called.
|
void |
Store.registerWatchedLiteralConstraint(Var v,
Constraint C)
It register variable to watch given constraint.
|
void |
IntVar.removeConstraint(Constraint c)
It detaches constraint from the current variable, so change in variable
will not cause constraint reevaluation.
|
void |
BooleanVar.removeConstraint(Constraint constraint)
It unregisters constraint with 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.
|
void |
SmallDenseDomain.removeModelConstraint(int storeLevel,
Var var,
Constraint c) |
void |
IntervalDomain.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.
|
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 |
BoundDomain.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 |
IntervalDomain.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.
|
void |
SmallDenseDomain.removeSearchConstraint(int storeLevel,
Var var,
int position,
Constraint C) |
void |
IntervalDomain.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.
|
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 |
BoundDomain.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.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<Constraint> |
Store.select(Class<Constraint> classname)
It selects constraints of a given type from queue changed.
|
Modifier and Type | Field and Description |
---|---|
ArrayList<Constraint> |
MagicSquares.guidingShaving
It specifies the list of constraints which can be used for guiding shaving.
|
ArrayList<Constraint> |
NonTransitiveDice.shavingConstraints
It contains constraints which can be used for shaving guidance.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ExampleFD.shavingSearch(ArrayList<Constraint> guidingShaving,
boolean printInfo)
It searches with shaving which is guided by supplied constraints.
|
Modifier and Type | Field and Description |
---|---|
ArrayList<Constraint> |
QCP.shavingConstraints
It contains constraints which can be used to guide shaving.
|
Modifier and Type | Class and Description |
---|---|
class |
AbsPeqR
Constraints |P| #= R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
AcosPeqR
Constraints acos(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
AsinPeqR
Constraints asin(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
AtanPeqR
Constraints atan(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
CosPeqR
Constraints cos(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
CosPeqR_decomposed
Constraints cos(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
ElementFloat
ElementFloat 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
Domain consistency is used.
|
class |
LinearFloat
LinearFloat constraint implements the weighted summation over several
Variable's .
|
class |
LnPeqR
Constraints Ln(P) #= Q for P and Q floats
Domain consistency is used.
|
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
Boundary consistency is used.
|
class |
PdivQeqR
Constraint P / Q = R for floats
Boundary consistency is used.
|
class |
PeqC
Constraints P #= C
Domain consistency is used.
|
class |
PeqQ
Constraints P #= Q for P and Q floats
Domain consistency is used.
|
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
Bound consistency is used.
|
class |
PminusQeqR
Constraint P - Q = R
Bound consistency is used.
|
class |
PmulCeqR
Constraint P * C = R for floats
Boundary consistency is used.
|
class |
PmulQeqR
Constraint P * Q = R for floats
Boundary consistency is used.
|
class |
PneqC
Constraints P != C
Domain consistency is used.
|
class |
PneqQ
Constraints P #= Q for P and Q floats
Domain consistency is used.
|
class |
PplusCeqR
Constraint P + C #= R
Bound consistency is used.
|
class |
PplusQeqR
Constraint P + Q = R
Bound consistency is used.
|
class |
SinPeqR
Constraints sin(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
SqrtPeqR
Constraint sqrt(P) = R for floats
Boundary consistency is used.
|
class |
TanPeqR
Constraints sin(P) = R
Bounds consistency can be used; third parameter of constructor controls this.
|
class |
XeqP
Constraints X #= P for X and P floats
Domain consistency is used.
|
Modifier and Type | Field and Description |
---|---|
static Set<Constraint> |
Derivative.derivateConstraints |
Modifier and Type | Method and Description |
---|---|
static Set<Constraint> |
Derivative.derivativeConstraints() |
Modifier and Type | Method and Description |
---|---|
static void |
Derivative.defineConstraint(FloatVar f,
Constraint c) |
Modifier and Type | Class and Description |
---|---|
class |
Linear
Linear constraint implements the weighted summation over several
Variable's .
|
Modifier and Type | Method and Description |
---|---|
void |
FloatVar.putConstraint(Constraint c) |
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.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.putSearchConstraint(Constraint c)
It registers constraint with current variable, so always when 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.removeConstraint(Constraint c)
It detaches constraint from the current variable, so change in variable
will not cause constraint reevaluation.
|
void |
FloatIntervalDomain.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 |
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.
|
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.
|
Modifier and Type | Method and Description |
---|---|
void |
Shaving.addShavingConstraint(Constraint c)
It adds shaving constraint to the list of constraints guiding shaving.
|
Modifier and Type | Class and 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 |
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 |
Lex
It creates a lex constraint on a list of set variables.
|
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.
|
Modifier and Type | Method and Description |
---|---|
void |
SetVar.putConstraint(Constraint c) |
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.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.putSearchConstraint(Constraint c)
It registers constraint with current variable, so always when 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.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.
|
Copyright © 2015. All rights reserved.