Uses of Interface
org.chocosolver.solver.variables.IntVar

Packages that use IntVar

Package	Description
org.chocosolver.sat
org.chocosolver.solver	A package devoted to Model and resolution tools.
org.chocosolver.solver.constraints
org.chocosolver.solver.constraints.binary
org.chocosolver.solver.constraints.binary.element
org.chocosolver.solver.constraints.extension
org.chocosolver.solver.constraints.extension.binary
org.chocosolver.solver.constraints.extension.nary
org.chocosolver.solver.constraints.nary
org.chocosolver.solver.constraints.nary.alldifferent
org.chocosolver.solver.constraints.nary.alldifferent.algo
org.chocosolver.solver.constraints.nary.alldifferent.conditions
org.chocosolver.solver.constraints.nary.among
org.chocosolver.solver.constraints.nary.automata
org.chocosolver.solver.constraints.nary.automata.FA
org.chocosolver.solver.constraints.nary.automata.structure.costregular
org.chocosolver.solver.constraints.nary.automata.structure.multicostregular
org.chocosolver.solver.constraints.nary.automata.structure.regular
org.chocosolver.solver.constraints.nary.binPacking
org.chocosolver.solver.constraints.nary.channeling
org.chocosolver.solver.constraints.nary.circuit
org.chocosolver.solver.constraints.nary.clauses
org.chocosolver.solver.constraints.nary.cnf
org.chocosolver.solver.constraints.nary.count
org.chocosolver.solver.constraints.nary.cumulative
org.chocosolver.solver.constraints.nary.element
org.chocosolver.solver.constraints.nary.globalcardinality
org.chocosolver.solver.constraints.nary.lex
org.chocosolver.solver.constraints.nary.min_max
org.chocosolver.solver.constraints.nary.nvalue
org.chocosolver.solver.constraints.nary.nvalue.amnv.graph
org.chocosolver.solver.constraints.nary.nvalue.amnv.rules
org.chocosolver.solver.constraints.nary.sort
org.chocosolver.solver.constraints.nary.sum
org.chocosolver.solver.constraints.nary.tree
org.chocosolver.solver.constraints.reification
org.chocosolver.solver.constraints.set
org.chocosolver.solver.constraints.ternary
org.chocosolver.solver.constraints.unary
org.chocosolver.solver.expression.discrete.arithmetic
org.chocosolver.solver.expression.discrete.logical
org.chocosolver.solver.expression.discrete.relational
org.chocosolver.solver.learn
org.chocosolver.solver.objective
org.chocosolver.solver.search
org.chocosolver.solver.search.loop.lns
org.chocosolver.solver.search.loop.lns.neighbors
org.chocosolver.solver.search.loop.monitors
org.chocosolver.solver.search.strategy
org.chocosolver.solver.search.strategy.assignments
org.chocosolver.solver.search.strategy.decision
org.chocosolver.solver.search.strategy.selectors.values
org.chocosolver.solver.search.strategy.selectors.variables
org.chocosolver.solver.search.strategy.strategy
org.chocosolver.solver.variables
org.chocosolver.solver.variables.impl
org.chocosolver.solver.variables.view
org.chocosolver.util.iterators
org.chocosolver.util.objects.graphs
org.chocosolver.util.objects.setDataStructures.iterable
org.chocosolver.util.tools

Uses of IntVar in org.chocosolver.sat

Methods in org.chocosolver.sat with parameters of type IntVar

Modifier and Type	Method	Description
int	PropNogoods.Literal(IntVar ivar, int value, boolean eq)	Creates or returns if already existing, the literal corresponding to :

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 of this and build an array that contains all the IntVar of 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.
List<IntVar>	Solution.retrieveIntVars(boolean includeBoolVar)	Iterate over the variable of this and build a list that contains all the IntVar of the solution.

Methods in org.chocosolver.solver with parameters of type IntVar

Modifier and Type	Method	Description
int	Solution.getIntVal(IntVar v)	Get the value of variable v in this solution.
void	Solution.setIntVal(IntVar var, int val)	Set the value of variable v in this solution.

Method parameters in org.chocosolver.solver with type arguments of type IntVar

Modifier and Type	Method	Description
default void	ICause.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications implicationGraph, int pivot)	Clausal explanation for this cause.
default void	ICause.forEachIntVar(Consumer<IntVar> action)	Apply an action on each variable declared on the scope of this cause, if any.

Uses of IntVar in org.chocosolver.solver.constraints

Methods in org.chocosolver.solver.constraints 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 with parameters of type IntVar

