|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of SConstraint in choco.cp.common.util.preprocessor |
---|
Methods in choco.cp.common.util.preprocessor that return SConstraint | |
---|---|
static SConstraint |
ExpressionTools.getIntentionalConstraint(ExpressionSConstraint e,
CPSolver s)
If the expression can be matched to a known intensional constraint, then return it as a solver constraint * |
static SConstraint |
ExpressionTools.getScalarConstraint(ExpressionSConstraint e,
CPSolver s)
Try to recognize that the expression is a scalar. |
Uses of SConstraint in choco.cp.model.managers |
---|
Methods in choco.cp.model.managers that return SConstraint | |
---|---|
SConstraint |
UseResourcesManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
IntConstraintManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
RealConstraintManager.makeConstraintAndOpposite(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
SetConstraintManager.makeConstraintAndOpposite(Solver solver,
SetVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
UseResourcesManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
MixedConstraintManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in choco.cp.model.managers.constraints |
---|
Methods in choco.cp.model.managers.constraints that return SConstraint | |
---|---|
SConstraint |
EqManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
BooleanManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint[] |
EqManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
BooleanManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in choco.cp.model.managers.constraints.expressions |
---|
Methods in choco.cp.model.managers.constraints.expressions that return SConstraint | |
---|---|
SConstraint |
XorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
XnorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> optionsd)
Build a constraint for the given solver and "model variables" |
SConstraint |
OrManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
NotManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
NorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
NandManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ImpliesManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
IfOnlyIfManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
AndManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
Uses of SConstraint in choco.cp.model.managers.constraints.global |
---|
Methods in choco.cp.model.managers.constraints.global that return SConstraint | |
---|---|
SConstraint |
AllDifferentManager.defaultDetection(IntDomainVar[] vars,
IEnvironment environment)
make a choice if the user didn't specify the type of consistency desired |
SConstraint |
RegularManager.knapsack(Solver s,
IntegerVariable[] vars,
int goal,
int[] coeffs)
|
protected SConstraint |
DisjunctiveManager.makeConstraint(CPSolver solver,
Variable[] variables,
ResourceParameters rdata,
List<String> options)
|
protected SConstraint |
CumulativeManager.makeConstraint(CPSolver s,
Variable[] variables,
ResourceParameters rdata,
List<String> options)
|
protected abstract SConstraint |
AbstractResourceManager.makeConstraint(CPSolver solver,
Variable[] variables,
ResourceParameters rdata,
List<String> options)
|
SConstraint |
StretchPathManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
SortingManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
SoftMultiCostRegularManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
ReifiedXorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedXnorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedOrManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedNorManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedNandManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedImplicationManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedImplManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedAndManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
RegularManager.makeConstraint(Solver solver,
IntegerVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
OccurrenceManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
MultiCostRegularManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
LeximinManager.makeConstraint(Solver solver,
IntegerVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
LexManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
LexChainManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
KnapsackProblemManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
IncreasingNValueManager.makeConstraint(Solver solver,
IntegerVariable[] integerVariables,
Object parameters,
List<String> options)
|
SConstraint |
GlobalCardinalityManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
GeostManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
FastRegularManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
ElementManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
CostRegularManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
AtMostNValueManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
AllDifferentManager.makeConstraint(Solver solver,
IntegerVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
TreeManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ReifiedManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
PackManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ForbiddenIntervalsManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
ClausesManager.makeConstraint(Solver solver,
Variable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
AbstractResourceManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
AbstractPrecedenceManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
OccurrenceManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
ElementManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
TreeManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
protected SConstraint |
PrecedenceReifiedManager.makeIntConstraint(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceImpliedManager.makeIntConstraint(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceDisjointManager.makeIntConstraint(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2,
IntDomainVar dir)
|
protected abstract SConstraint |
AbstractPrecedenceManager.makeIntConstraint(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceReifiedManager.makeIntConstraintB0(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2)
|
protected SConstraint |
PrecedenceImpliedManager.makeIntConstraintB0(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2)
|
protected SConstraint |
PrecedenceDisjointManager.makeIntConstraintB0(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2)
|
protected abstract SConstraint |
AbstractPrecedenceManager.makeIntConstraintB0(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2)
|
protected SConstraint |
AbstractPrecedenceManager.makeIntConstraintB1(CPSolver s,
IntDomainVar x1,
int k1,
IntDomainVar x2,
int k2)
|
protected SConstraint |
PrecedenceReifiedManager.makeTaskConstraint(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceImpliedManager.makeTaskConstraint(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceDisjointManager.makeTaskConstraint(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2,
IntDomainVar dir)
|
protected abstract SConstraint |
AbstractPrecedenceManager.makeTaskConstraint(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2,
IntDomainVar dir)
|
protected SConstraint |
PrecedenceReifiedManager.makeTaskConstraintB0(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
protected SConstraint |
PrecedenceImpliedManager.makeTaskConstraintB0(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
protected SConstraint |
PrecedenceDisjointManager.makeTaskConstraintB0(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
protected abstract SConstraint |
AbstractPrecedenceManager.makeTaskConstraintB0(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
protected SConstraint |
PrecedenceDisjointManager.makeTaskConstraintB1(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
protected SConstraint |
AbstractPrecedenceManager.makeTaskConstraintB1(CPSolver s,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
Uses of SConstraint in choco.cp.model.managers.constraints.integer |
---|
Methods in choco.cp.model.managers.constraints.integer that return SConstraint | |
---|---|
SConstraint |
TableManager.buildBinaryTable(IntDomainVar[] vs,
Object parameters,
List<String> options,
IEnvironment environment)
|
SConstraint |
TableManager.buildBinaryTable(IntDomainVar v1,
IntDomainVar v2,
BinRelation binR,
List<String> options,
IEnvironment environment)
|
SConstraint |
MinMaxManager.buildConstraint(Solver solver,
Variable[] variables,
Boolean parameter,
List<String> options,
IntDomainVar varM)
|
SConstraint |
TableManager.buildNaryTable(IntDomainVar[] vs,
LargeRelation rela,
List<String> options,
IEnvironment environment)
|
SConstraint |
TableManager.buildNaryTable(IntDomainVar[] vs,
Object parameters,
List<String> options,
IEnvironment environment)
|
SConstraint |
TimesManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
TableManager.makeConstraint(Solver solver,
IntegerVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
NotMemberManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ModuloManager.makeConstraint(Solver solver,
IntegerVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
MemberManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
IncreasingSumManager.makeConstraint(Solver solver,
IntegerVariable[] integerVariables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ExactlyManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
EuclideanDivisionManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
DistanceManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
ChannelingManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
AbsoluteManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
SignOpManager.makeConstraint(Solver solver,
Variable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
MinMaxManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
MetaTaskConstraintManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
DistanceManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
SConstraint[] |
MinMaxManager.makeConstraintAndOpposite(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in choco.cp.model.managers.constraints.set |
---|
Methods in choco.cp.model.managers.constraints.set that return SConstraint | |
---|---|
SConstraint |
UnionManager.makeConstraint(Solver solver,
SetVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
SetValuePrecedeManager.makeConstraint(Solver solver,
SetVariable[] setVariables,
Object o,
List<String> strings)
|
SConstraint |
SetLexicographicOrderingSetManager.makeConstraint(Solver solver,
SetVariable[] setVariables,
Object o,
List<String> strings)
|
SConstraint |
IsNotIncludedManager.makeConstraint(Solver solver,
SetVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
IsIncludedManager.makeConstraint(Solver solver,
SetVariable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
IntersectionManager.makeConstraint(Solver solver,
SetVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
DisjunctionManager.makeConstraint(Solver solver,
SetVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
ComplementSetManager.makeConstraint(Solver solver,
SetVariable[] setVariables,
Object parameters,
List<String> options)
|
SConstraint |
NotMemberManager.makeConstraint(Solver solver,
Variable[] vars,
Object parameters,
List<String> options)
|
SConstraint |
MemberManager.makeConstraint(Solver solver,
Variable[] vars,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
InverseSetManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
AmongSetManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
Uses of SConstraint in choco.cp.model.managers.operators |
---|
Methods in choco.cp.model.managers.operators that return SConstraint | |
---|---|
SConstraint |
SinManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
PowerManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
PlusManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
MultManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
MinusManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
SConstraint |
CosManager.makeConstraint(Solver solver,
RealVariable[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
Uses of SConstraint in choco.cp.solver |
---|
Fields in choco.cp.solver with type parameters of type SConstraint | |
---|---|
protected gnu.trove.TLongObjectHashMap<SConstraint> |
CPSolver.mapconstraints
|
Methods in choco.cp.solver that return SConstraint | |
---|---|
protected SConstraint |
CPSolver.createEquation(RealVar[] tmpVars,
RealExp exp,
RealIntervalConstant cst)
|
protected static SConstraint |
CPSolver.createFCLargeConstraint(IntDomainVar[] vars,
LargeRelation relation)
|
protected SConstraint |
CPModelToCPSolver.createGenericMetaConstraint(MetaConstraint mc,
Boolean decomp)
|
protected SConstraint |
CPModelToCPSolver.createMetaConstraint(Constraint ic,
Boolean decomp)
|
SConstraint |
CPSolver.eq(double cst,
RealExp exp)
|
SConstraint |
CPSolver.eq(IntExp x,
int c)
|
SConstraint |
CPSolver.eq(IntExp x,
IntExp y)
|
protected static SConstraint |
CPSolver.eq(int c0,
IntDomainVar v0,
int cste)
always succeeds to build the constraint |
protected static SConstraint |
CPSolver.eq(int c0,
IntDomainVar v0,
int c1,
IntDomainVar v1,
int cste)
could fail to build a binary constraint and give the hand to IntLinComb |
SConstraint |
CPSolver.eq(int c,
IntExp x)
|
SConstraint |
CPSolver.eq(RealExp exp,
double cst)
|
SConstraint |
CPSolver.eq(RealExp exp1,
RealExp exp2)
Equality constraint. |
SConstraint |
CPSolver.eq(RealVar r,
IntDomainVar i)
|
static SConstraint |
CPSolver.eq(SetVar s1,
SetVar s2)
|
SConstraint |
CPSolver.eqCard(SetVar s,
int i)
|
SConstraint |
CPSolver.eqCard(SetVar s,
IntDomainVar i)
|
SConstraint |
CPSolver.feasiblePairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
int ac)
|
SConstraint |
CPSolver.feasiblePairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat,
int ac)
|
SConstraint |
CPSolver.feasibleTupleAC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Arc Consistency on a given a given list of feasible tuples. |
SConstraint |
CPSolver.feasibleTupleAC(IntDomainVar[] vars,
List<int[]> tuples,
int ac)
Create a constraint enforcing Arc Consistency on a given a given list of feasible tuples |
static SConstraint |
CPSolver.feasibleTupleFC(IntDomainVar[] vars,
TuplesTable tuples)
Create a constraint enforcing Forward Checking on a given a given list of feasible tuples |
SConstraint |
CPSolver.feasPairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat)
|
SConstraint |
CPSolver.feasPairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
int ac)
|
SConstraint |
CPSolver.feasPairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat)
|
SConstraint |
CPSolver.feasPairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat,
int ac)
|
SConstraint |
CPSolver.feasTupleAC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Arc Consistency on a given a given list of feasible tuples |
static SConstraint |
CPSolver.feasTupleFC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Forward Checking on a given a given list of feasible tuples |
SConstraint |
CPSolver.geq(double cst,
RealExp exp)
|
SConstraint |
CPSolver.geq(IntExp x,
int c)
Creates a constraint by stating that a term is greater or equal than a constant |
SConstraint |
CPSolver.geq(IntExp x,
IntExp y)
|
protected static SConstraint |
CPSolver.geq(int c0,
IntDomainVar v0,
int cste)
always succeeds to build the constraint |
protected static SConstraint |
CPSolver.geq(int c0,
IntDomainVar v0,
int c1,
IntDomainVar v1,
int cste)
could fail to build a binary constraint and give the hand to IntLinComb |
SConstraint |
CPSolver.geq(int c,
IntExp x)
|
SConstraint |
CPSolver.geq(RealExp exp,
double cst)
|
SConstraint |
CPSolver.geq(RealExp exp1,
RealExp exp2)
Superiority constraint. |
SConstraint |
CPSolver.geqCard(SetVar sv,
int v)
|
SConstraint |
CPSolver.geqCard(SetVar sv,
IntDomainVar v)
|
SConstraint |
CPSolver.getCstr(Constraint ic)
|
SConstraint |
CPSolver.gt(IntExp x,
int c)
|
SConstraint |
CPSolver.gt(IntExp x,
IntExp y)
|
SConstraint |
CPSolver.gt(int c,
IntExp x)
|
SConstraint |
CPSolver.infeasiblePairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
int ac)
|
SConstraint |
CPSolver.infeasiblePairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat,
int ac)
|
SConstraint |
CPSolver.infeasibleTupleAC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Arc Consistency on a given a given list of infeasible tuples. |
SConstraint |
CPSolver.infeasibleTupleAC(IntDomainVar[] vars,
List<int[]> tuples,
int ac)
Create a constraint enforcing Arc Consistency on a given a given list of infeasible tuples |
static SConstraint |
CPSolver.infeasibleTupleFC(IntDomainVar[] vars,
TuplesTable tuples)
Create a constraint enforcing Forward Checking on a given a given list of infeasible tuples |
SConstraint |
CPSolver.infeasPairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat)
|
SConstraint |
CPSolver.infeasPairAC(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
int ac)
|
SConstraint |
CPSolver.infeasPairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat)
|
SConstraint |
CPSolver.infeasPairAC(IntDomainVar v1,
IntDomainVar v2,
List<int[]> mat,
int ac)
|
SConstraint |
CPSolver.infeasTupleAC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Arc Consistency on a given a given list of infeasible tuples |
static SConstraint |
CPSolver.infeasTupleFC(IntDomainVar[] vars,
List<int[]> tuples)
Create a constraint enforcing Forward Checking on a given a given list of infeasible tuples |
SConstraint |
CPSolver.leq(double cst,
RealExp exp)
|
SConstraint |
CPSolver.leq(IntExp v1,
int v2)
|
SConstraint |
CPSolver.leq(IntExp v1,
IntExp v2)
|
SConstraint |
CPSolver.leq(int v1,
IntExp v2)
|
SConstraint |
CPSolver.leq(RealExp exp,
double cst)
|
SConstraint |
CPSolver.leq(RealExp exp1,
RealExp exp2)
Inferority constraint. |
SConstraint |
CPSolver.leqCard(SetVar sv,
int i)
|
SConstraint |
CPSolver.leqCard(SetVar sv,
IntDomainVar i)
|
SConstraint |
CPSolver.lt(IntExp v1,
int v2)
|
SConstraint |
CPSolver.lt(IntExp v1,
IntExp v2)
|
SConstraint |
CPSolver.lt(int v1,
IntExp v2)
|
SConstraint |
CPSolver.makeEquation(RealExp exp,
RealIntervalConstant cst)
Makes an equation from an expression and a constant interval. |
protected SConstraint |
CPSolver.makeMapespanConstraint()
// create makespan constraint : makespan = max (end(T) |
SConstraint |
CPSolver.makeSConstraint(Constraint mc)
|
SConstraint |
CPModelToCPSolver.makeSConstraint(Constraint ic)
|
SConstraint |
CPSolver.makeSConstraint(Constraint mc,
boolean b)
|
SConstraint |
CPModelToCPSolver.makeSConstraint(Constraint ic,
Boolean decomp)
|
SConstraint[] |
CPSolver.makeSConstraintAndOpposite(Constraint mc)
|
SConstraint[] |
CPModelToCPSolver.makeSConstraintAndOpposite(Constraint ic)
|
SConstraint[] |
CPSolver.makeSConstraintAndOpposite(Constraint mc,
boolean b)
|
SConstraint[] |
CPModelToCPSolver.makeSConstraintAndOpposite(Constraint ic,
Boolean decomp)
|
SConstraint |
CPSolver.makeTupleAC(IntDomainVar[] vs,
List<int[]> tuples,
boolean feas)
Create a constraint to enforce GAC on a list of feasible or infeasible tuples |
static SConstraint |
CPSolver.makeTupleFC(IntDomainVar[] vs,
List<int[]> tuples,
boolean feas)
|
SConstraint |
CPSolver.neq(IntExp x,
int c)
Creates a constraint by stating that a term is not equal than a constant |
SConstraint |
CPSolver.neq(IntExp x,
IntExp y)
|
protected static SConstraint |
CPSolver.neq(int c0,
IntDomainVar v0,
int cste)
always succeeds to build the constraint |
protected static SConstraint |
CPSolver.neq(int c0,
IntDomainVar v0,
int c1,
IntDomainVar v1,
int cste)
could fail to build a binary constraint and give the hand to IntLinComb |
SConstraint |
CPSolver.neq(int c,
IntExp x)
|
static SConstraint |
CPSolver.neq(SetVar s1,
SetVar s2)
|
SConstraint |
CPSolver.occurence(IntDomainVar[] vars,
IntDomainVar occ,
int value)
|
SConstraint |
CPSolver.preceding(IntDomainVar direction,
TaskVar t1,
int k1,
TaskVar t2,
int k2)
|
SConstraint |
CPSolver.preceding(IntDomainVar direction,
TaskVar t1,
TaskVar t2)
|
SConstraint |
CPSolver.preceding(TaskVar t1,
int k1,
TaskVar t2)
|
SConstraint |
CPSolver.reifiedIntConstraint(IntDomainVar binVar,
SConstraint c)
|
static SConstraint |
CPSolver.reifiedIntConstraint(IntDomainVar binVar,
SConstraint c,
SConstraint opc,
Solver solver)
|
SConstraint |
CPSolver.relationPairAC(IntDomainVar v1,
IntDomainVar v2,
BinRelation binR)
|
SConstraint |
CPSolver.relationPairAC(IntDomainVar v1,
IntDomainVar v2,
BinRelation binR,
int ac)
|
SConstraint |
CPSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela)
Create a constraint enforcing Arc Consistency on a given consistency relation. |
SConstraint |
CPSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela,
int ac)
Create a constraint enforcing Arc Consistency on a given consistency relation. |
static SConstraint |
CPSolver.relationTupleFC(IntDomainVar[] vs,
LargeRelation rela)
Create a constraint enforcing Forward Checking on a given consistency relation |
Methods in choco.cp.solver that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
CPSolver.getConstraintIterator()
|
DisposableIterator<SConstraint> |
CPSolver.getIntConstraintIterator()
Deprecated. |
Methods in choco.cp.solver with parameters of type SConstraint | |
---|---|
void |
CPSolver.eraseConstraint(SConstraint c)
removes (permanently) a constraint from the constraint network Beware, this is a permanent removal, it may not be backtracked Warnin : For a composition of constraint by boolean connectors, only the root constraint may be removed. |
void |
CPSolver.post(SConstraint... ccs)
|
void |
CPSolver.post(SConstraint cc)
Network management: adding a constraint to the model. |
protected void |
CPSolver.post(SConstraint cc,
boolean dynamicPost)
|
void |
CPSolver.postCut(SConstraint cc)
Network management: adding a constraint to the model. |
void |
CPSolver.postRedundantSetConstraints(SConstraint p)
Post the redundant constraint that allows to capture the reasonnings on cardinalities |
SConstraint |
CPSolver.reifiedIntConstraint(IntDomainVar binVar,
SConstraint c)
|
static SConstraint |
CPSolver.reifiedIntConstraint(IntDomainVar binVar,
SConstraint c,
SConstraint opc,
Solver solver)
|
static SConstraint |
CPSolver.reifiedIntConstraint(IntDomainVar binVar,
SConstraint c,
SConstraint opc,
Solver solver)
|
Uses of SConstraint in choco.cp.solver.constraints.global |
---|
Classes in choco.cp.solver.constraints.global that implement SConstraint | |
---|---|
class |
AmongGAC
User : cprudhom, fhermenie Mail : cprudhom(a)emn.fr Date : 22 fevr. 2010 Since : Choco 2.1.1 GCCAT: NVAR is the number of variables of the collection VARIABLES that take their value in VALUES. |
class |
AtMostNValue
Enforce the number of identical values wihtin a list of variables to be at most a given variable. |
class |
BoundAllDiff
|
class |
BoundGcc
A constraint to enforce BoundConsistency on a global cardinality based on the implementation of : C. |
class |
BoundGccVar
User: hcambaza Bound Global cardinality : Given an array of variables vars, an array of variables card to represent the cardinalities, the constraint ensures that the number of occurences of the value i among the variables is equal to card[i]. |
class |
Exactly
User : cprudhom Mail : cprudhom(a)emn.fr Date : 22 f�vr. 2010 Since : Choco 2.1.1 GCCAT: NVAR is the number of variables of the collection VARIABLES that take their value in VALUES. |
class |
Geost_Constraint
|
class |
IncreasingNValue
User : xlorca Mail : xlorca(a)emn.fr Date : 29 janv. 2010 Since : Choco 2.1.1 |
class |
Lex
Enforce a lexicographic ordering on two vectors of integer variables x <_lex y with x = |
class |
LexChain
Created by IntelliJ IDEA. |
class |
LeximinSConstraint
SemiLeximinConstraint is a constraint that ensures
the leximin ordering between one vector of variables and one of integers. |
class |
Occurrence
|
class |
SemiLeximinSConstraint
SemiLeximinConstraint is a constraint that ensures
the leximin ordering between one vector of variables and one of integers. |
class |
SortingSConstraint
SortingConstraint is a constraint that ensures
that a vector is the sorted version of a second one. |
Uses of SConstraint in choco.cp.solver.constraints.global.automata.fast_costregular |
---|
Classes in choco.cp.solver.constraints.global.automata.fast_costregular that implement SConstraint | |
---|---|
class |
CostKnapSack
Created by IntelliJ IDEA. |
class |
CostRegular
Created by IntelliJ IDEA. |
Uses of SConstraint in choco.cp.solver.constraints.global.automata.fast_multicostregular |
---|
Classes in choco.cp.solver.constraints.global.automata.fast_multicostregular that implement SConstraint | |
---|---|
class |
MultiCostRegular
Created by IntelliJ IDEA. |
class |
SoftMultiCostRegular
Created by IntelliJ IDEA. |
Uses of SConstraint in choco.cp.solver.constraints.global.automata.fast_regular |
---|
Classes in choco.cp.solver.constraints.global.automata.fast_regular that implement SConstraint | |
---|---|
class |
FastRegular
Created by IntelliJ IDEA. |
Uses of SConstraint in choco.cp.solver.constraints.global.matching |
---|
Classes in choco.cp.solver.constraints.global.matching that implement SConstraint | |
---|---|
class |
AllDifferent
Standard alldiff constraint with generalized AC integer valued variables are used only for the left vertex set no explicit variables are used for the right vertex set the right vertex set is the interval (minValue .. maxValue) |
class |
GlobalCardinality
very simple version of the cardinality constraint where the values the set of values whose occurrences are counted in the interval (minValue .. maxValue) |
class |
GlobalCardinalityVar
Simple implementation of global cardinality constraint with occurrence constrained by variables and not only integer bounds. |
Uses of SConstraint in choco.cp.solver.constraints.global.ordered |
---|
Classes in choco.cp.solver.constraints.global.ordered that implement SConstraint | |
---|---|
class |
OrderedGcc
|
Methods in choco.cp.solver.constraints.global.ordered that return SConstraint | |
---|---|
SConstraint |
OrderedGccManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in choco.cp.solver.constraints.global.pack |
---|
Classes in choco.cp.solver.constraints.global.pack that implement SConstraint | |
---|---|
class |
PackSConstraint
Pack which maintains a primal-dual packing model. |
Uses of SConstraint in choco.cp.solver.constraints.global.regular |
---|
Classes in choco.cp.solver.constraints.global.regular that implement SConstraint | |
---|---|
class |
Regular
Created by IntelliJ IDEA. |
Uses of SConstraint in choco.cp.solver.constraints.global.scheduling |
---|
Classes in choco.cp.solver.constraints.global.scheduling that implement SConstraint | |
---|---|
class |
AbstractResourceSConstraint
|
class |
AbstractUseResourcesSConstraint
|
class |
TempTaskConstraintWrapper
|
class |
UseResourcesEq
|
class |
UseResourcesGeq
|
Uses of SConstraint in choco.cp.solver.constraints.global.scheduling.cumulative |
---|
Classes in choco.cp.solver.constraints.global.scheduling.cumulative that implement SConstraint | |
---|---|
class |
AbstractCumulativeSConstraint
|
class |
AltCumulative
|
class |
Cumulative
|
Uses of SConstraint in choco.cp.solver.constraints.global.scheduling.disjunctive |
---|
Classes in choco.cp.solver.constraints.global.scheduling.disjunctive that implement SConstraint | |
---|---|
class |
AltDisjunctive
|
class |
Disjunctive
|
class |
ForbiddenIntervals
specialized filtering for makespan minimization on unary resource. |
Uses of SConstraint in choco.cp.solver.constraints.global.scheduling.precedence |
---|
Classes in choco.cp.solver.constraints.global.scheduling.precedence that implement SConstraint | |
---|---|
class |
AbstractPrecedenceSConstraint
|
class |
PrecedenceDisjoint
Let b be a boolean variables; x1, x2 be two integer variables and k1, k2 two integers. |
class |
PrecedenceImplied
|
class |
PrecedenceReified
b = 1 <=> x1 + k1 <= x2 b = 0 <=> x1 + k1 > x2 |
class |
PrecedenceVDisjoint
if b is true then t1 ends before t2, otherwise t2 ends before t1. |
class |
PrecedenceVSDisjoint
The precedence disjoint constraint with setup times and variable duration. |
class |
VariablePrecedenceDisjoint
Let b be a boolean variables; x0, x1 be two integer variables and k1, k2 two integers. |
Uses of SConstraint in choco.cp.solver.constraints.global.softscheduling |
---|
Classes in choco.cp.solver.constraints.global.softscheduling that implement SConstraint | |
---|---|
class |
AbstractSoftCumulative
|
class |
SoftCumulative
|
class |
SoftCumulativeSum
|
Methods in choco.cp.solver.constraints.global.softscheduling that return SConstraint | |
---|---|
SConstraint |
SoftCumulativeSumManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
SoftCumulativeManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in choco.cp.solver.constraints.global.tree |
---|
Classes in choco.cp.solver.constraints.global.tree that implement SConstraint | |
---|---|
class |
TreeSConstraint
A global tree partitioning constraint that deals with several restrictions: - The number of trees allowed to partition the graph (assuming an isolated node forms a tree), - The number of proper trees allowed to partition the graph (assuming a proper tree contains at least 2 nodes), - Partial order between the nodes of the digraph, - Incomparability relations between the nodes of the digraph, - Degree restrictions related to the number of incoming arc of each node, - Time windows associated with each node that represent the starting time from each node. |
Uses of SConstraint in choco.cp.solver.constraints.integer |
---|
Classes in choco.cp.solver.constraints.integer that implement SConstraint | |
---|---|
class |
Absolute
The absolute constraint X = |Y| is a binary constraint with X = v0 and Y = v1 |
class |
DistanceXYC
|
class |
DistanceXYZ
A constraint to state |x0 - x1| operator x2 + c where operator can be =, <=, >= and x1, x2, x3 are variables Warning: only achieves BoundConsistency for the moment ! |
class |
Element
|
class |
Element2D
Ensure that lvals[v0][v1] = v2 where lvals is an int[][] User: hcambaza Date: 16-Jan-2007 Time: 18:54:33 |
class |
ElementG
|
class |
ElementV
A class implementing the constraint A[I] == X, with I and X being IntVars and A an array of IntVars |
class |
ElementVG
A class implementing the constraint A[I] == X, with I and X being IntVars and A an array of IntVars |
class |
EqualXC
Implements a constraint X = C, with X a variable and C a constant. |
class |
EqualXY_C
Implements a constraint X + Y == C, with X and Y two variables and C a constant. |
class |
EqualXYC
Implements a constraint X == Y + C, with X and Y two variables and C a constant. |
class |
EuclideanDivisionXYZ
|
class |
GreaterOrEqualXC
Implements a constraint X >= C, with X a variable and C a constant. |
class |
GreaterOrEqualXY_C
Implements a constraint X + Y >= C, with X and Y two variables and C a constant. |
class |
GreaterOrEqualXYC
Implements a constraint X >= Y + C, with X and Y two variables and C a constant. |
class |
IncreasingSum
A sum constraint with increasing variables s = x_0 + x_1 + ... + x_(n-1) and x_0 <= x_1 <= ... <= x_(n-1) Bounds-consistency algorithm linear in n (the number of variables) See "A O(n) Bound-Consistency Algorithm for the Increasing Sum Constraint", T. |
class |
IntLinComb
Implements a constraint Sigma (ai Xi) <=/>=/= C, with Xi variables, ai and C constants. |
class |
InverseChanneling
|
class |
InverseChannelingWithinRange
Created by IntelliJ IDEA. |
class |
LessOrEqualXC
Implements a constraint X <= C, with X a variable and C a constant. |
class |
LessOrEqualXY_C
Implements a constraint X + Y <= C , with X and Y two variables and C a constant. |
class |
MaxOfAList
Implements a constraint X = max(Y_0, Y_1...Y_n). |
class |
MaxXYZ
|
class |
MemberBound
User : cprudhom Mail : cprudhom(a)emn.fr Date : 22 f�vr. 2010 Since : Choco 2.1.1 |
class |
MemberEnum
User : cprudhom Mail : cprudhom(a)emn.fr Date : 22 f�vr. 2010 Since : Choco 2.1.1 |
class |
MinOfAList
Implements a constraint X = min(Y_0, Y_1...Y_n). |
class |
MinXYZ
|
class |
ModuloXYC2
Created by IntelliJ IDEA. |
class |
NotEqualXC
Implements a constraint X ! |
class |
NotEqualXY_C
Implements a constraint X + Y ! |
class |
NotEqualXYC
Implements a constraint X ! |
class |
NotMemberBound
User : cprudhom Mail : cprudhom(a)emn.fr Date : 22 f�vr. 2010 Since : Choco 2.1.1 |
class |
NotMemberEnum
User : cprudhom Mail : cprudhom(a)emn.fr Date : 22 f�vr. 2010 Since : Choco 2.1.1 |
class |
SignOp
|
class |
TimesXYZ
a constraint modelling X * Y = Z [BUG 3297805]: fix |
Uses of SConstraint in choco.cp.solver.constraints.integer.bool |
---|
Classes in choco.cp.solver.constraints.integer.bool that implement SConstraint | |
---|---|
class |
BinAnd
|
class |
BinNand
maintain v1 NAND v2 where v1 and v2 are boolean variables i.e variables of domain {0,1} |
class |
BinNor
|
class |
BinOr
maintaint v1 Or v2 where v1 and v2 are boolean variables i.e variables of domain {0,1} |
class |
BinXnor
|
class |
BinXor
|
class |
BoolIntLinComb
A constraint to enforce Sigma_i coef[i]*x_i + k OP y_i where : - OP belongs to >=, <=, = - k is a constant - x_i are boolean variable - t_i is an enum variable It improves the general IntLinComb by storing lower and upper bound of the expression and sorting coefficient for filtering. |
class |
BoolTimesXYZ
A simple Product constraint between boolean variables : x * y = z |
class |
Identity
User : cprudhom Mail : cprudhom(a)emn.fr Date : 18 mai 2010 Since : Choco 2.1.1 maintain v1 is true where v1 is a boolean variable, domain = {0,1} |
class |
LargeAnd
|
class |
LargeNand
|
class |
LargeNor
|
class |
LargeOr
|
class |
LargeXnor
|
class |
LargeXor
|
class |
Not
User : cprudhom Mail : cprudhom(a)emn.fr Date : 18 mai 2010 Since : Choco 2.1.1 maintain v1 is false where v1 is a boolean variable, domain = {0,1} |
Uses of SConstraint in choco.cp.solver.constraints.integer.bool.sat |
---|
Classes in choco.cp.solver.constraints.integer.bool.sat that implement SConstraint | |
---|---|
class |
ClauseStore
A global constraint to store and propagate all clauses |
Uses of SConstraint in choco.cp.solver.constraints.integer.bool.sum |
---|
Classes in choco.cp.solver.constraints.integer.bool.sum that implement SConstraint | |
---|---|
class |
AbstractBoolSum
A special case of sums over boolean variables only |
class |
EqBoolSum
|
class |
GeqBoolSum
|
class |
LeqBoolSum
|
class |
NeqBoolSum
|
Uses of SConstraint in choco.cp.solver.constraints.integer.channeling |
---|
Classes in choco.cp.solver.constraints.integer.channeling that implement SConstraint | |
---|---|
class |
BooleanChanneling
a simple channeling constraint : y_ij = 1 si x_i = j y_ij = 0 sinon |
class |
DomainChanneling
Constraints that map the boolean assignments variables (bvars) with the standard assignment variables (var). |
class |
ReifiedBinImplication
|
class |
ReifiedBinXnor
A constraint that ensures : b = x1 xnor x2 ... |
class |
ReifiedBinXor
A constraint that ensures : b = x1 xor x2 ... xor xn where b, and x1,... xn are boolean variables (of domain {0,1}) |
class |
ReifiedLargeAnd
|
class |
ReifiedLargeNand
User : cprudhom Mail : cprudhom(a)emn.fr Date : 18 mai 2010 Since : Choco 2.1.1 A constraint that ensures : b = x1 NAND x2 ... |
class |
ReifiedLargeNor
User : cprudhom Mail : cprudhom(a)emn.fr Date : 18 mai 2010 Since : Choco 2.1.1 A constraint that ensures : b = x1 NOR x2 ... |
class |
ReifiedLargeOr
A constraint that ensures : b = x1 OR x2 ... |
Uses of SConstraint in choco.cp.solver.constraints.integer.extension |
---|
Classes in choco.cp.solver.constraints.integer.extension that implement SConstraint | |
---|---|
class |
AC2001BinSConstraint
|
class |
AC3BinSConstraint
|
class |
AC3rmBinSConstraint
The AC3rm algorithm. |
class |
AC3rmBitBinSConstraint
|
class |
CspLargeSConstraint
|
class |
FCBinSConstraint
A binary constraint for simple forward checking |
class |
GAC2001LargeSConstraint
GAC 2001 in valid tuples (do not support bound variables) |
class |
GAC2001PositiveLargeConstraint
GAC2001 in allowed tuples |
class |
GAC3rmLargeConstraint
|
class |
GAC3rmPositiveLargeConstraint
GAC3rm (GAC3 with residual supports) |
class |
GACstrPositiveLargeSConstraint
GAC maintained by STR |
Uses of SConstraint in choco.cp.solver.constraints.integer.intlincomb |
---|
Methods in choco.cp.solver.constraints.integer.intlincomb that return SConstraint | |
---|---|
static SConstraint |
IntLinCombFactory.createBoolLinComb(IntVar[] vars,
int[] lcoeffs,
int c,
int linOperator,
CPSolver solver)
|
static SConstraint |
IntLinCombFactory.makeIntLinComb(IntTerm t,
int c,
int linOperator,
CPSolver solver)
does not consider IntTerm.getConstant() anymore. |
Uses of SConstraint in choco.cp.solver.constraints.integer.soft |
---|
Classes in choco.cp.solver.constraints.integer.soft that implement SConstraint | |
---|---|
class |
SoftIntSConstraint
|
Methods in choco.cp.solver.constraints.integer.soft with parameters of type SConstraint | |
---|---|
void |
SoftIntSConstraint.addListener(SConstraint thecons)
|
Uses of SConstraint in choco.cp.solver.constraints.real |
---|
Classes in choco.cp.solver.constraints.real that implement SConstraint | |
---|---|
class |
Equation
A basic constraint using HC4 algorithm for filtering values with respect to a mathematical equation. |
class |
MixedCstElt
Let x be an integer variable with n values and v be a real variable. |
class |
MixedEqXY
|
Uses of SConstraint in choco.cp.solver.constraints.reified |
---|
Classes in choco.cp.solver.constraints.reified that implement SConstraint | |
---|---|
class |
ExpressionSConstraint
User: hcambaza A constraint to deal with complex expression of variables involving a wide range of operators |
class |
IfThenElse
A constraint to state : if (bool = 1) cons else othercons |
class |
ReifiedAllSConstraint
A constraint that allows to reify another constraint into a boolean value. |
class |
ReifiedIntSConstraint
A constraint that allows to reify another constraint into a boolean value. |
Fields in choco.cp.solver.constraints.reified declared as SConstraint | |
---|---|
protected SConstraint |
ExpressionSConstraint.knownIntensionalConstraint
|
Methods in choco.cp.solver.constraints.reified that return SConstraint | |
---|---|
static SConstraint |
ReifiedFactory.builder(IntDomainVar bool,
SConstraint cons,
SConstraint oppcons,
Solver solver)
Following the type of constraints, create a reified constraint. |
static SConstraint |
ReifiedFactory.builder(IntDomainVar bool,
SConstraint cons,
Solver s)
Following the type of constraints, create a reified constraint. |
SConstraint |
ExpressionSConstraint.getDecomposition(Solver s)
Perform the decomposition of the Expression into elementary constraints. |
SConstraint |
ExpressionSConstraint.getExtensionnal(Solver s)
return the extensional propagator intended to propagate the expression |
SConstraint |
ExpressionSConstraint.getKnownIntensionalConstraint()
|
Methods in choco.cp.solver.constraints.reified with parameters of type SConstraint | |
---|---|
static SConstraint |
ReifiedFactory.builder(IntDomainVar bool,
SConstraint cons,
SConstraint oppcons,
Solver solver)
Following the type of constraints, create a reified constraint. |
static SConstraint |
ReifiedFactory.builder(IntDomainVar bool,
SConstraint cons,
SConstraint oppcons,
Solver solver)
Following the type of constraints, create a reified constraint. |
static SConstraint |
ReifiedFactory.builder(IntDomainVar bool,
SConstraint cons,
Solver s)
Following the type of constraints, create a reified constraint. |
void |
ExpressionSConstraint.setKnownIntensionalConstraint(SConstraint knownIntensionalConstraint)
|
Uses of SConstraint in choco.cp.solver.constraints.reified.leaves |
---|
Methods in choco.cp.solver.constraints.reified.leaves that return SConstraint | |
---|---|
SConstraint |
ConstraintLeaf.extractConstraint(Solver s)
|
Constructors in choco.cp.solver.constraints.reified.leaves with parameters of type SConstraint | |
---|---|
ConstraintLeaf(SConstraint c)
|
|
ConstraintLeaf(SConstraint c,
SConstraint oppositec)
|
|
ConstraintLeaf(SConstraint c,
SConstraint oppositec)
|
Uses of SConstraint in choco.cp.solver.constraints.reified.leaves.arithm |
---|
Methods in choco.cp.solver.constraints.reified.leaves.arithm that return SConstraint | |
---|---|
SConstraint |
IfThenElseNode.extractConstraint(Solver s)
|
Uses of SConstraint in choco.cp.solver.constraints.reified.leaves.bool |
---|
Methods in choco.cp.solver.constraints.reified.leaves.bool that return SConstraint | |
---|---|
SConstraint |
XorNode.extractConstraint(Solver s)
|
SConstraint |
XnorNode.extractConstraint(Solver s)
|
SConstraint |
TrueNode.extractConstraint(Solver s)
|
SConstraint |
SameSignNode.extractConstraint(Solver s)
|
SConstraint |
OrNode.extractConstraint(Solver s)
|
SConstraint |
OppSignNode.extractConstraint(Solver s)
|
SConstraint |
NotNode.extractConstraint(Solver s)
|
SConstraint |
NorNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
NeqNode.extractConstraint(Solver s)
|
SConstraint |
NandNode.extractConstraint(Solver s)
|
SConstraint |
LtNode.extractConstraint(Solver s)
|
SConstraint |
LeqNode.extractConstraint(Solver s)
|
SConstraint |
GtNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
GeqNode.extractConstraint(Solver s)
|
SConstraint |
FalseNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
EqNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
DistNeqNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
DistLtNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
DistGtNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
DistEqNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
SConstraint |
AndNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
abstract SConstraint |
AbstractBoolNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
Uses of SConstraint in choco.cp.solver.constraints.set |
---|
Classes in choco.cp.solver.constraints.set that implement SConstraint | |
---|---|
class |
AbstractBoundOfASet
An abstract class used for MaxOfASet and MinOfaSet constraints |
class |
AllDisjoint
|
class |
AmongSet
User : cprudhom Mail : cprudhom(a)emn.fr Date : 23 f�vr. 2010 Since : Choco 2.1.1 NVAR is the number of variables of the collection VARIABLES that take their value in SVAR. |
class |
ComplementSet
Created by IntelliJ IDEA. |
class |
Disjoint
A constraint stating that two sets have to be disjoint : It is based on two propagation rules : Env(v1) disjoint Ker(v2) Env(v2) disjoint Ker(v1) |
class |
InverseSet
Created by IntelliJ IDEA. |
class |
InverseSetInt
A constraint stating that value j belongs to the s[i] set variable iff integer variable x[j] equals to i. |
class |
IsIncluded
Specify a constraint to state x included y |
class |
IsNotIncluded
|
class |
MaxOfASet
Implements a constraint X = max(Y_i | i \in S). |
class |
MemberX
Enforce a value to belong to a setVar |
class |
MemberXiY
MEMBERXiY(〈X1,... |
class |
MemberXY
Ensure that an int variable belongs to a set variable |
class |
MinOfASet
|
class |
NotMemberX
Ensure that a value will not belong to a setVar |
class |
NotMemberXY
Ensure that an int variable does not belong to a set variable |
class |
SetCard
|
class |
SetEq
|
class |
SetIntersection
A constraint stating that a set is the intersection of two others There are seven propagation rules for the constraint sv3 = intersection(sv1, sv2) Ker(sv1) contains Ker(sv3) Ker(sv2) contains Ker(sv3) Ker(sv3) contains (Ker(sv1) inter Ker(sv2)) Env(v3) disjoint Complement(Env(v1)) Env(v3) disjoint Complement(Env(v2)) Env(v2) disjoint Ker(v1) inter Complement(Env(v3)) Env(v1) disjoint Ker(v2) inter Complement(Env(v3)) |
class |
SetLexicographicOrdering
Created by IntelliJ IDEA. |
class |
SetNaryUnion
|
class |
SetNotEq
A constraint to state that two set vars can not be equal |
class |
SetUnion
A constraint stating that a set is the union of two others There are seven propagation rules for the constraint sv3 = union(sv1, sv2) Ker(sv1) contains Ker(sv3) Ker(sv2) contains Ker(sv3) Ker(sv3) contains (Ker(sv1) inter Ker(sv2)) Env(v3) disjoint Complement(Env(v1)) Env(v3) disjoint Complement(Env(v2)) Env(v2) disjoint Ker(v1) inter Complement(Env(v3)) Env(v1) disjoint Ker(v2) inter Complement(Env(v3)) |
class |
SetValuePrecede
Created by IntelliJ IDEA. |
Methods in choco.cp.solver.constraints.set that return SConstraint | |
---|---|
SConstraint |
MemberXiY.MemberXiYManager.makeConstraint(Solver solver,
Variable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in choco.cp.solver.constraints.strong |
---|
Subinterfaces of SConstraint in choco.cp.solver.constraints.strong | |
---|---|
interface |
ISpecializedConstraint
|
Classes in choco.cp.solver.constraints.strong that implement SConstraint | |
---|---|
class |
AbstractStrongConsistency<MyVariable extends SCVariable<? extends SCConstraint>>
|
class |
Adapter
|
Methods in choco.cp.solver.constraints.strong that return SConstraint | |
---|---|
SConstraint |
SCConstraint.getSConstraint()
|
SConstraint |
StrongConsistencyManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
StrongConsistencyManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in choco.cp.solver.constraints.strong.maxrpcrm |
---|
Classes in choco.cp.solver.constraints.strong.maxrpcrm that implement SConstraint | |
---|---|
class |
MaxRPCrm
|
Uses of SConstraint in choco.cp.solver.preprocessor |
---|
Methods in choco.cp.solver.preprocessor with type parameters of type SConstraint | ||
---|---|---|
|
PreProcessCPSolver.setCstr(MC c,
SC sc)
|
Methods in choco.cp.solver.preprocessor that return SConstraint | |
---|---|
protected SConstraint |
PPModelToCPSolver.createMetaConstraint(Constraint ic,
Boolean decomp)
Override the creation of Expression Constraint as in the preprocessing they might have been built earlier or identified as an intensional constraint. |
Uses of SConstraint in choco.cp.solver.propagation |
---|
Methods in choco.cp.solver.propagation with parameters of type SConstraint | |
---|---|
void |
AbstractPropagationEngine.postAddKer(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of kernel addition event |
void |
ChocoEngine.postEvent(Var v,
int basicEvt,
SConstraint constraint,
boolean forceAwake)
Generic method to post events. |
void |
AbstractPropagationEngine.postInstInt(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation event |
void |
AbstractPropagationEngine.postInstSet(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation event |
void |
AbstractPropagationEngine.postRemEnv(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of envelope removal event |
void |
AbstractPropagationEngine.postRemoveVal(IntDomainVar v,
int x,
SConstraint constraint,
boolean forceAwake)
Specific method to post removal event |
void |
AbstractPropagationEngine.postUpdateInf(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of lower bound event |
void |
AbstractPropagationEngine.postUpdateInf(RealVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of lower bound event |
void |
AbstractPropagationEngine.postUpdateSup(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
void |
AbstractPropagationEngine.postUpdateSup(RealVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
void |
AbstractPropagationEngine.raiseContradiction(int cidx,
Var variable,
SConstraint cause)
Deprecated. |
Uses of SConstraint in choco.cp.solver.search.integer.branching |
---|
Methods in choco.cp.solver.search.integer.branching with parameters of type SConstraint | |
---|---|
protected static void |
DomOverWDegBranching.appendConstraint(StringBuilder b,
SConstraint c)
Deprecated. |
void |
DomOverWDegBinBranching.initConstraintForBranching(SConstraint s)
Deprecated. |
void |
DomOverWDegBranching.initConstraintForBranching(SConstraint c)
Deprecated. |
void |
AssignVar.initConstraintForBranching(SConstraint c)
|
Uses of SConstraint in choco.cp.solver.search.integer.branching.domwdeg |
---|
Methods in choco.cp.solver.search.integer.branching.domwdeg with parameters of type SConstraint | |
---|---|
static void |
DomWDegUtils.addConstraintExtension(SConstraint<?> c)
|
static void |
DomWDegUtils.addConstraintToVarWeights(SConstraint<?> c)
|
static void |
DomWDegUtils.addFailure(SConstraint<?> cause)
|
static void |
DomWDegUtils.addIncFailure(SConstraint<?> cause)
|
static Extension |
DomWDegUtils.getConstraintExtension(SConstraint<?> c)
|
static int |
DomWDegUtils.getFineDegree(Var v,
SConstraint<?> c,
int cIdx)
|
static boolean |
DomWDegUtils.hasAtLeastTwoNotInstVars(SConstraint<?> c)
|
protected static boolean |
DomWDegUtils.hasTwoNotInstVars(SConstraint<?> c)
|
void |
AbstractDomOverWDegBranching.initConstraintForBranching(SConstraint c)
|
Uses of SConstraint in choco.cp.solver.search.integer.varselector |
---|
Methods in choco.cp.solver.search.integer.varselector with parameters of type SConstraint | |
---|---|
void |
DomOverWDeg.initConstraintForBranching(SConstraint c)
Deprecated. |
Uses of SConstraint in choco.cp.solver.variables.integer |
---|
Methods in choco.cp.solver.variables.integer that return SConstraint | |
---|---|
SConstraint |
AbstractBijectiveVar.getConstraint(int i)
|
Methods in choco.cp.solver.variables.integer that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
AbstractBijectiveVar.getConstraintsIterator()
|
PartiallyStoredVector<? extends SConstraint> |
AbstractBijectiveVar.getConstraintVector()
|
Methods in choco.cp.solver.variables.integer with parameters of type SConstraint | |
---|---|
protected boolean |
BooleanDomain._instantiate(int x,
SConstraint cause)
Instantiating a variable to an search value. |
protected boolean |
IntervalIntDomain._removeVal(int x,
SConstraint cause)
|
protected boolean |
BooleanDomain._removeVal(int x,
SConstraint cause)
Removing a value from the domain of a variable. |
protected boolean |
BipartiteIntDomain._removeVal(int x,
SConstraint cause)
Removing a value from the domain of a variable. |
protected boolean |
BooleanDomain._updateInf(int x,
SConstraint cause)
Improving the lower bound. |
protected boolean |
BooleanDomain._updateSup(int x,
SConstraint cause)
Improving the upper bound. |
int |
AbstractBijectiveVar.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
|
void |
AbstractBijectiveVar.eraseConstraint(SConstraint c)
|
boolean |
ViewIntDomainVarImpl.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Internal var: instantiation of the variable caused by its i-th constraint Returns a boolean indicating whether the call indeed added new information. |
boolean |
IntDomainVarTimePosCste.instantiate(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
IntDomainVarImpl.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Internal var: instantiation of the variable caused by its i-th constraint Returns a boolean indicating whether the call indeed added new information. |
boolean |
IntDomainVarAddCste.instantiate(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
BooleanVarImpl.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Internal var: instantiation of the variable caused by its i-th constraint Returns a boolean indicating whether the call indeed added new information. |
boolean |
BooleanDomain.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Internal var: instantiation of the variable caused by its i-th constraint Returns a boolean indicating whether the call indeed added new information. |
boolean |
BoolVarNot.instantiate(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
AbstractIntDomain.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Internal var: instantiation of the variable caused by its i-th constraint Returns a boolean indicating whether the call indeed added new information. |
void |
IntVarEvent.recordEventTypeAndCause(int basicEvt,
SConstraint constraint,
boolean forceAwake)
|
boolean |
ViewIntDomainVarImpl.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
Internal var: remove an interval (a sequence of consecutive values) from the domain of a variable caused by its i-th constraint. |
boolean |
IntDomainVarTimePosCste.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
|
boolean |
IntDomainVarImpl.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
Internal var: remove an interval (a sequence of consecutive values) from the domain of a variable caused by its i-th constraint. |
boolean |
IntDomainVarAddCste.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
|
boolean |
BooleanVarImpl.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
Internal var: remove an interval (a sequence of consecutive values) from the domain of a variable caused by its i-th constraint. |
boolean |
BoolVarNot.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
|
boolean |
BipartiteIntDomain.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
|
boolean |
AbstractIntDomain.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
Internal var: remove an interval (a sequence of consecutive values) from the domain of a variable caused by its i-th constraint. |
boolean |
ViewIntDomainVarImpl.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update (value removal) on the domain of a variable caused by its i-th constraint. |
boolean |
IntDomainVarTimePosCste.removeVal(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
IntDomainVarImpl.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update (value removal) on the domain of a variable caused by its i-th constraint. |
boolean |
IntDomainVarAddCste.removeVal(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
BooleanVarImpl.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update (value removal) on the domain of a variable caused by its i-th constraint. |
boolean |
BooleanDomain.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update (value removal) on the domain of a variable caused by its i-th constraint. |
boolean |
BoolVarNot.removeVal(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
AbstractIntDomain.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update (value removal) on the domain of a variable caused by its i-th constraint. |
boolean |
ViewIntDomainVarImpl.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable lower bound caused by its i-th constraint. |
boolean |
IntDomainVarTimePosCste.updateInf(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
IntDomainVarImpl.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable lower bound caused by its i-th constraint. |
boolean |
IntDomainVarAddCste.updateInf(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
BooleanVarImpl.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable lower bound caused by its i-th constraint. |
boolean |
BooleanDomain.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable lower bound caused by its i-th constraint. |
boolean |
BoolVarNot.updateInf(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
AbstractIntDomain.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable lower bound caused by its i-th constraint. |
boolean |
ViewIntDomainVarImpl.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable upper bound caused by its i-th constraint. |
boolean |
IntDomainVarTimePosCste.updateSup(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
IntDomainVarImpl.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable upper bound caused by its i-th constraint. |
boolean |
IntDomainVarAddCste.updateSup(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
BooleanVarImpl.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable upper bound caused by its i-th constraint. |
boolean |
BooleanDomain.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable upper bound caused by its i-th constraint. |
boolean |
BoolVarNot.updateSup(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
AbstractIntDomain.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Internal var: update on the variable upper bound caused by its i-th constraint. |
Uses of SConstraint in choco.cp.solver.variables.set |
---|
Methods in choco.cp.solver.variables.set with parameters of type SConstraint | |
---|---|
boolean |
SetVarImpl.addToKernel(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetDomainImpl.addToKernel(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetVarImpl.instantiate(int[] x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetDomainImpl.instantiate(int[] x,
SConstraint cause,
boolean forceAwake)
|
void |
SetVarEvent.recordEventTypeAndCause(int basicEvt,
SConstraint constraint,
boolean forceAwake)
|
boolean |
SetVarImpl.remFromEnveloppe(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetDomainImpl.remFromEnveloppe(int x,
SConstraint cause,
boolean forceAwake)
|
Uses of SConstraint in choco.kernel.memory.structure |
---|
Classes in choco.kernel.memory.structure with type parameters of type SConstraint | |
---|---|
class |
APartiallyStoredCstrList<C extends SConstraint>
|
Methods in choco.kernel.memory.structure that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
APartiallyStoredCstrList.getConstraintsIterator()
This methods should be used if one want to access the different constraints stored. |
Methods in choco.kernel.memory.structure with parameters of type SConstraint | |
---|---|
int |
PartiallyStoredTaskCstrList.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new constraints on the stack of constraints the addition can be dynamic (undone upon backtracking) or not. |
int |
PartiallyStoredIntCstrList.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new constraints on the stack of constraints the addition can be dynamic (undone upon backtracking) or not. |
int |
APartiallyStoredCstrList.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new constraints on the stack of constraints the addition can be dynamic (undone upon backtracking) or not. |
protected void |
APartiallyStoredCstrList.computePriority(SConstraint c)
Compute the priotity of the variable |
int |
PartiallyStoredTaskCstrList.eraseConstraint(SConstraint c)
Removes (permanently) a constraint from the list of constraints connected to the variable. |
int |
PartiallyStoredIntCstrList.eraseConstraint(SConstraint c)
Removes (permanently) a constraint from the list of constraints connected to the variable. |
int |
APartiallyStoredCstrList.eraseConstraint(SConstraint c)
Removes (permanently) a constraint from the list of constraints connected to the variable. |
Uses of SConstraint in choco.kernel.model |
---|
Methods in choco.kernel.model that return SConstraint | |
---|---|
SConstraint |
RealModeler.eq(double cst,
RealExp exp)
|
SConstraint |
RealModeler.eq(RealExp exp,
double cst)
|
SConstraint |
RealModeler.eq(RealExp exp1,
RealExp exp2)
Eqality constraint. |
SConstraint |
RealModeler.geq(double cst,
RealExp exp)
|
SConstraint |
RealModeler.geq(RealExp exp,
double cst)
|
SConstraint |
RealModeler.geq(RealExp exp1,
RealExp exp2)
Superiority constraint. |
SConstraint |
RealModeler.leq(double cst,
RealExp exp)
|
SConstraint |
RealModeler.leq(RealExp exp,
double cst)
|
SConstraint |
RealModeler.leq(RealExp exp1,
RealExp exp2)
Inferority constraint. |
SConstraint |
RealModeler.makeEquation(RealExp exp,
RealConstant cst)
Makes an equation from an expression and a constantt interval. |
Uses of SConstraint in choco.kernel.model.constraints |
---|
Methods in choco.kernel.model.constraints that return SConstraint | |
---|---|
protected static SConstraint |
ConstraintManager.fail()
|
protected static SConstraint |
ConstraintManager.fail(String cname)
|
abstract SConstraint |
ConstraintManager.makeConstraint(Solver solver,
V[] variables,
Object parameters,
List<String> options)
Build a constraint for the given solver and "model variables" |
abstract SConstraint[] |
ConstraintManager.makeConstraintAndOpposite(Solver solver,
V[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in choco.kernel.solver |
---|
Methods in choco.kernel.solver that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
Solver.getConstraintIterator()
|
DisposableIterator<SConstraint> |
Solver.getIntConstraintIterator()
Deprecated. |
Methods in choco.kernel.solver with parameters of type SConstraint | |
---|---|
void |
Solver.eraseConstraint(SConstraint c)
|
void |
Solver.post(SConstraint c)
|
void |
Solver.postCut(SConstraint c)
|
Uses of SConstraint in choco.kernel.solver.branch |
---|
Methods in choco.kernel.solver.branch that return SConstraint | |
---|---|
SConstraint |
ConstraintSelector.getConstraint()
|
Methods in choco.kernel.solver.branch with parameters of type SConstraint | |
---|---|
void |
BranchingWithLoggingStatements.initConstraintForBranching(SConstraint c)
|
void |
AbstractIntBranching.initConstraintForBranching(SConstraint c)
Deprecated. this method is used to build the data structure in the branching for the given constraint. |
void |
AbstractBranchingStrategy.initConstraintForBranching(SConstraint c)
this method is used to build the data structure in the branching for the given constraint. |
Uses of SConstraint in choco.kernel.solver.constraints |
---|
Classes in choco.kernel.solver.constraints that implement SConstraint | |
---|---|
class |
AbstractSConstraint<V extends Var>
An abstract class for all implementations of listeners |
class |
ConstantSConstraint
|
class |
Formula
a class that is used to represent a syntatic formula involving unknowns. |
Methods in choco.kernel.solver.constraints with parameters of type SConstraint | |
---|---|
boolean |
SConstraintType.isTypeOf(SConstraint c)
|
Uses of SConstraint in choco.kernel.solver.constraints.global |
---|
Classes in choco.kernel.solver.constraints.global that implement SConstraint | |
---|---|
class |
MetaSConstraint
|
Fields in choco.kernel.solver.constraints.global declared as SConstraint | |
---|---|
SConstraint[] |
MetaSConstraint.constraints
|
Methods in choco.kernel.solver.constraints.global that return SConstraint | |
---|---|
SConstraint |
MetaSConstraint.getSubConstraints(int i)
|
Constructors in choco.kernel.solver.constraints.global with parameters of type SConstraint | |
---|---|
MetaSConstraint(SConstraint[] constraints,
TaskVar[] tasks,
IntDomainVar[] vars)
|
|
MetaSConstraint(String name,
SConstraint[] constraints,
TaskVar[] tasks,
IntDomainVar[] vars)
|
Uses of SConstraint in choco.kernel.solver.constraints.global.matching |
---|
Classes in choco.kernel.solver.constraints.global.matching that implement SConstraint | |
---|---|
class |
AbstractBipartiteFlow
A general assignment constraint with constraints on the flow bounds |
class |
AbstractBipartiteGraph
An abstract class encoding assignment graphs (matching each left vertex with one single right vertex) We consider a flow in the graph by adding a source linked to all right vertices and a sink linked to all left vertices It is based on computing the strongly connected components of the residual graph, then remove arcs connecting two different strongly connected components Computing the strongly connected components is done by an algorithm of Aho, Hopcroft, Ullman using depth first search (Cormen, Leiserson, p. 478, p. 489) Note (EGA) on ice traduction from claire to java : class StrongConnectionDecomposition have been included in this one |
class |
AbstractBipartiteMatching
A subclass of AbtractBipartiteGraph restricted only to matchings (and not flows). |
Uses of SConstraint in choco.kernel.solver.constraints.global.scheduling |
---|
Classes in choco.kernel.solver.constraints.global.scheduling that implement SConstraint | |
---|---|
class |
AbstractTaskSConstraint
|
Uses of SConstraint in choco.kernel.solver.constraints.integer |
---|
Classes in choco.kernel.solver.constraints.integer that implement SConstraint | |
---|---|
class |
AbstractBinIntSConstraint
An abstract class for all implementations of (binary) constraints over two search variable. |
class |
AbstractIntSConstraint
An abstract class for all implementations of listeners over search variables. |
class |
AbstractLargeIntSConstraint
An abstract class for all implementations of listeners over many search variables. |
class |
AbstractTernIntSConstraint
An abstract class for all implementations of (unary) listeners over one search variable. |
class |
AbstractUnIntSConstraint
An abstract class for all implementations of (unary) listeners over one search variable. |
Uses of SConstraint in choco.kernel.solver.constraints.integer.extension |
---|
Classes in choco.kernel.solver.constraints.integer.extension that implement SConstraint | |
---|---|
class |
CspBinSConstraint
|
Uses of SConstraint in choco.kernel.solver.constraints.real |
---|
Classes in choco.kernel.solver.constraints.real that implement SConstraint | |
---|---|
class |
AbstractBinRealIntSConstraint
|
class |
AbstractLargeRealSConstraint
A real constraint with an undetermined number of variables. |
class |
AbstractMixedSRealIntSConstraint
An interface for mixed constraint : interger and flot variables. |
class |
AbstractRealSConstraint
User : cprudhom Mail : cprudhom(a)emn.fr Date : 15 f�vr. 2010 Since : Choco 2.1.1 |
class |
AbstractUnRealSConstraint
|
Uses of SConstraint in choco.kernel.solver.constraints.reified |
---|
Methods in choco.kernel.solver.constraints.reified that return SConstraint | |
---|---|
SConstraint |
BoolNode.extractConstraint(Solver s)
Extracts the sub constraint without reifying it ! |
Uses of SConstraint in choco.kernel.solver.constraints.set |
---|
Classes in choco.kernel.solver.constraints.set that implement SConstraint | |
---|---|
class |
AbstractBinSetIntSConstraint
|
class |
AbstractBinSetSConstraint
|
class |
AbstractLargeSetIntSConstraint
A class to represent a large constraint including both set and int variables in its scope. |
class |
AbstractLargeSetSConstraint
|
class |
AbstractMixedSetIntSConstraint
A class for mixed set and int constraint. |
class |
AbstractSetSConstraint
|
class |
AbstractTernSetSConstraint
|
class |
AbstractUnSetSConstraint
|
Uses of SConstraint in choco.kernel.solver.propagation |
---|
Methods in choco.kernel.solver.propagation with parameters of type SConstraint | |
---|---|
void |
PropagationEngine.postAddKer(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of kernel addition event |
void |
PropagationEngine.postEvent(Var v,
int basicEvt,
SConstraint constraint,
boolean forceAwake)
Generic method to post events. |
void |
PropagationEngine.postInstInt(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation event |
void |
PropagationEngine.postInstSet(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation event |
void |
PropagationEngine.postRemEnv(SetVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of envelope removal event |
void |
PropagationEngine.postRemoveVal(IntDomainVar v,
int x,
SConstraint constraint,
boolean forceAwake)
Specific method to post removal event |
void |
PropagationEngine.postUpdateInf(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of lower bound event |
void |
PropagationEngine.postUpdateInf(RealVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of lower bound event |
void |
PropagationEngine.postUpdateSup(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
void |
PropagationEngine.postUpdateSup(RealVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
void |
PropagationEngine.raiseContradiction(int cidx,
Var variable,
SConstraint cause)
Deprecated. |
Uses of SConstraint in choco.kernel.solver.propagation.event |
---|
Fields in choco.kernel.solver.propagation.event declared as SConstraint | |
---|---|
protected SConstraint |
VarEvent.cause
Cause of this basic var. |
Methods in choco.kernel.solver.propagation.event that return SConstraint | |
---|---|
SConstraint |
VarEvent.getCause()
Returns the cause of this basic var. |
Methods in choco.kernel.solver.propagation.event with parameters of type SConstraint | |
---|---|
void |
VarEvent.recordEventTypeAndCause(int basicEvt,
SConstraint constraint,
boolean forceAwake)
|
Uses of SConstraint in choco.kernel.solver.search |
---|
Methods in choco.kernel.solver.search with parameters of type SConstraint | |
---|---|
void |
AbstractGlobalSearchStrategy.initMainGoal(SConstraint c)
|
Uses of SConstraint in choco.kernel.solver.search.checker |
---|
Methods in choco.kernel.solver.search.checker with parameters of type SConstraint | |
---|---|
void |
SolutionCheckerEngine.checkConstraint(SConstraint c)
Check the satisfaction of c . |
void |
ISolutionCheckerEngine.checkConstraint(SConstraint<?> c)
Check the satisfaction of c . |
boolean |
SolutionCheckerEngine.inspectConstraint(SConstraint<?> c)
Inspect the satisfaction of c . |
boolean |
ISolutionCheckerEngine.inspectConstraint(SConstraint<?> c)
Inspect the satisfaction of c . |
protected boolean |
SolutionCheckerEngine.isSatisfied(SConstraint<?> c)
Check if c is satisfied. |
Uses of SConstraint in choco.kernel.solver.variables |
---|
Fields in choco.kernel.solver.variables with type parameters of type SConstraint | |
---|---|
protected APartiallyStoredCstrList<? extends SConstraint> |
AbstractVar.constraints
The list of constraints (listeners) observing the variable. |
Methods in choco.kernel.solver.variables that return SConstraint | |
---|---|
SConstraint |
Var.getConstraint(int i)
Returns the i th constraint. |
SConstraint |
AbstractVar.getConstraint(int i)
Retrieve the constraint i involving the variable. |
Methods in choco.kernel.solver.variables that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
Var.getConstraintsIterator()
This methods should be used if one want to access the different constraints currently posted on this variable. |
DisposableIterator<SConstraint> |
AbstractVar.getConstraintsIterator()
This methods should be used if one want to access the different constraints currently posted on this variable. |
PartiallyStoredVector<? extends SConstraint> |
Var.getConstraintVector()
access the data structure storing constraints involving a given variable |
PartiallyStoredVector<? extends SConstraint> |
AbstractVar.getConstraintVector()
Access the data structure storing constraints involving a given variable. |
Methods in choco.kernel.solver.variables with parameters of type SConstraint | |
---|---|
int |
Var.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new listener for the variable, that is a constraint which should be informed as soon as the variable domain is modified. |
int |
AbstractVar.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new constraints on the stack of constraints the addition can be dynamic (undone upon backtracking) or not. |
void |
AbstractVar.eraseConstraint(SConstraint c)
Removes (permanently) a constraint from the list of constraints connected to the variable. |
Constructor parameters in choco.kernel.solver.variables with type arguments of type SConstraint | |
---|---|
AbstractVar(Solver solver,
String name,
APartiallyStoredCstrList<? extends SConstraint> constraints)
Initializes a new variable. |
Uses of SConstraint in choco.kernel.solver.variables.integer |
---|
Methods in choco.kernel.solver.variables.integer with parameters of type SConstraint | |
---|---|
boolean |
IntDomainVar.instantiate(int x,
SConstraint cause,
boolean forceAwake)
Propagation events instantiating a variable (ie: removing all other values from the domain) |
boolean |
IntDomainVar.removeInterval(int a,
int b,
SConstraint cause,
boolean forceAwake)
Propagation events updating the domain of a variable (by removing an interval, ie, a sequence of consecutive values) |
boolean |
IntDomainVar.removeVal(int x,
SConstraint cause,
boolean forceAwake)
Propagation events updating the domain of a variable (by removing a value) |
boolean |
IntDomainVar.updateInf(int x,
SConstraint cause,
boolean forceAwake)
Propagation events updating the lower bound of a variable (ie: removing all value strictly below the new lower bound from the domain). |
boolean |
IntDomainVar.updateSup(int x,
SConstraint cause,
boolean forceAwake)
Propagation events updating the upper bound of a variable (ie: removing all value strictly above the new upper bound from the domain). |
Uses of SConstraint in choco.kernel.solver.variables.real |
---|
Methods in choco.kernel.solver.variables.real that return SConstraint | |
---|---|
SConstraint |
RealIntervalConstant.getConstraint(int i)
Returns the i th constraint. |
Methods in choco.kernel.solver.variables.real that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
RealIntervalConstant.getConstraintsIterator()
This methods should be used if one want to access the different constraints currently posted on this variable. |
PartiallyStoredVector<SConstraint> |
RealIntervalConstant.getConstraintVector()
access the data structure storing constraints involving a given variable |
Methods in choco.kernel.solver.variables.real with parameters of type SConstraint | |
---|---|
int |
RealIntervalConstant.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new listener for the variable, that is a constraint which should be informed as soon as the variable domain is modified. |
Uses of SConstraint in choco.kernel.solver.variables.scheduling |
---|
Methods in choco.kernel.solver.variables.scheduling that return SConstraint | |
---|---|
SConstraint |
TaskVar.getConstraint(int i)
Retrieve the constraint i involving the variable. |
Methods in choco.kernel.solver.variables.scheduling that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
TaskVar.getConstraintsIterator()
This methods should be used if one want to access the different constraints currently posted on this variable. |
Methods in choco.kernel.solver.variables.scheduling with parameters of type SConstraint | |
---|---|
int |
TaskVar.addConstraint(SConstraint c,
int varIdx,
boolean dynamicAddition)
Adds a new constraints on the stack of constraints the addition can be dynamic (undone upon backtracking) or not. |
void |
TaskVar.eraseConstraint(SConstraint<? extends Var> c)
Removes (permanently) a constraint from the list of constraints connected to the variable. |
void |
TaskVar.updateCompulsoryPart(SConstraint cause)
|
void |
TaskVar.updateHypotheticalDomain(int idx,
SConstraint constraint,
boolean forceAwake)
Call awake on TaskVar. |
Uses of SConstraint in choco.kernel.solver.variables.set |
---|
Methods in choco.kernel.solver.variables.set with parameters of type SConstraint | |
---|---|
boolean |
SetVar.addToKernel(int x,
SConstraint cause,
boolean forceAwake)
Propagation events updating the kernel of a variable (i.e adding a value) |
boolean |
SetDomain.addToKernel(int x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetVar.instantiate(int[] x,
SConstraint cause,
boolean forceAwake)
Propagation events instantiated a set var to a specific set of values |
boolean |
SetDomain.instantiate(int[] x,
SConstraint cause,
boolean forceAwake)
|
boolean |
SetVar.remFromEnveloppe(int x,
SConstraint cause,
boolean forceAwake)
Propagation events updating the enveloppe of a variable (i.e removing a value) |
boolean |
SetDomain.remFromEnveloppe(int x,
SConstraint cause,
boolean forceAwake)
|
Uses of SConstraint in samples.jobshop |
---|
Classes in samples.jobshop that implement SConstraint | |
---|---|
class |
SimpleDTConstraint
|
Methods in samples.jobshop that return SConstraint | |
---|---|
SConstraint |
SimpleDTConstraint.SimpleDTConstraintManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint[] |
SimpleDTConstraint.SimpleDTConstraintManager.makeConstraintAndOpposite(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
Build a constraint and its opposite for the given solver and "model variables" |
Uses of SConstraint in samples.multicostregular.nsp |
---|
Classes in samples.multicostregular.nsp that implement SConstraint | |
---|---|
class |
NSPStruct
Created by IntelliJ IDEA. |
Methods in samples.multicostregular.nsp that return SConstraint | |
---|---|
SConstraint |
NSPStruct.NSPStrucManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in samples.multicostregular.planner |
---|
Classes in samples.multicostregular.planner that implement SConstraint | |
---|---|
class |
SimpleChannelling
Created by IntelliJ IDEA. |
class |
SubSetChannelling
Created by IntelliJ IDEA. |
Methods in samples.multicostregular.planner that return SConstraint | |
---|---|
SConstraint |
SubSetChannelling.SubSetManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
SimpleChannelling.SimpleManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in samples.tutorials.lns.lns |
---|
Methods in samples.tutorials.lns.lns that return SConstraint | |
---|---|
SConstraint |
AbstractLNSSolver.eq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(RealVar r,
IntDomainVar i)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.geq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.getCstr(Constraint ic)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.gt(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.leq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.lt(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(IntExp x,
int c)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(IntExp x,
IntExp y)
Deprecated. |
SConstraint |
AbstractLNSSolver.neq(int c,
IntExp x)
Deprecated. |
SConstraint |
AbstractLNSSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela)
Deprecated. |
SConstraint |
AbstractLNSSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela,
int ac)
Deprecated. |
Methods in samples.tutorials.lns.lns that return types with arguments of type SConstraint | |
---|---|
DisposableIterator<SConstraint> |
AbstractLNSSolver.getConstraintIterator()
Deprecated. |
DisposableIterator<SConstraint> |
AbstractLNSSolver.getIntConstraintIterator()
Deprecated. |
Methods in samples.tutorials.lns.lns with parameters of type SConstraint | |
---|---|
void |
AbstractLNSSolver.eraseConstraint(SConstraint c)
Deprecated. |
void |
AbstractLNSSolver.post(SConstraint c)
Deprecated. |
void |
AbstractLNSSolver.postCut(SConstraint c)
Deprecated. |
Uses of SConstraint in samples.tutorials.to_sort.socialgolfer |
---|
Classes in samples.tutorials.to_sort.socialgolfer that implement SConstraint | |
---|---|
class |
ScalarAtMost
|
Methods in samples.tutorials.to_sort.socialgolfer that return SConstraint | |
---|---|
SConstraint |
ScalarAtMost.ScalarAtMostManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
Uses of SConstraint in samples.tutorials.to_sort.tsp |
---|
Classes in samples.tutorials.to_sort.tsp that implement SConstraint | |
---|---|
class |
MinSpanningTree
|
class |
SubTourConstraint
|
Methods in samples.tutorials.to_sort.tsp that return SConstraint | |
---|---|
SConstraint |
SubTourConstraint.SubTourConstraintManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
SConstraint |
MinSpanningTree.MinSpanningTreeManager.makeConstraint(Solver solver,
IntegerVariable[] variables,
Object parameters,
List<String> options)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |