Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
Solver.java
Go to the documentation of this file.
1/* ----------------------------------------------------------------------------
2 * This file was automatically generated by SWIG (https://www.swig.org).
3 * Version 4.3.0
4 *
5 * Do not make changes to this file unless you know what you are doing - modify
6 * the SWIG interface file instead.
7 * ----------------------------------------------------------------------------- */
8
9package com.google.ortools.constraintsolver;
10
11import com.google.ortools.constraintsolver.ConstraintSolverParameters;
12import com.google.ortools.constraintsolver.RegularLimitParameters;
13
14// Used to wrap DisplayCallback (std::function<std::string()>)
15// see https://docs.oracle.com/javase/8/docs/api/java/util/function/Supplier.html
16import java.util.function.Supplier;
17// Used to wrap std::function<bool()>
18// see https://docs.oracle.com/javase/8/docs/api/java/util/function/BooleanSupplier.html
19import java.util.function.BooleanSupplier;
20
21// Used to wrap IndexEvaluator1 (std::function<int64_t(int64_t)>)
22// see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongUnaryOperator.html
23import java.util.function.LongUnaryOperator;
24// Used to wrap IndexEvaluator2 (std::function<int64_t(int64_t, int64_t)>)
25// see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongBinaryOperator.html
26import java.util.function.LongBinaryOperator;
27// Used to wrap IndexEvaluator3 (std::function<int64_t(int64_t, int64_t, int64_t)>)
28// note: Java does not provide TernaryOperator so we provide it.
29import com.google.ortools.constraintsolver.LongTernaryOperator;
30// Used to wrap std::function<int64_t(int, int)>
31// note: Java does not provide it, so we provide it.
32import com.google.ortools.constraintsolver.IntIntToLongFunction;
33
34// Used to wrap IndexFilter1 (std::function<bool(int64_t)>)
35// see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongPredicate.html
36import java.util.function.LongPredicate;
37
38// Used to wrap std::function<bool(int64_t, int64_t, int64_t)>
39// note: Java does not provide TernaryPredicate so we provide it
40import com.google.ortools.constraintsolver.LongTernaryPredicate;
41
42// Used to wrap std::function<void(Solver*)>
43// see https://docs.oracle.com/javase/8/docs/api/java/util/function/Consumer.html
44import java.util.function.Consumer;
45
46// Used to wrap ObjectiveWatcher (std::function<void(int64_t)>)
47// see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongConsumer.html
48import java.util.function.LongConsumer;
49
50// Used to wrap Closure (std::function<void()>)
51// see https://docs.oracle.com/javase/8/docs/api/java/lang/Runnable.html
52import java.lang.Runnable;
53
54// Used to keep alive java references to objects passed to the C++ layer.
55import java.util.HashSet;
56
76public class Solver {
77 private transient long swigCPtr;
78 protected transient boolean swigCMemOwn;
79
80 public Solver(long cPtr, boolean cMemoryOwn) {
81 swigCMemOwn = cMemoryOwn;
82 swigCPtr = cPtr;
83 }
84
85 public static long getCPtr(Solver obj) {
86 return (obj == null) ? 0 : obj.swigCPtr;
87 }
88
89 public static long swigRelease(Solver obj) {
90 long ptr = 0;
91 if (obj != null) {
92 if (!obj.swigCMemOwn)
93 throw new RuntimeException("Cannot release ownership as memory is not owned");
94 ptr = obj.swigCPtr;
95 obj.swigCMemOwn = false;
96 obj.delete();
97 }
98 return ptr;
99 }
100
101 @SuppressWarnings({"deprecation", "removal"})
102 protected void finalize() {
103 delete();
104 }
105
106 public synchronized void delete() {
107 if (swigCPtr != 0) {
108 if (swigCMemOwn) {
109 swigCMemOwn = false;
110 mainJNI.delete_Solver(swigCPtr);
111 }
112 swigCPtr = 0;
113 }
114 }
115
120 public static class FailException extends Exception {
121 public FailException() {
122 super();
123 }
124
125 public FailException(String message) {
126 super(message);
127 }
128 }
129
130 public IntVar[] makeIntVarArray(int count, long min, long max) {
131 IntVar[] array = new IntVar[count];
132 for (int i = 0; i < count; ++i) {
133 array[i] = makeIntVar(min, max);
134 }
135 return array;
136 }
137
138 public IntVar[] makeIntVarArray(int count, long min, long max, String name) {
139 IntVar[] array = new IntVar[count];
140 for (int i = 0; i < count; ++i) {
141 String var_name = name + i;
142 array[i] = makeIntVar(min, max, var_name);
143 }
144 return array;
145 }
146
147 public IntVar[] makeBoolVarArray(int count) {
148 IntVar[] array = new IntVar[count];
149 for (int i = 0; i < count; ++i) {
150 array[i] = makeBoolVar();
151 }
152 return array;
153 }
154
155 public IntVar[] makeBoolVarArray(int count, String name) {
156 IntVar[] array = new IntVar[count];
157 for (int i = 0; i < count; ++i) {
158 String var_name = name + i;
159 array[i] = makeBoolVar(var_name);
160 }
161 return array;
162 }
163
165 long start_min,
166 long start_max,
167 long duration,
168 boolean optional) {
169 IntervalVar[] array = new IntervalVar[count];
170 for (int i = 0; i < count; ++i) {
171 array[i] = makeFixedDurationIntervalVar(start_min,
172 start_max,
173 duration,
174 optional,
175 "");
176 }
177 return array;
178 }
179
181 long start_min,
182 long start_max,
183 long duration,
184 boolean optional,
185 String name) {
186 IntervalVar[] array = new IntervalVar[count];
187 for (int i = 0; i < count; ++i) {
188 array[i] = makeFixedDurationIntervalVar(start_min,
189 start_max,
190 duration,
191 optional,
192 name + i);
193 }
194 return array;
195 }
196
197 // Ensure that the GC doesn't collect any DecisionBuilder set from Java
198 // as the underlying C++ class stores a shallow copy
199 private HashSet<DecisionBuilder> keepAliveDecisionBuilders;
201 if (keepAliveDecisionBuilders == null) {
202 keepAliveDecisionBuilders = new HashSet<DecisionBuilder>();
203 }
204 keepAliveDecisionBuilders.add(db);
205 }
207 for (DecisionBuilder db : dbs) {
209 }
210 }
211
218 static public class IntegerCastInfo {
219 private transient long swigCPtr;
220 protected transient boolean swigCMemOwn;
221
222 public IntegerCastInfo(long cPtr, boolean cMemoryOwn) {
223 swigCMemOwn = cMemoryOwn;
224 swigCPtr = cPtr;
225 }
226
227 public static long getCPtr(IntegerCastInfo obj) {
228 return (obj == null) ? 0 : obj.swigCPtr;
229 }
230
231 public static long swigRelease(IntegerCastInfo obj) {
232 long ptr = 0;
233 if (obj != null) {
234 if (!obj.swigCMemOwn)
235 throw new RuntimeException("Cannot release ownership as memory is not owned");
236 ptr = obj.swigCPtr;
237 obj.swigCMemOwn = false;
238 obj.delete();
239 }
240 return ptr;
241 }
242
243 @SuppressWarnings({"deprecation", "removal"})
244 protected void finalize() {
245 delete();
246 }
247
248 public synchronized void delete() {
249 if (swigCPtr != 0) {
250 if (swigCMemOwn) {
251 swigCMemOwn = false;
252 mainJNI.delete_Solver_IntegerCastInfo(swigCPtr);
253 }
254 swigCPtr = 0;
255 }
256 }
257
259 this(mainJNI.new_Solver_IntegerCastInfo__SWIG_0(), true);
260 }
261
263 this(mainJNI.new_Solver_IntegerCastInfo__SWIG_1(IntVar.getCPtr(v), v, IntExpr.getCPtr(e), e, Constraint.getCPtr(c), c), true);
264 }
265
266 public void setVariable(IntVar value) {
267 mainJNI.Solver_IntegerCastInfo_variable_set(swigCPtr, this, IntVar.getCPtr(value), value);
268 }
269
271 long cPtr = mainJNI.Solver_IntegerCastInfo_variable_get(swigCPtr, this);
272 return (cPtr == 0) ? null : new IntVar(cPtr, false);
273 }
274
275 public void setExpression(IntExpr value) {
276 mainJNI.Solver_IntegerCastInfo_expression_set(swigCPtr, this, IntExpr.getCPtr(value), value);
277 }
278
280 long cPtr = mainJNI.Solver_IntegerCastInfo_expression_get(swigCPtr, this);
281 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
282 }
283
284 public void setMaintainer(Constraint value) {
285 mainJNI.Solver_IntegerCastInfo_maintainer_set(swigCPtr, this, Constraint.getCPtr(value), value);
286 }
287
289 long cPtr = mainJNI.Solver_IntegerCastInfo_maintainer_get(swigCPtr, this);
290 return (cPtr == 0) ? null : new Constraint(cPtr, false);
291 }
292
293 }
294
298 public Solver(String name) {
299 this(mainJNI.new_Solver__SWIG_0(name), true);
300 }
301
302 public Solver(String name, com.google.ortools.constraintsolver.ConstraintSolverParameters parameters) {
303 this(mainJNI.new_Solver__SWIG_1(name, parameters.toByteArray()), true);
304 }
305
310 byte[] buf = mainJNI.Solver_parameters(swigCPtr, this);
311 if (buf == null || buf.length == 0) {
312 return null;
313 }
314 try {
315 return com.google.ortools.constraintsolver.ConstraintSolverParameters.parseFrom(buf);
316 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
317 throw new RuntimeException(
318 "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
319 }
320}
321
322 public SWIGTYPE_p_operations_research__ConstraintSolverParameters const_parameters() {
323 return new SWIGTYPE_p_operations_research__ConstraintSolverParameters(mainJNI.Solver_const_parameters(swigCPtr, this), false);
324 }
325
330 byte[] buf = mainJNI.Solver_defaultSolverParameters();
331 if (buf == null || buf.length == 0) {
332 return null;
333 }
334 try {
335 return com.google.ortools.constraintsolver.ConstraintSolverParameters.parseFrom(buf);
336 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
337 throw new RuntimeException(
338 "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
339 }
340}
341
377 public void addConstraint(Constraint c) {
378 mainJNI.Solver_addConstraint(swigCPtr, this, Constraint.getCPtr(c), c);
379 }
380
386 public void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr) {
387 mainJNI.Solver_addCastConstraint(swigCPtr, this, CastConstraint.getCPtr(constraint), constraint, IntVar.getCPtr(target_var), target_var, IntExpr.getCPtr(expr), expr);
388 }
389
433 public boolean solve(DecisionBuilder db, SearchMonitor[] monitors) {
434 try {
435 return mainJNI.Solver_solve__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
436 } finally {
438 }
439 }
440
441 public boolean solve(DecisionBuilder db) {
442 try {
443 return mainJNI.Solver_solve__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
444 } finally {
446 }
447 }
448
449 public boolean solve(DecisionBuilder db, SearchMonitor m1) {
450 try {
451 return mainJNI.Solver_solve__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
452 } finally {
454 }
455 }
456
458 try {
459 return mainJNI.Solver_solve__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
460 } finally {
462 }
463 }
464
466 try {
467 return mainJNI.Solver_solve__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
468 } finally {
470 }
471 }
472
474 try {
475 return mainJNI.Solver_solve__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3, SearchMonitor.getCPtr(m4), m4);
476 } finally {
478 }
479 }
480
492 public void newSearch(DecisionBuilder db, SearchMonitor[] monitors) {
493 try {
494 mainJNI.Solver_newSearch__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
495 } finally {
497 }
498 }
499
500 public void newSearch(DecisionBuilder db) {
501 try {
502 mainJNI.Solver_newSearch__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
503 } finally {
505 }
506 }
507
509 try {
510 mainJNI.Solver_newSearch__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
511 } finally {
513 }
514 }
515
517 try {
518 mainJNI.Solver_newSearch__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
519 } finally {
521 }
522 }
523
525 try {
526 mainJNI.Solver_newSearch__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
527 } finally {
529 }
530 }
531
533 try {
534 mainJNI.Solver_newSearch__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3, SearchMonitor.getCPtr(m4), m4);
535 } finally {
537 }
538 }
539
540 public boolean nextSolution() {
541 return mainJNI.Solver_nextSolution(swigCPtr, this);
542 }
543
544 public void restartSearch() {
545 mainJNI.Solver_restartSearch(swigCPtr, this);
546 }
547
548 public void endSearch() {
549 mainJNI.Solver_endSearch(swigCPtr, this);
550 }
551
563 public boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors) {
564 try {
565 return mainJNI.Solver_solveAndCommit__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
566 } finally {
568 }
569 }
570
571 public boolean solveAndCommit(DecisionBuilder db) {
572 try {
573 return mainJNI.Solver_solveAndCommit__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
574 } finally {
576 }
577 }
578
580 try {
581 return mainJNI.Solver_solveAndCommit__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
582 } finally {
584 }
585 }
586
588 try {
589 return mainJNI.Solver_solveAndCommit__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
590 } finally {
592 }
593 }
594
596 try {
597 return mainJNI.Solver_solveAndCommit__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
598 } finally {
600 }
601 }
602
606 public boolean checkAssignment(Assignment solution) {
607 return mainJNI.Solver_checkAssignment(swigCPtr, this, Assignment.getCPtr(solution), solution);
608 }
609
615 public boolean checkConstraint(Constraint ct) {
616 return mainJNI.Solver_checkConstraint(swigCPtr, this, Constraint.getCPtr(ct), ct);
617 }
618
622 public int state() {
623 return mainJNI.Solver_state(swigCPtr, this);
624 }
625
629 public void fail() {
630 mainJNI.Solver_fail(swigCPtr, this);
631 }
632
636 public String toString() {
637 return mainJNI.Solver_toString(swigCPtr, this);
638 }
639
643 public static long memoryUsage() {
644 return mainJNI.Solver_memoryUsage();
645 }
646
651 public long wallTime() {
652 return mainJNI.Solver_wallTime(swigCPtr, this);
653 }
654
658 public long branches() {
659 return mainJNI.Solver_branches(swigCPtr, this);
660 }
661
665 public long solutions() {
666 return mainJNI.Solver_solutions(swigCPtr, this);
667 }
668
672 public long unchecked_solutions() {
673 return mainJNI.Solver_unchecked_solutions(swigCPtr, this);
674 }
675
679 public long demon_runs(int p) {
680 return mainJNI.Solver_demon_runs(swigCPtr, this, p);
681 }
682
686 public long failures() {
687 return mainJNI.Solver_failures(swigCPtr, this);
688 }
689
693 public long neighbors() {
694 return mainJNI.Solver_neighbors(swigCPtr, this);
695 }
696
701 public void ClearNeighbors() {
702 mainJNI.Solver_ClearNeighbors(swigCPtr, this);
703 }
704
705 public void IncrementNeighbors() {
706 mainJNI.Solver_IncrementNeighbors(swigCPtr, this);
707 }
708
712 public long filteredNeighbors() {
713 return mainJNI.Solver_filteredNeighbors(swigCPtr, this);
714 }
715
719 public long acceptedNeighbors() {
720 return mainJNI.Solver_acceptedNeighbors(swigCPtr, this);
721 }
722
727 public long stamp() {
728 return mainJNI.Solver_stamp(swigCPtr, this);
729 }
730
734 public long fail_stamp() {
735 return mainJNI.Solver_fail_stamp(swigCPtr, this);
736 }
737
741 public void set_context(String context) {
742 mainJNI.Solver_set_context(swigCPtr, this, context);
743 }
744
748 public String context() {
749 return mainJNI.Solver_context(swigCPtr, this);
750 }
751
756 return mainJNI.Solver_optimization_direction(swigCPtr, this);
757 }
758
759 public void set_optimization_direction(int direction) {
760 mainJNI.Solver_set_optimization_direction(swigCPtr, this, direction);
761 }
762
764 mainJNI.Solver_SetGuidedLocalSearchPenaltyCallback(swigCPtr, this, penalty_callback);
765 }
766
767 public long GetGuidedLocalSearchPenalty(long i, long j, long k) {
768 return mainJNI.Solver_GetGuidedLocalSearchPenalty(swigCPtr, this, i, j, k);
769 }
770
774 public IntVar makeIntVar(long min, long max, String name) {
775 long cPtr = mainJNI.Solver_makeIntVar__SWIG_0(swigCPtr, this, min, max, name);
776 return (cPtr == 0) ? null : new IntVar(cPtr, false);
777 }
778
782 public IntVar makeIntVar(long[] values, String name) {
783 long cPtr = mainJNI.Solver_makeIntVar__SWIG_1(swigCPtr, this, values, name);
784 return (cPtr == 0) ? null : new IntVar(cPtr, false);
785 }
786
790 public IntVar makeIntVar(int[] values, String name) {
791 long cPtr = mainJNI.Solver_makeIntVar__SWIG_2(swigCPtr, this, values, name);
792 return (cPtr == 0) ? null : new IntVar(cPtr, false);
793 }
794
798 public IntVar makeIntVar(long min, long max) {
799 long cPtr = mainJNI.Solver_makeIntVar__SWIG_3(swigCPtr, this, min, max);
800 return (cPtr == 0) ? null : new IntVar(cPtr, false);
801 }
802
806 public IntVar makeIntVar(long[] values) {
807 long cPtr = mainJNI.Solver_makeIntVar__SWIG_4(swigCPtr, this, values);
808 return (cPtr == 0) ? null : new IntVar(cPtr, false);
809 }
810
814 public IntVar makeIntVar(int[] values) {
815 long cPtr = mainJNI.Solver_makeIntVar__SWIG_5(swigCPtr, this, values);
816 return (cPtr == 0) ? null : new IntVar(cPtr, false);
817 }
818
822 public IntVar makeBoolVar(String name) {
823 long cPtr = mainJNI.Solver_makeBoolVar__SWIG_0(swigCPtr, this, name);
824 return (cPtr == 0) ? null : new IntVar(cPtr, false);
825 }
826
831 long cPtr = mainJNI.Solver_makeBoolVar__SWIG_1(swigCPtr, this);
832 return (cPtr == 0) ? null : new IntVar(cPtr, false);
833 }
834
838 public IntVar makeIntConst(long val, String name) {
839 long cPtr = mainJNI.Solver_makeIntConst__SWIG_0(swigCPtr, this, val, name);
840 return (cPtr == 0) ? null : new IntVar(cPtr, false);
841 }
842
846 public IntVar makeIntConst(long val) {
847 long cPtr = mainJNI.Solver_makeIntConst__SWIG_1(swigCPtr, this, val);
848 return (cPtr == 0) ? null : new IntVar(cPtr, false);
849 }
850
854 public IntExpr makeSum(IntExpr left, IntExpr right) {
855 long cPtr = mainJNI.Solver_makeSum__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
856 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
857 }
858
862 public IntExpr makeSum(IntExpr expr, long value) {
863 long cPtr = mainJNI.Solver_makeSum__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
864 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
865 }
866
870 public IntExpr makeSum(IntVar[] vars) {
871 long cPtr = mainJNI.Solver_makeSum__SWIG_2(swigCPtr, this, vars);
872 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
873 }
874
878 public IntExpr makeScalProd(IntVar[] vars, long[] coefs) {
879 long cPtr = mainJNI.Solver_makeScalProd__SWIG_0(swigCPtr, this, vars, coefs);
880 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
881 }
882
886 public IntExpr makeScalProd(IntVar[] vars, int[] coefs) {
887 long cPtr = mainJNI.Solver_makeScalProd__SWIG_1(swigCPtr, this, vars, coefs);
888 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
889 }
890
894 public IntExpr makeDifference(IntExpr left, IntExpr right) {
895 long cPtr = mainJNI.Solver_makeDifference__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
896 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
897 }
898
902 public IntExpr makeDifference(long value, IntExpr expr) {
903 long cPtr = mainJNI.Solver_makeDifference__SWIG_1(swigCPtr, this, value, IntExpr.getCPtr(expr), expr);
904 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
905 }
906
911 long cPtr = mainJNI.Solver_makeOpposite(swigCPtr, this, IntExpr.getCPtr(expr), expr);
912 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
913 }
914
918 public IntExpr makeProd(IntExpr left, IntExpr right) {
919 long cPtr = mainJNI.Solver_makeProd__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
920 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
921 }
922
926 public IntExpr makeProd(IntExpr expr, long value) {
927 long cPtr = mainJNI.Solver_makeProd__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
928 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
929 }
930
934 public IntExpr makeDiv(IntExpr expr, long value) {
935 long cPtr = mainJNI.Solver_makeDiv__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
936 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
937 }
938
942 public IntExpr makeDiv(IntExpr numerator, IntExpr denominator) {
943 long cPtr = mainJNI.Solver_makeDiv__SWIG_1(swigCPtr, this, IntExpr.getCPtr(numerator), numerator, IntExpr.getCPtr(denominator), denominator);
944 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
945 }
946
950 public IntExpr makeAbs(IntExpr expr) {
951 long cPtr = mainJNI.Solver_makeAbs(swigCPtr, this, IntExpr.getCPtr(expr), expr);
952 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
953 }
954
959 long cPtr = mainJNI.Solver_makeSquare(swigCPtr, this, IntExpr.getCPtr(expr), expr);
960 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
961 }
962
966 public IntExpr makePower(IntExpr expr, long n) {
967 long cPtr = mainJNI.Solver_makePower(swigCPtr, this, IntExpr.getCPtr(expr), expr, n);
968 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
969 }
970
974 public IntExpr makeElement(long[] values, IntVar index) {
975 long cPtr = mainJNI.Solver_makeElement__SWIG_0(swigCPtr, this, values, IntVar.getCPtr(index), index);
976 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
977 }
978
982 public IntExpr makeElement(int[] values, IntVar index) {
983 long cPtr = mainJNI.Solver_makeElement__SWIG_1(swigCPtr, this, values, IntVar.getCPtr(index), index);
984 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
985 }
986
992 public IntExpr makeElement(LongUnaryOperator values, IntVar index) {
993 long cPtr = mainJNI.Solver_makeElement__SWIG_2(swigCPtr, this, values, IntVar.getCPtr(index), index);
994 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
995 }
996
1005 public IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index) {
1006 long cPtr = mainJNI.Solver_makeMonotonicElement(swigCPtr, this, values, increasing, IntVar.getCPtr(index), index);
1007 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1008 }
1009
1013 public IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2) {
1014 long cPtr = mainJNI.Solver_makeElement__SWIG_3(swigCPtr, this, values, IntVar.getCPtr(index1), index1, IntVar.getCPtr(index2), index2);
1015 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1016 }
1017
1021 public IntExpr makeElement(IntVar[] vars, IntVar index) {
1022 long cPtr = mainJNI.Solver_makeElement__SWIG_4(swigCPtr, this, vars, IntVar.getCPtr(index), index);
1023 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1024 }
1025
1030 public IntExpr makeIndexExpression(IntVar[] vars, long value) {
1031 long cPtr = mainJNI.Solver_makeIndexExpression(swigCPtr, this, vars, value);
1032 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1033 }
1034
1038 public Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var) {
1039 long cPtr = mainJNI.Solver_makeIfThenElseCt(swigCPtr, this, IntVar.getCPtr(condition), condition, IntExpr.getCPtr(then_expr), then_expr, IntExpr.getCPtr(else_expr), else_expr, IntVar.getCPtr(target_var), target_var);
1040 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1041 }
1042
1046 public IntExpr makeMin(IntVar[] vars) {
1047 long cPtr = mainJNI.Solver_makeMin__SWIG_0(swigCPtr, this, vars);
1048 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1049 }
1050
1054 public IntExpr makeMin(IntExpr left, IntExpr right) {
1055 long cPtr = mainJNI.Solver_makeMin__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1056 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1057 }
1058
1062 public IntExpr makeMin(IntExpr expr, long value) {
1063 long cPtr = mainJNI.Solver_makeMin__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1064 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1065 }
1066
1070 public IntExpr makeMin(IntExpr expr, int value) {
1071 long cPtr = mainJNI.Solver_makeMin__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1072 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1073 }
1074
1078 public IntExpr makeMax(IntVar[] vars) {
1079 long cPtr = mainJNI.Solver_makeMax__SWIG_0(swigCPtr, this, vars);
1080 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1081 }
1082
1086 public IntExpr makeMax(IntExpr left, IntExpr right) {
1087 long cPtr = mainJNI.Solver_makeMax__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1088 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1089 }
1090
1094 public IntExpr makeMax(IntExpr expr, long value) {
1095 long cPtr = mainJNI.Solver_makeMax__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1096 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1097 }
1098
1102 public IntExpr makeMax(IntExpr expr, int value) {
1103 long cPtr = mainJNI.Solver_makeMax__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1104 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1105 }
1106
1110 public IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost) {
1111 long cPtr = mainJNI.Solver_makeConvexPiecewiseExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, early_cost, early_date, late_date, late_cost);
1112 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1113 }
1114
1119 public IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step) {
1120 long cPtr = mainJNI.Solver_makeSemiContinuousExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, fixed_charge, step);
1121 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1122 }
1123
1130 public IntExpr makeModulo(IntExpr x, long mod) {
1131 long cPtr = mainJNI.Solver_makeModulo__SWIG_0(swigCPtr, this, IntExpr.getCPtr(x), x, mod);
1132 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1133 }
1134
1139 long cPtr = mainJNI.Solver_makeModulo__SWIG_1(swigCPtr, this, IntExpr.getCPtr(x), x, IntExpr.getCPtr(mod), mod);
1140 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1141 }
1142
1146 public IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value) {
1147 long cPtr = mainJNI.Solver_makeConditionalExpression(swigCPtr, this, IntVar.getCPtr(condition), condition, IntExpr.getCPtr(expr), expr, unperformed_value);
1148 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1149 }
1150
1155 long cPtr = mainJNI.Solver_makeTrueConstraint(swigCPtr, this);
1156 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1157 }
1158
1163 long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_0(swigCPtr, this);
1164 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1165 }
1166
1167 public Constraint makeFalseConstraint(String explanation) {
1168 long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_1(swigCPtr, this, explanation);
1169 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1170 }
1171
1175 public Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1176 long cPtr = mainJNI.Solver_makeIsEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1177 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1178 }
1179
1183 public IntVar makeIsEqualCstVar(IntExpr var, long value) {
1184 long cPtr = mainJNI.Solver_makeIsEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1185 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1186 }
1187
1192 long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
1193 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1194 }
1195
1200 long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
1201 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1202 }
1203
1208 long cPtr = mainJNI.Solver_makeEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1209 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1210 }
1211
1215 public Constraint makeEquality(IntExpr expr, long value) {
1216 long cPtr = mainJNI.Solver_makeEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1217 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1218 }
1219
1223 public Constraint makeEquality(IntExpr expr, int value) {
1224 long cPtr = mainJNI.Solver_makeEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1225 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1226 }
1227
1231 public Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar) {
1232 long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1233 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1234 }
1235
1239 public IntVar makeIsDifferentCstVar(IntExpr var, long value) {
1240 long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1241 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1242 }
1243
1248 long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
1249 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1250 }
1251
1256 long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
1257 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1258 }
1259
1264 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1265 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1266 }
1267
1271 public Constraint makeNonEquality(IntExpr expr, long value) {
1272 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1273 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1274 }
1275
1279 public Constraint makeNonEquality(IntExpr expr, int value) {
1280 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1281 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1282 }
1283
1287 public Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1288 long cPtr = mainJNI.Solver_makeIsLessOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1289 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1290 }
1291
1295 public IntVar makeIsLessOrEqualCstVar(IntExpr var, long value) {
1296 long cPtr = mainJNI.Solver_makeIsLessOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1297 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1298 }
1299
1304 long cPtr = mainJNI.Solver_makeIsLessOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1305 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1306 }
1307
1312 long cPtr = mainJNI.Solver_makeIsLessOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1313 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1314 }
1315
1320 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1321 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1322 }
1323
1327 public Constraint makeLessOrEqual(IntExpr expr, long value) {
1328 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1329 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1330 }
1331
1335 public Constraint makeLessOrEqual(IntExpr expr, int value) {
1336 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1337 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1338 }
1339
1343 public Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1344 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1345 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1346 }
1347
1352 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1353 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1354 }
1355
1360 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1361 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1362 }
1363
1368 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1369 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1370 }
1371
1376 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1377 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1378 }
1379
1383 public Constraint makeGreaterOrEqual(IntExpr expr, long value) {
1384 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1385 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1386 }
1387
1391 public Constraint makeGreaterOrEqual(IntExpr expr, int value) {
1392 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1393 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1394 }
1395
1400 long cPtr = mainJNI.Solver_makeIsGreaterCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
1401 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1402 }
1403
1407 public IntVar makeIsGreaterCstVar(IntExpr var, long value) {
1408 long cPtr = mainJNI.Solver_makeIsGreaterCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1409 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1410 }
1411
1416 long cPtr = mainJNI.Solver_makeIsGreaterVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1417 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1418 }
1419
1424 long cPtr = mainJNI.Solver_makeIsGreaterCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1425 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1426 }
1427
1432 long cPtr = mainJNI.Solver_makeGreater__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1433 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1434 }
1435
1439 public Constraint makeGreater(IntExpr expr, long value) {
1440 long cPtr = mainJNI.Solver_makeGreater__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1441 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1442 }
1443
1447 public Constraint makeGreater(IntExpr expr, int value) {
1448 long cPtr = mainJNI.Solver_makeGreater__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1449 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1450 }
1451
1456 long cPtr = mainJNI.Solver_makeIsLessCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
1457 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1458 }
1459
1463 public IntVar makeIsLessCstVar(IntExpr var, long value) {
1464 long cPtr = mainJNI.Solver_makeIsLessCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1465 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1466 }
1467
1471 public IntVar makeIsLessVar(IntExpr left, IntExpr right) {
1472 long cPtr = mainJNI.Solver_makeIsLessVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1473 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1474 }
1475
1480 long cPtr = mainJNI.Solver_makeIsLessCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1481 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1482 }
1483
1487 public Constraint makeLess(IntExpr left, IntExpr right) {
1488 long cPtr = mainJNI.Solver_makeLess__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1489 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1490 }
1491
1495 public Constraint makeLess(IntExpr expr, long value) {
1496 long cPtr = mainJNI.Solver_makeLess__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1497 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1498 }
1499
1503 public Constraint makeLess(IntExpr expr, int value) {
1504 long cPtr = mainJNI.Solver_makeLess__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1505 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1506 }
1507
1511 public Constraint makeSumLessOrEqual(IntVar[] vars, long cst) {
1512 long cPtr = mainJNI.Solver_makeSumLessOrEqual(swigCPtr, this, vars, cst);
1513 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1514 }
1515
1516 public Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst) {
1517 long cPtr = mainJNI.Solver_makeSumGreaterOrEqual(swigCPtr, this, vars, cst);
1518 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1519 }
1520
1521 public Constraint makeSumEquality(IntVar[] vars, long cst) {
1522 long cPtr = mainJNI.Solver_makeSumEquality__SWIG_0(swigCPtr, this, vars, cst);
1523 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1524 }
1525
1527 long cPtr = mainJNI.Solver_makeSumEquality__SWIG_1(swigCPtr, this, vars, IntVar.getCPtr(var), var);
1528 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1529 }
1530
1531 public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst) {
1532 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_0(swigCPtr, this, vars, coefficients, cst);
1533 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1534 }
1535
1536 public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst) {
1537 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_1(swigCPtr, this, vars, coefficients, cst);
1538 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1539 }
1540
1541 public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target) {
1542 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_2(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
1543 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1544 }
1545
1546 public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target) {
1547 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_3(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
1548 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1549 }
1550
1551 public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst) {
1552 long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_0(swigCPtr, this, vars, coeffs, cst);
1553 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1554 }
1555
1556 public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst) {
1557 long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_1(swigCPtr, this, vars, coeffs, cst);
1558 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1559 }
1560
1561 public Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst) {
1562 long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_0(swigCPtr, this, vars, coefficients, cst);
1563 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1564 }
1565
1566 public Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst) {
1567 long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_1(swigCPtr, this, vars, coefficients, cst);
1568 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1569 }
1570
1571 public Constraint makeMinEquality(IntVar[] vars, IntVar min_var) {
1572 long cPtr = mainJNI.Solver_makeMinEquality(swigCPtr, this, vars, IntVar.getCPtr(min_var), min_var);
1573 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1574 }
1575
1576 public Constraint makeMaxEquality(IntVar[] vars, IntVar max_var) {
1577 long cPtr = mainJNI.Solver_makeMaxEquality(swigCPtr, this, vars, IntVar.getCPtr(max_var), max_var);
1578 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1579 }
1580
1581 public Constraint makeElementEquality(long[] vals, IntVar index, IntVar target) {
1582 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_0(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1583 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1584 }
1585
1586 public Constraint makeElementEquality(int[] vals, IntVar index, IntVar target) {
1587 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_1(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1588 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1589 }
1590
1591 public Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target) {
1592 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_2(swigCPtr, this, vars, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1593 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1594 }
1595
1596 public Constraint makeElementEquality(IntVar[] vars, IntVar index, long target) {
1597 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_3(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
1598 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1599 }
1600
1605 long cPtr = mainJNI.Solver_makeAbsEquality(swigCPtr, this, IntVar.getCPtr(var), var, IntVar.getCPtr(abs_var), abs_var);
1606 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1607 }
1608
1615 public Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target) {
1616 long cPtr = mainJNI.Solver_makeIndexOfConstraint(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
1617 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1618 }
1619
1625 long cPtr = mainJNI.Solver_makeConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
1626 return (cPtr == 0) ? null : new Demon(cPtr, false);
1627 }
1628
1635 long cPtr = mainJNI.Solver_makeDelayedConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
1636 return (cPtr == 0) ? null : new Demon(cPtr, false);
1637 }
1638
1642 public Demon makeClosureDemon(Runnable closure) {
1643 long cPtr = mainJNI.Solver_makeClosureDemon(swigCPtr, this, closure);
1644 return (cPtr == 0) ? null : new Demon(cPtr, false);
1645 }
1646
1650 public Constraint makeBetweenCt(IntExpr expr, long l, long u) {
1651 long cPtr = mainJNI.Solver_makeBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
1652 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1653 }
1654
1661 public Constraint makeNotBetweenCt(IntExpr expr, long l, long u) {
1662 long cPtr = mainJNI.Solver_makeNotBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
1663 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1664 }
1665
1669 public Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b) {
1670 long cPtr = mainJNI.Solver_makeIsBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u, IntVar.getCPtr(b), b);
1671 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1672 }
1673
1674 public IntVar makeIsBetweenVar(IntExpr v, long l, long u) {
1675 long cPtr = mainJNI.Solver_makeIsBetweenVar(swigCPtr, this, IntExpr.getCPtr(v), v, l, u);
1676 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1677 }
1678
1683 public Constraint makeMemberCt(IntExpr expr, long[] values) {
1684 long cPtr = mainJNI.Solver_makeMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1685 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1686 }
1687
1688 public Constraint makeMemberCt(IntExpr expr, int[] values) {
1689 long cPtr = mainJNI.Solver_makeMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1690 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1691 }
1692
1696 public Constraint makeNotMemberCt(IntExpr expr, long[] values) {
1697 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1698 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1699 }
1700
1701 public Constraint makeNotMemberCt(IntExpr expr, int[] values) {
1702 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1703 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1704 }
1705
1709 public Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends) {
1710 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1711 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1712 }
1713
1717 public Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends) {
1718 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1719 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1720 }
1721
1725 public Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar) {
1726 long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1727 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1728 }
1729
1730 public Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar) {
1731 long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1732 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1733 }
1734
1735 public IntVar makeIsMemberVar(IntExpr expr, long[] values) {
1736 long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1737 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1738 }
1739
1740 public IntVar makeIsMemberVar(IntExpr expr, int[] values) {
1741 long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1742 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1743 }
1744
1748 public Constraint makeCount(IntVar[] vars, long value, long max_count) {
1749 long cPtr = mainJNI.Solver_makeCount__SWIG_0(swigCPtr, this, vars, value, max_count);
1750 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1751 }
1752
1756 public Constraint makeCount(IntVar[] vars, long value, IntVar max_count) {
1757 long cPtr = mainJNI.Solver_makeCount__SWIG_1(swigCPtr, this, vars, value, IntVar.getCPtr(max_count), max_count);
1758 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1759 }
1760
1764 public Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards) {
1765 long cPtr = mainJNI.Solver_makeDistribute__SWIG_0(swigCPtr, this, vars, values, cards);
1766 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1767 }
1768
1772 public Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards) {
1773 long cPtr = mainJNI.Solver_makeDistribute__SWIG_1(swigCPtr, this, vars, values, cards);
1774 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1775 }
1776
1780 public Constraint makeDistribute(IntVar[] vars, IntVar[] cards) {
1781 long cPtr = mainJNI.Solver_makeDistribute__SWIG_2(swigCPtr, this, vars, cards);
1782 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1783 }
1784
1789 public Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size) {
1790 long cPtr = mainJNI.Solver_makeDistribute__SWIG_3(swigCPtr, this, vars, card_min, card_max, card_size);
1791 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1792 }
1793
1799 public Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max) {
1800 long cPtr = mainJNI.Solver_makeDistribute__SWIG_4(swigCPtr, this, vars, card_min, card_max);
1801 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1802 }
1803
1809 public Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max) {
1810 long cPtr = mainJNI.Solver_makeDistribute__SWIG_5(swigCPtr, this, vars, card_min, card_max);
1811 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1812 }
1813
1819 public Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max) {
1820 long cPtr = mainJNI.Solver_makeDistribute__SWIG_6(swigCPtr, this, vars, values, card_min, card_max);
1821 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1822 }
1823
1829 public Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max) {
1830 long cPtr = mainJNI.Solver_makeDistribute__SWIG_7(swigCPtr, this, vars, values, card_min, card_max);
1831 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1832 }
1833
1840 public Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum) {
1841 long cPtr = mainJNI.Solver_makeDeviation(swigCPtr, this, vars, IntVar.getCPtr(deviation_var), deviation_var, total_sum);
1842 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1843 }
1844
1850 long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_0(swigCPtr, this, vars);
1851 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1852 }
1853
1859 public Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation) {
1860 long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_1(swigCPtr, this, vars, stronger_propagation);
1861 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1862 }
1863
1868 public Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value) {
1869 long cPtr = mainJNI.Solver_makeAllDifferentExcept(swigCPtr, this, vars, escape_value);
1870 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1871 }
1872
1891 long cPtr = mainJNI.Solver_makeSortingConstraint(swigCPtr, this, vars, sorted);
1892 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1893 }
1894
1899 public Constraint makeLexicalLess(IntVar[] left, IntVar[] right) {
1900 long cPtr = mainJNI.Solver_makeLexicalLess(swigCPtr, this, left, right);
1901 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1902 }
1903
1909 long cPtr = mainJNI.Solver_makeLexicalLessOrEqual(swigCPtr, this, left, right);
1910 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1911 }
1912
1919 public Constraint MakeLexicalLessOrEqualWithOffsets(IntVar[] left, IntVar[] right, long[] offsets) {
1920 long cPtr = mainJNI.Solver_MakeLexicalLessOrEqualWithOffsets(swigCPtr, this, left, right, offsets);
1921 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1922 }
1923
1924 public Constraint MakeIsLexicalLessOrEqualWithOffsetsCt(IntVar[] left, IntVar[] right, long[] offsets, IntVar boolvar) {
1925 long cPtr = mainJNI.Solver_MakeIsLexicalLessOrEqualWithOffsetsCt(swigCPtr, this, left, right, offsets, IntVar.getCPtr(boolvar), boolvar);
1926 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1927 }
1928
1936 long cPtr = mainJNI.Solver_makeInversePermutationConstraint(swigCPtr, this, left, right);
1937 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1938 }
1939
1945 long cPtr = mainJNI.Solver_makeIndexOfFirstMaxValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1946 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1947 }
1948
1954 long cPtr = mainJNI.Solver_makeIndexOfFirstMinValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1955 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1956 }
1957
1964 public Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars) {
1965 long cPtr = mainJNI.Solver_makeNullIntersect(swigCPtr, this, first_vars, second_vars);
1966 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1967 }
1968
1976 public Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value) {
1977 long cPtr = mainJNI.Solver_makeNullIntersectExcept(swigCPtr, this, first_vars, second_vars, escape_value);
1978 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1979 }
1980
1992 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler) {
1993 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_0(swigCPtr, this, nexts, active, sink_handler);
1994 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1995 }
1996
2008 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active) {
2009 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_1(swigCPtr, this, nexts, active);
2010 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2011 }
2012
2013 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths) {
2014 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_2(swigCPtr, this, nexts, active, sink_handler, assume_paths);
2015 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2016 }
2017
2022 long cPtr = mainJNI.Solver_makeCircuit(swigCPtr, this, nexts);
2023 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2024 }
2025
2031 long cPtr = mainJNI.Solver_makeSubCircuit(swigCPtr, this, nexts);
2032 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2033 }
2034
2041 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
2042 long cPtr = mainJNI.Solver_makePathCumul__SWIG_0(swigCPtr, this, nexts, active, cumuls, transits);
2043 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2044 }
2045
2050 public Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
2051 long cPtr = mainJNI.Solver_makeDelayedPathCumul(swigCPtr, this, nexts, active, cumuls, transits);
2052 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2053 }
2054
2063 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator) {
2064 long cPtr = mainJNI.Solver_makePathCumul__SWIG_1(swigCPtr, this, nexts, active, cumuls, transit_evaluator);
2065 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2066 }
2067
2076 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator) {
2077 long cPtr = mainJNI.Solver_makePathCumul__SWIG_2(swigCPtr, this, nexts, active, cumuls, slacks, transit_evaluator);
2078 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2079 }
2080
2086 public Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status) {
2087 long cPtr = mainJNI.Solver_makePathConnected(swigCPtr, this, nexts, sources, sinks, status);
2088 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2089 }
2090
2096 public Constraint makeMapDomain(IntVar var, IntVar[] actives) {
2097 long cPtr = mainJNI.Solver_makeMapDomain(swigCPtr, this, IntVar.getCPtr(var), var, actives);
2098 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2099 }
2100
2108 long cPtr = mainJNI.Solver_makeAllowedAssignment(swigCPtr, this, vars, IntTupleSet.getCPtr(tuples), tuples);
2109 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2110 }
2111
2121 public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states) {
2122 long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_0(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
2123 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2124 }
2125
2135 public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states) {
2136 long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_1(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
2137 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2138 }
2139
2150 public Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
2151 long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
2152 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2153 }
2154
2155 public Constraint 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) {
2156 long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_1(swigCPtr, this, x_vars, y_vars, SWIGTYPE_p_absl__SpanT_long_const_t.getCPtr(x_size), SWIGTYPE_p_absl__SpanT_long_const_t.getCPtr(y_size));
2157 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2158 }
2159
2160 public Constraint 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) {
2161 long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_2(swigCPtr, this, x_vars, y_vars, SWIGTYPE_p_absl__SpanT_int_const_t.getCPtr(x_size), SWIGTYPE_p_absl__SpanT_int_const_t.getCPtr(y_size));
2162 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2163 }
2164
2175 public Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
2176 long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
2177 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2178 }
2179
2180 public Constraint 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) {
2181 long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_1(swigCPtr, this, x_vars, y_vars, SWIGTYPE_p_absl__SpanT_long_const_t.getCPtr(x_size), SWIGTYPE_p_absl__SpanT_long_const_t.getCPtr(y_size));
2182 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2183 }
2184
2185 public Constraint 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) {
2186 long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_2(swigCPtr, this, x_vars, y_vars, SWIGTYPE_p_absl__SpanT_int_const_t.getCPtr(x_size), SWIGTYPE_p_absl__SpanT_int_const_t.getCPtr(y_size));
2187 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2188 }
2189
2197 public Pack makePack(IntVar[] vars, int number_of_bins) {
2198 long cPtr = mainJNI.Solver_makePack(swigCPtr, this, vars, number_of_bins);
2199 return (cPtr == 0) ? null : new Pack(cPtr, false);
2200 }
2201
2208 public IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name) {
2209 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_0(swigCPtr, this, start_min, start_max, duration, optional, name);
2210 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2211 }
2212
2217 public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name) {
2218 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_1(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, name);
2219 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2220 }
2221
2226 public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name) {
2227 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_2(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, IntVar.getCPtr(performed_variable), performed_variable, name);
2228 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2229 }
2230
2234 public IntervalVar makeFixedInterval(long start, long duration, String name) {
2235 long cPtr = mainJNI.Solver_makeFixedInterval(swigCPtr, this, start, duration, name);
2236 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2237 }
2238
2243 public IntervalVar makeIntervalVar(long start_min, long start_max, long duration_min, long duration_max, long end_min, long end_max, boolean optional, String name) {
2244 long cPtr = mainJNI.Solver_makeIntervalVar(swigCPtr, this, start_min, start_max, duration_min, duration_max, end_min, end_max, optional, name);
2245 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2246 }
2247
2253 long cPtr = mainJNI.Solver_makeMirrorInterval(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2254 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2255 }
2256
2263 public IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
2264 long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2265 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2266 }
2267
2274 public IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
2275 long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2276 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2277 }
2278
2285 public IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
2286 long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2287 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2288 }
2289
2296 public IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
2297 long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2298 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2299 }
2300
2321 long cPtr = mainJNI.Solver_makeIntervalRelaxedMin(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2322 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2323 }
2324
2345 long cPtr = mainJNI.Solver_makeIntervalRelaxedMax(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2346 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2347 }
2348
2354 long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t), t, r, d);
2355 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2356 }
2357
2362 long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2);
2363 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2364 }
2365
2373 long cPtr = mainJNI.Solver_makeIntervalVarRelationWithDelay(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2, delay);
2374 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2375 }
2376
2383 long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2, IntVar.getCPtr(alt), alt);
2384 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2385 }
2386
2392 long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2);
2393 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2394 }
2395
2401 long cPtr = mainJNI.Solver_makeDisjunctiveConstraint(swigCPtr, this, intervals, name);
2402 return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
2403 }
2404
2411 long cPtr = mainJNI.Solver_makeStrictDisjunctiveConstraint(swigCPtr, this, intervals, name);
2412 return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
2413 }
2414
2426 public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name) {
2427 long cPtr = mainJNI.Solver_makeCumulative__SWIG_0(swigCPtr, this, intervals, demands, capacity, name);
2428 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2429 }
2430
2442 public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name) {
2443 long cPtr = mainJNI.Solver_makeCumulative__SWIG_1(swigCPtr, this, intervals, demands, capacity, name);
2444 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2445 }
2446
2458 public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name) {
2459 long cPtr = mainJNI.Solver_makeCumulative__SWIG_2(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2460 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2461 }
2462
2474 public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name) {
2475 long cPtr = mainJNI.Solver_makeCumulative__SWIG_3(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2476 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2477 }
2478
2488 public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name) {
2489 long cPtr = mainJNI.Solver_makeCumulative__SWIG_4(swigCPtr, this, intervals, demands, capacity, name);
2490 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2491 }
2492
2502 public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name) {
2503 long cPtr = mainJNI.Solver_makeCumulative__SWIG_5(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2504 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2505 }
2506
2514 public Constraint makeCover(IntervalVar[] vars, IntervalVar target_var) {
2515 long cPtr = mainJNI.Solver_makeCover(swigCPtr, this, vars, IntervalVar.getCPtr(target_var), target_var);
2516 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2517 }
2518
2523 long cPtr = mainJNI.Solver_makeEquality__SWIG_3(swigCPtr, this, IntervalVar.getCPtr(var1), var1, IntervalVar.getCPtr(var2), var2);
2524 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2525 }
2526
2531 long cPtr = mainJNI.Solver_makeAssignment__SWIG_0(swigCPtr, this);
2532 return (cPtr == 0) ? null : new Assignment(cPtr, false);
2533 }
2534
2539 long cPtr = mainJNI.Solver_makeAssignment__SWIG_1(swigCPtr, this, Assignment.getCPtr(a), a);
2540 return (cPtr == 0) ? null : new Assignment(cPtr, false);
2541 }
2542
2547 long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2548 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2549 }
2550
2556 long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_1(swigCPtr, this);
2557 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2558 }
2559
2564 long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2565 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2566 }
2567
2573 long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_1(swigCPtr, this);
2574 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2575 }
2576
2583 public SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize) {
2584 long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, maximize);
2585 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2586 }
2587
2592 public SolutionCollector MakeBestLexicographicValueSolutionCollector(Assignment assignment, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2593 long cPtr = mainJNI.Solver_MakeBestLexicographicValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2594 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2595 }
2596
2605 long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_1(swigCPtr, this, maximize);
2606 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2607 }
2608
2613 public SolutionCollector MakeBestLexicographicValueSolutionCollector(SWIGTYPE_p_std__vectorT_bool_t maximize) {
2614 long cPtr = mainJNI.Solver_MakeBestLexicographicValueSolutionCollector__SWIG_1(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2615 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2616 }
2617
2623 public SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize) {
2624 long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, solution_count, maximize);
2625 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2626 }
2627
2628 public SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize) {
2629 long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_1(swigCPtr, this, solution_count, maximize);
2630 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2631 }
2632
2637 public SolutionCollector MakeNBestLexicographicValueSolutionCollector(Assignment assignment, int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2638 long cPtr = mainJNI.Solver_MakeNBestLexicographicValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, solution_count, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2639 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2640 }
2641
2642 public SolutionCollector MakeNBestLexicographicValueSolutionCollector(int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2643 long cPtr = mainJNI.Solver_MakeNBestLexicographicValueSolutionCollector__SWIG_1(swigCPtr, this, solution_count, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2644 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2645 }
2646
2651 long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2652 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2653 }
2654
2660 long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_1(swigCPtr, this);
2661 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2662 }
2663
2667 public OptimizeVar makeMinimize(IntVar v, long step) {
2668 long cPtr = mainJNI.Solver_makeMinimize(swigCPtr, this, IntVar.getCPtr(v), v, step);
2669 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2670 }
2671
2675 public OptimizeVar makeMaximize(IntVar v, long step) {
2676 long cPtr = mainJNI.Solver_makeMaximize(swigCPtr, this, IntVar.getCPtr(v), v, step);
2677 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2678 }
2679
2683 public OptimizeVar makeOptimize(boolean maximize, IntVar v, long step) {
2684 long cPtr = mainJNI.Solver_makeOptimize(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step);
2685 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2686 }
2687
2692 public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step) {
2693 long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
2694 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2695 }
2696
2701 public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step) {
2702 long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
2703 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2704 }
2705
2709 public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step) {
2710 long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
2711 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2712 }
2713
2717 public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step) {
2718 long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
2719 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2720 }
2721
2725 public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step) {
2726 long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_0(swigCPtr, this, maximize, sub_objectives, weights, step);
2727 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2728 }
2729
2733 public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step) {
2734 long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_1(swigCPtr, this, maximize, sub_objectives, weights, step);
2735 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2736 }
2737
2742 public OptimizeVar MakeLexicographicOptimize(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] variables, long[] steps) {
2743 long cPtr = mainJNI.Solver_MakeLexicographicOptimize(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), variables, steps);
2744 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2745 }
2746
2765 public ObjectiveMonitor makeTabuSearch(boolean maximize, IntVar objective, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) {
2766 long cPtr = mainJNI.Solver_makeTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(objective), objective, step, vars, keep_tenure, forbid_tenure, tabu_factor);
2767 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2768 }
2769
2770 public ObjectiveMonitor MakeLexicographicTabuSearch(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] objectives, long[] steps, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) {
2771 long cPtr = mainJNI.Solver_MakeLexicographicTabuSearch(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), objectives, steps, vars, keep_tenure, forbid_tenure, tabu_factor);
2772 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2773 }
2774
2779 public ObjectiveMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure) {
2780 long cPtr = mainJNI.Solver_makeGenericTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, tabu_vars, forbid_tenure);
2781 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2782 }
2783
2787 public ObjectiveMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature) {
2788 long cPtr = mainJNI.Solver_makeSimulatedAnnealing(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, initial_temperature);
2789 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2790 }
2791
2792 public ObjectiveMonitor MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps, long[] initial_temperatures) {
2793 long cPtr = mainJNI.Solver_MakeLexicographicSimulatedAnnealing(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), vars, steps, initial_temperatures);
2794 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2795 }
2796
2801 public BaseObjectiveMonitor MakeRoundRobinCompoundObjectiveMonitor(SWIGTYPE_p_std__vectorT_operations_research__BaseObjectiveMonitor_p_t monitors, int num_max_local_optima_before_metaheuristic_switch) {
2802 long cPtr = mainJNI.Solver_MakeRoundRobinCompoundObjectiveMonitor(swigCPtr, this, SWIGTYPE_p_std__vectorT_operations_research__BaseObjectiveMonitor_p_t.getCPtr(monitors), num_max_local_optima_before_metaheuristic_switch);
2803 return (cPtr == 0) ? null : new BaseObjectiveMonitor(cPtr, false);
2804 }
2805
2811 public SearchMonitor makeLubyRestart(int scale_factor) {
2812 long cPtr = mainJNI.Solver_makeLubyRestart(swigCPtr, this, scale_factor);
2813 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2814 }
2815
2820 public SearchMonitor makeConstantRestart(int frequency) {
2821 long cPtr = mainJNI.Solver_makeConstantRestart(swigCPtr, this, frequency);
2822 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2823 }
2824
2828 public RegularLimit makeTimeLimit(SWIGTYPE_p_absl__Duration time) {
2829 long cPtr = mainJNI.Solver_makeTimeLimit__SWIG_0(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time));
2830 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2831 }
2832
2833 public RegularLimit makeTimeLimit(long time_in_ms) {
2834 long cPtr = mainJNI.Solver_makeTimeLimit__SWIG_1(swigCPtr, this, time_in_ms);
2835 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2836 }
2837
2843 long cPtr = mainJNI.Solver_makeBranchesLimit(swigCPtr, this, branches);
2844 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2845 }
2846
2852 long cPtr = mainJNI.Solver_makeFailuresLimit(swigCPtr, this, failures);
2853 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2854 }
2855
2861 long cPtr = mainJNI.Solver_makeSolutionsLimit(swigCPtr, this, solutions);
2862 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2863 }
2864
2869 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative) {
2870 long cPtr = mainJNI.Solver_makeLimit__SWIG_0(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions, smart_time_check, cumulative);
2871 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2872 }
2873
2878 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check) {
2879 long cPtr = mainJNI.Solver_makeLimit__SWIG_1(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions, smart_time_check);
2880 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2881 }
2882
2887 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions) {
2888 long cPtr = mainJNI.Solver_makeLimit__SWIG_2(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions);
2889 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2890 }
2891
2895 public RegularLimit makeLimit(com.google.ortools.constraintsolver.RegularLimitParameters proto) {
2896 long cPtr = mainJNI.Solver_makeLimit__SWIG_3(swigCPtr, this, proto.toByteArray());
2897 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2898 }
2899
2900 public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative) {
2901 long cPtr = mainJNI.Solver_makeLimit__SWIG_4(swigCPtr, this, time, branches, failures, solutions, smart_time_check, cumulative);
2902 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2903 }
2904
2905 public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check) {
2906 long cPtr = mainJNI.Solver_makeLimit__SWIG_5(swigCPtr, this, time, branches, failures, solutions, smart_time_check);
2907 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2908 }
2909
2910 public RegularLimit makeLimit(long time, long branches, long failures, long solutions) {
2911 long cPtr = mainJNI.Solver_makeLimit__SWIG_6(swigCPtr, this, time, branches, failures, solutions);
2912 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2913 }
2914
2919 byte[] buf = mainJNI.Solver_makeDefaultRegularLimitParameters(swigCPtr, this);
2920 if (buf == null || buf.length == 0) {
2921 return null;
2922 }
2923 try {
2924 return com.google.ortools.constraintsolver.RegularLimitParameters.parseFrom(buf);
2925 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
2926 throw new RuntimeException(
2927 "Unable to parse com.google.ortools.constraintsolver.RegularLimitParameters protocol message.");
2928 }
2929}
2930
2937 long cPtr = mainJNI.Solver_makeLimit__SWIG_7(swigCPtr, this, SearchLimit.getCPtr(limit_1), limit_1, SearchLimit.getCPtr(limit_2), limit_2);
2938 return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
2939 }
2940
2947 public ImprovementSearchLimit MakeImprovementLimit(IntVar objective_var, boolean maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance) {
2948 long cPtr = mainJNI.Solver_MakeImprovementLimit(swigCPtr, this, IntVar.getCPtr(objective_var), objective_var, maximize, objective_scaling_factor, objective_offset, improvement_rate_coefficient, improvement_rate_solutions_distance);
2949 return (cPtr == 0) ? null : new ImprovementSearchLimit(cPtr, false);
2950 }
2951
2956 public ImprovementSearchLimit 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) {
2957 long cPtr = mainJNI.Solver_MakeLexicographicImprovementLimit(swigCPtr, this, objective_vars, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), objective_scaling_factors, objective_offsets, improvement_rate_coefficient, improvement_rate_solutions_distance);
2958 return (cPtr == 0) ? null : new ImprovementSearchLimit(cPtr, false);
2959 }
2960
2965 public SearchLimit makeCustomLimit(BooleanSupplier limiter) {
2966 long cPtr = mainJNI.Solver_makeCustomLimit(swigCPtr, this, limiter);
2967 return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
2968 }
2969
2974 public SearchMonitor makeSearchLog(int branch_period) {
2975 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_0(swigCPtr, this, branch_period);
2976 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2977 }
2978
2982 public SearchMonitor makeSearchLog(int branch_period, IntVar var) {
2983 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_1(swigCPtr, this, branch_period, IntVar.getCPtr(var), var);
2984 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2985 }
2986
2991 public SearchMonitor makeSearchLog(int branch_period, Supplier<String> display_callback) {
2992 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_2(swigCPtr, this, branch_period, display_callback);
2993 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2994 }
2995
3000 public SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier<String> display_callback) {
3001 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_3(swigCPtr, this, branch_period, IntVar.getCPtr(var), var, display_callback);
3002 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3003 }
3004
3009 public SearchMonitor makeSearchLog(int branch_period, IntVar[] vars, Supplier<String> display_callback) {
3010 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_4(swigCPtr, this, branch_period, vars, display_callback);
3011 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3012 }
3013
3018 public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var) {
3019 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_5(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var);
3020 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3021 }
3022
3027 public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier<String> display_callback) {
3028 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_6(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var, display_callback);
3029 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3030 }
3031
3036 public SearchMonitor makeSearchTrace(String prefix) {
3037 long cPtr = mainJNI.Solver_makeSearchTrace(swigCPtr, this, prefix);
3038 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3039 }
3040
3044 public SearchMonitor makeEnterSearchCallback(Runnable callback) {
3045 long cPtr = mainJNI.Solver_makeEnterSearchCallback(swigCPtr, this, callback);
3046 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3047 }
3048
3049 public SearchMonitor makeExitSearchCallback(Runnable callback) {
3050 long cPtr = mainJNI.Solver_makeExitSearchCallback(swigCPtr, this, callback);
3051 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3052 }
3053
3054 public SearchMonitor makeAtSolutionCallback(Runnable callback) {
3055 long cPtr = mainJNI.Solver_makeAtSolutionCallback(swigCPtr, this, callback);
3056 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3057 }
3058
3063 long cPtr = mainJNI.Solver_makePrintModelVisitor(swigCPtr, this);
3064 return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
3065 }
3066
3071 long cPtr = mainJNI.Solver_makeStatisticsModelVisitor(swigCPtr, this);
3072 return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
3073 }
3074
3079 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_0(swigCPtr, this, visitors);
3080 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3081 }
3082
3084 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_1(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1);
3085 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3086 }
3087
3089 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_2(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2);
3090 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3091 }
3092
3094 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_3(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2, SymmetryBreaker.getCPtr(v3), v3);
3095 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3096 }
3097
3099 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_4(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2, SymmetryBreaker.getCPtr(v3), v3, SymmetryBreaker.getCPtr(v4), v4);
3100 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3101 }
3102
3107 long cPtr = mainJNI.Solver_makeAssignVariableValue(swigCPtr, this, IntVar.getCPtr(var), var, val);
3108 return (cPtr == 0) ? null : new Decision(cPtr, false);
3109 }
3110
3112 long cPtr = mainJNI.Solver_makeVariableLessOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
3113 return (cPtr == 0) ? null : new Decision(cPtr, false);
3114 }
3115
3117 long cPtr = mainJNI.Solver_makeVariableGreaterOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
3118 return (cPtr == 0) ? null : new Decision(cPtr, false);
3119 }
3120
3121 public Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half) {
3122 long cPtr = mainJNI.Solver_makeSplitVariableDomain(swigCPtr, this, IntVar.getCPtr(var), var, val, start_with_lower_half);
3123 return (cPtr == 0) ? null : new Decision(cPtr, false);
3124 }
3125
3127 long cPtr = mainJNI.Solver_makeAssignVariableValueOrFail(swigCPtr, this, IntVar.getCPtr(var), var, value);
3128 return (cPtr == 0) ? null : new Decision(cPtr, false);
3129 }
3130
3132 long cPtr = mainJNI.Solver_MakeAssignVariableValueOrDoNothing(swigCPtr, this, IntVar.getCPtr(var), var, value);
3133 return (cPtr == 0) ? null : new Decision(cPtr, false);
3134 }
3135
3136 public Decision makeAssignVariablesValues(IntVar[] vars, long[] values) {
3137 long cPtr = mainJNI.Solver_makeAssignVariablesValues(swigCPtr, this, vars, values);
3138 return (cPtr == 0) ? null : new Decision(cPtr, false);
3139 }
3140
3142 long cPtr = mainJNI.Solver_MakeAssignVariablesValuesOrDoNothing(swigCPtr, this, vars, values);
3143 return (cPtr == 0) ? null : new Decision(cPtr, false);
3144 }
3145
3146 public Decision MakeAssignVariablesValuesOrFail(IntVar[] vars, long[] values) {
3147 long cPtr = mainJNI.Solver_MakeAssignVariablesValuesOrFail(swigCPtr, this, vars, values);
3148 return (cPtr == 0) ? null : new Decision(cPtr, false);
3149 }
3150
3152 long cPtr = mainJNI.Solver_makeFailDecision(swigCPtr, this);
3153 return (cPtr == 0) ? null : new Decision(cPtr, false);
3154 }
3155
3156 public Decision makeDecision(Consumer<Solver> apply, Consumer<Solver> refute) {
3157 long cPtr = mainJNI.Solver_makeDecision(swigCPtr, this, apply, refute);
3158 return (cPtr == 0) ? null : new Decision(cPtr, false);
3159 }
3160
3172 try {
3173 long cPtr = mainJNI.Solver_compose__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
3174 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3175 } finally {
3178 }
3179 }
3180
3182 try {
3183 long cPtr = mainJNI.Solver_compose__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
3184 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3185 } finally {
3189 }
3190 }
3191
3193 try {
3194 long cPtr = mainJNI.Solver_compose__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3, DecisionBuilder.getCPtr(db4), db4);
3195 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3196 } finally {
3201 }
3202 }
3203
3205 try {
3206 long cPtr = mainJNI.Solver_compose__SWIG_3(swigCPtr, this, dbs);
3207 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3208 } finally {
3210 }
3211 }
3212
3231 try {
3232 long cPtr = mainJNI.Solver_tryDecisions__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
3233 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3234 } finally {
3237 }
3238 }
3239
3241 try {
3242 long cPtr = mainJNI.Solver_tryDecisions__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
3243 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3244 } finally {
3248 }
3249 }
3250
3252 try {
3253 long cPtr = mainJNI.Solver_tryDecisions__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3, DecisionBuilder.getCPtr(db4), db4);
3254 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3255 } finally {
3260 }
3261 }
3262
3264 try {
3265 long cPtr = mainJNI.Solver_tryDecisions__SWIG_3(swigCPtr, this, dbs);
3266 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3267 } finally {
3269 }
3270 }
3271
3276 public DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str) {
3277 long cPtr = mainJNI.Solver_makePhase__SWIG_0(swigCPtr, this, vars, var_str, val_str);
3278 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3279 }
3280
3281 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str) {
3282 long cPtr = mainJNI.Solver_makePhase__SWIG_1(swigCPtr, this, vars, var_evaluator, val_str);
3283 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3284 }
3285
3286 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator) {
3287 long cPtr = mainJNI.Solver_makePhase__SWIG_2(swigCPtr, this, vars, var_str, value_evaluator);
3288 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3289 }
3290
3295 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator) {
3296 long cPtr = mainJNI.Solver_makePhase__SWIG_3(swigCPtr, this, vars, var_str, var_val1_val2_comparator);
3297 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3298 }
3299
3300 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator) {
3301 long cPtr = mainJNI.Solver_makePhase__SWIG_4(swigCPtr, this, vars, var_evaluator, value_evaluator);
3302 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3303 }
3304
3305 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
3306 long cPtr = mainJNI.Solver_makePhase__SWIG_5(swigCPtr, this, vars, var_str, value_evaluator, tie_breaker);
3307 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3308 }
3309
3310 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
3311 long cPtr = mainJNI.Solver_makePhase__SWIG_6(swigCPtr, this, vars, var_evaluator, value_evaluator, tie_breaker);
3312 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3313 }
3314
3316 long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_0(swigCPtr, this, vars);
3317 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3318 }
3319
3321 long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_1(swigCPtr, this, vars, DefaultPhaseParameters.getCPtr(parameters), parameters);
3322 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3323 }
3324
3328 public DecisionBuilder makePhase(IntVar v0, int var_str, int val_str) {
3329 long cPtr = mainJNI.Solver_makePhase__SWIG_7(swigCPtr, this, IntVar.getCPtr(v0), v0, var_str, val_str);
3330 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3331 }
3332
3333 public DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str) {
3334 long cPtr = mainJNI.Solver_makePhase__SWIG_8(swigCPtr, this, IntVar.getCPtr(v0), v0, IntVar.getCPtr(v1), v1, var_str, val_str);
3335 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3336 }
3337
3338 public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str) {
3339 long cPtr = mainJNI.Solver_makePhase__SWIG_9(swigCPtr, this, IntVar.getCPtr(v0), v0, IntVar.getCPtr(v1), v1, IntVar.getCPtr(v2), v2, var_str, val_str);
3340 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3341 }
3342
3343 public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str) {
3344 long cPtr = mainJNI.Solver_makePhase__SWIG_10(swigCPtr, this, IntVar.getCPtr(v0), v0, IntVar.getCPtr(v1), v1, IntVar.getCPtr(v2), v2, IntVar.getCPtr(v3), v3, var_str, val_str);
3345 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3346 }
3347
3355 public Decision makeScheduleOrPostpone(IntervalVar var, long est, SWIGTYPE_p_long marker) {
3356 long cPtr = mainJNI.Solver_makeScheduleOrPostpone(swigCPtr, this, IntervalVar.getCPtr(var), var, est, SWIGTYPE_p_long.getCPtr(marker));
3357 return (cPtr == 0) ? null : new Decision(cPtr, false);
3358 }
3359
3367 public Decision makeScheduleOrExpedite(IntervalVar var, long est, SWIGTYPE_p_long marker) {
3368 long cPtr = mainJNI.Solver_makeScheduleOrExpedite(swigCPtr, this, IntervalVar.getCPtr(var), var, est, SWIGTYPE_p_long.getCPtr(marker));
3369 return (cPtr == 0) ? null : new Decision(cPtr, false);
3370 }
3371
3376 public Decision makeRankFirstInterval(SequenceVar sequence, int index) {
3377 long cPtr = mainJNI.Solver_makeRankFirstInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
3378 return (cPtr == 0) ? null : new Decision(cPtr, false);
3379 }
3380
3385 public Decision makeRankLastInterval(SequenceVar sequence, int index) {
3386 long cPtr = mainJNI.Solver_makeRankLastInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
3387 return (cPtr == 0) ? null : new Decision(cPtr, false);
3388 }
3389
3397 public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str) {
3398 long cPtr = mainJNI.Solver_makePhase__SWIG_11(swigCPtr, this, vars, eval, str);
3399 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3400 }
3401
3411 public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str) {
3412 long cPtr = mainJNI.Solver_makePhase__SWIG_12(swigCPtr, this, vars, eval, tie_breaker, str);
3413 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3414 }
3415
3419 public DecisionBuilder makePhase(IntervalVar[] intervals, int str) {
3420 long cPtr = mainJNI.Solver_makePhase__SWIG_13(swigCPtr, this, intervals, str);
3421 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3422 }
3423
3424 public DecisionBuilder makePhase(SequenceVar[] sequences, int str) {
3425 long cPtr = mainJNI.Solver_makePhase__SWIG_14(swigCPtr, this, sequences, str);
3426 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3427 }
3428
3434 try {
3435 long cPtr = mainJNI.Solver_makeDecisionBuilderFromAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment, DecisionBuilder.getCPtr(db), db, vars);
3436 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3437 } finally {
3439 }
3440 }
3441
3447 long cPtr = mainJNI.Solver_makeConstraintAdder(swigCPtr, this, Constraint.getCPtr(ct), ct);
3448 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3449 }
3450
3458 try {
3459 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
3460 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3461 } finally {
3463 }
3464 }
3465
3467 try {
3468 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1);
3469 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3470 } finally {
3472 }
3473 }
3474
3476 try {
3477 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2);
3478 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3479 } finally {
3481 }
3482 }
3483
3485 try {
3486 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2, SearchMonitor.getCPtr(monitor3), monitor3);
3487 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3488 } finally {
3490 }
3491 }
3492
3494 try {
3495 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2, SearchMonitor.getCPtr(monitor3), monitor3, SearchMonitor.getCPtr(monitor4), monitor4);
3496 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3497 } finally {
3499 }
3500 }
3501
3503 try {
3504 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
3505 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3506 } finally {
3508 }
3509 }
3510
3520 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step) {
3521 try {
3522 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step);
3523 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3524 } finally {
3526 }
3527 }
3528
3529 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1) {
3530 try {
3531 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1);
3532 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3533 } finally {
3535 }
3536 }
3537
3538 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2) {
3539 try {
3540 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2);
3541 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3542 } finally {
3544 }
3545 }
3546
3547 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) {
3548 try {
3549 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2, SearchMonitor.getCPtr(monitor3), monitor3);
3550 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3551 } finally {
3553 }
3554 }
3555
3556 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) {
3557 try {
3558 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2, SearchMonitor.getCPtr(monitor3), monitor3, SearchMonitor.getCPtr(monitor4), monitor4);
3559 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3560 } finally {
3562 }
3563 }
3564
3565 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors) {
3566 try {
3567 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, monitors);
3568 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3569 } finally {
3571 }
3572 }
3573
3579 long cPtr = mainJNI.Solver_makeRestoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
3580 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3581 }
3582
3588 long cPtr = mainJNI.Solver_makeStoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
3589 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3590 }
3591
3595 public LocalSearchOperator 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) {
3596 long cPtr = mainJNI.Solver_makeOperator__SWIG_0(swigCPtr, this, vars, op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_incoming_neighbors), SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_outgoing_neighbors));
3597 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3598 }
3599
3603 public LocalSearchOperator makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors) {
3604 long cPtr = mainJNI.Solver_makeOperator__SWIG_1(swigCPtr, this, vars, op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_incoming_neighbors));
3605 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3606 }
3607
3611 public LocalSearchOperator makeOperator(IntVar[] vars, int op) {
3612 long cPtr = mainJNI.Solver_makeOperator__SWIG_2(swigCPtr, this, vars, op);
3613 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3614 }
3615
3616 public LocalSearchOperator 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) {
3617 long cPtr = mainJNI.Solver_makeOperator__SWIG_3(swigCPtr, this, vars, secondary_vars, op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_incoming_neighbors), SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_outgoing_neighbors));
3618 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3619 }
3620
3621 public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors) {
3622 long cPtr = mainJNI.Solver_makeOperator__SWIG_4(swigCPtr, this, vars, secondary_vars, op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t.getCPtr(get_incoming_neighbors));
3623 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3624 }
3625
3626 public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op) {
3627 long cPtr = mainJNI.Solver_makeOperator__SWIG_5(swigCPtr, this, vars, secondary_vars, op);
3628 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3629 }
3630
3632 long cPtr = mainJNI.Solver_makeOperator__SWIG_6(swigCPtr, this, vars, evaluator, op);
3633 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3634 }
3635
3636 public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op) {
3637 long cPtr = mainJNI.Solver_makeOperator__SWIG_7(swigCPtr, this, vars, secondary_vars, evaluator, op);
3638 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3639 }
3640
3650 public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables) {
3651 long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_0(swigCPtr, this, vars, number_of_variables);
3652 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3653 }
3654
3655 public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed) {
3656 long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_1(swigCPtr, this, vars, number_of_variables, seed);
3657 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3658 }
3659
3668 long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_0(swigCPtr, this, Assignment.getCPtr(target), target);
3669 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3670 }
3671
3680 public LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values) {
3681 long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_1(swigCPtr, this, variables, target_values);
3682 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3683 }
3684
3717 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_0(swigCPtr, this, ops);
3718 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3719 }
3720
3722 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_1(swigCPtr, this, ops, restart);
3723 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3724 }
3725
3727 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_2(swigCPtr, this, ops, evaluator);
3728 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3729 }
3730
3736 long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_0(swigCPtr, this, ops);
3737 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3738 }
3739
3746 long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_1(swigCPtr, this, ops, seed);
3747 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3748 }
3749
3759 public LocalSearchOperator MultiArmedBanditConcatenateOperators(LocalSearchOperator[] ops, double memory_coefficient, double exploration_coefficient, boolean maximize) {
3760 long cPtr = mainJNI.Solver_MultiArmedBanditConcatenateOperators(swigCPtr, this, ops, memory_coefficient, exploration_coefficient, maximize);
3761 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3762 }
3763
3772 long cPtr = mainJNI.Solver_makeNeighborhoodLimit(swigCPtr, this, LocalSearchOperator.getCPtr(op), op, limit);
3773 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3774 }
3775
3802 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3803 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3804 }
3805
3807 try {
3808 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_1(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3809 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3810 } finally {
3811 keepAliveDecisionBuilder(first_solution);
3812 }
3813 }
3814
3818 public DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) {
3819 try {
3820 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_2(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, DecisionBuilder.getCPtr(first_solution_sub_decision_builder), first_solution_sub_decision_builder, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3821 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3822 } finally {
3823 keepAliveDecisionBuilder(first_solution);
3824 keepAliveDecisionBuilder(first_solution_sub_decision_builder);
3825 }
3826 }
3827
3829 try {
3830 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_3(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3831 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3832 } finally {
3833 keepAliveDecisionBuilder(first_solution);
3834 }
3835 }
3836
3843 public Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit, SWIGTYPE_p_absl__flat_hash_setT_operations_research__IntVar_p_t touched) {
3844 long cPtr = mainJNI.Solver_RunUncheckedLocalSearch__SWIG_0(swigCPtr, this, Assignment.getCPtr(initial_solution), initial_solution, LocalSearchFilterManager.getCPtr(filter_manager), filter_manager, LocalSearchOperator.getCPtr(ls_operator), ls_operator, monitors, RegularLimit.getCPtr(limit), limit, SWIGTYPE_p_absl__flat_hash_setT_operations_research__IntVar_p_t.getCPtr(touched));
3845 return (cPtr == 0) ? null : new Assignment(cPtr, false);
3846 }
3847
3854 public Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit) {
3855 long cPtr = mainJNI.Solver_RunUncheckedLocalSearch__SWIG_1(swigCPtr, this, Assignment.getCPtr(initial_solution), initial_solution, LocalSearchFilterManager.getCPtr(filter_manager), filter_manager, LocalSearchOperator.getCPtr(ls_operator), ls_operator, monitors, RegularLimit.getCPtr(limit), limit);
3856 return (cPtr == 0) ? null : new Assignment(cPtr, false);
3857 }
3858
3863 long cPtr = mainJNI.Solver_makeDefaultSolutionPool(swigCPtr, this);
3864 return (cPtr == 0) ? null : new SolutionPool(cPtr, false);
3865 }
3866
3871 try {
3872 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_0(swigCPtr, this, IntVar.getCPtr(objective), objective, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder);
3873 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3874 } finally {
3875 keepAliveDecisionBuilder(sub_decision_builder);
3876 }
3877 }
3878
3880 try {
3881 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_1(swigCPtr, this, IntVar.getCPtr(objective), objective, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder, RegularLimit.getCPtr(limit), limit);
3882 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3883 } finally {
3884 keepAliveDecisionBuilder(sub_decision_builder);
3885 }
3886 }
3887
3889 try {
3890 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_2(swigCPtr, this, IntVar.getCPtr(objective), objective, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder, RegularLimit.getCPtr(limit), limit, LocalSearchFilterManager.getCPtr(filter_manager), filter_manager);
3891 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3892 } finally {
3893 keepAliveDecisionBuilder(sub_decision_builder);
3894 }
3895 }
3896
3898 try {
3899 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_3(swigCPtr, this, IntVar.getCPtr(objective), objective, SolutionPool.getCPtr(pool), pool, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder);
3900 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3901 } finally {
3902 keepAliveDecisionBuilder(sub_decision_builder);
3903 }
3904 }
3905
3907 try {
3908 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_4(swigCPtr, this, IntVar.getCPtr(objective), objective, SolutionPool.getCPtr(pool), pool, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder, RegularLimit.getCPtr(limit), limit);
3909 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3910 } finally {
3911 keepAliveDecisionBuilder(sub_decision_builder);
3912 }
3913 }
3914
3916 try {
3917 long cPtr = mainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_5(swigCPtr, this, IntVar.getCPtr(objective), objective, SolutionPool.getCPtr(pool), pool, LocalSearchOperator.getCPtr(ls_operator), ls_operator, DecisionBuilder.getCPtr(sub_decision_builder), sub_decision_builder, RegularLimit.getCPtr(limit), limit, LocalSearchFilterManager.getCPtr(filter_manager), filter_manager);
3918 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3919 } finally {
3920 keepAliveDecisionBuilder(sub_decision_builder);
3921 }
3922 }
3923
3928 long cPtr = mainJNI.Solver_MakeAcceptFilter(swigCPtr, this);
3929 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3930 }
3931
3933 long cPtr = mainJNI.Solver_MakeRejectFilter(swigCPtr, this);
3934 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3935 }
3936
3938 long cPtr = mainJNI.Solver_makeVariableDomainFilter(swigCPtr, this);
3939 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3940 }
3941
3942 public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum) {
3943 long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_0(swigCPtr, this, vars, values, filter_enum);
3944 return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
3945 }
3946
3947 public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum) {
3948 long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_1(swigCPtr, this, vars, secondary_vars, values, filter_enum);
3949 return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
3950 }
3951
3956 public void topPeriodicCheck() {
3957 mainJNI.Solver_topPeriodicCheck(swigCPtr, this);
3958 }
3959
3965 public int topProgressPercent() {
3966 return mainJNI.Solver_topProgressPercent(swigCPtr, this);
3967 }
3968
3974 public void pushState() {
3975 mainJNI.Solver_pushState(swigCPtr, this);
3976 }
3977
3978 public void popState() {
3979 mainJNI.Solver_popState(swigCPtr, this);
3980 }
3981
3986 public int searchDepth() {
3987 return mainJNI.Solver_searchDepth(swigCPtr, this);
3988 }
3989
3994 public int searchLeftDepth() {
3995 return mainJNI.Solver_searchLeftDepth(swigCPtr, this);
3996 }
3997
4002 public int solveDepth() {
4003 return mainJNI.Solver_solveDepth(swigCPtr, this);
4004 }
4005
4009 public long rand64(long size) {
4010 return mainJNI.Solver_rand64(swigCPtr, this, size);
4011 }
4012
4016 public int rand32(int size) {
4017 return mainJNI.Solver_rand32(swigCPtr, this, size);
4018 }
4019
4023 public void reSeed(int seed) {
4024 mainJNI.Solver_reSeed(swigCPtr, this, seed);
4025 }
4026
4032 public void exportProfilingOverview(String filename) {
4033 mainJNI.Solver_exportProfilingOverview(swigCPtr, this, filename);
4034 }
4035
4039 public String localSearchProfile() {
4040 return mainJNI.Solver_localSearchProfile(swigCPtr, this);
4041 }
4042
4048 public boolean currentlyInSolve() {
4049 return mainJNI.Solver_currentlyInSolve(swigCPtr, this);
4050 }
4051
4056 public int constraints() {
4057 return mainJNI.Solver_constraints(swigCPtr, this);
4058 }
4059
4063 public void accept(ModelVisitor visitor) {
4064 mainJNI.Solver_accept(swigCPtr, this, ModelVisitor.getCPtr(visitor), visitor);
4065 }
4066
4068 long cPtr = mainJNI.Solver_balancing_decision(swigCPtr, this);
4069 return (cPtr == 0) ? null : new Decision(cPtr, false);
4070 }
4071
4075 public void clear_fail_intercept() {
4076 mainJNI.Solver_clear_fail_intercept(swigCPtr, this);
4077 }
4078
4083 public void SetUseFastLocalSearch(boolean use_fast_local_search) {
4084 mainJNI.Solver_SetUseFastLocalSearch(swigCPtr, this, use_fast_local_search);
4085 }
4086
4090 public boolean UseFastLocalSearch() {
4091 return mainJNI.Solver_UseFastLocalSearch(swigCPtr, this);
4092 }
4093
4097 public boolean hasName(PropagationBaseObject object) {
4098 return mainJNI.Solver_hasName(swigCPtr, this, PropagationBaseObject.getCPtr(object), object);
4099 }
4100
4104 public Demon registerDemon(Demon demon) {
4105 long cPtr = mainJNI.Solver_registerDemon(swigCPtr, this, Demon.getCPtr(demon), demon);
4106 return (cPtr == 0) ? null : new Demon(cPtr, false);
4107 }
4108
4113 long cPtr = mainJNI.Solver_registerIntExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr);
4114 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
4115 }
4116
4121 long cPtr = mainJNI.Solver_registerIntVar(swigCPtr, this, IntVar.getCPtr(var), var);
4122 return (cPtr == 0) ? null : new IntVar(cPtr, false);
4123 }
4124
4130 long cPtr = mainJNI.Solver_registerIntervalVar(swigCPtr, this, IntervalVar.getCPtr(var), var);
4131 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
4132 }
4133
4138 long cPtr = mainJNI.Solver_cache(swigCPtr, this);
4139 return (cPtr == 0) ? null : new ModelCache(cPtr, false);
4140 }
4141
4145 public boolean instrumentsDemons() {
4146 return mainJNI.Solver_instrumentsDemons(swigCPtr, this);
4147 }
4148
4152 public boolean isProfilingEnabled() {
4153 return mainJNI.Solver_isProfilingEnabled(swigCPtr, this);
4154 }
4155
4160 return mainJNI.Solver_isLocalSearchProfilingEnabled(swigCPtr, this);
4161 }
4162
4166 public boolean instrumentsVariables() {
4167 return mainJNI.Solver_instrumentsVariables(swigCPtr, this);
4168 }
4169
4173 public boolean nameAllVariables() {
4174 return mainJNI.Solver_nameAllVariables(swigCPtr, this);
4175 }
4176
4180 public String model_name() {
4181 return mainJNI.Solver_model_name(swigCPtr, this);
4182 }
4183
4188 long cPtr = mainJNI.Solver_getPropagationMonitor(swigCPtr, this);
4189 return (cPtr == 0) ? null : new PropagationMonitor(cPtr, false);
4190 }
4191
4197 mainJNI.Solver_addPropagationMonitor(swigCPtr, this, PropagationMonitor.getCPtr(monitor), monitor);
4198 }
4199
4204 long cPtr = mainJNI.Solver_getLocalSearchMonitor(swigCPtr, this);
4205 return (cPtr == 0) ? null : new LocalSearchMonitor(cPtr, false);
4206 }
4207
4213 mainJNI.Solver_addLocalSearchMonitor(swigCPtr, this, LocalSearchMonitor.getCPtr(monitor), monitor);
4214 }
4215
4220 long cPtr = mainJNI.Solver_GetOrCreateLocalSearchState(swigCPtr, this);
4221 return (cPtr == 0) ? null : new Assignment(cPtr, false);
4222 }
4223
4228 mainJNI.Solver_ClearLocalSearchState(swigCPtr, this);
4229 }
4230
4237 public void setTmpVector(long[] value) {
4238 mainJNI.Solver_tmpVector_set(swigCPtr, this, value);
4239 }
4240
4247 public long[] getTmpVector() {
4248 return mainJNI.Solver_tmpVector_get(swigCPtr, this);
4249}
4250
4256 long cPtr = mainJNI.Solver_castExpression(swigCPtr, this, IntVar.getCPtr(var), var);
4257 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
4258 }
4259
4263 public void finishCurrentSearch() {
4264 mainJNI.Solver_finishCurrentSearch(swigCPtr, this);
4265 }
4266
4267 public void restartCurrentSearch() {
4268 mainJNI.Solver_restartCurrentSearch(swigCPtr, this);
4269 }
4270
4275 public void shouldFail() {
4276 mainJNI.Solver_shouldFail(swigCPtr, this);
4277 }
4278
4279 public void checkFail() {
4280 mainJNI.Solver_checkFail(swigCPtr, this);
4281 }
4282
4287 try {
4288 long cPtr = mainJNI.Solver_MakeProfiledDecisionBuilderWrapper(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
4289 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
4290 } finally {
4292 }
4293 }
4294
4298 public final static int kNumPriorities = mainJNI.Solver_kNumPriorities_get();
4299 // IntVarStrategy
4304
4308 public final static int INT_VAR_DEFAULT = mainJNI.Solver_INT_VAR_DEFAULT_get();
4312 public final static int INT_VAR_SIMPLE = mainJNI.Solver_INT_VAR_SIMPLE_get();
4318 public final static int CHOOSE_FIRST_UNBOUND = mainJNI.Solver_CHOOSE_FIRST_UNBOUND_get();
4322 public final static int CHOOSE_RANDOM = mainJNI.Solver_CHOOSE_RANDOM_get();
4331 public final static int CHOOSE_MIN_SIZE_LOWEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MIN_get();
4340 public final static int CHOOSE_MIN_SIZE_HIGHEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MIN_get();
4349 public final static int CHOOSE_MIN_SIZE_LOWEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MAX_get();
4358 public final static int CHOOSE_MIN_SIZE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MAX_get();
4365 public final static int CHOOSE_LOWEST_MIN = mainJNI.Solver_CHOOSE_LOWEST_MIN_get();
4372 public final static int CHOOSE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_HIGHEST_MAX_get();
4378 public final static int CHOOSE_MIN_SIZE = mainJNI.Solver_CHOOSE_MIN_SIZE_get();
4384 public final static int CHOOSE_MAX_SIZE = mainJNI.Solver_CHOOSE_MAX_SIZE_get();
4389 public final static int CHOOSE_MAX_REGRET_ON_MIN = mainJNI.Solver_CHOOSE_MAX_REGRET_ON_MIN_get();
4394 public final static int CHOOSE_PATH = mainJNI.Solver_CHOOSE_PATH_get();
4395
4396 // IntValueStrategy
4401
4405 public final static int INT_VALUE_DEFAULT = mainJNI.Solver_INT_VALUE_DEFAULT_get();
4409 public final static int INT_VALUE_SIMPLE = mainJNI.Solver_INT_VALUE_SIMPLE_get();
4413 public final static int ASSIGN_MIN_VALUE = mainJNI.Solver_ASSIGN_MIN_VALUE_get();
4417 public final static int ASSIGN_MAX_VALUE = mainJNI.Solver_ASSIGN_MAX_VALUE_get();
4421 public final static int ASSIGN_RANDOM_VALUE = mainJNI.Solver_ASSIGN_RANDOM_VALUE_get();
4427 public final static int ASSIGN_CENTER_VALUE = mainJNI.Solver_ASSIGN_CENTER_VALUE_get();
4432 public final static int SPLIT_LOWER_HALF = mainJNI.Solver_SPLIT_LOWER_HALF_get();
4437 public final static int SPLIT_UPPER_HALF = mainJNI.Solver_SPLIT_UPPER_HALF_get();
4438
4439 // EvaluatorStrategy
4452
4459 public final static int CHOOSE_STATIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_STATIC_GLOBAL_BEST_get();
4466 public final static int CHOOSE_DYNAMIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_DYNAMIC_GLOBAL_BEST_get();
4467
4468 // SequenceStrategy
4472
4473 public final static int SEQUENCE_DEFAULT = mainJNI.Solver_SEQUENCE_DEFAULT_get();
4474 public final static int SEQUENCE_SIMPLE = mainJNI.Solver_SEQUENCE_SIMPLE_get();
4475 public final static int CHOOSE_MIN_SLACK_RANK_FORWARD = mainJNI.Solver_CHOOSE_MIN_SLACK_RANK_FORWARD_get();
4476 public final static int CHOOSE_RANDOM_RANK_FORWARD = mainJNI.Solver_CHOOSE_RANDOM_RANK_FORWARD_get();
4477
4478 // IntervalStrategy
4483
4487 public final static int INTERVAL_DEFAULT = mainJNI.Solver_INTERVAL_DEFAULT_get();
4491 public final static int INTERVAL_SIMPLE = mainJNI.Solver_INTERVAL_SIMPLE_get();
4496 public final static int INTERVAL_SET_TIMES_FORWARD = mainJNI.Solver_INTERVAL_SET_TIMES_FORWARD_get();
4501 public final static int INTERVAL_SET_TIMES_BACKWARD = mainJNI.Solver_INTERVAL_SET_TIMES_BACKWARD_get();
4502
4503 // LocalSearchOperators
4508
4520 public final static int TWOOPT = mainJNI.Solver_TWOOPT_get();
4537 public final static int OROPT = mainJNI.Solver_OROPT_get();
4541 public final static int RELOCATE = mainJNI.Solver_RELOCATE_get();
4551 public final static int EXCHANGE = mainJNI.Solver_EXCHANGE_get();
4563 public final static int CROSS = mainJNI.Solver_CROSS_get();
4572 public final static int MAKEACTIVE = mainJNI.Solver_MAKEACTIVE_get();
4580 public final static int MAKEINACTIVE = mainJNI.Solver_MAKEINACTIVE_get();
4589 public final static int MAKECHAININACTIVE = mainJNI.Solver_MAKECHAININACTIVE_get();
4597 public final static int SWAPACTIVE = mainJNI.Solver_SWAPACTIVE_get();
4606 public final static int SWAPACTIVECHAIN = mainJNI.Solver_SWAPACTIVECHAIN_get();
4619 public final static int EXTENDEDSWAPACTIVE = mainJNI.Solver_EXTENDEDSWAPACTIVE_get();
4629 public final static int PATHLNS = mainJNI.Solver_PATHLNS_get();
4634 public final static int FULLPATHLNS = mainJNI.Solver_FULLPATHLNS_get();
4640 public final static int UNACTIVELNS = mainJNI.Solver_UNACTIVELNS_get();
4651 public final static int INCREMENT = mainJNI.Solver_INCREMENT_get();
4657 public final static int DECREMENT = mainJNI.Solver_DECREMENT_get();
4667 public final static int SIMPLELNS = mainJNI.Solver_SIMPLELNS_get();
4668
4669 // EvaluatorLocalSearchOperators
4674
4681 public final static int LK = mainJNI.Solver_LK_get();
4690 public final static int TSPOPT = mainJNI.Solver_TSPOPT_get();
4699 public final static int TSPLNS = mainJNI.Solver_TSPLNS_get();
4700
4701 // LocalSearchFilterBound
4708
4712 public final static int GE = mainJNI.Solver_GE_get();
4716 public final static int LE = mainJNI.Solver_LE_get();
4721 public final static int EQ = mainJNI.Solver_EQ_get();
4722
4723 // DemonPriority
4729
4734 public final static int DELAYED_PRIORITY = mainJNI.Solver_DELAYED_PRIORITY_get();
4738 public final static int VAR_PRIORITY = mainJNI.Solver_VAR_PRIORITY_get();
4742 public final static int NORMAL_PRIORITY = mainJNI.Solver_NORMAL_PRIORITY_get();
4743
4744 // BinaryIntervalRelation
4749
4753 public final static int ENDS_AFTER_END = mainJNI.Solver_ENDS_AFTER_END_get();
4757 public final static int ENDS_AFTER_START = mainJNI.Solver_ENDS_AFTER_START_get();
4761 public final static int ENDS_AT_END = mainJNI.Solver_ENDS_AT_END_get();
4765 public final static int ENDS_AT_START = mainJNI.Solver_ENDS_AT_START_get();
4769 public final static int STARTS_AFTER_END = mainJNI.Solver_STARTS_AFTER_END_get();
4773 public final static int STARTS_AFTER_START = mainJNI.Solver_STARTS_AFTER_START_get();
4777 public final static int STARTS_AT_END = mainJNI.Solver_STARTS_AT_END_get();
4781 public final static int STARTS_AT_START = mainJNI.Solver_STARTS_AT_START_get();
4787 public final static int STAYS_IN_SYNC = mainJNI.Solver_STAYS_IN_SYNC_get();
4788
4789 // UnaryIntervalRelation
4794
4798 public final static int ENDS_AFTER = mainJNI.Solver_ENDS_AFTER_get();
4802 public final static int ENDS_AT = mainJNI.Solver_ENDS_AT_get();
4806 public final static int ENDS_BEFORE = mainJNI.Solver_ENDS_BEFORE_get();
4810 public final static int STARTS_AFTER = mainJNI.Solver_STARTS_AFTER_get();
4814 public final static int STARTS_AT = mainJNI.Solver_STARTS_AT_get();
4818 public final static int STARTS_BEFORE = mainJNI.Solver_STARTS_BEFORE_get();
4824 public final static int CROSS_DATE = mainJNI.Solver_CROSS_DATE_get();
4830 public final static int AVOID_DATE = mainJNI.Solver_AVOID_DATE_get();
4831
4832 // DecisionModification
4840
4845 public final static int NO_CHANGE = mainJNI.Solver_NO_CHANGE_get();
4851 public final static int KEEP_LEFT = mainJNI.Solver_KEEP_LEFT_get();
4857 public final static int KEEP_RIGHT = mainJNI.Solver_KEEP_RIGHT_get();
4862 public final static int KILL_BOTH = mainJNI.Solver_KILL_BOTH_get();
4867 public final static int SWITCH_BRANCHES = mainJNI.Solver_SWITCH_BRANCHES_get();
4868
4869 // MarkerType
4874
4875 public final static int SENTINEL = mainJNI.Solver_SENTINEL_get();
4876 public final static int SIMPLE_MARKER = mainJNI.Solver_SIMPLE_MARKER_get();
4877 public final static int CHOICE_POINT = mainJNI.Solver_CHOICE_POINT_get();
4878 public final static int REVERSIBLE_ACTION = mainJNI.Solver_REVERSIBLE_ACTION_get();
4879
4880 // SolverState
4884
4888 public final static int OUTSIDE_SEARCH = mainJNI.Solver_OUTSIDE_SEARCH_get();
4892 public final static int IN_ROOT_NODE = mainJNI.Solver_IN_ROOT_NODE_get();
4896 public final static int IN_SEARCH = mainJNI.Solver_IN_SEARCH_get();
4900 public final static int AT_SOLUTION = mainJNI.Solver_AT_SOLUTION_get();
4904 public final static int NO_MORE_SOLUTIONS = mainJNI.Solver_NO_MORE_SOLUTIONS_get();
4908 public final static int PROBLEM_INFEASIBLE = mainJNI.Solver_PROBLEM_INFEASIBLE_get();
4909
4910 // OptimizationDirection
4914
4915 public final static int NOT_SET = mainJNI.Solver_NOT_SET_get();
4916 public final static int MAXIMIZATION = mainJNI.Solver_MAXIMIZATION_get();
4917 public final static int MINIMIZATION = mainJNI.Solver_MINIMIZATION_get();
4918
4919}
IntegerCastInfo(IntVar v, IntExpr e, Constraint c)
Definition Solver.java:262
Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var)
Definition Solver.java:1038
IntVar makeIsDifferentCstVar(IntExpr var, long value)
Definition Solver.java:1239
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1)
Definition Solver.java:3529
Constraint makeNotBetweenCt(IntExpr expr, long l, long u)
Definition Solver.java:1661
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str)
Definition Solver.java:3397
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2)
Definition Solver.java:2391
void exportProfilingOverview(String filename)
Definition Solver.java:4032
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst)
Definition Solver.java:1551
Constraint makeElementEquality(int[] vals, IntVar index, IntVar target)
Definition Solver.java:1586
ImprovementSearchLimit MakeImprovementLimit(IntVar objective_var, boolean maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance)
Definition Solver.java:2947
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition Solver.java:3547
SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize)
Definition Solver.java:2628
Decision makeScheduleOrPostpone(IntervalVar var, long est, SWIGTYPE_p_long marker)
Definition Solver.java:3355
Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size)
Definition Solver.java:1789
LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values)
Definition Solver.java:3680
Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max)
Definition Solver.java:1799
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name)
Definition Solver.java:2458
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name)
Definition Solver.java:2474
void newSearch(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:492
IntExpr makeMax(IntExpr left, IntExpr right)
Definition Solver.java:1086
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states)
Definition Solver.java:2135
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:465
static final int INT_VALUE_DEFAULT
IntValueStrategy.
Definition Solver.java:4405
Constraint makeIntervalVarRelationWithDelay(IntervalVar t1, int r, IntervalVar t2, long delay)
Definition Solver.java:2372
LocalSearchOperator makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors)
Definition Solver.java:3603
IntExpr makeProd(IntExpr left, IntExpr right)
Definition Solver.java:918
Constraint makeIntervalVarRelation(IntervalVar t1, int r, IntervalVar t2)
Definition Solver.java:2361
static final int SEQUENCE_DEFAULT
SequenceStrategy.
Definition Solver.java:4473
IntVar makeIsEqualCstVar(IntExpr var, long value)
Definition Solver.java:1183
LocalSearchOperator 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)
Definition Solver.java:3616
void SetGuidedLocalSearchPenaltyCallback(LongTernaryOperator penalty_callback)
Definition Solver.java:763
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional, String name)
Definition Solver.java:180
Constraint makeNotMemberCt(IntExpr expr, int[] values)
Definition Solver.java:1701
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str)
Definition Solver.java:3281
IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2285
SolutionCollector makeFirstSolutionCollector(Assignment assignment)
Definition Solver.java:2546
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2733
DisjunctiveConstraint makeStrictDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition Solver.java:2410
Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half)
Definition Solver.java:3121
IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value)
Definition Solver.java:1146
Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst)
Definition Solver.java:1561
Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b)
Definition Solver.java:1669
SearchMonitor makeSymmetryManager(SymmetryBreaker[] visitors)
Definition Solver.java:3078
SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize)
Definition Solver.java:2583
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters)
Definition Solver.java:3818
Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum)
Definition Solver.java:1840
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition Solver.java:3181
DecisionBuilder makePhase(IntVar v0, int var_str, int val_str)
Definition Solver.java:3328
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2)
Definition Solver.java:3171
Constraint makeAbsEquality(IntVar var, IntVar abs_var)
Definition Solver.java:1604
SolutionCollector makeBestValueSolutionCollector(boolean maximize)
Definition Solver.java:2604
Decision makeVariableGreaterOrEqualValue(IntVar var, long value)
Definition Solver.java:3116
Constraint makeMemberCt(IntExpr expr, long[] values)
Definition Solver.java:1683
SearchMonitor makeSearchTrace(String prefix)
Definition Solver.java:3036
DecisionBuilder makePhase(SequenceVar[] sequences, int str)
Definition Solver.java:3424
IntervalVar makeIntervalRelaxedMax(IntervalVar interval_var)
Definition Solver.java:2344
IntVar makeIsLessOrEqualCstVar(IntExpr var, long value)
Definition Solver.java:1295
Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar)
Definition Solver.java:1725
SolutionCollector makeLastSolutionCollector()
Definition Solver.java:2572
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors)
Definition Solver.java:3565
SWIGTYPE_p_operations_research__ConstraintSolverParameters const_parameters()
Definition Solver.java:322
IntervalVar makeFixedInterval(long start, long duration, String name)
Definition Solver.java:2234
Constraint makeLexicalLess(IntVar[] left, IntVar[] right)
Definition Solver.java:1899
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum)
Definition Solver.java:3942
Constraint makeSumLessOrEqual(IntVar[] vars, long cst)
Definition Solver.java:1511
Decision makeAssignVariablesValues(IntVar[] vars, long[] values)
Definition Solver.java:3136
Constraint 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)
Definition Solver.java:2160
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops, int seed)
Definition Solver.java:3745
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2)
Definition Solver.java:3475
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name)
Definition Solver.java:2226
Decision MakeAssignVariablesValuesOrDoNothing(IntVar[] vars, long[] values)
Definition Solver.java:3141
Constraint makeSumEquality(IntVar[] vars, IntVar var)
Definition Solver.java:1526
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step)
Definition Solver.java:3520
Constraint makeIsGreaterOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1367
void newSearch(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:508
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:595
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2701
Constraint makeSubCircuit(IntVar[] nexts)
Definition Solver.java:2030
Constraint makeMinEquality(IntVar[] vars, IntVar min_var)
Definition Solver.java:1571
IntVar makeIntVar(long[] values, String name)
Definition Solver.java:782
static final int TWOOPT
LocalSearchOperators.
Definition Solver.java:4520
Constraint makeIsLessCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1479
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3, SymmetryBreaker v4)
Definition Solver.java:3098
Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition Solver.java:2175
IntExpr makeElement(int[] values, IntVar index)
Definition Solver.java:982
Decision MakeAssignVariablesValuesOrFail(IntVar[] vars, long[] values)
Definition Solver.java:3146
IntExpr makeModulo(IntExpr x, long mod)
Definition Solver.java:1130
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition Solver.java:3906
IntervalVar makeIntervalVar(long start_min, long start_max, long duration_min, long duration_max, long end_min, long end_max, boolean optional, String name)
Definition Solver.java:2243
Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends)
Definition Solver.java:1717
Constraint makeIsLessOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1311
Constraint makeCount(IntVar[] vars, long value, IntVar max_count)
Definition Solver.java:1756
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:587
LocalSearchOperator makeMoveTowardTargetOperator(Assignment target)
Definition Solver.java:3667
SearchLimit makeLimit(SearchLimit limit_1, SearchLimit limit_2)
Definition Solver.java:2936
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target)
Definition Solver.java:1546
DecisionBuilder makeSolveOnce(DecisionBuilder db)
Definition Solver.java:3457
SolutionCollector MakeNBestLexicographicValueSolutionCollector(Assignment assignment, int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2637
RegularLimit makeBranchesLimit(long branches)
Definition Solver.java:2842
void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr)
Definition Solver.java:386
Solver(long cPtr, boolean cMemoryOwn)
Definition Solver.java:80
SolutionCollector MakeBestLexicographicValueSolutionCollector(SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2613
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, IntIntToLongFunction evaluator)
Definition Solver.java:3726
Constraint makeIsLessCstCt(IntExpr v, long c, IntVar b)
Definition Solver.java:1455
IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2)
Definition Solver.java:1013
IntVar makeIsMemberVar(IntExpr expr, long[] values)
Definition Solver.java:1735
Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1287
SearchLimit makeCustomLimit(BooleanSupplier limiter)
Definition Solver.java:2965
Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars)
Definition Solver.java:1964
SearchMonitor makeSearchLog(int branch_period)
Definition Solver.java:2974
IntExpr makeElement(long[] values, IntVar index)
Definition Solver.java:974
ObjectiveMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure)
Definition Solver.java:2779
IntVar makeIsDifferentCstVar(IntExpr v1, IntExpr v2)
Definition Solver.java:1247
Constraint makeCount(IntVar[] vars, long value, long max_count)
Definition Solver.java:1748
Constraint makeMemberCt(IntExpr expr, int[] values)
Definition Solver.java:1688
Constraint 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)
Definition Solver.java:2155
Assignment makeAssignment(Assignment a)
Definition Solver.java:2538
Constraint makeLessOrEqual(IntExpr expr, int value)
Definition Solver.java:1335
IntExpr makeMin(IntExpr expr, int value)
Definition Solver.java:1070
static long swigRelease(Solver obj)
Definition Solver.java:89
Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst)
Definition Solver.java:1516
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst)
Definition Solver.java:1536
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables)
Definition Solver.java:3650
Constraint makeCircuit(IntVar[] nexts)
Definition Solver.java:2021
RegularLimit makeLimit(long time, long branches, long failures, long solutions)
Definition Solver.java:2910
Constraint makeGreaterOrEqual(IntExpr left, IntExpr right)
Definition Solver.java:1375
Constraint makeLess(IntExpr expr, int value)
Definition Solver.java:1503
Constraint makeCover(IntervalVar[] vars, IntervalVar target_var)
Definition Solver.java:2514
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst)
Definition Solver.java:1531
Constraint makeSortingConstraint(IntVar[] vars, IntVar[] sorted)
Definition Solver.java:1890
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2709
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3)
Definition Solver.java:3093
IntExpr makeElement(IntVar[] vars, IntVar index)
Definition Solver.java:1021
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator)
Definition Solver.java:3286
static final int INT_VAR_DEFAULT
IntVarStrategy.
Definition Solver.java:4308
IntExpr makeProd(IntExpr expr, long value)
Definition Solver.java:926
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed)
Definition Solver.java:3655
IntExpr makeDiv(IntExpr numerator, IntExpr denominator)
Definition Solver.java:942
Constraint makeEquality(IntervalVar var1, IntervalVar var2)
Definition Solver.java:2522
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2)
Definition Solver.java:3088
Constraint makeIndexOfFirstMinValueConstraint(IntVar index, IntVar[] vars)
Definition Solver.java:1953
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum)
Definition Solver.java:3947
IntVar[] makeBoolVarArray(int count, String name)
Definition Solver.java:155
IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost)
Definition Solver.java:1110
IntervalVar makeIntervalRelaxedMin(IntervalVar interval_var)
Definition Solver.java:2320
RegularLimit makeTimeLimit(SWIGTYPE_p_absl__Duration time)
Definition Solver.java:2828
LocalSearchOperator MultiArmedBanditConcatenateOperators(LocalSearchOperator[] ops, double memory_coefficient, double exploration_coefficient, boolean maximize)
Definition Solver.java:3759
IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2263
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst)
Definition Solver.java:1556
Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value)
Definition Solver.java:1976
RegularLimit makeLimit(com.google.ortools.constraintsolver.RegularLimitParameters proto)
Definition Solver.java:2895
boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:563
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name)
Definition Solver.java:2217
SearchMonitor makeLubyRestart(int scale_factor)
Definition Solver.java:2811
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2717
ObjectiveMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature)
Definition Solver.java:2787
SearchMonitor makeAtSolutionCallback(Runnable callback)
Definition Solver.java:3054
static final int DELAYED_PRIORITY
DemonPriority.
Definition Solver.java:4734
RegularLimit makeSolutionsLimit(long solutions)
Definition Solver.java:2860
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op)
Definition Solver.java:3636
Constraint makeLess(IntExpr expr, long value)
Definition Solver.java:1495
Constraint makeIndexOfFirstMaxValueConstraint(IntVar index, IntVar[] vars)
Definition Solver.java:1944
SearchMonitor makeSearchLog(int branch_period, IntVar[] vars, Supplier< String > display_callback)
Definition Solver.java:3009
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative)
Definition Solver.java:2869
Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status)
Definition Solver.java:2086
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check)
Definition Solver.java:2905
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name)
Definition Solver.java:2426
IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2296
IntVar makeIsLessVar(IntExpr left, IntExpr right)
Definition Solver.java:1471
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager)
Definition Solver.java:3888
Constraint MakeIsLexicalLessOrEqualWithOffsetsCt(IntVar[] left, IntVar[] right, long[] offsets, IntVar boolvar)
Definition Solver.java:1924
IntExpr makeMin(IntExpr expr, long value)
Definition Solver.java:1062
Constraint makeGreaterOrEqual(IntExpr expr, int value)
Definition Solver.java:1391
static final int ENDS_AFTER_END
BinaryIntervalRelation.
Definition Solver.java:4753
Pack makePack(IntVar[] vars, int number_of_bins)
Definition Solver.java:2197
Constraint 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)
Definition Solver.java:2185
IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step)
Definition Solver.java:1119
OptimizeVar makeMinimize(IntVar v, long step)
Definition Solver.java:2667
IntervalVar registerIntervalVar(IntervalVar var)
Definition Solver.java:4129
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition Solver.java:3484
Decision MakeAssignVariableValueOrDoNothing(IntVar var, long value)
Definition Solver.java:3131
IntVar makeIntVar(long min, long max, String name)
Definition Solver.java:774
SearchMonitor makeExitSearchCallback(Runnable callback)
Definition Solver.java:3049
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str)
Definition Solver.java:3338
static final int NO_CHANGE
DecisionModification.
Definition Solver.java:4845
IntVar makeIsGreaterOrEqualCstVar(IntExpr var, long value)
Definition Solver.java:1351
boolean checkAssignment(Assignment solution)
Definition Solver.java:606
LocalSearchOperator 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)
Definition Solver.java:3595
RegularLimit makeTimeLimit(long time_in_ms)
Definition Solver.java:2833
Constraint makeBetweenCt(IntExpr expr, long l, long u)
Definition Solver.java:1650
DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str)
Definition Solver.java:3333
IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2274
DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str)
Definition Solver.java:3276
SolutionCollector makeFirstSolutionCollector()
Definition Solver.java:2555
void accept(ModelVisitor visitor)
Definition Solver.java:4063
Constraint makeInversePermutationConstraint(IntVar[] left, IntVar[] right)
Definition Solver.java:1935
Demon makeDelayedConstraintInitialPropagateCallback(Constraint ct)
Definition Solver.java:1634
boolean checkConstraint(Constraint ct)
Definition Solver.java:615
Constraint makeGreater(IntExpr expr, int value)
Definition Solver.java:1447
Decision makeRankLastInterval(SequenceVar sequence, int index)
Definition Solver.java:3385
void addLocalSearchMonitor(LocalSearchMonitor monitor)
Definition Solver.java:4212
Constraint makeNonEquality(IntExpr expr, int value)
Definition Solver.java:1279
Constraint makeIsGreaterCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1423
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions)
Definition Solver.java:2887
IntVar makeIsLessOrEqualVar(IntExpr left, IntExpr right)
Definition Solver.java:1303
boolean solveAndCommit(DecisionBuilder db)
Definition Solver.java:571
Constraint makeIntervalVarRelation(IntervalVar t, int r, long d)
Definition Solver.java:2353
Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max)
Definition Solver.java:1809
void addPropagationMonitor(PropagationMonitor monitor)
Definition Solver.java:4196
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str)
Definition Solver.java:3411
Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards)
Definition Solver.java:1772
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check)
Definition Solver.java:2878
Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards)
Definition Solver.java:1764
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager)
Definition Solver.java:3915
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition Solver.java:3870
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition Solver.java:3493
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition Solver.java:473
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2)
Definition Solver.java:3538
static final int INTERVAL_DEFAULT
IntervalStrategy.
Definition Solver.java:4487
IntExpr makePower(IntExpr expr, long n)
Definition Solver.java:966
Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1175
IntVar makeIsLessCstVar(IntExpr var, long value)
Definition Solver.java:1463
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition Solver.java:3806
SearchMonitor makeEnterSearchCallback(Runnable callback)
Definition Solver.java:3044
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, boolean restart)
Definition Solver.java:3721
IntVar makeIsEqualVar(IntExpr v1, IntExpr v2)
Definition Solver.java:1199
RegularLimit makeFailuresLimit(long failures)
Definition Solver.java:2851
Constraint makeGreater(IntExpr expr, long value)
Definition Solver.java:1439
IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name)
Definition Solver.java:2208
SolutionCollector makeAllSolutionCollector(Assignment assignment)
Definition Solver.java:2650
Constraint makeEquality(IntExpr expr, int value)
Definition Solver.java:1223
ObjectiveMonitor makeTabuSearch(boolean maximize, IntVar objective, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor)
Definition Solver.java:2765
Constraint makeLess(IntExpr left, IntExpr right)
Definition Solver.java:1487
IntVar makeIsGreaterOrEqualVar(IntExpr left, IntExpr right)
Definition Solver.java:1359
SolutionCollector MakeNBestLexicographicValueSolutionCollector(int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2642
static final int LK
EvaluatorLocalSearchOperators.
Definition Solver.java:4681
void newSearch(DecisionBuilder db)
Definition Solver.java:500
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition Solver.java:3192
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name)
Definition Solver.java:2442
Constraint makeIsDifferentCstCt(IntExpr v1, IntExpr v2, IntVar b)
Definition Solver.java:1255
Constraint makeGreaterOrEqual(IntExpr expr, long value)
Definition Solver.java:1383
Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1231
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition Solver.java:2041
Constraint makeEquality(IntExpr left, IntExpr right)
Definition Solver.java:1207
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator)
Definition Solver.java:3295
Constraint makeMapDomain(IntVar var, IntVar[] actives)
Definition Solver.java:2096
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops)
Definition Solver.java:3716
static final int SENTINEL
MarkerType.
Definition Solver.java:4875
IntExpr makeDifference(IntExpr left, IntExpr right)
Definition Solver.java:894
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:3502
DecisionBuilder compose(DecisionBuilder[] dbs)
Definition Solver.java:3204
OptimizeVar MakeLexicographicOptimize(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] variables, long[] steps)
Definition Solver.java:2742
SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier< String > display_callback)
Definition Solver.java:3000
Constraint makeElementEquality(IntVar[] vars, IntVar index, long target)
Definition Solver.java:1596
IntExpr makeMax(IntExpr expr, long value)
Definition Solver.java:1094
Constraint makeLessOrEqual(IntExpr left, IntExpr right)
Definition Solver.java:1319
Constraint makeAllDifferent(IntVar[] vars)
Definition Solver.java:1849
IntExpr makeDiv(IntExpr expr, long value)
Definition Solver.java:934
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition Solver.java:532
Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar)
Definition Solver.java:1730
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths)
Definition Solver.java:2013
Decision makeRankFirstInterval(SequenceVar sequence, int index)
Definition Solver.java:3376
Constraint makeFalseConstraint(String explanation)
Definition Solver.java:1167
IntExpr makeSum(IntExpr left, IntExpr right)
Definition Solver.java:854
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1)
Definition Solver.java:3466
IntExpr makeMax(IntExpr expr, int value)
Definition Solver.java:1102
Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation)
Definition Solver.java:1859
IntExpr makeSum(IntExpr expr, long value)
Definition Solver.java:862
DecisionBuilder makePhase(IntervalVar[] intervals, int str)
Definition Solver.java:3419
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition Solver.java:3240
Decision makeScheduleOrExpedite(IntervalVar var, long est, SWIGTYPE_p_long marker)
Definition Solver.java:3367
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name)
Definition Solver.java:2488
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition Solver.java:3305
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:579
ImprovementSearchLimit 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)
Definition Solver.java:2956
boolean solve(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:433
static com.google.ortools.constraintsolver.ConstraintSolverParameters defaultSolverParameters()
Definition Solver.java:329
DecisionBuilder makeLocalSearchPhase(SequenceVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition Solver.java:3828
SearchMonitor makeSearchLog(int branch_period, IntVar var)
Definition Solver.java:2982
Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends)
Definition Solver.java:1709
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator)
Definition Solver.java:3300
Constraint makeIsEqualVar(IntExpr v1, IntExpr v2, IntVar b)
Definition Solver.java:1191
boolean solve(DecisionBuilder db)
Definition Solver.java:441
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator)
Definition Solver.java:2063
boolean solve(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:449
void SetUseFastLocalSearch(boolean use_fast_local_search)
Definition Solver.java:4083
static final int CHOOSE_STATIC_GLOBAL_BEST
EvaluatorStrategy.
Definition Solver.java:4459
Constraint makeLexicalLessOrEqual(IntVar[] left, IntVar[] right)
Definition Solver.java:1908
Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value)
Definition Solver.java:1868
DecisionBuilder tryDecisions(DecisionBuilder[] dbs)
Definition Solver.java:3263
DecisionBuilder makeDefaultPhase(IntVar[] vars, DefaultPhaseParameters parameters)
Definition Solver.java:3320
IntExpr makeMin(IntExpr left, IntExpr right)
Definition Solver.java:1054
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition Solver.java:3879
SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize)
Definition Solver.java:2623
com.google.ortools.constraintsolver.RegularLimitParameters makeDefaultRegularLimitParameters()
Definition Solver.java:2918
OptimizeVar makeMaximize(IntVar v, long step)
Definition Solver.java:2675
Constraint makeLessOrEqual(IntExpr expr, long value)
Definition Solver.java:1327
DecisionBuilder makeConstraintAdder(Constraint ct)
Definition Solver.java:3446
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler)
Definition Solver.java:1992
Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit)
Definition Solver.java:3854
Constraint makeNonEquality(IntExpr left, IntExpr right)
Definition Solver.java:1263
BaseObjectiveMonitor MakeRoundRobinCompoundObjectiveMonitor(SWIGTYPE_p_std__vectorT_operations_research__BaseObjectiveMonitor_p_t monitors, int num_max_local_optima_before_metaheuristic_switch)
Definition Solver.java:2801
boolean hasName(PropagationBaseObject object)
Definition Solver.java:4097
IntVar makeIntVar(int[] values, String name)
Definition Solver.java:790
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator)
Definition Solver.java:2076
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var)
Definition Solver.java:3018
Constraint makeElementEquality(long[] vals, IntVar index, IntVar target)
Definition Solver.java:1581
Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max)
Definition Solver.java:1819
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:516
Constraint makeDistribute(IntVar[] vars, IntVar[] cards)
Definition Solver.java:1780
IntExpr makeDifference(long value, IntExpr expr)
Definition Solver.java:902
Solver(String name, com.google.ortools.constraintsolver.ConstraintSolverParameters parameters)
Definition Solver.java:302
DecisionBuilder makeLocalSearchPhase(Assignment assignment, LocalSearchPhaseParameters parameters)
Definition Solver.java:3801
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target)
Definition Solver.java:1541
IntVar makeIntVar(long min, long max)
Definition Solver.java:798
SearchMonitor makeSymmetryManager(SymmetryBreaker v1)
Definition Solver.java:3083
SearchMonitor makeConstantRestart(int frequency)
Definition Solver.java:2820
IntExpr makeElement(LongUnaryOperator values, IntVar index)
Definition Solver.java:992
LocalSearchOperator makeOperator(IntVar[] vars, LongTernaryOperator evaluator, int op)
Definition Solver.java:3631
IntExpr makeModulo(IntExpr x, IntExpr mod)
Definition Solver.java:1138
static final int NOT_SET
OptimizationDirection.
Definition Solver.java:4915
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops)
Definition Solver.java:3735
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition Solver.java:3897
Constraint makeAllowedAssignment(IntVar[] vars, IntTupleSet tuples)
Definition Solver.java:2107
Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target)
Definition Solver.java:1615
Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit, SWIGTYPE_p_absl__flat_hash_setT_operations_research__IntVar_p_t touched)
Definition Solver.java:3843
Constraint makeGreater(IntExpr left, IntExpr right)
Definition Solver.java:1431
Constraint 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)
Definition Solver.java:2180
Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1343
void set_optimization_direction(int direction)
Definition Solver.java:759
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str)
Definition Solver.java:3343
LocalSearchOperator makeOperator(IntVar[] vars, int op)
Definition Solver.java:3611
IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index)
Definition Solver.java:1005
static final int GE
LocalSearchFilterBound.
Definition Solver.java:4712
Decision makeAssignVariableValueOrFail(IntVar var, long value)
Definition Solver.java:3126
Constraint makeMaxEquality(IntVar[] vars, IntVar max_var)
Definition Solver.java:1576
Constraint makeSumEquality(IntVar[] vars, long cst)
Definition Solver.java:1521
Constraint makeNotMemberCt(IntExpr expr, long[] values)
Definition Solver.java:1696
Decision makeAssignVariableValue(IntVar var, long val)
Definition Solver.java:3106
void keepAliveDecisionBuilder(DecisionBuilder db)
Definition Solver.java:200
Constraint MakeLexicalLessOrEqualWithOffsets(IntVar[] left, IntVar[] right, long[] offsets)
Definition Solver.java:1919
DecisionBuilder makeDefaultPhase(IntVar[] vars)
Definition Solver.java:3315
Constraint makeEquality(IntExpr expr, long value)
Definition Solver.java:1215
static final int OUTSIDE_SEARCH
SolverState.
Definition Solver.java:4888
LocalSearchOperator makeNeighborhoodLimit(LocalSearchOperator op, long limit)
Definition Solver.java:3771
Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition Solver.java:2050
long GetGuidedLocalSearchPenalty(long i, long j, long k)
Definition Solver.java:767
Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst)
Definition Solver.java:1566
IntVar[] makeIntVarArray(int count, long min, long max, String name)
Definition Solver.java:138
SolutionCollector MakeBestLexicographicValueSolutionCollector(Assignment assignment, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2592
ObjectiveMonitor MakeLexicographicTabuSearch(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] objectives, long[] steps, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor)
Definition Solver.java:2770
SolutionCollector makeLastSolutionCollector(Assignment assignment)
Definition Solver.java:2563
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name)
Definition Solver.java:2502
ObjectiveMonitor MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps, long[] initial_temperatures)
Definition Solver.java:2792
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition Solver.java:3556
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors)
Definition Solver.java:3621
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2)
Definition Solver.java:3230
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition Solver.java:3251
DecisionBuilder makeRestoreAssignment(Assignment assignment)
Definition Solver.java:3578
Demon makeConstraintInitialPropagateCallback(Constraint ct)
Definition Solver.java:1624
Decision makeDecision(Consumer< Solver > apply, Consumer< Solver > refute)
Definition Solver.java:3156
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op)
Definition Solver.java:3626
com.google.ortools.constraintsolver.ConstraintSolverParameters parameters()
Definition Solver.java:309
DisjunctiveConstraint makeDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition Solver.java:2400
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2, IntVar alt)
Definition Solver.java:2382
Decision makeVariableLessOrEqualValue(IntVar var, long value)
Definition Solver.java:3111
IntVar[] makeIntVarArray(int count, long min, long max)
Definition Solver.java:130
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition Solver.java:3310
IntVar makeIsBetweenVar(IntExpr v, long l, long u)
Definition Solver.java:1674
IntExpr makeScalProd(IntVar[] vars, int[] coefs)
Definition Solver.java:886
IntVar makeIntConst(long val, String name)
Definition Solver.java:838
Demon makeClosureDemon(Runnable closure)
Definition Solver.java:1642
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2692
Constraint makeNonEquality(IntExpr expr, long value)
Definition Solver.java:1271
IntVar makeIsGreaterVar(IntExpr left, IntExpr right)
Definition Solver.java:1415
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states)
Definition Solver.java:2121
SearchMonitor makeSearchLog(int branch_period, Supplier< String > display_callback)
Definition Solver.java:2991
Constraint makeIsGreaterCstCt(IntExpr v, long c, IntVar b)
Definition Solver.java:1399
static final int ENDS_AFTER
UnaryIntervalRelation.
Definition Solver.java:4798
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional)
Definition Solver.java:164
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2725
Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target)
Definition Solver.java:1591
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:457
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier< String > display_callback)
Definition Solver.java:3027
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative)
Definition Solver.java:2900
Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max)
Definition Solver.java:1829
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:524
DecisionBuilder makeStoreAssignment(Assignment assignment)
Definition Solver.java:3587
IntVar makeIsGreaterCstVar(IntExpr var, long value)
Definition Solver.java:1407
void keepAliveDecisionBuilder(DecisionBuilder[] dbs)
Definition Solver.java:206
IntVar makeIsMemberVar(IntExpr expr, int[] values)
Definition Solver.java:1740
IntExpr makeIndexExpression(IntVar[] vars, long value)
Definition Solver.java:1030
IntExpr makeScalProd(IntVar[] vars, long[] coefs)
Definition Solver.java:878
Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition Solver.java:2150
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active)
Definition Solver.java:2008
DecisionBuilder MakeProfiledDecisionBuilderWrapper(DecisionBuilder db)
Definition Solver.java:4286
IntervalVar makeMirrorInterval(IntervalVar interval_var)
Definition Solver.java:2252
DecisionBuilder makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars)
Definition Solver.java:3433
OptimizeVar makeOptimize(boolean maximize, IntVar v, long step)
Definition Solver.java:2683