Modifier and Type | Method and Description |
---|---|
Variable |
Solver.getVar(int i)
Returns the ith variables within the array of variables defined in
this . |
Variable[] |
Solver.getVars()
Returns the array of declared
Variable objects defined in this Solver . |
Modifier and Type | Method and Description |
---|---|
void |
Solver.associates(Variable variable)
Link a variable to
this . |
void |
Solver.unassociates(Variable variable)
Unlink the variable from
this . |
Modifier and Type | Class and Description |
---|---|
class |
Propagator<V extends Variable>
A
Propagator class defines methods to react on a Variable objects modifications. |
Modifier and Type | Field and Description |
---|---|
protected V[] |
Propagator.vars |
Modifier and Type | Method and Description |
---|---|
V[] |
Propagator.getVars() |
Modifier and Type | Method and Description |
---|---|
protected void |
Propagator.addVariable(V... nvars)
Enlarges the variable scope of this propagator
Should not be called by the user.
|
void |
Propagator.contradiction(Variable variable,
String message)
Throws a contradiction exception based on
|
Constructor and Description |
---|
Propagator(V... vars)
Creates a non-incremental propagator which does not react to fine events but simply calls a
coarse propagation any time a variable in vars has changed.
|
Propagator(V[] vars,
PropagatorPriority priority,
boolean reactToFineEvt)
Creates a new propagator to filter the domains of vars.
|
Modifier and Type | Field and Description |
---|---|
protected Variable[] |
AutoDiffDetection.scope |
Constructor and Description |
---|
AutoDiffDetection(Variable[] scope) |
Constructor and Description |
---|
PropConditionnal(Variable[] vars2observe,
Constraint[] condTrue,
Constraint[] condFalse) |
PropOpposite(Constraint original,
Variable[] vars) |
PropReif(Variable[] allVars,
Constraint consIfBoolTrue,
Constraint consIfBoolFalse) |
Modifier and Type | Field and Description |
---|---|
Variable |
ContradictionException.v |
Modifier and Type | Method and Description |
---|---|
ContradictionException |
ContradictionException.set(ICause c,
Variable v,
String s)
Throws the unique
ContradictionException filled with the specified parameters. |
Modifier and Type | Method and Description |
---|---|
int |
RuleStore.getMask(Variable var)
Return the current rule mask associated to the variable vid
|
Modifier and Type | Class and Description |
---|---|
class |
ObjectiveManager<V extends Variable,N extends Number>
Class to monitor the objective function and avoid exploring "worse" solutions
|
Modifier and Type | Field and Description |
---|---|
protected V |
ObjectiveManager.objective |
Modifier and Type | Method and Description |
---|---|
void |
IPropagationEngine.fails(ICause cause,
Variable variable,
String message) |
void |
IPropagationEngine.onVariableUpdate(Variable variable,
IEventType type,
ICause cause)
Take into account the modification of a variable
|
static void |
IPropagationEngine.Trace.printModification(Variable v,
IEventType e,
ICause c) |
static void |
IPropagationEngine.Trace.printPropagation(Variable v,
Propagator p) |
Modifier and Type | Method and Description |
---|---|
void |
TwoBucketPropagationEngine.fails(ICause cause,
Variable variable,
String message) |
void |
SevenQueuesPropagatorEngine.fails(ICause cause,
Variable variable,
String message) |
void |
TwoBucketPropagationEngine.onVariableUpdate(Variable variable,
IEventType type,
ICause cause) |
void |
SevenQueuesPropagatorEngine.onVariableUpdate(Variable variable,
IEventType type,
ICause cause) |
Modifier and Type | Method and Description |
---|---|
AbstractStrategy<Variable> |
SearchLoop.getStrategy() |
Modifier and Type | Class and Description |
---|---|
class |
DecisionOperator<V extends Variable>
|
Modifier and Type | Class and Description |
---|---|
class |
Decision<V extends Variable>
|
Modifier and Type | Field and Description |
---|---|
protected V |
Decision.var |
Modifier and Type | Method and Description |
---|---|
Variable |
RootDecision.getDecisionVariable() |
Modifier and Type | Interface and Description |
---|---|
interface |
VariableEvaluator<V extends Variable>
A variable evaluator.
|
interface |
VariableSelector<V extends Variable>
A variable selector specifies which variable should be selected at a fix point.
|
class |
VariableSelectorWithTies<V extends Variable>
|
Modifier and Type | Method and Description |
---|---|
V |
VariableSelectorWithTies.getVariable(V[] variables) |
V |
VariableSelector.getVariable(V[] variables)
Provides access to the current selected variable among
variables . |
Modifier and Type | Class and Description |
---|---|
class |
InputOrder<V extends Variable>
Input order variable selector.
|
class |
Occurrence<V extends Variable>
Occurrence variable selector.
|
class |
Random<T extends Variable>
Random variable selector.
|
Modifier and Type | Method and Description |
---|---|
T |
Random.getVariable(T[] variables) |
V |
Occurrence.getVariable(V[] variables) |
V |
InputOrder.getVariable(V[] variables) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractStrategy<V extends Variable>
An
AbstractStrategy does not implicitly advance to the next decision on
getDecision() (or getOppositeDecision() ) invokation. |
class |
FindAndProve<V extends Variable>
Enables to switch from one heuristic to another once a solution has been found
|
Modifier and Type | Field and Description |
---|---|
protected Variable |
LastConflict_old.candidate
Deprecated.
|
protected Variable[] |
LastConflict.conflictingVariables |
protected Variable[] |
LastConflict_old.testingSet
Deprecated.
|
protected V[] |
AbstractStrategy.vars |
Modifier and Type | Field and Description |
---|---|
protected AbstractStrategy<Variable> |
LastConflict_old.mainStrategy
Deprecated.
|
protected AbstractStrategy<Variable> |
LastConflict.mainStrategy |
protected AbstractStrategy<Variable> |
ConflictOrdering.mainStrategy |
Modifier and Type | Method and Description |
---|---|
V[] |
AbstractStrategy.getVariables() |
Modifier and Type | Method and Description |
---|---|
Decision<Variable> |
StrategiesSequencer.computeDecision(Variable variable) |
Modifier and Type | Method and Description |
---|---|
Decision<Variable> |
StrategiesSequencer.computeDecision(Variable variable) |
Constructor and Description |
---|
AbstractStrategy(V[] variables) |
FindAndProve(V[] vars,
AbstractStrategy<V> heurToFindASol,
AbstractStrategy<V> heurToProveOpt)
Heuristic which switches from one heuristic (heurToFindASol) to another (heurToProveOpt)
once a solution has been found
|
Constructor and Description |
---|
ConflictOrdering(Solver solver,
AbstractStrategy<Variable> mainStrategy) |
LastConflict_old(Solver solver,
AbstractStrategy<Variable> mainStrategy,
int k,
boolean dynamic)
Deprecated.
|
LastConflict(Solver solver,
AbstractStrategy<Variable> mainStrategy,
int k) |
Modifier and Type | Interface and Description |
---|---|
interface |
IVariableMonitor<V extends Variable>
A monitor for Variable, to observe variable modification (for integer variable : value removals, bounds modification
or instantiation) and do something right after the modification.
|
Modifier and Type | Interface and Description |
---|---|
interface |
BoolVar
CPRU r544: remove default implementation |
interface |
IntVar
Interface for integer variables.
|
interface |
RealVar
An interface to declare variable for continuous constraints (solved using IBEX).
|
interface |
SetVar
A Set Variable is defined by a domain which is a set interval [kernel,envelope]
The kernel is the set of elements that must belong to every single solution.
|
Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
Variable.duplicate()
Duplicate
this . |
Modifier and Type | Method and Description |
---|---|
static IntVar[] |
VariableFactory.castToIntVar(Variable... VARIABLES)
Casts VARIABLES into an integer variable array
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractVariable
Class used to factorise code
The subclass must implement Variable interface
|
class |
BitsetArrayIntVarImpl
IntVar implementation for quite small domains bit with very distant values e.g. {-51900,42,235923} |
class |
BitsetIntVarImpl
|
class |
BoolVarImpl
|
class |
FixedBoolVarImpl
A constant view specific to boolean variable
Based on "Views and Iterators for Generic Constraint Implementations",
C.
|
class |
FixedIntVarImpl
A IntVar with one domain value.
|
class |
FixedSetVarImpl |
class |
IntervalIntVarImpl
|
class |
RealVarImpl
An implementation of RealVar, variable for continuous constraints (solved using IBEX).
|
class |
SetVarImpl
Set variable to represent a set of integers in the range [0,n-1]
|
Modifier and Type | Method and Description |
---|---|
int |
AbstractVariable.compareTo(Variable o) |
Modifier and Type | Interface and Description |
---|---|
interface |
IView
An interface to define views.
|
Modifier and Type | Class and Description |
---|---|
class |
BoolEqView
A specific view for equality on bool var
|
class |
BoolNotView
A view for boolean variable, that enforce not(b).
|
class |
EqView
A specific view for equality on bool var
|
class |
IntView
"A view implements the same operations as a variable.
|
class |
MinusView
View for -V, where V is a IntVar or view
Based on "Views and Iterators for Generic Constraint Implementations"
C. |
class |
OffsetView
declare an IntVar based on X and C, such as X + C
declare an IntVar based on X and Y, such max(X,Y)
Based on "Views and Iterators for Generic Constraint Implementations" C. |
class |
RealView
|
class |
ScaleView
declare an IntVar based on X and C, such as X * C
Based on "Views and Iterators for Generic Constraint Implementations"
C. |
Modifier and Type | Method and Description |
---|---|
Variable |
IView.getVariable()
Return the basis variable
|
Modifier and Type | Method and Description |
---|---|
int |
IntView.compareTo(Variable o) |
Modifier and Type | Method and Description |
---|---|
static IntVar[] |
VariableUtilities.extractIntVar(Variable[] vars,
boolean bool2) |
Copyright © 2015. All rights reserved.