Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
Solver.getObjectiveManager() |
<V extends Variable> |
Solver.getSearch() |
Modifier and Type | Method and Description |
---|---|
Variable |
Model.getObjective()
Return the (possibly null) objective variable
|
Variable |
Model.getVar(int i)
Returns the ith variable within the array of variables defined in
this . |
Variable[] |
Model.getVars()
Returns the array of
Variable objects declared in this Model . |
Modifier and Type | Method and Description |
---|---|
void |
Model.associates(Variable variable)
Link a variable to
this . |
void |
Model.setObjective(boolean maximize,
Variable objective)
Defines the variable to optimize (maximize or minimize)
By default, each solution forces either :
for
Model.MAXIMIZE : to increase by one IntVar (or Model.precision for RealVar ) the objective lower bound, or
for Model.MINIMIZE : to decrease by one IntVar (or Model.precision for RealVar ) the objective upper bound. |
void |
Solver.throwsException(ICause c,
Variable v,
String s) |
void |
Model.unassociates(Variable variable)
Unlink the variable from
this . |
Constructor and Description |
---|
Solution(Model model,
Variable... varsToStore)
Create an empty solution object
able to store the value of each variable in
varsToStore when calling record()
Stores all variables by default, when varsToStore is empty |
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
List of variables this propagators deal with.
|
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.
|
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.
|
Propagator(V[] vars,
PropagatorPriority priority,
boolean reactToFineEvt,
boolean swapOnPassivate)
Creates a new propagator to filter the domains of vars.
|
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 | Interface and Description |
---|---|
interface |
IObjectiveManager<V extends Variable>
interface to monitor the bounds of the objective variable.
|
Modifier and Type | Method and Description |
---|---|
static IObjectiveManager<Variable> |
ObjectiveFactory.SAT()
Define a manager for satisfaction problems.
|
Modifier and Type | Method and Description |
---|---|
default void |
IPropagationEngine.fails(ICause cause,
Variable variable,
String message)
Deprecated.
replaced by
Solver.throwsException(ICause, Variable, String) |
default 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.onVariableUpdate(Variable variable,
IEventType type,
ICause cause) |
void |
SevenQueuesPropagatorEngine.onVariableUpdate(Variable variable,
IEventType type,
ICause cause) |
Modifier and Type | Method and Description |
---|---|
<V extends Variable> |
MoveSeq.getStrategy() |
<V extends Variable> |
MoveRestart.getStrategy() |
<V extends Variable> |
MoveLNS.getStrategy() |
<V extends Variable> |
MoveLearnBinaryTDR.getStrategy() |
<V extends Variable> |
MoveBinaryDFS.getStrategy() |
<V extends Variable> |
Move.getStrategy()
Returns the search strategy in use.
|
<V extends Variable> |
MoveSeq.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveRestart.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveLNS.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveLearnBinaryTDR.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
MoveBinaryDFS.setStrategy(AbstractStrategy<V> aStrategy) |
<V extends Variable> |
Move.setStrategy(AbstractStrategy<V> aStrategy)
Defines a search strategy, that is, a service which computes and returns decisions.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DecisionOperator<V extends Variable>
|
Modifier and Type | Class and Description |
---|---|
class |
Decision<E extends Variable>
An abstract which defines a Decision
|
Modifier and Type | Field and Description |
---|---|
protected E |
Decision.var
Variable of this decision
|
Modifier and Type | Class and Description |
---|---|
class |
Cyclic<V extends Variable>
A cyclic variable selector :
Iterates over variables according to lexicographic ordering in a cyclic manner (loop back to the first variable)
|
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.
|
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 |
---|---|
Variable |
GeneralizedMinDomVarSelector.getVariable(Variable[] variables) |
Modifier and Type | Method and Description |
---|---|
T |
Random.getVariable(T[] variables) |
V |
VariableSelectorWithTies.getVariable(V[] variables) |
V |
VariableSelector.getVariable(V[] variables)
Provides access to the current selected variable among
variables . |
V |
Occurrence.getVariable(V[] variables) |
V |
InputOrder.getVariable(V[] variables) |
V |
Cyclic.getVariable(V[] vars) |
Variable |
GeneralizedMinDomVarSelector.getVariable(Variable[] variables) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractStrategy<V extends Variable>
A search strategy provides decisions to go down in the search space.
|
class |
ConflictOrderingSearch<V extends Variable>
Conflict Ordering Search
Composite heuristic which hacks a mainStrategy by forcing the
use of variables involved in recent conflicts
See "Conflict Ordering Search for Scheduling Problems", Steven Gay et al., CP2015.
|
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.conflictingVariables
Variables related to decision in conflicts
|
protected V[] |
AbstractStrategy.vars |
Modifier and Type | Field and Description |
---|---|
protected AbstractStrategy<Variable> |
LastConflict.mainStrategy
The main strategy declared in the solver
|
Modifier and Type | Method and Description |
---|---|
V[] |
AbstractStrategy.getVariables() |
Modifier and Type | Method and Description |
---|---|
Decision<Variable> |
StrategiesSequencer.computeDecision(Variable variable) |
Decision<Variable> |
LastConflict.getDecision() |
Modifier and Type | Method and Description |
---|---|
Decision<Variable> |
StrategiesSequencer.computeDecision(Variable variable) |
Decision |
GreedyBranching.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 |
---|
LastConflict(Model model,
AbstractStrategy<Variable> mainStrategy,
int k)
Creates a last conflict heuristic
|
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 [LB,UB], where:
LB is the set of integers that must belong to every single solution.
|
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 |
FixedRealVarImpl
Project: choco-solver.
|
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, i.e. a value is a set
|
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 |
BoolNotView
A view for boolean variable, that enforce not(b).
|
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
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 boolean |
VariableUtils.isConstant(Variable var) |
static boolean |
VariableUtils.isView(Variable var) |
Copyright © 2017. All rights reserved.