Modifier and Type | Class and Description |
---|---|
class |
PropNogoods
A propagator to store and propagate no-goods.
|
class |
PropSat
A propagator to deal with clauses and interface a
SatSolver . |
Modifier and Type | Class and Description |
---|---|
class |
Cause
|
class |
Solution
Class which stores the value of each variable in a solution
|
Modifier and Type | Method and Description |
---|---|
void |
Solver.throwsException(ICause c,
Variable v,
String s) |
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 | Class and Description |
---|---|
class |
PropAbsolute
Enforces X = |Y|
|
class |
PropDistanceXYC
| X - Y | op C
op = {"==", "<", ">", "=/="} |
class |
PropEqualX_Y
X = Y
|
class |
PropEqualX_YC
X = Y + C
|
class |
PropEqualXY_C
X + Y = C
|
class |
PropGreaterOrEqualX_Y
X >= Y
|
class |
PropGreaterOrEqualX_YC
X >= Y + C
|
class |
PropGreaterOrEqualXY_C
X + Y >= C
|
class |
PropLessOrEqualXY_C
X + Y <= C
|
class |
PropNotEqualX_Y
A specific
Propagator extension defining filtering algorithm for:
X =/= Y where X and Y are Variable objects. |
class |
PropNotEqualX_YC
A specific
Propagator extension defining filtering algorithm for:
X =/= Y + C where X and Y are Variable objects and C a constant. |
class |
PropNotEqualXY_C
A specific
Propagator extension defining filtering algorithm for:
X + Y =/= C where X and Y are Variable objects and C a constant. |
class |
PropScale
Scale propagator : ensures x * y = z
With y a constant greater than one
Ensures AC
|
class |
PropSquare
Enforces X = Y^2
|
Modifier and Type | Class and Description |
---|---|
class |
PropBinAC2001
AC2001 algorithm for binary table constraint
|
class |
PropBinAC3
|
class |
PropBinAC3bitrm
AC3 bit rm algorithm for binary table constraint
|
class |
PropBinAC3rm
|
class |
PropBinCSP
|
class |
PropBinFC
Forward checking algorithm for table constraint
|
Modifier and Type | Class and Description |
---|---|
class |
PropCompactTable
Propagator for table constraint based on
"Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets"
Only for feasible Tuples
|
class |
PropCompactTableStar
Propagator for table constraint based on
"Extending Compact-Table to Negative and Short Tables",
H.
|
class |
PropLargeCSP<R extends LargeRelation>
|
class |
PropLargeFC
|
class |
PropLargeGAC2001
|
class |
PropLargeGAC2001Positive
|
class |
PropLargeGAC3rm
|
class |
PropLargeGAC3rmPositive
|
class |
PropLargeGACSTRPos
GAC maintaind by STR
|
class |
PropLargeMDDC
Implementation based on "Maintaining GAC on adhoc r-ary constraints", Cheng and Yap, CP12.
|
class |
PropTableStr2
STR2 Propagator for table constraints (only positive tuples)
|
Modifier and Type | Class and Description |
---|---|
class |
PropDiffN |
class |
PropIntValuePrecedeChain
A propagator for the IntValuePrecede constraint, based on:
"Y.
|
class |
PropKLoops
Incremental propagator which restricts the number of loops:
|{succs[i]=i+offSet}| = nbLoops
|
class |
PropKnapsack
Propagator for the Knapsack constraint
based on Dantzig-Wolfe relaxation
|
Modifier and Type | Class and Description |
---|---|
class |
PropAllDiffAC
Propagator for AllDifferent AC constraint for integer variables
Uses Regin algorithm
Runs in O(m.n) worst case time for the initial propagation
but has a good average behavior in practice
Runs incrementally for maintaining a matching
|
class |
PropAllDiffAdaptative
Probabilistic Propagator for AllDifferent AC constraint for integer variables introduced
to avoid loosing too much time in AC propagation when BC is sufficientss
The more this propagator triggers filtering and failure, the more likely it will be called
If it does not bring improvement, this propagator will be called less during search
|
class |
PropAllDiffBC
Based on:
"A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint"
A.
|
class |
PropAllDiffInst
Propagator for AllDifferent that only reacts on instantiation
|
Constructor and Description |
---|
AlgoAllDiffAC(IntVar[] variables,
ICause cause) |
Modifier and Type | Class and Description |
---|---|
class |
PropCondAllDiff_AC
Propagator for AllDifferent AC constraint for integer variables
subject to conditions (e.g.
|
class |
PropCondAllDiffInst
Propagator for ConditionnalAllDifferent that only reacts on instantiation
|
Modifier and Type | Class and Description |
---|---|
class |
PropAmongGAC
Incremental propagator for Among Constraint:
Counts the number of decision variables which take a value in the input value set
GCCAT:
NVAR is the number of variables of the collection VARIABLES that take their value in VALUES.
|
Modifier and Type | Class and Description |
---|---|
class |
PropCostRegular
|
class |
PropMultiCostRegular
Created by IntelliJ IDEA.
|
class |
PropRegular
|
Modifier and Type | Method and Description |
---|---|
void |
StoredValuedDirectedMultiGraph.removeArc(int arcId,
gnu.trove.stack.TIntStack toRemove,
Propagator<IntVar> propagator,
ICause aCause) |
Modifier and Type | Class and Description |
---|---|
class |
PropItemToLoad
Propagator for a Bin Packing constraint
Propagates item/bin allocations to bin loads
Reacts to item/bin allocation variables only
Should be used together with PropLoadToItem
|
class |
PropLoadToItem
Incremental propagator for a Bin Packing constraint
Propagates bin loads to item/bin allocations
Reacts to load modifications AND allocation assignments
Should be used together with PropItemToLoad
|
Modifier and Type | Class and Description |
---|---|
class |
PropBitChanneling
A propagator which ensures that OCTET = 20*BIT_1 + 21*BIT_2 + ...
|
class |
PropClauseChanneling
A propagator which links an IntVar with two arrays of BoolVar, one for EQ relations, the other for LQ relations.
|
class |
PropEnumDomainChanneling
Constraints that map the boolean assignments variables (bvars) with the standard assignment variables (var).
|
class |
PropInverseChannelAC
X[i] = j+Ox <=> Y[j] = i+Oy
|
class |
PropInverseChannelBC
X[i] = j+Ox <=> Y[j] = i+Oy
Propagator for bounded variables
it ensures :
LB(X[i]) = j+Ox => Y[j].contains(i+Oy)
UB(X[i]) = j+Ox => Y[j].contains(i+Oy)
and reciprocally for Y
It however does not performs BC on the conjunction
of this and the allDifferent constraint implied by InverseChanneling constraint
Such a consistency would require to know somehow holes in (bounded) domains
Again, AC is strongly advised
|
Modifier and Type | Class and Description |
---|---|
class |
PropCircuit_AntiArboFiltering
Propagator for circuit constraint based on dominators
Redundant propagator
|
class |
PropCircuit_ArboFiltering
Propagator for sub-circuit constraint based on dominators
Redundant propagator
|
class |
PropCircuitSCC
Filters circuit based on strongly connected components
(see the TechReport "Improving the Asymmetric TSP by considering graph structure", Fages & Lorca, 2012)
|
class |
PropNoSubtour
Simple nocircuit contraint (from NoSubtour of Pesant or noCycle of Caseaux/Laburthe)
|
class |
PropSubcircuit
Subcircuit propagator (one circuit and several loops)
|
class |
PropSubcircuitDominatorFilter
Propagator for sub-circuit constraint based on dominators
Redundant propagator
|
Modifier and Type | Class and Description |
---|---|
class |
PropFalse
|
class |
PropTrue
|
Modifier and Type | Class and Description |
---|---|
class |
PropCount_AC
Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar
assumes the occVar variable to be the last of the variables of the constraint:
vars = [lvars | occVar]
Arc Consistent algorithm
with lvars = list of variables for which the occurrence of occval in their domain is constrained
|
class |
PropCountVar
Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar
assumes the occVar variable to be the last of the variables of the constraint:
vars = [lvars | occVar]
Arc Consistent algorithm
with lvars = list of variables for which the occurrence of occval in their domain is constrained
|
Modifier and Type | Class and Description |
---|---|
class |
PropCumulative
Cumulative propagator
Performs energy checking and mandatory part based filtering
BEWARE : not idempotent, use two propagators to get the fix point
|
class |
PropGraphCumulative
Graph based cumulative
Maintains incrementally overlapping tasks
Performs energy checking and mandatory part based filtering
BEWARE : not idempotent, use two propagators to get the fix point
|
Modifier and Type | Class and Description |
---|---|
class |
PropElementV_fast
Fast Element constraint
|
Modifier and Type | Class and Description |
---|---|
class |
PropFastGCC
Propagator for Global Cardinality Constraint (GCC) for integer variables
Basic filter: no particular consistency but fast and with a correct checker
|
Modifier and Type | Class and Description |
---|---|
class |
PropLex
Enforce a lexicographic ordering on two vectors of integer
variables x <_lex y with x =
|
class |
PropLexChain
Solver constraint of the LexChain constraint.
|
class |
PropLexInt
Enforce a lexicographic ordering on one vector of integer
variables x <_lex y with x =
|
Modifier and Type | Class and Description |
---|---|
class |
PropBoolMax
|
class |
PropBoolMin
|
class |
PropMax
|
class |
PropMin
|
Modifier and Type | Class and Description |
---|---|
class |
PropAMNV
Propagator for the atMostNValues constraint
The number of distinct values in the set of variables vars is at most equal to nValues
|
class |
PropAtLeastNValues
Propagator for the atMostNValues constraint
The number of distinct values in the set of variables vars is at most equal to nValues
No level of consistency but better than BC in general (for enumerated domains with holes)
|
class |
PropAtLeastNValues_AC
AtLeastNValues Propagator (similar to SoftAllDiff)
The number of distinct values in vars is at least nValues
Performs Generalized Arc Consistency based on Maximum Bipartite Matching
The worst case time complexity is O(nm) but this is very pessimistic
In practice it is more like O(m) where m is the number of variable-value pairs
BEWARE UNSAFE : BUG DETECTED THROUGH DOBBLE(3,4,6)
!redundant propagator!
|
class |
PropAtMostNValues
Propagator for the atMostNValues constraint
The number of distinct values in the set of variables vars is at most equal to nValues
No level of consistency but better than BC in general (for enumerated domains with holes)
|
class |
PropAtMostNValues_BC
Propagator for the atMostNValues constraint
The number of distinct values in the set of variables vars is at most equal to nValues
Performs Bound Consistency in O(n+d) with
n = |vars|
d = maxValue - minValue (from initial domains)
=> very appropriate when d <= n It is indeed much better than the usual time complexity of O(n.log(n))
=> not appropriate when d >> n (you should encode another data structure and a quick sort algorithm)
!redundant propagator!
|
Modifier and Type | Class and Description |
---|---|
class |
PropKeysorting
Based on Technical Report from Mats Carlsson: "Propagating THE KEYSORTING Constraint" - Sept.
|
class |
PropSort
SortingConstraint is a constraint that ensures
that a vector is the sorted version of a second one. |
Modifier and Type | Class and Description |
---|---|
class |
PropScalar
A propagator for SUM(x_i*c_i) = b
Based on "Bounds Consistency Techniques for Long Linear Constraint" W. |
class |
PropSum
A propagator for SUM(x_i) o b
Based on "Bounds Consistency Techniques for Long Linear Constraint" W. |
class |
PropSumBool
A propagator for SUM(x_i) = y + b, where x_i are boolean variables
Based on "Bounds Consistency Techniques for Long Linear Constraint" W. |
class |
PropSumBoolIncr
A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
|
class |
PropSumFullBool
A propagator for SUM(x_i) = y + b, where x_i are boolean variables
Based on "Bounds Consistency Techniques for Long Linear Constraint" W. |
class |
PropSumFullBoolIncr
A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
|
Modifier and Type | Class and Description |
---|---|
class |
PropAntiArborescences
AntiArborescences propagation (simplification from tree constraint) based on dominators
loops (i.e., variables such that x[i]=i) are considered as roots
Can use the simple LT algorithm which runs in O(m.log(n)) worst case time
Or a slightly more sophisticated one, linear in theory but not necessarily faster in practice
|
Modifier and Type | Class and Description |
---|---|
class |
PropScalarMixed
A propagator for SUM(x_i*c_i) = b
Based on "Bounds Consistency Techniques for Long Linear Constraint" W. |
class |
RealPropagator
A propagator for real variables.
|
Modifier and Type | Class and Description |
---|---|
class |
PropConditionnal
A specific propagator which posts constraint on condition.
|
class |
PropLocalConDis
A propagator for constructive disjunction, with local deductions.
|
class |
PropOpposite
Constraint representing the negation of a given constraint
does not filter but fails if the given constraint is satisfied
Can be used within any constraint
Should not be called by the user
|
class |
PropReif
Implication propagator
|
class |
PropXeqCReif
A propagator dedicated to express in a compact way: (x = c) ⇔ b
|
class |
PropXeqYReif
A propagator dedicated to express in a compact way: (x = y) ⇔ b
|
class |
PropXgtCReif
A propagator dedicated to express in a compact way: (x > c) ⇔ b
|
class |
PropXinSReif
A propagator dedicated to express in a compact way: (x = c) ⇔ b
|
class |
PropXltCReif
A propagator dedicated to express in a compact way: (x < c) ⇔ b
|
class |
PropXltYCReif
A propagator dedicated to express in a compact way: (x < y + c) ⇔ b
|
class |
PropXltYReif
A propagator dedicated to express in a compact way: (x < y) ⇔ b
|
class |
PropXneCReif
A propagator dedicated to express in a compact way: (x ≠ c) ⇔ b
|
class |
PropXneYReif
A propagator dedicated to express in a compact way: (x ≠ y) ⇔ b
|
Modifier and Type | Class and Description |
---|---|
class |
PropAllDiff
Ensures that all sets are different
|
class |
PropAllDisjoint
Ensures that all non-empty sets are disjoint
In order to forbid multiple empty set, use propagator PropAtMost1Empty in addition
|
class |
PropAllEqual
Ensures that all sets are equal
|
class |
PropAtMost1Empty
At most one set can be empty
|
class |
PropBoolChannel
Channeling between a set variable and boolean variables
|
class |
PropCardinality
A propagator ensuring that |set| = card
|
class |
PropElement
Propagator for element constraint over sets
states that
array[index-offSet] = set
|
class |
PropIntBoundedMemberSet
Propagator for Member constraint: iv is in set
|
class |
PropIntChannel
Channeling between set variables and integer variables
x in sets[y-offSet1] <=> ints[x-offSet2] = y
|
class |
PropIntCstMemberSet
Propagator for Member constraint: int cst is in set
|
class |
PropIntCstNotMemberSet
Propagator for Member constraint: int cst is not in set
|
class |
PropIntEnumMemberSet
Propagator for Member constraint: iv is in set
|
class |
PropIntersection |
class |
PropIntersectionFilterSets |
class |
PropInverse
Inverse set propagator
x in sets[y-offSet1] <=> y in inverses[x-offSet2]
|
class |
PropMaxElement
Retrieves the maximum element of the set
the set must not be empty
|
class |
PropMinElement
Retrieves the minimum element of the set
the set must not be empty
|
class |
PropNbEmpty
Restricts the number of empty sets
|{s in sets such that |s|=0}| = nbEmpty
|
class |
PropNotEmpty
Restricts the set var not to be empty
|
class |
PropNotMemberIntSet
Not Member propagator filtering Int->Set
|
class |
PropNotMemberSetInt
Not Member propagator filtering Set->Int
|
class |
PropOffSet
set2 is an offSet view of set1
x in set1 <=> x+offSet in set2
|
class |
PropSetIntValuesUnion
Maintain a link between a set variable and the union of values taken by an array of
integer variables
Not idempotent (use two of them)
|
class |
PropSubsetEq
Ensures that X subseteq Y
|
class |
PropSumOfElements
Sums elements given by a set variable
|
class |
PropSymmetric
Propagator for symmetric sets
x in set[y-offSet] <=> y in set[x-offSet]
|
class |
PropUnion |
Modifier and Type | Class and Description |
---|---|
class |
AbstractPropDistanceXYZ
A constraint to state |X - Y| operator Z
where operator can be =, <=, <, >=, > and X, Y, and Z are variables
Warning: only achieves BoundConsistency for the moment !
|
class |
PropDivXYZ
X/Y = Z
A propagator for the constraint Z = X / Y where X, Y and Z are integer, possibly negative, variables
The filtering algorithm both supports bounded and enumerated integer variables
|
class |
PropEQDistanceXYZ |
class |
PropGEDistanceXYZ |
class |
PropGTDistanceXYZ |
class |
PropLEDistanceXYZ |
class |
PropLTDistanceXYZ |
class |
PropMaxBC
X = MAX(Y,Z)
ensures bound consistency |
class |
PropMinBC
X = MIN(Y,Z)
ensures bound consistency |
class |
PropTimesNaive
V0 * V1 = V2
|
class |
PropXplusYeqZ
A propagator to ensure that X + Y = Z holds, where X, Y and Z are IntVar.
|
Modifier and Type | Class and Description |
---|---|
class |
PropEqualXC
Unary propagator ensuring:
X = C, where X is a variable and C is a constant |
class |
PropGreaterOrEqualXC
X >= C
|
class |
PropLessOrEqualXC
X <= C
|
class |
PropMemberBound
|
class |
PropMemberEnum
|
class |
PropNotEqualXC
A propagator ensuring that:
X =/= C, where X is a variable and C a constant
|
class |
PropNotMemberBound
|
class |
PropNotMemberEnum
|
Modifier and Type | Field and Description |
---|---|
ICause |
ContradictionException.c |
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 |
---|---|
ICause |
ArrayEventStore.getCause(int evt) |
Modifier and Type | Method and Description |
---|---|
Set<ICause> |
Explanation.getCauses() |
Modifier and Type | Method and Description |
---|---|
boolean |
Explanation.addCause(ICause cause)
Add a cause, which explains, partially, the situation
|
void |
ExplanationEngine.instantiateTo(IntVar var,
int val,
ICause cause,
int oldLB,
int oldUB)
Explain the assignment to
val of var due to cause . |
default void |
IExplanationEngine.instantiateTo(IntVar var,
int val,
ICause cause,
int oldLB,
int oldUB)
Explain the assignment to
val of var due to cause . |
void |
ArrayEventStore.pushEvent(IntVar var,
ICause cause,
IEventType mask,
int one,
int two,
int three)
Push an event on the top of this store
|
boolean |
Explanation.remove(ICause cause)
Remove one cause from the set of causes explaining the situation
|
void |
ExplanationEngine.removeValue(IntVar var,
int val,
ICause cause)
Explain the removal of the
val from var , due to cause . |
default void |
IExplanationEngine.removeValue(IntVar var,
int val,
ICause cause)
Explain the removal of the
val from var , due to cause . |
void |
ExplanationEngine.updateLowerBound(IntVar var,
int value,
int old,
ICause cause)
Explain the removal of [
old ,value [ from var , due to cause . |
default void |
IExplanationEngine.updateLowerBound(IntVar var,
int value,
int old,
ICause cause)
Explain the removal of [
old ,value [ from var , due to cause . |
void |
ExplanationEngine.updateUpperBound(IntVar var,
int value,
int old,
ICause cause)
Explain the removal of ]
value ,old ] from var , due to cause . |
default void |
IExplanationEngine.updateUpperBound(IntVar var,
int value,
int old,
ICause cause)
Explain the removal of ]
value ,old ] from var , due to cause . |
Modifier and Type | Method and Description |
---|---|
ICause |
IEventStore.getCause(int evt) |
Modifier and Type | Method and Description |
---|---|
void |
IEventStore.pushEvent(IntVar var,
ICause cause,
IEventType mask,
int one,
int two,
int three) |
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 |
---|---|
void |
PropagationEngine.onVariableUpdate(Variable variable,
IEventType type,
ICause cause)
Take into account the modification of a variable
|
Modifier and Type | Method and Description |
---|---|
boolean |
DecisionOperator.apply(V var,
int value,
ICause cause) |
boolean |
DecisionOperator.unapply(V var,
int value,
ICause cause) |
Modifier and Type | Class and Description |
---|---|
class |
Decision<E extends Variable>
An abstract which defines a Decision
|
class |
IbexDecision
A decision that delegates the search process to Ibex
|
class |
IntDecision
A decision based on a
IntVar
|
class |
RealDecision
A decision based on a
RealVar that splits the domain in two ranges. |
class |
RootDecision
|
class |
SetDecision
A decision based on a
SetVar |
Modifier and Type | Class and Description |
---|---|
class |
ActivityBased
Implementation of the search described in:
"Activity-Based Search for Black-Box Constraint Propagramming Solver",
Laurent Michel and Pascal Van Hentenryck, CPAIOR12.
|
class |
ImpactBased
Implementation of the search described in:
"Impact-Based Search Strategies for Constraint Programming",
Philippe Refalo, CP2004.
|
Modifier and Type | Interface and Description |
---|---|
interface |
BoolVar
CPRU r544: remove default implementation |
interface |
IntVar
Interface for integer variables.
|
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 | Method and Description |
---|---|
ICause |
Variable.getCause() |
Modifier and Type | Method and Description |
---|---|
void |
Variable.contradiction(ICause cause,
String message)
Throws a contradiction exception based on
|
boolean |
SetVar.force(int element,
ICause cause)
Adds element to the lower bound, i.e.
|
boolean |
SetVar.instantiateTo(int[] value,
ICause cause)
Enforces the set variable to contain exactly the set of integers given in parameter
|
boolean |
IntVar.instantiateTo(int value,
ICause cause)
Instantiates the domain of
this to value . |
IIntDeltaMonitor |
IntVar.monitorDelta(ICause propagator)
Allow to monitor removed values of
this . |
ISetDeltaMonitor |
SetVar.monitorDelta(ICause propagator)
Allow propagator to monitor element removal/enforcing of this
|
void |
Variable.notifyPropagators(IEventType event,
ICause cause)
If
this has changed, then notify all of its observers.Each observer has its update method. |
void |
Variable.notifyViews(IEventType event,
ICause cause)
Notify views of observed variable modifications
|
boolean |
SetVar.remove(int element,
ICause cause)
Removes element from the upper bound, i.e.
|
boolean |
IntVar.removeAllValuesBut(IntIterableSet values,
ICause cause)
Removes all values from the domain of
this except those in values . |
boolean |
IntVar.removeInterval(int from,
int to,
ICause cause)
Removes values between [
from, to ] from the domain of this . |
boolean |
IntVar.removeValue(int value,
ICause cause)
Removes
value from the domain of this . |
boolean |
IntVar.removeValues(IntIterableSet values,
ICause cause)
Removes the value in
values from the domain of this . |
boolean |
BoolVar.setToFalse(ICause cause) |
boolean |
BoolVar.setToTrue(ICause cause) |
void |
Variable.storeEvents(int mask,
ICause cause)
Temporarily store modification events made on this.
|
boolean |
RealVar.updateBounds(double lowerbound,
double upperbound,
ICause cause)
Updates the bounds of the domain of
this to value . |
boolean |
IntVar.updateBounds(int lb,
int ub,
ICause cause)
Updates the lower bound and the upper bound of the domain of
this to, resp. |
boolean |
RealVar.updateLowerBound(double value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
IntVar.updateLowerBound(int value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
RealVar.updateUpperBound(double value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
boolean |
IntVar.updateUpperBound(int value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
Modifier and Type | Method and Description |
---|---|
ICause |
OneValueDelta.getCause(int idx) |
ICause |
IntervalDelta.getCause(int idx) |
ICause |
NoDelta.getCause(int idx) |
ICause |
IntDelta.getCause(int idx)
Return the cause of the idx^th cause stored in the delta, if any
|
ICause |
EnumDelta.getCause(int idx) |
ICause |
ISetDelta.getCause(int index,
int lbOrUb) |
ICause |
NoDelta.getCause(int index,
int kerOrEnv) |
ICause |
SetDelta.getCause(int index,
int kerOrEnv) |
Modifier and Type | Method and Description |
---|---|
void |
OneValueDelta.add(int value,
ICause cause) |
void |
IEnumDelta.add(int value,
ICause cause)
Adds a new value to the delta
|
void |
NoDelta.add(int value,
ICause cause) |
void |
EnumDelta.add(int value,
ICause cause)
Adds a new value to the delta
|
void |
IntervalDelta.add(int lb,
int ub,
ICause cause) |
void |
ISetDelta.add(int element,
int lbOrUb,
ICause cause) |
void |
IIntervalDelta.add(int lb,
int ub,
ICause cause)
Adds a new value interval to the delta
|
void |
NoDelta.add(int lb,
int ub,
ICause cause) |
void |
SetDelta.add(int element,
int kerOrEnv,
ICause cause) |
Modifier and Type | Field and Description |
---|---|
protected ICause |
IntervalDeltaMonitor.propagator |
protected ICause |
EnumDeltaMonitor.propagator |
protected ICause |
OneValueDeltaMonitor.propagator |
protected ICause |
SetDeltaMonitor.propagator |
Constructor and Description |
---|
EnumDeltaMonitor(IEnumDelta delta,
ICause propagator) |
IntervalDeltaMonitor(IIntervalDelta delta,
ICause propagator) |
OneValueDeltaMonitor(IEnumDelta delta,
ICause propagator) |
SetDeltaMonitor(ISetDelta delta,
ICause propagator) |
Modifier and Type | Class and Description |
---|---|
class |
BitsetArrayIntVarImpl
IntVar implementation for quite small domains bit with very distant values e.g. |
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 |
IntervalIntVarImpl
|
Modifier and Type | Method and Description |
---|---|
ICause |
AbstractVariable.getCause() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractVariable.contradiction(ICause cause,
String message) |
boolean |
SetVarImpl.force(int element,
ICause cause) |
boolean |
SetVarImpl.instantiateTo(int[] value,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.instantiateTo(int value,
ICause cause)
Instantiates the domain of
this to value . |
boolean |
FixedIntVarImpl.instantiateTo(int value,
ICause cause) |
boolean |
BitsetIntVarImpl.instantiateTo(int value,
ICause cause)
Instantiates the domain of
this to value . |
boolean |
IntervalIntVarImpl.instantiateTo(int value,
ICause cause)
Instantiates the domain of
this to value . |
boolean |
BoolVarImpl.instantiateTo(int value,
ICause cause)
Instantiates the domain of
this to value . |
SetDeltaMonitor |
SetVarImpl.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
BitsetArrayIntVarImpl.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
FixedIntVarImpl.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
BitsetIntVarImpl.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
IntervalIntVarImpl.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
BoolVarImpl.monitorDelta(ICause propagator) |
void |
FixedIntVarImpl.notifyPropagators(IEventType event,
ICause cause) |
void |
AbstractVariable.notifyPropagators(IEventType event,
ICause cause) |
void |
FixedIntVarImpl.notifyViews(IEventType event,
ICause cause) |
void |
AbstractVariable.notifyViews(IEventType event,
ICause cause) |
boolean |
SetVarImpl.remove(int element,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
FixedIntVarImpl.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
BitsetIntVarImpl.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
IntervalIntVarImpl.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
BoolVarImpl.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.removeInterval(int from,
int to,
ICause cause) |
boolean |
FixedIntVarImpl.removeInterval(int from,
int to,
ICause cause) |
boolean |
BitsetIntVarImpl.removeInterval(int from,
int to,
ICause cause) |
boolean |
IntervalIntVarImpl.removeInterval(int from,
int to,
ICause cause) |
boolean |
BoolVarImpl.removeInterval(int from,
int to,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.removeValue(int value,
ICause cause)
Removes
value from the domain of this . |
boolean |
FixedIntVarImpl.removeValue(int value,
ICause cause) |
boolean |
BitsetIntVarImpl.removeValue(int value,
ICause cause)
Removes
value from the domain of this . |
boolean |
IntervalIntVarImpl.removeValue(int value,
ICause cause)
Removes
value from the domain of this . |
boolean |
BoolVarImpl.removeValue(int value,
ICause cause)
Removes
value from the domain of this . |
boolean |
BitsetArrayIntVarImpl.removeValues(IntIterableSet values,
ICause cause) |
boolean |
FixedIntVarImpl.removeValues(IntIterableSet values,
ICause cause) |
boolean |
BitsetIntVarImpl.removeValues(IntIterableSet values,
ICause cause) |
boolean |
IntervalIntVarImpl.removeValues(IntIterableSet values,
ICause cause) |
boolean |
BoolVarImpl.removeValues(IntIterableSet values,
ICause cause) |
boolean |
FixedBoolVarImpl.setToFalse(ICause cause) |
boolean |
BoolVarImpl.setToFalse(ICause cause) |
boolean |
FixedBoolVarImpl.setToTrue(ICause cause) |
boolean |
BoolVarImpl.setToTrue(ICause cause) |
void |
AbstractVariable.storeEvents(int m,
ICause cause) |
boolean |
FixedRealVarImpl.updateBounds(double lowerbound,
double upperbound,
ICause cause) |
boolean |
RealVarImpl.updateBounds(double lowerbound,
double upperbound,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.updateBounds(int aLB,
int aUB,
ICause cause) |
boolean |
FixedIntVarImpl.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
BitsetIntVarImpl.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
IntervalIntVarImpl.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
BoolVarImpl.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
FixedRealVarImpl.updateLowerBound(double value,
ICause cause) |
boolean |
RealVarImpl.updateLowerBound(double value,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.updateLowerBound(int value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
FixedIntVarImpl.updateLowerBound(int value,
ICause cause) |
boolean |
BitsetIntVarImpl.updateLowerBound(int value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
IntervalIntVarImpl.updateLowerBound(int value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
BoolVarImpl.updateLowerBound(int value,
ICause cause)
Updates the lower bound of the domain of
this to value . |
boolean |
FixedRealVarImpl.updateUpperBound(double value,
ICause cause) |
boolean |
RealVarImpl.updateUpperBound(double value,
ICause cause) |
boolean |
BitsetArrayIntVarImpl.updateUpperBound(int value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
boolean |
FixedIntVarImpl.updateUpperBound(int value,
ICause cause) |
boolean |
BitsetIntVarImpl.updateUpperBound(int value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
boolean |
IntervalIntVarImpl.updateUpperBound(int value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
boolean |
BoolVarImpl.updateUpperBound(int value,
ICause cause)
Updates the upper bound of the domain of
this to value . |
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<I extends IntVar>
"A view implements the same operations as a variable.
|
class |
MinusView
View for -V, where V is a IntVar or view
|
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
|
Modifier and Type | Method and Description |
---|---|
boolean |
BoolNotView.instantiateTo(int value,
ICause cause) |
boolean |
IntView.instantiateTo(int value,
ICause cause) |
void |
IView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three)
This methods is related to explanations, it binds an event occurring on the observed
variable to the view.
|
void |
BoolNotView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three) |
void |
ScaleView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three) |
void |
RealView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three) |
void |
OffsetView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three) |
void |
MinusView.justifyEvent(IntVar var,
ICause cause,
IntEventType mask,
int one,
int two,
int three) |
IIntDeltaMonitor |
BoolNotView.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
ScaleView.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
OffsetView.monitorDelta(ICause propagator) |
IIntDeltaMonitor |
MinusView.monitorDelta(ICause propagator) |
boolean |
BoolNotView.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
IntView.removeAllValuesBut(IntIterableSet values,
ICause cause) |
boolean |
BoolNotView.removeInterval(int from,
int to,
ICause cause) |
boolean |
IntView.removeInterval(int from,
int to,
ICause cause) |
boolean |
BoolNotView.removeValue(int value,
ICause cause) |
boolean |
IntView.removeValue(int value,
ICause cause) |
boolean |
BoolNotView.removeValues(IntIterableSet values,
ICause cause) |
boolean |
IntView.removeValues(IntIterableSet values,
ICause cause) |
boolean |
BoolNotView.setToFalse(ICause cause) |
boolean |
BoolNotView.setToTrue(ICause cause) |
boolean |
RealView.updateBounds(double lowerbound,
double upperbound,
ICause cause) |
boolean |
BoolNotView.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
MinusView.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
IntView.updateBounds(int lb,
int ub,
ICause cause) |
boolean |
RealView.updateLowerBound(double value,
ICause cause) |
boolean |
BoolNotView.updateLowerBound(int value,
ICause cause) |
boolean |
IntView.updateLowerBound(int value,
ICause cause) |
boolean |
RealView.updateUpperBound(double value,
ICause cause) |
boolean |
BoolNotView.updateUpperBound(int value,
ICause cause) |
boolean |
IntView.updateUpperBound(int value,
ICause cause) |
Copyright © 2018. All rights reserved.