Uses of Interface
org.maxicp.cp.engine.core.CPConstraint

Packages that use CPConstraint

Package	Description
org.maxicp.cp	Constraint Programming Solver Implementation
org.maxicp.cp.engine.constraints	Constraints implementation (propagators)
org.maxicp.cp.engine.constraints.scheduling	Constraints implementation for Scheduling over Interval Variables and Cumulative Functions
org.maxicp.cp.engine.constraints.seqvar	Constraints implementation for Sequence Variables
org.maxicp.cp.engine.constraints.setvar	Constraints implementation for Set Variables
org.maxicp.cp.engine.core	Solver objects

Uses of CPConstraint in org.maxicp.cp

Methods in org.maxicp.cp that return CPConstraint

Modifier and Type	Method	Description
static CPConstraint	CPFactory.absent(CPIntervalVar var1)	Create a constraint that enforces an interval to be absent
static CPConstraint	CPFactory.allDifferent(CPIntVar[] x)	Returns an allDifferent constraint using forward checking algo
static CPConstraint	CPFactory.allDifferentDC(CPIntVar[] x)	Returns an allDifferent constraint that enforces global arc consistency.
static CPConstraint	CPFactory.alternative(CPIntervalVar interval, CPIntervalVar[] alternatives)	Returns an Alternative constraint: Enforces that if the interval variable interval is present, then one of the intervals from the array alternatives must be present and synchronized with a.
static CPConstraint	CPFactory.alternative(CPIntervalVar interval, CPIntervalVar[] alternatives, int cardinality)	Returns an Alternative constraint: Enforces that if the interval variable interval is present, then cardinality intervals from the array alternatives must be present and synchronized with interval.
static CPConstraint	CPFactory.alternative(CPIntervalVar interval, CPIntervalVar[] alternatives, CPIntVar cardinality)	Returns an Alternative constraint: Enforces that if the interval variable interval is present, then cardinality intervals from the array alternatives must be present and synchronized with a.
static CPConstraint	CPFactory.alwaysIn(CPCumulFunction fun, int minValue, int maxValue)	Requires a cumulative function to always be within the range [minValue..maxValue] on the execution range of the cumulative function.
static CPConstraint	CPFactory.alwaysIn(CPCumulFunction fun, int minValue, int maxValue, int from, int to)	Requires a cumulative function to always be within the range [minValue..maxValue] on the execution range [from..to).
static CPConstraint	CPFactory.alwaysIn(CPCumulFunction fun, int minValue, int maxValue, int from, int to, Constants.CumulativeAlgo algo)	Requires a cumulative function to always be within the range [minValue..maxValue] on the execution range [from..to).
static CPConstraint	CPFactory.alwaysIn(CPCumulFunction fun, int minValue, int maxValue, Constants.CumulativeAlgo algo)	Requires a cumulative function to always be within the range [minValue..maxValue] on the execution range of the cumulative function.
static CPConstraint	CPFactory.among(CPIntVar[] x, Set<Integer> vals, CPIntVar N)	Return a constraint that enforce that N is the number of indices i such that x[i] is in vals
static CPConstraint	CPFactory.atLeastNValue(CPIntVar[] x, CPIntVar nValue)	Returns an atLeastNValue constraint using a forward checking algo
static CPConstraint	CPFactory.circuit(CPIntVar[] x)	Returns a circuit constraint (using the successor model)
static CPConstraint	CPFactory.endAt(CPIntervalVar var1, int end)	Create a constraint that enforces that var1 ends at end
static CPConstraint	CPFactory.endAtEnd(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the end of var1 is equal to the end of var2
static CPConstraint	CPFactory.endAtEnd(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the end of var1 is equal to the end of var2 + delay
static CPConstraint	CPFactory.endAtStart(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the end of var1 is equal to the start of var2
static CPConstraint	CPFactory.endAtStart(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the end of var1 is equal to the start of var2 + delay
static CPConstraint	CPFactory.endBeforeEnd(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the end of var1 is lower or equal to the end of var2
static CPConstraint	CPFactory.endBeforeEnd(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the end of var1 is lower or equal to the end of var2 + delay
static CPConstraint	CPFactory.endBeforeStart(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the end of var1 is lower or equal to the start of var2
static CPConstraint	CPFactory.endBeforeStart(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the end of var1 is lower or equal to the start of var2 + delay
static CPConstraint	CPFactory.eq(CPIntVar x, int v)	Returns a constraint imposing that the variable is equal to some given value.
static CPConstraint	CPFactory.eq(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the two different variables must take the value.
static CPConstraint	CPFactory.exclude(CPSeqVar seqVar, int node)	Returns a constraint excluding a node from a sequence
static CPConstraint	CPFactory.exclude(CPSetVar x, int v)	Returns a constraint imposing that the value is excluded from the set variable.
static CPConstraint	CPFactory.ge(CPIntVar x, int v)	Returns a constraint imposing that the variable is larger or equal to some given value.
static CPConstraint	CPFactory.ge(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the a first variable is larger or equal to a second one.
static CPConstraint	CPFactory.gt(CPIntVar x, int v)	Returns a constraint imposing that the variable is larger to some given value.
static CPConstraint	CPFactory.gt(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the a first variable is larger to a second one.
static CPConstraint	CPFactory.implies(CPBoolVar b1, CPBoolVar b2)	Model the logical implication constraint
static CPConstraint	CPFactory.include(CPSetVar x, int v)	Returns a constraint imposing that the value is included in the set variable.
static CPConstraint	CPFactory.insert(CPSeqVar seqVar, int prev, int node)	Returns a constraint inserting a node within a sequence
static CPConstraint	CPFactory.isLe(CPBoolVar b, CPIntVar x, CPIntVar y)	Returns the reified version of the constraint x <= y, i.e. the boolean variable that is set to true if and only if x <= y.
static CPConstraint	CPFactory.isLt(CPBoolVar b, CPIntVar x, CPIntVar y)	Returns the reified version of the constraint x < y, i.e. the boolean variable that is set to true if and only if x < y.
static CPConstraint	CPFactory.le(CPCumulFunction fun, int maxValue)	Requires a cumulative function to always be equal or lesser than a value on the execution range [0..Constants.HORIZON).
static CPConstraint	CPFactory.le(CPCumulFunction fun, int maxValue, Constants.CumulativeAlgo algo)	Requires a cumulative function to always be equal or lesser than a value on the execution range [0..Constants.HORIZON).
static CPConstraint	CPFactory.le(CPIntVar x, int v)	Returns a constraint imposing that the variable is less or equal to some given value.
static CPConstraint	CPFactory.le(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the first variable is less or equal to a second one.
static CPConstraint	CPFactory.lt(CPIntVar x, int v)	Returns a constraint imposing that the variable is less to some given value.
static CPConstraint	CPFactory.lt(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the first variable is less to a second one.
static CPConstraint	CPFactory.negTable(CPIntVar[] x, int[][] table)	Returns a short table constraint
static CPConstraint	CPFactory.neq(CPIntVar x, int v)	Returns a constraint imposing that the variable is different from some given value.
static CPConstraint	CPFactory.neq(CPIntVar x, CPIntVar y)	Returns a constraint imposing that the two different variables must take different values.
static CPConstraint	CPFactory.neq(CPIntVar x, CPIntVar y, int c)	Returns a constraint imposing that the first variable differs from the second one minus a constant value.
static CPConstraint	CPFactory.notBetween(CPSeqVar seqVar, int prev, int node, int succ)	Forbids a subsequence of length 3 to appear in a CPSeqVar, removing from the domain all sequences containing the sub-sequence given as input.
static CPConstraint	CPFactory.or(CPBoolVar... x)	Returns an or constraint.
static CPConstraint	CPFactory.present(CPIntervalVar var1)	Create a constraint that enforces an interval to be present
static CPConstraint	CPFactory.require(CPSeqVar seqVar, int node)	Returns a constraint requiring a node within a sequence
static CPConstraint	CPFactory.shortTable(CPIntVar[] x, int[][] table, int star)	Returns a short table constraint
static CPConstraint	CPFactory.startAfter(CPIntervalVar var1, int start)	Create a constraint that enforces the start of var1 to be at or after start
static CPConstraint	CPFactory.startAt(CPIntervalVar var1, int start)	Create a constraint that enforces the start of var1 to be equal to start
static CPConstraint	CPFactory.startAtEnd(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the start of var1 is equal to the end of var2
static CPConstraint	CPFactory.startAtEnd(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the start of var1 is equal to the end of var2 + delay
static CPConstraint	CPFactory.startAtStart(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the start of var1 is equal to the start of var2
static CPConstraint	CPFactory.startAtStart(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the start of var1 is equal to the start of var2 + delay
static CPConstraint	CPFactory.startBefore(CPIntervalVar var1, int start)	Create a constraint that enforces the start of var1 to be before or at start
static CPConstraint	CPFactory.startBeforeEnd(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the start of var1 is lower or equal to the end of var2
static CPConstraint	CPFactory.startBeforeEnd(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the start of var1 is lower or equal to the end of var2 + delay
static CPConstraint	CPFactory.startBeforeStart(CPIntervalVar var1, CPIntervalVar var2)	Creates a constraint that enforces that the start of var1 is lower or equal to the start of var2
static CPConstraint	CPFactory.startBeforeStart(CPIntervalVar var1, CPIntervalVar var2, int delay)	Creates a constraint that enforces that the start of var1 is lower or equal to the start of var2 + delay
static CPConstraint	CPFactory.sum(int y, CPIntVar... x)	Returns a sum constraint.
static CPConstraint	CPFactory.sum(CPIntVar[] x, int y)	Returns a sum constraint.
static CPConstraint	CPFactory.sum(CPIntVar[] x, CPIntVar y)	Returns a sum constraint.
static CPConstraint	CPFactory.table(CPIntVar[] x, int[][] table)	Returns a table constraint

Uses of CPConstraint in org.maxicp.cp.engine.constraints

Classes in org.maxicp.cp.engine.constraints that implement CPConstraint

Modifier and Type	Class	Description
class	Absolute	Absolute value constraint
class	AllDifferentDC	Arc Consistent AllDifferent Constraint Algorithm described in "A filtering algorithm for constraints of difference in CSPs" J-C.
class	AllDifferentFWC
class	Among	Among constraint
class	AtLeastNValueDC	Domain Consistency Filtering for AtLeastNValue constraint.
class	AtLeastNValueFWC
class	BinaryKnapsack	A Binary Knapsack constraint ensures that the total load is equal to the sum of the weights of the selected items.
class	BinPacking	The BinPacking constraint ensures that a set of items with given weights are packed into bins such that each bin's total weight respects a given capacity constraint.
class	CardinalityMaxFWC
class	CardinalityMinFWC
class	Circuit	Hamiltonian Circuit Constraint with a successor model
class	CostAllDifferentDC	Arc Consistent AllDifferent Constraint with Costs
class	CostCardinalityMaxDC	Implementation of the Global Cardinality Constraint with Costs from the paper
class	Element1D	Element Constraint modeling array[y] = z
class	Element1DDC	Element1DDC constraint
class	Element1DVar
class	Element2D	Element Constraint modeling matrix[x][y] = z
class	Equal
class	InversePerm	InversePerm is a constraint that enforces that one permutation is the inverse of another.
class	IsEqual	Reified equality constraint
class	IsEqualVar	Reified equality constraint
class	IsLessOrEqual	Reified less or equal constraint.
class	IsLessOrEqualVar	Reified is less or equal constraint b <=> x <= y.
class	IsOr	Reified logical or constraint
class	LessOrEqual	Less or equal constraint between two variables
class	LightBinaryKnapsack
class	Maximum	Maximum Constraint
class	Mul	Constraint x * b = y where b is a boolean variable
class	MulCte	Multiplication Constraint x * c = z where c is a constant
class	MulCteRes	Multiplication Constraint x * y = c
class	MulVar	Multiplication Constraint x * y = z (all variables)
class	NegTableCT	Implementation of Compact Table for Negative Table algorithm described in
class	NotEqual	Not Equal constraint between two variables
class	Or	Logical or constraint x1 or x2 or ... xn
class	ShortTableCT	Implementation of Compact Table for Short Table algorithm described in
class	SoftCardinalityDC	Soft Global Cardinality Constraint
class	Sorted	Sorted constraint, x is sorted in y according to permutation o
class	Square	Square Constraint x * x = y
class	SubCircuit	Ensures that only one Hamiltonian circuit appears in the provided successor variables.
class	Sum	Sum Constraint
class	TableCT	Implementation of Compact Table algorithm described in

Uses of CPConstraint in org.maxicp.cp.engine.constraints.scheduling

Classes in org.maxicp.cp.engine.constraints.scheduling that implement CPConstraint

Modifier and Type	Class	Description
class	Alternative	Alternative Constraint with cardinality: Enforces that if the interval a is present, then c intervals from the array alt must be present and synchronized with a.
class	CumulativeDecomposition	Cumulative constraint with sum decomposition (very slow).
class	EndAfter
class	EndAtEnd	Enforces that interval A ends at interval B end if B is present and that interval B ends at interval A end if A is present
class	EndAtStart	Enforces that interval A ends at interval B start if B is present and that interval B starts at interval A end if A is present
class	EndBefore
class	EndBeforeEnd	Constrains interval A to end before or at the end of interval B.
class	EndBeforeStart	Constrains interval A to end before or at the start of interval B if both are present.
class	GeneralizedCumulativeChecker	Checker for the generalized cumulative constraint.
class	GeneralizedCumulativeConstraint	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
class	GeneralizedCumulativeConstraintBaseLine	Generalized Cumulative Constraint using Timetabling TODO Refer paper once published
class	GeneralizedCumulativeSweepMax
class	GeneralizedCumulativeSweepMin
class	IntervalVarEnd	TODO
class	IntervalVarEndOrValue	TODO
class	IntervalVarLength	TODO
class	IntervalVarLengthOrValue	TODO
class	IntervalVarStart	TODO
class	IntervalVarStartOrValue	TODO
class	IsEndAfter
class	IsEndBefore
class	IsEndBeforeEnd	Reified is end before start constraint
class	IsEndBeforeStart	Reified is end before start constraint
class	IsStartBefore
class	IsStartBeforeEnd	Reified is end before start constraint
class	IsStartBeforeStart	Reified is start before start constraint
class	NoOverlap	NoOverlap constraint, ensures that a set of interval variables do not overlap in time.
class	NoOverlapBC	Bound Consistency filtering for the NoOverlap constraint
class	NoOverlapBinary
class	NoOverlapBinaryWithTransitionTime
class	StartAfter
class	StartAtEnd	Enforces that interval A starts at interval B end if B is present and that interval B ends at interval A start if A is present
class	StartAtStart	Enforces that interval A starts at interval B start if B is present and that interval B starts at interval A start if A is present
class	StartBefore
class	StartBeforeEnd	Constrains interval A to start before or at the end of interval B if both are present.
class	StartBeforeStart	Constrains interval A to start before or at the start of interval B.

Uses of CPConstraint in org.maxicp.cp.engine.constraints.seqvar

Classes in org.maxicp.cp.engine.constraints.seqvar that implement CPConstraint

Modifier and Type	Class	Description
class	Cumulative
class	Distance
class	Duration
class	Exclude	Excludes a node from a sequence
class	Insert	Inserts a node into a sequence
class	NotBetween
class	Precedence
class	RelaxedSequence	Imposes that the sequence defined by the provided orderedSequence where the relaxed nodes have been removed is a subsequence of the provided sequence variable.
class	Require	Requires a node in a sequence, forcing the node to be visited
class	SubSequence	Links two CPSeqVar, ensuring a subsequence appears within a super sequence
class	TransitionTimes	Links a CPSeqVar with time windows, enforcing that visits happen during valid timeframes.

Uses of CPConstraint in org.maxicp.cp.engine.constraints.setvar

Classes in org.maxicp.cp.engine.constraints.setvar that implement CPConstraint

Modifier and Type	Class	Description
class	IsIncluded	Constraint that enforces a boolean variable to be true if a value is included in a set.
class	IsSubset	Constraint that enforces a boolean variable is true if one set is a subset of another set.
class	NotSubset	Constraint that enforces that the first set variable is not a subset of the second set variable.
class	SetCard	Constraint that links the cardinality of a set variable to an integer variable.
class	Subset	Constraint that enforces that one set variable is a subset of another set variable.

Uses of CPConstraint in org.maxicp.cp.engine.core

Classes in org.maxicp.cp.engine.core that implement CPConstraint

Modifier and Type	Class	Description
class	AbstractCPConstraint	Abstract class the most of the constraints should extend.
class	CPConstraintClosure
class	CPConstraintClosureWithDelta
class	DoNothingConstraint

Methods in org.maxicp.cp.engine.core with parameters of type CPConstraint

Modifier and Type	Method	Description
DeltaCPIntVar	CPBoolVarImpl.delta(CPConstraint c)
DeltaCPIntVar	CPIntVar.delta(CPConstraint c)	Returns a delta object allowing to retrieve the changes in the domain of the variable (removed values) since the previous call to the Constraint.propagate of the constraint.
DeltaCPIntVar	CPIntVarConstant.delta(CPConstraint c)
DeltaCPIntVar	CPIntVarImpl.delta(CPConstraint c)
DeltaCPIntVar	CPIntVarViewMul.delta(CPConstraint c)
DeltaCPIntVar	CPIntVarViewOffset.delta(CPConstraint c)
DeltaCPIntVar	CPIntVarViewOpposite.delta(CPConstraint c)
void	CPSolver.post(CPConstraint c)	Posts the constraint, that is call post() and computes the fix-point.
void	CPSolver.post(CPConstraint c, boolean enforceFixPoint)	Posts the constraint that is call post() and optionally computes the fix-point.
void	MaxiCP.post(CPConstraint c)
void	MaxiCP.post(CPConstraint c, boolean enforceFixPoint)
void	CPBoolVarImpl.propagateOnBoundChange(CPConstraint c)
void	CPIntVar.propagateOnBoundChange(CPConstraint c)	Asks that propagate() is called whenever the bound (maximum or minimum values) of the domain of this variable is changes.
void	CPIntVarConstant.propagateOnBoundChange(CPConstraint c)
void	CPIntVarImpl.propagateOnBoundChange(CPConstraint c)
void	CPIntVarViewMul.propagateOnBoundChange(CPConstraint c)
void	CPIntVarViewOffset.propagateOnBoundChange(CPConstraint c)
void	CPIntVarViewOpposite.propagateOnBoundChange(CPConstraint c)
void	CPIntervalVar.propagateOnChange(CPConstraint c)
void	CPIntervalVarImpl.propagateOnChange(CPConstraint c)
void	CPIntervalVarOffset.propagateOnChange(CPConstraint c)
void	CPBoolVarImpl.propagateOnDomainChange(CPConstraint c)
void	CPFixedSetVar.propagateOnDomainChange(CPConstraint c)
void	CPIntVar.propagateOnDomainChange(CPConstraint c)	Asks that propagate() is called whenever the domain of this variable changes.
void	CPIntVarConstant.propagateOnDomainChange(CPConstraint c)
void	CPIntVarImpl.propagateOnDomainChange(CPConstraint c)
void	CPIntVarViewMul.propagateOnDomainChange(CPConstraint c)
void	CPIntVarViewOffset.propagateOnDomainChange(CPConstraint c)
void	CPIntVarViewOpposite.propagateOnDomainChange(CPConstraint c)
void	CPSetVar.propagateOnDomainChange(CPConstraint c)	Ask that the propagate() method of the constraint c is called when the domain of the set variable changes (I,P or E).
void	CPSetVarImpl.propagateOnDomainChange(CPConstraint c)
void	CPNodeVar.propagateOnExclude(CPConstraint c)	Asks that propagate() is called whenever the node is excluded.
void	CPNodeVarViewFlip.propagateOnExclude(CPConstraint c)
void	CPSeqVar.propagateOnExclude(CPConstraint c)	Asks that propagate() is called whenever an exclusion happens.
void	CPSeqVarImpl.propagateOnExclude(CPConstraint c)
void	CPSeqVarViewFlip.propagateOnExclude(CPConstraint c)
void	CPBoolVarImpl.propagateOnFix(CPConstraint c)
void	CPIntVar.propagateOnFix(CPConstraint c)	Asks that propagate() is called whenever the domain of this variable is reduced to a singleton.
void	CPIntVarConstant.propagateOnFix(CPConstraint c)
void	CPIntVarImpl.propagateOnFix(CPConstraint c)
void	CPIntVarViewMul.propagateOnFix(CPConstraint c)
void	CPIntVarViewOffset.propagateOnFix(CPConstraint c)
void	CPIntVarViewOpposite.propagateOnFix(CPConstraint c)
void	CPSeqVar.propagateOnFix(CPConstraint c)	Asks that propagate() is called whenever the domain is fixed CPSeqVar.isFixed() In such a state the variable is fixed and we say that a fix event occurs.
void	CPSeqVarImpl.propagateOnFix(CPConstraint c)
void	CPSeqVarViewFlip.propagateOnFix(CPConstraint c)
void	CPNodeVar.propagateOnInsert(CPConstraint c)	Asks that propagate() is called whenever the node is inserted.
void	CPNodeVarViewFlip.propagateOnInsert(CPConstraint c)
void	CPSeqVar.propagateOnInsert(CPConstraint c)	Asks that propagate() is called whenever an insertion happens.
void	CPSeqVarImpl.propagateOnInsert(CPConstraint c)
void	CPSeqVarViewFlip.propagateOnInsert(CPConstraint c)
void	CPNodeVar.propagateOnInsertRemoved(CPConstraint c)	Asks that propagate() is called whenever an insertion for the node is removed.
void	CPNodeVarViewFlip.propagateOnInsertRemoved(CPConstraint c)
void	CPSeqVar.propagateOnInsertRemoved(CPConstraint c)	Asks that propagate() is called whenever an insertion is removed We say that a removeInsert event occurs.
void	CPSeqVarImpl.propagateOnInsertRemoved(CPConstraint c)
void	CPSeqVarViewFlip.propagateOnInsertRemoved(CPConstraint c)
void	CPNodeVar.propagateOnRequire(CPConstraint c)	Asks that propagate() is called whenever the node is required.
void	CPNodeVarViewFlip.propagateOnRequire(CPConstraint c)
void	CPSeqVar.propagateOnRequire(CPConstraint c)	Asks that propagate() is called whenever a node is required.
void	CPSeqVarImpl.propagateOnRequire(CPConstraint c)
void	CPSeqVarViewFlip.propagateOnRequire(CPConstraint c)
void	CPSolver.schedule(CPConstraint c)	Schedules the constraint to be propagated by the fix-point.
void	MaxiCP.schedule(CPConstraint c)

Method parameters in org.maxicp.cp.engine.core with type arguments of type CPConstraint

Modifier and Type	Method	Description
protected void	CPIntVarImpl.scheduleAll(StateStack<CPConstraint> constraints)
protected void	CPSetVarImpl.scheduleAll(StateStack<CPConstraint> constraints)