Modifier and Type	Method	Description
default Constraint	IIntConstraintFactory.absolute(IntVar var1, IntVar var2)	Creates an absolute value constraint: var1 = |var2|
default Constraint	IIntConstraintFactory.allDifferent(IntVar... vars)	Creates an allDifferent constraint.
default Constraint	IIntConstraintFactory.allDifferent(IntVar[] vars, String CONSISTENCY)	Creates an allDifferent constraint.
default Constraint	IIntConstraintFactory.allDifferentExcept0(IntVar[] vars)	Creates an allDifferent constraint for variables that are not equal to 0.
default Constraint	IIntConstraintFactory.allDifferentUnderCondition(IntVar[] vars, Condition condition, boolean singleCondition)	Creates an allDifferent constraint subject to the given condition.
default Constraint	IIntConstraintFactory.allEqual(IntVar... vars)	Creates an allEqual constraint.
default Constraint	IIntConstraintFactory.among(IntVar nbVar, IntVar[] vars, int[] values)	Creates an among constraint.
default Constraint	IIntConstraintFactory.arithm(IntVar var, String op, int cste)	Creates an arithmetic constraint : var op cste, where op in {"=", "!
default Constraint	IIntConstraintFactory.arithm(IntVar var1, String op, IntVar var2)	Creates an arithmetic constraint: var1 op var2, where op in {"=", "!
default Constraint	IIntConstraintFactory.arithm(IntVar var1, String op1, IntVar var2, String op2, int cste)	Creates an arithmetic constraint : var1 op var2, where op in {"=", "!
default Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.atLeastNValues(IntVar[] vars, IntVar nValues, boolean AC)	Creates an atLeastNValue constraint.
default Constraint	IIntConstraintFactory.atMostNValues(IntVar[] vars, IntVar nValues, boolean STRONG)	Creates an atMostNValue constraint.
default Constraint	IIntConstraintFactory.binPacking(IntVar[] itemBin, int[] itemSize, IntVar[] binLoad, int offset)	Creates a BinPacking constraint.
default void	IDecompositionFactory.binPackingDec(IntVar[] bin, int[] w, IntVar[] load, int offset)	Creates and posts a decomposition of a bin packing constraint.
default Constraint	IIntConstraintFactory.bitsIntChanneling(BoolVar[] bits, IntVar var)	Creates an channeling constraint between an integer variable and a set of bit variables.
default Constraint	IIntConstraintFactory.boolsIntChanneling(BoolVar[] bVars, IntVar var, int offset)	Creates an channeling constraint between an integer variable and a set of boolean variables.
default Constraint	IIntConstraintFactory.circuit(IntVar[] vars)	Creates a circuit constraint which ensures that
default Constraint	IIntConstraintFactory.circuit(IntVar[] vars, int offset)	Creates a circuit constraint which ensures that
default Constraint	IIntConstraintFactory.circuit(IntVar[] vars, int offset, CircuitConf conf)	Creates a circuit constraint which ensures that
default Constraint	IIntConstraintFactory.clausesIntChanneling(IntVar var, BoolVar[] eVars, BoolVar[] lVars)	Creates an channeling constraint between an integer variable and a set of clauses.
default Constraint	IIntConstraintFactory.costRegular(IntVar[] vars, IntVar cost, ICostAutomaton costAutomaton)	Creates a regular constraint that supports a cost function.
default Constraint	IIntConstraintFactory.count(int value, IntVar[] vars, IntVar limit)	Creates a count constraint.
default Constraint	IIntConstraintFactory.count(IntVar value, IntVar[] vars, IntVar limit)	Creates a count constraint.
default void	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 void	IDecompositionFactory.cumulativeTimeDec(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.
default Constraint	IIntConstraintFactory.diffN(IntVar[] X, IntVar[] Y, IntVar[] width, IntVar[] height, boolean addCumulativeReasoning)	Creates a diffN constraint.
default Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.div(IntVar dividend, IntVar divisor, IntVar result)	Creates an euclidean division constraint.
default Constraint	IIntConstraintFactory.element(IntVar value, int[] table, IntVar index)	Creates an element constraint: value = table[index]
default Constraint	IIntConstraintFactory.element(IntVar value, int[] table, IntVar index, int offset)	Creates an element constraint: value = table[index-offset]
default Constraint	IIntConstraintFactory.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 Constraint	ISetConstraintFactory.element(IntVar index, SetVar[] sets, int offset, SetVar set)	Creates a constraint enabling to retrieve an element set in sets: sets[index-offset] = set
default Constraint	ISetConstraintFactory.element(IntVar index, SetVar[] sets, SetVar set)	Creates a constraint enabling to retrieve an element set in sets: sets[index] = set
default int[]	IIntConstraintFactory.getDomainUnion(IntVar... vars)	Get the list of values in the domains of vars
default Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.intValuePrecedeChain(IntVar[] X, int[] V)	Creates an intValuePrecedeChain constraint.
default Constraint	IIntConstraintFactory.intValuePrecedeChain(IntVar[] X, int S, int T)	Creates an intValuePrecedeChain constraint.
default Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.knapsack(IntVar[] occurrences, IntVar weightSum, IntVar energySum, int[] weight, int[] energy)	Creates a knapsack constraint.
default Constraint	IIntConstraintFactory.lexChainLess(IntVar[]... vars)	Creates a lexChainLess constraint.
default Constraint	IIntConstraintFactory.lexChainLessEq(IntVar[]... vars)	Creates a lexChainLessEq constraint.
default Constraint	IIntConstraintFactory.lexLess(IntVar[] vars1, IntVar[] vars2)	Creates a lexLess constraint.
default Constraint	IIntConstraintFactory.lexLessEq(IntVar[] vars1, IntVar[] vars2)	Creates a lexLessEq constraint.
default Constraint	IIntConstraintFactory.max(IntVar max, IntVar[] vars)	Creates a maximum constraint.
default Constraint	IIntConstraintFactory.max(IntVar max, IntVar var1, IntVar var2)	Creates a maximum constraint : max = max(var1, var2) (Bound Consistency)
default Constraint	ISetConstraintFactory.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} = maxElementValue
default Constraint	ISetConstraintFactory.max(SetVar set, IntVar maxElementValue, boolean notEmpty)	Creates a constraint over the maximum element in a set: max{i | i in set} = maxElementValue
default Constraint	IIntConstraintFactory.mddc(IntVar[] vars, MultivaluedDecisionDiagram MDD)	Create a constraint where solutions (tuples) are encoded by a multi-valued decision diagram.
default Constraint	IIntConstraintFactory.member(IntVar var, int[] table)	Creates a member constraint.
default Constraint	IIntConstraintFactory.member(IntVar var, int lb, int ub)	Creates a member constraint.
default Constraint	IIntConstraintFactory.member(IntVar var, IntIterableRangeSet set)	Creates a member constraint.
default Constraint	ISetConstraintFactory.member(IntVar intVar, SetVar set)	Creates a member constraint stating that the value of intVar is in set
default Constraint	IIntConstraintFactory.min(IntVar min, IntVar[] vars)	Creates a minimum constraint.
default Constraint	IIntConstraintFactory.min(IntVar min, IntVar var1, IntVar var2)	Creates a minimum constraint: min = min(var1, var2) (Bound Consistency)
default Constraint	ISetConstraintFactory.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} = minElementValue
default Constraint	ISetConstraintFactory.min(SetVar set, IntVar minElementValue, boolean notEmpty)	Creates a constraint over the minimum element in a set: min{i | i in set} = minElementValue
default Constraint	IIntConstraintFactory.mod(IntVar X, int mod, int res)	Creates a modulo constraint.
default Constraint	IIntConstraintFactory.mod(IntVar X, int mod, IntVar Y)	Creates a modulo constraint: X % a = Y
default Constraint	IIntConstraintFactory.mod(IntVar X, IntVar Y, IntVar Z)	Ensures X % Y = Z.
default Constraint	IIntConstraintFactory.multiCostRegular(IntVar[] vars, IntVar[] costVars, ICostAutomaton costAutomaton)	Creates a regular constraint that supports a multiple cost function.
default Constraint	IIntConstraintFactory.multiCostRegular(IntVar[] vars, IntVar[] costVars, ICostAutomaton costAutomaton, double precision)	Creates a regular constraint that supports a multiple cost function.
default Constraint	ISetConstraintFactory.nbEmpty(SetVar[] sets, IntVar nbEmpty)	Creates a constraint counting the number of empty sets sets |{s in sets where |s|=0}| = nbEmpty
default Constraint	IIntConstraintFactory.notAllEqual(IntVar... vars)	Creates a notAllEqual constraint.
default Constraint	IIntConstraintFactory.notMember(IntVar var, int[] table)	Creates a notMember constraint.
default Constraint	IIntConstraintFactory.notMember(IntVar var, int lb, int ub)	Creates a notMember constraint.
default Constraint	IIntConstraintFactory.notMember(IntVar var, IntIterableRangeSet set)	Creates a notMember constraint.
default Constraint	ISetConstraintFactory.notMember(IntVar intVar, SetVar set)	Creates a member constraint stating that the value of intVar is not in set
default Constraint	IIntConstraintFactory.nValues(IntVar[] vars, IntVar nValues)	Creates an nValue constraint.
default Constraint	IIntConstraintFactory.path(IntVar[] vars, IntVar start, IntVar end)	Creates a path constraint which ensures that
default Constraint	IIntConstraintFactory.path(IntVar[] vars, IntVar start, IntVar end, int offset)	Creates a path constraint which ensures that
default Constraint	IIntConstraintFactory.regular(IntVar[] vars, IAutomaton automaton)	Creates a regular constraint.
default IntVar[]	IDecompositionFactory.regularDec(IntVar[] vars, IAutomaton automaton)	Creates and posts a decomposition of a regular constraint.
default void	IReificationFactory.reifyXeqC(IntVar X, int C, BoolVar B)	Posts one constraint that expresses : (x = c) ⇔ b.
default void	IReificationFactory.reifyXeqY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x = y) ⇔ b.
default void	IReificationFactory.reifyXeqYC(IntVar X, IntVar Y, int C, BoolVar B)	Posts one constraint that expresses : (x = y + c) ⇔ b.
default void	IReificationFactory.reifyXgeY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x ≥ y) ⇔ b.
default void	IReificationFactory.reifyXgtC(IntVar X, int C, BoolVar B)	Posts one constraint that expresses : (x > c) ⇔ b.
default void	IReificationFactory.reifyXgtY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x > y) ⇔ b.
default void	IReificationFactory.reifyXgtYC(IntVar X, IntVar Y, int C, BoolVar B)	Posts one constraint that expresses : (x > y + c) ⇔ b.
default void	IReificationFactory.reifyXinS(IntVar X, IntIterableRangeSet S, BoolVar B)	Posts one constraint that expresses : (X ∈ S) ⇔ B.
default void	IReificationFactory.reifyXleY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x ≤ y) ⇔ b.
default void	IReificationFactory.reifyXltC(IntVar X, int C, BoolVar B)	Posts one constraint that expresses : (x < c) ⇔ b.
default void	IReificationFactory.reifyXltY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x < y) ⇔ b.
default void	IReificationFactory.reifyXltYC(IntVar X, IntVar Y, int C, BoolVar B)	Posts one constraint that expresses : (x < y + c) ⇔ b.
default void	IReificationFactory.reifyXneC(IntVar X, int C, BoolVar B)	Posts one constraint that expresses : (x ≠ c) ⇔ b.
default void	IReificationFactory.reifyXneY(IntVar X, IntVar Y, BoolVar B)	Posts one constraint that expresses : (x ≠ y) ⇔ b.
default void	IReificationFactory.reifyXneYC(IntVar X, IntVar Y, int C, BoolVar B)	Posts one constraint that expresses : (x ≠ y + c) ⇔ b.
default void	IReificationFactory.reifyXnotinS(IntVar X, IntIterableRangeSet S, BoolVar B)	Posts one constraint that expresses : (X ∉ S) ⇔ B.
default Constraint	IIntConstraintFactory.scalar(IntVar[] vars, int[] coeffs, String operator, int scalar)	Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalar
default Constraint	IIntConstraintFactory.scalar(IntVar[] vars, int[] coeffs, String operator, int scalar, int minCardForDecomp)	Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalar
default Constraint	IIntConstraintFactory.scalar(IntVar[] vars, int[] coeffs, String operator, IntVar scalar)	Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalar
default Constraint	IIntConstraintFactory.scalar(IntVar[] vars, int[] coeffs, String operator, IntVar scalar, int minCardForDecomp)	Creates a scalar constraint which ensures that Sum(vars[i]*coeffs[i]) operator scalar
default Constraint	ISetConstraintFactory.setsIntsChanneling(SetVar[] sets, IntVar[] ints)	Creates a constraint channeling set variables and integer variables : x in sets[y] <=> ints[x] = y
default Constraint	ISetConstraintFactory.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] = y
default Constraint	IIntConstraintFactory.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 Constraint	IIntConstraintFactory.square(IntVar var1, IntVar var2)	Creates a square constraint: var1 = var2^2
default Constraint	IIntConstraintFactory.subCircuit(IntVar[] vars, int offset, IntVar subCircuitLength)	Creates a subCircuit constraint which ensures that
default Constraint	IIntConstraintFactory.subPath(IntVar[] vars, IntVar start, IntVar end, int offset, IntVar SIZE)	Creates a subPath constraint which ensures that
default Constraint	IIntConstraintFactory.sum(BoolVar[] vars, String operator, IntVar sum)	Creates a sum constraint.
default Constraint	IIntConstraintFactory.sum(BoolVar[] vars, String operator, IntVar sum, int minCardForDecomp)	Creates a sum constraint.
default Constraint	IIntConstraintFactory.sum(IntVar[] vars, String operator, int sum)	Creates a sum constraint.
default Constraint	IIntConstraintFactory.sum(IntVar[] vars, String operator, int sum, int minCardForDecomp)	Creates a sum constraint.
default Constraint	IIntConstraintFactory.sum(IntVar[] vars, String operator, IntVar sum)	Creates a sum constraint.
default Constraint	IIntConstraintFactory.sum(IntVar[] vars, String operator, IntVar sum, int minCardForDecomp)	Creates a sum constraint.
default Constraint	ISetConstraintFactory.sum(SetVar set, IntVar sum)	Creates a constraint summing elements of set sum{i | i in set} = sum
default Constraint	ISetConstraintFactory.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 Constraint	ISetConstraintFactory.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 Constraint	IIntConstraintFactory.table(IntVar[] vars, Tuples tuples)	Creates a table constraint specifying that the sequence of variables vars must belong to the list of tuples (or must NOT belong in case of infeasible tuples) Default configuration with GACSTR+ algorithm for feasible tuples and GAC3rm otherwise
default Constraint	IIntConstraintFactory.table(IntVar[] vars, Tuples tuples, String algo)	Creates a table constraint, with the specified algorithm defined algo
default Constraint	IIntConstraintFactory.table(IntVar var1, IntVar var2, Tuples tuples)	Create a table constraint over a couple of variables var1 and var2 Uses AC3rm algorithm by default
default Constraint	IIntConstraintFactory.table(IntVar var1, IntVar var2, Tuples tuples, String algo)	Creates a table constraint over a couple of variables var1 and var2: - AC2001: table constraint which applies the AC2001 algorithm, - AC3: table constraint which applies the AC3 algorithm, - AC3rm: table constraint which applies the AC3 rm algorithm, - AC3bit+rm (default): table constraint which applies the AC3 bit+rm algorithm, - FC: table constraint which applies forward checking algorithm.
default Constraint	IIntConstraintFactory.times(IntVar X, int Y, IntVar Z)	Creates a multiplication constraint: X * Y = Z
default Constraint	IIntConstraintFactory.times(IntVar X, IntVar Y, int Z)	Creates a multiplication constraint: X * Y = Z
default Constraint	IIntConstraintFactory.times(IntVar X, IntVar Y, IntVar Z)	Creates a multiplication constraint: X * Y = Z
default Constraint	IIntConstraintFactory.tree(IntVar[] succs, IntVar nbTrees)	Creates a tree constraint.
default Constraint	IIntConstraintFactory.tree(IntVar[] succs, IntVar nbTrees, int offset)	Creates a tree constraint.
default Constraint	ISetConstraintFactory.union(IntVar[] ints, SetVar union)	Creates a constraint ensuring that union is exactly the union of values taken by ints,

