Modifier and Type | Field and Description |
---|---|
Hashtable<Var,Integer> |
Constraint.consistencyPruningEvents
It specifies the event which must occur in order for the consistency function to
be called.
|
Hashtable<Var,Integer> |
PrimitiveConstraint.notConsistencyPruningEvents
It specifies the events which must occur for notConsistency()
method being executed.
|
protected Set<Var> |
Constraint.scope
It specifies a set of variables that in the scope of this constraint.
|
Map<Var,Integer> |
ExtensionalSupportSTR.varToIndex
It specifies the mapping of the variable into its index.
|
Modifier and Type | Method and Description |
---|---|
Var |
Alldistinct.getGuideVariable() |
Var |
Constraint.getGuideVariable()
This function provides a variable which assigned a value returned
by will enhance propagation of this constraint.
|
Var |
In.getGuideVariable() |
Var |
Sum.getGuideVariable() |
Var |
SumInt.getGuideVariable() |
Modifier and Type | Method and Description |
---|---|
Set<Var> |
Constraint.arguments()
It returns the variables in a scope of the constraint.
|
Set<Var> |
Element.arguments() |
List<Var> |
DecomposedConstraint.auxiliaryVariables() |
static Set<Var> |
DecomposedConstraint.getDubletonsSkipSingletons(Var[] parameters) |
static Stream<Var> |
Rectangle.getStream(Rectangle[] scope) |
Modifier and Type | Method and Description |
---|---|
void |
DecomposedConstraint.checkInputForDuplicationSkipSingletons(String a,
Var[] parameters) |
int |
ArgMax.getConsistencyPruningEvent(Var var) |
int |
ArgMin.getConsistencyPruningEvent(Var var) |
int |
Constraint.getConsistencyPruningEvent(Var var)
It retrieves the pruning event which causes reevaluation of the
constraint.
|
int |
Element.getConsistencyPruningEvent(Var var) |
int |
Eq.getConsistencyPruningEvent(Var var) |
int |
IfThen.getConsistencyPruningEvent(Var var) |
int |
IfThenElse.getConsistencyPruningEvent(Var var) |
int |
Implies.getConsistencyPruningEvent(Var var) |
int |
Not.getConsistencyPruningEvent(Var var) |
int |
Reified.getConsistencyPruningEvent(Var var) |
int |
Subcircuit.getConsistencyPruningEvent(Var var) |
int |
Xor.getConsistencyPruningEvent(Var var) |
static Set<Var> |
DecomposedConstraint.getDubletonsSkipSingletons(Var[] parameters) |
int |
And.getNestedPruningEvent(Var var,
boolean mode) |
int |
Eq.getNestedPruningEvent(Var var,
boolean mode) |
int |
IfThen.getNestedPruningEvent(Var var,
boolean mode) |
int |
IfThenElse.getNestedPruningEvent(Var var,
boolean mode) |
int |
Implies.getNestedPruningEvent(Var var,
boolean mode) |
int |
Not.getNestedPruningEvent(Var var,
boolean mode) |
int |
Or.getNestedPruningEvent(Var var,
boolean mode) |
int |
PrimitiveConstraint.getNestedPruningEvent(Var var,
boolean mode)
It retrieves the pruning event for which any composed constraint which
uses this constraint should be evaluated.
|
int |
Reified.getNestedPruningEvent(Var var,
boolean mode) |
int |
Xor.getNestedPruningEvent(Var var,
boolean mode) |
int |
XorBool.getNestedPruningEvent(Var var,
boolean mode) |
int |
Eq.getNotConsistencyPruningEvent(Var var) |
int |
IfThen.getNotConsistencyPruningEvent(Var var) |
int |
IfThenElse.getNotConsistencyPruningEvent(Var var) |
int |
Implies.getNotConsistencyPruningEvent(Var var) |
int |
Not.getNotConsistencyPruningEvent(Var var) |
int |
PrimitiveConstraint.getNotConsistencyPruningEvent(Var var)
It retrieves the pruning event which causes reevaluation of the
constraint notConsistency() function.
|
int |
Reified.getNotConsistencyPruningEvent(Var var) |
int |
Xor.getNotConsistencyPruningEvent(Var var) |
boolean |
Constraint.grounded(Var[] vars)
It checks if provided variables are grounded (singletons).
|
void |
Alldiff.queueVariable(int level,
Var var) |
void |
Alldifferent.queueVariable(int level,
Var V) |
void |
Alldistinct.queueVariable(int level,
Var var) |
void |
Among.queueVariable(int level,
Var var) |
void |
AmongVar.queueVariable(int level,
Var var) |
void |
And.queueVariable(int level,
Var variable) |
void |
Assignment.queueVariable(int level,
Var var) |
void |
Constraint.queueVariable(int level,
Var var)
This is a function called to indicate which variable in a scope of
constraint has changed.
|
void |
Diff.queueVariable(int level,
Var V) |
void |
Element.queueVariable(int level,
Var V) |
void |
ElementInteger.queueVariable(int level,
Var var) |
void |
ElementVariable.queueVariable(int level,
Var var) |
void |
Eq.queueVariable(int level,
Var var) |
void |
ExtensionalConflictVA.queueVariable(int level,
Var var) |
void |
ExtensionalSupportSTR.queueVariable(int level,
Var V) |
void |
ExtensionalSupportVA.queueVariable(int level,
Var var) |
void |
GCC.queueVariable(int level,
Var var) |
void |
IfThen.queueVariable(int level,
Var variable) |
void |
IfThenElse.queueVariable(int level,
Var variable) |
void |
Implies.queueVariable(int level,
Var variable) |
void |
LexOrder.queueVariable(int level,
Var var) |
void |
Linear.queueVariable(int level,
Var var)
Deprecated.
|
void |
Not.queueVariable(int level,
Var variable) |
void |
Or.queueVariable(int level,
Var var) |
void |
Reified.queueVariable(int level,
Var variable) |
void |
SumWeight.queueVariable(int level,
Var var) |
void |
SumWeightDom.queueVariable(int level,
Var var)
Deprecated.
|
void |
ValuePrecede.queueVariable(int level,
Var var) |
void |
VariableTrace.queueVariable(int level,
Var var) |
void |
Xor.queueVariable(int level,
Var variable) |
void |
Constraint.setConsistencyPruningEvent(Var var,
int pruningEvent)
It allows to customize the event for a given variable which
causes the re-execution of the consistency method for a constraint.
|
void |
PrimitiveConstraint.setNotConsistencyPruningEvent(Var var,
int pruningEvent)
It allows to specify customized events required to trigger execution
of notConsitency() method.
|
protected void |
Constraint.setScope(Var... variables) |
protected void |
Constraint.setScope(Var[]... variables) |
void |
Constraint.setWatchedVariableGrounded(Var var) |
Modifier and Type | Method and Description |
---|---|
protected void |
Constraint.setScope(Set<? extends Var> set) |
protected void |
Constraint.setScope(Stream<Var> scope) |
Constructor and Description |
---|
Constraint(Var[]... vars) |
VariableTrace(Var v)
It constructs trace daemon for variable v
|
VariableTrace(Var[] vs)
It constructs trace daemon for variables vs
|
Constructor and Description |
---|
Assignment(List<? extends Var> xs,
List<? extends Var> ds,
int min)
It enforces the relationship x[d[i]-min]=i+min and
d[x[i]-min]=i+min.
|
Assignment(List<? extends Var> xs,
List<? extends Var> ds,
int min)
It enforces the relationship x[d[i]-min]=i+min and
d[x[i]-min]=i+min.
|
Constraint(Set<? extends Var> set) |
Constraint(Stream<Var> vars) |
VariableTrace(List<Var> vs)
It constructs trace daemon for variables vs
|
Modifier and Type | Method and Description |
---|---|
void |
Binpacking.queueVariable(int level,
Var var) |
Modifier and Type | Field and Description |
---|---|
protected List<Var> |
Diffn.auxVar |
protected List<Var> |
DiffnDecomposed.auxVar |
Modifier and Type | Method and Description |
---|---|
List<Var> |
Diffn.auxiliaryVariables() |
List<Var> |
DiffnDecomposed.auxiliaryVariables() |
static Stream<Var> |
Rectangle.getStream(Rectangle[] scope) |
Modifier and Type | Field and Description |
---|---|
ArrayList<Var> |
GeostObject.variables
It stores all finite domain variables in connection to this object.
|
Modifier and Type | Method and Description |
---|---|
Collection<Var> |
AllowedArea.definingVariables() |
Collection<Var> |
DomainHoles.definingVariables() |
Collection<Var> |
ForbiddenArea.definingVariables() |
abstract Collection<Var> |
InternalConstraint.definingVariables()
It provides a collection, possibly empty, of variables which define this constraint.
|
Collection<Var> |
ObstacleObjectFrame.definingVariables() |
Collection<Var> |
GeostObject.getVariables()
It returns finite domain variables which belong to this object.
|
Modifier and Type | Method and Description |
---|---|
int |
Geost.getConsistencyPruningEvent(Var var) |
void |
GeostObject.onGround(Var variable)
It is executed as soon as any object variable is grounded.
|
void |
GeostObject.onUnGround(Var variable)
It is executed as soon as backtracking has occurred making previously grounded variable ungrounded again.
|
void |
Geost.queueVariable(int level,
Var v) |
Modifier and Type | Method and Description |
---|---|
protected void |
Geost.flushQueue(Collection<Var> variables)
It does the processing needed given the set of variables that was updated
between two consecutive calls to the consistency function.
|
Modifier and Type | Method and Description |
---|---|
void |
Knapsack.queueVariable(int level,
Var v) |
Modifier and Type | Method and Description |
---|---|
int |
NetworkFlow.getConsistencyPruningEvent(Var var) |
int |
ArcCompanion.getPruningEvent(Var var) |
int |
DomainStructure.getPruningEvent(Var var) |
int |
MultiVarHandler.getPruningEvent(Var variable) |
int |
VarHandler.getPruningEvent(Var variable)
Retrieves the consistency pruning event of a handler variable that causes
the handler to be reevaluated.
|
void |
NetworkFlow.queueVariable(int level,
Var variable)
Search & Backtracking
|
Modifier and Type | Method and Description |
---|---|
void |
Regular.queueVariable(int level,
Var var) |
Modifier and Type | Method and Description |
---|---|
void |
SimpleTable.queueVariable(int level,
Var v) |
void |
Table.queueVariable(int level,
Var v) |
Modifier and Type | Class and Description |
---|---|
class |
BooleanVar
Defines a variable and related operations on it.
|
class |
IntVar
Defines a Finite Domain Variable (FDV) and related operations on it.
|
Modifier and Type | Field and Description |
---|---|
Var[] |
Store.vars
It stores integer variables created within a store.
|
Modifier and Type | Field and Description |
---|---|
List<Var> |
Store.auxilaryVariables
It contains all auxilary variables created by decomposable constraints.
|
Map<String,Var> |
Store.variablesHashMap
It may be used for faster retrieval of variables given their id.
|
Map<Var,Set<Constraint>> |
Store.watchedConstraints
This keeps information about watched constraints by given variable.
|
Modifier and Type | Method and Description |
---|---|
static <T extends Var> |
Var.addPositionMapping(Map<T,Integer> position,
T[] list,
boolean skipSingletons,
Class clazz) |
static <T extends Var,R> |
Var.addPositionMapping(Map<T,R> position,
T[] list,
Function<T,R> function,
boolean skipSingletons,
Class clazz) |
static <T extends Var,R> |
Var.createEmptyPositioning() |
static <T extends Var> |
Var.positionMapping(T[] list,
boolean skipSingletons,
Class clazz) |
static <T extends Var,R> |
Var.positionMapping(T[] list,
Function<T,R> function,
boolean skipSingletons,
Class clazz) |
Modifier and Type | Method and Description |
---|---|
Var |
Store.findVariable(String id)
This function looks for a variable with given id.
|
Modifier and Type | Method and Description |
---|---|
void |
Store.addChanged(Var var,
int pruningEvent,
int info)
This function schedules all attached (not yet satisfied constraints) for
given variable for re-evaluation.
|
static <T extends Var> |
Var.addPositionMapping(Map<T,Integer> position,
T[] list,
boolean skipSingletons,
Class clazz) |
static <T extends Var,R> |
Var.addPositionMapping(Map<T,R> position,
T[] list,
Function<T,R> function,
boolean skipSingletons,
Class clazz) |
void |
Store.deregisterWatchedLiteralConstraint(Var v,
Constraint c)
Variable given as a parameter no longer watches constraint given as
parameter.
|
abstract void |
Domain.in(int level,
Var var,
Domain domain)
It enforces that this domain is included within the specified domain.
|
void |
IntDomain.in(int level,
Var var,
Domain domain) |
void |
IntDomain.in(int storeLevel,
Var var,
IntDomain domain)
It updates the domain to have values only within the domain.
|
void |
IntervalDomain.in(int storeLevel,
Var var,
IntDomain domain)
It updates the domain to have values only within the domain.
|
void |
SmallDenseDomain.in(int storeLevel,
Var var,
IntDomain domain) |
abstract void |
IntDomain.in(int storeLevel,
Var var,
int min,
int max)
It updates the domain to have values only within the interval min..max.
|
void |
IntervalDomain.in(int storeLevel,
Var var,
int min,
int max)
It updates the domain to have values only within the interval min..max.
|
void |
SmallDenseDomain.in(int storeLevel,
Var var,
int min,
int max)
It updates the domain to have values only within the interval min..max.
|
void |
SmallDenseDomain.in(int storeLevel,
Var var,
long domain) |
void |
IntDomain.inComplement(int storeLevel,
Var var,
int complement)
It updates the domain to not contain the value complement.
|
void |
IntervalDomain.inComplement(int storeLevel,
Var var,
int complement)
It updates the domain to not contain the value complement.
|
void |
SmallDenseDomain.inComplement(int storeLevel,
Var var,
int complement) |
abstract void |
IntDomain.inComplement(int storeLevel,
Var var,
int min,
int max)
It updates the domain so it does not contain the supplied interval.
|
void |
IntervalDomain.inComplement(int storeLevel,
Var var,
int min,
int max) |
void |
SmallDenseDomain.inComplement(int storeLevel,
Var var,
int minComplement,
int maxComplement) |
void |
IntDomain.inMax(int storeLevel,
Var var,
int max)
It updates the domain according to the maximum value and stamp value.
|
void |
IntervalDomain.inMax(int storeLevel,
Var var,
int max)
It updates the domain according to the maximum value and stamp value.
|
void |
SmallDenseDomain.inMax(int storeLevel,
Var var,
int max) |
void |
IntDomain.inMin(int storeLevel,
Var var,
int min)
It updates the domain according to the minimum value and stamp value.
|
void |
IntervalDomain.inMin(int storeLevel,
Var var,
int min)
It updates the domain according to the minimum value and stamp value.
|
void |
SmallDenseDomain.inMin(int storeLevel,
Var var,
int min) |
abstract void |
IntDomain.inShift(int storeLevel,
Var var,
IntDomain domain,
int shift)
It updates the domain to contain the elements as specifed by the domain,
which is shifted.
|
void |
IntervalDomain.inShift(int storeLevel,
Var var,
IntDomain domain,
int shift)
It updates the domain to contain the elements as specifed by the domain,
which is shifted.
|
void |
SmallDenseDomain.inShift(int storeLevel,
Var var,
IntDomain domain,
int shift) |
static <T extends Var> |
Var.positionMapping(T[] list,
boolean skipSingletons,
Class clazz) |
static <T extends Var,R> |
Var.positionMapping(T[] list,
Function<T,R> function,
boolean skipSingletons,
Class clazz) |
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.
|
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.
|
int |
Store.putVariable(Var var)
This function is used to register a variable within a store.
|
void |
Store.recordChange(Var recordedVariable)
Any change of finite domain variable must also be recorded, so intervals
denoting changed variables can be updated.
|
void |
Store.registerWatchedLiteralConstraint(Var v,
Constraint c)
It register variable to watch given constraint.
|
abstract void |
Domain.removeLevel(int level,
Var var)
It removes the specified level.
|
void |
IntervalDomain.removeLevel(int level,
Var var)
It removes a level of a domain.
|
void |
SmallDenseDomain.removeLevel(int level,
Var var) |
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) |
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.
|
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 |
Store.throwFailException(Var x)
It throws an exception after printing trace information if tracing is
switched on.
|
Modifier and Type | Class and Description |
---|---|
class |
CPvizNetworkFlow.NetListener<T extends Var> |
Modifier and Type | Method and Description |
---|---|
boolean |
ExampleFD.searchMasterSlave(List<Var> masterVars,
List<Var> slaveVars)
It conducts master-slave search.
|
boolean |
ExampleFD.searchMasterSlave(List<Var> masterVars,
List<Var> slaveVars)
It conducts master-slave search.
|
Modifier and Type | Class and Description |
---|---|
class |
CrossWord.PrintListener<T extends Var>
It is a simple print listener to print every tenth solution encountered.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ExampleSet.searchMasterSlave(List<Var> masterVars,
List<Var> slaveVars)
It conducts master-slave search.
|
boolean |
ExampleSet.searchMasterSlave(List<Var> masterVars,
List<Var> slaveVars)
It conducts master-slave search.
|
Modifier and Type | Method and Description |
---|---|
void |
ElementFloat.queueVariable(int level,
Var var) |
void |
LinearFloat.queueVariable(int level,
Var var) |
Modifier and Type | Method and Description |
---|---|
void |
Linear.queueVariable(int level,
Var var) |
Modifier and Type | Class and Description |
---|---|
class |
FloatVar
Defines a Float Domain Variable and related operations on it.
|
Modifier and Type | Method and Description |
---|---|
void |
FloatDomain.in(int level,
Var var,
Domain domain) |
abstract void |
FloatDomain.in(int storeLevel,
Var var,
double min,
double max)
It updates the domain to have values only within the interval min..max.
|
void |
FloatIntervalDomain.in(int storeLevel,
Var var,
double min,
double max)
It updates the domain to have values only within the interval min..max.
|
void |
FloatDomain.in(int storeLevel,
Var var,
FloatDomain domain)
It updates the domain to have values only within the domain.
|
void |
FloatIntervalDomain.in(int storeLevel,
Var var,
FloatDomain domain)
It updates the domain to have values only within the domain.
|
void |
FloatDomain.inComplement(int storeLevel,
Var var,
double complement)
It updates the domain to not contain the value complement.
|
void |
FloatIntervalDomain.inComplement(int storeLevel,
Var var,
double complement)
It updates the domain to not contain the value complement.
|
abstract void |
FloatDomain.inComplement(int storeLevel,
Var var,
double min,
double max)
It updates the domain so it does not contain the supplied interval.
|
void |
FloatIntervalDomain.inComplement(int storeLevel,
Var var,
double min,
double max) |
void |
FloatDomain.inMax(int storeLevel,
Var var,
double max)
It updates the domain according to the maximum value and stamp value.
|
void |
FloatIntervalDomain.inMax(int storeLevel,
Var var,
double max)
It updates the domain according to the maximum value and stamp value.
|
void |
FloatDomain.inMin(int storeLevel,
Var var,
double min)
It updates the domain according to the minimum value and stamp value.
|
void |
FloatIntervalDomain.inMin(int storeLevel,
Var var,
double min)
It updates the domain according to the minimum value and stamp value.
|
abstract void |
FloatDomain.inShift(int storeLevel,
Var var,
FloatDomain domain,
double shift)
It updates the domain to contain the elements as specifed by the domain,
which is shifted.
|
void |
FloatIntervalDomain.inShift(int storeLevel,
Var var,
FloatDomain domain,
double shift)
It updates the domain to contain the elements as specifed by the domain,
which is shifted.
|
void |
FloatDomain.inValue(int level,
Var var,
double value)
It reduces domain to a single value.
|
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 |
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 |
FloatIntervalDomain.removeLevel(int level,
Var var)
It removes a level of a domain.
|
void |
FloatDomain.removeModelConstraint(int storeLevel,
Var var,
Constraint C) |
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 | Class and Description |
---|---|
class |
LargestDomainFloat<T extends Var>
Defines LargestDomainFloat comparator for Variables.
|
class |
Optimize<T extends Var>
Implements optimization for floating point varibales
|
class |
Optimize.ResultListener<T extends Var> |
class |
SmallestDomainFloat<T extends Var>
Defines a Smallest Domain comparator for Variables.
|
class |
SplitRandomSelectFloat<T extends Var>
It is simple and customizable selector of decisions (constraints) which will
be enforced by search.
|
class |
SplitSelectFloat<T extends Var>
It is simple and customizable selector of decisions (constraints) which will
be enforced by search.
|
class |
WeightedDegreeFloat<T extends Var>
Defines a WeightedDegreeFloat comparator for Variables.
|
Constructor and Description |
---|
ResultListener(Var[] v) |
SplitRandomSelectFloat(Store store,
T[] variables,
ComparatorVariable<T> varSelect)
The constructor to create a simple choice select mechanism.
|
SplitRandomSelectFloat(Store store,
T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect)
It constructs a simple selection mechanism for choice points.
|
SplitSelectFloat(Store store,
T[] variables,
ComparatorVariable<T> varSelect)
The constructor to create a simple choice select mechanism.
|
SplitSelectFloat(Store store,
T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect)
It constructs a simple selection mechanism for choice points.
|
Modifier and Type | Class and Description |
---|---|
class |
Solve.CostListener<T extends Var> |
Modifier and Type | Method and Description |
---|---|
Var |
FlatzincLoader.getCost() |
Var[] |
SearchItem.vars() |
Modifier and Type | Method and Description |
---|---|
DepthFirstSearch<Var> |
FlatzincLoader.getDFS() |
SelectChoicePoint<Var> |
FlatzincLoader.getSelectChoicePoint() |
Modifier and Type | Method and Description |
---|---|
void |
Tables.addOutVar(Var v)
It adds an output variable.
|
void |
Tables.addSearchArray(Var[] v)
It adds a search array.
|
void |
Tables.addSearchFloatArray(Var[] v)
It adds a search array.
|
void |
Tables.addSearchFloatVar(Var v)
It adds a search variable.
|
void |
Tables.addSearchSetArray(Var[] v)
It adds an array of search set variables.
|
void |
Tables.addSearchSetVar(Var v)
It adds a search set variable.
|
void |
Tables.addSearchVar(Var v)
It adds a search variable.
|
boolean |
Tables.isOutput(Var v)
It checks whether a variable is output variable.
|
Modifier and Type | Method and Description |
---|---|
Set<Var> |
SatWrapper.arguments() |
Modifier and Type | Method and Description |
---|---|
int |
SatWrapper.getConsistencyPruningEvent(Var var) |
void |
SatWrapper.queueVariable(int level,
Var var) |
Modifier and Type | Class and Description |
---|---|
class |
ActivityMax<T extends Var>
Defines a pruning activity comparatorfor variables.
|
class |
ActivityMaxDeg<T extends Var>
Defines a pruning activity comparatorfor variables.
|
class |
ActivityMin<T extends Var>
Defines a pruning activity comparatorfor variables.
|
class |
ActivityMinDeg<T extends Var>
Defines a pruning activity comparatorfor variables.
|
class |
AFCMax<T extends Var>
Defines a AccumulatedFailureCount comparator (afc) for variables.
|
class |
AFCMaxDeg<T extends Var>
Defines a AccumulatedFailureCount comparator (afc) for variables.
|
class |
AFCMin<T extends Var>
Defines a AccumulatedFailureCount comparator (afc) for variables.
|
class |
AFCMinDeg<T extends Var>
Defines a AccumulatedFailureCount comparator (afc) for variables.
|
interface |
ComparatorVariable<T extends Var>
Defines an interface for comparing variables.
|
class |
CreditCalculator<T extends Var>
Defines functionality of credit search.
|
class |
DepthFirstSearch<T extends Var>
Implements Depth First Search with number of possible plugins (listeners) to
be attached to modify the search.
|
interface |
ExitChildListener<T extends Var>
Defines a listener which is called by the search if a child node is exited.
|
class |
FailConstraintsStatistics<T extends Var>
Defines functionality for FailConstraintsStatistics plug-in, that
collects statistics on the failed constraints; both for each
individual constraint as well as a class of constraints.
|
interface |
Indomain<T extends Var>
Defines a interface for different indomain enumeration methods.
|
class |
IndomainDefaultValue<T extends Var>
IndomainDefaultValue - implements enumeration method based on the
selection of the default value for each variable first.
|
class |
IndomainHierarchical<T extends Var>
IndomainHierarchical - implements enumeration method based on the selection
of the preferred indomain for each variable.
|
class |
InputOrderSelect<T extends Var>
It is simple input order selector of variables.
|
class |
LargestDomain<T extends Var>
Defines LargestDomain comparator for Variables.
|
class |
LDS<T extends Var>
Defines functionality of limited discrepancy search.
|
class |
MinDomainOverDegree<T extends Var>
Defines a MinDomainOverDegree comparator for Variables.
|
class |
MostConstrainedDynamic<T extends Var>
Defines a MostConstrainedDynamic comparator for Variables.
|
class |
MostConstrainedStatic<T extends Var>
Defines a MostConstraintStatic comparator for Variables.
|
class |
OneSolution<T extends Var>
Defines functionality for OneSolution plug-in, that is the search
with this plug-in will stop after funding first solution.
|
class |
PrintOutListener<T extends Var>
It is a simple example how it is possible to extend existing listeners to
add your own functionality.
|
class |
PrioritySearch<T extends Var>
PrioritySearch selects first a row in the matrix based on metric of
the variable at the pririty vector.
|
class |
RandomSelect<T extends Var>
It is simple and customizable selector of decisions (constraints) which will
be enforced by search.
|
class |
RandomVar<T extends Var>
Defines a RandomVar comparator for variables.
|
interface |
Search<T extends Var>
All searches needs to implement this interface in order to be manipulable by
a large variety of search listeners.
|
interface |
SelectChoicePoint<T extends Var>
Defines an interface for defining different methods for selecting next search
decision to be taken.
|
class |
SimpleMatrixSelect<T extends Var>
SimpleMatrixSelect selects first a row in the matrix based on metric of the
variable at pivotPosition.
|
class |
SimpleSelect<T extends Var>
It is simple and customizable selector of decisions (constraints) which will
be enforced by search.
|
class |
SimpleSolutionListener<T extends Var>
It defines a simple solution listener which should be used if some basic
functionality of search when a solution is encountered are required.
|
class |
SmallestDomain<T extends Var>
Defines a Smallest Domain comparator for Variables.
|
interface |
SolutionListener<T extends Var>
Defines an interface which needs to be implemented by all classes which wants
to be informed about the solution.
|
class |
TraceGenerator<T extends Var>
TODO
TraceGenerator should accept as input to constructor a Search object.
|
class |
WeightedDegree<T extends Var>
Defines a WeightedDegree comparator for variables.
|
Modifier and Type | Field and Description |
---|---|
Var |
DepthFirstSearch.costVariable
It represents the cost variable.
|
T[] |
RandomSelect.searchVariables |
T[] |
SimpleSelect.searchVariables |
T[] |
SimpleSolutionListener.vars
It is executed right after consistency of the current search node.
|
Modifier and Type | Field and Description |
---|---|
Search<? extends Var> |
DepthFirstSearch.masterSearch
If this search is a sub-search then this pointer will point out to the
master search (i.e.
|
SolutionListener<? extends Var> |
SimpleSolutionListener.parentSolutionListener
If this search is a slave search than each solution within this search
must be connected to a solution of the master search.
|
List<Var> |
TraceGenerator.tracedVar
It specifies the list of variables that are being traced.
|
Map<Var,Integer> |
TraceGenerator.varIndex |
Modifier and Type | Method and Description |
---|---|
Var |
DepthFirstSearch.getCostVariable() |
Var |
Search.getCostVariable()
It returns the cost variable.
|
T[] |
DepthFirstSearch.getVariables() |
T[] |
Search.getVariables()
It returns the order of variables used by functions returning a solution
in terms of the values.
|
T[] |
SimpleSolutionListener.getVariables()
It returns null if no solution was recorded, or the variables for which
the solution(s) was recorded.
|
T[] |
SolutionListener.getVariables()
It returns the variables in the same order as the one used to encode
solutions.
|
T[] |
PrioritySearch.getVariables(PrioritySearch ps) |
Modifier and Type | Method and Description |
---|---|
void |
TraceGenerator.addTracedVar(Var v) |
boolean |
DepthFirstSearch.labeling(Store store,
SelectChoicePoint<T> select,
Var costVar) |
boolean |
PrioritySearch.labeling(Store store,
SelectChoicePoint<T> select,
Var costVar) |
boolean |
Search.labeling(Store store,
SelectChoicePoint<T> select,
Var costVar)
It performs search using supplied choice point selection heuristic,
as well as costVariable as aim at finding an optimal solution.
|
boolean |
PrioritySearch.labeling(Store store,
Var costVar) |
void |
DepthFirstSearch.setCostVar(Var cost) |
void |
Search.setCostVar(Var cost)
It sets the reference to the cost variable.
|
void |
PrioritySearch.setCostVariable(Var cost) |
void |
SimpleSolutionListener.setVariables(T[] vs) |
Modifier and Type | Method and Description |
---|---|
void |
DepthFirstSearch.addChildSearch(Search<? extends Var> child) |
void |
Search.addChildSearch(Search<? extends Var> child)
It adds another child search to this one.
|
void |
DepthFirstSearch.setMasterSearch(Search<? extends Var> master) |
void |
Search.setMasterSearch(Search<? extends Var> master)
If the search is called by a master search then the search may need to
obtain some information about the master search.
|
void |
SimpleSolutionListener.setParentSolutionListener(SolutionListener<? extends Var> parent) |
void |
SolutionListener.setParentSolutionListener(SolutionListener<? extends Var> parent)
It allows to inform sub-search of what is the current number of the
solution in master search.
|
Constructor and Description |
---|
InputOrderSelect(Store store,
T[] variables,
Indomain<T> indomain)
It constructs an input order selection procedure.
|
PrioritySearch(T[] priority,
ComparatorVariable<T> comparator,
DepthFirstSearch<T>[] dfs)
It constructs a PrioritySearch variable ordering.
|
RandomSelect(T[] variables,
Indomain<T> indomain)
The constructor to create a simple choice select mechanism.
|
SimpleMatrixSelect(T[][] vars,
ComparatorVariable<T> mainComparator,
ComparatorVariable<T> tieBreakingComparator,
Indomain<T> indomain)
It constructs a MatrixSelection variable ordering.
|
SimpleMatrixSelect(T[][] vars,
ComparatorVariable<T> mainComparator,
ComparatorVariable<T> tieBreakingComparator,
Indomain<T> indomain,
int pivotPosition)
This constructor allows to specify all parameters for the selection mechanism.
|
SimpleMatrixSelect(T[][] vars,
ComparatorVariable<T> mainComparator,
Indomain<T> indomain)
It constructs a MatrixSelection variable ordering.
|
SimpleMatrixSelect(T[][] vars,
Indomain<T> indomain)
This constructor uses default values for all parameters.
|
SimpleSelect(T[] variables,
ComparatorVariable<T> varSelect,
ComparatorVariable<T> tieBreakerVarSelect,
Indomain<T> indomain)
It constructs a simple selection mechanism for choice points.
|
SimpleSelect(T[] variables,
ComparatorVariable<T> varSelect,
Indomain<T> indomain)
The constructor to create a simple choice select mechanism.
|
TraceGenerator(Search<T> search,
SelectChoicePoint<T> select,
Var[] vars)
It creates a CPviz trace generator around proper select choice point object.
|
TraceGenerator(Search<T> search,
SelectChoicePoint<T> select,
Var[] vars,
String treeFilename,
String visFilename)
It creates a CPviz trace generator around proper select choice point object.
|
Modifier and Type | Class and Description |
---|---|
class |
Calculator<T extends Var>
Defines interface for a calculator for restart search
|
class |
ConstantCalculator<T extends Var>
Defines functionality for constant calculator for restart search
|
class |
GeometricCalculator<T extends Var>
Defines functionality for constant calculator for restart search
|
class |
LinearCalculator<T extends Var>
Defines functionality for constant calculator for restart search
|
class |
LubyCalculator<T extends Var>
Defines functionality for constant calculator for restart search
|
class |
RestartSearch<T extends Var>
Implements restart search.
|
class |
RestartSearch.CostListener<T extends Var> |
Modifier and Type | Method and Description |
---|---|
void |
CustomReport.addVariables(Var[] vs) |
Constructor and Description |
---|
CustomReport(Var[] vs) |
RestartSearch(Store store,
DepthFirstSearch<T> s,
SelectChoicePoint<T> sel,
Calculator calculator,
Var cost) |
Modifier and Type | Interface and Description |
---|---|
interface |
ImproveSolution<T extends Var>
Defines an interface for defining different methods for selecting next search
decision to be taken.
|
class |
SGMPCSCalculator<T extends Var>
Defines functionality for SGMPCS search
|
Modifier and Type | Method and Description |
---|---|
int |
CardAeqX.getConsistencyPruningEvent(Var var) |
int |
ElementSet.getConsistencyPruningEvent(Var var) |
int |
Match.getConsistencyPruningEvent(Var var) |
int |
SumWeightedSet.getConsistencyPruningEvent(Var var) |
int |
XeqA.getConsistencyPruningEvent(Var var) |
int |
XinA.getConsistencyPruningEvent(Var var) |
int |
XeqA.getNestedPruningEvent(Var var,
boolean mode) |
int |
XinA.getNestedPruningEvent(Var var,
boolean mode) |
int |
AeqS.getNotConsistencyPruningEvent(Var var) |
int |
XeqA.getNotConsistencyPruningEvent(Var var) |
int |
XinA.getNotConsistencyPruningEvent(Var var) |
void |
AdiffBeqC.queueVariable(int level,
Var variable) |
void |
AdisjointB.queueVariable(int level,
Var variable) |
void |
AintersectBeqC.queueVariable(int level,
Var variable) |
void |
AunionBeqC.queueVariable(int level,
Var variable) |
Modifier and Type | Class and Description |
---|---|
class |
SetVar
Defines a Finite Domain Variable (FDV) and related operations on it.
|
Modifier and Type | Method and Description |
---|---|
void |
SetDomain.in(int level,
Var var,
Domain domain) |
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 |
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 |
SetDomain.removeLevel(int level,
Var var)
It removes the specified level.
|
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.
|
Modifier and Type | Field and Description |
---|---|
Map<Var,List<T>> |
QueueForward.forwardMap |
Modifier and Type | Method and Description |
---|---|
void |
QueueForward.queueForward(int level,
Var variable) |
Constructor and Description |
---|
QueueForward(Collection<T> constraints,
Var var) |
QueueForward(T[] constraints,
Var[] vars) |
QueueForward(T constraint,
Var var) |
Constructor and Description |
---|
QueueForward(Collection<T> constraints,
Collection<Var> variables) |
QueueForward(T[] constraints,
Collection<Var> vars) |
QueueForward(T constraint,
Collection<Var> vars) |
Copyright © 2022. All rights reserved.