Modifier and Type | Method and Description |
---|---|
default Constraint |
IIntConstraintFactory.table(IntVar[] vars,
Tuples tuples)
Creates a table constraint specifying that the sequence of variables vars must belong to the list of tuples
(or must NOT belong in case of infeasible tuples)
Default configuration with GACSTR+ algorithm for feasible tuples and GAC3rm otherwise
|
default Constraint |
IIntConstraintFactory.table(IntVar[] vars,
Tuples tuples,
String algo)
Creates a table constraint, with the specified algorithm defined algo
- CT+: Compact-Table algorithm (AC),
- GAC2001: Arc Consistency version 2001 for tuples, - GAC2001+: Arc Consistency version 2001 for allowed tuples, - GAC3rm: Arc Consistency version AC3 rm for tuples, - GAC3rm+ (default): Arc Consistency version 3rm for allowed tuples, - GACSTR+: Arc Consistency version STR for allowed tuples, - STR2+: Arc Consistency version STR2 for allowed tuples, - FC: Forward Checking. |
default Constraint |
IIntConstraintFactory.table(IntVar var1,
IntVar var2,
Tuples tuples)
Create a table constraint over a couple of variables var1 and var2
Uses AC3rm algorithm by default
|
default Constraint |
IIntConstraintFactory.table(IntVar var1,
IntVar var2,
Tuples tuples,
String algo)
Creates a table constraint over a couple of variables var1 and var2:
- AC2001: table constraint which applies the AC2001 algorithm, - AC3: table constraint which applies the AC3 algorithm, - AC3rm: table constraint which applies the AC3 rm algorithm, - AC3bit+rm (default): table constraint which applies the AC3 bit+rm algorithm, - FC: table constraint which applies forward checking algorithm. |
Modifier and Type | Method and Description |
---|---|
static Tuples |
TuplesFactory.absolute(IntVar VAR1,
IntVar VAR2)
Generate valid tuples for absolute constraint: VAR1 = |VAR2|
|
static Tuples |
TuplesFactory.allDifferent(IntVar... VARS)
Generate valid tuples for allDifferent constraint
|
static Tuples |
TuplesFactory.allEquals(IntVar... VARS)
Generate valid tuples for allEquals constraint
|
static Tuples |
TuplesFactory.arithm(IntVar VAR1,
String OP,
IntVar VAR2)
Generate valid tuples for VAR1 OP VAR2, where OP in {"=", "!
|
static Tuples |
TuplesFactory.element(IntVar VALUE,
int[] TABLE,
IntVar INDEX,
int OFFSET)
Generate valid tuples for an element constraint : TABLE[INDEX-OFFSET] = VALUE
|
static Tuples |
TuplesFactory.eucl_div(IntVar DIVIDEND,
IntVar DIVISOR,
IntVar RESULT)
Generate valid tuples for euclidean division constraint: DIVIDEND / DIVISOR = RESULT, rounding towards 0
|
static Tuples |
TuplesFactory.generateTuples(TupleValidator filter,
boolean feasible,
int[]... doms)
A method that generates all tuples from a set of variables and stores (and returns) the valid tuples wrt to the
filter . |
static Tuples |
TuplesFactory.generateTuples(TupleValidator filter,
boolean feasible,
IntVar... vars)
A method that generates all tuples from a set of variables and stores (and returns) the valid tuples wrt to the
filter . |
static Tuples |
TuplesFactory.lex_chain_less_eq(IntVar... VARS)
Generate valid tuples for lexChainLessEq constraint
|
static Tuples |
TuplesFactory.lex_chain_less(IntVar... VARS)
Generate valid tuples for lexChainLess constraint
|
static Tuples |
TuplesFactory.maximum(IntVar VAR1,
IntVar VAR2,
IntVar MAX)
Generate valid tuples for minus constraint: MAX = max(VAR1,VAR2)
|
static Tuples |
TuplesFactory.minimum(IntVar VAR1,
IntVar VAR2,
IntVar MIN)
Generate valid tuples for minimum constraint: MIN = min(VAR1,VAR2)
|
static Tuples |
TuplesFactory.minus(IntVar VAR1,
IntVar VAR2,
IntVar RESULT)
Generate valid tuples for minus constraint: VAR1 - VAR2 = RESULT
|
static Tuples |
TuplesFactory.modulo(IntVar VAR1,
IntVar VAR2,
IntVar MOD)
Generate valid tuples for minimum constraint: VAR1 % VAR2 = MOD
|
static Tuples |
TuplesFactory.plus(IntVar VAR1,
IntVar VAR2,
IntVar RESULT)
Generate valid tuples for plus constraint: VAR1 + VAR2 = RESULT
|
static Tuples |
TuplesFactory.power(IntVar VAR1,
IntVar VAR2,
int POWER)
Generate valid tuples for absolute constraint: VAR1 = VAR2^POWER
|
static Tuples |
TuplesFactory.scalar(IntVar[] VARS,
int[] COEFFS,
IntVar SCALAR,
int SCALAR_COEFF)
Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALAR
|
static Tuples |
TuplesFactory.scalar(IntVar[] VARS,
int[] COEFFS,
String OPERATOR,
IntVar SCALAR,
int SCALAR_COEFF,
int CSTE)
Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALAR + CSTE
with OPERATOR in {"=", "!
|
static Tuples |
TuplesFactory.square(IntVar VAR1,
IntVar VAR2)
Generate valid tuples for absolute constraint: VAR1 = VAR2^2
|
static Tuples |
TuplesFactory.sum(IntVar[] VARS,
String OPERATOR,
IntVar SUM,
int CSTE)
Generate valid tuples for ∑i in |VARS|VARSi OPERATOR SUM + CSTE
with OPERATOR in {"=", "!
|
static Tuples |
TuplesFactory.times(IntVar VAR1,
IntVar VAR2,
IntVar RESULT)
Generate valid tuples for times constraint: VAR1 * VAR2 = RESULT
|
Modifier and Type | Method and Description |
---|---|
abstract Tuples |
BinRelation.convert()
Convert this relation into 'Tuples'
|
Tuples |
PropBinCSP.extractTuples()
Extract the tuples from this internal data structure
|
Constructor and Description |
---|
PropBinAC2001(IntVar x,
IntVar y,
Tuples tuples) |
PropBinAC3(IntVar x,
IntVar y,
Tuples tuples) |
PropBinAC3bitrm(IntVar x,
IntVar y,
Tuples tuples) |
PropBinAC3rm(IntVar x,
IntVar y,
Tuples tuples) |
PropBinFC(IntVar x,
IntVar y,
Tuples tuples) |
Modifier and Type | Field and Description |
---|---|
protected Tuples |
PropCompactTable.tuples |
Modifier and Type | Method and Description |
---|---|
abstract Tuples |
LargeRelation.convert()
Convert this relation into 'Tuples'
|
Tuples |
TuplesLargeTable.convert() |
Tuples |
TuplesList.convert() |
Tuples |
TuplesVeryLargeTable.convert() |
Tuples |
TuplesTable.convert() |
Tuples |
PropLargeCSP.extractTuples()
Extract the tuples from this internal data structure
|
Modifier and Type | Method and Description |
---|---|
protected void |
PropCompactTable.computeSupports(Tuples tuples) |
protected void |
PropCompactTableStar.computeSupports(Tuples tuples) |
Constructor and Description |
---|
PropCompactTable(IntVar[] vars,
Tuples tuples)
Create a propagator for table constraint
Only for feasible Tuples
|
PropCompactTableStar(IntVar[] vars,
Tuples tuples)
Create a propagator for table constraint
Only for feasible Tuples
|
PropLargeFC(IntVar[] vars,
Tuples tuples) |
PropLargeGAC2001(IntVar[] vs,
Tuples tuples) |
PropLargeGAC2001Positive(IntVar[] vs,
Tuples tuples) |
PropLargeGAC3rm(IntVar[] vs,
Tuples tuples) |
PropLargeGAC3rmPositive(IntVar[] vars,
Tuples tuples) |
PropLargeGACSTRPos(IntVar[] vs,
Tuples tuples) |
PropTableStr2(IntVar[] vars_,
Tuples tuplesObject) |
TuplesLargeTable(Tuples tuples,
IntVar[] vars) |
TuplesList(Tuples tuples,
IntVar[] vars) |
TuplesTable(Tuples tuples,
IntVar[] vars) |
TuplesVeryLargeTable(Tuples tuples,
IntVar[] vars) |
Modifier and Type | Method and Description |
---|---|
boolean |
MultivaluedDecisionDiagram.addTuples(Tuples TUPLES)
Add all tuples within the MDD
|
Constructor and Description |
---|
MultivaluedDecisionDiagram(int[][] FLATDOM,
Tuples TUPLES)
Create an MDD based on an array of flatten domains and a set of tuples
|
MultivaluedDecisionDiagram(int[][] FLATDOM,
Tuples TUPLES,
boolean compactOnce,
boolean sortTuple)
Create an MDD based on an array of flatten domains and a set of tuples
|
MultivaluedDecisionDiagram(IntVar[] VARIABLES,
Tuples TUPLES)
Create an MDD based on an array of flatten domains and a set of tuples
|
MultivaluedDecisionDiagram(IntVar[] VARIABLES,
Tuples TUPLES,
boolean compactOnce,
boolean sortTuple)
Create an MDD based on an array of flatten domains and a set of tuples
|
Copyright © 2018. All rights reserved.