Method parameters in org.chocosolver.solver.constraints with type arguments of type IntVar

Modifier and Type	Method	Description
static void	Propagator.defaultExplain(Propagator prop, ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	Propagator.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	Propagator.forEachIntVar(Consumer<IntVar> action)

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 with parameters of type IntVar

Modifier and Type	Method	Description
void	PropDistanceXYC.filterFromVarToVar(IntVar var1, IntVar var2)	Initial propagation in case of EQ and enumerated domains
void	PropDistanceXYC.filterGTonVar(IntVar v0, IntVar v1)	In case of a GT, due to a modification on v0 domain
void	PropDistanceXYC.filterLTonVar(IntVar v0, IntVar v1)	In case of a LT, due to a modification on v0 domain
void	PropDistanceXYC.filterOnInf(IntVar v0, IntVar v1)	In case of a EQ, due to a modification of the lower bound of v0
void	PropDistanceXYC.filterOnInst(IntVar v, int val)	In case of a EQ, due to the instantion to one variable to val
void	PropDistanceXYC.filterOnSup(IntVar v0, IntVar v1)	In case of a EQ, due to a modification of the upper bound of v0

Method parameters in org.chocosolver.solver.constraints.binary with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropEqualX_Y.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropEqualX_YC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropEqualXY_C.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropGreaterOrEqualX_Y.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropGreaterOrEqualX_YC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropGreaterOrEqualXY_C.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropLessOrEqualXY_C.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropNotEqualX_Y.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropNotEqualX_YC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropNotEqualXY_C.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

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)
PropModXY(IntVar x, int mod, IntVar y)
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 = z
PropSquare(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 Constraint	ElementFactory.detect(IntVar VALUE, int[] TABLE, IntVar INDEX, int OFFSET)	Detect and return the most adapted Element propagator wrt to the values in TABLE

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 Tuples	TuplesFactory.absolute(IntVar VAR1, IntVar VAR2)	Generate valid tuples for absolute constraint: VAR1 = |VAR2|
static Tuples	TuplesFactory.allDifferent(IntVar... VARS)	Generate valid tuples for allDifferent constraint
static Tuples	TuplesFactory.allEquals(IntVar... VARS)	Generate valid tuples for allEquals constraint
static Tuples	TuplesFactory.arithm(IntVar VAR1, String OP, IntVar VAR2)	Generate valid tuples for VAR1 OP VAR2, where OP in {"=", "!
static boolean	TuplesFactory.canBeTupled(IntVar... VARS)	Check whether the intension constraint to extension constraint substitution is enabled and can be achieved
ESat	Tuples.check(IntVar... vars)	Checks entailment of a table constraint over vars with this Tuples object
static Tuples	TuplesFactory.element(IntVar VALUE, int[] TABLE, IntVar INDEX, int OFFSET)	Generate valid tuples for an element constraint : TABLE[INDEX-OFFSET] = VALUE
static Tuples	TuplesFactory.eucl_div(IntVar DIVIDEND, IntVar DIVISOR, IntVar RESULT)	Generate valid tuples for euclidean division constraint: DIVIDEND / DIVISOR = RESULT, rounding towards 0
static Tuples	TuplesFactory.generateTuples(TupleValidator filter, boolean feasible, IntVar... vars)	A method that generates all tuples from a set of variables and stores (and returns) the valid tuples wrt to the filter.
static Tuples	TuplesFactory.lex_chain_less(IntVar... VARS)	Generate valid tuples for lexChainLess constraint
static Tuples	TuplesFactory.lex_chain_less_eq(IntVar... VARS)	Generate valid tuples for lexChainLessEq constraint
static Tuples	TuplesFactory.maximum(IntVar VAR1, IntVar VAR2, IntVar MAX)	Generate valid tuples for minus constraint: MAX = max(VAR1,VAR2)
static Tuples	TuplesFactory.minimum(IntVar VAR1, IntVar VAR2, IntVar MIN)	Generate valid tuples for minimum constraint: MIN = min(VAR1,VAR2)
static Tuples	TuplesFactory.minus(IntVar VAR1, IntVar VAR2, IntVar RESULT)	Generate valid tuples for minus constraint: VAR1 - VAR2 = RESULT
static Tuples	TuplesFactory.modulo(IntVar VAR1, int m, IntVar VAR2)	Generate valid tuples for minimum constraint: VAR1 % m = VAR2
static Tuples	TuplesFactory.modulo(IntVar VAR1, IntVar VAR2, IntVar RES)	Generate valid tuples for minimum constraint: VAR1 % VAR2 = RES
static Tuples	TuplesFactory.plus(IntVar VAR1, IntVar VAR2, IntVar RESULT)	Generate valid tuples for plus constraint: VAR1 + VAR2 = RESULT
static Tuples	TuplesFactory.power(IntVar VAR1, IntVar VAR2, int POWER)	Generate valid tuples for absolute constraint: VAR1 = VAR2^POWER
static Tuples	TuplesFactory.scalar(IntVar[] VARS, int[] COEFFS, String OPERATOR, IntVar SCALAR, int SCALAR_COEFF, int CSTE)	Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALAR + CSTE with OPERATOR in {"=", "!
static Tuples	TuplesFactory.scalar(IntVar[] VARS, int[] COEFFS, IntVar SCALAR, int SCALAR_COEFF)	Generate valid tuples for ∑i in |VARS|VARSi*COEFFSi OPERATOR SCALAR
static Tuples	TuplesFactory.square(IntVar VAR1, IntVar VAR2)	Generate valid tuples for absolute constraint: VAR1 = VAR2^2
static Tuples	TuplesFactory.sum(IntVar[] VARS, String OPERATOR, IntVar SUM, int CSTE)	Generate valid tuples for ∑i in |VARS|VARSi OPERATOR SUM + CSTE with OPERATOR in {"=", "!
static Tuples	TuplesFactory.times(IntVar VAR1, IntVar VAR2, IntVar RESULT)	Generate valid tuples for times constraint: VAR1 * VAR2 = RESULT

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 IntVar	PropBinCSP.v0
protected IntVar	PropBinCSP.v1

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.vars

Methods in org.chocosolver.solver.constraints.extension.nary with parameters of type IntVar

Modifier and Type	Method	Description
protected boolean	LargeRelation.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 Tuples
PropCompactTableStar(IntVar[] vars, Tuples tuples)	Create a propagator for table constraint Only for feasible Tuples
PropLargeCSP(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

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}| = nbLoops
PropKnapsack(IntVar[] itemOccurence, IntVar capacity, IntVar power, int[] weight, int[] energy)

Uses of IntVar in org.chocosolver.solver.constraints.nary.alldifferent

Method parameters in org.chocosolver.solver.constraints.nary.alldifferent with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropAllDiffInst.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

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 matching
PropAllDiffAdaptative(IntVar[] variables)	AllDifferent constraint for integer variables enables to control the cardinality of the matching
PropAllDiffBC(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
void	AlgoAllDiffBC.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
boolean	Condition.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 condition
PropCondAllDiffInst(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.map	Map 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 propagator
PropRegular(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 ICostAutomaton	CostAutomaton.makeMultiResources(IAutomaton auto, int[][][][] c, IntVar[] z)
static ICostAutomaton	CostAutomaton.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
void	StoredValuedDirectedMultiGraph.removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator, ICause aCause)
void	StoredValuedDirectedMultiGraph.updateLeft(int nid, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator)
void	StoredValuedDirectedMultiGraph.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)
void	StoredDirectedMultiGraph.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
boolean	StoredDirectedMultiGraph.removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, gnu.trove.stack.TIntStack[] updateLeft, gnu.trove.stack.TIntStack[] updateRight, Propagator<IntVar> propagator)
void	StoredDirectedMultiGraph.updateLeft(gnu.trove.stack.TIntStack updateLeft, gnu.trove.stack.TIntStack toRemove, int dim, boolean[] modBound, Propagator<IntVar> propagator)
void	StoredDirectedMultiGraph.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
void	StoredDirectedMultiGraph.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 PropLoadToItem
PropLoadToItem(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

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 event
PropSubcircuit(IntVar[] variables, int offset, IntVar length)
PropSubcircuitDominatorFilter(IntVar[] succs, int offSet, boolean adaptable)

Uses of IntVar in org.chocosolver.solver.constraints.nary.clauses

Methods in org.chocosolver.solver.constraints.nary.clauses with parameters of type IntVar

Modifier and Type	Method	Description
void	ClauseStore.add(IntVar[] vars, IntIterableRangeSet[] ranges)	Declare a new signed clause in this store
void	ClauseConstraint.addClause(IntVar[] vars, IntIterableRangeSet[] ranges)	Add a new clause to the clause store, like: (vars[0] ∈ ranges[0]) ∨ (vars[1] ∈ ranges[1]) ∨ ...
IntIterableRangeSet	ClauseBuilder.getInitialDomain(IntVar var)
static PropSignedClause	PropSignedClause.makeFromIn(IntVar[] vars, IntIterableRangeSet[] ranges)	Create a PropSignedClause instance considering that 'ranges' are allowed:
static PropSignedClause	PropSignedClause.makeFromOut(IntVar[] vars, IntIterableRangeSet[] ranges)	Create a PropSignedClause instance considering that 'ranges' are forbidden:
ClauseBuilder	ClauseBuilder.put(IntVar var, IntIterableRangeSet set)	Add a literal (var ∈ set) in this, considering that the entry is only added once (no need to perform internal operations).

Method parameters in org.chocosolver.solver.constraints.nary.clauses with type arguments of type IntVar

Modifier and Type	Method	Description
void	ClauseStore.SignedClause.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropSignedClause.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

Uses of IntVar in org.chocosolver.solver.constraints.nary.cnf

Method parameters in org.chocosolver.solver.constraints.nary.cnf with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropFalse.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropTrue.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

Uses of IntVar in org.chocosolver.solver.constraints.nary.count

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 Consistency
PropCountVar(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 IntVar	PropCumulative.capa
protected IntVar[]	PropCumulative.d
protected IntVar[]	PropCumulative.e
protected IntVar[]	PropCumulative.h
protected IntVar[]	PropCumulative.s

Methods 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 boolean	SweepHeiSortCumulFilter.checkSort(IntVar[] h, int nbT)
static IntVar[]	Cumulative.extract(Task[] tasks, IntVar[] heights, IntVar capa)
abstract void	CumulFilter.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 tasks
void	DefaultCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	DisjunctiveTaskIntervalFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	NaiveTimeCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	NRJCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	SweepCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	SweepHeiSortCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	TimeCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
protected void	TimeCumulFilter.filterInf(IntVar start, int elb, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)
protected void	TimeCumulFilter.filterSup(int sub, IntVar end, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)
protected void	HeightCumulFilter.pruneMax(IntVar[] e)
protected void	SweepCumulFilter.pruneMax(IntVar[] e, Propagator<IntVar> aCause)
protected void	HeightCumulFilter.pruneMin(IntVar[] s)
protected void	SweepCumulFilter.pruneMin(IntVar[] s, Propagator<IntVar> aCause)
protected void	SweepCumulFilter.removeNullDurations(IntVar[] d, ISet tasks)
protected boolean	HeightCumulFilter.sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)
protected boolean	SweepCumulFilter.sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)
protected boolean	SweepHeiSortCumulFilter.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 void	CumulFilter.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 tasks
void	DefaultCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	DisjunctiveTaskIntervalFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	NaiveTimeCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	NRJCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	SweepCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	SweepHeiSortCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
void	TimeCumulFilter.filter(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, ISet tasks, Propagator<IntVar> aCause)
protected void	TimeCumulFilter.filterInf(IntVar start, int elb, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)
protected void	TimeCumulFilter.filterSup(int sub, IntVar end, int dlb, int hlb, int min, int max, int[] time, int capaMax, Propagator<IntVar> aCause)
protected void	SweepCumulFilter.pruneMax(IntVar[] e, Propagator<IntVar> aCause)
protected void	SweepCumulFilter.pruneMin(IntVar[] s, Propagator<IntVar> aCause)
protected boolean	HeightCumulFilter.sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)
protected boolean	SweepCumulFilter.sweep(IntVar capamax, IntVar[] h, int nbT, Propagator<IntVar> aCause)
protected boolean	SweepHeiSortCumulFilter.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 constraint
Cumulative(Task[] tasks, IntVar[] heights, IntVar capacity, boolean graphBased, CumulFilter... filters)	Cumulative constraint
PropCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, boolean reactToFineEvt, CumulFilter... filters)	protected constructor, should not be called by a user
PropCumulative(IntVar[] s, IntVar[] d, IntVar[] e, IntVar[] h, IntVar capa, CumulFilter... filters)	Classical cumulative propagator
PropGraphCumulative(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

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 Constraint	GlobalCardinality.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

Method parameters in org.chocosolver.solver.constraints.nary.min_max with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropMax.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropMin.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

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 N
PropAtLeastNValues(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 filtering
PropAtLeastNValues_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 pairs
PropAtMostNValues(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 filtering
PropAtMostNValues_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.X

Constructors 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 D
Gi(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 void	R3.enforceEq(int i, int j, IntVar[] vars, Propagator aCause)
void	R.filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)
void	R1.filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)
void	R2.filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)
void	R3.filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause)
void	R4.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 new PropSort instance.
PropSort(IntVar[] x, IntVar[] y)	Creates a new PropSort instance.

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 IntVar	PropSumBool.sum	The resulting variable

Methods in org.chocosolver.solver.constraints.nary.sum with parameters of type IntVar

Modifier and Type	Method	Description
static Constraint	IntLinCombFactory.reduce(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, IntVar SCALAR, int minCardForDecomposition)	Reduce coefficients, and variables if required, when dealing with a scalar product
static Constraint	IntLinCombFactory.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 Constraint	IntLinCombFactory.selectScalar(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, int RESULT)	Select the most relevant ScalarProduct constraint to return
static Constraint	IntLinCombFactory.selectSum(IntVar[] VARS, int[] COEFFS, Operator OPERATOR, int RESULT, int nbools)	Select the most relevant Sum constraint to return

Method parameters in org.chocosolver.solver.constraints.nary.sum with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropSum.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
protected void	PropScalar.explainGlobal(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int F, int E)
protected void	PropSum.explainGlobal(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int F, int E)

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 by pos: those before pos (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

Method parameters in org.chocosolver.solver.constraints.reification with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropXeqCReif.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropXeqYCReif.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropXinSReif.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropXltCReif.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropXltYCReif.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

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 disjunction
PropXeqCReif(IntVar x, int c, BoolVar r)
PropXeqYCReif(IntVar x, IntVar y, int c, BoolVar b)
PropXinSReif(IntVar x, IntIterableRangeSet set, BoolVar r)
PropXltCReif(IntVar x, int c, BoolVar r)
PropXltYCReif(IntVar x, IntVar y, int c, 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| = cardinality
PropElement(IntVar index, SetVar[] array, int offSet, SetVar set)	Propagator for element constraint over sets states that array[index-offSet] = set
PropIntBoundedMemberSet(SetVar setVar, IntVar intVar)	Propagator for Member constraint val(intVar) is in setVar
PropIntChannel(SetVar[] setsV, IntVar[] intsV, int offSet1, int offSet2)	Channeling between set variables and integer variables x in sets[y-offSet1] <=> ints[x-offSet2] = y
PropIntEnumMemberSet(SetVar setVar, IntVar intVar)	Propagator for Member constraint val(intVar) is in setVar
PropMaxElement(SetVar setVar, int[] weights, int offset, IntVar max, boolean notEmpty)	Retrieves the maximum element induced by set MAX{weight[i-offset] | i in setVar} = max
PropMaxElement(SetVar setVar, IntVar max, boolean notEmpty)	Retrieves the maximum element of the set MAX{i | i in setVar} = max
PropMinElement(SetVar setVar, int[] weights, int offSet, IntVar min, boolean notEmpty)	Retrieves the minimum element induced by setVar MIN{weights[i-offSet] | i in setVar} = min
PropMinElement(SetVar setVar, IntVar min, boolean notEmpty)	Retrieves the minimum element of the set MIN(i | i in setVar) = min
PropNbEmpty(SetVar[] sets, IntVar nbEmpty)	Restricts the number of empty sets |{s in sets such that |s|=0}| = nbEmpty
PropNotMemberIntSet(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 boolean	PropDivXYZ.oppSign(IntVar a, IntVar b)	A take the opposite signs of B
protected boolean	PropDivXYZ.sameSign(IntVar a, IntVar b)	A take the signs of B

Method parameters in org.chocosolver.solver.constraints.ternary with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropXplusYeqZ.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

Constructors in org.chocosolver.solver.constraints.ternary with parameters of type IntVar

Constructor	Description
AbstractPropDistanceXYZ(IntVar[] vars)	Enforces |X - Y| op Z
PropDivXYZ(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)
PropModXYZ(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

Method parameters in org.chocosolver.solver.constraints.unary with type arguments of type IntVar

Modifier and Type	Method	Description
void	PropEqualXC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropGreaterOrEqualXC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropLessOrEqualXC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropMember.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropNotEqualXC.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	PropNotMember.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)

Constructors in org.chocosolver.solver.constraints.unary with parameters of type IntVar

Constructor	Description
Member(IntVar var, int lowerbound, int upperbound)
Member(IntVar var, int lb, int ub, IntIterableRangeSet values, Propagator prop)
Member(IntVar var, IntIterableRangeSet values)
NotMember(IntVar var, int lowerbound, int upperbound)
NotMember(IntVar var, int lb, int ub, IntIterableRangeSet values, Propagator prop)
NotMember(IntVar var, IntIterableRangeSet values)
PropEqualXC(IntVar var, int cste)
PropGreaterOrEqualXC(IntVar var, int cste)
PropLessOrEqualXC(IntVar var, int cste)
PropMember(IntVar var, IntIterableRangeSet range)	Maintain : var∈range
PropNotEqualXC(IntVar var, int cste)
PropNotMember(IntVar var, IntIterableRangeSet range)	Maintain : var∉range

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
IntVar	ArExpression.intVar()
IntVar	BiArExpression.intVar()
IntVar	IfArExpression.intVar()
IntVar	NaArExpression.intVar()
IntVar	UnArExpression.intVar()

Method parameters in org.chocosolver.solver.expression.discrete.arithmetic with type arguments of type IntVar

Modifier and Type	Method	Description
default void	ArExpression.extractVar(HashSet<IntVar> variables)	Extract the variables from this expression
void	IfArExpression.extractVar(HashSet<IntVar> variables)
default int	ArExpression.ieval(int[] values, Map<IntVar,Integer> map)
int	BiArExpression.ieval(int[] values, Map<IntVar,Integer> map)
int	IfArExpression.ieval(int[] values, Map<IntVar,Integer> map)
int	NaArExpression.ieval(int[] values, Map<IntVar,Integer> map)
int	UnArExpression.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
boolean	BiLoExpression.beval(int[] values, Map<IntVar,Integer> map)
boolean	NaLoExpression.beval(int[] values, Map<IntVar,Integer> map)
boolean	UnLoExpression.beval(int[] values, Map<IntVar,Integer> map)
void	BiLoExpression.extractVar(HashSet<IntVar> variables)
void	NaLoExpression.extractVar(HashSet<IntVar> variables)
void	UnLoExpression.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 IntVar	ReExpression.intVar()

Method parameters in org.chocosolver.solver.expression.discrete.relational with type arguments of type IntVar

Modifier and Type	Method	Description
boolean	BiReExpression.beval(int[] values, Map<IntVar,Integer> map)
boolean	NaReExpression.beval(int[] values, Map<IntVar,Integer> map)
default boolean	ReExpression.beval(int[] values, Map<IntVar,Integer> map)
void	BiReExpression.extractVar(HashSet<IntVar> variables)
void	NaReExpression.extractVar(HashSet<IntVar> variables)
void	ReExpression.extractVar(HashSet<IntVar> variables)	Extract the variables from this expression
default int	ReExpression.ieval(int[] values, Map<IntVar,Integer> map)

Uses of IntVar in org.chocosolver.solver.learn

Methods in org.chocosolver.solver.learn that return IntVar

Modifier and Type	Method	Description
abstract IntVar	Implications.getIntVarAt(int idx)	Get the IntVar declared in node idx
IntVar	LazyImplications.getIntVarAt(int idx)

Methods in org.chocosolver.solver.learn that return types with arguments of type IntVar

Modifier and Type	Method	Description
ValueSortedMap<IntVar>	ExplanationForSignedClause.getFront()
HashMap<IntVar,IntIterableRangeSet>	ExplanationForSignedClause.getLiterals()

Methods in org.chocosolver.solver.learn with parameters of type IntVar

Modifier and Type	Method	Description
void	ExplanationForSignedClause.addLiteral(IntVar var, IntIterableRangeSet dom, boolean pivot)	Add a signed literal (var ∈ dom) to this explanation.
abstract void	Implications.copyComplementSet(IntVar var, IntIterableRangeSet set, IntIterableRangeSet dest)	Copy in dest the complement of set wrt to root domain of var
void	LazyImplications.copyComplementSet(IntVar var, IntIterableRangeSet set, IntIterableRangeSet dest)
abstract void	Implications.findPredecessor(ValueSortedMap<IntVar> front, IntVar vi, int p)	Find the direct predecessor of a node, declared on variable vi, starting from node at position p.
void	LazyImplications.findPredecessor(ValueSortedMap<IntVar> front, IntVar vi, int p)	Find the direct predecessor of a node, declared on variable vi, starting from node at position p.
IntIterableRangeSet	ExplanationForSignedClause.getComplementSet(IntVar var)
abstract IntIterableRangeSet	Implications.getRootDomain(IntVar var)	Get the IntIterableRangeSet that represents domain of this variables as declared in the model
IntIterableRangeSet	LazyImplications.getRootDomain(IntVar var)
IntIterableRangeSet	ExplanationForSignedClause.getRootSet(IntVar var)
IntIterableRangeSet	ExplanationForSignedClause.getSet(IntVar var)
void	AbstractEventObserver.instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)	Explain the assignment to val of var due to cause.
void	EventRecorder.instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)	Explain the assignment to val of var due to cause.
abstract void	Implications.pushEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)	Push an event
void	LazyImplications.pushEvent(IntVar var, ICause cause, IntEventType evt, int one, int two, int three)
void	AbstractEventObserver.removeValue(IntVar var, int val, ICause cause)	Explain the removal of the val from var, due to cause.
void	EventRecorder.removeValue(IntVar var, int val, ICause cause)	Explain the removal of the val from var, due to cause.
void	AbstractEventObserver.updateLowerBound(IntVar var, int value, int old, ICause cause)	Explain the removal of [old,value[ from var, due to cause.
void	EventRecorder.updateLowerBound(IntVar var, int value, int old, ICause cause)	Explain the removal of [old,value[ from var, due to cause.
void	AbstractEventObserver.updateUpperBound(IntVar var, int value, int old, ICause cause)	Explain the removal of ]value,old] from var, due to cause.
void	EventRecorder.updateUpperBound(IntVar var, int value, int old, ICause cause)	Explain the removal of ]value,old] from var, due to cause.

Method parameters in org.chocosolver.solver.learn with type arguments of type IntVar

Modifier and Type	Method	Description
abstract void	Implications.collectNodesFromConflict(ContradictionException conflict, ValueSortedMap<IntVar> front)	Fill set with indices of nodes that throws the conflict
void	LazyImplications.collectNodesFromConflict(ContradictionException cft, ValueSortedMap<IntVar> front)
abstract void	Implications.findPredecessor(ValueSortedMap<IntVar> front, IntVar vi, int p)	Find the direct predecessor of a node, declared on variable vi, starting from node at position p.
void	LazyImplications.findPredecessor(ValueSortedMap<IntVar> front, IntVar vi, int p)	Find the direct predecessor of a node, declared on variable vi, starting from node at position p.
abstract void	Implications.predecessorsOf(int p, ValueSortedMap<IntVar> front)	Retrieve the nodes that are predecessors of node p in this and put them into set.
void	LazyImplications.predecessorsOf(int p, ValueSortedMap<IntVar> front)

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 uses IObjectiveManager.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 uses IObjectiveManager.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 solution
ObjectiveStrategy(IntVar objective, OptimizationPolicy policy)	Defines a branching strategy over the objective variable BEWARE: only activated after a first solution
ParetoOptimizer(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 Solution	IResolutionHelper.findLexOptimalSolution(IntVar[] objectives, boolean maximize, Criterion... stop)	Attempts optimize the value of the objectives variable w.r.t. to an optimization criteria.
default Solution	IResolutionHelper.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 INeighbor	INeighborFactory.blackBox(IntVar... vars)	Creates a black-box LNS neighbor
static IntNeighbor	INeighborFactory.propagationGuided(IntVar... vars)	Create a propagation guided neighborhood fixing variables based on constraint propagation Based on "Propagation-Guided LNS", Perronn Shaw and Furnon, CP2004
static IntNeighbor	INeighborFactory.random(IntVar... vars)	Create a random neighborhood fixing variables randomly
static IntNeighbor	INeighborFactory.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[]	IntNeighbor.variables

Method parameters in org.chocosolver.solver.search.loop.lns.neighbors with type arguments of type IntVar

Modifier and Type	Method	Description
void	IntNeighbor.forEachIntVar(Consumer<IntVar> action)

Constructors in org.chocosolver.solver.search.loop.lns.neighbors with parameters of type IntVar

Constructor	Description
IntNeighbor(IntVar[] variables)
PropagationGuidedNeighborhood(IntVar[] vars, int fgmtSize, int listSize, long seed)	Create a propagation-guided neighbor for LNS
RandomNeighborhood(IntVar[] vars, int level, long seed)	Create a neighbor for LNS which randomly selects variable to be part of a fragment
ReversePropagationGuidedNeighborhood(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 void	ISearchMonitorFactory.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 to DomOverWDeg and assign it to its lower bound
Decision<IntVar>	BoundSearch.getDecision()
static AbstractStrategy<IntVar>	Search.intVarSearch(IntVar... vars)	Builds a default search heuristics of integer variables Variable selection relies on Search.domOverWDegSearch(IntVar...) Value selection relies on InDomainBest for optimization and InDomainMin for satisfaction
static AbstractStrategy<IntVar>	Search.objectiveStrategy(IntVar objective, OptimizationPolicy optPolicy)	Defines a branching strategy over the objective variable Note that it is only activated after a first solution.

Methods 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 to DomOverWDeg and assign it to its lower bound
static IntStrategy	Search.inputOrderLBSearch(IntVar... vars)	Assigns the first non-instantiated variable to its lower bound.
static IntStrategy	Search.inputOrderUBSearch(IntVar... vars)	Assigns the first non-instantiated variable to its upper bound.
static IntStrategy	Search.intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)	Builds your own search strategy based on binary decisions.
static IntStrategy	Search.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 on Search.domOverWDegSearch(IntVar...) Value selection relies on InDomainBest for optimization and InDomainMin for satisfaction
static IntStrategy	Search.minDomLBSearch(IntVar... vars)	Assigns the non-instantiated variable of smallest domain size to its lower bound.
static IntStrategy	Search.minDomUBSearch(IntVar... vars)	Assigns the non-instantiated variable of smallest domain size to its upper bound.
static AbstractStrategy<IntVar>	Search.objectiveStrategy(IntVar objective, OptimizationPolicy optPolicy)	Defines a branching strategy over the objective variable Note that it is only activated after a first solution.
static IntStrategy	Search.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 bounded

Method 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 IntStrategy	Search.intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)	Builds your own search strategy based on binary decisions.
static IntStrategy	Search.intVarSearch(VariableSelector<IntVar> varSelector, IntValueSelector valSelector, DecisionOperator<IntVar> decisionOperator, IntVar... vars)	Builds your own search strategy based on binary decisions.
static IntStrategy	Search.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
IntDecision	DecisionMaker.makeIntDecision(IntVar var, DecisionOperator<IntVar> dop, int value)	Creates and returns an IntDecision: "var dop value".
void	IntDecision.set(IntVar v, int value, DecisionOperator<IntVar> assignment)	Instantiate this decision with the parameters

Method parameters in org.chocosolver.solver.search.strategy.decision with type arguments of type IntVar

Modifier and Type	Method	Description
void	IntDecision.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	IntDecision.forEachIntVar(Consumer<IntVar> action)
IntDecision	DecisionMaker.makeIntDecision(IntVar var, DecisionOperator<IntVar> dop, int value)	Creates and returns an IntDecision: "var dop value".
void	IntDecision.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
int	IntDomainBest.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainImpact.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainLast.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainMax.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainMedian.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainMiddle.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainMin.selectValue(IntVar var)
int	IntDomainRandom.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntDomainRandomBound.selectValue(IntVar var)	Selects and returns the value to constrained chosen variable with.
int	IntValueSelector.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.
IntDomainLast(Solution solution, IntValueSelector mainSelector, BiPredicate<IntVar,Integer> condition)	Create a value selector that returns the value in the last solution.
IntDomainMiddle(ToDoubleFunction<IntVar> middle, boolean roudingPolicy)

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
IntVar	AntiFirstFail.getVariable(IntVar[] variables)
IntVar	FirstFail.getVariable(IntVar[] variables)
IntVar	Largest.getVariable(IntVar[] variables)
IntVar	MaxRegret.getVariable(IntVar[] variables)
IntVar	Smallest.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
int	ActivityBased.compare(IntVar o1, IntVar o2)
Decision<IntVar>	ActivityBased.computeDecision(IntVar variable)
Decision<IntVar>	DomOverWDeg.computeDecision(IntVar variable)
Decision<IntVar>	ImpactBased.computeDecision(IntVar variable)
double	AntiFirstFail.evaluate(IntVar variable)
double	FirstFail.evaluate(IntVar variable)
double	Largest.evaluate(IntVar variable)
double	MaxRegret.evaluate(IntVar variable)
double	Smallest.evaluate(IntVar variable)
double	ActivityBased.getActivity(IntVar var)
IntVar	AntiFirstFail.getVariable(IntVar[] variables)
IntVar	FirstFail.getVariable(IntVar[] variables)
IntVar	Largest.getVariable(IntVar[] variables)
IntVar	MaxRegret.getVariable(IntVar[] variables)
IntVar	Smallest.getVariable(IntVar[] variables)
void	ActivityBased.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 selector
ImpactBased(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.
RandomVar(long seed, IntVar[] scope)	Random variable selector & evaluator more efficient with fast restart

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 IntDecision	AbstractStrategy.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
interface	BoolVar	CPRU r544: remove default implementation

Methods in org.chocosolver.solver.variables that return IntVar

Modifier and Type	Method	Description
IntVar	Variable.asIntVar()
IntVar	SetVar.getCard()	get the constrained cardinality variable of this set.
IntVar	Task.getDuration()
IntVar	Task.getEnd()
IntVar	Task.getStart()
default IntVar	IViewFactory.intAbsView(IntVar var)	Creates a view over var such that: |var|.
default IntVar	IViewFactory.intAffineView(int a, IntVar x, int b)	Creates an affine view over x such that: a.x + b.
default IntVar	IViewFactory.intMinusView(IntVar var)	Creates a view over var equal to -var.
default IntVar	IViewFactory.intOffsetView(IntVar var, int cste)	Creates a view based on var, equal to var+cste.
default IntVar	IViewFactory.intScaleView(IntVar var, int cste)	Creates a view over var equal to var*cste.
default IntVar	BoolVar.intVar()
default IntVar	IntVar.intVar()
default IntVar	IVariableFactory.intVar(int value)	Create a constant integer variable equal to value
default IntVar	IVariableFactory.intVar(int[] values)	Create an integer variable of initial domain values.
default IntVar	IVariableFactory.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 otherwise
default IntVar	IVariableFactory.intVar(int lb, int ub, boolean boundedDomain)	Create an integer variable of initial domain [lb, ub]
default IntVar	IVariableFactory.intVar(String name, int value)	Create a constant integer variable equal to value
default IntVar	IVariableFactory.intVar(String name, int[] values)	Create an integer variable of initial domain values Uses an enumerated domain that supports holes
default IntVar	IVariableFactory.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 otherwise
default IntVar	IVariableFactory.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 values
default IntVar[]	IVariableFactory.intVarArray(int size, int lb, int ub)	Creates an array of size integer variables, taking their domain in [lb, ub] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwise
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 values
default IntVar[]	IVariableFactory.intVarArray(String name, int size, int lb, int ub)	Creates an array of size integer variables, taking their domain in [lb, ub] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwise
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 values
default 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] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwise
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 values
default 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] Uses an enumerated domain if ub-lb is small, and a bounded domain otherwise
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
static int	IViewFactory.checkDeclaredView(IntVar x, int c, Class clazz)
default IntVar	IViewFactory.intAbsView(IntVar var)	Creates a view over var such that: |var|.
default IntVar	IViewFactory.intAffineView(int a, IntVar x, int b)	Creates an affine view over x such that: a.x + b.
default BoolVar	IViewFactory.intEqView(IntVar x, int c)	Creates an view over x such that: (x = c) ⇔ b.
default BoolVar	IViewFactory.intGeView(IntVar x, int c)	Creates an view over x such that: (x ≥ c) ⇔ b.
default BoolVar	IViewFactory.intLeView(IntVar x, int c)	Creates an view over x such that: (x ≤ c) ⇔ b.
default IntVar	IViewFactory.intMinusView(IntVar var)	Creates a view over var equal to -var.
default BoolVar	IViewFactory.intNeView(IntVar x, int c)	Creates an view over x such that: (x !
default IntVar	IViewFactory.intOffsetView(IntVar var, int cste)	Creates a view based on var, equal to var+cste.
default IntVar	IViewFactory.intScaleView(IntVar var, int cste)	Creates a view over var equal to var*cste.
default RealVar	IViewFactory.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 RealVar
default 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 RealVar
void	SetVar.setCard(IntVar card)	ensure a variable is equal to the cardinality of this set.
default Task	IVariableFactory.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 Task	IVariableFactory.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 Task	IVariableFactory.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 variables

Method parameters in org.chocosolver.solver.variables with type arguments of type IntVar

Modifier and Type	Method	Description
default void	BoolVar.extractVar(HashSet<IntVar> variables)
default void	IntVar.forEachIntVar(Consumer<IntVar> action)

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
class	BitsetArrayIntVarImpl	IntVar implementation for quite small domains bit with very distant values e.g. {-51900,42,235923}
class	BitsetIntVarImpl
class	BoolVarImpl
class	FixedBoolVarImpl	A constant view specific to boolean variable
class	FixedIntVarImpl	A IntVar with one domain value.
class	IntervalIntVarImpl

Methods in org.chocosolver.solver.variables.impl that return IntVar

Modifier and Type	Method	Description
IntVar	AbstractVariable.asIntVar()
IntVar	SetVarImpl.getCard()

Methods in org.chocosolver.solver.variables.impl with parameters of type IntVar

Modifier and Type	Method	Description
void	SetVarImpl.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
class	IntView<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
class	BoolNotView	A view for boolean variable, that enforce not(b).
class	EqView	declare an BoolVar based on X and C, such as (X = C) is reified by this.
class	IntBoolView	An abstract class for boolean views over IntVar.
class	IntView<I extends IntVar>	"A view implements the same operations as a variable.
class	LeqView	declare an BoolVar based on X and C, such as (X <= C) is reified by this.
class	MinusView	View for -V, where V is a IntVar or view
class	OffsetView	declare an IntVar based on X and C, such as X + C Based on "Views and Iterators for Generic Constraint Implementations" C.
class	ScaleView	declare an IntVar based on X and C, such as X * C

Fields in org.chocosolver.solver.variables.view declared as IntVar

Modifier and Type	Field	Description
protected I	IntView.var	Observed variable
protected IntVar	RealView.var

Methods in org.chocosolver.solver.variables.view that return IntVar

Modifier and Type	Method	Description
IntVar	IntView.getVariable()
IntVar	IView.getVariable()	Return the basis variable
IntVar	RealView.getVariable()

Method parameters in org.chocosolver.solver.variables.view with type arguments of type IntVar

Modifier and Type	Method	Description
void	BoolNotView.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	EqView.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
default void	IView.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	LeqView.explain(ExplanationForSignedClause explanation, ValueSortedMap<IntVar> front, Implications ig, int p)
void	RealView.explain(ExplanationForSignedClause clause, ValueSortedMap<IntVar> front, Implications ig, int p)
void	IntView.forEachIntVar(Consumer<IntVar> action)

Constructors in org.chocosolver.solver.variables.view with parameters of type IntVar

Constructor	Description
EqView(IntVar var, int cste)	A boolean view based on var such that var = cste
LeqView(IntVar var, int cste)	A boolean view based on var such that var ≤ cste
MinusView(IntVar var)	Create a -var view
OffsetView(IntVar var, int cste)	A view based on var such that var + cste
RealView(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 using for(int value:var){ ... } that is equivalent to int 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 tuples
MultivaluedDecisionDiagram(IntVar[] VARIABLES, Tuples TUPLES, boolean compactOnce, boolean sortTuple)	Create an MDD based on an array of flatten domains and a set of tuples

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 void	IntIterableSetUtils.copyIn(IntVar var, IntIterableRangeSet set)	Copy the domain of var in set.
static IntIterableRangeSet	IntIterableSetUtils.extract(IntVar var)	Copy the domain of var into an IntIterableRangeSet.
static boolean	IntIterableSetUtils.includedIn(IntVar var, IntIterableRangeSet set)
static boolean	IntIterableSetUtils.intersect(IntVar var, IntIterableRangeSet set)
static boolean	IntIterableSetUtils.notIncludedIn(IntVar var, IntIterableRangeSet set)
static void	IntIterableSetUtils.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 Arrays
static IntVar[]	ArrayUtils.concat(IntVar[] array, IntVar... elements)	Append elements at the end of another array
static IntVar[]	VariableUtils.toIntVar(Model model, int... values)	Transform an array of int to an array of fixed IntVar

Methods in org.chocosolver.util.tools with parameters of type IntVar

Modifier and Type	Method	Description
static IntVar[]	ArrayUtils.append(IntVar[]... toAppend)	Append two Arrays
static 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 array
static long	VariableUtils.domainCardinality(IntVar... vars)
static boolean	VariableUtils.intersect(IntVar x, IntVar y)
static double	VariableUtils.searchSpaceSize(IntVar[] vars)	Compute the search space size