Uses of Interface
org.chocosolver.solver.variables.IntVar
-
-
Uses of IntVar in org.chocosolver.sat
Methods in org.chocosolver.sat with parameters of type IntVar Modifier and Type Method Description intPropNogoods. Literal(IntVar ivar, int value, boolean eq)Creates or returns if already existing, the literal corresponding to :booleanPropNogoods. why(RuleStore ruleStore, IntVar ivar, IEventType evt, int ivalue)booleanPropSat. why(RuleStore ruleStore, IntVar bvar, IEventType evt, int bvalue) -
Uses of IntVar in org.chocosolver.solver
Methods in org.chocosolver.solver that return IntVar Modifier and Type Method Description IntVar[]Model. retrieveIntVars(boolean includeBoolVar)Iterate over the variable ofthisand build an array that contains all theIntVarof the model.Methods in org.chocosolver.solver that return types with arguments of type IntVar Modifier and Type Method Description gnu.trove.map.hash.TIntObjectHashMap<IntVar>Model. getCachedConstants()Get the map of constant IntVar the have default names to avoid creating multiple identical constants.Methods in org.chocosolver.solver with parameters of type IntVar Modifier and Type Method Description intSolution. getIntVal(IntVar v)Get the value of variable v in this solution.voidSolution. setIntVal(IntVar var, int val)Set the value of variable v in this solution.default booleanICause. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Add new rules to the rule store -
Uses of IntVar in org.chocosolver.solver.constraints
Methods in org.chocosolver.solver.constraints with parameters of type IntVar Modifier and Type Method Description default ConstraintIIntConstraintFactory. absolute(IntVar var1, IntVar var2)Creates an absolute value constraint: var1 = |var2|default ConstraintIIntConstraintFactory. allDifferent(IntVar... vars)Creates an allDifferent constraint.default ConstraintIIntConstraintFactory. allDifferent(IntVar[] vars, String CONSISTENCY)Creates an allDifferent constraint.default ConstraintIIntConstraintFactory. allDifferentExcept0(IntVar[] vars)Creates an allDifferent constraint for variables that are not equal to 0.default ConstraintIIntConstraintFactory. allDifferentUnderCondition(IntVar[] vars, Condition condition, boolean singleCondition)Creates an allDifferent constraint subject to the given condition.default ConstraintIIntConstraintFactory. allEqual(IntVar... vars)Creates an allEqual constraint.default ConstraintIIntConstraintFactory. among(IntVar nbVar, IntVar[] vars, int[] values)Creates an among constraint.default ConstraintIIntConstraintFactory. arithm(IntVar var, String op, int cste)Creates an arithmetic constraint : var op cste, where op in {"=", "!default ConstraintIIntConstraintFactory. arithm(IntVar var1, String op, IntVar var2)Creates an arithmetic constraint: var1 op var2, where op in {"=", "!default ConstraintIIntConstraintFactory. arithm(IntVar var1, String op1, IntVar var2, String op2, int cste)Creates an arithmetic constraint : var1 op var2, where op in {"=", "!default ConstraintIIntConstraintFactory. arithm(IntVar var1, String op1, IntVar var2, String op2, IntVar var3)Creates an arithmetic constraint: var1 op1 var2 op2 var3, where op1 and op2 in {"=", "!default ConstraintIIntConstraintFactory. atLeastNValues(IntVar[] vars, IntVar nValues, boolean AC)Creates an atLeastNValue constraint.default ConstraintIIntConstraintFactory. atMostNValues(IntVar[] vars, IntVar nValues, boolean STRONG)Creates an atMostNValue constraint.default ConstraintIIntConstraintFactory. binPacking(IntVar[] itemBin, int[] itemSize, IntVar[] binLoad, int offset)Creates a BinPacking constraint.default ConstraintIIntConstraintFactory. bitsIntChanneling(BoolVar[] bits, IntVar var)Creates an channeling constraint between an integer variable and a set of bit variables.default ConstraintIIntConstraintFactory. boolsIntChanneling(BoolVar[] bVars, IntVar var, int offset)Creates an channeling constraint between an integer variable and a set of boolean variables.default ConstraintIIntConstraintFactory. circuit(IntVar[] vars)Creates a circuit constraint which ensures thatdefault ConstraintIIntConstraintFactory. circuit(IntVar[] vars, int offset)Creates a circuit constraint which ensures thatdefault ConstraintIIntConstraintFactory. circuit(IntVar[] vars, int offset, CircuitConf conf)Creates a circuit constraint which ensures thatdefault ConstraintIIntConstraintFactory. clausesIntChanneling(IntVar var, BoolVar[] eVars, BoolVar[] lVars)Creates an channeling constraint between an integer variable and a set of clauses.default ConstraintIIntConstraintFactory. costRegular(IntVar[] vars, IntVar cost, ICostAutomaton costAutomaton)Creates a regular constraint that supports a cost function.default ConstraintIIntConstraintFactory. count(int value, IntVar[] vars, IntVar limit)Creates a count constraint.default ConstraintIIntConstraintFactory. count(IntVar value, IntVar[] vars, IntVar limit)Creates a count constraint.default voidIIntConstraintFactory. cumulative(IntVar[] starts, int[] durations, int[] heights, int capacity)Creates and posts a decomposition of a cumulative constraint: Enforces that at each point in time, the cumulated height of the set of tasks that overlap that point does not exceed a given limit.default ConstraintIIntConstraintFactory. cumulative(Task[] tasks, IntVar[] heights, IntVar capacity)Creates a cumulative constraint: Enforces that at each point in time, the cumulated height of the set of tasks that overlap that point does not exceed a given limit.default ConstraintIIntConstraintFactory. cumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean incremental)Creates a cumulative constraint: Enforces that at each point in time, the cumulated height of the set of tasks that overlap that point does not exceed a given limit.default ConstraintIIntConstraintFactory. cumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean incremental, Cumulative.Filter... filters)Creates a cumulative constraint: Enforces that at each point in time, the cumulated height of the set of tasks that overlap that point does not exceed a given limit.default ConstraintIIntConstraintFactory. cumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean incremental, CumulFilter... filters)Creates a cumulative constraint: Enforces that at each point in time, the cumulated height of the set of tasks that overlap that point does not exceed a given limit.default ConstraintIIntConstraintFactory. diffN(IntVar[] X, IntVar[] Y, IntVar[] width, IntVar[] height, boolean addCumulativeReasoning)Creates a diffN constraint.default ConstraintIIntConstraintFactory. distance(IntVar var1, IntVar var2, String op, int cste)Creates a distance constraint : |var1-var2| op cste
where op can take its value among {"=", ">", "<", "!default ConstraintIIntConstraintFactory. distance(IntVar var1, IntVar var2, String op, IntVar var3)Creates a distance constraint: |var1-var2| op var3
where op can take its value among {"=", ">", "<"}default ConstraintIIntConstraintFactory. div(IntVar dividend, IntVar divisor, IntVar result)Creates an euclidean division constraint.default ConstraintIIntConstraintFactory. element(IntVar value, int[] table, IntVar index)Creates an element constraint: value = table[index]default ConstraintIIntConstraintFactory. element(IntVar value, int[] table, IntVar index, int offset)Creates an element constraint: value = table[index-offset]default ConstraintIIntConstraintFactory. element(IntVar value, IntVar[] table, IntVar index, int offset)Creates a element constraint: value = table[index-offset] where table is an array of variables.default ConstraintISetConstraintFactory. element(IntVar index, SetVar[] sets, int offset, SetVar set)Creates a constraint enabling to retrieve an element set in sets: sets[index-offset] = setdefault ConstraintISetConstraintFactory. element(IntVar index, SetVar[] sets, SetVar set)Creates a constraint enabling to retrieve an element set in sets: sets[index] = setdefault int[]IIntConstraintFactory. getDomainUnion(IntVar... vars)Get the list of values in the domains of varsdefault ConstraintIIntConstraintFactory. globalCardinality(IntVar[] vars, int[] values, IntVar[] occurrences, boolean closed)Creates a global cardinality constraint (GCC): Each value values[i] should be taken by exactly occurrences[i] variables of vars.default ConstraintIIntConstraintFactory. intValuePrecedeChain(IntVar[] X, int[] V)Creates an intValuePrecedeChain constraint.default ConstraintIIntConstraintFactory. intValuePrecedeChain(IntVar[] X, int S, int T)Creates an intValuePrecedeChain constraint.default ConstraintIIntConstraintFactory. inverseChanneling(IntVar[] vars1, IntVar[] vars2)Creates an inverse channeling between vars1 and vars2: vars1[i] = j <=> vars2[j] = i Performs AC if domains are enumerated.default ConstraintIIntConstraintFactory. inverseChanneling(IntVar[] vars1, IntVar[] vars2, int offset1, int offset2)Creates an inverse channeling between vars1 and vars2: vars1[i-offset2] = j <=> vars2[j-offset1] = i Performs AC if domains are enumerated.default ConstraintIIntConstraintFactory. keySort(IntVar[][] vars, IntVar[] PERMvars, IntVar[][] SORTEDvars, int K)Creates a keySort constraint which ensures that the variables of SORTEDvars correspond to the variables of vars according to a permutation stored in PERMvars (optional, can be null).default ConstraintIIntConstraintFactory. knapsack(IntVar[] occurrences, IntVar weightSum, IntVar energySum, int[] weight, int[] energy)Creates a knapsack constraint.default ConstraintIIntConstraintFactory. lexChainLess(IntVar[]... vars)Creates a lexChainLess constraint.default ConstraintIIntConstraintFactory. lexChainLessEq(IntVar[]... vars)Creates a lexChainLessEq constraint.default ConstraintIIntConstraintFactory. lexLess(IntVar[] vars1, IntVar[] vars2)Creates a lexLess constraint.default ConstraintIIntConstraintFactory. lexLessEq(IntVar[] vars1, IntVar[] vars2)Creates a lexLessEq constraint.default ConstraintIIntConstraintFactory. max(IntVar max, IntVar[] vars)Creates a maximum constraint.default ConstraintIIntConstraintFactory. max(IntVar max, IntVar var1, IntVar var2)Creates a maximum constraint : max = max(var1, var2) (Bound Consistency)default ConstraintISetConstraintFactory. max(SetVar indices, int[] weights, int offset, IntVar maxElementValue, boolean notEmpty)Creates a constraint over the maximum element induces by a set: max{weights[i-offset] | i in indices} = maxElementValuedefault ConstraintISetConstraintFactory. max(SetVar set, IntVar maxElementValue, boolean notEmpty)Creates a constraint over the maximum element in a set: max{i | i in set} = maxElementValuedefault ConstraintIIntConstraintFactory. mddc(IntVar[] vars, MultivaluedDecisionDiagram MDD)Create a constraint where solutions (tuples) are encoded by a multi-valued decision diagram.default ConstraintIIntConstraintFactory. member(IntVar var, int[] table)Creates a member constraint.default ConstraintIIntConstraintFactory. member(IntVar var, int lb, int ub)Creates a member constraint.default ConstraintISetConstraintFactory. member(IntVar intVar, SetVar set)Creates a member constraint stating that the value of intVar is in setdefault ConstraintIIntConstraintFactory. min(IntVar min, IntVar[] vars)Creates a minimum constraint.default ConstraintIIntConstraintFactory. min(IntVar min, IntVar var1, IntVar var2)Creates a minimum constraint: min = min(var1, var2) (Bound Consistency)default ConstraintISetConstraintFactory. min(SetVar indices, int[] weights, int offset, IntVar minElementValue, boolean notEmpty)Creates a constraint over the minimum element induces by a set: min{weights[i-offset] | i in indices} = minElementValuedefault ConstraintISetConstraintFactory. min(SetVar set, IntVar minElementValue, boolean notEmpty)Creates a constraint over the minimum element in a set: min{i | i in set} = minElementValuedefault ConstraintIIntConstraintFactory. mod(IntVar X, IntVar Y, IntVar Z)Creates a modulo constraint.default ConstraintIIntConstraintFactory. multiCostRegular(IntVar[] vars, IntVar[] costVars, ICostAutomaton costAutomaton)Creates a regular constraint that supports a multiple cost function.default ConstraintIIntConstraintFactory. multiCostRegular(IntVar[] vars, IntVar[] costVars, ICostAutomaton costAutomaton, double precision)Creates a regular constraint that supports a multiple cost function.default ConstraintISetConstraintFactory. nbEmpty(SetVar[] sets, IntVar nbEmpty)Creates a constraint counting the number of empty sets sets |{s in sets where |s|=0}| = nbEmptydefault ConstraintIIntConstraintFactory. notAllEqual(IntVar... vars)Creates a notAllEqual constraint.default ConstraintIIntConstraintFactory. notMember(IntVar var, int[] table)Creates a notMember constraint.default ConstraintIIntConstraintFactory. notMember(IntVar var, int lb, int ub)Creates a notMember constraint.default ConstraintISetConstraintFactory. notMember(IntVar intVar, SetVar set)Creates a member constraint stating that the value of intVar is not in setdefault ConstraintIIntConstraintFactory. nValues(IntVar[] vars, IntVar nValues)Creates an nValue constraint.default ConstraintIIntConstraintFactory. path(IntVar[] vars, IntVar start, IntVar end)Creates a path constraint which ensures thatdefault ConstraintIIntConstraintFactory. path(IntVar[] vars, IntVar start, IntVar end, int offset)Creates a path constraint which ensures thatdefault ConstraintIIntConstraintFactory. regular(IntVar[] vars, IAutomaton automaton)Creates a regular constraint.default voidIReificationFactory. reifyXeqC(IntVar X, int C, BoolVar B)Posts one constraint that expresses : (x = c) ⇔ b.default voidIReificationFactory. reifyXeqY(IntVar X, IntVar Y, BoolVar B)Posts one constraint that expresses : (x = y) ⇔ b.default voidIReificationFactory. reifyXgtC(IntVar X, int C, BoolVar B)Posts one constraint that expresses : (x > c) ⇔ b.default voidIReificationFactory. reifyXinS(IntVar X, IntIterableRangeSet S, BoolVar B)Posts one constraint that expresses : (X ∈ S) ⇔ B.default voidIReificationFactory. reifyXleY(IntVar X, IntVar Y, BoolVar B)Posts one constraint that expresses : (x ≤ y) ⇔ b.default voidIReificationFactory. reifyXltC(IntVar X, int C, BoolVar B)Posts one constraint that expresses : (x < c) ⇔ b.default voidIReificationFactory. reifyXltY(IntVar X, IntVar Y, BoolVar B)Posts one constraint that expresses : (x < y) ⇔ b.default voidIReificationFactory. reifyXltYC(IntVar X, IntVar Y, int C, BoolVar B)Posts one constraint that expresses : (x < y + c) ⇔ b.default voidIReificationFactory. reifyXneC(IntVar X, int C, BoolVar B)Posts one constraint that expresses : (x ≠ c) ⇔ b.default voidIReificationFactory. reifyXneY(IntVar X, IntVar Y, BoolVar B)Posts one constraint that expresses : (x ≠ y) ⇔ b.default ConstraintIIntConstraintFactory. scalar(IntVar[] vars, int[] coeffs, String operator, int scalar)Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalardefault ConstraintIIntConstraintFactory. scalar(IntVar[] vars, int[] coeffs, String operator, int scalar, int minCardForDecomp)Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalardefault ConstraintIIntConstraintFactory. scalar(IntVar[] vars, int[] coeffs, String operator, IntVar scalar)Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalardefault ConstraintIIntConstraintFactory. scalar(IntVar[] vars, int[] coeffs, String operator, IntVar scalar, int minCardForDecomp)Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalardefault ConstraintISetConstraintFactory. setsIntsChanneling(SetVar[] sets, IntVar[] ints)Creates a constraint channeling set variables and integer variables : x in sets[y] <=> ints[x] = ydefault ConstraintISetConstraintFactory. setsIntsChanneling(SetVar[] sets, IntVar[] ints, int offset1, int offset2)Creates a constraint channeling set variables and integer variables : x in sets[y-offset1] <=> ints[x-offset2] = ydefault ConstraintIIntConstraintFactory. sort(IntVar[] vars, IntVar[] sortedVars)Creates a sort constraint which ensures that the variables of sortedVars correspond to the variables of vars according to a permutation.default ConstraintIIntConstraintFactory. square(IntVar var1, IntVar var2)Creates a square constraint: var1 = var2^2default ConstraintIIntConstraintFactory. subCircuit(IntVar[] vars, int offset, IntVar subCircuitLength)Creates a subCircuit constraint which ensures thatdefault ConstraintIIntConstraintFactory. subPath(IntVar[] vars, IntVar start, IntVar end, int offset, IntVar SIZE)Creates a subPath constraint which ensures thatdefault ConstraintIIntConstraintFactory. sum(BoolVar[] vars, String operator, IntVar sum)Creates a sum constraint.default ConstraintIIntConstraintFactory. sum(BoolVar[] vars, String operator, IntVar sum, int minCardForDecomp)Creates a sum constraint.default ConstraintIIntConstraintFactory. sum(IntVar[] vars, String operator, int sum)Creates a sum constraint.default ConstraintIIntConstraintFactory. sum(IntVar[] vars, String operator, int sum, int minCardForDecomp)Creates a sum constraint.default ConstraintIIntConstraintFactory. sum(IntVar[] vars, String operator, IntVar sum)Creates a sum constraint.default ConstraintIIntConstraintFactory. sum(IntVar[] vars, String operator, IntVar sum, int minCardForDecomp)Creates a sum constraint.default ConstraintISetConstraintFactory. sum(SetVar set, IntVar sum)Creates a constraint summing elements of set sum{i | i in set} = sumdefault ConstraintISetConstraintFactory. sumElements(SetVar indices, int[] weights, int offset, IntVar sum)Creates a constraint summing weights given by a set of indices: sum{weights[i-offset] | i in indices} = sum Also ensures that elements in indices belong to [offset, offset+weights.length-1]default ConstraintISetConstraintFactory. sumElements(SetVar indices, int[] weights, IntVar sum)Creates a constraint summing weights given by a set of indices: sum{weights[i] | i in indices} = sum Also ensures that elements in indices belong to [0, weights.length-1]default ConstraintIIntConstraintFactory. table(IntVar[] vars, Tuples tuples)Creates a table constraint specifying that the sequence of variables vars must belong to the list of tuples (or must NOT belong in case of infeasible tuples) Default configuration with GACSTR+ algorithm for feasible tuples and GAC3rm otherwisedefault ConstraintIIntConstraintFactory. table(IntVar[] vars, Tuples tuples, String algo)Creates a table constraint, with the specified algorithm defined algodefault ConstraintIIntConstraintFactory. table(IntVar var1, IntVar var2, Tuples tuples)Create a table constraint over a couple of variables var1 and var2 Uses AC3rm algorithm by defaultdefault ConstraintIIntConstraintFactory. table(IntVar var1, IntVar var2, Tuples tuples, String algo)Creates a table constraint over a couple of variables var1 and var2:
- AC2001: table constraint which applies the AC2001 algorithm,
- AC3: table constraint which applies the AC3 algorithm,
- AC3rm: table constraint which applies the AC3 rm algorithm,
- AC3bit+rm (default): table constraint which applies the AC3 bit+rm algorithm,
- FC: table constraint which applies forward checking algorithm.default ConstraintIIntConstraintFactory. times(IntVar X, int Y, IntVar Z)Creates a multiplication constraint: X * Y = Zdefault ConstraintIIntConstraintFactory. times(IntVar X, IntVar Y, int Z)Creates a multiplication constraint: X * Y = Zdefault ConstraintIIntConstraintFactory. times(IntVar X, IntVar Y, IntVar Z)Creates a multiplication constraint: X * Y = Zdefault ConstraintIIntConstraintFactory. tree(IntVar[] succs, IntVar nbTrees)Creates a tree constraint.default ConstraintIIntConstraintFactory. tree(IntVar[] succs, IntVar nbTrees, int offset)Creates a tree constraint.default ConstraintISetConstraintFactory. union(IntVar[] ints, SetVar union)Creates a constraint ensuring that union is exactly the union of values taken by ints,booleanPropagator. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints with parameters of type IntVar Constructor Description Arithmetic(String name, IntVar[] vars, Operator op1, Operator op2, int cste, Propagator prop) -
Uses of IntVar in org.chocosolver.solver.constraints.binary
Methods in org.chocosolver.solver.constraints.binary that return IntVar Modifier and Type Method Description default IntVar[]IDecompositionFactory. regularDec(IntVar[] vars, IAutomaton automaton)Creates and posts a decomposition of a regular constraint.Methods in org.chocosolver.solver.constraints.binary with parameters of type IntVar Modifier and Type Method Description default voidIDecompositionFactory. cumulativeTimeDecomp(IntVar[] starts, int[] durations, int[] heights, int capacity)Creates and posts a decomposition of a cumulative constraint: associates a boolean variable to each task and each point of time sich that the scalar product of boolean variables per heights for each time never exceed capacity.voidPropDistanceXYC. filterFromVarToVar(IntVar var1, IntVar var2)Initial propagation in case of EQ and enumerated domainsvoidPropDistanceXYC. filterGTonVar(IntVar v0, IntVar v1)In case of a GT, due to a modification on v0 domainvoidPropDistanceXYC. filterLTonVar(IntVar v0, IntVar v1)In case of a LT, due to a modification on v0 domainvoidPropDistanceXYC. filterOnInf(IntVar v0, IntVar v1)In case of a EQ, due to a modification of the lower bound of v0voidPropDistanceXYC. filterOnInst(IntVar v, int val)In case of a EQ, due to the instantion to one variable to valvoidPropDistanceXYC. filterOnSup(IntVar v0, IntVar v1)In case of a EQ, due to a modification of the upper bound of v0default IntVar[]IDecompositionFactory. regularDec(IntVar[] vars, IAutomaton automaton)Creates and posts a decomposition of a regular constraint.booleanPropAbsolute. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropDistanceXYC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropEqualX_Y. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropEqualX_YC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropEqualXY_C. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropGreaterOrEqualX_Y. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropGreaterOrEqualX_YC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropGreaterOrEqualXY_C. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropLessOrEqualXY_C. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotEqualX_Y. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotEqualX_YC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotEqualXY_C. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropSquare. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.binary with parameters of type IntVar Constructor Description PropAbsolute(IntVar X, IntVar Y)PropDistanceXYC(IntVar[] vars, Operator operator, int cste)PropEqualX_Y(IntVar x, IntVar y)PropEqualX_YC(IntVar[] vars, int c)PropEqualXY_C(IntVar[] vars, int c)PropGreaterOrEqualX_Y(IntVar[] vars)PropGreaterOrEqualX_YC(IntVar[] vars, int c)PropGreaterOrEqualXY_C(IntVar[] vars, int c)PropLessOrEqualXY_C(IntVar[] vars, int c)PropNotEqualX_Y(IntVar x, IntVar y)PropNotEqualX_YC(IntVar[] vars, int c)PropNotEqualXY_C(IntVar[] vars, int c)PropScale(IntVar x, int y, IntVar z)Scale propagator : ensures x * y = zPropSquare(IntVar X, IntVar Y) -
Uses of IntVar in org.chocosolver.solver.constraints.binary.element
Methods in org.chocosolver.solver.constraints.binary.element with parameters of type IntVar Modifier and Type Method Description static ConstraintElementFactory. detect(IntVar VALUE, int[] TABLE, IntVar INDEX, int OFFSET)Detect and return the most adapted Element propagator wrt to the values in TABLEbooleanPropElement. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.binary.element with parameters of type IntVar Constructor Description PropElement(IntVar value, int[] values, IntVar index, int offset)Create a propagator which ensures that VALUE = TABLE[INDEX-OFFSET] holds. -
Uses of IntVar in org.chocosolver.solver.constraints.extension
Methods in org.chocosolver.solver.constraints.extension with parameters of type IntVar Modifier and Type Method Description static TuplesTuplesFactory. absolute(IntVar VAR1, IntVar VAR2)Generate valid tuples for absolute constraint: VAR1 = |VAR2|static TuplesTuplesFactory. allDifferent(IntVar... VARS)Generate valid tuples for allDifferent constraintstatic TuplesTuplesFactory. allEquals(IntVar... VARS)Generate valid tuples for allEquals constraintstatic TuplesTuplesFactory. arithm(IntVar VAR1, String OP, IntVar VAR2)Generate valid tuples for VAR1 OP VAR2, where OP in {"=", "!static booleanTuplesFactory. canBeTupled(IntVar... VARS)Check whether the intension constraint to extension constraint substitution is enabled and can be achievedESatTuples. check(IntVar... vars)Checks entailment of a table constraint over vars with this Tuples objectstatic TuplesTuplesFactory. element(IntVar VALUE, int[] TABLE, IntVar INDEX, int OFFSET)Generate valid tuples for an element constraint : TABLE[INDEX-OFFSET] = VALUEstatic TuplesTuplesFactory. eucl_div(IntVar DIVIDEND, IntVar DIVISOR, IntVar RESULT)Generate valid tuples for euclidean division constraint: DIVIDEND / DIVISOR = RESULT, rounding towards 0static TuplesTuplesFactory. generateTuples(TupleValidator filter, boolean feasible, IntVar... vars)A method that generates all tuples from a set of variables and stores (and returns) the valid tuples wrt to thefilter.static TuplesTuplesFactory. lex_chain_less(IntVar... VARS)Generate valid tuples for lexChainLess constraintstatic TuplesTuplesFactory. lex_chain_less_eq(IntVar... VARS)Generate valid tuples for lexChainLessEq constraintstatic TuplesTuplesFactory. maximum(IntVar VAR1, IntVar VAR2, IntVar MAX)Generate valid tuples for minus constraint: MAX = max(VAR1,VAR2)static TuplesTuplesFactory. minimum(IntVar VAR1, IntVar VAR2, IntVar MIN)Generate valid tuples for minimum constraint: MIN = min(VAR1,VAR2)static TuplesTuplesFactory. minus(IntVar VAR1, IntVar VAR2, IntVar RESULT)Generate valid tuples for minus constraint: VAR1 - VAR2 = RESULTstatic TuplesTuplesFactory. modulo(IntVar VAR1, IntVar VAR2, IntVar MOD)Generate valid tuples for minimum constraint: VAR1 % VAR2 = MODstatic TuplesTuplesFactory. plus(IntVar VAR1, IntVar VAR2, IntVar RESULT)Generate valid tuples for plus constraint: VAR1 + VAR2 = RESULTstatic TuplesTuplesFactory. power(IntVar VAR1, IntVar VAR2, int POWER)Generate valid tuples for absolute constraint: VAR1 = VAR2^POWERstatic TuplesTuplesFactory. scalar(IntVar[] VARS, int[] COEFFS, String OPERATOR, IntVar SCALAR, int SCALAR_COEFF, int CSTE)Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALAR + CSTE with OPERATOR in {"=", "!static TuplesTuplesFactory. scalar(IntVar[] VARS, int[] COEFFS, IntVar SCALAR, int SCALAR_COEFF)Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALARstatic TuplesTuplesFactory. square(IntVar VAR1, IntVar VAR2)Generate valid tuples for absolute constraint: VAR1 = VAR2^2static TuplesTuplesFactory. sum(IntVar[] VARS, String OPERATOR, IntVar SUM, int CSTE)Generate valid tuples for ∑i in |VARS|VARSi OPERATOR SUM + CSTE with OPERATOR in {"=", "!static TuplesTuplesFactory. times(IntVar VAR1, IntVar VAR2, IntVar RESULT)Generate valid tuples for times constraint: VAR1 * VAR2 = RESULT -
Uses of IntVar in org.chocosolver.solver.constraints.extension.binary
Fields in org.chocosolver.solver.constraints.extension.binary declared as IntVar Modifier and Type Field Description protected IntVarPropBinCSP. v0protected IntVarPropBinCSP. v1Methods in org.chocosolver.solver.constraints.extension.binary with parameters of type IntVar Modifier and Type Method Description booleanPropBinAC3bitrm. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.extension.binary with parameters of type IntVar Constructor Description PropBinAC2001(IntVar x, IntVar y, Tuples tuples)PropBinAC3(IntVar x, IntVar y, Tuples tuples)PropBinAC3bitrm(IntVar x, IntVar y, Tuples tuples)PropBinAC3rm(IntVar x, IntVar y, Tuples tuples)PropBinCSP(IntVar x, IntVar y, BinRelation relation)PropBinFC(IntVar x, IntVar y, Tuples tuples) -
Uses of IntVar in org.chocosolver.solver.constraints.extension.nary
Fields in org.chocosolver.solver.constraints.extension.nary declared as IntVar Modifier and Type Field Description protected IntVar[]ValidityChecker. varsMethods in org.chocosolver.solver.constraints.extension.nary with parameters of type IntVar Modifier and Type Method Description protected booleanLargeRelation. valid(int[] tuple, IntVar[] vars)Constructors in org.chocosolver.solver.constraints.extension.nary with parameters of type IntVar Constructor Description FastBooleanValidityChecker(int arity, IntVar[] vars)PropCompactTable(IntVar[] vars, Tuples tuples)Create a propagator for table constraint Only for feasible TuplesPropCompactTableStar(IntVar[] vars, Tuples tuples)Create a propagator for table constraint Only for feasible TuplesPropLargeCSP(IntVar[] vars, R relation)PropLargeFC(IntVar[] vars, Tuples tuples)PropLargeGAC2001(IntVar[] vs, Tuples tuples)PropLargeGAC2001Positive(IntVar[] vs, Tuples tuples)PropLargeGAC3rm(IntVar[] vs, Tuples tuples)PropLargeGAC3rmPositive(IntVar[] vars, Tuples tuples)PropLargeGACSTRPos(IntVar[] vs, Tuples tuples)PropLargeMDDC(MultivaluedDecisionDiagram MDD, IntVar... VARS)Create a propagator maintaining GAC based on a MDD.PropTableStr2(IntVar[] vars_, Tuples tuplesObject)TuplesLargeTable(Tuples tuples, IntVar[] vars)TuplesList(Tuples tuples, IntVar[] vars)TuplesTable(Tuples tuples, IntVar[] vars)TuplesVeryLargeTable(Tuples tuples, IntVar[] vars)ValidityChecker(int ari, IntVar[] vars) -
Uses of IntVar in org.chocosolver.solver.constraints.nary
Methods in org.chocosolver.solver.constraints.nary with parameters of type IntVar Modifier and Type Method Description booleanPropKnapsack. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary with parameters of type IntVar Constructor Description PropDiffN(IntVar[] x, IntVar[] y, IntVar[] dx, IntVar[] dy, boolean fast)PropIntValuePrecedeChain(IntVar[] vars, int s, int t)PropKLoops(IntVar[] succs, int offSet, IntVar nbLoops)Incremental propagator which restricts the number of loops: |{succs[i]=i+offSet}| = nbLoopsPropKnapsack(IntVar[] itemOccurence, IntVar capacity, IntVar power, int[] weight, int[] energy) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.alldifferent
Methods in org.chocosolver.solver.constraints.nary.alldifferent with parameters of type IntVar Modifier and Type Method Description booleanPropAllDiffBC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropAllDiffInst. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary.alldifferent with parameters of type IntVar Constructor Description AllDifferent(IntVar[] vars, String type)PropAllDiffAC(IntVar[] variables)AllDifferent constraint for integer variables enables to control the cardinality of the matchingPropAllDiffAdaptative(IntVar[] variables)AllDifferent constraint for integer variables enables to control the cardinality of the matchingPropAllDiffBC(IntVar[] variables)PropAllDiffInst(IntVar[] variables)AllDifferent constraint for integer variables enables to control the cardinality of the matching -
Uses of IntVar in org.chocosolver.solver.constraints.nary.alldifferent.algo
Methods in org.chocosolver.solver.constraints.nary.alldifferent.algo with parameters of type IntVar Modifier and Type Method Description voidAlgoAllDiffBC. reset(IntVar[] variables)Constructors in org.chocosolver.solver.constraints.nary.alldifferent.algo with parameters of type IntVar Constructor Description AlgoAllDiffAC(IntVar[] variables, ICause cause) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.alldifferent.conditions
Methods in org.chocosolver.solver.constraints.nary.alldifferent.conditions with parameters of type IntVar Modifier and Type Method Description booleanCondition. holdOnVar(IntVar x)Constructors in org.chocosolver.solver.constraints.nary.alldifferent.conditions with parameters of type IntVar Constructor Description PropCondAllDiff_AC(IntVar[] variables, Condition condition)AllDifferent constraint for integer variables Holds only on the subset of variables satisfying the given conditionPropCondAllDiffInst(IntVar[] variables, Condition c, boolean mode)ConditionnalAllDifferent constraint for integer variables enables to control the cardinality of the matching IF mode for all X in vars, condition(X) => X ! -
Uses of IntVar in org.chocosolver.solver.constraints.nary.among
Constructors in org.chocosolver.solver.constraints.nary.among with parameters of type IntVar Constructor Description PropAmongGAC(IntVar[] variables, int[] values)Creates a propagator for Among: Counts the number of decision variables which take a value in the input value set -
Uses of IntVar in org.chocosolver.solver.constraints.nary.automata
Fields in org.chocosolver.solver.constraints.nary.automata with type parameters of type IntVar Modifier and Type Field Description gnu.trove.map.hash.TObjectIntHashMap<IntVar>PropMultiCostRegular. mapMap to retrieve rapidly the index of a given variable.Constructors in org.chocosolver.solver.constraints.nary.automata with parameters of type IntVar Constructor Description CostRegular(IntVar[] ivars, IntVar cost, ICostAutomaton cautomaton)PropCostRegular(IntVar[] variables, ICostAutomaton cautomaton, StoredValuedDirectedMultiGraph graph)PropMultiCostRegular(IntVar[] variables, IntVar[] costvariables, ICostAutomaton cauto, double precision)Constructs a multi-cost-regular propagatorPropRegular(IntVar[] variables, IAutomaton automaton) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.automata.FA
Methods in org.chocosolver.solver.constraints.nary.automata.FA with parameters of type IntVar Modifier and Type Method Description static ICostAutomatonCostAutomaton. makeMultiResources(IAutomaton auto, int[][][][] c, IntVar[] z)static ICostAutomatonCostAutomaton. makeMultiResources(IAutomaton auto, int[][][] c, IntVar[] z) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.automata.structure.costregular
Method parameters in org.chocosolver.solver.constraints.nary.automata.structure.costregular with type arguments of type IntVar Modifier and Type Method Description voidStoredValuedDirectedMultiGraph. removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator, ICause aCause)voidStoredValuedDirectedMultiGraph. updateLeft(int nid, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator)voidStoredValuedDirectedMultiGraph. updateRight(int nid, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.automata.structure.multicostregular
Methods in org.chocosolver.solver.constraints.nary.automata.structure.multicostregular with parameters of type IntVar Modifier and Type Method Description boolean[]FastPathFinder. computeShortestAndLongestPath(gnu.trove.stack.TIntStack removed, IntVar[] z, PropMultiCostRegular propagator)voidStoredDirectedMultiGraph. delayedBoundUpdate(gnu.trove.stack.TIntStack toRemove, IntVar[] z, int... dim)Method parameters in org.chocosolver.solver.constraints.nary.automata.structure.multicostregular with type arguments of type IntVar Modifier and Type Method Description booleanStoredDirectedMultiGraph. removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, gnu.trove.stack.TIntStack[] updateLeft, gnu.trove.stack.TIntStack[] updateRight, Propagator<IntVar> propagator)voidStoredDirectedMultiGraph. updateLeft(gnu.trove.stack.TIntStack updateLeft, gnu.trove.stack.TIntStack toRemove, int dim, boolean[] modBound, Propagator<IntVar> propagator)voidStoredDirectedMultiGraph. updateRight(gnu.trove.stack.TIntStack updateRight, gnu.trove.stack.TIntStack toRemove, int dim, boolean[] modBound, Propagator<IntVar> propagator)Constructors in org.chocosolver.solver.constraints.nary.automata.structure.multicostregular with parameters of type IntVar Constructor Description StoredDirectedMultiGraph(IEnvironment environment, org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph, int[][] layers, int[] starts, int[] offsets, int supportLength, ICostAutomaton pi, IntVar[] z) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.automata.structure.regular
Method parameters in org.chocosolver.solver.constraints.nary.automata.structure.regular with type arguments of type IntVar Modifier and Type Method Description voidStoredDirectedMultiGraph. clearSupports(int idxVar, int val, Propagator<IntVar> p) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.binPacking
Constructors in org.chocosolver.solver.constraints.nary.binPacking with parameters of type IntVar Constructor Description PropItemToLoad(IntVar[] binOfItem, int[] itemSize, IntVar[] binLoad, int offset)Incremental propagator for a Bin Packing constraint Propagates item/bin allocations to bin loads Should be used together with PropLoadToItemPropLoadToItem(IntVar[] binOfItem, int[] itemSize, IntVar[] binLoad, int offset)Incremental propagator for a Bin Packing constraint Propagates bin loads to item/bin allocations Should be used together with PropItemToLoad -
Uses of IntVar in org.chocosolver.solver.constraints.nary.channeling
Methods in org.chocosolver.solver.constraints.nary.channeling with parameters of type IntVar Modifier and Type Method Description booleanPropClauseChanneling. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropInverseChannelAC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary.channeling with parameters of type IntVar Constructor Description PropBitChanneling(IntVar OCTET, BoolVar[] BITS)PropClauseChanneling(IntVar iv, BoolVar[] eb, BoolVar[] lb)PropEnumDomainChanneling(BoolVar[] bvars, IntVar aVar, int offSet)PropInverseChannelAC(IntVar[] X, IntVar[] Y, int minX, int minY)PropInverseChannelBC(IntVar[] X, IntVar[] Y, int minX, int minY) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.circuit
Constructors in org.chocosolver.solver.constraints.nary.circuit with parameters of type IntVar Constructor Description PropCircuit_AntiArboFiltering(IntVar[] succs, int offSet, CircuitConf conf)PropCircuit_ArboFiltering(IntVar[] succs, int offSet, CircuitConf conf)PropCircuitSCC(IntVar[] succs, int offSet, CircuitConf conf)PropNoSubtour(IntVar[] variables, int offset)Ensures that graph has no subCircuit, with Caseaux/Laburthe/Pesant algorithm runs incrementally in O(1) per instantiation eventPropSubcircuit(IntVar[] variables, int offset, IntVar length)PropSubcircuitDominatorFilter(IntVar[] succs, int offSet, boolean adaptable) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.count
Methods in org.chocosolver.solver.constraints.nary.count with parameters of type IntVar Modifier and Type Method Description booleanPropCount_AC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropCountVar. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary.count with parameters of type IntVar Constructor Description PropCount_AC(IntVar[] decvars, int restrictedValue, IntVar valueCardinality)Propagator for Count Constraint for integer variables Performs Arc ConsistencyPropCountVar(IntVar[] decvars, IntVar restrictedValue, IntVar valueCardinality)Propagator for Count Constraint for integer variables Performs Arc Consistency -
Uses of IntVar in org.chocosolver.solver.constraints.nary.cumulative
Fields in org.chocosolver.solver.constraints.nary.cumulative declared as IntVar Modifier and Type Field Description protected IntVarPropCumulative. capaprotected IntVar[]PropCumulative. dprotected IntVar[]PropCumulative. eprotected IntVar[]PropCumulative. hprotected IntVar[]PropCumulative. sMethods in org.chocosolver.solver.constraints.nary.cumulative that return IntVar Modifier and Type Method Description static IntVar[]Cumulative. extract(Task[] tasks, IntVar[] heights, IntVar capa)Methods in org.chocosolver.solver.constraints.nary.cumulative with parameters of type IntVar Modifier and Type Method Description protected booleanSweepHeiSortCumulFilter. checkSort(IntVar[] h, int nbT)static IntVar[]Cumulative. extract(Task[] tasks, IntVar[] heights, IntVar capa)abstract voidCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)Filters the cumulative constraint over the subset of tasks induced by tasksvoidDefaultCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidDisjunctiveTaskIntervalFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidNaiveTimeCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidNRJCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidSweepCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidSweepHeiSortCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidTimeCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)protected voidTimeCumulFilter. filterInf(IntVar start, int elb, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)protected voidTimeCumulFilter. filterSup(int sub, IntVar end, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)protected voidHeightCumulFilter. pruneMax(IntVar[] e)protected voidSweepCumulFilter. pruneMax(IntVar[] e, Propagator<IntVar> aCause)protected voidHeightCumulFilter. pruneMin(IntVar[] s)protected voidSweepCumulFilter. pruneMin(IntVar[] s, Propagator<IntVar> aCause)protected voidSweepCumulFilter. removeNullDurations(IntVar[] d, ISet tasks)protected booleanHeightCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)protected booleanSweepCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)protected booleanSweepHeiSortCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)Method parameters in org.chocosolver.solver.constraints.nary.cumulative with type arguments of type IntVar Modifier and Type Method Description abstract voidCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)Filters the cumulative constraint over the subset of tasks induced by tasksvoidDefaultCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidDisjunctiveTaskIntervalFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidNaiveTimeCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidNRJCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidSweepCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidSweepHeiSortCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)voidTimeCumulFilter. filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)protected voidTimeCumulFilter. filterInf(IntVar start, int elb, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)protected voidTimeCumulFilter. filterSup(int sub, IntVar end, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)protected voidSweepCumulFilter. pruneMax(IntVar[] e, Propagator<IntVar> aCause)protected voidSweepCumulFilter. pruneMin(IntVar[] s, Propagator<IntVar> aCause)protected booleanHeightCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)protected booleanSweepCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)protected booleanSweepHeiSortCumulFilter. sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)Constructors in org.chocosolver.solver.constraints.nary.cumulative with parameters of type IntVar Constructor Description Cumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean graphBased, Cumulative.Filter... filters)Cumulative constraintCumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean graphBased, CumulFilter... filters)Cumulative constraintPropCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, boolean reactToFineEvt, CumulFilter... filters)protected constructor, should not be called by a userPropCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, CumulFilter... filters)Classical cumulative propagatorPropGraphCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, boolean fast, CumulFilter... filters)Graph-based cumulative propagator: - only filters over subsets of overlapping tasks -
Uses of IntVar in org.chocosolver.solver.constraints.nary.element
Methods in org.chocosolver.solver.constraints.nary.element with parameters of type IntVar Modifier and Type Method Description booleanPropElementV_fast. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary.element with parameters of type IntVar Constructor Description PropElementV_fast(IntVar value, IntVar[] values, IntVar index, int offset, boolean fast) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.globalcardinality
Methods in org.chocosolver.solver.constraints.nary.globalcardinality with parameters of type IntVar Modifier and Type Method Description static ConstraintGlobalCardinality. reformulate(IntVar[] vars, IntVar[] card, Model model)Constructors in org.chocosolver.solver.constraints.nary.globalcardinality with parameters of type IntVar Constructor Description GlobalCardinality(IntVar[] vars, int[] values, IntVar[] cards)PropFastGCC(IntVar[] decvars, int[] restrictedValues, gnu.trove.map.hash.TIntIntHashMap map, IntVar[] valueCardinalities)Propagator for Global Cardinality Constraint (GCC) for integer variables Basic filter: no particular consistency but fast and with a correct checker -
Uses of IntVar in org.chocosolver.solver.constraints.nary.lex
Constructors in org.chocosolver.solver.constraints.nary.lex with parameters of type IntVar Constructor Description PropLex(IntVar[] X, IntVar[] Y, boolean strict)PropLexChain(IntVar[][] variables, boolean strict)PropLexInt(IntVar[] X, int[] Y, boolean strict) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.min_max
Constructors in org.chocosolver.solver.constraints.nary.min_max with parameters of type IntVar Constructor Description PropMax(IntVar[] variables, IntVar maxVar)PropMin(IntVar[] variables, IntVar maxVar) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.nvalue
Constructors in org.chocosolver.solver.constraints.nary.nvalue with parameters of type IntVar Constructor Description PropAMNV(IntVar[] X, IntVar N, G graph, F heur, R[] rules)Creates a propagator for the atMostNValues constraint The number of distinct values in X is at most equal to NPropAtLeastNValues(IntVar[] variables, int[] concernedValues, IntVar nValues)Propagator for the NValues constraint The number of distinct values among concerned values in the set of variables vars is exactly equal to nValues No level of consistency for the filteringPropAtLeastNValues_AC(IntVar[] variables, int[] vals, IntVar nValues)AtLeastNValues Propagator (similar to SoftAllDiff) The number of distinct values in vars is at least nValues Performs Generalized Arc Consistency based on Maximum Bipartite Matching The worst case time complexity is O(nm) but this is very pessimistic In practice it is more like O(m) where m is the number of variable-value pairsPropAtMostNValues(IntVar[] variables, int[] concernedValues, IntVar nValues)Propagator for the NValues constraint The number of distinct values among concerned values in the set of variables vars is exactly equal to nValues No level of consistency for the filteringPropAtMostNValues_BC(IntVar[] variables, IntVar nValues)The number of distinct values in vars is at most nValues Performs Bound Consistency in O(n+d) with n = |vars| d = maxValue - minValue (from initial domains) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.nvalue.amnv.graph
Fields in org.chocosolver.solver.constraints.nary.nvalue.amnv.graph declared as IntVar Modifier and Type Field Description protected IntVar[]Gi. XConstructors in org.chocosolver.solver.constraints.nary.nvalue.amnv.graph with parameters of type IntVar Constructor Description Gci(IntVar[] X)Creates the constrained intersection graph of X and D by automatically detecting disequalities and allDifferent constraints.Gci(IntVar[] X, D D)Creates the constrained intersection graph of X and DGi(IntVar[] X)Creates the intersection graph of X -
Uses of IntVar in org.chocosolver.solver.constraints.nary.nvalue.amnv.rules
Methods in org.chocosolver.solver.constraints.nary.nvalue.amnv.rules with parameters of type IntVar Modifier and Type Method Description protected voidR3. enforceEq(int i, int j, IntVar[] vars, Propagator aCause)voidR. filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)voidR1. filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)voidR2. filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)voidR3. filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)voidR4. filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) -
Uses of IntVar in org.chocosolver.solver.constraints.nary.sort
Constructors in org.chocosolver.solver.constraints.nary.sort with parameters of type IntVar Constructor Description PropKeysorting(IntVar[][] x, IntVar[][] y, IntVar[] p, int key)Creates a newPropSortinstance.PropSort(IntVar[] x, IntVar[] y)Creates a newPropSortinstance. -
Uses of IntVar in org.chocosolver.solver.constraints.nary.sum
Fields in org.chocosolver.solver.constraints.nary.sum declared as IntVar Modifier and Type Field Description protected IntVarPropSumBool. sumThe resulting variableMethods in org.chocosolver.solver.constraints.nary.sum with parameters of type IntVar Modifier and Type Method Description static ConstraintIntLinCombFactory. reduce(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, IntVar SCALAR, int minCardForDecomposition)Reduce coefficients, and variables if required, when dealing with a scalar productstatic ConstraintIntLinCombFactory. reduce(IntVar[] VARS, Operator OPERATOR, IntVar SUM, int minCardForDecomposition)Reduce coefficients, and variables if required, when dealing with a sum (all coefficients are implicitly equal to 1)static ConstraintIntLinCombFactory. selectScalar(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, int RESULT)Select the most relevant ScalarProduct constraint to returnstatic ConstraintIntLinCombFactory. selectSum(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, int RESULT, int nbools)Select the most relevant Sum constraint to returnbooleanPropSum. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.nary.sum with parameters of type IntVar Constructor Description PropScalar(IntVar[] variables, int[] coeffs, int pos, Operator o, int b)Create a scalar product: SUM(x_i*c_i) o b Variables and coefficients are excepted to be ordered wrt to coefficients: first positive ones then negative ones.PropSum(IntVar[] variables, int pos, Operator o, int b)Creates a sum propagator: SUM(x_i) o b Coefficients are induced bypos: those beforepos(included) are equal to 1, the other ones are equal to -1.PropSumBool(BoolVar[] variables, int pos, Operator o, IntVar sum, int b)Creates a sum propagator: SUM(x_i) Op sum + b, where x_i are boolean variables.PropSumBool(BoolVar[] variables, int pos, Operator o, IntVar sum, int b, boolean reactOnFineEvent)Creates a sum propagator: SUM(x_i) Op sum + b, where x_i are boolean variables.PropSumBoolIncr(BoolVar[] variables, int pos, Operator o, IntVar sum, int b)Creates a sum propagator: SUM(x_i) Op sum + b, where x_i are boolean variables, maintained incrementally. -
Uses of IntVar in org.chocosolver.solver.constraints.nary.tree
Constructors in org.chocosolver.solver.constraints.nary.tree with parameters of type IntVar Constructor Description PropAntiArborescences(IntVar[] succs, int offSet, boolean linear)AntiArborescences propagation (simplification from tree constraint) based on dominators -
Uses of IntVar in org.chocosolver.solver.constraints.reification
Methods in org.chocosolver.solver.constraints.reification with parameters of type IntVar Modifier and Type Method Description booleanPropReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXeqCReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXeqYReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXgtCReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXltCReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXltYCReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXltYReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXneCReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropXneYReif. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.reification with parameters of type IntVar Constructor Description PropLocalConDis(IntVar[] vars, Propagator<IntVar>[][] propagators)A propagator to deal with constructive disjunctionPropXeqCReif(IntVar x, int c, BoolVar r)PropXeqYReif(IntVar x, IntVar y, BoolVar r)PropXgtCReif(IntVar x, int c, BoolVar r)PropXinSReif(IntVar x, IntIterableRangeSet set, BoolVar r)PropXltCReif(IntVar x, int c, BoolVar r)PropXltYCReif(IntVar x, IntVar y, int c, BoolVar r)PropXltYReif(IntVar x, IntVar y, BoolVar r)PropXneCReif(IntVar x, int c, BoolVar r)PropXneYReif(IntVar x, IntVar y, BoolVar r) -
Uses of IntVar in org.chocosolver.solver.constraints.set
Constructors in org.chocosolver.solver.constraints.set with parameters of type IntVar Constructor Description PropCardinality(SetVar setVar, IntVar cardinality)Propagator ensuring that |setVar| = cardinalityPropElement(IntVar index, SetVar[] array, int offSet, SetVar set)Propagator for element constraint over sets states that array[index-offSet] = setPropIntBoundedMemberSet(SetVar setVar, IntVar intVar)Propagator for Member constraint val(intVar) is in setVarPropIntChannel(SetVar[] setsV, IntVar[] intsV, int offSet1, int offSet2)Channeling between set variables and integer variables x in sets[y-offSet1] <=> ints[x-offSet2] = yPropIntEnumMemberSet(SetVar setVar, IntVar intVar)Propagator for Member constraint val(intVar) is in setVarPropMaxElement(SetVar setVar, int[] weights, int offset, IntVar max, boolean notEmpty)Retrieves the maximum element induced by set MAX{weight[i-offset] | i in setVar} = maxPropMaxElement(SetVar setVar, IntVar max, boolean notEmpty)Retrieves the maximum element of the set MAX{i | i in setVar} = maxPropMinElement(SetVar setVar, int[] weights, int offSet, IntVar min, boolean notEmpty)Retrieves the minimum element induced by setVar MIN{weights[i-offSet] | i in setVar} = minPropMinElement(SetVar setVar, IntVar min, boolean notEmpty)Retrieves the minimum element of the set MIN(i | i in setVar) = minPropNbEmpty(SetVar[] sets, IntVar nbEmpty)Restricts the number of empty sets |{s in sets such that |s|=0}| = nbEmptyPropNotMemberIntSet(IntVar iv, SetVar sv)PropNotMemberSetInt(IntVar intVar, SetVar setVar)PropSetIntValuesUnion(IntVar[] X, SetVar values)PropSumOfElements(SetVar setVar, int[] weights, int offset, IntVar sum)Sums elements given by a set variable: if(weights ! -
Uses of IntVar in org.chocosolver.solver.constraints.ternary
Methods in org.chocosolver.solver.constraints.ternary with parameters of type IntVar Modifier and Type Method Description protected booleanPropDivXYZ. oppSign(IntVar a, IntVar b)A take the opposite signs of Bprotected booleanPropDivXYZ. sameSign(IntVar a, IntVar b)A take the signs of BbooleanPropMaxBC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropMinBC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropTimesNaive. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.ternary with parameters of type IntVar Constructor Description AbstractPropDistanceXYZ(IntVar[] vars)Enforces |X - Y| op ZPropDivXYZ(IntVar x, IntVar y, IntVar z)PropEQDistanceXYZ(IntVar[] vars)PropGEDistanceXYZ(IntVar[] vars)PropGTDistanceXYZ(IntVar[] vars)PropLEDistanceXYZ(IntVar[] vars)PropLTDistanceXYZ(IntVar[] vars)PropMaxBC(IntVar X, IntVar Y, IntVar Z)PropMinBC(IntVar X, IntVar Y, IntVar Z)PropTimesNaive(IntVar v1, IntVar v2, IntVar result)PropXplusYeqZ(IntVar X, IntVar Y, IntVar Z, boolean enableAC)Create propagator for ternary sum: X + Y =Z -
Uses of IntVar in org.chocosolver.solver.constraints.unary
Methods in org.chocosolver.solver.constraints.unary with parameters of type IntVar Modifier and Type Method Description booleanPropEqualXC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropGreaterOrEqualXC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropLessOrEqualXC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropMemberBound. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropMemberEnum. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotEqualXC. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotMemberBound. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)booleanPropNotMemberEnum. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Constructors in org.chocosolver.solver.constraints.unary with parameters of type IntVar Constructor Description Member(IntVar var, int[] values)Member(IntVar var, int lowerbound, int upperbound)Member(IntVar var, int lb, int ub, int[] values, Propagator prop)NotMember(IntVar var, int[] values)NotMember(IntVar var, int lowerbound, int upperbound)NotMember(IntVar var, int lb, int ub, int[] values, Propagator prop)PropEqualXC(IntVar var, int cste)PropGreaterOrEqualXC(IntVar var, int cste)PropLessOrEqualXC(IntVar var, int cste)PropMemberBound(IntVar var, int lb, int ub)PropMemberEnum(IntVar var, int[] values)PropNotEqualXC(IntVar var, int cste)PropNotMemberBound(IntVar var, int lb, int ub)PropNotMemberEnum(IntVar var, int[] values)A propagator which forbids values from var domain -
Uses of IntVar in org.chocosolver.solver.explanations
Methods in org.chocosolver.solver.explanations that return IntVar Modifier and Type Method Description IntVarArrayEventStore. getVariable(int evt)Methods in org.chocosolver.solver.explanations with parameters of type IntVar Modifier and Type Method Description booleanRuleStore. addBoundsRule(IntVar var)Add an upper bound rule and a lower bound rule, that is, any event on the upper bound or the lower bound of the variable needs to be retainedbooleanRuleStore. addFullDomainRule(IntVar var)Add a full domain rule, that is, any events involving the variable needs to be retained.booleanRuleStore. addLowerBoundRule(IntVar var)Add a lower bound rule, that is, any event on the lower bound of the variable needs to be retainedbooleanRuleStore. addRemovalRule(IntVar var, int value)Add a value removal rule, that is, the event which remove the value needs to be retained.booleanRuleStore. addUpperBoundRule(IntVar var)Add a upper bound rule, that is, any event on the upper bound of the variable needs to be retainedvoidExplanationEngine. instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)Explain the assignment tovalofvardue tocause.default voidIExplanationEngine. instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)Explain the assignment tovalofvardue tocause.booleanRuleStore. matchDomain(int ruleMask, IntVar ivar, IntEventType evt, int i1, int i2, int i3)Check whether a variable domain matches a rulevoidArrayEventStore. pushEvent(IntVar var, ICause cause, IEventType mask, int one, int two, int three)Push an event on the top of this storevoidExplanationEngine. removeValue(IntVar var, int val, ICause cause)Explain the removal of thevalfromvar, due tocause.default voidIExplanationEngine. removeValue(IntVar var, int val, ICause cause)Explain the removal of thevalfromvar, due tocause.voidExplanationEngine. updateLowerBound(IntVar var, int value, int old, ICause cause)Explain the removal of [old,value[ fromvar, due tocause.default voidIExplanationEngine. updateLowerBound(IntVar var, int value, int old, ICause cause)Explain the removal of [old,value[ fromvar, due tocause.voidExplanationEngine. updateUpperBound(IntVar var, int value, int old, ICause cause)Explain the removal of ]value,old] fromvar, due tocause.default voidIExplanationEngine. updateUpperBound(IntVar var, int value, int old, ICause cause)Explain the removal of ]value,old] fromvar, due tocause. -
Uses of IntVar in org.chocosolver.solver.explanations.store
Methods in org.chocosolver.solver.explanations.store that return IntVar Modifier and Type Method Description IntVarIEventStore. getVariable(int evt)Methods in org.chocosolver.solver.explanations.store with parameters of type IntVar Modifier and Type Method Description voidIEventStore. pushEvent(IntVar var, ICause cause, IEventType mask, int one, int two, int three) -
Uses of IntVar in org.chocosolver.solver.expression.discrete.arithmetic
Methods in org.chocosolver.solver.expression.discrete.arithmetic that return IntVar Modifier and Type Method Description IntVarArExpression. intVar()IntVarBiArExpression. intVar()IntVarIfArExpression. intVar()IntVarNaArExpression. intVar()IntVarUnArExpression. intVar()Method parameters in org.chocosolver.solver.expression.discrete.arithmetic with type arguments of type IntVar Modifier and Type Method Description default voidArExpression. extractVar(HashSet<IntVar> variables)Extract the variables from this expressionvoidIfArExpression. extractVar(HashSet<IntVar> variables)default intArExpression. ieval(int[] values, Map<IntVar,Integer> map)intBiArExpression. ieval(int[] values, Map<IntVar,Integer> map)intIfArExpression. ieval(int[] values, Map<IntVar,Integer> map)intNaArExpression. ieval(int[] values, Map<IntVar,Integer> map)intUnArExpression. ieval(int[] values, Map<IntVar,Integer> map) -
Uses of IntVar in org.chocosolver.solver.expression.discrete.logical
Method parameters in org.chocosolver.solver.expression.discrete.logical with type arguments of type IntVar Modifier and Type Method Description booleanBiLoExpression. beval(int[] values, Map<IntVar,Integer> map)booleanNaLoExpression. beval(int[] values, Map<IntVar,Integer> map)booleanUnLoExpression. beval(int[] values, Map<IntVar,Integer> map)voidBiLoExpression. extractVar(HashSet<IntVar> variables)voidNaLoExpression. extractVar(HashSet<IntVar> variables)voidUnLoExpression. extractVar(HashSet<IntVar> variables) -
Uses of IntVar in org.chocosolver.solver.expression.discrete.relational
Methods in org.chocosolver.solver.expression.discrete.relational that return IntVar Modifier and Type Method Description default IntVarReExpression. intVar()Method parameters in org.chocosolver.solver.expression.discrete.relational with type arguments of type IntVar Modifier and Type Method Description booleanBiReExpression. beval(int[] values, Map<IntVar,Integer> map)booleanNaReExpression. beval(int[] values, Map<IntVar,Integer> map)default booleanReExpression. beval(int[] values, Map<IntVar,Integer> map)voidBiReExpression. extractVar(HashSet<IntVar> variables)voidNaReExpression. extractVar(HashSet<IntVar> variables)voidReExpression. extractVar(HashSet<IntVar> variables)Extract the variables from this expressiondefault intReExpression. ieval(int[] values, Map<IntVar,Integer> map) -
Uses of IntVar in org.chocosolver.solver.objective
Methods in org.chocosolver.solver.objective that return types with arguments of type IntVar Modifier and Type Method Description Decision<IntVar>ObjectiveStrategy. getDecision()static IObjectiveManager<IntVar>ObjectiveFactory. makeObjectiveManager(IntVar objective, ResolutionPolicy policy)Define the variable to optimize (maximize or minimize) By default, the manager usesIObjectiveManager.setStrictDynamicCut()to avoid exploring worse solutions.Methods in org.chocosolver.solver.objective with parameters of type IntVar Modifier and Type Method Description static IObjectiveManager<IntVar>ObjectiveFactory. makeObjectiveManager(IntVar objective, ResolutionPolicy policy)Define the variable to optimize (maximize or minimize) By default, the manager usesIObjectiveManager.setStrictDynamicCut()to avoid exploring worse solutions.Constructors in org.chocosolver.solver.objective with parameters of type IntVar Constructor Description ObjectiveStrategy(IntVar objective, int[] coefs, OptimizationPolicy policy)Defines a parametrized dichotomic branching over the objective variable BEWARE: only activated after a first solutionObjectiveStrategy(IntVar objective, OptimizationPolicy policy)Defines a branching strategy over the objective variable BEWARE: only activated after a first solutionParetoOptimizer(boolean maximize, IntVar[] objectives)Create an object to compute the Pareto front of a multi-objective problem. -
Uses of IntVar in org.chocosolver.solver.search
Methods in org.chocosolver.solver.search with parameters of type IntVar Modifier and Type Method Description default List<Solution>IResolutionHelper. findAllOptimalSolutions(IntVar objective, boolean maximize, Criterion... stop)Attempt to find the solution that optimizes the mono-objective problem defined by a unique objective variable and an optimization criteria, then finds and stores all optimal solution.default SolutionIResolutionHelper. findLexOptimalSolution(IntVar[] objectives, boolean maximize, Criterion... stop)Attempts optimize the value of the objectives variable w.r.t. to an optimization criteria.default SolutionIResolutionHelper. findOptimalSolution(IntVar objective, boolean maximize, Criterion... stop)Attempt to find the solution that optimizes the mono-objective problem defined by a unique objective variable and an optimization criteria.default List<Solution>IResolutionHelper. findParetoFront(IntVar[] objectives, boolean maximize, Criterion... stop)Attempts optimize the value of the objectives variable w.r.t. to an optimization criteria.default Stream<Solution>IResolutionHelper. streamOptimalSolutions(IntVar objective, boolean maximize, Criterion... stop)Attempt to find the solution that optimizes the mono-objective problem defined by a unique objective variable and an optimization criteria, then finds and stores all optimal solution. -
Uses of IntVar in org.chocosolver.solver.search.loop.lns
Methods in org.chocosolver.solver.search.loop.lns with parameters of type IntVar Modifier and Type Method Description static INeighborINeighborFactory. blackBox(IntVar... vars)Creates a black-box LNS neighborstatic INeighborINeighborFactory. explanationBased(IntVar... vars)Creates an Explanation based LNS Neighborstatic INeighborINeighborFactory. propagationGuided(IntVar... vars)Create a propagation guided neighborhood fixing variables based on constraint propagation Based on "Propagation-Guided LNS", Perronn Shaw and Furnon, CP2004static INeighborINeighborFactory. random(IntVar... vars)Create a random neighborhood fixing variables randomlystatic INeighborINeighborFactory. reversedPropagationGuided(IntVar... vars)Create a reverse propagation guided neighborhood fixing variables based on constraint propagation -
Uses of IntVar in org.chocosolver.solver.search.loop.lns.neighbors
Fields in org.chocosolver.solver.search.loop.lns.neighbors declared as IntVar Modifier and Type Field Description protected IntVar[]PropagationGuidedNeighborhood. varsArray of variables to consider in a fragmentprotected IntVar[]RandomNeighborhood. varsVariables to consider in this neighborConstructors in org.chocosolver.solver.search.loop.lns.neighbors with parameters of type IntVar Constructor Description PropagationGuidedNeighborhood(IntVar[] vars, int fgmtSize, int listSize, long seed)Create a propagation-guided neighbor for LNSRandomNeighborhood(IntVar[] vars, int level, long seed)Create a neighbor for LNS which randomly selects variable to be part of a fragmentReversePropagationGuidedNeighborhood(IntVar[] vars, int fgmtSize, int listSize, long seed)Create a neighbor for LNS based on PGLNS, which selects variables to not be part of a fragment -
Uses of IntVar in org.chocosolver.solver.search.loop.monitors
Methods in org.chocosolver.solver.search.loop.monitors with parameters of type IntVar Modifier and Type Method Description default voidISearchMonitorFactory. setNoGoodRecordingFromSolutions(IntVar... vars)Record nogoods from solution, that is, anytime a solution is found, a nogood is produced to prevent from finding the same solution later during the search.Constructors in org.chocosolver.solver.search.loop.monitors with parameters of type IntVar Constructor Description NogoodFromSolutions(IntVar[] vars)Avoid exploring same solutions (useful with restart on solution) Beware : - Must be posted as a constraint AND plugged as a monitor as well - Cannot be reified - Only works for integer variables -
Uses of IntVar in org.chocosolver.solver.search.strategy
Methods in org.chocosolver.solver.search.strategy that return types with arguments of type IntVar Modifier and Type Method Description static AbstractStrategy<IntVar>Search. activityBasedSearch(IntVar... vars)Create an Activity based search strategy.static AbstractStrategy<IntVar>Search. bestBound(AbstractStrategy<IntVar> formerSearch)Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.static AbstractStrategy<IntVar>Search. domOverWDegSearch(IntVar... vars)Assignment strategy which selects a variable according toDomOverWDegand assign it to its lower boundDecision<IntVar>BoundSearch. getDecision()static AbstractStrategy<IntVar>Search. intVarSearch(IntVar... vars)Builds a default search heuristics of integer variables Variable selection relies onSearch.domOverWDegSearch(IntVar...)Value selection relies on InDomainBest for optimization and InDomainMin for satisfactionMethods in org.chocosolver.solver.search.strategy with parameters of type IntVar Modifier and Type Method Description static AbstractStrategy<IntVar>Search. activityBasedSearch(IntVar... vars)Create an Activity based search strategy.static AbstractStrategy<IntVar>Search. domOverWDegSearch(IntVar... vars)Assignment strategy which selects a variable according toDomOverWDegand assign it to its lower boundstatic IntStrategySearch. inputOrderLBSearch(IntVar... vars)Assigns the first non-instantiated variable to its lower bound.static IntStrategySearch. inputOrderUBSearch(IntVar... vars)Assigns the first non-instantiated variable to its upper bound.static IntStrategySearch. intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)Builds your own search strategy based on binary decisions.static IntStrategySearch. intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, IntVar... vars)Builds your own assignment strategy based on binary decisions.static AbstractStrategy<IntVar>Search. intVarSearch(IntVar... vars)Builds a default search heuristics of integer variables Variable selection relies onSearch.domOverWDegSearch(IntVar...)Value selection relies on InDomainBest for optimization and InDomainMin for satisfactionstatic IntStrategySearch. minDomLBSearch(IntVar... vars)Assigns the non-instantiated variable of smallest domain size to its lower bound.static IntStrategySearch. minDomUBSearch(IntVar... vars)Assigns the non-instantiated variable of smallest domain size to its upper bound.static IntStrategySearch. randomSearch(IntVar[] vars, long seed)Randomly selects a variable and assigns it to a value randomly taken in - the domain in case the variable has an enumerated domain - {LB,UB} (one of the two bounds) in case the domain is boundedMethod parameters in org.chocosolver.solver.search.strategy with type arguments of type IntVar Modifier and Type Method Description static AbstractStrategy<IntVar>Search. bestBound(AbstractStrategy<IntVar> formerSearch)Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.static IntStrategySearch. intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)Builds your own search strategy based on binary decisions.static IntStrategySearch. intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)Builds your own search strategy based on binary decisions.static IntStrategySearch. intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, IntVar... vars)Builds your own assignment strategy based on binary decisions.Constructor parameters in org.chocosolver.solver.search.strategy with type arguments of type IntVar Constructor Description BoundSearch(AbstractStrategy<IntVar> mainSearch) -
Uses of IntVar in org.chocosolver.solver.search.strategy.assignments
Methods in org.chocosolver.solver.search.strategy.assignments that return types with arguments of type IntVar Modifier and Type Method Description static DecisionOperator<IntVar>DecisionOperatorFactory. makeIntEq()static DecisionOperator<IntVar>DecisionOperatorFactory. makeIntNeq()static DecisionOperator<IntVar>DecisionOperatorFactory. makeIntReverseSplit()static DecisionOperator<IntVar>DecisionOperatorFactory. makeIntSplit() -
Uses of IntVar in org.chocosolver.solver.search.strategy.decision
Methods in org.chocosolver.solver.search.strategy.decision that return types with arguments of type IntVar Modifier and Type Method Description DecisionOperator<IntVar>IntDecision. getDecOp()Methods in org.chocosolver.solver.search.strategy.decision with parameters of type IntVar Modifier and Type Method Description IntDecisionDecisionMaker. makeIntDecision(IntVar var, DecisionOperator<IntVar> dop, int value)voidIntDecision. set(IntVar v, int value, DecisionOperator<IntVar> assignment)Instantiate this decision with the parametersbooleanIntDecision. why(RuleStore ruleStore, IntVar var, IEventType evt, int value)Method parameters in org.chocosolver.solver.search.strategy.decision with type arguments of type IntVar Modifier and Type Method Description IntDecisionDecisionMaker. makeIntDecision(IntVar var, DecisionOperator<IntVar> dop, int value)voidIntDecision. set(IntVar v, int value, DecisionOperator<IntVar> assignment)Instantiate this decision with the parameters -
Uses of IntVar in org.chocosolver.solver.search.strategy.selectors.values
Methods in org.chocosolver.solver.search.strategy.selectors.values with parameters of type IntVar Modifier and Type Method Description intIntDomainBest. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainImpact. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainLast. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainMax. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainMedian. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainMiddle. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainMin. selectValue(IntVar var)intIntDomainRandom. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntDomainRandomBound. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.intIntValueSelector. selectValue(IntVar var)Selects and returns the value to constrained chosen variable with.Constructor parameters in org.chocosolver.solver.search.strategy.selectors.values with type arguments of type IntVar Constructor Description IntDomainBest(int maxdom, DecisionOperator<IntVar> dop)Create a value selector that returns the best value wrt to the objective to optimize.IntDomainImpact(int maxdom, DecisionOperator<IntVar> dop, boolean smallest)Create a value selector that returns the best value wrt to its impact on domains cardinality. -
Uses of IntVar in org.chocosolver.solver.search.strategy.selectors.variables
Methods in org.chocosolver.solver.search.strategy.selectors.variables that return IntVar Modifier and Type Method Description IntVarAntiFirstFail. getVariable(IntVar[] variables)IntVarFirstFail. getVariable(IntVar[] variables)IntVarLargest. getVariable(IntVar[] variables)IntVarMaxRegret. getVariable(IntVar[] variables)IntVarSmallest. getVariable(IntVar[] variables)Methods in org.chocosolver.solver.search.strategy.selectors.variables that return types with arguments of type IntVar Modifier and Type Method Description Decision<IntVar>ActivityBased. computeDecision(IntVar variable)Decision<IntVar>DomOverWDeg. computeDecision(IntVar variable)Decision<IntVar>ImpactBased. computeDecision(IntVar variable)Decision<IntVar>ActivityBased. getDecision()Decision<IntVar>DomOverWDeg. getDecision()Decision<IntVar>ImpactBased. getDecision()Methods in org.chocosolver.solver.search.strategy.selectors.variables with parameters of type IntVar Modifier and Type Method Description intActivityBased. compare(IntVar o1, IntVar o2)Decision<IntVar>ActivityBased. computeDecision(IntVar variable)Decision<IntVar>DomOverWDeg. computeDecision(IntVar variable)Decision<IntVar>ImpactBased. computeDecision(IntVar variable)doubleAntiFirstFail. evaluate(IntVar variable)doubleFirstFail. evaluate(IntVar variable)doubleLargest. evaluate(IntVar variable)doubleMaxRegret. evaluate(IntVar variable)doubleSmallest. evaluate(IntVar variable)doubleActivityBased. getActivity(IntVar var)IntVarAntiFirstFail. getVariable(IntVar[] variables)IntVarFirstFail. getVariable(IntVar[] variables)IntVarLargest. getVariable(IntVar[] variables)IntVarMaxRegret. getVariable(IntVar[] variables)IntVarSmallest. getVariable(IntVar[] variables)voidActivityBased. onUpdate(IntVar var, IEventType evt)Constructors in org.chocosolver.solver.search.strategy.selectors.variables with parameters of type IntVar Constructor Description ActivityBased(Model model, IntVar[] vars, double g, double d, int a, int samplingIterationForced, long seed)ActivityBased(IntVar[] vars)DomOverWDeg(IntVar[] variables, long seed, IntValueSelector valueSelector)Creates a DomOverWDeg variable selectorImpactBased(IntVar[] vars, boolean initOnly)ImpactBased(IntVar[] ivariables, int alpha, int split, int nodeImpact, long seed, boolean initOnly)Create an Impact-based search strategy with Node Impact strategy. -
Uses of IntVar in org.chocosolver.solver.search.strategy.strategy
Methods in org.chocosolver.solver.search.strategy.strategy that return types with arguments of type IntVar Modifier and Type Method Description Decision<IntVar>FullyRandom. computeDecision(IntVar variable)Decision<IntVar>IntStrategy. computeDecision(IntVar variable)Decision<IntVar>IntStrategy. getDecision()DecisionOperator<IntVar>IntStrategy. getDecisionOperator()VariableSelector<IntVar>IntStrategy. getVarSelector()Methods in org.chocosolver.solver.search.strategy.strategy with parameters of type IntVar Modifier and Type Method Description Decision<IntVar>FullyRandom. computeDecision(IntVar variable)Decision<IntVar>IntStrategy. computeDecision(IntVar variable)protected IntDecisionAbstractStrategy. makeIntDecision(IntVar var, int val)Creates an assignment decision object for integer variables Just a simple shortcut for : solver.getDecisionPath().makeIntDecision(var,DecisionOperatorFactory.makeIntEq(),val);Constructors in org.chocosolver.solver.search.strategy.strategy with parameters of type IntVar Constructor Description FullyRandom(IntVar[] scope, long seed)IntStrategy(IntVar[] scope, VariableSelector<IntVar> varSelector, IntValueSelector valSelector)Creates a search strategy which selects a variable X and a value V to perform the decision X = V BEWARE: if the variable domain is not enumerated, the value V should be a domain bound.IntStrategy(IntVar[] scope, VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decOperator)Creates a search strategy which selects a variable X and a value V to perform the decision X decOperator V This can be X <= V for instance.Constructor parameters in org.chocosolver.solver.search.strategy.strategy with type arguments of type IntVar Constructor Description IntStrategy(IntVar[] scope, VariableSelector<IntVar> varSelector, IntValueSelector valSelector)Creates a search strategy which selects a variable X and a value V to perform the decision X = V BEWARE: if the variable domain is not enumerated, the value V should be a domain bound.IntStrategy(IntVar[] scope, VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decOperator)Creates a search strategy which selects a variable X and a value V to perform the decision X decOperator V This can be X <= V for instance.IntStrategy(IntVar[] scope, VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decOperator)Creates a search strategy which selects a variable X and a value V to perform the decision X decOperator V This can be X <= V for instance. -
Uses of IntVar in org.chocosolver.solver.variables
Subinterfaces of IntVar in org.chocosolver.solver.variables Modifier and Type Interface Description interfaceBoolVar
CPRU r544: remove default implementationMethods in org.chocosolver.solver.variables that return IntVar Modifier and Type Method Description IntVarVariable. asIntVar()IntVarSetVar. getCard()get the constrained cardinality variable of this set.IntVarTask. getDuration()IntVarTask. getEnd()IntVarTask. getStart()default IntVarIViewFactory. intAbsView(IntVar var)Creates a view over var such that: |var|.default IntVarIViewFactory. intAffineView(int a, IntVar x, int b)Creates an affine view over x such that: a.x + b.default IntVarIViewFactory. intMinusView(IntVar var)Creates a view over var equal to -var.default IntVarIViewFactory. intOffsetView(IntVar var, int cste)Creates a view based on var, equal to var+cste.default IntVarIViewFactory. intScaleView(IntVar var, int cste)Creates a view over var equal to var*cste.default IntVarBoolVar. intVar()default IntVarIntVar. intVar()default IntVarIVariableFactory. intVar(int value)Create a constant integer variable equal to valuedefault IntVarIVariableFactory. intVar(int[] values)Create an integer variable of initial domain values.default IntVarIVariableFactory. intVar(int lb, int ub)Create an integer variable of initial domain [lb, ub] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwisedefault IntVarIVariableFactory. intVar(int lb, int ub, boolean boundedDomain)Create an integer variable of initial domain [lb, ub]default IntVarIVariableFactory. intVar(String name, int value)Create a constant integer variable equal to valuedefault IntVarIVariableFactory. intVar(String name, int[] values)Create an integer variable of initial domain values Uses an enumerated domain that supports holesdefault IntVarIVariableFactory. intVar(String name, int lb, int ub)Create an integer variable of initial domain [lb, ub] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwisedefault IntVarIVariableFactory. intVar(String name, int lb, int ub, boolean boundedDomain)Create an integer variable of initial domain [lb, ub]default IntVar[]IVariableFactory. intVarArray(int size, int[] values)Creates an array of size integer variables, taking their domain in valuesdefault IntVar[]IVariableFactory. intVarArray(int size, int lb, int ub)Creates an array of size integer variables, taking their domain in [lb, ub]default IntVar[]IVariableFactory. intVarArray(int size, int lb, int ub, boolean boundedDomain)Creates an array of size integer variables, taking their domain in [lb, ub]default IntVar[]IVariableFactory. intVarArray(String name, int size, int[] values)Creates an array of size integer variables, taking their domain in valuesdefault IntVar[]IVariableFactory. intVarArray(String name, int size, int lb, int ub)Creates an array of size integer variables, taking their domain in [lb, ub]default IntVar[]IVariableFactory. intVarArray(String name, int size, int lb, int ub, boolean boundedDomain)Creates an array of size integer variables, taking their domain in [lb, ub]default IntVar[][]IVariableFactory. intVarMatrix(int dim1, int dim2, int[] values)Creates a matrix of dim1*dim2 integer variables taking their domain in valuesdefault IntVar[][]IVariableFactory. intVarMatrix(int dim1, int dim2, int lb, int ub)Creates a matrix of dim1*dim2 integer variables taking their domain in [lb, ub]default IntVar[][]IVariableFactory. intVarMatrix(int dim1, int dim2, int lb, int ub, boolean boundedDomain)Creates a matrix of dim1*dim2 integer variables taking their domain in [lb, ub]default IntVar[][]IVariableFactory. intVarMatrix(String name, int dim1, int dim2, int[] values)Creates a matrix of dim1*dim2 integer variables taking their domain in valuesdefault IntVar[][]IVariableFactory. intVarMatrix(String name, int dim1, int dim2, int lb, int ub)Creates a matrix of dim1*dim2 integer variables taking their domain in [lb, ub]default IntVar[][]IVariableFactory. intVarMatrix(String name, int dim1, int dim2, int lb, int ub, boolean boundedDomain)Creates a matrix of dim1*dim2 integer variables taking their domain in [lb, ub]Methods in org.chocosolver.solver.variables with parameters of type IntVar Modifier and Type Method Description default IntVarIViewFactory. intAbsView(IntVar var)Creates a view over var such that: |var|.default IntVarIViewFactory. intAffineView(int a, IntVar x, int b)Creates an affine view over x such that: a.x + b.default IntVarIViewFactory. intMinusView(IntVar var)Creates a view over var equal to -var.default IntVarIViewFactory. intOffsetView(IntVar var, int cste)Creates a view based on var, equal to var+cste.default IntVarIViewFactory. intScaleView(IntVar var, int cste)Creates a view over var equal to var*cste.default RealVarIViewFactory. realIntView(IntVar var, double precision)Creates a real view of var, i.e. a RealVar of domain equal to the domain of var.default RealVar[]IViewFactory. realIntViewArray(IntVar[] ints, double precision)Creates an array of real views for a set of integer variables This should be used to include an integer variable in an expression/constraint requiring RealVardefault RealVar[][]IViewFactory. realIntViewMatrix(IntVar[][] ints, double precision)Creates a matrix of real views for a matrix of integer variables This should be used to include an integer variable in an expression/constraint requiring RealVarvoidSetVar. setCard(IntVar card)ensure a variable is equal to the cardinality of this set.default TaskIVariableFactory. taskVar(IntVar s, int p)Creates a task variable, based on a starting time s and a processing time p such that: s + p = e, where e is the ending time.default TaskIVariableFactory. taskVar(IntVar s, IntVar p)Creates a task variable, based on a starting time s and a processing time p such that: s + p = e, where e is the ending time.default TaskIVariableFactory. taskVar(IntVar s, IntVar p, IntVar e)Creates a task variable, made of a starting time s, a processing time p and an ending time e such that: s + p = e.default Task[]IVariableFactory. taskVarArray(IntVar[] s, IntVar[] p, IntVar[] e)Creates an array of s.length task variables, where task i is made of a starting time s_i, a processing time p_i and an ending time e_i such that: s_i + p_i = e_i.default Task[][]IVariableFactory. taskVarMatrix(IntVar[][] s, IntVar[][] p, IntVar[][] e)Creates a matrix of s.length * s_0.length task variables, where task i,j is made of a starting time s_(i,j), a processing time p_(i,j) and an ending time e_(i,j) such that: s_(i,j) + p_(i,j) = e_(i,j).default BoolVar[]IVariableFactory. toBoolVar(IntVar... ivars)Converts ivars into an array of boolean variablesdefault booleanIntVar. why(RuleStore ruleStore, IntVar modifiedVar, IEventType evt, int value)Method parameters in org.chocosolver.solver.variables with type arguments of type IntVar Modifier and Type Method Description default voidBoolVar. extractVar(HashSet<IntVar> variables)Constructors in org.chocosolver.solver.variables with parameters of type IntVar Constructor Description Task(IntVar s, IntVar d, IntVar e)Container representing a task: It ensures that: start + duration = end -
Uses of IntVar in org.chocosolver.solver.variables.impl
Classes in org.chocosolver.solver.variables.impl that implement IntVar Modifier and Type Class Description classBitsetArrayIntVarImpl
IntVar implementation for quite small domains bit with very distant values e.g. {-51900,42,235923}classBitsetIntVarImplclassBoolVarImplclassFixedBoolVarImplA constant view specific to boolean variableclassFixedIntVarImplA IntVar with one domain value.classIntervalIntVarImplFields in org.chocosolver.solver.variables.impl declared as IntVar Modifier and Type Field Description protected IntVarSetVarImpl. cardinalityMethods in org.chocosolver.solver.variables.impl that return IntVar Modifier and Type Method Description IntVarAbstractVariable. asIntVar()IntVarSetVarImpl. getCard()Methods in org.chocosolver.solver.variables.impl with parameters of type IntVar Modifier and Type Method Description voidSetVarImpl. setCard(IntVar card) -
Uses of IntVar in org.chocosolver.solver.variables.view
Classes in org.chocosolver.solver.variables.view with type parameters of type IntVar Modifier and Type Class Description classIntView<I extends IntVar>"A view implements the same operations as a variable.Classes in org.chocosolver.solver.variables.view that implement IntVar Modifier and Type Class Description classBoolNotViewA view for boolean variable, that enforce not(b).classIntView<I extends IntVar>"A view implements the same operations as a variable.classMinusViewView for -V, where V is a IntVar or viewclassOffsetViewdeclare an IntVar based on X and C, such as X + C
Based on "Views and Iterators for Generic Constraint Implementations"
C.classScaleViewdeclare an IntVar based on X and C, such as X * CFields in org.chocosolver.solver.variables.view declared as IntVar Modifier and Type Field Description protected IIntView. varObserved variableprotected IntVarRealView. varMethods in org.chocosolver.solver.variables.view that return IntVar Modifier and Type Method Description IntVarIntView. getVariable()IntVarRealView. getVariable()Methods in org.chocosolver.solver.variables.view with parameters of type IntVar Modifier and Type Method Description voidBoolNotView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)voidIView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)This methods is related to explanations, it binds an event occurring on the observed variable to the view.voidMinusView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)voidOffsetView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)voidRealView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)voidScaleView. justifyEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)booleanBoolNotView. why(RuleStore ruleStore, IntVar modifiedVar, IEventType evt, int value)booleanIntView. why(RuleStore ruleStore, IntVar modifiedVar, IEventType evt, int value)Constructors in org.chocosolver.solver.variables.view with parameters of type IntVar Constructor Description MinusView(IntVar var)Create a -var viewOffsetView(IntVar var, int cste)A view based on var such that var + csteRealView(IntVar var, double precision)ScaleView(IntVar var, int cste)Create a cste × var view -
Uses of IntVar in org.chocosolver.util.iterators
Constructors in org.chocosolver.util.iterators with parameters of type IntVar Constructor Description DisposableRangeBoundIterator(IntVar var)DisposableValueBoundIterator(IntVar var)IntVarValueIterator(IntVar v)Creates an object to iterate over an IntVar values usingfor(int value:var){ ... }that is equivalent toint ub = var.getUB(); for(int value = var.getLB(); values <= ub; value = var.nextValue(value)){ ... } -
Uses of IntVar in org.chocosolver.util.objects.graphs
Constructors in org.chocosolver.util.objects.graphs with parameters of type IntVar Constructor Description MultivaluedDecisionDiagram(IntVar[] VARIABLES, int[][] TRANSITIONS)Create an MDD based on an array of flatten domains and a set of transitions.MultivaluedDecisionDiagram(IntVar[] VARIABLES, Tuples TUPLES)Create an MDD based on an array of flatten domains and a set of tuplesMultivaluedDecisionDiagram(IntVar[] VARIABLES, Tuples TUPLES, boolean compactOnce, boolean sortTuple)Create an MDD based on an array of flatten domains and a set of tuples -
Uses of IntVar in org.chocosolver.util.objects.setDataStructures.iterable
Methods in org.chocosolver.util.objects.setDataStructures.iterable with parameters of type IntVar Modifier and Type Method Description static voidIntIterableSetUtils. copyIn(IntVar var, IntIterableRangeSet set)Copy the domain of var in set.static IntIterableRangeSetIntIterableSetUtils. extract(IntVar var)Copy the domain of var into anIntIterableRangeSet.static booleanIntIterableSetUtils. includedIn(IntVar var, IntIterableRangeSet set)static booleanIntIterableSetUtils. intersect(IntVar var, IntIterableRangeSet set)static booleanIntIterableSetUtils. notIncludedIn(IntVar var, IntIterableRangeSet set)static voidIntIterableSetUtils. union(IntIterableRangeSet set, IntVar var)Put all value of var into set. -
Uses of IntVar in org.chocosolver.util.tools
Methods in org.chocosolver.util.tools that return IntVar Modifier and Type Method Description static IntVar[]ArrayUtils. append(IntVar[]... toAppend)Append two Arraysstatic IntVar[]ArrayUtils. concat(IntVar[] array, IntVar... elements)Append elements at the end of another arraystatic IntVar[]VariableUtils. toIntVar(Model model, int... values)Transform an array of int to an array of fixed IntVarMethods in org.chocosolver.util.tools with parameters of type IntVar Modifier and Type Method Description static IntVar[]ArrayUtils. append(IntVar[]... toAppend)Append two Arraysstatic int[]VariableUtils. boundsForAddition(IntVar... vars)static int[]VariableUtils. boundsForDivision(IntVar x, IntVar y)static int[]VariableUtils. boundsForMaximum(IntVar... vars)static int[]VariableUtils. boundsForMinimum(IntVar... vars)static int[]VariableUtils. boundsForModulo(IntVar x, IntVar y)static int[]VariableUtils. boundsForMultiplication(IntVar x, IntVar y)static int[]VariableUtils. boundsForPow(IntVar x, IntVar y)static int[]VariableUtils. boundsForScalar(IntVar[] vars, int[] coeffs)static int[]VariableUtils. boundsForSubstraction(IntVar x, IntVar y)static IntVar[]ArrayUtils. concat(IntVar[] array, IntVar... elements)Append elements at the end of another arraystatic longVariableUtils. domainCardinality(IntVar... vars)static booleanVariableUtils. intersect(IntVar x, IntVar y)static doubleVariableUtils. searchSpaceSize(IntVar[] vars)Compute the search space size
-