Uses of Class
com.google.ortools.constraintsolver.IntVar
Packages that use IntVar
-
Uses of IntVar in com.google.ortools.constraintsolver
Subclasses of IntVar in com.google.ortools.constraintsolverMethods in com.google.ortools.constraintsolver that return IntVarModifier and TypeMethodDescriptionRoutingModel.activeVar(long index) Returns the active variable of the node corresponding to index.RoutingModel.activeVehicleVar(int vehicle) Returns the active variable of the vehicle.RoutingModel.applyLocks(long[] locks) Applies a lock chain to the next search.Pack.assignVar(int var_index, int bin_index) BaseIntExpr.castToVar()RoutingModel.costVar()Returns the global cost variable which is being minimized.IntVar[]RoutingDimension.cumuls()Like CumulVar(), TransitVar(), SlackVar() but return the whole variable
vectors instead (indexed by int64_t var index).RoutingDimension.cumulVar(long index) Get the cumul, transit and slack variables for the given node (given as
int64_t var index).IntVar[]RoutingDimension.fixed_transits()RoutingDimension.fixedTransitVar(long index) Solver.IntegerCastInfo.getVariable()BooleanVar.isDifferent(long constant) IntVar.isDifferent(long constant) BooleanVar.isEqual(long constant) IntVar.isEqual(long constant) IsEqualBooleanVar.isGreaterOrEqual(long constant) IntVar.isGreaterOrEqual(long constant) BooleanVar.isLessOrEqual(long constant) IntVar.isLessOrEqual(long constant) Solver.makeBoolVar()MakeBoolVar will create a variable with a {0, 1} domain.Solver.makeBoolVar(String name) MakeBoolVar will create a variable with a {0, 1} domain.IntVar[]Solver.makeBoolVarArray(int count) IntVar[]Solver.makeBoolVarArray(int count, String name) Solver.makeIntConst(long val) IntConst will create a constant expression.Solver.makeIntConst(long val, String name) IntConst will create a constant expression.Solver.makeIntVar(int[] values) MakeIntVar will create a variable with the given sparse domain.Solver.makeIntVar(int[] values, String name) MakeIntVar will create a variable with the given sparse domain.Solver.makeIntVar(long[] values) MakeIntVar will create a variable with the given sparse domain.Solver.makeIntVar(long[] values, String name) MakeIntVar will create a variable with the given sparse domain.Solver.makeIntVar(long min, long max) MakeIntVar will create the best range based int var for the bounds given.Solver.makeIntVar(long min, long max, String name) MakeIntVar will create the best range based int var for the bounds given.IntVar[]Solver.makeIntVarArray(int count, long min, long max) IntVar[]Solver.makeIntVarArray(int count, long min, long max, String name) Solver.makeIsBetweenVar(IntExpr v, long l, long u) Solver.makeIsDifferentCstVar(IntExpr var, long value) status var of (var !Solver.makeIsDifferentCstVar(IntExpr v1, IntExpr v2) status var of (v1 !Solver.makeIsEqualCstVar(IntExpr var, long value) status var of (var == value)Solver.makeIsEqualVar(IntExpr v1, IntExpr v2) status var of (v1 == v2)Solver.makeIsGreaterCstVar(IntExpr var, long value) status var of (var > value)Solver.makeIsGreaterOrEqualCstVar(IntExpr var, long value) status var of (var >= value)Solver.makeIsGreaterOrEqualVar(IntExpr left, IntExpr right) status var of (left >= right)Solver.makeIsGreaterVar(IntExpr left, IntExpr right) status var of (left > right)Solver.makeIsLessCstVar(IntExpr var, long value) status var of (var < value)Solver.makeIsLessOrEqualCstVar(IntExpr var, long value) status var of (var <= value)Solver.makeIsLessOrEqualVar(IntExpr left, IntExpr right) status var of (left <= right)Solver.makeIsLessVar(IntExpr left, IntExpr right) status var of (left < right)Solver.makeIsMemberVar(IntExpr expr, int[] values) Solver.makeIsMemberVar(IntExpr expr, long[] values) BaseObjectiveMonitor.MinimizationVar(int index) ObjectiveMonitor.MinimizationVar(int index) SequenceVar.next(int index) Returns the next of the index_th interval of the sequence.IntVar[]RoutingModel.nexts()Returns all next variables of the model, such that Nexts(i) is the next
variable of the node corresponding to i.RoutingModel.nextVar(long index) Returns the next variable of the node corresponding to index.Assignment.objective()Assignment.ObjectiveFromIndex(int index) BaseObjectiveMonitor.ObjectiveVar(int index) ObjectiveMonitor.ObjectiveVar(int index) Solver.registerIntVar(IntVar var) Registers a new IntVar and wraps it inside a TraceIntVar if necessary.RoutingModel.ResourceVar(int vehicle, int resource_group) Returns the resource variable for the given vehicle index in the given
resource group.IntVar[]RoutingModel.ResourceVars(int resource_group) Returns vehicle resource variables for a given resource group, such that
ResourceVars(r_g)[v] is the resource variable for vehicle 'v' in resource
group 'r_g'.static final IntVar[]mainJNI.RoutingDimension_cumuls(long jarg1, RoutingDimension jarg1_) static final IntVar[]mainJNI.RoutingDimension_fixed_transits(long jarg1, RoutingDimension jarg1_) static final IntVar[]mainJNI.RoutingDimension_slacks(long jarg1, RoutingDimension jarg1_) static final IntVar[]mainJNI.RoutingDimension_transits(long jarg1, RoutingDimension jarg1_) static final IntVar[]mainJNI.RoutingModel_nexts(long jarg1, RoutingModel jarg1_) static final IntVar[]mainJNI.RoutingModel_ResourceVars(long jarg1, RoutingModel jarg1_, int jarg2) static final IntVar[]mainJNI.RoutingModel_vehicleVars(long jarg1, RoutingModel jarg1_) IntVar[]RoutingDimension.slacks()RoutingDimension.slackVar(long index) CastConstraint.target_var()IntVar[]RoutingDimension.transits()RoutingDimension.transitVar(long index) BaseIntExpr.var()Constraint.var()Creates a Boolean variable representing the status of the constraint
(false = constraint is violated, true = constraint is satisfied).IntExpr.var()Creates a variable from the expression.IntVar.var()IntVarElement.var()IntVarLocalSearchFilter.var(int index) IntVarLocalSearchOperator.var(long index) Returns the variable of given index.OptimizeVar.var()Returns the variable that is optimized.IntExpr.varWithName(String name) Creates a variable from the expression and set the name of the
resulting var.RoutingModel.VehicleRouteConsideredVar(int vehicle) Returns the variable specifying whether or not the given vehicle route is
considered for costs and constraints.RoutingModel.vehicleVar(long index) Returns the vehicle variable of the node corresponding to index.IntVar[]RoutingModel.vehicleVars()Returns all vehicle variables of the model, such that VehicleVars(i) is
the vehicle variable of the node corresponding to i.Methods in com.google.ortools.constraintsolver with parameters of type IntVarModifier and TypeMethodDescriptionvoidbooleanvoidvoidAdd API.voidAssignmentIntContainer.addAtPosition(IntVar var, int position) Advanced usage: Adds element at a given position; position has to have
been allocated with AssignmentContainer::Resize() beforehand.voidSolver.addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr) Adds 'constraint' to the solver and marks it as a cast constraint, that
is, a constraint created calling Var() on an expression.voidPack.addCountAssignedItemsDimension(IntVar count_var) This dimension links 'count_var' to the actual number of items
assigned to a bin in the pack.voidPack.addCountUsedBinDimension(IntVar count_var) This dimension links 'count_var' to the actual number of bins used in the
pack.voidSymmetryBreaker.addIntegerVariableEqualValueClause(IntVar var, long value) voidSymmetryBreaker.addIntegerVariableGreaterOrEqualValueClause(IntVar var, long value) voidSymmetryBreaker.addIntegerVariableLessOrEqualValueClause(IntVar var, long value) voidAssignment.addObjective(IntVar v) voidSolutionCollector.addObjective(IntVar objective) voidAssignment.AddObjectives(IntVar[] vars) voidSolutionCollector.AddObjectives(IntVar[] objectives) voidPack.addSumVariableWeightsLessOrEqualConstantDimension(IntVar[] usage, long[] capacity) This dimension imposes:
forall b in bins,
sum (i in items: usage[i] * is_assigned(i, b)) <= capacity[b]
where is_assigned(i, b) is true if and only if item i is assigned
to the bin b.
This can be used to model shapes of items by linking variables of
the same item on parallel dimensions with an allowed assignment
constraint.voidRoutingModel.addToAssignment(IntVar var) Adds an extra variable to the vehicle routing assignment.voidRoutingModel.addVariableMaximizedByFinalizer(IntVar var) Adds a variable to maximize in the solution finalizer (see above for
information on the solution finalizer).voidRoutingModel.addVariableMinimizedByFinalizer(IntVar var) Adds a variable to minimize in the solution finalizer.voidRoutingModel.addVariableTargetToFinalizer(IntVar var, long target) Add a variable to set the closest possible to the target value in the
solution finalizer.voidAdd variables to "track" to the filter.voidvoidPack.addWeightedSumEqualVarDimension(long[] weights, IntVar[] loads) This dimension imposes that for all bins b, the weighted sum
(weights[i]) of all objects i assigned to 'b' is equal to loads[b].voidPack.addWeightedSumEqualVarDimension(LongBinaryOperator weights, IntVar[] loads) This dimension imposes that for all bins b, the weighted sum
(weights->Run(i, b)) of all objects i assigned to 'b' is equal to
loads[b].voidPack.addWeightedSumOfAssignedDimension(long[] weights, IntVar cost_var) This dimension enforces that cost_var == sum of weights[i] for
all objects 'i' assigned to a bin.voidRoutingModel.AddWeightedVariableMaximizedByFinalizer(IntVar var, long cost) Adds a variable to maximize in the solution finalizer, with a weighted
priority: the higher the more priority it has.voidRoutingModel.AddWeightedVariableMinimizedByFinalizer(IntVar var, long cost) Adds a variable to minimize in the solution finalizer, with a weighted
priority: the higher the more priority it has.voidRoutingModel.AddWeightedVariableTargetToFinalizer(IntVar var, long target, long cost) Same as above with a weighted priority: the higher the cost, the more
priority it has to be set close to the target value.static booleanmain.areAllBooleans(IntVar[] vars) static final booleanmainJNI.areAllBooleans(IntVar[] jarg1) static booleanmain.areAllBound(IntVar[] vars) static final booleanmainJNI.areAllBound(IntVar[] jarg1) static booleanmain.areAllBoundTo(IntVar[] vars, long value) Returns true if all variables are assigned to 'value'.static final booleanmainJNI.areAllBoundTo(IntVar[] jarg1, long jarg2) static final voidmainJNI.Assignment_activate__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final booleanmainJNI.Assignment_activated__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.Assignment_add__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Assignment_add__SWIG_1(long jarg1, Assignment jarg1_, IntVar[] jarg2) static final voidmainJNI.Assignment_addObjective(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Assignment_AddObjectives(long jarg1, Assignment jarg1_, IntVar[] jarg2) static final booleanmainJNI.Assignment_bound(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final booleanmainJNI.Assignment_contains__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Assignment_deactivate__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.Assignment_fastAdd__SWIG_0(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.Assignment_max(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.Assignment_min(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Assignment_setMax(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.Assignment_setMin(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.Assignment_setRange(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4) static final voidmainJNI.Assignment_setValue(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Assignment_value(long jarg1, Assignment jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.AssignmentIntContainer_add(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.AssignmentIntContainer_addAtPosition(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_, int jarg3) static final booleanmainJNI.AssignmentIntContainer_contains(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.AssignmentIntContainer_element__SWIG_0(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.AssignmentIntContainer_fastAdd(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.AssignmentIntContainer_mutableElement__SWIG_0(long jarg1, AssignmentIntContainer jarg1_, long jarg2, IntVar jarg2_) booleanSolver.castExpression(IntVar var) Internal.booleanbooleanvoidAssignment.deactivate(IntVar var) static final voidmainJNI.DecisionVisitor_visitSetVariableValue(long jarg1, DecisionVisitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.DecisionVisitor_visitSetVariableValueSwigExplicitDecisionVisitor(long jarg1, DecisionVisitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.DecisionVisitor_visitSplitVariableDomain(long jarg1, DecisionVisitor jarg1_, long jarg2, IntVar jarg2_, long jarg3, boolean jarg4) static final voidmainJNI.DecisionVisitor_visitSplitVariableDomainSwigExplicitDecisionVisitor(long jarg1, DecisionVisitor jarg1_, long jarg2, IntVar jarg2_, long jarg3, boolean jarg4) voidPropagationMonitor.endProcessingIntegerVariable(IntVar var) Adds without checking if variable has been previously added.Adds element without checking its presence in the container.ModelCache.findVarArrayConstantArrayExpression(IntVar[] vars, long[] values, int type) Var Array Constant Array Expressions.ModelCache.findVarArrayConstantExpression(IntVar[] vars, long value, int type) Var Array Constant Expressions.ModelCache.findVarArrayExpression(IntVar[] vars, int type) Var Array Expressions.ModelCache.findVarConstantArrayExpression(IntVar var, long[] values, int type) Var Constant Array Expressions.ModelCache.findVarConstantConstantConstraint(IntVar var, long value1, long value2, int type) Var Constant Constant Constraints.ModelCache.findVarConstantConstantExpression(IntVar var, long value1, long value2, int type) Var Constant Constant Expressions.ModelCache.findVarConstantConstraint(IntVar var, long value, int type) Var Constant Constraints.static longintvoidModelCache.insertVarArrayConstantArrayExpression(IntExpr expression, IntVar[] var, long[] values, int type) voidModelCache.insertVarArrayConstantExpression(IntExpr expression, IntVar[] var, long value, int type) voidModelCache.insertVarArrayExpression(IntExpr expression, IntVar[] vars, int type) voidModelCache.insertVarConstantArrayExpression(IntExpr expression, IntVar var, long[] values, int type) voidModelCache.insertVarConstantConstantConstraint(Constraint ct, IntVar var, long value1, long value2, int type) voidModelCache.insertVarConstantConstantExpression(IntExpr expression, IntVar var, long value1, long value2, int type) voidModelCache.insertVarConstantConstraint(Constraint ct, IntVar var, long value, int type) static final voidmainJNI.IntVar_accept(long jarg1, IntVar jarg1_, long jarg2, ModelVisitor jarg2_) static final booleanmainJNI.IntVar_contains(long jarg1, IntVar jarg1_, long jarg2) static final intmainJNI.IntVar_index(long jarg1, IntVar jarg1_) static final longmainJNI.IntVar_isDifferent(long jarg1, IntVar jarg1_, long jarg2) static final longmainJNI.IntVar_isEqual(long jarg1, IntVar jarg1_, long jarg2) static final longmainJNI.IntVar_isGreaterOrEqual(long jarg1, IntVar jarg1_, long jarg2) static final longmainJNI.IntVar_isLessOrEqual(long jarg1, IntVar jarg1_, long jarg2) static final booleanmainJNI.IntVar_isVar(long jarg1, IntVar jarg1_) static final longmainJNI.IntVar_makeDomainIterator(long jarg1, IntVar jarg1_, boolean jarg2) static final longmainJNI.IntVar_makeHoleIterator(long jarg1, IntVar jarg1_, boolean jarg2) static final longmainJNI.IntVar_oldMax(long jarg1, IntVar jarg1_) static final longmainJNI.IntVar_oldMin(long jarg1, IntVar jarg1_) static final voidmainJNI.IntVar_removeInterval(long jarg1, IntVar jarg1_, long jarg2, long jarg3) static final voidmainJNI.IntVar_removeValue(long jarg1, IntVar jarg1_, long jarg2) static final voidmainJNI.IntVar_removeValues(long jarg1, IntVar jarg1_, long[] jarg2) static final voidmainJNI.IntVar_setValue(long jarg1, IntVar jarg1_, long[] jarg2) static final longmainJNI.IntVar_size(long jarg1, IntVar jarg1_) static final longmainJNI.IntVar_value(long jarg1, IntVar jarg1_) static final longmainJNI.IntVar_var(long jarg1, IntVar jarg1_) static final intmainJNI.IntVar_varType(long jarg1, IntVar jarg1_) static final voidmainJNI.IntVar_whenBound__SWIG_0(long jarg1, IntVar jarg1_, long jarg2, Demon jarg2_) static final voidmainJNI.IntVar_whenBound__SWIG_1(long jarg1, IntVar jarg1_, Runnable jarg2) static final voidmainJNI.IntVar_whenDomain__SWIG_0(long jarg1, IntVar jarg1_, long jarg2, Demon jarg2_) static final voidmainJNI.IntVar_whenDomain__SWIG_1(long jarg1, IntVar jarg1_, Runnable jarg2) static final voidmainJNI.IntVarElement_reset(long jarg1, IntVarElement jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.IntVarLocalSearchFilter_addVars(long jarg1, IntVarLocalSearchFilter jarg1_, IntVar[] jarg2) static final intmainJNI.IntVarLocalSearchFilter_index(long jarg1, IntVarLocalSearchFilter jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.IntVarLocalSearchOperator_addVars(long jarg1, IntVarLocalSearchOperator jarg1_, IntVar[] jarg2) Solver.makeAbsEquality(IntVar var, IntVar abs_var) Creates the constraint abs(var) == abs_var.Solver.makeAllDifferent(IntVar[] vars) All variables are pairwise different.Solver.makeAllDifferent(IntVar[] vars, boolean stronger_propagation) All variables are pairwise different.Solver.makeAllDifferentExcept(IntVar[] vars, long escape_value) All variables are pairwise different, unless they are assigned to
the escape value.Solver.makeAllowedAssignment(IntVar[] vars, IntTupleSet tuples) This method creates a constraint where the graph of the relation
between the variables is given in extension.Solver.makeAssignVariablesValues(IntVar[] vars, long[] values) Solver.MakeAssignVariablesValuesOrDoNothing(IntVar[] vars, long[] values) Solver.MakeAssignVariablesValuesOrFail(IntVar[] vars, long[] values) Solver.makeAssignVariableValue(IntVar var, long val) Decisions.Solver.MakeAssignVariableValueOrDoNothing(IntVar var, long value) Solver.makeAssignVariableValueOrFail(IntVar var, long value) Solver.makeCircuit(IntVar[] nexts) Force the "nexts" variable to create a complete Hamiltonian path.Solver.makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value) Conditional Expr condition ?|{i | vars[i] == value}| == max_count|{i | vars[i] == value}| == max_countSolver.makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name) This constraint enforces that, for any integer t, the sum of the demands
corresponding to an interval containing t does not exceed the given
capacity.
Intervals and demands should be vectors of equal size.
Demands should only contain non-negative values.Solver.makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name) This constraint forces that, for any integer t, the sum of the demands
corresponding to an interval containing t does not exceed the given
capacity.
Intervals and demands should be vectors of equal size.
Demands should only contain non-negative values.Solver.makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name) This constraint enforces that, for any integer t, the sum of demands
corresponding to an interval containing t does not exceed the given
capacity.
Intervals and demands should be vectors of equal size.
Demands should be positive.Solver.makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name) This constraint enforces that, for any integer t, the sum of demands
corresponding to an interval containing t does not exceed the given
capacity.
Intervals and demands should be vectors of equal size.
Demands should be positive.Solver.makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars) Returns a decision builder for which the left-most leaf corresponds
to assignment, the rest of the tree being explored using 'db'.Solver.makeDefaultPhase(IntVar[] vars) Solver.makeDefaultPhase(IntVar[] vars, DefaultPhaseParameters parameters) Solver.makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) Delayed version of the same constraint: propagation on the nexts variables
is delayed until all constraints have propagated.Solver.makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum) Deviation constraint:
sum_i |n * vars[i] - total_sum| <= deviation_var and
sum_i vars[i] == total_sum
n = #varsSolver.makeDistribute(IntVar[] vars, int[] card_min, int[] card_max) Aggregated version of count with bounded cardinalities:
forall j in 0 .. card_size - 1:
card_min[j] <= |{i | v[i] == j}| <= card_max[j]Solver.makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max) Aggregated version of count with bounded cardinalities:
forall j in 0 .. card_size - 1:
card_min[j] <= |{i | v[i] == values[j]}| <= card_max[j]Solver.makeDistribute(IntVar[] vars, int[] values, IntVar[] cards) Aggregated version of count: |{i | v[i] == values[j]}| == cards[j]Solver.makeDistribute(IntVar[] vars, long[] card_min, long[] card_max) Aggregated version of count with bounded cardinalities:
forall j in 0 .. card_size - 1:
card_min[j] <= |{i | v[i] == j}| <= card_max[j]Solver.makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max) Aggregated version of count with bounded cardinalities:
forall j in 0 .. card_size - 1:
card_min[j] <= |{i | v[i] == values[j]}| <= card_max[j]Solver.makeDistribute(IntVar[] vars, long[] values, IntVar[] cards) Aggregated version of count: |{i | v[i] == values[j]}| == cards[j]Solver.makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size) Aggregated version of count with bounded cardinalities:
forall j in 0 .. card_size - 1: card_min <= |{i | v[i] == j}| <= card_maxSolver.makeDistribute(IntVar[] vars, IntVar[] cards) Aggregated version of count: |{i | v[i] == j}| == cards[j]Solver.makeElement(int[] values, IntVar index) values[index]Solver.makeElement(long[] values, IntVar index) values[index]Solver.makeElement(IntVar[] vars, IntVar index) vars[expr]Solver.makeElement(LongBinaryOperator values, IntVar index1, IntVar index2) 2D version of function-based element expression, values(expr1, expr2).Solver.makeElement(LongUnaryOperator values, IntVar index) Function-based element.Solver.makeElementEquality(int[] vals, IntVar index, IntVar target) Solver.makeElementEquality(long[] vals, IntVar index, IntVar target) Solver.makeElementEquality(IntVar[] vars, IntVar index, long target) Solver.makeElementEquality(IntVar[] vars, IntVar index, IntVar target) Solver.makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name) Creates an interval var with a fixed duration, and performed_variable.
The duration must be greater than 0.Solver.makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name) Creates a performed interval var with a fixed duration.Solver.makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure) Creates a Tabu Search based on the vars |vars|.
A solution is "tabu" if all the vars in |vars| keep their value.Solver.makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var) Special cases with arrays of size two.Solver.MakeImprovementLimit(IntVar objective_var, boolean maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance) Limits the search based on the improvements of 'objective_var'.Solver.makeIndexExpression(IntVar[] vars, long value) Returns the expression expr such that vars[expr] == value.
It assumes that vars are all different.Solver.makeIndexOfConstraint(IntVar[] vars, IntVar index, long target) This constraint is a special case of the element constraint with
an array of integer variables, where the variables are all
different and the index variable is constrained such that
vars[index] == target.Solver.makeIndexOfFirstMaxValueConstraint(IntVar index, IntVar[] vars) Creates a constraint that binds the index variable to the index of the
first variable with the maximum value.Solver.makeIndexOfFirstMinValueConstraint(IntVar index, IntVar[] vars) Creates a constraint that binds the index variable to the index of the
first variable with the minimum value.Solver.makeInversePermutationConstraint(IntVar[] left, IntVar[] right) Creates a constraint that enforces that 'left' and 'right' both
represent permutations of [0..left.size()-1], and that 'right' is
the inverse permutation of 'left', i.e. for all i in
[0..left.size()-1], right[left[i]] = i.Solver.makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b) b == (l <= expr <= u)Solver.makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar) boolvar == (var !Solver.makeIsDifferentCstCt(IntExpr v1, IntExpr v2, IntVar b) b == (v1 !Solver.makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar) boolvar == (var == value)Solver.makeIsEqualVar(IntExpr v1, IntExpr v2, IntVar b) b == (v1 == v2)Solver.makeIsGreaterCstCt(IntExpr v, long c, IntVar b) b == (v > c)Solver.makeIsGreaterCt(IntExpr left, IntExpr right, IntVar b) b == (left > right)Solver.makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar) boolvar == (var >= value)Solver.makeIsGreaterOrEqualCt(IntExpr left, IntExpr right, IntVar b) b == (left >= right)Solver.makeIsLessCstCt(IntExpr v, long c, IntVar b) b == (v < c)Solver.makeIsLessCt(IntExpr left, IntExpr right, IntVar b) b == (left < right)Solver.makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar) boolvar == (var <= value)Solver.makeIsLessOrEqualCt(IntExpr left, IntExpr right, IntVar b) b == (left <= right)Solver.MakeIsLexicalLessOrEqualWithOffsetsCt(IntVar[] left, IntVar[] right, long[] offsets, IntVar boolvar) Solver.makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar) Solver.makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar) boolvar == (expr in set)Solver.makeLexicalLess(IntVar[] left, IntVar[] right) Creates a constraint that enforces that left is lexicographically less
than right.Solver.makeLexicalLessOrEqual(IntVar[] left, IntVar[] right) Creates a constraint that enforces that left is lexicographically less
than or equal to right.Solver.MakeLexicalLessOrEqualWithOffsets(IntVar[] left, IntVar[] right, long[] offsets) Creates a constraint that enforces that left is lexicographically less
than or equal to right with an offset.Solver.MakeLexicographicImprovementLimit(IntVar[] objective_vars, SWIGTYPE_p_std__vectorT_bool_t maximize, double[] objective_scaling_factors, double[] objective_offsets, double improvement_rate_coefficient, int improvement_rate_solutions_distance) Same as MakeImprovementLimit on a lexicographic objective based on
'objective_vars' and related arguments.Solver.MakeLexicographicOptimize(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] variables, long[] steps) Creates a lexicographic objective, following the order of the variables
given.Solver.MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps, long[] initial_temperatures) Solver.MakeLexicographicTabuSearch(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] objectives, long[] steps, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) Variant with a sub_decison_builder specific to the first solution.Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters) Solver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder) Local Search Phase ParametersSolver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit) Solver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager) Solver.makeMapDomain(IntVar var, IntVar[] actives) This constraint maps the domain of 'var' onto the array of
variables 'actives'.std::max(vars)Solver.makeMaxEquality(IntVar[] vars, IntVar max_var) Solver.makeMaximize(IntVar v, long step) Creates a maximization objective.std::min(vars)Solver.makeMinEquality(IntVar[] vars, IntVar min_var) Solver.makeMinimize(IntVar v, long step) Creates a minimization objective.Solver.makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index) Function based element.Solver.makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values) Creates a local search operator that tries to move the assignment of some
variables toward a target.Solver.makeNoCycle(IntVar[] nexts, IntVar[] active) Prevent cycles.Solver.makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler) Prevent cycles.Solver.makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths) Solver.makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) This constraint states that all the boxes must not overlap.
The coordinates of box i are:
(x_vars[i], y_vars[i]),
(x_vars[i], y_vars[i] + y_size[i]),
(x_vars[i] + x_size[i], y_vars[i]),
(x_vars[i] + x_size[i], y_vars[i] + y_size[i]).
The sizes must be non-negative.Solver.makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, SWIGTYPE_p_absl__SpanT_int_const_t x_size, SWIGTYPE_p_absl__SpanT_int_const_t y_size) Solver.makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, SWIGTYPE_p_absl__SpanT_long_const_t x_size, SWIGTYPE_p_absl__SpanT_long_const_t y_size) Solver.makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) This constraint states that all the boxes must not overlap.
The coordinates of box i are:
(x_vars[i], y_vars[i]),
(x_vars[i], y_vars[i] + y_size[i]),
(x_vars[i] + x_size[i], y_vars[i]),
(x_vars[i] + x_size[i], y_vars[i] + y_size[i]).
The sizes must be positive.
Boxes with a zero dimension can be placed anywhere.Solver.makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, SWIGTYPE_p_absl__SpanT_int_const_t x_size, SWIGTYPE_p_absl__SpanT_int_const_t y_size) Solver.makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, SWIGTYPE_p_absl__SpanT_long_const_t x_size, SWIGTYPE_p_absl__SpanT_long_const_t y_size) Solver.makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars) Creates a constraint that states that all variables in the first
vector are different from all variables in the second
group.Solver.makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value) Creates a constraint that states that all variables in the first
vector are different from all variables from the second group,
unless they are assigned to the escape value.Solver.makeOperator(IntVar[] vars, int op) Local Search Operators.Solver.makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors) Local Search Operators.Solver.makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_outgoing_neighbors) Local Search Operators.Solver.makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op) Solver.makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors) Solver.makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_outgoing_neighbors) Solver.makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op) Solver.makeOperator(IntVar[] vars, LongTernaryOperator evaluator, int op) Solver.makeOptimize(boolean maximize, IntVar v, long step) Creates a objective with a given sense (true = maximization).This constraint packs all variables onto 'number_of_bins'
variables.Solver.makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status) Constraint enforcing that status[i] is true iff there's a path defined on
next variables from sources[i] to sinks[i].
Check whether more propagation is needed.Solver.makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) Creates a constraint which accumulates values along a path such that:
cumuls[next[i]] = cumuls[i] + transits[i].
Active variables indicate if the corresponding next variable is active;
this could be useful to model unperformed nodes in a routing problem.Solver.makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator) Creates a constraint which accumulates values along a path such that:
cumuls[next[i]] = cumuls[i] + transit_evaluator(i, next[i]) + slacks[i].
Active variables indicate if the corresponding next variable is active;
this could be useful to model unperformed nodes in a routing problem.
Ownership of transit_evaluator is taken and it must be a repeatable
callback.Solver.makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator) Creates a constraint which accumulates values along a path such that:
cumuls[next[i]] = cumuls[i] + transit_evaluator(i, next[i]).
Active variables indicate if the corresponding next variable is active;
this could be useful to model unperformed nodes in a routing problem.
Ownership of transit_evaluator is taken and it must be a repeatable
callback.Phases on IntVar arrays.
for all other functions that have several homonyms in this .h).Solver.makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator) var_val1_val2_comparator(var, val1, val2) is true iff assigning value
"val1" to variable "var" is better than assigning value "val2".Solver.makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator) Solver.makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) Solver.makePhase(IntVar[] vars, LongBinaryOperator eval, int str) Returns a decision builder which assigns values to variables which
minimize the values returned by the evaluator.Solver.makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str) Returns a decision builder which assigns values to variables
which minimize the values returned by the evaluator.Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str) Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator) Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) Shortcuts for small arrays.Solver.makeRandomLnsOperator(IntVar[] vars, int number_of_variables) Creates a large neighborhood search operator which creates fragments (set
of relaxed variables) with up to number_of_variables random variables
(sampling with replacement is performed meaning that at most
number_of_variables variables are selected).Solver.makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed) Solver.makeScalProd(IntVar[] vars, int[] coefs) scalar productSolver.makeScalProd(IntVar[] vars, long[] coefs) scalar productSolver.makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst) Solver.makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target) Solver.makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst) Solver.makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target) Solver.makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst) Solver.makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst) Solver.makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst) Solver.makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst) Solver.makeSearchLog(int branch_period, IntVar var) At each solution, this monitor also display the var value.Solver.makeSearchLog(int branch_period, IntVar[] vars, Supplier<String> display_callback) At each solution, this monitor will display the 'vars' values and the
result ofdisplay_callback.Solver.makeSearchLog(int branch_period, IntVar var, Supplier<String> display_callback) At each solution, this monitor will display the 'var' value and the
result ofdisplay_callback.Solver.makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature) Creates a Simulated Annealing monitor.Solver.makeSortingConstraint(IntVar[] vars, IntVar[] sorted) Creates a constraint binding the arrays of variables "vars" and
"sorted_vars": sorted_vars[0] must be equal to the minimum of all
variables in vars, and so on: the value of sorted_vars[i] must be
equal to the i-th value of variables invars.
This constraint propagates in both directions: from "vars" to
"sorted_vars" and vice-versa.
Behind the scenes, this constraint maintains that:
- sorted is always increasing.
- whatever the values of vars, there exists a permutation that
injects its values into the sorted variables.
For more info, please have a look at:
https://mpi-inf.mpg.de/~mehlhorn/ftp/Mehlhorn-Thiel.pdfSolver.makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half) Solver.makeSubCircuit(IntVar[] nexts) Force the "nexts" variable to create a complete Hamiltonian path
for those that do not loop upon themselves.sum of all vars.Solver.makeSumEquality(IntVar[] vars, long cst) Solver.makeSumEquality(IntVar[] vars, IntVar var) Solver.makeSumGreaterOrEqual(IntVar[] vars, long cst) Solver.makeSumLessOrEqual(IntVar[] vars, long cst) Variation on arrays.Solver.makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum) Solver.makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum) Solver.makeTabuSearch(boolean maximize, IntVar objective, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) MetaHeuristics which try to get the search out of local optima.
Creates a Tabu Search monitor.
In the context of local search the behavior is similar to MakeOptimize(),
creating an objective in a given sense.Solver.makeTemporalDisjunction(IntervalVar t1, IntervalVar t2, IntVar alt) This constraint implements a temporal disjunction between two
interval vars t1 and t2.Solver.makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states) This constraint create a finite automaton that will check the
sequence of variables vars.Solver.makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states) This constraint create a finite automaton that will check the
sequence of variables vars.Solver.makeVariableGreaterOrEqualValue(IntVar var, long value) Solver.makeVariableLessOrEqualValue(IntVar var, long value) Solver.makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step) Creates a maximization weigthed objective.Solver.makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step) Creates a maximization weigthed objective.Solver.makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step) Creates a minimization weighted objective.Solver.makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step) Creates a minimization weighted objective.Solver.makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step) Creates a weighted objective with a given sense (true = maximization).Solver.makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step) Creates a weighted objective with a given sense (true = maximization).longstatic longmain.maxVarArray(IntVar[] vars) static final longmainJNI.maxVarArray(IntVar[] jarg1) longstatic longmain.minVarArray(IntVar[] vars) static final longmainJNI.minVarArray(IntVar[] jarg1) static final longmainJNI.ModelCache_findVarArrayConstantArrayExpression(long jarg1, ModelCache jarg1_, IntVar[] jarg2, long[] jarg3, int jarg4) static final longmainJNI.ModelCache_findVarArrayConstantExpression(long jarg1, ModelCache jarg1_, IntVar[] jarg2, long jarg3, int jarg4) static final longmainJNI.ModelCache_findVarArrayExpression(long jarg1, ModelCache jarg1_, IntVar[] jarg2, int jarg3) static final longmainJNI.ModelCache_findVarConstantArrayExpression(long jarg1, ModelCache jarg1_, long jarg2, IntVar jarg2_, long[] jarg3, int jarg4) static final longmainJNI.ModelCache_findVarConstantConstantConstraint(long jarg1, ModelCache jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4, int jarg5) static final longmainJNI.ModelCache_findVarConstantConstantExpression(long jarg1, ModelCache jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4, int jarg5) static final longmainJNI.ModelCache_findVarConstantConstraint(long jarg1, ModelCache jarg1_, long jarg2, IntVar jarg2_, long jarg3, int jarg4) static final voidmainJNI.ModelCache_insertVarArrayConstantArrayExpression(long jarg1, ModelCache jarg1_, long jarg2, IntExpr jarg2_, IntVar[] jarg3, long[] jarg4, int jarg5) static final voidmainJNI.ModelCache_insertVarArrayConstantExpression(long jarg1, ModelCache jarg1_, long jarg2, IntExpr jarg2_, IntVar[] jarg3, long jarg4, int jarg5) static final voidmainJNI.ModelCache_insertVarArrayExpression(long jarg1, ModelCache jarg1_, long jarg2, IntExpr jarg2_, IntVar[] jarg3, int jarg4) static final voidmainJNI.ModelCache_insertVarConstantArrayExpression(long jarg1, ModelCache jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntVar jarg3_, long[] jarg4, int jarg5) static final voidmainJNI.ModelCache_insertVarConstantConstantConstraint(long jarg1, ModelCache jarg1_, long jarg2, Constraint jarg2_, long jarg3, IntVar jarg3_, long jarg4, long jarg5, int jarg6) static final voidmainJNI.ModelCache_insertVarConstantConstantExpression(long jarg1, ModelCache jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntVar jarg3_, long jarg4, long jarg5, int jarg6) static final voidmainJNI.ModelCache_insertVarConstantConstraint(long jarg1, ModelCache jarg1_, long jarg2, Constraint jarg2_, long jarg3, IntVar jarg3_, long jarg4, int jarg5) static final voidmainJNI.ModelVisitor_visitIntegerVariable__SWIG_0(long jarg1, ModelVisitor jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntExpr jarg3_) static final voidmainJNI.ModelVisitor_visitIntegerVariable__SWIG_1(long jarg1, ModelVisitor jarg1_, long jarg2, IntVar jarg2_, String jarg3, long jarg4, long jarg5, IntVar jarg5_) static final voidmainJNI.ModelVisitor_visitIntegerVariableArrayArgument(long jarg1, ModelVisitor jarg1_, String jarg2, IntVar[] jarg3) AssignmentIntContainer.mutableElement(IntVar var) static final longmainJNI.new_BaseLns(IntVar[] jarg1) static final longmainJNI.new_ChangeValue(IntVar[] jarg1) static final longmainJNI.new_ImprovementSearchLimit__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, boolean jarg3, double jarg4, double jarg5, double jarg6, int jarg7) static final longmainJNI.new_ImprovementSearchLimit__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, double[] jarg4, double[] jarg5, double jarg6, int jarg7) static final longmainJNI.new_IntVarElement__SWIG_1(long jarg1, IntVar jarg1_) static final longmainJNI.new_IntVarLocalSearchFilter(IntVar[] jarg1) static final longmainJNI.new_IntVarLocalSearchOperator__SWIG_0(IntVar[] jarg1, boolean jarg2) static final longmainJNI.new_IntVarLocalSearchOperator__SWIG_1(IntVar[] jarg1) static final longmainJNI.new_ObjectiveMonitor(long jarg1, Solver jarg1_, long jarg2, IntVar[] jarg3, long[] jarg4) static final longmainJNI.new_OptimizeVar__SWIG_0(long jarg1, Solver jarg1_, boolean jarg2, long jarg3, IntVar jarg3_, long jarg4) static final longmainJNI.new_OptimizeVar__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntVar[] jarg3, long[] jarg4) static final longstatic final longmainJNI.new_SearchLog(long jarg1, Solver jarg1_, IntVar[] jarg2, String jarg3, double[] jarg4, double[] jarg5, Supplier<String> jarg6, boolean jarg7, int jarg8) static final longmainJNI.new_SequenceVar(long jarg1, Solver jarg1_, IntervalVar[] jarg2, IntVar[] jarg3, String jarg4) static final longmainJNI.new_Solver_IntegerCastInfo__SWIG_1(long jarg1, IntVar jarg1_, long jarg2, IntExpr jarg2_, long jarg3, Constraint jarg3_) static final voidmainJNI.Pack_addCountAssignedItemsDimension(long jarg1, Pack jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Pack_addCountUsedBinDimension(long jarg1, Pack jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Pack_addSumVariableWeightsLessOrEqualConstantDimension(long jarg1, Pack jarg1_, IntVar[] jarg2, long[] jarg3) static final voidmainJNI.Pack_addWeightedSumEqualVarDimension__SWIG_0(long jarg1, Pack jarg1_, long[] jarg2, IntVar[] jarg3) static final voidmainJNI.Pack_addWeightedSumEqualVarDimension__SWIG_1(long jarg1, Pack jarg1_, LongBinaryOperator jarg2, IntVar[] jarg3) static final voidmainJNI.Pack_addWeightedSumOfAssignedDimension(long jarg1, Pack jarg1_, long[] jarg2, long jarg3, IntVar jarg3_) static final voidmainJNI.PropagationBaseObject_set_variable_to_clean_on_fail(long jarg1, PropagationBaseObject jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.PropagationMonitor_endProcessingIntegerVariable(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.PropagationMonitor_removeInterval(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4) static final voidmainJNI.PropagationMonitor_removeValue(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.PropagationMonitor_removeValues(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long[] jarg3) static final voidmainJNI.PropagationMonitor_setMax__SWIG_1(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.PropagationMonitor_setMin__SWIG_1(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.PropagationMonitor_setRange__SWIG_1(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4) static final voidmainJNI.PropagationMonitor_setValue__SWIG_0(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.PropagationMonitor_setValue__SWIG_1(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_, long[] jarg3) static final voidmainJNI.PropagationMonitor_startProcessingIntegerVariable(long jarg1, PropagationMonitor jarg1_, long jarg2, IntVar jarg2_) Solver.registerIntVar(IntVar var) Registers a new IntVar and wraps it inside a TraceIntVar if necessary.voidPropagationMonitor.removeInterval(IntVar var, long imin, long imax) voidPropagationMonitor.removeValue(IntVar var, long value) voidPropagationMonitor.removeValues(IntVar var, long[] values) voidstatic final voidmainJNI.RoutingModel_addToAssignment(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.RoutingModel_addVariableMaximizedByFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.RoutingModel_addVariableMinimizedByFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.RoutingModel_addVariableTargetToFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.RoutingModel_AddWeightedVariableMaximizedByFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.RoutingModel_AddWeightedVariableMinimizedByFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.RoutingModel_AddWeightedVariableTargetToFinalizer(long jarg1, RoutingModel jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4) voidPropagationBaseObject.set_variable_to_clean_on_fail(IntVar v) Shortcut for variable cleaner.static voidmain.setAssignmentFromAssignment(Assignment target_assignment, IntVar[] target_vars, Assignment source_assignment, IntVar[] source_vars) NOLINT
Given a "source_assignment", clears the "target_assignment" and adds
all IntVars in "target_vars", with the values of the variables set according
to the corresponding values of "source_vars" in "source_assignment".
source_vars and target_vars must have the same number of elements.
The source and target assignments can belong to different Solvers.static final voidmainJNI.setAssignmentFromAssignment(long jarg1, Assignment jarg1_, IntVar[] jarg2, long jarg3, Assignment jarg3_, IntVar[] jarg4) voidvoidvoidvoidIntVar modifiers.voidvoidvoidvoidvoidvoidSolver.IntegerCastInfo.setVariable(IntVar value) static final voidmainJNI.SolutionCollector_add__SWIG_0(long jarg1, SolutionCollector jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.SolutionCollector_add__SWIG_1(long jarg1, SolutionCollector jarg1_, IntVar[] jarg2) static final voidmainJNI.SolutionCollector_addObjective(long jarg1, SolutionCollector jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.SolutionCollector_AddObjectives(long jarg1, SolutionCollector jarg1_, IntVar[] jarg2) static final longmainJNI.SolutionCollector_value(long jarg1, SolutionCollector jarg1_, int jarg2, long jarg3, IntVar jarg3_) static final voidmainJNI.Solver_addCastConstraint(long jarg1, Solver jarg1_, long jarg2, CastConstraint jarg2_, long jarg3, IntVar jarg3_, long jarg4, IntExpr jarg4_) static final longmainJNI.Solver_castExpression(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_) static final voidmainJNI.Solver_IntegerCastInfo_variable_set(long jarg1, Solver.IntegerCastInfo jarg1_, long jarg2, IntVar jarg2_) static final longmainJNI.Solver_makeAbsEquality(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeAllDifferent__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeAllDifferent__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, boolean jarg3) static final longmainJNI.Solver_makeAllDifferentExcept(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3) static final longmainJNI.Solver_makeAllowedAssignment(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntTupleSet jarg3_) static final longmainJNI.Solver_makeAssignVariablesValues(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3) static final longmainJNI.Solver_MakeAssignVariablesValuesOrDoNothing(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3) static final longmainJNI.Solver_MakeAssignVariablesValuesOrFail(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3) static final longmainJNI.Solver_makeAssignVariableValue(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_MakeAssignVariableValueOrDoNothing(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeAssignVariableValueOrFail(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeCircuit(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeConditionalExpression(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntExpr jarg3_, long jarg4) static final longmainJNI.Solver_makeCount__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, long jarg4) static final longmainJNI.Solver_makeCount__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeCumulative__SWIG_2(long jarg1, Solver jarg1_, IntervalVar[] jarg2, long[] jarg3, long jarg4, IntVar jarg4_, String jarg5) static final longmainJNI.Solver_makeCumulative__SWIG_3(long jarg1, Solver jarg1_, IntervalVar[] jarg2, int[] jarg3, long jarg4, IntVar jarg4_, String jarg5) static final longmainJNI.Solver_makeCumulative__SWIG_4(long jarg1, Solver jarg1_, IntervalVar[] jarg2, IntVar[] jarg3, long jarg4, String jarg5) static final longmainJNI.Solver_makeCumulative__SWIG_5(long jarg1, Solver jarg1_, IntervalVar[] jarg2, IntVar[] jarg3, long jarg4, IntVar jarg4_, String jarg5) static final longmainJNI.Solver_makeDecisionBuilderFromAssignment(long jarg1, Solver jarg1_, long jarg2, Assignment jarg2_, long jarg3, DecisionBuilder jarg3_, IntVar[] jarg4) static final longmainJNI.Solver_makeDefaultPhase__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeDefaultPhase__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, DefaultPhaseParameters jarg3_) static final longmainJNI.Solver_makeDelayedPathCumul(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, IntVar[] jarg5) static final longmainJNI.Solver_makeDeviation(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_, long jarg4) static final longmainJNI.Solver_makeDistribute__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, IntVar[] jarg4) static final longmainJNI.Solver_makeDistribute__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, IntVar[] jarg4) static final longmainJNI.Solver_makeDistribute__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeDistribute__SWIG_3(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeDistribute__SWIG_4(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long[] jarg4) static final longmainJNI.Solver_makeDistribute__SWIG_5(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, int[] jarg4) static final longmainJNI.Solver_makeDistribute__SWIG_6(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long[] jarg4, long[] jarg5) static final longmainJNI.Solver_makeDistribute__SWIG_7(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, int[] jarg4, int[] jarg5) static final longmainJNI.Solver_makeElement__SWIG_0(long jarg1, Solver jarg1_, long[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeElement__SWIG_1(long jarg1, Solver jarg1_, int[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeElement__SWIG_2(long jarg1, Solver jarg1_, LongUnaryOperator jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeElement__SWIG_3(long jarg1, Solver jarg1_, LongBinaryOperator jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeElement__SWIG_4(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeElementEquality__SWIG_0(long jarg1, Solver jarg1_, long[] jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeElementEquality__SWIG_1(long jarg1, Solver jarg1_, int[] jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeElementEquality__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeElementEquality__SWIG_3(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_, long jarg4) static final longmainJNI.Solver_makeFixedDurationIntervalVar__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, String jarg4) static final longmainJNI.Solver_makeFixedDurationIntervalVar__SWIG_2(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, long jarg4, IntVar jarg4_, String jarg5) static final longmainJNI.Solver_makeGenericTabuSearch(long jarg1, Solver jarg1_, boolean jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar[] jarg5, long jarg6) static final longmainJNI.Solver_makeIfThenElseCt(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntExpr jarg4_, long jarg5, IntVar jarg5_) static final longmainJNI.Solver_MakeImprovementLimit(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, boolean jarg3, double jarg4, double jarg5, double jarg6, int jarg7) static final longmainJNI.Solver_makeIndexExpression(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3) static final longmainJNI.Solver_makeIndexOfConstraint(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_, long jarg4) static final longmainJNI.Solver_makeIndexOfFirstMaxValueConstraint(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, IntVar[] jarg3) static final longmainJNI.Solver_makeIndexOfFirstMinValueConstraint(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, IntVar[] jarg3) static final longmainJNI.Solver_makeInversePermutationConstraint(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeIsBetweenCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, long jarg5, IntVar jarg5_) static final longmainJNI.Solver_makeIsDifferentCstCt__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsDifferentCstCt__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsEqualCstCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsEqualVar__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsGreaterCstCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsGreaterCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsGreaterOrEqualCstCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsGreaterOrEqualCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsLessCstCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsLessCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsLessOrEqualCstCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsLessOrEqualCt(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long jarg3, IntExpr jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_MakeIsLexicalLessOrEqualWithOffsetsCt(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long[] jarg4, long jarg5, IntVar jarg5_) static final longmainJNI.Solver_makeIsMemberCt__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, long[] jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeIsMemberCt__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntExpr jarg2_, int[] jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeLexicalLess(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeLexicalLessOrEqual(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_MakeLexicalLessOrEqualWithOffsets(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long[] jarg4) static final longmainJNI.Solver_MakeLexicographicImprovementLimit(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, double[] jarg4, double[] jarg5, double jarg6, int jarg7) static final longmainJNI.Solver_MakeLexicographicOptimize(long jarg1, Solver jarg1_, long jarg2, IntVar[] jarg3, long[] jarg4) static final longmainJNI.Solver_MakeLexicographicSimulatedAnnealing(long jarg1, Solver jarg1_, long jarg2, IntVar[] jarg3, long[] jarg4, long[] jarg5) static final longmainJNI.Solver_MakeLexicographicTabuSearch(long jarg1, Solver jarg1_, long jarg2, IntVar[] jarg3, long[] jarg4, IntVar[] jarg5, long jarg6, long jarg7, double jarg8) static final longmainJNI.Solver_makeLocalSearchPhase__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, DecisionBuilder jarg3_, long jarg4, LocalSearchPhaseParameters jarg4_) static final longmainJNI.Solver_makeLocalSearchPhase__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, LocalSearchPhaseParameters jarg5_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, RegularLimit jarg5_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_2(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, RegularLimit jarg5_, long jarg6, LocalSearchFilterManager jarg6_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_3(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_4(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_, long jarg6, RegularLimit jarg6_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_5(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_, long jarg6, RegularLimit jarg6_, long jarg7, LocalSearchFilterManager jarg7_) static final longmainJNI.Solver_makeMapDomain(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, IntVar[] jarg3) static final longmainJNI.Solver_makeMax__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeMaxEquality(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeMaximize(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeMin__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeMinEquality(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeMinimize(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeMonotonicElement(long jarg1, Solver jarg1_, LongUnaryOperator jarg2, boolean jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeMoveTowardTargetOperator__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3) static final longmainJNI.Solver_makeNoCycle__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, LongPredicate jarg4) static final longmainJNI.Solver_makeNoCycle__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeNoCycle__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, LongPredicate jarg4, boolean jarg5) static final longmainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, IntVar[] jarg5) static final longmainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, IntVar[] jarg5) static final longmainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeNullIntersect(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeNullIntersectExcept(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, long jarg4) static final longmainJNI.Solver_makeOperator__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, long jarg4, long jarg5) static final longmainJNI.Solver_makeOperator__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, long jarg4) static final longmainJNI.Solver_makeOperator__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3) static final longmainJNI.Solver_makeOperator__SWIG_3(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, int jarg4, long jarg5, long jarg6) static final longmainJNI.Solver_makeOperator__SWIG_4(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, int jarg4, long jarg5) static final longmainJNI.Solver_makeOperator__SWIG_5(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, int jarg4) static final longmainJNI.Solver_makeOperator__SWIG_6(long jarg1, Solver jarg1_, IntVar[] jarg2, LongTernaryOperator jarg3, int jarg4) static final longmainJNI.Solver_makeOperator__SWIG_7(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, LongTernaryOperator jarg4, int jarg5) static final longmainJNI.Solver_makeOptimize(long jarg1, Solver jarg1_, boolean jarg2, long jarg3, IntVar jarg3_, long jarg4) static final longmainJNI.Solver_makePack(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3) static final longmainJNI.Solver_makePathConnected(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long[] jarg4, IntVar[] jarg5) static final longmainJNI.Solver_makePathCumul__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, IntVar[] jarg5) static final longmainJNI.Solver_makePathCumul__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, LongBinaryOperator jarg5) static final longmainJNI.Solver_makePathCumul__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, IntVar[] jarg4, IntVar[] jarg5, LongBinaryOperator jarg6) static final longmainJNI.Solver_makePhase__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, int jarg4) static final longmainJNI.Solver_makePhase__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, LongUnaryOperator jarg3, int jarg4) static final longmainJNI.Solver_makePhase__SWIG_10(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_, long jarg5, IntVar jarg5_, int jarg6, int jarg7) static final longmainJNI.Solver_makePhase__SWIG_11(long jarg1, Solver jarg1_, IntVar[] jarg2, LongBinaryOperator jarg3, int jarg4) static final longmainJNI.Solver_makePhase__SWIG_12(long jarg1, Solver jarg1_, IntVar[] jarg2, LongBinaryOperator jarg3, LongUnaryOperator jarg4, int jarg5) static final longmainJNI.Solver_makePhase__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, LongBinaryOperator jarg4) static final longmainJNI.Solver_makePhase__SWIG_3(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, LongTernaryPredicate jarg4) static final longmainJNI.Solver_makePhase__SWIG_4(long jarg1, Solver jarg1_, IntVar[] jarg2, LongUnaryOperator jarg3, LongBinaryOperator jarg4) static final longmainJNI.Solver_makePhase__SWIG_5(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, LongBinaryOperator jarg4, LongUnaryOperator jarg5) static final longmainJNI.Solver_makePhase__SWIG_6(long jarg1, Solver jarg1_, IntVar[] jarg2, LongUnaryOperator jarg3, LongBinaryOperator jarg4, LongUnaryOperator jarg5) static final longmainJNI.Solver_makePhase__SWIG_7(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, int jarg3, int jarg4) static final longmainJNI.Solver_makePhase__SWIG_8(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntVar jarg3_, int jarg4, int jarg5) static final longmainJNI.Solver_makePhase__SWIG_9(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, IntVar jarg3_, long jarg4, IntVar jarg4_, int jarg5, int jarg6) static final longmainJNI.Solver_makeRandomLnsOperator__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3) static final longmainJNI.Solver_makeRandomLnsOperator__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int jarg3, int jarg4) static final longmainJNI.Solver_makeScalProd__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3) static final longmainJNI.Solver_makeScalProd__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3) static final longmainJNI.Solver_makeScalProdEquality__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4) static final longmainJNI.Solver_makeScalProdEquality__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4) static final longmainJNI.Solver_makeScalProdEquality__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeScalProdEquality__SWIG_3(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4) static final longmainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4) static final longmainJNI.Solver_makeScalProdLessOrEqual__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4) static final longmainJNI.Solver_makeScalProdLessOrEqual__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4) static final longmainJNI.Solver_makeSearchLog__SWIG_1(long jarg1, Solver jarg1_, int jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeSearchLog__SWIG_3(long jarg1, Solver jarg1_, int jarg2, long jarg3, IntVar jarg3_, Supplier<String> jarg4) static final longmainJNI.Solver_makeSearchLog__SWIG_4(long jarg1, Solver jarg1_, int jarg2, IntVar[] jarg3, Supplier<String> jarg4) static final longmainJNI.Solver_makeSimulatedAnnealing(long jarg1, Solver jarg1_, boolean jarg2, long jarg3, IntVar jarg3_, long jarg4, long jarg5) static final longmainJNI.Solver_makeSortingConstraint(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3) static final longmainJNI.Solver_makeSplitVariableDomain(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, boolean jarg4) static final longmainJNI.Solver_makeSubCircuit(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeSum__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2) static final longmainJNI.Solver_makeSumEquality__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3) static final longmainJNI.Solver_makeSumEquality__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntVar jarg3_) static final longmainJNI.Solver_makeSumGreaterOrEqual(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3) static final longmainJNI.Solver_makeSumLessOrEqual(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3) static final longmainJNI.Solver_makeSumObjectiveFilter__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, LongBinaryOperator jarg3, int jarg4) static final longmainJNI.Solver_makeSumObjectiveFilter__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, IntVar[] jarg3, LongTernaryOperator jarg4, int jarg5) static final longmainJNI.Solver_makeTabuSearch(long jarg1, Solver jarg1_, boolean jarg2, long jarg3, IntVar jarg3_, long jarg4, IntVar[] jarg5, long jarg6, long jarg7, double jarg8) static final longmainJNI.Solver_makeTemporalDisjunction__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntervalVar jarg2_, long jarg3, IntervalVar jarg3_, long jarg4, IntVar jarg4_) static final longmainJNI.Solver_makeTransitionConstraint__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntTupleSet jarg3_, long jarg4, long[] jarg5) static final longmainJNI.Solver_makeTransitionConstraint__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, IntTupleSet jarg3_, long jarg4, int[] jarg5) static final longmainJNI.Solver_makeVariableGreaterOrEqualValue(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeVariableLessOrEqualValue(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final longmainJNI.Solver_makeWeightedMaximize__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4) static final longmainJNI.Solver_makeWeightedMaximize__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4) static final longmainJNI.Solver_makeWeightedMinimize__SWIG_0(long jarg1, Solver jarg1_, IntVar[] jarg2, long[] jarg3, long jarg4) static final longmainJNI.Solver_makeWeightedMinimize__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, int[] jarg3, long jarg4) static final longmainJNI.Solver_makeWeightedOptimize__SWIG_0(long jarg1, Solver jarg1_, boolean jarg2, IntVar[] jarg3, long[] jarg4, long jarg5) static final longmainJNI.Solver_makeWeightedOptimize__SWIG_1(long jarg1, Solver jarg1_, boolean jarg2, IntVar[] jarg3, int[] jarg4, long jarg5) static final longmainJNI.Solver_registerIntVar(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_) voidPropagationMonitor.startProcessingIntegerVariable(IntVar var) static longIntVar.swigRelease(IntVar obj) static final voidmainJNI.SymmetryBreaker_addIntegerVariableEqualValueClause(long jarg1, SymmetryBreaker jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.SymmetryBreaker_addIntegerVariableGreaterOrEqualValueClause(long jarg1, SymmetryBreaker jarg1_, long jarg2, IntVar jarg2_, long jarg3) static final voidmainJNI.SymmetryBreaker_addIntegerVariableLessOrEqualValueClause(long jarg1, SymmetryBreaker jarg1_, long jarg2, IntVar jarg2_, long jarg3) longlongThis is a shortcut to get the Value of 'var' in the nth solution.voidModelVisitor.visitIntegerVariable(IntVar variable, IntExpr delegate) voidModelVisitor.visitIntegerVariable(IntVar variable, String operation, long value, IntVar delegate) voidModelVisitor.visitIntegerVariableArrayArgument(String arg_name, IntVar[] arguments) voidDecisionVisitor.visitSetVariableValue(IntVar var, long value) voidDecisionVisitor.visitSplitVariableDomain(IntVar var, long value, boolean start_with_lower_half) Constructors in com.google.ortools.constraintsolver with parameters of type IntVarModifierConstructorDescriptionChangeValue(IntVar[] vars) ImprovementSearchLimit(Solver solver, IntVar[] objective_vars, SWIGTYPE_p_std__vectorT_bool_t maximize, double[] objective_scaling_factors, double[] objective_offsets, double improvement_rate_coefficient, int improvement_rate_solutions_distance) ImprovementSearchLimit(Solver solver, IntVar objective_var, boolean maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance) IntegerCastInfo(IntVar v, IntExpr e, Constraint c) IntVarElement(IntVar var) IntVarLocalSearchFilter(IntVar[] vars) IntVarLocalSearchOperator(IntVar[] vars) IntVarLocalSearchOperator(IntVar[] vars, boolean keep_inverse_values) ObjectiveMonitor(Solver solver, SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps) OptimizeVar(Solver solver, boolean maximize, IntVar var, long step) OptimizeVar(Solver solver, SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps) SearchLog(Solver solver, IntVar[] vars, String vars_name, double[] scaling_factors, double[] offsets, Supplier<String> display_callback, boolean display_on_new_solutions_only, int period) SequenceVar(Solver s, IntervalVar[] intervals, IntVar[] nexts, String name)