Modifier and Type | Method and Description |
---|---|
void |
XplusYplusQgtC.consistency(Store store) |
void |
XplusYplusQeqZ.consistency(Store store) |
void |
XplusYplusCeqZ.consistency(Store store) |
void |
XplusYlteqZ.consistency(Store store) |
void |
XplusYgtC.consistency(Store store) |
void |
XplusYeqZ.consistency(Store store) |
void |
XplusYeqC.consistency(Store store) |
void |
XplusClteqZ.consistency(Store store) |
void |
XplusCeqZ.consistency(Store store) |
void |
XorBool.consistency(Store store) |
void |
Xor.consistency(Store store) |
void |
XneqY.consistency(Store store) |
void |
XneqC.consistency(Store store) |
void |
XmulYeqZ.consistency(Store store) |
void |
XmulYeqC.consistency(Store store) |
void |
XmulCeqZ.consistency(Store store) |
void |
XmodYeqZ.consistency(Store store) |
void |
XltY.consistency(Store store) |
void |
XlteqY.consistency(Store store) |
void |
XlteqC.consistency(Store store) |
void |
XltC.consistency(Store store) |
void |
XgtY.consistency(Store store) |
void |
XgteqY.consistency(Store store) |
void |
XgteqC.consistency(Store store) |
void |
XgtC.consistency(Store store) |
void |
XexpYeqZ.consistency(Store store) |
void |
XeqY.consistency(Store store) |
void |
XeqC.consistency(Store store) |
void |
XdivYeqZ.consistency(Store store) |
void |
Values.consistency(Store store) |
void |
SumWeight.consistency(Store store) |
void |
Sum.consistency(Store store) |
void |
Reified.consistency(Store store) |
void |
OrBool.consistency(Store store) |
void |
Or.consistency(Store store) |
void |
Not.consistency(Store store) |
void |
NoGood.consistency(Store store) |
void |
Min.consistency(Store store) |
void |
Max.consistency(Store store) |
void |
In.consistency(Store store) |
void |
IfThenElse.consistency(Store store) |
void |
IfThenBool.consistency(Store store) |
void |
IfThen.consistency(Store store) |
void |
GCC.consistency(Store store) |
void |
ExtensionalSupportVA.consistency(Store store) |
void |
ExtensionalSupportSTR.consistency(Store store) |
void |
ExtensionalSupportMDD.consistency(Store s) |
void |
ExtensionalConflictVA.consistency(Store store) |
void |
EqBool.consistency(Store store) |
void |
Eq.consistency(Store store) |
void |
ElementVariable.consistency(Store store) |
void |
ElementInteger.consistency(Store store) |
void |
Element.consistency(Store store) |
void |
Distance.consistency(Store store) |
void |
Diff.consistency(Store store) |
void |
Cumulative.consistency(Store store) |
void |
CountStudents.consistency(Store store) |
void |
Count.consistency(Store store) |
abstract void |
Constraint.consistency(Store store)
It is a (most probably incomplete) consistency function which removes the
values from variables domains.
|
void |
Circuit.consistency(Store store) |
void |
Assignment.consistency(Store store) |
void |
AndBool.consistency(Store store) |
void |
And.consistency(Store store) |
void |
AmongVar.consistency(Store store) |
void |
Among.consistency(Store store) |
void |
Alldistinct.consistency(Store store) |
void |
Alldifferent.consistency(Store store) |
void |
Alldiff.consistency(Store store) |
void |
AbsXeqY.consistency(Store store) |
void |
AmongVar.consistencyForX(Store store)
Is called when all y are grounded and amongForSet is equivalent to simple version of Among.
|
void |
AmongVar.consistencyForY(Store store)
It is a function which makes Y consistent if all X's are grounded.
|
void |
AmongVar.consistencyWhen_LB0_EQ_UB0(Store store)
The number of x in lbsDom is equal to the number of X intersecting ubSDom.
|
java.util.ArrayList<Constraint> |
Stretch.decompose(Store store) |
java.util.ArrayList<Constraint> |
SoftGCC.decompose(Store store) |
java.util.ArrayList<Constraint> |
SoftAlldifferent.decompose(Store store) |
java.util.ArrayList<Constraint> |
Sequence.decompose(Store store) |
java.util.ArrayList<Constraint> |
OrBool.decompose(Store store) |
java.util.ArrayList<Constraint> |
Lex.decompose(Store store) |
java.util.ArrayList<Constraint> |
EqBool.decompose(Store store) |
abstract java.util.ArrayList<Constraint> |
DecomposedConstraint.decompose(Store store)
It returns an array list of constraint which are used to decompose this
constraint.
|
java.util.ArrayList<Constraint> |
Constraint.decompose(Store store)
It returns an array list of constraint which are used to decompose this
constraint.
|
java.util.ArrayList<Constraint> |
AndBool.decompose(Store store) |
java.util.ArrayList<Constraint> |
Lex.decomposeLE(Store store) |
java.util.ArrayList<Constraint> |
Lex.decomposeLT(Store store) |
void |
XplusYplusQgtC.impose(Store store) |
void |
XplusYplusQeqZ.impose(Store store) |
void |
XplusYplusCeqZ.impose(Store store) |
void |
XplusYlteqZ.impose(Store store) |
void |
XplusYgtC.impose(Store store) |
void |
XplusYeqZ.impose(Store store) |
void |
XplusYeqC.impose(Store store) |
void |
XplusClteqZ.impose(Store store) |
void |
XplusCeqZ.impose(Store store) |
void |
XorBool.impose(Store store) |
void |
Xor.impose(Store store) |
void |
XneqY.impose(Store store) |
void |
XneqC.impose(Store store) |
void |
XmulYeqZ.impose(Store store) |
void |
XmulYeqC.impose(Store store) |
void |
XmulCeqZ.impose(Store store) |
void |
XmodYeqZ.impose(Store store) |
void |
XltY.impose(Store store) |
void |
XlteqY.impose(Store store) |
void |
XlteqC.impose(Store store) |
void |
XltC.impose(Store store) |
void |
XgtY.impose(Store store) |
void |
XgteqY.impose(Store store) |
void |
XgteqC.impose(Store store) |
void |
XgtC.impose(Store store) |
void |
XexpYeqZ.impose(Store Store) |
void |
XeqY.impose(Store store) |
void |
XeqC.impose(Store store) |
void |
XdivYeqZ.impose(Store store) |
void |
Values.impose(Store store) |
void |
SumWeight.impose(Store store) |
void |
Sum.impose(Store store) |
void |
Reified.impose(Store store) |
void |
OrBool.impose(Store store) |
void |
Or.impose(Store store) |
void |
Not.impose(Store store) |
void |
NoGood.impose(Store store) |
void |
Min.impose(Store store) |
void |
Max.impose(Store store) |
void |
In.impose(Store store) |
void |
IfThenElse.impose(Store store) |
void |
IfThenBool.impose(Store store) |
void |
IfThen.impose(Store store) |
void |
GCC.impose(Store store) |
void |
ExtensionalSupportVA.impose(Store store) |
void |
ExtensionalSupportSTR.impose(Store store) |
void |
ExtensionalSupportMDD.impose(Store store) |
void |
ExtensionalConflictVA.impose(Store store) |
void |
EqBool.impose(Store store) |
void |
Eq.impose(Store store) |
void |
ElementVariable.impose(Store store) |
void |
ElementInteger.impose(Store store) |
void |
Element.impose(Store store) |
void |
Distance.impose(Store store) |
void |
DisjointConditional.impose(Store store) |
void |
Disjoint.impose(Store store) |
void |
Diff2.impose(Store store) |
void |
Diff.impose(Store store) |
void |
Cumulative.impose(Store store) |
void |
CountStudents.impose(Store store) |
void |
Count.impose(Store store) |
abstract void |
Constraint.impose(Store store)
It imposes the constraint in a given store.
|
void |
Circuit.impose(Store store) |
void |
Assignment.impose(Store store) |
void |
AndBool.impose(Store store) |
void |
And.impose(Store store) |
void |
AmongVar.impose(Store store) |
void |
Among.impose(Store store) |
void |
Alldistinct.impose(Store store) |
void |
Alldifferent.impose(Store store) |
void |
Alldiff.impose(Store store) |
void |
AbsXeqY.impose(Store store) |
void |
Constraint.impose(Store store,
int queueIndex)
It imposes the constraint and adjusts the queue index.
|
void |
Stretch.imposeDecomposition(Store store) |
void |
SoftGCC.imposeDecomposition(Store store) |
void |
SoftAlldifferent.imposeDecomposition(Store store) |
void |
Sequence.imposeDecomposition(Store store) |
void |
OrBool.imposeDecomposition(Store store) |
void |
Lex.imposeDecomposition(Store store) |
void |
EqBool.imposeDecomposition(Store store) |
abstract void |
DecomposedConstraint.imposeDecomposition(Store store)
It imposes the constraint in a given store.
|
void |
Constraint.imposeDecomposition(Store store)
It imposes the decomposition of the given constraint in a given store.
|
void |
AndBool.imposeDecomposition(Store store) |
void |
DecomposedConstraint.imposeDecomposition(Store store,
int queueIndex)
It imposes the constraint and adjusts the queue index.
|
void |
XplusYplusQgtC.notConsistency(Store store) |
void |
XplusYplusQeqZ.notConsistency(Store store) |
void |
XplusYplusCeqZ.notConsistency(Store store) |
void |
XplusYlteqZ.notConsistency(Store store) |
void |
XplusYgtC.notConsistency(Store store) |
void |
XplusYeqZ.notConsistency(Store store) |
void |
XplusYeqC.notConsistency(Store store) |
void |
XplusClteqZ.notConsistency(Store store) |
void |
XplusCeqZ.notConsistency(Store store) |
void |
XorBool.notConsistency(Store store) |
void |
Xor.notConsistency(Store store) |
void |
XneqY.notConsistency(Store store) |
void |
XneqC.notConsistency(Store store) |
void |
XmulYeqC.notConsistency(Store store) |
void |
XltY.notConsistency(Store store) |
void |
XlteqY.notConsistency(Store store) |
void |
XlteqC.notConsistency(Store store) |
void |
XltC.notConsistency(Store store) |
void |
XgtY.notConsistency(Store store) |
void |
XgteqY.notConsistency(Store store) |
void |
XgteqC.notConsistency(Store store) |
void |
XgtC.notConsistency(Store store) |
void |
XeqY.notConsistency(Store store) |
void |
XeqC.notConsistency(Store store) |
abstract void |
PrimitiveConstraint.notConsistency(Store store)
It makes pruning in such a way that constraint is notConsistent.
|
void |
OrBool.notConsistency(Store store) |
void |
Or.notConsistency(Store store) |
void |
Not.notConsistency(Store store) |
void |
NoGood.notConsistency(Store store) |
void |
In.notConsistency(Store store) |
void |
IfThenElse.notConsistency(Store store) |
void |
IfThenBool.notConsistency(Store store) |
void |
IfThen.notConsistency(Store store) |
void |
EqBool.notConsistency(Store store) |
void |
Eq.notConsistency(Store store) |
void |
Distance.notConsistency(Store store) |
void |
AndBool.notConsistency(Store store) |
void |
And.notConsistency(Store store) |
void |
AbsXeqY.notConsistency(Store store) |
java.util.ArrayList<Constraint> |
SoftGCC.primitiveDecomposition(Store store) |
java.util.ArrayList<Constraint> |
SoftAlldifferent.primitiveDecomposition(Store store) |
Constructor and Description |
---|
Disjoint(Store store,
IntVar[][] rectangles)
It creates a diff2 constraint.
|
Modifier and Type | Method and Description |
---|---|
void |
Binpacking.consistency(Store store) |
void |
Binpacking.impose(Store store) |
Modifier and Type | Method and Description |
---|---|
void |
Geost.consistency(Store store) |
boolean |
GeostObject.TimeBoundConstraint.consistencyDurationGtZero(Store store)
It applies constraint enforcing that duration > 0
|
boolean |
GeostObject.TimeBoundConstraint.consistencyStartPlusDurationEqEnd(Store store)
It evaluates part of the constraint that ensures that start + duration = end
|
void |
Geost.impose(Store store) |
Modifier and Type | Method and Description |
---|---|
void |
Knapsack.consistency(Store store) |
void |
Knapsack.impose(Store store) |
Modifier and Type | Field and Description |
---|---|
Store |
Network.store
The store
|
Modifier and Type | Method and Description |
---|---|
void |
NetworkFlow.consistency(Store store) |
java.util.ArrayList<Constraint> |
Arithmetic.decompose(Store store) |
void |
NetworkFlow.impose(Store store) |
void |
Arithmetic.imposeDecomposition(Store store) |
void |
Network.initialize(Store store) |
java.util.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.
|
java.util.ArrayList<Constraint> |
Arithmetic.primitiveDecomposition(Store store) |
Modifier and Type | Method and Description |
---|---|
void |
Regular.consistency(Store store) |
java.util.ArrayList<Constraint> |
Regular.decompose(Store store) |
void |
Regular.impose(Store store) |
void |
Regular.imposeDecomposition(Store store) |
Modifier and Type | Field and Description |
---|---|
Store |
Var.store
Each variable is created in a store.
|
Modifier and Type | Method and Description |
---|---|
static void |
XMLSaveSupport.save(Store store,
java.lang.String filename) |
Constructor and Description |
---|
BooleanVar(Store store)
This constructor creates a variable with empty domain (standard FD
domain), automatically generated name, and empty attached constraint
list.
|
BooleanVar(Store store,
BoundDomain dom)
It creates a Boolean variable.
|
BooleanVar(Store store,
java.lang.String name)
Boolean variable constructor.
|
BooleanVar(Store store,
java.lang.String name,
BoundDomain dom)
It creates a Boolean variable.
|
BooleanVar(Store store,
java.lang.String name,
int min,
int max)
Boolean variable constructor.
|
IntVar(Store store)
This constructor creates a variable with empty domain (standard
IntervalDomain domain), automatically generated name, and empty attached
constraint list.
|
IntVar(Store store,
IntDomain dom)
It creates a variable in a given store, with a given name and
a given domain.
|
IntVar(Store store,
int min,
int max)
This constructor creates a variable with a domain between min..max,
automatically generated name, and empty attached constraint list.
|
IntVar(Store store,
java.lang.String name)
This constructor creates a variable with an empty domain (standard
IntervalDomain domain), the specified name, and an empty attached
constraint list.
|
IntVar(Store store,
java.lang.String name,
IntDomain dom)
It creates a variable in a given store, with a given name and
a given domain.
|
IntVar(Store store,
java.lang.String name,
int min,
int max)
This constructor creates a variable in a given store, with
the domain specified by min..max and with the given name.
|
MutableDomain(Store store) |
MutableDomain(Store store,
IntDomain domain) |
TimeStamp(Store store,
T input)
The constructor.
|
Constructor and Description |
---|
Constraints(Store store)
It creates an object to parse the constraint part of the flatzinc file.
|
SearchItem(Store store,
Tables table)
It constructs search part parsing object based on dictionaries
provided as well as store object within which the search will take place.
|
Solve(Store store)
It creates a parser for the solve part of the flatzinc file.
|
Tables(Store s) |
Modifier and Type | Method and Description |
---|---|
boolean |
SimpleSolutionListener.assignSolution(Store store)
It assigns the last found solution to the store.
|
boolean |
SolutionListener.assignSolution(Store store,
int no)
It imposes the constraints, so the last found solution is enforced.
|
boolean |
SimpleSolutionListener.assignSolution(Store store,
int number) |
void |
TraceGenerator.executedAtExit(Store store,
int solutionsNo) |
void |
NoGoodsCollector.executedAtExit(Store store,
int solutionsNo) |
void |
ExitListener.executedAtExit(Store store,
int solutionsNo)
It is executed right after time out is determined.
|
void |
TransformExtensional.executedAtInitialize(Store store) |
void |
InitializeListener.executedAtInitialize(Store store)
It is executed before the search starts labeling procedure.
|
boolean |
Search.labeling(Store store,
SelectChoicePoint<T> select)
It performs search using supplied choice point selection heuristic.
|
boolean |
DepthFirstSearch.labeling(Store store,
SelectChoicePoint<T> select) |
boolean |
Search.labeling(Store store,
SelectChoicePoint<T> select,
IntVar costVar)
It performs search using supplied choice point selection heuristic,
as well as costVariable as aim at finding an optimal solution.
|
boolean |
DepthFirstSearch.labeling(Store store,
SelectChoicePoint<T> select,
IntVar costVar) |
void |
Shaving.setStore(Store store)
It specifies the constraint store in which context the shaving will take place.
|
void |
Search.setStore(Store store)
It sets the reference to the store in the context of which the search operates.
|
void |
DepthFirstSearch.setStore(Store store) |
Constructor and Description |
---|
InputOrderSelect(Store store,
T[] variables,
Indomain<T> indomain)
It constructs an input order selection procedure.
|
Modifier and Type | Method and Description |
---|---|
void |
XinA.consistency(Store store) |
void |
XeqA.consistency(Store store) |
void |
SumWeightedSet.consistency(Store store) |
void |
SinA.consistency(Store store) |
void |
Match.consistency(Store store) |
void |
Lex.consistency(Store store) |
void |
ElementSet.consistency(Store store) |
void |
EinA.consistency(Store store) |
void |
CardAeqX.consistency(Store store) |
void |
CardA.consistency(Store store) |
void |
AunionBeqC.consistency(Store store) |
void |
AintersectBeqC.consistency(Store store) |
void |
AinS.consistency(Store store) |
void |
AinB.consistency(Store store) |
void |
AeqS.consistency(Store store) |
void |
AeqB.consistency(Store store) |
void |
AdisjointB.consistency(Store store) |
void |
AdiffBeqC.consistency(Store store) |
void |
XinA.impose(Store store) |
void |
XeqA.impose(Store store) |
void |
SumWeightedSet.impose(Store store) |
void |
SinA.impose(Store store) |
void |
Match.impose(Store store) |
void |
Lex.impose(Store store) |
void |
ElementSet.impose(Store store) |
void |
EinA.impose(Store store) |
void |
CardAeqX.impose(Store store) |
void |
CardA.impose(Store store) |
void |
AunionBeqC.impose(Store store) |
void |
AintersectBeqC.impose(Store store) |
void |
AinS.impose(Store store) |
void |
AinB.impose(Store store) |
void |
AeqS.impose(Store store) |
void |
AeqB.impose(Store store) |
void |
AdisjointB.impose(Store store) |
void |
AdiffBeqC.impose(Store store) |
void |
XinA.notConsistency(Store store) |
void |
XeqA.notConsistency(Store store) |
void |
SinA.notConsistency(Store store) |
void |
EinA.notConsistency(Store store) |
void |
AinS.notConsistency(Store store) |
void |
AinB.notConsistency(Store store) |
void |
AeqS.notConsistency(Store store) |
void |
AeqB.notConsistency(Store store) |
Constructor and Description |
---|
SetVar(Store store)
This constructor creates a variable with empty domain (standard
IntervalDomain domain), automatically generated name, and empty attached
constraint list.
|
SetVar(Store store,
int min,
int max)
This constructor creates a set variable with domain a set min..max
automatically generated name, and empty attached constraint list.
|
SetVar(Store store,
SetDomain dom)
It creates a variable in a given store, with a given name and
a given domain.
|
SetVar(Store store,
java.lang.String name)
This constructor creates a variable with an empty domain (standard
IntervalDomain domain), the specified name, and an empty attached
constraint list.
|
SetVar(Store store,
java.lang.String name,
int min,
int max)
This constructor creates a variable in a given store, with
the domain specified by min..max and with the given name.
|
SetVar(Store store,
java.lang.String name,
SetDomain dom)
It creates a variable in a given store, with a given name and
a given domain.
|
Modifier and Type | Method and Description |
---|---|
void |
IndexDomainView.removeUnSupportedValues(Store store)
It removes all values for which no support was found since the initialization of
the support sweep.
|
Modifier and Type | Method and Description |
---|---|
void |
RequireTagsConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Require Skills: To be assigned to a position,
an assistant must have at least all the skills
that the position’s section requires.
|
void |
RequireAssignmentConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Require Specific Assignment: Require a assistant
to fill a specific position.
|
void |
PreventSectionConflictsConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Avoid Assignment Time Conflicts: If an assistant
is assigned to two different positions, those
positions’ times must not intersect.
|
void |
PreventScheduleConflictsConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Avoid Unavailable Times: If an assistant is assigned
to a position, that position’s time must not intersect
with a time that assistant has declared to be unavailable.
|
void |
LimitStudentTotalConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Limit Student Count: When a student is being assigned to
multiple positions, limit the total number of students they
can teach overall.
|
void |
ForbidInstructorAssignmentConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Instructor Precludes Assistant: Forbid an assistant from being
assigned to a section taught by a specific professor.
|
void |
ForbidAssignmentConstraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
Forbid Specific Assignment: Forbid an assistant from filling a specific position.
|
Modifier and Type | Method and Description |
---|---|
abstract void |
Constraint.imposeConstraint(Store jacopStore,
IntVar[] variables,
Position[] positions,
Assistant[] assistants)
The important function to override for a Constraint.
|