|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Uses of IntDomainVar in choco.cp.common.util.preprocessor.detector.scheduling |
---|
Methods in choco.cp.common.util.preprocessor.detector.scheduling that return IntDomainVar | |
---|---|
IntDomainVar[] |
DisjunctiveSModel.getDisjuncts()
|
Uses of IntDomainVar in choco.cp.model |
---|
Methods in choco.cp.model with parameters of type IntDomainVar | |
---|---|
int |
CPModel.getIntVarIndex(IntDomainVar c)
Deprecated. |
Uses of IntDomainVar in choco.cp.model.managers.constraints.global |
---|
Methods in choco.cp.model.managers.constraints.global that return IntDomainVar | |
---|---|
protected IntDomainVar |
AbstractResourceManager.getHorizon(CPSolver s,
Variable[] variables,
ResourceParameters p)
|
Methods in choco.cp.model.managers.constraints.global with parameters of type IntDomainVar | |
---|---|
SConstraint |
AllDifferentManager.defaultDetection(IntDomainVar[] vars,
IEnvironment environment)
make a choice if the user didn't specify the type of consistency desired |
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)
|
Uses of IntDomainVar in choco.cp.model.managers.constraints.integer |
---|
Methods in choco.cp.model.managers.constraints.integer with parameters of type IntDomainVar | |
---|---|
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)
|
Uses of IntDomainVar in choco.cp.model.managers.variables |
---|
Methods in choco.cp.model.managers.variables that return IntDomainVar | |
---|---|
protected static IntDomainVar |
IntegerVariableManager.makeConstant(CPSolver solver,
IntegerVariable iv)
|
Uses of IntDomainVar in choco.cp.solver |
---|
Methods in choco.cp.solver that return IntDomainVar | |
---|---|
IntDomainVar |
CPSolver.createBinTreeIntVar(String name,
int[] sortedValues)
|
IntDomainVar |
CPSolver.createBinTreeIntVar(String name,
int min,
int max)
|
IntDomainVar |
CPSolver.createBooleanVar(String name)
|
IntDomainVar |
CPSolver.createBoundIntVar(String name,
int min,
int max)
|
IntDomainVar |
CPSolver.createEnumIntVar(String name,
int[] sortedValues)
|
IntDomainVar |
CPSolver.createEnumIntVar(String name,
int min,
int max)
|
IntDomainVar |
CPSolver.createIntegerConstant(String name,
int val)
|
IntDomainVar |
CPSolver.createIntVar(String name,
int domainType,
int min,
int max)
|
IntDomainVar |
CPSolver.createIntVarAddCste(String name,
IntDomainVar variable,
int constant)
|
IntDomainVar |
CPSolver.createIntVarTimeCste(String name,
IntDomainVar variable,
int constant)
|
IntDomainVar |
CPSolver.createListIntVar(String name,
int[] sortedValues)
|
IntDomainVar |
CPSolver.createListIntVar(String name,
int min,
int max)
|
IntDomainVar |
CPSolver.createMakespan()
|
IntDomainVar |
CPSolver.createNotBooleanVar(String name,
IntDomainVar variable)
|
IntDomainVar[] |
CPSolver.getBooleanVariables()
|
IntDomainVar[] |
CPSolver.getIntDecisionVars()
get the list of decision integer variables. |
IntDomainVar |
CPSolver.getIntVar(int i)
Network management: Retrieve a variable by its index (all integer variables of the model are numbered in sequence from 0 on) |
IntDomainVar |
CPSolver.getIntVarQuick(int i)
|
IntDomainVar |
CPSolver.getMakespan()
|
IntDomainVar[] |
CPSolver.getVar(IntegerVariable... v)
|
IntDomainVar |
CPSolver.getVar(IntegerVariable v)
|
protected IntDomainVar[][] |
CPModelToCPSolver.integerVariableToIntDomainVar(Variable[][] tab)
|
IntDomainVar |
CPSolver.makeConstantIntVar(int val)
|
IntDomainVar |
CPSolver.makeConstantIntVar(String name,
int val)
|
Methods in choco.cp.solver that return types with arguments of type IntDomainVar | |
---|---|
DisposableIterator<IntDomainVar> |
CPSolver.getIntVarIterator()
|
Methods in choco.cp.solver with parameters of type IntDomainVar | |
---|---|
void |
CPSolver.addIntConstant(int value,
IntDomainVar i)
|
void |
CPSolver.addIntVar(IntDomainVar v)
Add a integer variable to the integer variables list |
void |
CPSolver.addNogood(IntDomainVar[] poslit,
IntDomainVar[] neglit)
Add a nogood to the solver. |
void |
CPSolver.addNogood(IntDomainVar[] poslit,
IntDomainVar[] neglit)
Add a nogood to the solver. |
protected static SConstraint |
CPSolver.createFCLargeConstraint(IntDomainVar[] vars,
LargeRelation relation)
|
IntDomainVar |
CPSolver.createIntVarAddCste(String name,
IntDomainVar variable,
int constant)
|
IntDomainVar |
CPSolver.createIntVarTimeCste(String name,
IntDomainVar variable,
int constant)
|
IntDomainVar |
CPSolver.createNotBooleanVar(String name,
IntDomainVar variable)
|
SetVar |
CPSolver.createSetVar(String name,
int a,
int b,
IntDomainVar card)
|
TaskVar |
CPSolver.createTaskVar(String name,
IntDomainVar start,
IntDomainVar end,
IntDomainVar duration)
|
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(RealVar r,
IntDomainVar 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 |
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.geqCard(SetVar sv,
IntDomainVar v)
|
int |
CPSolver.getIntVarIndex(IntDomainVar c)
|
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.leqCard(SetVar sv,
IntDomainVar i)
|
static BinRelation |
CPSolver.makeBinRelation(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
boolean feas)
|
static BinRelation |
CPSolver.makeBinRelation(IntDomainVar v1,
IntDomainVar v2,
boolean[][] mat,
boolean feas,
boolean bitset)
Create a binary relation from the given matrix of consistency |
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)
|
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.occurence(IntDomainVar[] vars,
IntDomainVar occ,
int value)
|
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.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 |
IntExp |
CPSolver.scalar(int[] lc,
IntDomainVar[] lv)
Building a term from a scalar product of coefficients and variables |
IntExp |
CPSolver.scalar(IntDomainVar[] lv,
int[] lc)
Building a term from a scalar product of coefficients and variables |
Method parameters in choco.cp.solver with type arguments of type IntDomainVar | |
---|---|
void |
CPSolver.setValIntIterator(ValIterator<IntDomainVar> valIterator)
Sets the integer value iterator the search should use |
void |
CPSolver.setValIntSelector(ValSelector<IntDomainVar> valSelector)
Sets the integer value selector the search should use |
void |
CPSolver.setVarIntSelector(VarSelector<IntDomainVar> varSelector)
Sets a unique integer variable selector the search olver should use. |
Uses of IntDomainVar in choco.cp.solver.constraints.global |
---|
Fields in choco.cp.solver.constraints.global declared as IntDomainVar | |
---|---|
IntDomainVar[] |
Occurrence.relevantVar
|
IntDomainVar[][] |
LexChain.x
array of vectors in the lex chain constraint |
IntDomainVar[] |
Lex.x
|
IntDomainVar[] |
Lex.y
|
Methods in choco.cp.solver.constraints.global that return IntDomainVar | |
---|---|
static IntDomainVar[] |
IncreasingNValue.concat(IntDomainVar occ,
IntDomainVar[] vars)
|
static IntDomainVar[] |
BoundGccVar.makeVarTable(IntDomainVar[] vars,
IntDomainVar[] card)
|
Methods in choco.cp.solver.constraints.global with parameters of type IntDomainVar | |
---|---|
void |
OrderedSparseArray.allocate(IntDomainVar[] vars,
int def)
|
void |
LexChain.boundsLex(int[] a,
IntDomainVar[] x,
int[] b,
int j)
Filtering algorithm for between(a,x,b) Ensures that x is lexicographically greater than a and less than b if strict is false otherwise x is lexicographically greater than or equal to a and less than or equal to b |
int |
LexChain.computeAlpha(IntDomainVar[] x,
int[] b)
computes alpha for use in computing lexicographically largest feasible upper bound of x in computUB |
int |
LexChain.computeBeta(IntDomainVar[] x,
int[] a)
computes beta for use in computing lexicographically smallest feasible lower bound of x in computeLB |
void |
LexChain.computeLB(IntDomainVar[] x,
int[] a,
int[] lower)
Computes the lexicographically smallest feasible lower bound vector of integers of x . |
void |
LexChain.computeUB(IntDomainVar[] x,
int[] b,
int[] u)
Computes the lexicographically largest feasible upper bound vector of integers of x . |
static IntDomainVar[] |
IncreasingNValue.concat(IntDomainVar occ,
IntDomainVar[] vars)
|
static IntDomainVar[] |
IncreasingNValue.concat(IntDomainVar occ,
IntDomainVar[] vars)
|
static int |
IncreasingNValue.getNext(IntDomainVar v,
int val)
|
static int |
IncreasingNValue.getPrev(IntDomainVar v,
int val)
|
boolean |
Lex.greater(IntDomainVar x1,
IntDomainVar y1)
|
boolean |
Lex.groundEq(IntDomainVar x1,
IntDomainVar y1)
|
boolean |
Lex.leq(IntDomainVar x1,
IntDomainVar y1)
|
boolean |
Lex.less(IntDomainVar x1,
IntDomainVar y1)
|
static IntDomainVar[] |
BoundGccVar.makeVarTable(IntDomainVar[] vars,
IntDomainVar[] card)
|
static IntDomainVar[] |
BoundGccVar.makeVarTable(IntDomainVar[] vars,
IntDomainVar[] card)
|
Constructors in choco.cp.solver.constraints.global with parameters of type IntDomainVar | |
---|---|
AmongGAC(IntDomainVar[] vars,
int[] values,
IEnvironment environment)
Constructs a constraint with the specified priority. |
|
AtMostNValue(IntDomainVar[] vars,
IntDomainVar nvalue)
|
|
AtMostNValue(IntDomainVar[] vars,
IntDomainVar nvalue)
|
|
BoundAllDiff(IntDomainVar[] vars,
boolean global)
|
|
BoundGcc(IntDomainVar[] vars,
int firstDomainValue,
int lastDomainValue,
int[] minOccurrences,
int[] maxOccurrences,
IEnvironment environment)
Bound Global cardinality : Given an array of variables vars, min the minimal value over all variables, and max the maximal value over all variables, the constraint ensures that the number of occurences of the value i among the variables is between low[i - min] and up[i - min]. |
|
BoundGccVar(IntDomainVar[] vars,
IntDomainVar[] card,
int firstCardValue,
int lastCardValue,
IEnvironment environment)
Bound Global cardinality : Given an array of variables vars, min the minimal value over all variables, and max the maximal value over all variables (or a table IntDomainVar to represent the cardinalities), the constraint ensures that the number of occurences of the value i among the variables is between low[i - min] and up[i - min]. |
|
BoundGccVar(IntDomainVar[] vars,
IntDomainVar[] card,
int firstCardValue,
int lastCardValue,
IEnvironment environment)
Bound Global cardinality : Given an array of variables vars, min the minimal value over all variables, and max the maximal value over all variables (or a table IntDomainVar to represent the cardinalities), the constraint ensures that the number of occurences of the value i among the variables is between low[i - min] and up[i - min]. |
|
Exactly(IntDomainVar[] vars,
int N,
int value)
Constructs a constraint with the specified priority. |
|
Geost_Constraint(IntDomainVar[] vars,
int k,
List<Obj> objects,
List<ShiftedBox> shiftedBoxes,
List<ExternalConstraint> ectr,
boolean memo,
HashMap<com.sun.tools.javac.util.Pair<Integer,Integer>,Boolean> included,
Solver solver)
Creates a geost constraint with the given parameters. |
|
Geost_Constraint(IntDomainVar[] vars,
int k,
List<Obj> objects,
List<ShiftedBox> shiftedBoxes,
List<ExternalConstraint> ectr,
List<int[]> ctrlVs,
boolean memo_active,
HashMap<com.sun.tools.javac.util.Pair<Integer,Integer>,Boolean> included,
boolean increment_,
Solver solver)
Creates a geost constraint with the given parameters. |
|
IncreasingNValue(IntDomainVar occ,
IntDomainVar[] x,
IncreasingNValue.Mode m)
|
|
IncreasingNValue(IntDomainVar occ,
IntDomainVar[] x,
IncreasingNValue.Mode m)
|
|
Lex(IntDomainVar[] vars,
int n,
boolean strict,
IEnvironment environment)
|
|
LexChain(IntDomainVar[] vars,
int n,
boolean strict)
Constructor for the lex_chain constraint |
|
LeximinSConstraint(IntDomainVar[] x,
IEnvironment environment)
Creates a new LeximinConstraint instance. |
|
Occurrence(IntDomainVar[] vars,
int occval,
boolean onInf,
boolean onSup,
IEnvironment environment)
Constructor, API: should be used through the Model.createOccurrence API Define an occurence constraint setting size{forall v in lvars | v = occval} <= or >= or = occVar assumes the occVar variable to be the last of the variables of the constraint: vars = [lvars | occVar] with lvars = list of variables for which the occurence of occval in their domain is constrained |
|
SemiLeximinSConstraint(int[] x,
IntDomainVar[] y,
IEnvironment environment)
Creates a new LeximinConstraint instance. |
|
SortingSConstraint(IntDomainVar[] x,
IntDomainVar[] y)
Creates a new SortingConstraint instance. |
|
SortingSConstraint(IntDomainVar[] x,
IntDomainVar[] y)
Creates a new SortingConstraint instance. |
Uses of IntDomainVar in choco.cp.solver.constraints.global.automata.fast_costregular |
---|
Methods in choco.cp.solver.constraints.global.automata.fast_costregular with parameters of type IntDomainVar | |
---|---|
int |
CostRegularValSelector.getBestVal(IntDomainVar x)
|
Constructors in choco.cp.solver.constraints.global.automata.fast_costregular with parameters of type IntDomainVar | |
---|---|
CostKnapSack(IntDomainVar[] vars,
IntDomainVar bVar,
IntDomainVar cVar,
int[] cost,
int[] gain,
Solver solver)
|
|
CostKnapSack(IntDomainVar[] vars,
IntDomainVar bVar,
IntDomainVar cVar,
int[] cost,
int[] gain,
Solver solver)
|
|
CostRegular(IntDomainVar[] vars,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
Node source,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
IAutomaton pi,
int[][][] costs,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
IAutomaton pi,
int[][] costs,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
ICostAutomaton pi,
Solver s)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.automata.fast_multicostregular |
---|
Fields in choco.cp.solver.constraints.global.automata.fast_multicostregular declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
MultiCostRegular.vs
Decision variables |
IntDomainVar[] |
MultiCostRegular.z
Cost variables |
Fields in choco.cp.solver.constraints.global.automata.fast_multicostregular with type parameters of type IntDomainVar | |
---|---|
gnu.trove.TObjectIntHashMap<IntDomainVar> |
SoftMultiCostRegular.map
Map to retrieve rapidly the index of a given variable. |
gnu.trove.TObjectIntHashMap<IntDomainVar> |
MultiCostRegular.map
Map to retrieve rapidly the index of a given variable. |
Constructors in choco.cp.solver.constraints.global.automata.fast_multicostregular with parameters of type IntDomainVar | |
---|---|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
IAutomaton auto,
int[][][][] costs,
Solver solver)
Constructs a multi-cost-regular constraint propagator |
|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
IAutomaton auto,
int[][][][] costs,
Solver solver)
Constructs a multi-cost-regular constraint propagator |
|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
IAutomaton auto,
int[][][] costs,
Solver solver)
Constructs a multi-cost-regular constraint propagator |
|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
IAutomaton auto,
int[][][] costs,
Solver solver)
Constructs a multi-cost-regular constraint propagator |
|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
ICostAutomaton pi,
Solver solver)
|
|
MultiCostRegular(IntDomainVar[] vars,
IntDomainVar[] CR,
ICostAutomaton pi,
Solver solver)
|
|
SoftMultiCostRegular(IntDomainVar[] x,
IntDomainVar[] y,
IntDomainVar[] z,
IntDomainVar Z,
int[] indexes,
IPenaltyFunction[] f,
IAutomaton pi,
int[][][][] costs,
CPSolver solver)
|
|
SoftMultiCostRegular(IntDomainVar[] x,
IntDomainVar[] y,
IntDomainVar[] z,
IntDomainVar Z,
int[] indexes,
IPenaltyFunction[] f,
IAutomaton pi,
int[][][][] costs,
CPSolver solver)
|
|
SoftMultiCostRegular(IntDomainVar[] x,
IntDomainVar[] y,
IntDomainVar[] z,
IntDomainVar Z,
int[] indexes,
IPenaltyFunction[] f,
IAutomaton pi,
int[][][][] costs,
CPSolver solver)
|
|
SoftMultiCostRegular(IntDomainVar[] x,
IntDomainVar[] y,
IntDomainVar[] z,
IntDomainVar Z,
int[] indexes,
IPenaltyFunction[] f,
IAutomaton pi,
int[][][][] costs,
CPSolver solver)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.automata.fast_multicostregular.example |
---|
Methods in choco.cp.solver.constraints.global.automata.fast_multicostregular.example that return IntDomainVar | |
---|---|
IntDomainVar |
CoverVarValSelector.selectVar()
|
Methods in choco.cp.solver.constraints.global.automata.fast_multicostregular.example with parameters of type IntDomainVar | |
---|---|
int |
CoverVarValSelector.getBestVal(IntDomainVar x)
|
Constructors in choco.cp.solver.constraints.global.automata.fast_multicostregular.example with parameters of type IntDomainVar | |
---|---|
CoverVarValSelector(IntDomainVar[][] vars,
int[][] lowb,
Solver solver)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.automata.fast_multicostregular.valselector |
---|
Methods in choco.cp.solver.constraints.global.automata.fast_multicostregular.valselector with parameters of type IntDomainVar | |
---|---|
int |
MCRValSelector.getBestVal(IntDomainVar x)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.automata.fast_regular |
---|
Constructors in choco.cp.solver.constraints.global.automata.fast_regular with parameters of type IntDomainVar | |
---|---|
FastRegular(IEnvironment environment,
IntDomainVar[] vars,
IAutomaton auto)
Construct a new explained regular constraint |
Uses of IntDomainVar in choco.cp.solver.constraints.global.geost.externalConstraints |
---|
Fields in choco.cp.solver.constraints.global.geost.externalConstraints declared as IntDomainVar | |
---|---|
IntDomainVar |
DistLeq.DVar
|
IntDomainVar |
DistGeq.DVar
|
Methods in choco.cp.solver.constraints.global.geost.externalConstraints that return IntDomainVar | |
---|---|
IntDomainVar |
DistLeq.getDistanceVar()
|
IntDomainVar |
DistGeq.getDistanceVar()
|
Constructors in choco.cp.solver.constraints.global.geost.externalConstraints with parameters of type IntDomainVar | |
---|---|
DistGeq(int ectrID,
int[] dimensions,
int[] objectIdentifiers,
int D_,
int q_,
IntDomainVar var)
|
|
DistLeq(int ectrID,
int[] dimensions,
int[] objectIdentifiers,
int D_,
int q_,
IntDomainVar var)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.geost.geometricPrim |
---|
Methods in choco.cp.solver.constraints.global.geost.geometricPrim that return IntDomainVar | |
---|---|
IntDomainVar |
Obj.getCoord(int index)
Gets the index coordinate domain variable of the object origin |
IntDomainVar[] |
Obj.getCoordinates()
Gets all the coordinate domain variables of the object origin |
IntDomainVar |
Obj.getDuration()
|
IntDomainVar |
Obj.getEnd()
|
IntDomainVar |
Obj.getShapeId()
Gets the Shape id domain variable |
IntDomainVar |
Obj.getStart()
|
Methods in choco.cp.solver.constraints.global.geost.geometricPrim with parameters of type IntDomainVar | |
---|---|
void |
Obj.setCoord(int index,
IntDomainVar value)
Sets a coordinate domain variables of the object origin at the given dimension given by the parameter index, to another domain variable given by the parameter value. |
void |
Obj.setCoordinates(IntDomainVar[] coordinates)
Sets all the coordinate domain variables of the object origin to the ones given as parameter |
void |
Obj.setDuration(IntDomainVar duration)
|
void |
Obj.setEnd(IntDomainVar end)
|
void |
Obj.setShapeId(IntDomainVar shapeId)
Sets the Shape id domain variable |
void |
Obj.setStart(IntDomainVar start)
|
Constructors in choco.cp.solver.constraints.global.geost.geometricPrim with parameters of type IntDomainVar | |
---|---|
Obj(int dim,
int objectId,
IntDomainVar shapeId,
IntDomainVar[] coordinates,
IntDomainVar startTime,
IntDomainVar durationTime,
IntDomainVar endTime)
Creates an object with the given parameters |
|
Obj(int dim,
int objectId,
IntDomainVar shapeId,
IntDomainVar[] coordinates,
IntDomainVar startTime,
IntDomainVar durationTime,
IntDomainVar endTime)
Creates an object with the given parameters |
|
Obj(int dim,
int objectId,
IntDomainVar shapeId,
IntDomainVar[] coordinates,
IntDomainVar startTime,
IntDomainVar durationTime,
IntDomainVar endTime,
int radius)
|
|
Obj(int dim,
int objectId,
IntDomainVar shapeId,
IntDomainVar[] coordinates,
IntDomainVar startTime,
IntDomainVar durationTime,
IntDomainVar endTime,
int radius)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.geost.internalConstraints |
---|
Fields in choco.cp.solver.constraints.global.geost.internalConstraints declared as IntDomainVar | |
---|---|
IntDomainVar |
DistLeqIC.DVar
|
Methods in choco.cp.solver.constraints.global.geost.internalConstraints that return IntDomainVar | |
---|---|
IntDomainVar |
DistLeqIC.getDistanceVar()
|
IntDomainVar |
DistGeqIC.getDistanceVar()
|
Constructors in choco.cp.solver.constraints.global.geost.internalConstraints with parameters of type IntDomainVar | |
---|---|
DistGeqIC(Setup stp_,
int q_,
int D_,
int s1_,
int s2_,
int o1_,
int o2_,
IntDomainVar DVar_)
|
|
DistLeqIC(Setup stp_,
int q_,
int D_,
int s1_,
int s2_,
int o1_,
int o2_,
IntDomainVar DVar_)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.geost.layers |
---|
Methods in choco.cp.solver.constraints.global.geost.layers with parameters of type IntDomainVar | |
---|---|
void |
GeostNumeric.synchronize(IntDomainVar v)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.lightcostregular.structure |
---|
Constructors in choco.cp.solver.constraints.global.lightcostregular.structure with parameters of type IntDomainVar | |
---|---|
LayeredGraph(IntDomainVar[] vars,
IntDomainVar z,
IAutomaton pi,
double[][][] costs,
IEnvironment environment)
|
|
LayeredGraph(IntDomainVar[] vars,
IntDomainVar z,
IAutomaton pi,
double[][][] costs,
IEnvironment environment)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.matching |
---|
Constructors in choco.cp.solver.constraints.global.matching with parameters of type IntDomainVar | |
---|---|
AllDifferent(IntDomainVar[] vars,
IEnvironment environment)
API entry point: creating an ice alldifferent constraint (before posting it) |
|
AllDifferent(IntDomainVar[] vars,
int minValue,
int maxValue,
IEnvironment environment)
AllDiff constraint constructor |
|
GlobalCardinality(IntDomainVar[] vars,
int[] low,
int[] up,
IEnvironment environment)
Constructor, Global cardinality constraint API, short cut when smallest value equals 0 note : maxVal - minVal + 1 = low.length = up.length |
|
GlobalCardinality(IntDomainVar[] vars,
int minValue,
int maxValue,
int[] low,
int[] up,
IEnvironment environment)
Constructor, Global cardinality constraint API note : maxVal - minVal + 1 = valueMinOccurence.length = valueMaxOccurence.length |
|
GlobalCardinalityVar(IntDomainVar[] values,
IntDomainVar[] occurences,
IEnvironment environment)
|
|
GlobalCardinalityVar(IntDomainVar[] values,
IntDomainVar[] occurences,
IEnvironment environment)
|
|
GlobalCardinalityVar(IntDomainVar[] values,
int minValue,
int maxValue,
IntDomainVar[] occurences,
IEnvironment environment)
|
|
GlobalCardinalityVar(IntDomainVar[] values,
int minValue,
int maxValue,
IntDomainVar[] occurences,
IEnvironment environment)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.ordered |
---|
Methods in choco.cp.solver.constraints.global.ordered with parameters of type IntDomainVar | |
---|---|
protected static int[] |
OrderedGcc.minCovering(IntDomainVar[] vars)
|
protected static int |
OrderedGcc.occMin(IntDomainVar[] vars,
int minValue)
|
Constructors in choco.cp.solver.constraints.global.ordered with parameters of type IntDomainVar | |
---|---|
OrderedGcc(IntDomainVar[] vars,
int[] Imax,
int minBot)
|
|
OrderedGcc(IntDomainVar[] vars,
int minValue,
int maxValue,
int[] Imax,
int minBot)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.pack |
---|
Fields in choco.cp.solver.constraints.global.pack declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
PackSConstraint.bins
The bin of each item. |
protected IntDomainVar[] |
PackSConstraint.loads
The loads of the bins. |
protected IntDomainVar[] |
PackFiltering.loads
The loads of the bins. |
Methods in choco.cp.solver.constraints.global.pack that return IntDomainVar | |
---|---|
IntDomainVar[] |
PackSConstraint.getBins()
|
IntDomainVar[] |
IPackSConstraint.getBins()
|
IntDomainVar[] |
PackSConstraint.getLoads()
|
IntDomainVar[] |
IPackSConstraint.getLoads()
|
Constructors in choco.cp.solver.constraints.global.pack with parameters of type IntDomainVar | |
---|---|
PackSConstraint(IEnvironment environment,
SetVar[] itemSets,
IntDomainVar[] loads,
IntDomainVar[] sizes,
IntDomainVar[] bins,
IntDomainVar nbNonEmpty)
|
|
PackSConstraint(IEnvironment environment,
SetVar[] itemSets,
IntDomainVar[] loads,
IntDomainVar[] sizes,
IntDomainVar[] bins,
IntDomainVar nbNonEmpty)
|
|
PackSConstraint(IEnvironment environment,
SetVar[] itemSets,
IntDomainVar[] loads,
IntDomainVar[] sizes,
IntDomainVar[] bins,
IntDomainVar nbNonEmpty)
|
|
PackSConstraint(IEnvironment environment,
SetVar[] itemSets,
IntDomainVar[] loads,
IntDomainVar[] sizes,
IntDomainVar[] bins,
IntDomainVar nbNonEmpty)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.regular |
---|
Constructors in choco.cp.solver.constraints.global.regular with parameters of type IntDomainVar | |
---|---|
Regular(DFA auto,
IntDomainVar[] vs,
IEnvironment environment)
Enforce the sequence of variable vs to be a word recognized by DFA auto |
|
Regular(DFA auto,
IntDomainVar[] vs,
int[] lbs,
int[] dsize,
IEnvironment environment)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.scheduling |
---|
Fields in choco.cp.solver.constraints.global.scheduling declared as IntDomainVar | |
---|---|
IntDomainVar |
RTask.height
|
IntDomainVar |
RTask.usage
|
Methods in choco.cp.solver.constraints.global.scheduling that return IntDomainVar | |
---|---|
IntDomainVar |
RTask.getHeight()
|
IntDomainVar |
RTask.getUsage()
|
Methods in choco.cp.solver.constraints.global.scheduling that return types with arguments of type IntDomainVar | |
---|---|
AbstractSConstraint<IntDomainVar> |
UseResourcesGeq.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
UseResourcesEq.opposite(Solver solver)
|
Constructors in choco.cp.solver.constraints.global.scheduling with parameters of type IntDomainVar | |
---|---|
AbstractResourceSConstraint(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
boolean enableHeights,
boolean enableHypotheticalDomain,
IntDomainVar... intvars)
Create a ressource constraint. |
|
AbstractResourceSConstraint(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar makespan)
|
|
AbstractUseResourcesSConstraint(IEnvironment environment,
TaskVar taskvar,
int k,
IntDomainVar[] usages,
IRTask[] rtasks)
|
|
UseResourcesEq(IEnvironment environment,
TaskVar taskvar,
int k,
IntDomainVar[] usages,
IRTask[] rtasks)
|
|
UseResourcesGeq(IEnvironment environment,
TaskVar taskvar,
int k,
IntDomainVar[] usages,
IRTask[] rtasks)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.scheduling.cumulative |
---|
Methods in choco.cp.solver.constraints.global.scheduling.cumulative that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractCumulativeSConstraint.getCapacity()
|
IntDomainVar |
AbstractCumulativeSConstraint.getConsumption()
|
IntDomainVar |
AbstractCumulativeSConstraint.getHeight(int idx)
|
Constructors in choco.cp.solver.constraints.global.scheduling.cumulative with parameters of type IntDomainVar | |
---|---|
AbstractCumulativeSConstraint(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound,
IntDomainVar... otherVars)
|
|
AbstractCumulativeSConstraint(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound,
IntDomainVar... otherVars)
|
|
AltCumulative(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] heights,
IntDomainVar[] usages,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound)
|
|
AltCumulative(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] heights,
IntDomainVar[] usages,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound)
|
|
AltCumulative(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] heights,
IntDomainVar[] usages,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound)
|
|
Cumulative(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] heights,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound)
|
|
Cumulative(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] heights,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound)
|
|
Cumulative(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound,
IntDomainVar... otherVars)
|
|
Cumulative(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
IntDomainVar consumption,
IntDomainVar capacity,
IntDomainVar uppBound,
IntDomainVar... otherVars)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.scheduling.disjunctive |
---|
Constructors in choco.cp.solver.constraints.global.scheduling.disjunctive with parameters of type IntDomainVar | |
---|---|
AltDisjunctive(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] usages,
IntDomainVar makespan)
|
|
AltDisjunctive(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar[] usages,
IntDomainVar makespan)
|
|
Disjunctive(Solver solver,
String name,
TaskVar[] taskvars,
int nbOptionalTasks,
boolean enableHypotheticalDomain,
IntDomainVar[] intvars)
|
|
Disjunctive(String name,
TaskVar[] taskvars,
IntDomainVar makespan,
Solver solver)
|
|
ForbiddenIntervals(Solver solver,
String name,
TaskVar[] taskvars,
IntDomainVar upperBound)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.scheduling.precedence |
---|
Methods in choco.cp.solver.constraints.global.scheduling.precedence that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractPrecedenceSConstraint.getDirection()
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.softscheduling |
---|
Methods in choco.cp.solver.constraints.global.softscheduling that return IntDomainVar | |
---|---|
protected static IntDomainVar[] |
SoftCumulative.createEndVarArray(IntDomainVar[] starts,
int[] durations,
Solver solver)
|
protected static IntDomainVar[] |
SoftCumulative.createIntVarArray(String name,
int[] source,
Solver pb)
|
protected IntDomainVar |
SoftCumulative.getCostVar(int t)
|
IntDomainVar |
AbstractSoftCumulative.getDuration(int i)
|
IntDomainVar |
AbstractSoftCumulative.getEnd(int i)
|
IntDomainVar |
AbstractSoftCumulative.getHeight(int i)
|
protected IntDomainVar |
SoftCumulativeSum.getObj()
|
IntDomainVar |
AbstractSoftCumulative.getStart(int i)
|
Methods in choco.cp.solver.constraints.global.softscheduling with parameters of type IntDomainVar | |
---|---|
protected static int |
SoftCumulative.computeCapa(IntDomainVar[] costVars,
int wishCapa)
|
protected void |
SoftCumulative.consistentData(IntDomainVar[] ends)
|
protected static IntDomainVar[] |
SoftCumulative.createEndVarArray(IntDomainVar[] starts,
int[] durations,
Solver solver)
|
protected void |
SoftCumulativeSum.initialize(IntDomainVar[] costVars,
IntDomainVar obj,
Solver solver)
|
protected void |
SoftCumulativeSum.initialize(IntDomainVar[] costVars,
IntDomainVar obj,
Solver solver)
|
protected void |
SoftCumulativeSum.recomputeVars(IntDomainVar obj)
|
protected void |
SoftCumulative.recomputeVars(IntDomainVar[] costVars)
|
Constructors in choco.cp.solver.constraints.global.softscheduling with parameters of type IntDomainVar | |
---|---|
AbstractSoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] duration,
IntDomainVar[] heights,
int Capa)
|
|
AbstractSoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] duration,
IntDomainVar[] heights,
int Capa)
|
|
AbstractSoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] duration,
IntDomainVar[] heights,
int Capa)
|
|
AbstractSoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] duration,
IntDomainVar[] heights,
int Capa)
|
|
SoftCumulative(IntDomainVar[] starts,
int[] durations,
int[] heights,
IntDomainVar[] costVars,
int wishCapa,
Solver solver)
|
|
SoftCumulative(IntDomainVar[] starts,
int[] durations,
int[] heights,
IntDomainVar[] costVars,
int wishCapa,
Solver solver)
|
|
SoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
int wishCapa,
int capa)
|
|
SoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
int wishCapa,
int capa)
|
|
SoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
int wishCapa,
int capa)
|
|
SoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
int wishCapa,
int capa)
|
|
SoftCumulative(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
int wishCapa,
int capa)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
int[] durations,
int[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
int[] durations,
int[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
int[] durations,
int[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
|
SoftCumulativeSum(IntDomainVar[] starts,
IntDomainVar[] ends,
IntDomainVar[] durations,
IntDomainVar[] heights,
IntDomainVar[] costVars,
IntDomainVar obj,
int wishCapa,
int capa,
Solver solver)
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.tree |
---|
Constructors in choco.cp.solver.constraints.global.tree with parameters of type IntDomainVar | |
---|---|
TreeSConstraint(IntDomainVar[] allVars,
TreeParameters tree)
constructor: allocates the data util for a Choco constraint |
Uses of IntDomainVar in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.globalCardConstraint |
---|
Fields in choco.cp.solver.constraints.global.tree.filtering.structuralFiltering.globalCardConstraint declared as IntDomainVar | |
---|---|
protected IntDomainVar |
AbstractBipartGraph.nTree
|
Uses of IntDomainVar in choco.cp.solver.constraints.global.tree.structure.inputStructure |
---|
Fields in choco.cp.solver.constraints.global.tree.structure.inputStructure declared as IntDomainVar | |
---|---|
protected IntDomainVar |
Node.inDegree
an integer variable that depicts the indegree of the current node |
protected IntDomainVar |
TreeParameters.nproper
an integer variable that depicts the number of proper tree allowed to partition the graph |
protected IntDomainVar |
TreeParameters.ntree
an integer variable that depicts the number of tree allowed to partition the graph |
protected IntDomainVar |
TreeParameters.objective
a bounded variable that depicts the total cost of the partition |
protected IntDomainVar |
Node.successors
an integer variable that depicts the potential sucessor nodes of the current node (by indices) |
protected IntDomainVar |
Node.timeWindow
an integer variable that depicts the starting time from the current node |
Methods in choco.cp.solver.constraints.global.tree.structure.inputStructure that return IntDomainVar | |
---|---|
IntDomainVar[] |
TreeParameters.getAllVars()
build a table of all the integer variables involved in a tree constraint |
IntDomainVar |
Node.getInDegree()
|
IntDomainVar |
TreeParameters.getNproper()
|
IntDomainVar |
TreeParameters.getNtree()
|
IntDomainVar |
TreeParameters.getObjective()
|
IntDomainVar |
Node.getSuccessors()
|
IntDomainVar[] |
TreeParameters.getSuccVars()
build a table of all the successor variables that depict the graph to partition |
IntDomainVar |
Node.getTimeWindow()
|
Constructors in choco.cp.solver.constraints.global.tree.structure.inputStructure with parameters of type IntDomainVar | |
---|---|
Node(Solver solver,
int nbNodes,
int idx,
IntDomainVar successor,
IntDomainVar inDegree,
IntDomainVar timeWindow,
List<BitSet[]> graphs)
constructor: build a node and its associated attributes |
|
TreeParameters(Solver solver,
int nbNodes,
IntDomainVar ntree,
IntDomainVar nproper,
IntDomainVar objective,
List<BitSet[]> graphs,
List<int[][]> matrix,
int[][] travel)
constructor: build the input data of a tree constraint. |
|
TreeParameters(Solver solver,
int nbNodes,
IntDomainVar ntree,
IntDomainVar nproper,
IntDomainVar objective,
Node[] nodes,
int[][] travel)
constructor: build the input data of a tree constraint. |
Uses of IntDomainVar in choco.cp.solver.constraints.global.tree.structure.internalStructure.graphStructures.graphViews |
---|
Fields in choco.cp.solver.constraints.global.tree.structure.internalStructure.graphStructures.graphViews declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
VarGraphView.s
the successor variables depicting the graph to partition |
Constructors in choco.cp.solver.constraints.global.tree.structure.internalStructure.graphStructures.graphViews with parameters of type IntDomainVar | |
---|---|
VarGraphView(Solver solver,
IntDomainVar[] vars)
Constructor of the graph view |
Uses of IntDomainVar in choco.cp.solver.constraints.integer |
---|
Methods in choco.cp.solver.constraints.integer that return IntDomainVar | |
---|---|
protected static IntDomainVar[] |
IncreasingSum.buildVars(IntDomainVar[] dec,
IntDomainVar s)
|
protected IntDomainVar |
ElementVG.getIndexVar()
|
protected IntDomainVar |
ElementV.getIndexVar()
|
protected IntDomainVar |
ElementVG.getValueVar()
|
protected IntDomainVar |
ElementV.getValueVar()
|
Methods in choco.cp.solver.constraints.integer with parameters of type IntDomainVar | |
---|---|
protected static IntDomainVar[] |
IncreasingSum.buildVars(IntDomainVar[] dec,
IntDomainVar s)
|
protected static IntDomainVar[] |
IncreasingSum.buildVars(IntDomainVar[] dec,
IntDomainVar s)
|
void |
DistanceXYC.filterFromVarToVar(IntDomainVar var1,
IntDomainVar var2)
Initial propagation in case of EQ and enumerated domains |
void |
DistanceXYC.filterGTonVar(IntDomainVar vv0,
IntDomainVar vv1)
In case of a GT, due to a modification on vv0 domain |
void |
DistanceXYC.filterLTonVar(IntDomainVar vv0,
IntDomainVar vv1)
In case of a LT, due to a modification on vv0 domain |
void |
SignOp.filterNotSame(IntDomainVar x1,
IntDomainVar x2)
|
void |
DistanceXYC.filterOnInf(IntDomainVar vv0,
IntDomainVar vv1)
In case of a EQ, due to a modification of the lower bound of vv0 |
void |
DistanceXYC.filterOnInst(IntDomainVar v,
int val)
In case of a EQ, due to the instantion to one variable to val |
void |
DistanceXYC.filterOnSup(IntDomainVar vv0,
IntDomainVar vv1)
In case of a EQ, due to a modification of the upper bound of vv0 |
void |
SignOp.filterSame(IntDomainVar x1,
IntDomainVar x2)
|
Constructors in choco.cp.solver.constraints.integer with parameters of type IntDomainVar | |
---|---|
Absolute(IntDomainVar x0,
IntDomainVar x1)
Constructs the constraint with the specified variables. |
|
DistanceXYC(IntDomainVar v1,
IntDomainVar v2,
int c,
int oper)
|
|
DistanceXYZ(IntDomainVar x0,
IntDomainVar x1,
IntDomainVar x2,
int c,
int op)
Enforces |x0 - x1| op x2 + c where op can be =, <, > |
|
Element(IntDomainVar index,
int[] values,
IntDomainVar var)
|
|
Element(IntDomainVar index,
int[] values,
IntDomainVar var,
int offset)
|
|
Element2D(IntDomainVar v0,
IntDomainVar v1,
IntDomainVar v2,
int[][] lvals)
2D Element constraint that lvals[v0][v1] = v2 where lvals is an int[][] |
|
ElementG(IntDomainVar index,
int[] values,
IntDomainVar var,
IEnvironment environment)
|
|
ElementV(IntDomainVar[] vars,
int offset,
IEnvironment environment)
|
|
ElementVG(IntDomainVar[] vars,
int offset,
IEnvironment environment)
|
|
EqualXC(IntDomainVar x0,
int c)
Constructs the constraint with the specified variables and constant. |
|
EqualXY_C(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
EqualXYC(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
EuclideanDivisionXYZ(IntDomainVar x,
IntDomainVar y,
IntDomainVar z)
|
|
GreaterOrEqualXC(IntDomainVar x0,
int c)
Constructs the constraint with the specified variables and constant. |
|
GreaterOrEqualXY_C(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
GreaterOrEqualXYC(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
IncreasingSum(IntDomainVar[] dec,
IntDomainVar s)
|
|
IncreasingSum(IntDomainVar[] dec,
IntDomainVar s)
|
|
IntLinComb(IntDomainVar[] lvars,
int[] lcoeffs,
int nbPositive,
int c,
int linOperator)
Constructs the constraint with the specified variables and constant. |
|
InverseChanneling(IntDomainVar[] allVars,
int n)
link x and y so that x[i] = j <=> y[j] = i It is used to maintain both model on permutation problems |
|
InverseChannelingWithinRange(IntDomainVar[] allVars,
int n)
link x and y so that x[i] = j <=> y[j] = i It is used to maintain both models on permutation problems |
|
LessOrEqualXC(IntDomainVar x0,
int c)
Constructs the constraint with the specified variables and constant. |
|
LessOrEqualXY_C(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
MaxOfAList(IEnvironment environment,
IntDomainVar[] vars)
|
|
MaxXYZ(IntDomainVar x,
IntDomainVar y,
IntDomainVar max)
|
|
MemberBound(IntDomainVar v0,
int lower,
int upper)
|
|
MemberEnum(IntDomainVar v0,
int[] values)
|
|
MinOfAList(IEnvironment environment,
IntDomainVar[] vars)
|
|
MinXYZ(IntDomainVar x,
IntDomainVar y,
IntDomainVar min)
|
|
ModuloXYC2(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
NotEqualXC(IntDomainVar x0,
int c)
Constructs the constraint with the specified variables and constant. |
|
NotEqualXY_C(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
NotEqualXYC(IntDomainVar x0,
IntDomainVar x1,
int c)
Constructs the constraint with the specified variables and constant. |
|
NotMemberBound(IntDomainVar v0,
int lower,
int upper)
|
|
NotMemberEnum(IntDomainVar v0,
int[] values)
|
|
SignOp(IntDomainVar x0,
IntDomainVar x1,
boolean same)
|
|
TimesXYZ(IntDomainVar x,
IntDomainVar y,
IntDomainVar z)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.bool |
---|
Methods in choco.cp.solver.constraints.integer.bool that return IntDomainVar | |
---|---|
static IntDomainVar[] |
BoolIntLinComb.makeTableVar(IntDomainVar[] vs,
IntDomainVar v)
|
Methods in choco.cp.solver.constraints.integer.bool that return types with arguments of type IntDomainVar | |
---|---|
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.and(IntDomainVar... booleans)
Builder for AND constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.identity(IntDomainVar bool)
Builder for NOT constraint over an integer variable |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.nand(IEnvironment environment,
IntDomainVar... booleans)
Builder for NAND constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.nor(IntDomainVar... booleans)
Builder for NOR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.not(IntDomainVar bool)
Builder for NOT constraint over an integer variable |
AbstractSConstraint<IntDomainVar> |
Not.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeXor.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeXnor.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeOr.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeNor.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeNand.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
LargeAnd.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
Identity.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
BoolIntLinComb.opposite(Solver solver)
Computes the opposite of this constraint. |
AbstractSConstraint<IntDomainVar> |
BinXor.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
BinXnor.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
BinOr.opposite(Solver solver)
Get the opposite constraint |
AbstractSConstraint<IntDomainVar> |
BinAnd.opposite(Solver solver)
Get the opposite constraint |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.or(IEnvironment environment,
IntDomainVar... booleans)
Builder for OR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.xnor(IntDomainVar... booleans)
Builder for XOR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.xor(IntDomainVar... booleans)
Builder for XOR constraint over integer variables |
Methods in choco.cp.solver.constraints.integer.bool with parameters of type IntDomainVar | |
---|---|
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.and(IntDomainVar... booleans)
Builder for AND constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.identity(IntDomainVar bool)
Builder for NOT constraint over an integer variable |
static IntDomainVar[] |
BoolIntLinComb.makeTableVar(IntDomainVar[] vs,
IntDomainVar v)
|
static IntDomainVar[] |
BoolIntLinComb.makeTableVar(IntDomainVar[] vs,
IntDomainVar v)
|
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.nand(IEnvironment environment,
IntDomainVar... booleans)
Builder for NAND constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.nor(IntDomainVar... booleans)
Builder for NOR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.not(IntDomainVar bool)
Builder for NOT constraint over an integer variable |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.or(IEnvironment environment,
IntDomainVar... booleans)
Builder for OR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.xnor(IntDomainVar... booleans)
Builder for XOR constraint over integer variables |
static AbstractSConstraint<IntDomainVar> |
BooleanFactory.xor(IntDomainVar... booleans)
Builder for XOR constraint over integer variables |
Constructors in choco.cp.solver.constraints.integer.bool with parameters of type IntDomainVar | |
---|---|
BoolIntLinComb(IEnvironment environment,
IntDomainVar[] vs,
int[] coefs,
IntDomainVar c,
int objcoef,
int scste,
int op)
Constructs the constraint with the specified variables and constant. |
|
BoolIntLinComb(IEnvironment environment,
IntDomainVar[] vs,
int[] coefs,
IntDomainVar c,
int objcoef,
int scste,
int op)
Constructs the constraint with the specified variables and constant. |
|
BoolTimesXYZ(IntDomainVar x0,
IntDomainVar x1,
IntDomainVar x2)
A simple Product constraint between boolean variables : x * y = z |
Uses of IntDomainVar in choco.cp.solver.constraints.integer.bool.sat |
---|
Fields in choco.cp.solver.constraints.integer.bool.sat declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
Lits.boolvars
|
Fields in choco.cp.solver.constraints.integer.bool.sat with type parameters of type IntDomainVar | |
---|---|
protected LinkedList<IntDomainVar> |
ClauseStore.instToOne
|
protected LinkedList<IntDomainVar> |
ClauseStore.instToZero
|
Methods in choco.cp.solver.constraints.integer.bool.sat that return IntDomainVar | |
---|---|
static IntDomainVar[] |
ClauseStore.removeRedundantVars(IntDomainVar[] vs)
|
Methods in choco.cp.solver.constraints.integer.bool.sat with parameters of type IntDomainVar | |
---|---|
void |
ClauseStore.addClause(IntDomainVar[] positivelits,
IntDomainVar[] negativelits)
add a clause in the store WARNING : this method assumes that the variables are in the scope of the ClauseStore |
void |
ClauseStore.addClause(IntDomainVar[] positivelits,
IntDomainVar[] negativelits)
add a clause in the store WARNING : this method assumes that the variables are in the scope of the ClauseStore |
void |
ClauseStore.addNoGood(IntDomainVar[] positivelits,
IntDomainVar[] negativelits)
|
void |
ClauseStore.addNoGood(IntDomainVar[] positivelits,
IntDomainVar[] negativelits)
|
int[] |
ClauseStore.computeLits(IntDomainVar[] plit,
IntDomainVar[] nlit)
|
int[] |
ClauseStore.computeLits(IntDomainVar[] plit,
IntDomainVar[] nlit)
|
int |
ClauseStore.findIndex(IntDomainVar v)
|
void |
Lits.init(IntDomainVar[] vars)
|
static IntDomainVar[] |
ClauseStore.removeRedundantVars(IntDomainVar[] vs)
|
Constructors in choco.cp.solver.constraints.integer.bool.sat with parameters of type IntDomainVar | |
---|---|
ClauseStore(IntDomainVar[] vars,
ArrayList<WLClause> listclause,
Lits voc,
IEnvironment environment)
|
|
ClauseStore(IntDomainVar[] vars,
IEnvironment environment)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.bool.sum |
---|
Fields in choco.cp.solver.constraints.integer.bool.sum declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
BoolSumStructure.vars
|
Methods in choco.cp.solver.constraints.integer.bool.sum that return IntDomainVar | |
---|---|
IntDomainVar[] |
BoolSumStructure.getBoolVars()
|
Methods in choco.cp.solver.constraints.integer.bool.sum that return types with arguments of type IntDomainVar | |
---|---|
AbstractSConstraint<IntDomainVar> |
NeqBoolSum.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
LeqBoolSum.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
GeqBoolSum.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
EqBoolSum.opposite(Solver solver)
|
Constructors in choco.cp.solver.constraints.integer.bool.sum with parameters of type IntDomainVar | |
---|---|
AbstractBoolSum(IEnvironment environment,
IntDomainVar[] vars,
int bValue)
|
|
BoolSumStructure(IEnvironment environment,
AbstractSConstraint<?> cstr,
IntDomainVar[] vars,
int bValue)
|
|
EqBoolSum(IEnvironment environment,
IntDomainVar[] vars,
int bValue)
|
|
GeqBoolSum(IEnvironment environment,
IntDomainVar[] vars,
int bValue)
|
|
LeqBoolSum(IEnvironment environment,
IntDomainVar[] vars,
int bValue)
|
|
NeqBoolSum(IEnvironment environment,
IntDomainVar[] vars,
int bValue)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.channeling |
---|
Constructors in choco.cp.solver.constraints.integer.channeling with parameters of type IntDomainVar | |
---|---|
BooleanChanneling(IntDomainVar yij,
IntDomainVar xi,
int j)
|
|
DomainChanneling(IntDomainVar[] yij,
IntDomainVar xi,
IEnvironment environment)
Make a new Channeling. |
|
DomainChanneling(IntDomainVar[] yij,
IntDomainVar xi,
IEnvironment environment)
Make a new Channeling. |
|
ReifiedBinImplication(IntDomainVar b,
IntDomainVar v1,
IntDomainVar v2)
A constraint to ensure : b = v1 xnor v2 |
|
ReifiedBinXnor(IntDomainVar b,
IntDomainVar v1,
IntDomainVar v2)
A constraint to ensure : b = v1 xnor v2 |
|
ReifiedBinXor(IntDomainVar b,
IntDomainVar v1,
IntDomainVar v2)
A constraint to ensure : b = v1 xor v2 |
|
ReifiedLargeAnd(IntDomainVar[] vars,
IEnvironment environment)
A constraint to ensure : b = AND_{i} vars[i] |
|
ReifiedLargeNand(IntDomainVar[] vars,
IEnvironment environment)
A constraint to ensure : b = OR_{i} vars[i] |
|
ReifiedLargeNor(IntDomainVar[] vars,
IEnvironment environment)
A constraint to ensure : b = AND_{i} vars[i] |
|
ReifiedLargeOr(IntDomainVar[] vars,
IEnvironment environment)
A constraint to ensure : b = OR_{i} vars[i] |
Uses of IntDomainVar in choco.cp.solver.constraints.integer.extension |
---|
Fields in choco.cp.solver.constraints.integer.extension declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
ValidityChecker.sortedvs
|
Fields in choco.cp.solver.constraints.integer.extension with type parameters of type IntDomainVar | |
---|---|
protected HashMap<IntDomainVar,Integer> |
ValidityChecker.mapinit
|
Methods in choco.cp.solver.constraints.integer.extension that return types with arguments of type IntDomainVar | |
---|---|
AbstractSConstraint<IntDomainVar> |
GAC3rmLargeConstraint.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
FCBinSConstraint.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
CspLargeSConstraint.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
AC3rmBitBinSConstraint.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
AC3rmBinSConstraint.opposite(Solver solver)
|
AbstractSConstraint<IntDomainVar> |
AC3BinSConstraint.opposite(Solver solver)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.intlincomb |
---|
Methods in choco.cp.solver.constraints.integer.intlincomb with parameters of type IntDomainVar | |
---|---|
static boolean |
IntLinCombFactory.isBoolLinComb(IntDomainVar[] lvars)
Check if the combination is made of a single integer variable and only boolean variables |
Constructors in choco.cp.solver.constraints.integer.intlincomb with parameters of type IntDomainVar | |
---|---|
IntLinCombEQ(int[] coeffs,
int nbPosVars,
int cste,
IntDomainVar[] vars,
AbstractSConstraint constraint)
|
|
IntLinCombGEQ(int[] coeffs,
int nbPosVars,
int cste,
IntDomainVar[] vars,
AbstractSConstraint constraint)
|
|
IntLinCombLEQ(int[] coeffs,
int nbPosVars,
int cste,
IntDomainVar[] vars,
AbstractSConstraint constraint)
|
|
IntLinCombNEQ(int[] coeffs,
int nbPosVars,
int cste,
IntDomainVar[] vars,
AbstractSConstraint constraint)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.intlincomb.policy |
---|
Methods in choco.cp.solver.constraints.integer.intlincomb.policy with parameters of type IntDomainVar | |
---|---|
static CoeffPolicy |
CoeffPolicy.build(IntDomainVar[] vars,
int[] coeffs,
int nbPosVars,
int cste)
|
Uses of IntDomainVar in choco.cp.solver.constraints.integer.soft |
---|
Methods in choco.cp.solver.constraints.integer.soft that return IntDomainVar | |
---|---|
static IntDomainVar[] |
SoftIntSConstraint.makeTableVar(IntDomainVar bool,
AbstractIntSConstraint cons)
|
Methods in choco.cp.solver.constraints.integer.soft with parameters of type IntDomainVar | |
---|---|
static IntDomainVar[] |
SoftIntSConstraint.makeTableVar(IntDomainVar bool,
AbstractIntSConstraint cons)
|
Constructors in choco.cp.solver.constraints.integer.soft with parameters of type IntDomainVar | |
---|---|
SoftIntSConstraint(IntDomainVar dist,
AbstractIntSConstraint cons)
A constraint that allows to 'softy' another constraint into a distance value (boolean). |
Uses of IntDomainVar in choco.cp.solver.constraints.real |
---|
Constructors in choco.cp.solver.constraints.real with parameters of type IntDomainVar | |
---|---|
MixedCstElt(RealVar v0,
IntDomainVar v1,
double[] values)
|
|
MixedEqXY(RealVar v0,
IntDomainVar v1)
|
Uses of IntDomainVar in choco.cp.solver.constraints.reified |
---|
Fields in choco.cp.solver.constraints.reified declared as IntDomainVar | |
---|---|
protected IntDomainVar[] |
ExpressionSConstraint.vars
The scope of the predicat |
Methods in choco.cp.solver.constraints.reified that return IntDomainVar | |
---|---|
IntDomainVar[] |
ExpressionSConstraint.getVars()
|
Methods in choco.cp.solver.constraints.reified with parameters of type IntDomainVar | ||
---|---|---|
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. |
|
static
|
ReifiedAllSConstraint.makeTableVar(IntDomainVar bool,
C cons,
C oppcons)
|
Constructors in choco.cp.solver.constraints.reified with parameters of type IntDomainVar | |
---|---|
IfThenElse(IntDomainVar bool,
AbstractIntSConstraint cons,
AbstractIntSConstraint othercons)
|
Uses of IntDomainVar in choco.cp.solver.constraints.reified.leaves |
---|
Fields in choco.cp.solver.constraints.reified.leaves declared as IntDomainVar | |
---|---|
IntDomainVar |
VariableLeaf.var
|
Methods in choco.cp.solver.constraints.reified.leaves that return IntDomainVar | |
---|---|
IntDomainVar |
VariableLeaf.extractResult(Solver s)
|
IntDomainVar |
ConstraintLeaf.extractResult(Solver s)
|
IntDomainVar |
ConstantLeaf.extractResult(Solver s)
|
IntDomainVar[] |
VariableLeaf.getScope(Solver s)
|
IntDomainVar[] |
ConstraintLeaf.getScope(Solver s)
|
IntDomainVar[] |
ConstantLeaf.getScope(Solver s)
|
Methods in choco.cp.solver.constraints.reified.leaves with parameters of type IntDomainVar | |
---|---|
void |
VariableLeaf.setIndexes(IntDomainVar[] vs)
|
void |
ConstraintLeaf.setIndexes(IntDomainVar[] vs)
|
void |
ConstantLeaf.setIndexes(IntDomainVar[] vs)
|
void |
VariableLeaf.setSolverVar(IntDomainVar v)
|
Constructors in choco.cp.solver.constraints.reified.leaves with parameters of type IntDomainVar | |
---|---|
VariableLeaf(IntDomainVar var)
|
Uses of IntDomainVar in choco.cp.solver.constraints.reified.leaves.arithm |
---|
Methods in choco.cp.solver.constraints.reified.leaves.arithm that return IntDomainVar | |
---|---|
IntDomainVar |
ScalarNode.extractResult(Solver s)
|
IntDomainVar |
PlusNode.extractResult(Solver s)
|
IntDomainVar |
NegNode.extractResult(Solver s)
|
IntDomainVar |
MultNode.extractResult(Solver s)
|
IntDomainVar |
MinusNode.extractResult(Solver s)
|
IntDomainVar |
MinNode.extractResult(Solver s)
|
IntDomainVar |
MaxNode.extractResult(Solver s)
|
IntDomainVar |
IfThenElseNode.extractResult(Solver s)
|
IntDomainVar |
DivNode.extractResult(Solver s)
|
IntDomainVar |
DistNode.extractResult(Solver s)
|
IntDomainVar |
AbsNode.extractResult(Solver s)
|
Uses of IntDomainVar in choco.cp.solver.constraints.reified.leaves.bool |
---|
Methods in choco.cp.solver.constraints.reified.leaves.bool that return IntDomainVar | |
---|---|
IntDomainVar |
XorNode.extractResult(Solver s)
|
IntDomainVar |
XnorNode.extractResult(Solver s)
|
IntDomainVar |
OrNode.extractResult(Solver s)
|
IntDomainVar |
NotNode.extractResult(Solver s)
|
IntDomainVar |
NorNode.extractResult(Solver s)
|
IntDomainVar |
NandNode.extractResult(Solver s)
|
IntDomainVar |
AndNode.extractResult(Solver s)
|
IntDomainVar |
AbstractBoolNode.extractResult(Solver s)
|
Uses of IntDomainVar in choco.cp.solver.constraints.set |
---|
Constructors in choco.cp.solver.constraints.set with parameters of type IntDomainVar | |
---|---|
AbstractBoundOfASet(IEnvironment environment,
IntDomainVar[] intvars,
SetVar setvar,
AbstractBoundOfASet.EmptySetPolicy emptySetPolicy)
|
|
InverseSetInt(IntDomainVar[] x,
SetVar[] s)
|
|
MaxOfASet(IEnvironment environment,
IntDomainVar[] intvars,
SetVar setvar,
AbstractBoundOfASet.EmptySetPolicy emptySetPolicy)
|
|
MemberXiY(SetVar setvar,
IntDomainVar[] intvars)
|
|
MemberXY(SetVar set,
IntDomainVar iv)
|
|
MinOfASet(IEnvironment environment,
IntDomainVar[] intvars,
SetVar setvar,
AbstractBoundOfASet.EmptySetPolicy emptySetPolicy)
|
|
NotMemberXY(SetVar set,
IntDomainVar iv)
|
|
SetCard(SetVar sv,
IntDomainVar iv,
boolean inf,
boolean sup)
|
Uses of IntDomainVar in choco.cp.solver.constraints.strong |
---|
Fields in choco.cp.solver.constraints.strong with type parameters of type IntDomainVar | |
---|---|
protected Map<IntDomainVar,MyVariable> |
AbstractStrongConsistency.variablesMap
|
Methods in choco.cp.solver.constraints.strong that return IntDomainVar | |
---|---|
IntDomainVar |
SCVariable.getSVariable()
|
Methods in choco.cp.solver.constraints.strong with parameters of type IntDomainVar | |
---|---|
double |
DomOverWDegRPC.getHeuristic(IntDomainVar v)
|
double |
DomOverDDegRPC.getHeuristic(IntDomainVar v)
|
Constructors in choco.cp.solver.constraints.strong with parameters of type IntDomainVar | |
---|---|
AbstractStrongConsistency(IntDomainVar[] vars,
ISpecializedConstraint[] constraints,
Class<? extends MyVariable> myVariable,
Class<? extends SCConstraint> myConstraint)
|
|
DomOverWDegRPC(Solver solver,
IntDomainVar[] vs)
|
|
SCVariable(IntDomainVar sVariable,
int id)
|
Constructor parameters in choco.cp.solver.constraints.strong with type arguments of type IntDomainVar | |
---|---|
SCConstraint(ISpecializedConstraint sConstraint,
Map<IntDomainVar,SCVariable> pool)
|
Uses of IntDomainVar in choco.cp.solver.constraints.strong.maxrpcrm |
---|
Methods in choco.cp.solver.constraints.strong.maxrpcrm with parameters of type IntDomainVar | |
---|---|
int |
MaxRPCrm.getDDeg(IntDomainVar v)
|
int |
MaxRPCrm.getWDeg(IntDomainVar v)
|
Constructors in choco.cp.solver.constraints.strong.maxrpcrm with parameters of type IntDomainVar | |
---|---|
MaxRPCrm(IntDomainVar[] variables,
ISpecializedConstraint[] constraints,
Set<String> options)
|
|
MaxRPCVariable(IntDomainVar sVariable,
Integer id)
|
Constructor parameters in choco.cp.solver.constraints.strong.maxrpcrm with type arguments of type IntDomainVar | |
---|---|
AbstractMaxRPCConstraint(ISpecializedConstraint sConstraint,
Map<IntDomainVar,SCVariable> pool)
|
|
MaxRPCConstraintFull(ISpecializedConstraint intSConstraint,
Map<IntDomainVar,SCVariable> variablesMap)
Implémentation de la contrainte utilisant des résidus pour les supports PC construction de la liste des résidus PC à partir d'un tableau prégénéré |
|
MaxRPCConstraintLight(ISpecializedConstraint intSConstraint,
Map<IntDomainVar,SCVariable> variablesMap)
Implémentation de la contrainte utilisant des résidus pour les supports PC construction de la liste des résidus PC à partir d'un tableau prégénéré |
Uses of IntDomainVar in choco.cp.solver.goals |
---|
Methods in choco.cp.solver.goals with parameters of type IntDomainVar | |
---|---|
static Goal |
GoalHelper.remVal(IntDomainVar var,
int val)
|
static Goal |
GoalHelper.setVal(IntDomainVar var,
int val)
|
Uses of IntDomainVar in choco.cp.solver.goals.choice |
---|
Fields in choco.cp.solver.goals.choice declared as IntDomainVar | |
---|---|
protected IntDomainVar |
Instantiate.var
|
protected IntDomainVar[] |
Generate.vars
|
Fields in choco.cp.solver.goals.choice with type parameters of type IntDomainVar | |
---|---|
protected ValIterator<IntDomainVar> |
Instantiate.valIterator
|
protected ValIterator<IntDomainVar> |
Generate.valIterator
|
protected ValSelector<IntDomainVar> |
Instantiate.valSelector
|
protected ValSelector<IntDomainVar> |
Generate.valSelector
|
protected VarSelector<IntDomainVar> |
Generate.varSelector
|
Constructors in choco.cp.solver.goals.choice with parameters of type IntDomainVar | |
---|---|
Generate(IntDomainVar[] vars)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValIterator<IntDomainVar> valIterator)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValSelector<IntDomainVar> valSelector)
|
|
Instantiate(IntDomainVar var)
|
|
Instantiate(IntDomainVar var,
ValIterator<IntDomainVar> valIterator)
|
|
Instantiate(IntDomainVar var,
ValSelector<IntDomainVar> s)
|
Constructor parameters in choco.cp.solver.goals.choice with type arguments of type IntDomainVar | |
---|---|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValIterator<IntDomainVar> valIterator)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValIterator<IntDomainVar> valIterator)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValSelector<IntDomainVar> valSelector)
|
|
Generate(IntDomainVar[] vars,
VarSelector<IntDomainVar> varSelector,
ValSelector<IntDomainVar> valSelector)
|
|
Instantiate(IntDomainVar var,
ValIterator<IntDomainVar> valIterator)
|
|
Instantiate(IntDomainVar var,
ValSelector<IntDomainVar> s)
|
Uses of IntDomainVar in choco.cp.solver.preprocessor |
---|
Methods in choco.cp.solver.preprocessor that return IntDomainVar | |
---|---|
static IntDomainVar[] |
PPSearch.concat(IntDomainVar[] t1,
IntDomainVar[] t2)
|
static IntDomainVar[] |
PPSearch.getBooleanVars(CPSolver s)
|
static IntDomainVar[] |
PPSearch.getOtherVars(CPSolver s)
|
Methods in choco.cp.solver.preprocessor with parameters of type IntDomainVar | |
---|---|
static IntDomainVar[] |
PPSearch.concat(IntDomainVar[] t1,
IntDomainVar[] t2)
|
static IntDomainVar[] |
PPSearch.concat(IntDomainVar[] t1,
IntDomainVar[] t2)
|
Uses of IntDomainVar in choco.cp.solver.propagation |
---|
Methods in choco.cp.solver.propagation with parameters of type IntDomainVar | |
---|---|
void |
AbstractPropagationEngine.postInstInt(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation 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.postUpdateSup(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
Uses of IntDomainVar in choco.cp.solver.search |
---|
Methods in choco.cp.solver.search that return IntDomainVar | |
---|---|
protected IntDomainVar |
NogoodRecorder.getBranchingVar(IntBranchingTrace trace)
|
Methods in choco.cp.solver.search with parameters of type IntDomainVar | |
---|---|
static AssignVar |
BranchingFactory.domDDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel)
|
static AssignVar |
BranchingFactory.domDDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel,
long seed)
|
static AssignVar |
BranchingFactory.domDDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignVar |
BranchingFactory.domDDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domDDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domDDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static MinRatioSelector |
VarSelectorFactory.domDDegSel(Solver solver,
IntDomainVar[] vars)
|
static RandMinRatioSelector |
VarSelectorFactory.domDDegSel(Solver solver,
IntDomainVar[] vars,
long seed)
|
static AssignVar |
BranchingFactory.domDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel)
|
static AssignVar |
BranchingFactory.domDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel,
long seed)
|
static AssignVar |
BranchingFactory.domDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignVar |
BranchingFactory.domDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static MinRatioSelector |
VarSelectorFactory.domDegSel(Solver solver,
IntDomainVar[] vars)
|
static RandMinRatioSelector |
VarSelectorFactory.domDegSel(Solver solver,
IntDomainVar[] vars,
long seed)
|
static AssignVar |
BranchingFactory.domWDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel)
|
static AssignVar |
BranchingFactory.domWDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel,
long seed)
|
static AssignVar |
BranchingFactory.domWDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignVar |
BranchingFactory.domWDeg(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domWDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static AssignOrForbidIntVarVal |
BranchingFactory.domWDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static MinRatioSelector |
VarSelectorFactory.domWDegSel(Solver solver,
IntDomainVar[] vars)
|
static RandMinRatioSelector |
VarSelectorFactory.domWDegSel(Solver solver,
IntDomainVar[] vars,
long seed)
|
static DomOverWDegBranchingNew |
BranchingFactory.incDomWDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel)
|
static DomOverWDegBranchingNew |
BranchingFactory.incDomWDeg(Solver solver,
IntDomainVar[] vars,
ValIterator valSel,
long seed)
|
static DomOverWDegBinBranchingNew |
BranchingFactory.incDomWDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel)
|
static DomOverWDegBinBranchingNew |
BranchingFactory.incDomWDegBin(Solver solver,
IntDomainVar[] vars,
ValSelector valSel,
long seed)
|
static AssignVar |
BranchingFactory.lexicographic(Solver solver,
IntDomainVar[] vars)
|
static AssignVar |
BranchingFactory.lexicographic(Solver solver,
IntDomainVar[] vars,
ValSelector<IntDomainVar> valSel)
|
static AssignVar |
BranchingFactory.minDomIncDom(Solver s,
IntDomainVar[] vars)
|
static AssignVar |
BranchingFactory.minDomMinVal(Solver s,
IntDomainVar[] vars)
|
static AssignOrForbidIntVarVal |
BranchingFactory.randomBinSearch(Solver solver,
IntDomainVar[] vars,
long seed)
|
static AssignVar |
BranchingFactory.randomSearch(Solver solver,
IntDomainVar[] vars,
long seed)
|
Method parameters in choco.cp.solver.search with type arguments of type IntDomainVar | |
---|---|
static AssignVar |
BranchingFactory.lexicographic(Solver solver,
IntDomainVar[] vars,
ValSelector<IntDomainVar> valSel)
|
Constructors in choco.cp.solver.search with parameters of type IntDomainVar | |
---|---|
BranchAndBound(Solver solver,
IntDomainVar objective,
boolean maximize)
Builds a new optimizing strategy with the specified variable. |
Uses of IntDomainVar in choco.cp.solver.search.integer.branching |
---|
Methods in choco.cp.solver.search.integer.branching with parameters of type IntDomainVar | |
---|---|
int |
ImpactBasedBranching.getBestVal(IntDomainVar var)
|
double |
ImpactBasedBranching.ImpactStrategy.getBoundImpactVar(IntDomainVar var)
Only one impact is stored for a BoundIntVar (not an impact per value) |
int |
ImpactBasedBranching.AbstractImpactStrategy.ImpactStorage.getChoiceAddress(IntDomainVar var,
int val)
|
double |
ImpactBasedBranching.ImpactStrategy.getEnumImpactVar(IntDomainVar var)
return the impact of the variable var. |
double |
ImpactBasedBranching.ImpactStrategy.getImpactVal(IntDomainVar var,
int val)
return the impact of the choice var == val. |
protected void |
ImpactBasedBranching.goDownBranch(IntDomainVar var,
int val)
|
void |
PackDynRemovals.removeEmptyBins(IntDomainVar bin)
|
void |
PackDynRemovals.removeEquivalentBins(IntDomainVar bin,
int bup)
|
Constructors in choco.cp.solver.search.integer.branching with parameters of type IntDomainVar | |
---|---|
DomOverWDegBinBranching(Solver s,
ValSelector valHeuri,
IntDomainVar[] intDomainVars)
Deprecated. |
|
ImpactBasedBranching(Solver solver,
IntDomainVar[] vars)
|
|
ImpactBasedBranching(Solver solver,
IntDomainVar[] vars,
ImpactBasedBranching.AbstractImpactStrategy ibs)
|
Constructor parameters in choco.cp.solver.search.integer.branching with type arguments of type IntDomainVar | |
---|---|
AssignOrForbidIntVarVal(VarSelector<IntDomainVar> varHeuristic,
ValSelector<IntDomainVar> valSHeuristic)
|
|
AssignOrForbidIntVarVal(VarSelector<IntDomainVar> varHeuristic,
ValSelector<IntDomainVar> valSHeuristic)
|
|
PackDynRemovals(VarSelector<IntDomainVar> varSel,
ValSelector<IntDomainVar> valHeuri,
PackSConstraint pack)
|
|
PackDynRemovals(VarSelector<IntDomainVar> varSel,
ValSelector<IntDomainVar> valHeuri,
PackSConstraint pack)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.branching.domwdeg |
---|
Constructors in choco.cp.solver.search.integer.branching.domwdeg with parameters of type IntDomainVar | |
---|---|
DomOverWDegBinBranchingNew(Solver solver,
IntDomainVar[] vars,
ValSelector valHeuri,
Number seed)
|
|
DomOverWDegBranchingNew(Solver s,
IntDomainVar[] vars,
ValIterator valHeuri,
Number seed)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.objective |
---|
Fields in choco.cp.solver.search.integer.objective declared as IntDomainVar | |
---|---|
IntDomainVar |
IntObjectiveManager.objective
|
Constructors in choco.cp.solver.search.integer.objective with parameters of type IntDomainVar | |
---|---|
IntObjectiveManager(IntDomainVar objective)
|
|
MaxIntObjManager(IntDomainVar objective)
|
|
MinIntObjManager(IntDomainVar objective)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.valiterator |
---|
Methods in choco.cp.solver.search.integer.valiterator with parameters of type IntDomainVar | |
---|---|
int |
IncreasingDomain.getFirstVal(IntDomainVar x)
Accessing the index of the first branch for variable x |
int |
DecreasingDomain.getFirstVal(IntDomainVar x)
Accessing the index of the first branch for variable x |
int |
IncreasingDomain.getNextVal(IntDomainVar x,
int i)
generates the index of the next branch after branch i, on the alternative associated to variable x |
int |
DecreasingDomain.getNextVal(IntDomainVar x,
int i)
generates the index of the next branch after branch i, on the alternative associated to variable x |
boolean |
IncreasingDomain.hasNextVal(IntDomainVar x,
int i)
testing whether more branches can be considered after branch i, on the alternative associated to variable x |
boolean |
DecreasingDomain.hasNextVal(IntDomainVar x,
int i)
testing whether more branches can be considered after branch i, on the alternative associated to variable x |
Uses of IntDomainVar in choco.cp.solver.search.integer.valselector |
---|
Methods in choco.cp.solver.search.integer.valselector with parameters of type IntDomainVar | |
---|---|
int |
RandomIntValSelector.getBestVal(IntDomainVar x)
|
int |
MinVal.getBestVal(IntDomainVar x)
selecting the lowest value in the domain |
int |
MidVal.getBestVal(IntDomainVar x)
selecting a value in the middle of the domain |
int |
MaxVal.getBestVal(IntDomainVar x)
selecting the highest value in the domain |
int |
BestFit.getBestVal(IntDomainVar x)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.varselector |
---|
Methods in choco.cp.solver.search.integer.varselector that return IntDomainVar | |
---|---|
IntDomainVar |
StaticVarOrder.selectVar()
Select what seems to be most interesting variable, considering the current state of the variables |
IntDomainVar |
LexIntVarSelector.selectVar()
|
IntDomainVar |
CompositeIntVarSelector.selectVar()
|
Methods in choco.cp.solver.search.integer.varselector with parameters of type IntDomainVar | |
---|---|
int |
DomOverDynDeg.getDynDeg(IntDomainVar v)
Deprecated. |
int |
RandomIntVarSelector.getHeuristic(IntDomainVar v)
|
int |
MostConstrained.getHeuristic(IntDomainVar v)
|
int |
MinValueDomain.getHeuristic(IntDomainVar v)
|
int |
MinDomain.getHeuristic(IntDomainVar v)
|
int |
MaxValueDomain.getHeuristic(IntDomainVar v)
|
int |
MaxRegret.getHeuristic(IntDomainVar v)
Compute the difference between the two smallest values in domain of v . |
int |
MaxDomain.getHeuristic(IntDomainVar v)
|
double |
DomOverWDeg.getHeuristic(IntDomainVar v)
Deprecated. |
double |
DomOverDynDeg.getHeuristic(IntDomainVar v)
Deprecated. |
double |
DomOverDeg.getHeuristic(IntDomainVar v)
Deprecated. |
Constructors in choco.cp.solver.search.integer.varselector with parameters of type IntDomainVar | |
---|---|
DomOverDeg(Solver solver,
IntDomainVar[] vs)
Deprecated. |
|
DomOverDynDeg(Solver solver,
IntDomainVar[] vs)
Deprecated. |
|
DomOverWDeg(Solver solver,
IntDomainVar[] vs)
Deprecated. |
|
MaxDomain(Solver solver,
IntDomainVar[] vs)
|
|
MaxRegret(Solver solver,
IntDomainVar[] vs)
|
|
MaxValueDomain(Solver solver,
IntDomainVar[] vs)
|
|
MinDomain(Solver solver,
IntDomainVar[] vs)
|
|
MinValueDomain(Solver solver,
IntDomainVar[] vs)
|
|
MostConstrained(Solver solver,
IntDomainVar[] vs)
Builds the heuristic for the given model. |
|
RandomIntVarSelector(Solver solver,
IntDomainVar[] vs,
long seed)
|
|
StaticVarOrder(Solver solver,
IntDomainVar[] vars)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.varselector.ratioselector |
---|
Methods in choco.cp.solver.search.integer.varselector.ratioselector that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractIntVarRatioSelector.selectVar()
|
Methods in choco.cp.solver.search.integer.varselector.ratioselector that return types with arguments of type IntDomainVar | |
---|---|
List<IntDomainVar> |
AbstractIntVarRatioSelector.selectTiedIntVars()
|
Constructors in choco.cp.solver.search.integer.varselector.ratioselector with parameters of type IntDomainVar | |
---|---|
DomOverWDegSelector(Solver solver,
IntDomainVar[] vars)
|
|
RandDomOverWDegSelector(Solver solver,
IntDomainVar[] vars,
long seed)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.varselector.ratioselector.ratios |
---|
Methods in choco.cp.solver.search.integer.varselector.ratioselector.ratios that return IntDomainVar | |
---|---|
IntDomainVar |
SimpleRatio.getIntVar()
|
IntDomainVar |
IntRatio.getIntVar()
|
Methods in choco.cp.solver.search.integer.varselector.ratioselector.ratios with parameters of type IntDomainVar | |
---|---|
static IntRatio[] |
RatioFactory.createDomDegRatio(IntDomainVar[] vars)
|
static IntRatio[] |
RatioFactory.createDomDynDegRatio(IntDomainVar[] vars)
|
static IntRatio[] |
RatioFactory.createDomWDegRatio(IntDomainVar[] vars,
boolean incremental)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.varselector.ratioselector.ratios.degree |
---|
Fields in choco.cp.solver.search.integer.varselector.ratioselector.ratios.degree declared as IntDomainVar | |
---|---|
protected IntDomainVar |
DomDegRatio.var
|
Methods in choco.cp.solver.search.integer.varselector.ratioselector.ratios.degree that return IntDomainVar | |
---|---|
IntDomainVar |
DomDegRatio.getIntVar()
|
Constructors in choco.cp.solver.search.integer.varselector.ratioselector.ratios.degree with parameters of type IntDomainVar | |
---|---|
DomDegRatio(IntDomainVar var)
|
|
DomDynDegRatio(IntDomainVar var)
|
|
DomWDegRatio(IntDomainVar var)
|
|
IncDomWDegRatio(IntDomainVar var)
|
Uses of IntDomainVar in choco.cp.solver.search.integer.varselector.ratioselector.ratios.task |
---|
Methods in choco.cp.solver.search.integer.varselector.ratioselector.ratios.task that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractPrecedenceRatio.getIntVar()
|
Uses of IntDomainVar in choco.cp.solver.variables.integer |
---|
Classes in choco.cp.solver.variables.integer that implement IntDomainVar | |
---|---|
class |
AbstractBijectiveVar
|
class |
BooleanVarImpl<C extends AbstractSConstraint & IntPropagator>
A variable implementation dedicated to boolean domains |
class |
BoolVarNot
A bijective boolean variable B : B = not(A) |
class |
IntDomainVarAddCste
Declare a variable Y, based on a variable X and a constante c, such as Y = X + c |
class |
IntDomainVarImpl<C extends AbstractSConstraint & IntPropagator>
Implements search valued domain variables. |
class |
IntDomainVarTimePosCste
Declare a variable Y, based on a variable X and a constante c, such as Y = X * c |
class |
ViewIntDomainVarImpl
|
Methods in choco.cp.solver.variables.integer that return IntDomainVar | |
---|---|
IntDomainVar |
IntTerm.getIntDVar(int index)
|
Methods in choco.cp.solver.variables.integer with parameters of type IntDomainVar | |
---|---|
boolean |
ViewIntDomainVarImpl.canBeEqualTo(IntDomainVar x)
Checks if it can be equals to another variable. |
boolean |
IntDomainVarImpl.canBeEqualTo(IntDomainVar x)
Checks if it can be equals to another variable. |
boolean |
BooleanVarImpl.canBeEqualTo(IntDomainVar x)
Checks if it can be equals to another variable. |
boolean |
AbstractBijectiveVar.canBeEqualTo(IntDomainVar x)
|
Constructors in choco.cp.solver.variables.integer with parameters of type IntDomainVar | |
---|---|
AbstractBijectiveVar(Solver solver,
String name,
IntDomainVar variable)
Build a variable Y such as Y = X op c. |
|
AbstractIntDomain(IntDomainVar aVariable,
PropagationEngine propagationEngine)
|
|
IntDomainVarAddCste(Solver solver,
String name,
IntDomainVar variable,
int constante)
Build a variable Y such as Y = X + c. |
|
IntDomainVarTimePosCste(Solver solver,
String name,
IntDomainVar variable,
int constante)
Build a variable Y such as Y = X + c. |
Uses of IntDomainVar in choco.cp.solver.variables.set |
---|
Fields in choco.cp.solver.variables.set declared as IntDomainVar | |
---|---|
protected IntDomainVar |
SetVarImpl.card
|
Methods in choco.cp.solver.variables.set that return IntDomainVar | |
---|---|
IntDomainVar |
SetVarImpl.getCard()
|
Constructors in choco.cp.solver.variables.set with parameters of type IntDomainVar | |
---|---|
SetVarImpl(Solver solver,
String name,
int[] sortedValues,
IntDomainVar card)
|
|
SetVarImpl(Solver solver,
String name,
int[] sortedValues,
IntDomainVar card,
int type)
Constructor of a SetVar |
|
SetVarImpl(Solver solver,
String name,
int a,
int b,
IntDomainVar card)
|
|
SetVarImpl(Solver solver,
String name,
int a,
int b,
IntDomainVar card,
int type)
Constructor of SetVar |
Uses of IntDomainVar in choco.kernel.common.opres.nosum |
---|
Constructors in choco.kernel.common.opres.nosum with parameters of type IntDomainVar | |
---|---|
NoSumCell(int id,
IntDomainVar constant)
|
|
NoSumList(IntDomainVar[] candidates)
|
Uses of IntDomainVar in choco.kernel.common.util.tools |
---|
Methods in choco.kernel.common.util.tools that return IntDomainVar | |
---|---|
static IntDomainVar |
VariableUtils.createDirVar(Solver solver,
TaskVar t1,
TaskVar t2)
|
static IntDomainVar[] |
VariableUtils.getBoolDecisionVars(Solver solver)
|
static IntDomainVar[] |
VariableUtils.getDurationVars(List<TaskVar> tasks)
|
static IntDomainVar[] |
VariableUtils.getDurationVars(TaskVar... tasks)
|
static IntDomainVar[] |
VariableUtils.getEndVars(List<TaskVar> tasks)
|
static IntDomainVar[] |
VariableUtils.getEndVars(TaskVar... tasks)
|
static IntDomainVar[] |
VariableUtils.getIntVar(Solver solver,
Variable[] variables,
int begin,
int end)
|
static IntDomainVar[] |
VariableUtils.getIntVars(Solver solver)
|
static IntDomainVar[] |
VariableUtils.getStartVars(List<TaskVar> tasks)
|
static IntDomainVar[] |
VariableUtils.getStartVars(TaskVar... tasks)
|
static IntDomainVar[] |
VariableUtils.getVar(Solver solver,
IntegerVariable[] variables,
int begin,
int end)
|
Methods in choco.kernel.common.util.tools with parameters of type IntDomainVar | |
---|---|
static void |
VariableUtils.exch(int[] a,
IntDomainVar[] vs,
int i,
int j)
|
static String |
StringUtils.format(IntDomainVar iv)
|
static long |
TaskUtils.getA(IntDomainVar x,
IntDomainVar y)
|
static long |
TaskUtils.getB(IntDomainVar x,
IntDomainVar y)
|
static long |
TaskUtils.getCmax(IntDomainVar x,
IntDomainVar y)
|
static long |
TaskUtils.getCmin(IntDomainVar x,
IntDomainVar y)
|
static double |
TaskUtils.getPreserved(IntDomainVar x,
IntDomainVar y)
|
static long |
TaskUtils.getPreservedDividend(IntDomainVar x,
IntDomainVar y)
|
static long |
TaskUtils.getPreservedDivisor(IntDomainVar x,
IntDomainVar y)
|
static boolean |
TaskUtils.isEliminated(IntDomainVar usage)
|
static boolean |
TaskUtils.isOptional(IntDomainVar usage)
|
static boolean |
TaskUtils.isRegular(IntDomainVar usage)
|
static int |
VariableUtils.partition(int[] a,
IntDomainVar[] vs,
int left,
int right)
|
static void |
VariableUtils.quicksort(int[] a,
IntDomainVar[] vs,
int left,
int right)
A quickSort algorithm for sorting a table of variable according to a table of integers. |
static void |
VariableUtils.reverse(int[] tab,
IntDomainVar[] vs)
Reverse a table of integer and variables (use for api on linear combination) |
Uses of IntDomainVar in choco.kernel.model |
---|
Methods in choco.kernel.model with parameters of type IntDomainVar | |
---|---|
int |
Model.getIntVarIndex(IntDomainVar c)
Deprecated. |
Uses of IntDomainVar in choco.kernel.model.constraints.automaton.FA |
---|
Methods in choco.kernel.model.constraints.automaton.FA with parameters of type IntDomainVar | |
---|---|
static ICostAutomaton |
CostAutomaton.makeMultiResources(IAutomaton auto,
int[][][][] c,
IntDomainVar[] z)
|
static ICostAutomaton |
CostAutomaton.makeMultiResources(IAutomaton auto,
int[][][] c,
IntDomainVar[] z)
|
Uses of IntDomainVar in choco.kernel.model.constraints.automaton.penalty |
---|
Methods in choco.kernel.model.constraints.automaton.penalty with parameters of type IntDomainVar | |
---|---|
double |
NullPenaltyFunction.maxGHat(double lambda,
IntDomainVar var)
|
double |
IPenaltyFunction.maxGHat(double lambda,
IntDomainVar var)
|
double |
AbstractPenaltyFunction.maxGHat(double lambda,
IntDomainVar var)
|
double |
NullPenaltyFunction.minGHat(double lambda,
IntDomainVar var)
|
double |
IPenaltyFunction.minGHat(double lambda,
IntDomainVar var)
|
double |
AbstractPenaltyFunction.minGHat(double lambda,
IntDomainVar var)
|
Uses of IntDomainVar in choco.kernel.solver |
---|
Methods in choco.kernel.solver that return IntDomainVar | |
---|---|
IntDomainVar |
Solver.createBinTreeIntVar(String name,
int[] sortedValues)
|
IntDomainVar |
Solver.createBinTreeIntVar(String name,
int min,
int max)
|
IntDomainVar |
Solver.createBooleanVar(String name)
|
IntDomainVar |
Solver.createBoundIntVar(String name,
int min,
int max)
|
IntDomainVar |
Solver.createEnumIntVar(String name,
int[] sortedValues)
|
IntDomainVar |
Solver.createEnumIntVar(String name,
int min,
int max)
|
IntDomainVar |
Solver.createIntegerConstant(String name,
int val)
|
IntDomainVar |
Solver.createIntVar(String name,
int domainType,
int min,
int max)
|
IntDomainVar[] |
Solver.getIntDecisionVars()
get the list of decision integer variables. |
IntDomainVar |
Solver.getIntVar(int i)
Network management: Retrieve a variable by its index (all integer variables of the model are numbered in sequence from 0 on) |
IntDomainVar |
Solver.getIntVarQuick(int i)
|
IntDomainVar |
Solver.getMakespan()
Get the makespan variable if any |
IntDomainVar[] |
Solver.getVar(IntegerVariable... v)
|
IntDomainVar |
Solver.getVar(IntegerVariable v)
|
Methods in choco.kernel.solver that return types with arguments of type IntDomainVar | |
---|---|
DisposableIterator<IntDomainVar> |
Solver.getIntVarIterator()
|
Methods in choco.kernel.solver with parameters of type IntDomainVar | |
---|---|
TaskVar |
Solver.createTaskVar(String name,
IntDomainVar start,
IntDomainVar end,
IntDomainVar duration)
|
SConstraint |
Solver.eq(RealVar r,
IntDomainVar i)
|
SConstraint |
Solver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela)
|
SConstraint |
Solver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela,
int ac)
|
IntExp |
Solver.scalar(int[] lc,
IntDomainVar[] lv)
|
IntExp |
Solver.scalar(IntDomainVar[] lv,
int[] lc)
|
Method parameters in choco.kernel.solver with type arguments of type IntDomainVar | |
---|---|
void |
Solver.setValIntIterator(ValIterator<IntDomainVar> valIterator)
Sets the integer value iterator the search should use |
void |
Solver.setValIntSelector(ValSelector<IntDomainVar> valSelector)
Sets the integer value selector the search should use |
void |
Solver.setVarIntSelector(VarSelector<IntDomainVar> varSelector)
Sets the integer variable selector the search olver should use. |
Uses of IntDomainVar in choco.kernel.solver.constraints.global |
---|
Fields in choco.kernel.solver.constraints.global declared as IntDomainVar | |
---|---|
IntDomainVar[] |
MetaSConstraint.vars
|
Constructors in choco.kernel.solver.constraints.global with parameters of type IntDomainVar | |
---|---|
MetaSConstraint(SConstraint[] constraints,
TaskVar[] tasks,
IntDomainVar[] vars)
|
|
MetaSConstraint(String name,
SConstraint[] constraints,
TaskVar[] tasks,
IntDomainVar[] vars)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.global.automata.fast_multicostregular.algo |
---|
Methods in choco.kernel.solver.constraints.global.automata.fast_multicostregular.algo with parameters of type IntDomainVar | |
---|---|
boolean[] |
FastPathFinder.computeShortestAndLongestPath(gnu.trove.TIntStack removed,
IntDomainVar[] z)
|
boolean[] |
SoftPathFinder.computeShortestAndLongestPath(gnu.trove.TIntStack removed,
IntDomainVar[] y,
AbstractIntSConstraint[] tables)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.global.automata.fast_multicostregular.structure |
---|
Methods in choco.kernel.solver.constraints.global.automata.fast_multicostregular.structure with parameters of type IntDomainVar | |
---|---|
void |
StoredDirectedMultiGraph.delayedBoundUpdate(gnu.trove.TIntStack toRemove,
IntDomainVar[] z,
int... dim)
|
void |
SoftStoredMultiValuedDirectedMultiGraph.delayedBoundUpdate(gnu.trove.TIntStack toRemove,
IntDomainVar[] z,
int... dim)
|
Constructors in choco.kernel.solver.constraints.global.automata.fast_multicostregular.structure with parameters of type IntDomainVar | |
---|---|
SoftStoredMultiValuedDirectedMultiGraph(IEnvironment environment,
AbstractIntSConstraint constraint,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
int[][] layers,
int[] starts,
int[] offsets,
int supportLength,
int[][][][] costs,
IntDomainVar[] y)
|
|
StoredDirectedMultiGraph(IEnvironment environment,
AbstractIntSConstraint constraint,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
int[][] layers,
int[] starts,
int[] offsets,
int supportLength,
ICostAutomaton pi,
IntDomainVar[] z)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.global.matching |
---|
Constructors in choco.kernel.solver.constraints.global.matching with parameters of type IntDomainVar | |
---|---|
AbstractBipartiteFlow(IEnvironment environment,
IntDomainVar[] vars,
int nbLeft,
int nbRight)
Constructor for AbstractBipartiteFlow |
|
AbstractBipartiteGraph(IEnvironment environment,
IntDomainVar[] vars,
int nbLeft,
int nbRight)
Constructor |
|
AbstractBipartiteMatching(IEnvironment environment,
IntDomainVar[] vars,
int nbLeft,
int nbRight)
Builds a new instance for the specified vars. |
Uses of IntDomainVar in choco.kernel.solver.constraints.global.scheduling |
---|
Methods in choco.kernel.solver.constraints.global.scheduling that return IntDomainVar | |
---|---|
IntDomainVar |
ICapacitedResource.getCapacity()
|
IntDomainVar |
ICapacitedResource.getConsumption()
|
IntDomainVar |
ICumulativeResource.getHeight(int idx)
|
static IntDomainVar[] |
AbstractTaskSConstraint.makeIntVarArray(TaskVar[] taskvars,
IntDomainVar[] intvars,
IntDomainVar[] othervars)
|
Methods in choco.kernel.solver.constraints.global.scheduling with parameters of type IntDomainVar | |
---|---|
static IntDomainVar[] |
AbstractTaskSConstraint.makeIntVarArray(TaskVar[] taskvars,
IntDomainVar[] intvars,
IntDomainVar[] othervars)
|
static IntDomainVar[] |
AbstractTaskSConstraint.makeIntVarArray(TaskVar[] taskvars,
IntDomainVar[] intvars,
IntDomainVar[] othervars)
|
Constructors in choco.kernel.solver.constraints.global.scheduling with parameters of type IntDomainVar | |
---|---|
AbstractTaskSConstraint(TaskVar[] taskvars,
IntDomainVar[] intvars,
IntDomainVar... otherVars)
|
|
AbstractTaskSConstraint(TaskVar[] taskvars,
IntDomainVar[] intvars,
IntDomainVar... otherVars)
|
|
AbstractTaskSConstraint(TaskVar task1,
TaskVar task2,
IntDomainVar... otherVars)
Create a task constraint. |
Uses of IntDomainVar in choco.kernel.solver.constraints.integer |
---|
Fields in choco.kernel.solver.constraints.integer declared as IntDomainVar | |
---|---|
protected IntDomainVar |
AbstractUnIntSConstraint.v0
The unique variable of the constraint. |
protected IntDomainVar |
AbstractTernIntSConstraint.v0
Variables of the constraint. |
IntDomainVar |
AbstractBinIntSConstraint.v0
Variables of the constraint. |
protected IntDomainVar |
AbstractTernIntSConstraint.v1
Variables of the constraint. |
IntDomainVar |
AbstractBinIntSConstraint.v1
Variables of the constraint. |
protected IntDomainVar |
AbstractTernIntSConstraint.v2
Variables of the constraint. |
Constructors in choco.kernel.solver.constraints.integer with parameters of type IntDomainVar | |
---|---|
AbstractBinIntSConstraint(IntDomainVar x0,
IntDomainVar x1)
|
|
AbstractIntSConstraint(int priority,
IntDomainVar[] vars)
Constructs a constraint with the specified priority. |
|
AbstractLargeIntSConstraint(IntDomainVar[] vars)
|
|
AbstractLargeIntSConstraint(int priority,
IntDomainVar[] vars)
|
|
AbstractTernIntSConstraint(IntDomainVar x0,
IntDomainVar x1,
IntDomainVar x2)
Builds a ternary constraint with the specified variables. |
|
AbstractUnIntSConstraint(IntDomainVar v0)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.integer.extension |
---|
Constructors in choco.kernel.solver.constraints.integer.extension with parameters of type IntDomainVar | |
---|---|
CspBinSConstraint(IntDomainVar x,
IntDomainVar y,
BinRelation relation)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.real |
---|
Fields in choco.kernel.solver.constraints.real declared as IntDomainVar | |
---|---|
protected IntDomainVar |
AbstractBinRealIntSConstraint.v1
|
Methods in choco.kernel.solver.constraints.real that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractBinRealIntSConstraint.getIntVar(int i)
|
Constructors in choco.kernel.solver.constraints.real with parameters of type IntDomainVar | |
---|---|
AbstractBinRealIntSConstraint(RealVar v0,
IntDomainVar v1)
|
Uses of IntDomainVar in choco.kernel.solver.constraints.reified |
---|
Methods in choco.kernel.solver.constraints.reified that return IntDomainVar | |
---|---|
IntDomainVar |
INode.extractResult(Solver s)
|
IntDomainVar[] |
INode.getScope(Solver s)
Compute the set of solver variable involved in this predicat |
Methods in choco.kernel.solver.constraints.reified with parameters of type IntDomainVar | |
---|---|
void |
INode.setIndexes(IntDomainVar[] vs)
set the indexes of each variables in the leaves of the tree |
Uses of IntDomainVar in choco.kernel.solver.constraints.set |
---|
Fields in choco.kernel.solver.constraints.set declared as IntDomainVar | |
---|---|
IntDomainVar[] |
AbstractLargeSetIntSConstraint.ivars
The int variables representing the rest scope of the constraint. |
IntDomainVar |
AbstractBinSetIntSConstraint.v0
The first variable of the constraint. |
Methods in choco.kernel.solver.constraints.set that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractBinSetIntSConstraint.getIntVar(int i)
Gets the i th search valued variable. |
Constructors in choco.kernel.solver.constraints.set with parameters of type IntDomainVar | |
---|---|
AbstractBinSetIntSConstraint(IntDomainVar v0,
SetVar v1)
default constructor |
|
AbstractLargeSetIntSConstraint(IntDomainVar[] intvars,
SetVar[] setvars)
|
Uses of IntDomainVar in choco.kernel.solver.goals.choice |
---|
Fields in choco.kernel.solver.goals.choice declared as IntDomainVar | |
---|---|
protected IntDomainVar |
SetVal.var
|
protected IntDomainVar |
RemoveVal.var
|
Constructors in choco.kernel.solver.goals.choice with parameters of type IntDomainVar | |
---|---|
RemoveVal(IntDomainVar var,
int val)
|
|
SetVal(IntDomainVar var,
int val)
|
Uses of IntDomainVar in choco.kernel.solver.propagation |
---|
Fields in choco.kernel.solver.propagation declared as IntDomainVar | |
---|---|
IntDomainVar[] |
ShavingTools.vars
|
Methods in choco.kernel.solver.propagation that return IntDomainVar | |
---|---|
IntDomainVar[] |
ShavingTools.getVars()
|
Methods in choco.kernel.solver.propagation with parameters of type IntDomainVar | |
---|---|
void |
PropagationEngine.postInstInt(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post instantiation 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.postUpdateSup(IntDomainVar v,
SConstraint constraint,
boolean forceAwake)
Specific method to post modification of upper bound event |
protected void |
ShavingTools.shaveBoundVar(IntDomainVar var)
|
protected void |
ShavingTools.shaveEnumVar(IntDomainVar var)
|
protected void |
ShavingTools.shaving(IntDomainVar var,
int val)
|
Constructors in choco.kernel.solver.propagation with parameters of type IntDomainVar | |
---|---|
ShavingTools(Solver solver,
IntDomainVar[] vars)
|
Uses of IntDomainVar in choco.kernel.solver.search |
---|
Methods in choco.kernel.solver.search that return IntDomainVar | |
---|---|
IntDomainVar |
IntBranchingTrace.getBranchingIntVar()
|
IntDomainVar |
IntBranchingDecision.getBranchingIntVar()
get and cast the branching object. |
Uses of IntDomainVar in choco.kernel.solver.search.integer |
---|
Fields in choco.kernel.solver.search.integer declared as IntDomainVar | |
---|---|
IntDomainVar |
IntVarValPair.var
|
protected IntDomainVar[] |
AbstractIntVarSelector.vars
a specific array of IntVars from which the object seeks the one with smallest domain |
Methods in choco.kernel.solver.search.integer that return IntDomainVar | |
---|---|
IntDomainVar |
IntHeuristicIntVarSelector.getMinVar(AbstractIntSConstraint c)
|
IntDomainVar |
HeuristicIntVarSelector.getMinVar(AbstractIntSConstraint c)
|
IntDomainVar |
DoubleHeuristicIntVarSelector.getMinVar(AbstractIntSConstraint c)
|
IntDomainVar |
IntHeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
abstract IntDomainVar |
HeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
IntDomainVar |
DoubleHeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
IntDomainVar |
IntHeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
abstract IntDomainVar |
HeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
IntDomainVar |
DoubleHeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
IntDomainVar[] |
AbstractIntVarSelector.getVars()
Get decision vars |
IntDomainVar |
HeuristicIntVarSelector.selectVar()
|
IntDomainVar[] |
AbstractIntVarSelector.setVars(IntDomainVar[] vars)
Deprecated. |
Methods in choco.kernel.solver.search.integer that return types with arguments of type IntDomainVar | |
---|---|
List<IntDomainVar> |
IntHeuristicIntVarSelector.getAllMinVars(AbstractIntSConstraint c)
|
abstract List<IntDomainVar> |
HeuristicIntVarSelector.getAllMinVars(AbstractIntSConstraint c)
|
List<IntDomainVar> |
DoubleHeuristicIntVarSelector.getAllMinVars(AbstractIntSConstraint c)
|
List<IntDomainVar> |
IntHeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
abstract List<IntDomainVar> |
HeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
List<IntDomainVar> |
DoubleHeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
List<IntDomainVar> |
HeuristicIntVarSelector.selectTiedIntVars()
|
Methods in choco.kernel.solver.search.integer with parameters of type IntDomainVar | |
---|---|
List<IntDomainVar> |
IntHeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
abstract List<IntDomainVar> |
HeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
List<IntDomainVar> |
DoubleHeuristicIntVarSelector.getAllMinVars(IntDomainVar[] vars)
|
abstract int |
IntHeuristicIntVarSelector.getHeuristic(IntDomainVar v)
the heuristic that is minimized in order to find the best IntVar |
abstract double |
DoubleHeuristicIntVarSelector.getHeuristic(IntDomainVar v)
the heuristic that is minimized in order to find the best IntVar |
IntDomainVar |
IntHeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
abstract IntDomainVar |
HeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
IntDomainVar |
DoubleHeuristicIntVarSelector.getMinVar(IntDomainVar[] vars)
|
IntDomainVar[] |
AbstractIntVarSelector.setVars(IntDomainVar[] vars)
Deprecated. |
Method parameters in choco.kernel.solver.search.integer with type arguments of type IntDomainVar | |
---|---|
IntDomainVar |
IntHeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
abstract IntDomainVar |
HeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
IntDomainVar |
DoubleHeuristicIntVarSelector.getMinVar(List<IntDomainVar> vars)
|
Constructors in choco.kernel.solver.search.integer with parameters of type IntDomainVar | |
---|---|
AbstractIntVarSelector(Solver solver,
IntDomainVar[] vars)
|
|
DoubleHeuristicIntVarSelector(Solver solver,
IntDomainVar[] vars)
|
|
HeuristicIntVarSelector(Solver solver,
IntDomainVar[] vars)
|
|
IntHeuristicIntVarSelector(Solver solver,
IntDomainVar[] vars)
|
|
IntVarValPair(IntDomainVar var,
int val)
|
Uses of IntDomainVar in choco.kernel.solver.variables.integer |
---|
Methods in choco.kernel.solver.variables.integer with parameters of type IntDomainVar | |
---|---|
boolean |
IntDomainVar.canBeEqualTo(IntDomainVar x)
Public user API: Domains : testing whether two variables have intersecting domains. |
Uses of IntDomainVar in choco.kernel.solver.variables.scheduling |
---|
Fields in choco.kernel.solver.variables.scheduling declared as IntDomainVar | |
---|---|
protected IntDomainVar |
TaskVar.duration
|
protected IntDomainVar |
TaskVar.end
|
IntDomainVar |
AbstractRTask.height
|
protected IntDomainVar |
TaskVar.start
|
IntDomainVar |
AbstractRTask.usage
|
Methods in choco.kernel.solver.variables.scheduling that return IntDomainVar | |
---|---|
IntDomainVar |
TaskVar.duration()
|
IntDomainVar |
TaskVar.end()
|
IntDomainVar |
IRMakespan.getMakespan()
|
IntDomainVar |
TaskVar.start()
|
Constructors in choco.kernel.solver.variables.scheduling with parameters of type IntDomainVar | |
---|---|
HTask(ITask task,
IntDomainVar usage,
IStateInt estH,
IStateInt lctH)
|
|
TaskVar(Solver solver,
int id,
String name,
IntDomainVar start,
IntDomainVar end,
IntDomainVar duration)
Initializes a new variable. |
Uses of IntDomainVar in choco.kernel.solver.variables.set |
---|
Methods in choco.kernel.solver.variables.set that return IntDomainVar | |
---|---|
IntDomainVar |
SetVar.getCard()
|
Uses of IntDomainVar in choco.visu.components.chart |
---|
Methods in choco.visu.components.chart with parameters of type IntDomainVar | |
---|---|
static org.jfree.data.category.CategoryDataset |
ChocoDatasetFactory.createPackDataset(int nbBins,
IntDomainVar[] bins,
int[] sizes)
|
Uses of IntDomainVar in samples.jobshop |
---|
Constructors in samples.jobshop with parameters of type IntDomainVar | |
---|---|
SimpleDTConstraint(IntDomainVar x0,
IntDomainVar x1,
int duration0,
int duration1)
|
Uses of IntDomainVar in samples.multicostregular.asap.heuristics |
---|
Methods in samples.multicostregular.asap.heuristics that return IntDomainVar | |
---|---|
IntDomainVar |
CoverVarSelector.selectVar()
|
IntDomainVar |
ASAPVarSelector.selectVar()
|
Methods in samples.multicostregular.asap.heuristics with parameters of type IntDomainVar | |
---|---|
int |
CoverVarSelector.getBestVal(IntDomainVar x)
|
int |
ASAPValSelector.getBestVal(IntDomainVar x)
|
Constructors in samples.multicostregular.asap.heuristics with parameters of type IntDomainVar | |
---|---|
ASAPVarSelector(IntDomainVar[][] vars,
Solver solver)
|
|
CoverVarSelector(IntDomainVar[][] vars,
int[][] lowb,
Solver solver)
|
Uses of IntDomainVar in samples.multicostregular.carsequencing.heuristics |
---|
Methods in samples.multicostregular.carsequencing.heuristics that return IntDomainVar | |
---|---|
IntDomainVar |
ManInTheMiddleVarHeur.selectVar()
|
Methods in samples.multicostregular.carsequencing.heuristics with parameters of type IntDomainVar | |
---|---|
int |
MostOptionValHeur.getBestVal(IntDomainVar x)
|
int |
LeastCarValHeur.getBestVal(IntDomainVar x)
|
int |
BothValHeur.getBestVal(IntDomainVar x)
|
Constructors in samples.multicostregular.carsequencing.heuristics with parameters of type IntDomainVar | |
---|---|
ManInTheMiddleVarHeur(Solver solver,
IntDomainVar[] vars)
|
Uses of IntDomainVar in samples.multicostregular.nsp |
---|
Methods in samples.multicostregular.nsp that return IntDomainVar | |
---|---|
IntDomainVar |
NSPVarSelector.selectVar()
|
Methods in samples.multicostregular.nsp with parameters of type IntDomainVar | |
---|---|
int |
NSPVarSelector.VarCompar.compare(IntDomainVar v1,
IntDomainVar v2)
|
int |
NSPValSelector.getBestVal(IntDomainVar x)
|
Constructors in samples.multicostregular.nsp with parameters of type IntDomainVar | |
---|---|
NSPStruct(IntDomainVar[] vars,
NSPInstance instance,
IEnvironment environment)
|
Uses of IntDomainVar in samples.multicostregular.planner |
---|
Methods in samples.multicostregular.planner that return IntDomainVar | |
---|---|
IntDomainVar |
CenterVarSelec.selectVar()
|
Constructors in samples.multicostregular.planner with parameters of type IntDomainVar | |
---|---|
CenterVarSelec(Solver solver,
IntDomainVar[] vars)
|
|
SimpleChannelling(IntDomainVar x0,
IntDomainVar x1)
|
|
SubSetChannelling(IntDomainVar[] vars)
|
Uses of IntDomainVar in samples.rackconfig |
---|
Methods in samples.rackconfig with parameters of type IntDomainVar | |
---|---|
int |
RackValSelector.getBestVal(IntDomainVar x)
|
Uses of IntDomainVar in samples.tutorials.lns.lns |
---|
Methods in samples.tutorials.lns.lns that return IntDomainVar | |
---|---|
IntDomainVar |
AbstractLNSSolver.createBinTreeIntVar(String name,
int[] sortedValues)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createBinTreeIntVar(String name,
int min,
int max)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createBooleanVar(String name)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createBoundIntVar(String name,
int min,
int max)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createEnumIntVar(String name,
int[] sortedValues)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createEnumIntVar(String name,
int min,
int max)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createIntegerConstant(String name,
int val)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.createIntVar(String name,
int domainType,
int min,
int max)
Deprecated. |
IntDomainVar[] |
AbstractLNSSolver.getIntDecisionVars()
Deprecated. |
IntDomainVar |
AbstractLNSSolver.getIntVar(int i)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.getIntVarQuick(int i)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.getMakespan()
Deprecated. |
IntDomainVar[] |
AbstractLNSSolver.getVar(IntegerVariable... v)
Deprecated. |
IntDomainVar |
AbstractLNSSolver.getVar(IntegerVariable v)
Deprecated. |
Methods in samples.tutorials.lns.lns that return types with arguments of type IntDomainVar | |
---|---|
DisposableIterator<IntDomainVar> |
AbstractLNSSolver.getIntVarIterator()
Deprecated. |
Methods in samples.tutorials.lns.lns with parameters of type IntDomainVar | |
---|---|
TaskVar |
AbstractLNSSolver.createTaskVar(String name,
IntDomainVar start,
IntDomainVar end,
IntDomainVar duration)
Deprecated. |
SConstraint |
AbstractLNSSolver.eq(RealVar r,
IntDomainVar i)
Deprecated. |
SConstraint |
AbstractLNSSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela)
Deprecated. |
SConstraint |
AbstractLNSSolver.relationTupleAC(IntDomainVar[] vs,
LargeRelation rela,
int ac)
Deprecated. |
IntExp |
AbstractLNSSolver.scalar(int[] lc,
IntDomainVar[] lv)
Deprecated. |
IntExp |
AbstractLNSSolver.scalar(IntDomainVar[] lv,
int[] lc)
Deprecated. |
Method parameters in samples.tutorials.lns.lns with type arguments of type IntDomainVar | |
---|---|
void |
AbstractLNSSolver.setValIntIterator(ValIterator<IntDomainVar> valIterator)
Deprecated. |
void |
AbstractLNSSolver.setValIntSelector(ValSelector<IntDomainVar> valSelector)
Deprecated. |
void |
AbstractLNSSolver.setVarIntSelector(VarSelector<IntDomainVar> varSelector)
Deprecated. |
Uses of IntDomainVar in samples.tutorials.to_sort.socialgolfer |
---|
Methods in samples.tutorials.to_sort.socialgolfer with parameters of type IntDomainVar | |
---|---|
boolean |
ScalarAtMost.productNull(IntDomainVar v1,
IntDomainVar v2)
|
boolean |
ScalarAtMost.productOne(IntDomainVar v1,
IntDomainVar v2)
|
Constructors in samples.tutorials.to_sort.socialgolfer with parameters of type IntDomainVar | |
---|---|
ScalarAtMost(IEnvironment environment,
IntDomainVar[] vars,
int n,
int k)
|
Uses of IntDomainVar in samples.tutorials.to_sort.tsp |
---|
Fields in samples.tutorials.to_sort.tsp declared as IntDomainVar | |
---|---|
protected IntDomainVar |
MyVarSelector.objective
|
protected IntDomainVar |
MyValSelector.objective
|
protected IntDomainVar |
MinSpanningTree.objective
|
protected IntDomainVar[] |
SubTourConstraint.s
|
protected IntDomainVar[] |
MinSpanningTree.s
|
protected IntDomainVar[] |
MyVarSelector.vars
|
protected IntDomainVar[] |
MyValSelector.vars
|
Methods in samples.tutorials.to_sort.tsp that return IntDomainVar | |
---|---|
IntDomainVar |
MyVarSelector.selectVar()
|
Methods in samples.tutorials.to_sort.tsp with parameters of type IntDomainVar | |
---|---|
int |
MyValSelector.getBestVal(IntDomainVar v)
|
Constructors in samples.tutorials.to_sort.tsp with parameters of type IntDomainVar | |
---|---|
MinSpanningTree(IntDomainVar[] allVars,
int[][] dist,
IEnvironment environment)
|
|
MyValSelector(IntDomainVar objective,
IntDomainVar[] vars,
int[][] matrix,
int src,
int dest)
|
|
MyValSelector(IntDomainVar objective,
IntDomainVar[] vars,
int[][] matrix,
int src,
int dest)
|
|
MyVarSelector(IntDomainVar[] vars,
int src,
int dest)
|
|
MyVarSelector(IntDomainVar objective,
IntDomainVar[] vars,
int src,
int dest)
|
|
MyVarSelector(IntDomainVar objective,
IntDomainVar[] vars,
int src,
int dest)
|
|
SubTourConstraint(IntDomainVar[] s,
IEnvironment environment)
|
Uses of IntDomainVar in trace.visualizers |
---|
Methods in trace.visualizers with parameters of type IntDomainVar | |
---|---|
protected Writer |
Writer.arrayDvar(IntDomainVar[] vars,
int pf)
|
protected Writer |
Writer.ivar(IntDomainVar ivar,
String idx,
int pf)
|
Constructors in trace.visualizers with parameters of type IntDomainVar | |
---|---|
AllDifferent(IntDomainVar[] vars,
String display,
int width,
int height)
Build a visualizer for the allDifferent constraint |
|
AllDifferent(IntDomainVar[] vars,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the allDifferent constraint |
|
AllDifferentMatrix(IntDomainVar[][] vars,
String display,
int width,
int height)
Build a visualizer for a list of allDifferent constraints |
|
AllDifferentMatrix(IntDomainVar[][] vars,
String type,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for a list of allDifferent constraints |
|
BinaryMatrix(IntDomainVar[][] bool,
String display,
int width,
int height)
Build a visualizer for a matrix of 0/1 variables |
|
BinaryMatrix(IntDomainVar[][] bool,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for a matrix of 0/1 variables |
|
BinaryVector(IntDomainVar[] bool,
String display,
int width,
int height)
Build a visualizer for a vector of 0/1 variables |
|
BinaryVector(IntDomainVar[] bool,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for a vector of 0/1 variables |
|
BinPacking(IntDomainVar[] items,
int[] sizes,
IntDomainVar[] bins,
String display,
int width,
int height)
Build a visualizer for the bin packing constraint |
|
BinPacking(IntDomainVar[] items,
int[] sizes,
IntDomainVar[] bins,
String display,
int width,
int height)
Build a visualizer for the bin packing constraint |
|
BinPacking(IntDomainVar[] items,
int[] sizes,
IntDomainVar[] bins,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the bin packing constraint |
|
BinPacking(IntDomainVar[] items,
int[] sizes,
IntDomainVar[] bins,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the bin packing constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
int offset,
String display,
int width,
int height)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
int offset,
String display,
int width,
int height)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
int offset,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
int offset,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
String display,
int width,
int height)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
String display,
int width,
int height)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the boolean channeling constraint |
|
BoolChanneling(IntDomainVar var,
IntDomainVar[] bool,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the boolean channeling constraint |
|
Cumulative(TaskVar[] tasks,
IntDomainVar limit,
IntDomainVar end,
String display,
int width,
int height)
Build a visualizer for the cumulative constraint |
|
Cumulative(TaskVar[] tasks,
IntDomainVar limit,
IntDomainVar end,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the cumulative constraint |
|
Element(IntDomainVar index,
int[] values,
IntDomainVar value,
String display,
int width,
int height)
Build a visualizer for the element constraint |
|
Element(IntDomainVar index,
int[] values,
IntDomainVar value,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the element constraint |
|
Gcc(IntDomainVar[] vars,
int[] values,
int[] low,
int[] high,
String display,
int width,
int height)
Build a visualizer for the global cardinality constraint |
|
Gcc(IntDomainVar[] vars,
int[] values,
int[] low,
int[] high,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the global cardinality constraint |
|
Inverse(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a sepcialized visualizer for the Inverse constraint. |
|
Inverse(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a sepcialized visualizer for the Inverse constraint. |
|
Inverse(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a sepcialized visualizer for the Inverse constraint. |
|
Inverse(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a sepcialized visualizer for the Inverse constraint. |
|
LexLe(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a visualizer for the lex less constraint |
|
LexLe(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a visualizer for the lex less constraint |
|
LexLe(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the lex less constraint |
|
LexLe(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the lex less constraint |
|
LexLt(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a visualizer for the lex less than constraint |
|
LexLt(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int width,
int height)
Build a visualizer for the lex less than constraint |
|
LexLt(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the lex less than constraint |
|
LexLt(IntDomainVar[] X,
IntDomainVar[] Y,
String display,
int x,
int y,
int width,
int height,
String group,
int min,
int max)
Build a visualizer for the lex less than constraint |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |