Google OR-Tools v9.15
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.4.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
75public class Solver {
76 private transient long swigCPtr;
77 protected transient boolean swigCMemOwn;
78
79 public Solver(long cPtr, boolean cMemoryOwn) {
80 swigCMemOwn = cMemoryOwn;
81 swigCPtr = cPtr;
82 }
83
84 public static long getCPtr(Solver obj) {
85 return (obj == null) ? 0 : obj.swigCPtr;
86 }
87
88 public static long swigRelease(Solver obj) {
89 long ptr = 0;
90 if (obj != null) {
91 if (!obj.swigCMemOwn)
92 throw new RuntimeException("Cannot release ownership as memory is not owned");
93 ptr = obj.swigCPtr;
94 obj.swigCMemOwn = false;
95 obj.delete();
96 }
97 return ptr;
98 }
99
100 @SuppressWarnings({"deprecation", "removal"})
101 protected void finalize() {
102 delete();
103 }
104
105 public synchronized void delete() {
106 if (swigCPtr != 0) {
107 if (swigCMemOwn) {
108 swigCMemOwn = false;
109 mainJNI.delete_Solver(swigCPtr);
110 }
111 swigCPtr = 0;
112 }
113 }
114
118 public static class FailException extends Exception {
119 public FailException() {
120 super();
121 }
122
123 public FailException(String message) {
124 super(message);
125 }
126 }
127
128 public IntVar[] makeIntVarArray(int count, long min, long max) {
129 IntVar[] array = new IntVar[count];
130 for (int i = 0; i < count; ++i) {
131 array[i] = makeIntVar(min, max);
132 }
133 return array;
134 }
135
136 public IntVar[] makeIntVarArray(int count, long min, long max, String name) {
137 IntVar[] array = new IntVar[count];
138 for (int i = 0; i < count; ++i) {
139 String var_name = name + i;
140 array[i] = makeIntVar(min, max, var_name);
141 }
142 return array;
143 }
144
145 public IntVar[] makeBoolVarArray(int count) {
146 IntVar[] array = new IntVar[count];
147 for (int i = 0; i < count; ++i) {
148 array[i] = makeBoolVar();
149 }
150 return array;
151 }
152
153 public IntVar[] makeBoolVarArray(int count, String name) {
154 IntVar[] array = new IntVar[count];
155 for (int i = 0; i < count; ++i) {
156 String var_name = name + i;
157 array[i] = makeBoolVar(var_name);
158 }
159 return array;
160 }
161
163 long start_min,
164 long start_max,
165 long duration,
166 boolean optional) {
167 IntervalVar[] array = new IntervalVar[count];
168 for (int i = 0; i < count; ++i) {
169 array[i] = makeFixedDurationIntervalVar(start_min,
170 start_max,
171 duration,
172 optional,
173 "");
174 }
175 return array;
176 }
177
179 long start_min,
180 long start_max,
181 long duration,
182 boolean optional,
183 String name) {
184 IntervalVar[] array = new IntervalVar[count];
185 for (int i = 0; i < count; ++i) {
186 array[i] = makeFixedDurationIntervalVar(start_min,
187 start_max,
188 duration,
189 optional,
190 name + i);
191 }
192 return array;
193 }
194
195 // Ensure that the GC doesn't collect any DecisionBuilder set from Java
196 // as the underlying C++ class stores a shallow copy
197 private HashSet<DecisionBuilder> keepAliveDecisionBuilders;
199 if (keepAliveDecisionBuilders == null) {
200 keepAliveDecisionBuilders = new HashSet<DecisionBuilder>();
201 }
202 keepAliveDecisionBuilders.add(db);
203 }
205 for (DecisionBuilder db : dbs) {
207 }
208 }
209
216 static public class IntegerCastInfo {
217 private transient long swigCPtr;
218 protected transient boolean swigCMemOwn;
219
220 public IntegerCastInfo(long cPtr, boolean cMemoryOwn) {
221 swigCMemOwn = cMemoryOwn;
222 swigCPtr = cPtr;
223 }
224
225 public static long getCPtr(IntegerCastInfo obj) {
226 return (obj == null) ? 0 : obj.swigCPtr;
227 }
228
229 public static long swigRelease(IntegerCastInfo obj) {
230 long ptr = 0;
231 if (obj != null) {
232 if (!obj.swigCMemOwn)
233 throw new RuntimeException("Cannot release ownership as memory is not owned");
234 ptr = obj.swigCPtr;
235 obj.swigCMemOwn = false;
236 obj.delete();
237 }
238 return ptr;
239 }
240
241 @SuppressWarnings({"deprecation", "removal"})
242 protected void finalize() {
243 delete();
244 }
245
246 public synchronized void delete() {
247 if (swigCPtr != 0) {
248 if (swigCMemOwn) {
249 swigCMemOwn = false;
250 mainJNI.delete_Solver_IntegerCastInfo(swigCPtr);
251 }
252 swigCPtr = 0;
253 }
254 }
255
257 this(mainJNI.new_Solver_IntegerCastInfo__SWIG_0(), true);
258 }
259
261 this(mainJNI.new_Solver_IntegerCastInfo__SWIG_1(IntVar.getCPtr(v), v, IntExpr.getCPtr(e), e, Constraint.getCPtr(c), c), true);
262 }
263
264 public void setVariable(IntVar value) {
265 mainJNI.Solver_IntegerCastInfo_variable_set(swigCPtr, this, IntVar.getCPtr(value), value);
266 }
267
269 long cPtr = mainJNI.Solver_IntegerCastInfo_variable_get(swigCPtr, this);
270 return (cPtr == 0) ? null : new IntVar(cPtr, false);
271 }
272
273 public void setExpression(IntExpr value) {
274 mainJNI.Solver_IntegerCastInfo_expression_set(swigCPtr, this, IntExpr.getCPtr(value), value);
275 }
276
278 long cPtr = mainJNI.Solver_IntegerCastInfo_expression_get(swigCPtr, this);
279 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
280 }
281
282 public void setMaintainer(Constraint value) {
283 mainJNI.Solver_IntegerCastInfo_maintainer_set(swigCPtr, this, Constraint.getCPtr(value), value);
284 }
285
287 long cPtr = mainJNI.Solver_IntegerCastInfo_maintainer_get(swigCPtr, this);
288 return (cPtr == 0) ? null : new Constraint(cPtr, false);
289 }
290
291 }
292
296 public Solver(String name) {
297 this(mainJNI.new_Solver__SWIG_0(name), true);
298 }
299
300 public Solver(String name, com.google.ortools.constraintsolver.ConstraintSolverParameters parameters) {
301 this(mainJNI.new_Solver__SWIG_1(name, parameters.toByteArray()), true);
302 }
303
308 byte[] buf = mainJNI.Solver_parameters(swigCPtr, this);
309 if (buf == null || buf.length == 0) {
310 return null;
311 }
312 try {
313 return com.google.ortools.constraintsolver.ConstraintSolverParameters.parseFrom(buf);
314 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
315 throw new RuntimeException(
316 "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
317 }
318}
319
320 public SWIGTYPE_p_operations_research__ConstraintSolverParameters const_parameters() {
321 return new SWIGTYPE_p_operations_research__ConstraintSolverParameters(mainJNI.Solver_const_parameters(swigCPtr, this), false);
322 }
323
328 byte[] buf = mainJNI.Solver_defaultSolverParameters();
329 if (buf == null || buf.length == 0) {
330 return null;
331 }
332 try {
333 return com.google.ortools.constraintsolver.ConstraintSolverParameters.parseFrom(buf);
334 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
335 throw new RuntimeException(
336 "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
337 }
338}
339
375 public void addConstraint(Constraint c) {
376 mainJNI.Solver_addConstraint(swigCPtr, this, Constraint.getCPtr(c), c);
377 }
378
384 public void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr) {
385 mainJNI.Solver_addCastConstraint(swigCPtr, this, CastConstraint.getCPtr(constraint), constraint, IntVar.getCPtr(target_var), target_var, IntExpr.getCPtr(expr), expr);
386 }
387
431 public boolean solve(DecisionBuilder db, SearchMonitor[] monitors) {
432 try {
433 return mainJNI.Solver_solve__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
434 } finally {
436 }
437 }
438
439 public boolean solve(DecisionBuilder db) {
440 try {
441 return mainJNI.Solver_solve__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
442 } finally {
444 }
445 }
446
447 public boolean solve(DecisionBuilder db, SearchMonitor m1) {
448 try {
449 return mainJNI.Solver_solve__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
450 } finally {
452 }
453 }
454
456 try {
457 return mainJNI.Solver_solve__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
458 } finally {
460 }
461 }
462
464 try {
465 return mainJNI.Solver_solve__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
466 } finally {
468 }
469 }
470
472 try {
473 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);
474 } finally {
476 }
477 }
478
490 public void newSearch(DecisionBuilder db, SearchMonitor[] monitors) {
491 try {
492 mainJNI.Solver_newSearch__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
493 } finally {
495 }
496 }
497
498 public void newSearch(DecisionBuilder db) {
499 try {
500 mainJNI.Solver_newSearch__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
501 } finally {
503 }
504 }
505
507 try {
508 mainJNI.Solver_newSearch__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
509 } finally {
511 }
512 }
513
515 try {
516 mainJNI.Solver_newSearch__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
517 } finally {
519 }
520 }
521
523 try {
524 mainJNI.Solver_newSearch__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
525 } finally {
527 }
528 }
529
531 try {
532 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);
533 } finally {
535 }
536 }
537
538 public boolean nextSolution() {
539 return mainJNI.Solver_nextSolution(swigCPtr, this);
540 }
541
542 public void restartSearch() {
543 mainJNI.Solver_restartSearch(swigCPtr, this);
544 }
545
546 public void endSearch() {
547 mainJNI.Solver_endSearch(swigCPtr, this);
548 }
549
561 public boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors) {
562 try {
563 return mainJNI.Solver_solveAndCommit__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
564 } finally {
566 }
567 }
568
569 public boolean solveAndCommit(DecisionBuilder db) {
570 try {
571 return mainJNI.Solver_solveAndCommit__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
572 } finally {
574 }
575 }
576
578 try {
579 return mainJNI.Solver_solveAndCommit__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
580 } finally {
582 }
583 }
584
586 try {
587 return mainJNI.Solver_solveAndCommit__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
588 } finally {
590 }
591 }
592
594 try {
595 return mainJNI.Solver_solveAndCommit__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
596 } finally {
598 }
599 }
600
604 public boolean checkAssignment(Assignment solution) {
605 return mainJNI.Solver_checkAssignment(swigCPtr, this, Assignment.getCPtr(solution), solution);
606 }
607
613 public boolean checkConstraint(Constraint ct) {
614 return mainJNI.Solver_checkConstraint(swigCPtr, this, Constraint.getCPtr(ct), ct);
615 }
616
620 public int state() {
621 return mainJNI.Solver_state(swigCPtr, this);
622 }
623
627 public void fail() {
628 mainJNI.Solver_fail(swigCPtr, this);
629 }
630
634 public String toString() {
635 return mainJNI.Solver_toString(swigCPtr, this);
636 }
637
641 public static long memoryUsage() {
642 return mainJNI.Solver_memoryUsage();
643 }
644
649 public long wallTime() {
650 return mainJNI.Solver_wallTime(swigCPtr, this);
651 }
652
656 public long branches() {
657 return mainJNI.Solver_branches(swigCPtr, this);
658 }
659
663 public long solutions() {
664 return mainJNI.Solver_solutions(swigCPtr, this);
665 }
666
670 public long unchecked_solutions() {
671 return mainJNI.Solver_unchecked_solutions(swigCPtr, this);
672 }
673
677 public long demon_runs(int p) {
678 return mainJNI.Solver_demon_runs(swigCPtr, this, p);
679 }
680
684 public long failures() {
685 return mainJNI.Solver_failures(swigCPtr, this);
686 }
687
691 public long neighbors() {
692 return mainJNI.Solver_neighbors(swigCPtr, this);
693 }
694
699 public void ClearNeighbors() {
700 mainJNI.Solver_ClearNeighbors(swigCPtr, this);
701 }
702
703 public void IncrementNeighbors() {
704 mainJNI.Solver_IncrementNeighbors(swigCPtr, this);
705 }
706
710 public long filteredNeighbors() {
711 return mainJNI.Solver_filteredNeighbors(swigCPtr, this);
712 }
713
717 public long acceptedNeighbors() {
718 return mainJNI.Solver_acceptedNeighbors(swigCPtr, this);
719 }
720
725 public long stamp() {
726 return mainJNI.Solver_stamp(swigCPtr, this);
727 }
728
732 public long fail_stamp() {
733 return mainJNI.Solver_fail_stamp(swigCPtr, this);
734 }
735
739 public void set_context(String context) {
740 mainJNI.Solver_set_context(swigCPtr, this, context);
741 }
742
746 public String context() {
747 return mainJNI.Solver_context(swigCPtr, this);
748 }
749
754 return mainJNI.Solver_optimization_direction(swigCPtr, this);
755 }
756
757 public void set_optimization_direction(int direction) {
758 mainJNI.Solver_set_optimization_direction(swigCPtr, this, direction);
759 }
760
762 mainJNI.Solver_SetGuidedLocalSearchPenaltyCallback(swigCPtr, this, penalty_callback);
763 }
764
765 public long GetGuidedLocalSearchPenalty(long i, long j, long k) {
766 return mainJNI.Solver_GetGuidedLocalSearchPenalty(swigCPtr, this, i, j, k);
767 }
768
772 public IntVar makeIntVar(long min, long max, String name) {
773 long cPtr = mainJNI.Solver_makeIntVar__SWIG_0(swigCPtr, this, min, max, name);
774 return (cPtr == 0) ? null : new IntVar(cPtr, false);
775 }
776
780 public IntVar makeIntVar(long[] values, String name) {
781 long cPtr = mainJNI.Solver_makeIntVar__SWIG_1(swigCPtr, this, values, name);
782 return (cPtr == 0) ? null : new IntVar(cPtr, false);
783 }
784
788 public IntVar makeIntVar(int[] values, String name) {
789 long cPtr = mainJNI.Solver_makeIntVar__SWIG_2(swigCPtr, this, values, name);
790 return (cPtr == 0) ? null : new IntVar(cPtr, false);
791 }
792
796 public IntVar makeIntVar(long min, long max) {
797 long cPtr = mainJNI.Solver_makeIntVar__SWIG_3(swigCPtr, this, min, max);
798 return (cPtr == 0) ? null : new IntVar(cPtr, false);
799 }
800
804 public IntVar makeIntVar(long[] values) {
805 long cPtr = mainJNI.Solver_makeIntVar__SWIG_4(swigCPtr, this, values);
806 return (cPtr == 0) ? null : new IntVar(cPtr, false);
807 }
808
812 public IntVar makeIntVar(int[] values) {
813 long cPtr = mainJNI.Solver_makeIntVar__SWIG_5(swigCPtr, this, values);
814 return (cPtr == 0) ? null : new IntVar(cPtr, false);
815 }
816
820 public IntVar makeBoolVar(String name) {
821 long cPtr = mainJNI.Solver_makeBoolVar__SWIG_0(swigCPtr, this, name);
822 return (cPtr == 0) ? null : new IntVar(cPtr, false);
823 }
824
829 long cPtr = mainJNI.Solver_makeBoolVar__SWIG_1(swigCPtr, this);
830 return (cPtr == 0) ? null : new IntVar(cPtr, false);
831 }
832
836 public IntVar makeIntConst(long val, String name) {
837 long cPtr = mainJNI.Solver_makeIntConst__SWIG_0(swigCPtr, this, val, name);
838 return (cPtr == 0) ? null : new IntVar(cPtr, false);
839 }
840
844 public IntVar makeIntConst(long val) {
845 long cPtr = mainJNI.Solver_makeIntConst__SWIG_1(swigCPtr, this, val);
846 return (cPtr == 0) ? null : new IntVar(cPtr, false);
847 }
848
852 public IntExpr makeSum(IntExpr left, IntExpr right) {
853 long cPtr = mainJNI.Solver_makeSum__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
854 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
855 }
856
860 public IntExpr makeSum(IntExpr expr, long value) {
861 long cPtr = mainJNI.Solver_makeSum__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
862 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
863 }
864
868 public IntExpr makeSum(IntVar[] vars) {
869 long cPtr = mainJNI.Solver_makeSum__SWIG_2(swigCPtr, this, vars);
870 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
871 }
872
876 public IntExpr makeScalProd(IntVar[] vars, long[] coefs) {
877 long cPtr = mainJNI.Solver_makeScalProd__SWIG_0(swigCPtr, this, vars, coefs);
878 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
879 }
880
884 public IntExpr makeScalProd(IntVar[] vars, int[] coefs) {
885 long cPtr = mainJNI.Solver_makeScalProd__SWIG_1(swigCPtr, this, vars, coefs);
886 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
887 }
888
892 public IntExpr makeDifference(IntExpr left, IntExpr right) {
893 long cPtr = mainJNI.Solver_makeDifference__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
894 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
895 }
896
900 public IntExpr makeDifference(long value, IntExpr expr) {
901 long cPtr = mainJNI.Solver_makeDifference__SWIG_1(swigCPtr, this, value, IntExpr.getCPtr(expr), expr);
902 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
903 }
904
909 long cPtr = mainJNI.Solver_makeOpposite(swigCPtr, this, IntExpr.getCPtr(expr), expr);
910 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
911 }
912
916 public IntExpr makeProd(IntExpr left, IntExpr right) {
917 long cPtr = mainJNI.Solver_makeProd__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
918 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
919 }
920
924 public IntExpr makeProd(IntExpr expr, long value) {
925 long cPtr = mainJNI.Solver_makeProd__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
926 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
927 }
928
932 public IntExpr makeDiv(IntExpr expr, long value) {
933 long cPtr = mainJNI.Solver_makeDiv__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
934 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
935 }
936
940 public IntExpr makeDiv(IntExpr numerator, IntExpr denominator) {
941 long cPtr = mainJNI.Solver_makeDiv__SWIG_1(swigCPtr, this, IntExpr.getCPtr(numerator), numerator, IntExpr.getCPtr(denominator), denominator);
942 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
943 }
944
948 public IntExpr makeAbs(IntExpr expr) {
949 long cPtr = mainJNI.Solver_makeAbs(swigCPtr, this, IntExpr.getCPtr(expr), expr);
950 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
951 }
952
957 long cPtr = mainJNI.Solver_makeSquare(swigCPtr, this, IntExpr.getCPtr(expr), expr);
958 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
959 }
960
964 public IntExpr makePower(IntExpr expr, long n) {
965 long cPtr = mainJNI.Solver_makePower(swigCPtr, this, IntExpr.getCPtr(expr), expr, n);
966 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
967 }
968
972 public IntExpr makeElement(long[] values, IntVar index) {
973 long cPtr = mainJNI.Solver_makeElement__SWIG_0(swigCPtr, this, values, IntVar.getCPtr(index), index);
974 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
975 }
976
980 public IntExpr makeElement(int[] values, IntVar index) {
981 long cPtr = mainJNI.Solver_makeElement__SWIG_1(swigCPtr, this, values, IntVar.getCPtr(index), index);
982 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
983 }
984
990 public IntExpr makeElement(LongUnaryOperator values, IntVar index) {
991 long cPtr = mainJNI.Solver_makeElement__SWIG_2(swigCPtr, this, values, IntVar.getCPtr(index), index);
992 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
993 }
994
1003 public IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index) {
1004 long cPtr = mainJNI.Solver_makeMonotonicElement(swigCPtr, this, values, increasing, IntVar.getCPtr(index), index);
1005 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1006 }
1007
1011 public IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2) {
1012 long cPtr = mainJNI.Solver_makeElement__SWIG_3(swigCPtr, this, values, IntVar.getCPtr(index1), index1, IntVar.getCPtr(index2), index2);
1013 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1014 }
1015
1019 public IntExpr makeElement(IntVar[] vars, IntVar index) {
1020 long cPtr = mainJNI.Solver_makeElement__SWIG_4(swigCPtr, this, vars, IntVar.getCPtr(index), index);
1021 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1022 }
1023
1028 public IntExpr makeIndexExpression(IntVar[] vars, long value) {
1029 long cPtr = mainJNI.Solver_makeIndexExpression(swigCPtr, this, vars, value);
1030 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1031 }
1032
1036 public Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var) {
1037 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);
1038 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1039 }
1040
1044 public IntExpr makeMin(IntVar[] vars) {
1045 long cPtr = mainJNI.Solver_makeMin__SWIG_0(swigCPtr, this, vars);
1046 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1047 }
1048
1052 public IntExpr makeMin(IntExpr left, IntExpr right) {
1053 long cPtr = mainJNI.Solver_makeMin__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1054 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1055 }
1056
1060 public IntExpr makeMin(IntExpr expr, long value) {
1061 long cPtr = mainJNI.Solver_makeMin__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1062 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1063 }
1064
1068 public IntExpr makeMin(IntExpr expr, int value) {
1069 long cPtr = mainJNI.Solver_makeMin__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1070 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1071 }
1072
1076 public IntExpr makeMax(IntVar[] vars) {
1077 long cPtr = mainJNI.Solver_makeMax__SWIG_0(swigCPtr, this, vars);
1078 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1079 }
1080
1084 public IntExpr makeMax(IntExpr left, IntExpr right) {
1085 long cPtr = mainJNI.Solver_makeMax__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1086 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1087 }
1088
1092 public IntExpr makeMax(IntExpr expr, long value) {
1093 long cPtr = mainJNI.Solver_makeMax__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1094 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1095 }
1096
1100 public IntExpr makeMax(IntExpr expr, int value) {
1101 long cPtr = mainJNI.Solver_makeMax__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1102 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1103 }
1104
1108 public IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost) {
1109 long cPtr = mainJNI.Solver_makeConvexPiecewiseExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, early_cost, early_date, late_date, late_cost);
1110 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1111 }
1112
1117 public IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step) {
1118 long cPtr = mainJNI.Solver_makeSemiContinuousExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, fixed_charge, step);
1119 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1120 }
1121
1128 public IntExpr makeModulo(IntExpr x, long mod) {
1129 long cPtr = mainJNI.Solver_makeModulo__SWIG_0(swigCPtr, this, IntExpr.getCPtr(x), x, mod);
1130 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1131 }
1132
1137 long cPtr = mainJNI.Solver_makeModulo__SWIG_1(swigCPtr, this, IntExpr.getCPtr(x), x, IntExpr.getCPtr(mod), mod);
1138 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1139 }
1140
1144 public IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value) {
1145 long cPtr = mainJNI.Solver_makeConditionalExpression(swigCPtr, this, IntVar.getCPtr(condition), condition, IntExpr.getCPtr(expr), expr, unperformed_value);
1146 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
1147 }
1148
1153 long cPtr = mainJNI.Solver_makeTrueConstraint(swigCPtr, this);
1154 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1155 }
1156
1161 long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_0(swigCPtr, this);
1162 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1163 }
1164
1165 public Constraint makeFalseConstraint(String explanation) {
1166 long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_1(swigCPtr, this, explanation);
1167 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1168 }
1169
1173 public Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1174 long cPtr = mainJNI.Solver_makeIsEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1175 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1176 }
1177
1181 public IntVar makeIsEqualCstVar(IntExpr var, long value) {
1182 long cPtr = mainJNI.Solver_makeIsEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1183 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1184 }
1185
1190 long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
1191 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1192 }
1193
1198 long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
1199 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1200 }
1201
1206 long cPtr = mainJNI.Solver_makeEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1207 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1208 }
1209
1213 public Constraint makeEquality(IntExpr expr, long value) {
1214 long cPtr = mainJNI.Solver_makeEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1215 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1216 }
1217
1221 public Constraint makeEquality(IntExpr expr, int value) {
1222 long cPtr = mainJNI.Solver_makeEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1223 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1224 }
1225
1229 public Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar) {
1230 long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1231 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1232 }
1233
1237 public IntVar makeIsDifferentCstVar(IntExpr var, long value) {
1238 long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1239 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1240 }
1241
1246 long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
1247 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1248 }
1249
1254 long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
1255 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1256 }
1257
1262 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1263 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1264 }
1265
1269 public Constraint makeNonEquality(IntExpr expr, long value) {
1270 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1271 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1272 }
1273
1277 public Constraint makeNonEquality(IntExpr expr, int value) {
1278 long cPtr = mainJNI.Solver_makeNonEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1279 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1280 }
1281
1285 public Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1286 long cPtr = mainJNI.Solver_makeIsLessOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1287 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1288 }
1289
1293 public IntVar makeIsLessOrEqualCstVar(IntExpr var, long value) {
1294 long cPtr = mainJNI.Solver_makeIsLessOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1295 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1296 }
1297
1302 long cPtr = mainJNI.Solver_makeIsLessOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1303 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1304 }
1305
1310 long cPtr = mainJNI.Solver_makeIsLessOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1311 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1312 }
1313
1318 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1319 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1320 }
1321
1325 public Constraint makeLessOrEqual(IntExpr expr, long value) {
1326 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1327 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1328 }
1329
1333 public Constraint makeLessOrEqual(IntExpr expr, int value) {
1334 long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1335 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1336 }
1337
1341 public Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
1342 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
1343 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1344 }
1345
1350 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1351 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1352 }
1353
1358 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1359 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1360 }
1361
1366 long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1367 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1368 }
1369
1374 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1375 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1376 }
1377
1381 public Constraint makeGreaterOrEqual(IntExpr expr, long value) {
1382 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1383 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1384 }
1385
1389 public Constraint makeGreaterOrEqual(IntExpr expr, int value) {
1390 long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1391 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1392 }
1393
1398 long cPtr = mainJNI.Solver_makeIsGreaterCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
1399 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1400 }
1401
1405 public IntVar makeIsGreaterCstVar(IntExpr var, long value) {
1406 long cPtr = mainJNI.Solver_makeIsGreaterCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1407 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1408 }
1409
1414 long cPtr = mainJNI.Solver_makeIsGreaterVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1415 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1416 }
1417
1422 long cPtr = mainJNI.Solver_makeIsGreaterCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1423 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1424 }
1425
1430 long cPtr = mainJNI.Solver_makeGreater__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1431 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1432 }
1433
1437 public Constraint makeGreater(IntExpr expr, long value) {
1438 long cPtr = mainJNI.Solver_makeGreater__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1439 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1440 }
1441
1445 public Constraint makeGreater(IntExpr expr, int value) {
1446 long cPtr = mainJNI.Solver_makeGreater__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1447 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1448 }
1449
1454 long cPtr = mainJNI.Solver_makeIsLessCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
1455 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1456 }
1457
1461 public IntVar makeIsLessCstVar(IntExpr var, long value) {
1462 long cPtr = mainJNI.Solver_makeIsLessCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
1463 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1464 }
1465
1469 public IntVar makeIsLessVar(IntExpr left, IntExpr right) {
1470 long cPtr = mainJNI.Solver_makeIsLessVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1471 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1472 }
1473
1478 long cPtr = mainJNI.Solver_makeIsLessCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
1479 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1480 }
1481
1485 public Constraint makeLess(IntExpr left, IntExpr right) {
1486 long cPtr = mainJNI.Solver_makeLess__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
1487 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1488 }
1489
1493 public Constraint makeLess(IntExpr expr, long value) {
1494 long cPtr = mainJNI.Solver_makeLess__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1495 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1496 }
1497
1501 public Constraint makeLess(IntExpr expr, int value) {
1502 long cPtr = mainJNI.Solver_makeLess__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
1503 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1504 }
1505
1509 public Constraint makeSumLessOrEqual(IntVar[] vars, long cst) {
1510 long cPtr = mainJNI.Solver_makeSumLessOrEqual(swigCPtr, this, vars, cst);
1511 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1512 }
1513
1514 public Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst) {
1515 long cPtr = mainJNI.Solver_makeSumGreaterOrEqual(swigCPtr, this, vars, cst);
1516 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1517 }
1518
1519 public Constraint makeSumEquality(IntVar[] vars, long cst) {
1520 long cPtr = mainJNI.Solver_makeSumEquality__SWIG_0(swigCPtr, this, vars, cst);
1521 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1522 }
1523
1525 long cPtr = mainJNI.Solver_makeSumEquality__SWIG_1(swigCPtr, this, vars, IntVar.getCPtr(var), var);
1526 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1527 }
1528
1529 public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst) {
1530 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_0(swigCPtr, this, vars, coefficients, cst);
1531 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1532 }
1533
1534 public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst) {
1535 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_1(swigCPtr, this, vars, coefficients, cst);
1536 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1537 }
1538
1539 public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target) {
1540 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_2(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
1541 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1542 }
1543
1544 public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target) {
1545 long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_3(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
1546 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1547 }
1548
1549 public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst) {
1550 long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_0(swigCPtr, this, vars, coeffs, cst);
1551 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1552 }
1553
1554 public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst) {
1555 long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_1(swigCPtr, this, vars, coeffs, cst);
1556 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1557 }
1558
1559 public Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst) {
1560 long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_0(swigCPtr, this, vars, coefficients, cst);
1561 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1562 }
1563
1564 public Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst) {
1565 long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_1(swigCPtr, this, vars, coefficients, cst);
1566 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1567 }
1568
1569 public Constraint makeMinEquality(IntVar[] vars, IntVar min_var) {
1570 long cPtr = mainJNI.Solver_makeMinEquality(swigCPtr, this, vars, IntVar.getCPtr(min_var), min_var);
1571 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1572 }
1573
1574 public Constraint makeMaxEquality(IntVar[] vars, IntVar max_var) {
1575 long cPtr = mainJNI.Solver_makeMaxEquality(swigCPtr, this, vars, IntVar.getCPtr(max_var), max_var);
1576 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1577 }
1578
1579 public Constraint makeElementEquality(long[] vals, IntVar index, IntVar target) {
1580 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_0(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1581 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1582 }
1583
1584 public Constraint makeElementEquality(int[] vals, IntVar index, IntVar target) {
1585 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_1(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1586 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1587 }
1588
1589 public Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target) {
1590 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_2(swigCPtr, this, vars, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
1591 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1592 }
1593
1594 public Constraint makeElementEquality(IntVar[] vars, IntVar index, long target) {
1595 long cPtr = mainJNI.Solver_makeElementEquality__SWIG_3(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
1596 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1597 }
1598
1603 long cPtr = mainJNI.Solver_makeAbsEquality(swigCPtr, this, IntVar.getCPtr(var), var, IntVar.getCPtr(abs_var), abs_var);
1604 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1605 }
1606
1613 public Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target) {
1614 long cPtr = mainJNI.Solver_makeIndexOfConstraint(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
1615 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1616 }
1617
1623 long cPtr = mainJNI.Solver_makeConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
1624 return (cPtr == 0) ? null : new Demon(cPtr, false);
1625 }
1626
1633 long cPtr = mainJNI.Solver_makeDelayedConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
1634 return (cPtr == 0) ? null : new Demon(cPtr, false);
1635 }
1636
1640 public Demon makeClosureDemon(Runnable closure) {
1641 long cPtr = mainJNI.Solver_makeClosureDemon(swigCPtr, this, closure);
1642 return (cPtr == 0) ? null : new Demon(cPtr, false);
1643 }
1644
1648 public Constraint makeBetweenCt(IntExpr expr, long l, long u) {
1649 long cPtr = mainJNI.Solver_makeBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
1650 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1651 }
1652
1659 public Constraint makeNotBetweenCt(IntExpr expr, long l, long u) {
1660 long cPtr = mainJNI.Solver_makeNotBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
1661 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1662 }
1663
1667 public Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b) {
1668 long cPtr = mainJNI.Solver_makeIsBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u, IntVar.getCPtr(b), b);
1669 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1670 }
1671
1672 public IntVar makeIsBetweenVar(IntExpr v, long l, long u) {
1673 long cPtr = mainJNI.Solver_makeIsBetweenVar(swigCPtr, this, IntExpr.getCPtr(v), v, l, u);
1674 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1675 }
1676
1681 public Constraint makeMemberCt(IntExpr expr, long[] values) {
1682 long cPtr = mainJNI.Solver_makeMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1683 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1684 }
1685
1686 public Constraint makeMemberCt(IntExpr expr, int[] values) {
1687 long cPtr = mainJNI.Solver_makeMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1688 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1689 }
1690
1694 public Constraint makeNotMemberCt(IntExpr expr, long[] values) {
1695 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1696 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1697 }
1698
1699 public Constraint makeNotMemberCt(IntExpr expr, int[] values) {
1700 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1701 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1702 }
1703
1707 public Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends) {
1708 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1709 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1710 }
1711
1715 public Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends) {
1716 long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1717 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1718 }
1719
1723 public Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar) {
1724 long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1725 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1726 }
1727
1728 public Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar) {
1729 long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1730 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1731 }
1732
1733 public IntVar makeIsMemberVar(IntExpr expr, long[] values) {
1734 long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1735 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1736 }
1737
1738 public IntVar makeIsMemberVar(IntExpr expr, int[] values) {
1739 long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1740 return (cPtr == 0) ? null : new IntVar(cPtr, false);
1741 }
1742
1746 public Constraint makeCount(IntVar[] vars, long value, long max_count) {
1747 long cPtr = mainJNI.Solver_makeCount__SWIG_0(swigCPtr, this, vars, value, max_count);
1748 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1749 }
1750
1754 public Constraint makeCount(IntVar[] vars, long value, IntVar max_count) {
1755 long cPtr = mainJNI.Solver_makeCount__SWIG_1(swigCPtr, this, vars, value, IntVar.getCPtr(max_count), max_count);
1756 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1757 }
1758
1762 public Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards) {
1763 long cPtr = mainJNI.Solver_makeDistribute__SWIG_0(swigCPtr, this, vars, values, cards);
1764 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1765 }
1766
1770 public Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards) {
1771 long cPtr = mainJNI.Solver_makeDistribute__SWIG_1(swigCPtr, this, vars, values, cards);
1772 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1773 }
1774
1778 public Constraint makeDistribute(IntVar[] vars, IntVar[] cards) {
1779 long cPtr = mainJNI.Solver_makeDistribute__SWIG_2(swigCPtr, this, vars, cards);
1780 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1781 }
1782
1787 public Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size) {
1788 long cPtr = mainJNI.Solver_makeDistribute__SWIG_3(swigCPtr, this, vars, card_min, card_max, card_size);
1789 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1790 }
1791
1797 public Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max) {
1798 long cPtr = mainJNI.Solver_makeDistribute__SWIG_4(swigCPtr, this, vars, card_min, card_max);
1799 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1800 }
1801
1807 public Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max) {
1808 long cPtr = mainJNI.Solver_makeDistribute__SWIG_5(swigCPtr, this, vars, card_min, card_max);
1809 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1810 }
1811
1817 public Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max) {
1818 long cPtr = mainJNI.Solver_makeDistribute__SWIG_6(swigCPtr, this, vars, values, card_min, card_max);
1819 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1820 }
1821
1827 public Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max) {
1828 long cPtr = mainJNI.Solver_makeDistribute__SWIG_7(swigCPtr, this, vars, values, card_min, card_max);
1829 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1830 }
1831
1838 public Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum) {
1839 long cPtr = mainJNI.Solver_makeDeviation(swigCPtr, this, vars, IntVar.getCPtr(deviation_var), deviation_var, total_sum);
1840 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1841 }
1842
1848 long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_0(swigCPtr, this, vars);
1849 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1850 }
1851
1857 public Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation) {
1858 long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_1(swigCPtr, this, vars, stronger_propagation);
1859 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1860 }
1861
1866 public Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value) {
1867 long cPtr = mainJNI.Solver_makeAllDifferentExcept(swigCPtr, this, vars, escape_value);
1868 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1869 }
1870
1889 long cPtr = mainJNI.Solver_makeSortingConstraint(swigCPtr, this, vars, sorted);
1890 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1891 }
1892
1897 public Constraint makeLexicalLess(IntVar[] left, IntVar[] right) {
1898 long cPtr = mainJNI.Solver_makeLexicalLess(swigCPtr, this, left, right);
1899 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1900 }
1901
1907 long cPtr = mainJNI.Solver_makeLexicalLessOrEqual(swigCPtr, this, left, right);
1908 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1909 }
1910
1917 public Constraint MakeLexicalLessOrEqualWithOffsets(IntVar[] left, IntVar[] right, long[] offsets) {
1918 long cPtr = mainJNI.Solver_MakeLexicalLessOrEqualWithOffsets(swigCPtr, this, left, right, offsets);
1919 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1920 }
1921
1922 public Constraint MakeIsLexicalLessOrEqualWithOffsetsCt(IntVar[] left, IntVar[] right, long[] offsets, IntVar boolvar) {
1923 long cPtr = mainJNI.Solver_MakeIsLexicalLessOrEqualWithOffsetsCt(swigCPtr, this, left, right, offsets, IntVar.getCPtr(boolvar), boolvar);
1924 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1925 }
1926
1934 long cPtr = mainJNI.Solver_makeInversePermutationConstraint(swigCPtr, this, left, right);
1935 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1936 }
1937
1943 long cPtr = mainJNI.Solver_makeIndexOfFirstMaxValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1944 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1945 }
1946
1952 long cPtr = mainJNI.Solver_makeIndexOfFirstMinValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1953 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1954 }
1955
1962 public Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars) {
1963 long cPtr = mainJNI.Solver_makeNullIntersect(swigCPtr, this, first_vars, second_vars);
1964 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1965 }
1966
1974 public Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value) {
1975 long cPtr = mainJNI.Solver_makeNullIntersectExcept(swigCPtr, this, first_vars, second_vars, escape_value);
1976 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1977 }
1978
1990 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler) {
1991 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_0(swigCPtr, this, nexts, active, sink_handler);
1992 return (cPtr == 0) ? null : new Constraint(cPtr, false);
1993 }
1994
2006 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active) {
2007 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_1(swigCPtr, this, nexts, active);
2008 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2009 }
2010
2011 public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths) {
2012 long cPtr = mainJNI.Solver_makeNoCycle__SWIG_2(swigCPtr, this, nexts, active, sink_handler, assume_paths);
2013 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2014 }
2015
2020 long cPtr = mainJNI.Solver_makeCircuit(swigCPtr, this, nexts);
2021 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2022 }
2023
2029 long cPtr = mainJNI.Solver_makeSubCircuit(swigCPtr, this, nexts);
2030 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2031 }
2032
2039 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
2040 long cPtr = mainJNI.Solver_makePathCumul__SWIG_0(swigCPtr, this, nexts, active, cumuls, transits);
2041 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2042 }
2043
2048 public Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
2049 long cPtr = mainJNI.Solver_makeDelayedPathCumul(swigCPtr, this, nexts, active, cumuls, transits);
2050 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2051 }
2052
2061 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator) {
2062 long cPtr = mainJNI.Solver_makePathCumul__SWIG_1(swigCPtr, this, nexts, active, cumuls, transit_evaluator);
2063 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2064 }
2065
2074 public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator) {
2075 long cPtr = mainJNI.Solver_makePathCumul__SWIG_2(swigCPtr, this, nexts, active, cumuls, slacks, transit_evaluator);
2076 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2077 }
2078
2084 public Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status) {
2085 long cPtr = mainJNI.Solver_makePathConnected(swigCPtr, this, nexts, sources, sinks, status);
2086 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2087 }
2088
2094 public Constraint makeMapDomain(IntVar var, IntVar[] actives) {
2095 long cPtr = mainJNI.Solver_makeMapDomain(swigCPtr, this, IntVar.getCPtr(var), var, actives);
2096 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2097 }
2098
2106 long cPtr = mainJNI.Solver_makeAllowedAssignment(swigCPtr, this, vars, IntTupleSet.getCPtr(tuples), tuples);
2107 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2108 }
2109
2119 public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states) {
2120 long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_0(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
2121 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2122 }
2123
2133 public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states) {
2134 long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_1(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
2135 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2136 }
2137
2148 public Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
2149 long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
2150 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2151 }
2152
2153 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) {
2154 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));
2155 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2156 }
2157
2158 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) {
2159 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));
2160 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2161 }
2162
2173 public Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
2174 long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
2175 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2176 }
2177
2178 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) {
2179 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));
2180 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2181 }
2182
2183 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) {
2184 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));
2185 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2186 }
2187
2195 public Pack makePack(IntVar[] vars, int number_of_bins) {
2196 long cPtr = mainJNI.Solver_makePack(swigCPtr, this, vars, number_of_bins);
2197 return (cPtr == 0) ? null : new Pack(cPtr, false);
2198 }
2199
2206 public IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name) {
2207 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_0(swigCPtr, this, start_min, start_max, duration, optional, name);
2208 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2209 }
2210
2215 public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name) {
2216 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_1(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, name);
2217 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2218 }
2219
2224 public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name) {
2225 long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_2(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, IntVar.getCPtr(performed_variable), performed_variable, name);
2226 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2227 }
2228
2232 public IntervalVar makeFixedInterval(long start, long duration, String name) {
2233 long cPtr = mainJNI.Solver_makeFixedInterval(swigCPtr, this, start, duration, name);
2234 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2235 }
2236
2241 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) {
2242 long cPtr = mainJNI.Solver_makeIntervalVar(swigCPtr, this, start_min, start_max, duration_min, duration_max, end_min, end_max, optional, name);
2243 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2244 }
2245
2251 long cPtr = mainJNI.Solver_makeMirrorInterval(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2252 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2253 }
2254
2261 public IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
2262 long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2263 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2264 }
2265
2272 public IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
2273 long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2274 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2275 }
2276
2283 public IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
2284 long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2285 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2286 }
2287
2294 public IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
2295 long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
2296 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2297 }
2298
2319 long cPtr = mainJNI.Solver_makeIntervalRelaxedMin(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2320 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2321 }
2322
2343 long cPtr = mainJNI.Solver_makeIntervalRelaxedMax(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
2344 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2345 }
2346
2352 long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t), t, r, d);
2353 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2354 }
2355
2360 long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2);
2361 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2362 }
2363
2371 long cPtr = mainJNI.Solver_makeIntervalVarRelationWithDelay(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2, delay);
2372 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2373 }
2374
2381 long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2, IntVar.getCPtr(alt), alt);
2382 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2383 }
2384
2390 long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2);
2391 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2392 }
2393
2399 long cPtr = mainJNI.Solver_makeDisjunctiveConstraint(swigCPtr, this, intervals, name);
2400 return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
2401 }
2402
2409 long cPtr = mainJNI.Solver_makeStrictDisjunctiveConstraint(swigCPtr, this, intervals, name);
2410 return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
2411 }
2412
2424 public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name) {
2425 long cPtr = mainJNI.Solver_makeCumulative__SWIG_0(swigCPtr, this, intervals, demands, capacity, name);
2426 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2427 }
2428
2440 public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name) {
2441 long cPtr = mainJNI.Solver_makeCumulative__SWIG_1(swigCPtr, this, intervals, demands, capacity, name);
2442 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2443 }
2444
2456 public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name) {
2457 long cPtr = mainJNI.Solver_makeCumulative__SWIG_2(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2458 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2459 }
2460
2472 public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name) {
2473 long cPtr = mainJNI.Solver_makeCumulative__SWIG_3(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2474 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2475 }
2476
2486 public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name) {
2487 long cPtr = mainJNI.Solver_makeCumulative__SWIG_4(swigCPtr, this, intervals, demands, capacity, name);
2488 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2489 }
2490
2500 public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name) {
2501 long cPtr = mainJNI.Solver_makeCumulative__SWIG_5(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
2502 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2503 }
2504
2512 public Constraint makeCover(IntervalVar[] vars, IntervalVar target_var) {
2513 long cPtr = mainJNI.Solver_makeCover(swigCPtr, this, vars, IntervalVar.getCPtr(target_var), target_var);
2514 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2515 }
2516
2521 long cPtr = mainJNI.Solver_makeEquality__SWIG_3(swigCPtr, this, IntervalVar.getCPtr(var1), var1, IntervalVar.getCPtr(var2), var2);
2522 return (cPtr == 0) ? null : new Constraint(cPtr, false);
2523 }
2524
2529 long cPtr = mainJNI.Solver_makeAssignment__SWIG_0(swigCPtr, this);
2530 return (cPtr == 0) ? null : new Assignment(cPtr, false);
2531 }
2532
2537 long cPtr = mainJNI.Solver_makeAssignment__SWIG_1(swigCPtr, this, Assignment.getCPtr(a), a);
2538 return (cPtr == 0) ? null : new Assignment(cPtr, false);
2539 }
2540
2545 long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2546 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2547 }
2548
2554 long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_1(swigCPtr, this);
2555 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2556 }
2557
2562 long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2563 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2564 }
2565
2571 long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_1(swigCPtr, this);
2572 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2573 }
2574
2581 public SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize) {
2582 long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, maximize);
2583 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2584 }
2585
2590 public SolutionCollector MakeBestLexicographicValueSolutionCollector(Assignment assignment, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2591 long cPtr = mainJNI.Solver_MakeBestLexicographicValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2592 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2593 }
2594
2603 long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_1(swigCPtr, this, maximize);
2604 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2605 }
2606
2611 public SolutionCollector MakeBestLexicographicValueSolutionCollector(SWIGTYPE_p_std__vectorT_bool_t maximize) {
2612 long cPtr = mainJNI.Solver_MakeBestLexicographicValueSolutionCollector__SWIG_1(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2613 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2614 }
2615
2621 public SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize) {
2622 long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, solution_count, maximize);
2623 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2624 }
2625
2626 public SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize) {
2627 long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_1(swigCPtr, this, solution_count, maximize);
2628 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2629 }
2630
2635 public SolutionCollector MakeNBestLexicographicValueSolutionCollector(Assignment assignment, int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2636 long cPtr = mainJNI.Solver_MakeNBestLexicographicValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, solution_count, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2637 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2638 }
2639
2640 public SolutionCollector MakeNBestLexicographicValueSolutionCollector(int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize) {
2641 long cPtr = mainJNI.Solver_MakeNBestLexicographicValueSolutionCollector__SWIG_1(swigCPtr, this, solution_count, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize));
2642 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2643 }
2644
2649 long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
2650 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2651 }
2652
2658 long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_1(swigCPtr, this);
2659 return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
2660 }
2661
2665 public OptimizeVar makeMinimize(IntVar v, long step) {
2666 long cPtr = mainJNI.Solver_makeMinimize(swigCPtr, this, IntVar.getCPtr(v), v, step);
2667 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2668 }
2669
2673 public OptimizeVar makeMaximize(IntVar v, long step) {
2674 long cPtr = mainJNI.Solver_makeMaximize(swigCPtr, this, IntVar.getCPtr(v), v, step);
2675 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2676 }
2677
2681 public OptimizeVar makeOptimize(boolean maximize, IntVar v, long step) {
2682 long cPtr = mainJNI.Solver_makeOptimize(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step);
2683 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2684 }
2685
2690 public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step) {
2691 long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
2692 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2693 }
2694
2699 public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step) {
2700 long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
2701 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2702 }
2703
2707 public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step) {
2708 long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
2709 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2710 }
2711
2715 public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step) {
2716 long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
2717 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2718 }
2719
2723 public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step) {
2724 long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_0(swigCPtr, this, maximize, sub_objectives, weights, step);
2725 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2726 }
2727
2731 public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step) {
2732 long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_1(swigCPtr, this, maximize, sub_objectives, weights, step);
2733 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2734 }
2735
2740 public OptimizeVar MakeLexicographicOptimize(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] variables, long[] steps) {
2741 long cPtr = mainJNI.Solver_MakeLexicographicOptimize(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), variables, steps);
2742 return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
2743 }
2744
2763 public ObjectiveMonitor makeTabuSearch(boolean maximize, IntVar objective, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) {
2764 long cPtr = mainJNI.Solver_makeTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(objective), objective, step, vars, keep_tenure, forbid_tenure, tabu_factor);
2765 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2766 }
2767
2768 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) {
2769 long cPtr = mainJNI.Solver_MakeLexicographicTabuSearch(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), objectives, steps, vars, keep_tenure, forbid_tenure, tabu_factor);
2770 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2771 }
2772
2777 public ObjectiveMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure) {
2778 long cPtr = mainJNI.Solver_makeGenericTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, tabu_vars, forbid_tenure);
2779 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2780 }
2781
2785 public ObjectiveMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature) {
2786 long cPtr = mainJNI.Solver_makeSimulatedAnnealing(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, initial_temperature);
2787 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2788 }
2789
2790 public ObjectiveMonitor MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps, long[] initial_temperatures) {
2791 long cPtr = mainJNI.Solver_MakeLexicographicSimulatedAnnealing(swigCPtr, this, SWIGTYPE_p_std__vectorT_bool_t.getCPtr(maximize), vars, steps, initial_temperatures);
2792 return (cPtr == 0) ? null : new ObjectiveMonitor(cPtr, false);
2793 }
2794
2799 public BaseObjectiveMonitor MakeRoundRobinCompoundObjectiveMonitor(SWIGTYPE_p_std__vectorT_operations_research__BaseObjectiveMonitor_p_t monitors, int num_max_local_optima_before_metaheuristic_switch) {
2800 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);
2801 return (cPtr == 0) ? null : new BaseObjectiveMonitor(cPtr, false);
2802 }
2803
2809 public SearchMonitor makeLubyRestart(int scale_factor) {
2810 long cPtr = mainJNI.Solver_makeLubyRestart(swigCPtr, this, scale_factor);
2811 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2812 }
2813
2818 public SearchMonitor makeConstantRestart(int frequency) {
2819 long cPtr = mainJNI.Solver_makeConstantRestart(swigCPtr, this, frequency);
2820 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2821 }
2822
2826 public RegularLimit makeTimeLimit(SWIGTYPE_p_absl__Duration time) {
2827 long cPtr = mainJNI.Solver_makeTimeLimit__SWIG_0(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time));
2828 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2829 }
2830
2831 public RegularLimit makeTimeLimit(long time_in_ms) {
2832 long cPtr = mainJNI.Solver_makeTimeLimit__SWIG_1(swigCPtr, this, time_in_ms);
2833 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2834 }
2835
2841 long cPtr = mainJNI.Solver_makeBranchesLimit(swigCPtr, this, branches);
2842 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2843 }
2844
2850 long cPtr = mainJNI.Solver_makeFailuresLimit(swigCPtr, this, failures);
2851 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2852 }
2853
2859 long cPtr = mainJNI.Solver_makeSolutionsLimit(swigCPtr, this, solutions);
2860 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2861 }
2862
2867 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative) {
2868 long cPtr = mainJNI.Solver_makeLimit__SWIG_0(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions, smart_time_check, cumulative);
2869 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2870 }
2871
2876 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check) {
2877 long cPtr = mainJNI.Solver_makeLimit__SWIG_1(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions, smart_time_check);
2878 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2879 }
2880
2885 public RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions) {
2886 long cPtr = mainJNI.Solver_makeLimit__SWIG_2(swigCPtr, this, SWIGTYPE_p_absl__Duration.getCPtr(time), branches, failures, solutions);
2887 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2888 }
2889
2893 public RegularLimit makeLimit(com.google.ortools.constraintsolver.RegularLimitParameters proto) {
2894 long cPtr = mainJNI.Solver_makeLimit__SWIG_3(swigCPtr, this, proto.toByteArray());
2895 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2896 }
2897
2898 public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative) {
2899 long cPtr = mainJNI.Solver_makeLimit__SWIG_4(swigCPtr, this, time, branches, failures, solutions, smart_time_check, cumulative);
2900 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2901 }
2902
2903 public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check) {
2904 long cPtr = mainJNI.Solver_makeLimit__SWIG_5(swigCPtr, this, time, branches, failures, solutions, smart_time_check);
2905 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2906 }
2907
2908 public RegularLimit makeLimit(long time, long branches, long failures, long solutions) {
2909 long cPtr = mainJNI.Solver_makeLimit__SWIG_6(swigCPtr, this, time, branches, failures, solutions);
2910 return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
2911 }
2912
2917 byte[] buf = mainJNI.Solver_makeDefaultRegularLimitParameters(swigCPtr, this);
2918 if (buf == null || buf.length == 0) {
2919 return null;
2920 }
2921 try {
2922 return com.google.ortools.constraintsolver.RegularLimitParameters.parseFrom(buf);
2923 } catch (com.google.protobuf.InvalidProtocolBufferException e) {
2924 throw new RuntimeException(
2925 "Unable to parse com.google.ortools.constraintsolver.RegularLimitParameters protocol message.");
2926 }
2927}
2928
2935 long cPtr = mainJNI.Solver_makeLimit__SWIG_7(swigCPtr, this, SearchLimit.getCPtr(limit_1), limit_1, SearchLimit.getCPtr(limit_2), limit_2);
2936 return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
2937 }
2938
2945 public ImprovementSearchLimit MakeImprovementLimit(IntVar objective_var, boolean maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance) {
2946 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);
2947 return (cPtr == 0) ? null : new ImprovementSearchLimit(cPtr, false);
2948 }
2949
2954 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) {
2955 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);
2956 return (cPtr == 0) ? null : new ImprovementSearchLimit(cPtr, false);
2957 }
2958
2963 public SearchLimit makeCustomLimit(BooleanSupplier limiter) {
2964 long cPtr = mainJNI.Solver_makeCustomLimit(swigCPtr, this, limiter);
2965 return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
2966 }
2967
2972 public SearchMonitor makeSearchLog(int branch_period) {
2973 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_0(swigCPtr, this, branch_period);
2974 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2975 }
2976
2980 public SearchMonitor makeSearchLog(int branch_period, IntVar var) {
2981 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_1(swigCPtr, this, branch_period, IntVar.getCPtr(var), var);
2982 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2983 }
2984
2989 public SearchMonitor makeSearchLog(int branch_period, Supplier<String> display_callback) {
2990 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_2(swigCPtr, this, branch_period, display_callback);
2991 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
2992 }
2993
2998 public SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier<String> display_callback) {
2999 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_3(swigCPtr, this, branch_period, IntVar.getCPtr(var), var, display_callback);
3000 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3001 }
3002
3007 public SearchMonitor makeSearchLog(int branch_period, IntVar[] vars, Supplier<String> display_callback) {
3008 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_4(swigCPtr, this, branch_period, vars, display_callback);
3009 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3010 }
3011
3016 public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var) {
3017 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_5(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var);
3018 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3019 }
3020
3025 public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier<String> display_callback) {
3026 long cPtr = mainJNI.Solver_makeSearchLog__SWIG_6(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var, display_callback);
3027 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3028 }
3029
3034 public SearchMonitor makeSearchTrace(String prefix) {
3035 long cPtr = mainJNI.Solver_makeSearchTrace(swigCPtr, this, prefix);
3036 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3037 }
3038
3042 public SearchMonitor makeEnterSearchCallback(Runnable callback) {
3043 long cPtr = mainJNI.Solver_makeEnterSearchCallback(swigCPtr, this, callback);
3044 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3045 }
3046
3047 public SearchMonitor makeExitSearchCallback(Runnable callback) {
3048 long cPtr = mainJNI.Solver_makeExitSearchCallback(swigCPtr, this, callback);
3049 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3050 }
3051
3052 public SearchMonitor makeAtSolutionCallback(Runnable callback) {
3053 long cPtr = mainJNI.Solver_makeAtSolutionCallback(swigCPtr, this, callback);
3054 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3055 }
3056
3061 long cPtr = mainJNI.Solver_makePrintModelVisitor(swigCPtr, this);
3062 return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
3063 }
3064
3069 long cPtr = mainJNI.Solver_makeStatisticsModelVisitor(swigCPtr, this);
3070 return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
3071 }
3072
3077 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_0(swigCPtr, this, visitors);
3078 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3079 }
3080
3082 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_1(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1);
3083 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3084 }
3085
3087 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_2(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2);
3088 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3089 }
3090
3092 long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_3(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2, SymmetryBreaker.getCPtr(v3), v3);
3093 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3094 }
3095
3097 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);
3098 return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
3099 }
3100
3105 long cPtr = mainJNI.Solver_makeAssignVariableValue(swigCPtr, this, IntVar.getCPtr(var), var, val);
3106 return (cPtr == 0) ? null : new Decision(cPtr, false);
3107 }
3108
3110 long cPtr = mainJNI.Solver_makeVariableLessOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
3111 return (cPtr == 0) ? null : new Decision(cPtr, false);
3112 }
3113
3115 long cPtr = mainJNI.Solver_makeVariableGreaterOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
3116 return (cPtr == 0) ? null : new Decision(cPtr, false);
3117 }
3118
3119 public Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half) {
3120 long cPtr = mainJNI.Solver_makeSplitVariableDomain(swigCPtr, this, IntVar.getCPtr(var), var, val, start_with_lower_half);
3121 return (cPtr == 0) ? null : new Decision(cPtr, false);
3122 }
3123
3125 long cPtr = mainJNI.Solver_makeAssignVariableValueOrFail(swigCPtr, this, IntVar.getCPtr(var), var, value);
3126 return (cPtr == 0) ? null : new Decision(cPtr, false);
3127 }
3128
3130 long cPtr = mainJNI.Solver_MakeAssignVariableValueOrDoNothing(swigCPtr, this, IntVar.getCPtr(var), var, value);
3131 return (cPtr == 0) ? null : new Decision(cPtr, false);
3132 }
3133
3134 public Decision makeAssignVariablesValues(IntVar[] vars, long[] values) {
3135 long cPtr = mainJNI.Solver_makeAssignVariablesValues(swigCPtr, this, vars, values);
3136 return (cPtr == 0) ? null : new Decision(cPtr, false);
3137 }
3138
3140 long cPtr = mainJNI.Solver_MakeAssignVariablesValuesOrDoNothing(swigCPtr, this, vars, values);
3141 return (cPtr == 0) ? null : new Decision(cPtr, false);
3142 }
3143
3144 public Decision MakeAssignVariablesValuesOrFail(IntVar[] vars, long[] values) {
3145 long cPtr = mainJNI.Solver_MakeAssignVariablesValuesOrFail(swigCPtr, this, vars, values);
3146 return (cPtr == 0) ? null : new Decision(cPtr, false);
3147 }
3148
3150 long cPtr = mainJNI.Solver_makeFailDecision(swigCPtr, this);
3151 return (cPtr == 0) ? null : new Decision(cPtr, false);
3152 }
3153
3154 public Decision makeDecision(Consumer<Solver> apply, Consumer<Solver> refute) {
3155 long cPtr = mainJNI.Solver_makeDecision(swigCPtr, this, apply, refute);
3156 return (cPtr == 0) ? null : new Decision(cPtr, false);
3157 }
3158
3170 try {
3171 long cPtr = mainJNI.Solver_compose__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
3172 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3173 } finally {
3176 }
3177 }
3178
3180 try {
3181 long cPtr = mainJNI.Solver_compose__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
3182 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3183 } finally {
3187 }
3188 }
3189
3191 try {
3192 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);
3193 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3194 } finally {
3199 }
3200 }
3201
3203 try {
3204 long cPtr = mainJNI.Solver_compose__SWIG_3(swigCPtr, this, dbs);
3205 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3206 } finally {
3208 }
3209 }
3210
3229 try {
3230 long cPtr = mainJNI.Solver_tryDecisions__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
3231 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3232 } finally {
3235 }
3236 }
3237
3239 try {
3240 long cPtr = mainJNI.Solver_tryDecisions__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
3241 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3242 } finally {
3246 }
3247 }
3248
3250 try {
3251 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);
3252 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3253 } finally {
3258 }
3259 }
3260
3262 try {
3263 long cPtr = mainJNI.Solver_tryDecisions__SWIG_3(swigCPtr, this, dbs);
3264 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3265 } finally {
3267 }
3268 }
3269
3274 public DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str) {
3275 long cPtr = mainJNI.Solver_makePhase__SWIG_0(swigCPtr, this, vars, var_str, val_str);
3276 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3277 }
3278
3279 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str) {
3280 long cPtr = mainJNI.Solver_makePhase__SWIG_1(swigCPtr, this, vars, var_evaluator, val_str);
3281 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3282 }
3283
3284 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator) {
3285 long cPtr = mainJNI.Solver_makePhase__SWIG_2(swigCPtr, this, vars, var_str, value_evaluator);
3286 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3287 }
3288
3293 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator) {
3294 long cPtr = mainJNI.Solver_makePhase__SWIG_3(swigCPtr, this, vars, var_str, var_val1_val2_comparator);
3295 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3296 }
3297
3298 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator) {
3299 long cPtr = mainJNI.Solver_makePhase__SWIG_4(swigCPtr, this, vars, var_evaluator, value_evaluator);
3300 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3301 }
3302
3303 public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
3304 long cPtr = mainJNI.Solver_makePhase__SWIG_5(swigCPtr, this, vars, var_str, value_evaluator, tie_breaker);
3305 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3306 }
3307
3308 public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
3309 long cPtr = mainJNI.Solver_makePhase__SWIG_6(swigCPtr, this, vars, var_evaluator, value_evaluator, tie_breaker);
3310 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3311 }
3312
3314 long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_0(swigCPtr, this, vars);
3315 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3316 }
3317
3319 long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_1(swigCPtr, this, vars, DefaultPhaseParameters.getCPtr(parameters), parameters);
3320 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3321 }
3322
3326 public DecisionBuilder makePhase(IntVar v0, int var_str, int val_str) {
3327 long cPtr = mainJNI.Solver_makePhase__SWIG_7(swigCPtr, this, IntVar.getCPtr(v0), v0, var_str, val_str);
3328 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3329 }
3330
3331 public DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str) {
3332 long cPtr = mainJNI.Solver_makePhase__SWIG_8(swigCPtr, this, IntVar.getCPtr(v0), v0, IntVar.getCPtr(v1), v1, var_str, val_str);
3333 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3334 }
3335
3336 public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str) {
3337 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);
3338 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3339 }
3340
3341 public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str) {
3342 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);
3343 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3344 }
3345
3353 public Decision makeScheduleOrPostpone(IntervalVar var, long est, SWIGTYPE_p_long marker) {
3354 long cPtr = mainJNI.Solver_makeScheduleOrPostpone(swigCPtr, this, IntervalVar.getCPtr(var), var, est, SWIGTYPE_p_long.getCPtr(marker));
3355 return (cPtr == 0) ? null : new Decision(cPtr, false);
3356 }
3357
3365 public Decision makeScheduleOrExpedite(IntervalVar var, long est, SWIGTYPE_p_long marker) {
3366 long cPtr = mainJNI.Solver_makeScheduleOrExpedite(swigCPtr, this, IntervalVar.getCPtr(var), var, est, SWIGTYPE_p_long.getCPtr(marker));
3367 return (cPtr == 0) ? null : new Decision(cPtr, false);
3368 }
3369
3374 public Decision makeRankFirstInterval(SequenceVar sequence, int index) {
3375 long cPtr = mainJNI.Solver_makeRankFirstInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
3376 return (cPtr == 0) ? null : new Decision(cPtr, false);
3377 }
3378
3383 public Decision makeRankLastInterval(SequenceVar sequence, int index) {
3384 long cPtr = mainJNI.Solver_makeRankLastInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
3385 return (cPtr == 0) ? null : new Decision(cPtr, false);
3386 }
3387
3395 public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str) {
3396 long cPtr = mainJNI.Solver_makePhase__SWIG_11(swigCPtr, this, vars, eval, str);
3397 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3398 }
3399
3409 public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str) {
3410 long cPtr = mainJNI.Solver_makePhase__SWIG_12(swigCPtr, this, vars, eval, tie_breaker, str);
3411 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3412 }
3413
3417 public DecisionBuilder makePhase(IntervalVar[] intervals, int str) {
3418 long cPtr = mainJNI.Solver_makePhase__SWIG_13(swigCPtr, this, intervals, str);
3419 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3420 }
3421
3422 public DecisionBuilder makePhase(SequenceVar[] sequences, int str) {
3423 long cPtr = mainJNI.Solver_makePhase__SWIG_14(swigCPtr, this, sequences, str);
3424 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3425 }
3426
3432 try {
3433 long cPtr = mainJNI.Solver_makeDecisionBuilderFromAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment, DecisionBuilder.getCPtr(db), db, vars);
3434 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3435 } finally {
3437 }
3438 }
3439
3445 long cPtr = mainJNI.Solver_makeConstraintAdder(swigCPtr, this, Constraint.getCPtr(ct), ct);
3446 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3447 }
3448
3456 try {
3457 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
3458 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3459 } finally {
3461 }
3462 }
3463
3465 try {
3466 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1);
3467 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3468 } finally {
3470 }
3471 }
3472
3474 try {
3475 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2);
3476 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3477 } finally {
3479 }
3480 }
3481
3483 try {
3484 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);
3485 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3486 } finally {
3488 }
3489 }
3490
3492 try {
3493 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);
3494 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3495 } finally {
3497 }
3498 }
3499
3501 try {
3502 long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
3503 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3504 } finally {
3506 }
3507 }
3508
3518 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step) {
3519 try {
3520 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step);
3521 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3522 } finally {
3524 }
3525 }
3526
3527 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1) {
3528 try {
3529 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1);
3530 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3531 } finally {
3533 }
3534 }
3535
3536 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2) {
3537 try {
3538 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);
3539 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3540 } finally {
3542 }
3543 }
3544
3545 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) {
3546 try {
3547 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);
3548 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3549 } finally {
3551 }
3552 }
3553
3554 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) {
3555 try {
3556 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);
3557 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3558 } finally {
3560 }
3561 }
3562
3563 public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors) {
3564 try {
3565 long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, monitors);
3566 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3567 } finally {
3569 }
3570 }
3571
3577 long cPtr = mainJNI.Solver_makeRestoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
3578 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3579 }
3580
3586 long cPtr = mainJNI.Solver_makeStoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
3587 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3588 }
3589
3593 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) {
3594 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));
3595 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3596 }
3597
3601 public LocalSearchOperator makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors) {
3602 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));
3603 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3604 }
3605
3609 public LocalSearchOperator makeOperator(IntVar[] vars, int op) {
3610 long cPtr = mainJNI.Solver_makeOperator__SWIG_2(swigCPtr, this, vars, op);
3611 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3612 }
3613
3614 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) {
3615 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));
3616 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3617 }
3618
3619 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) {
3620 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));
3621 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3622 }
3623
3624 public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op) {
3625 long cPtr = mainJNI.Solver_makeOperator__SWIG_5(swigCPtr, this, vars, secondary_vars, op);
3626 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3627 }
3628
3630 long cPtr = mainJNI.Solver_makeOperator__SWIG_6(swigCPtr, this, vars, evaluator, op);
3631 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3632 }
3633
3634 public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op) {
3635 long cPtr = mainJNI.Solver_makeOperator__SWIG_7(swigCPtr, this, vars, secondary_vars, evaluator, op);
3636 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3637 }
3638
3648 public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables) {
3649 long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_0(swigCPtr, this, vars, number_of_variables);
3650 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3651 }
3652
3653 public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed) {
3654 long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_1(swigCPtr, this, vars, number_of_variables, seed);
3655 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3656 }
3657
3666 long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_0(swigCPtr, this, Assignment.getCPtr(target), target);
3667 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3668 }
3669
3678 public LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values) {
3679 long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_1(swigCPtr, this, variables, target_values);
3680 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3681 }
3682
3715 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_0(swigCPtr, this, ops);
3716 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3717 }
3718
3720 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_1(swigCPtr, this, ops, restart);
3721 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3722 }
3723
3725 long cPtr = mainJNI.Solver_concatenateOperators__SWIG_2(swigCPtr, this, ops, evaluator);
3726 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3727 }
3728
3734 long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_0(swigCPtr, this, ops);
3735 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3736 }
3737
3744 long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_1(swigCPtr, this, ops, seed);
3745 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3746 }
3747
3757 public LocalSearchOperator MultiArmedBanditConcatenateOperators(LocalSearchOperator[] ops, double memory_coefficient, double exploration_coefficient, boolean maximize) {
3758 long cPtr = mainJNI.Solver_MultiArmedBanditConcatenateOperators(swigCPtr, this, ops, memory_coefficient, exploration_coefficient, maximize);
3759 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3760 }
3761
3770 long cPtr = mainJNI.Solver_makeNeighborhoodLimit(swigCPtr, this, LocalSearchOperator.getCPtr(op), op, limit);
3771 return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
3772 }
3773
3800 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3801 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3802 }
3803
3805 try {
3806 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_1(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3807 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3808 } finally {
3809 keepAliveDecisionBuilder(first_solution);
3810 }
3811 }
3812
3816 public DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) {
3817 try {
3818 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);
3819 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3820 } finally {
3821 keepAliveDecisionBuilder(first_solution);
3822 keepAliveDecisionBuilder(first_solution_sub_decision_builder);
3823 }
3824 }
3825
3827 try {
3828 long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_3(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
3829 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
3830 } finally {
3831 keepAliveDecisionBuilder(first_solution);
3832 }
3833 }
3834
3841 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) {
3842 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));
3843 return (cPtr == 0) ? null : new Assignment(cPtr, false);
3844 }
3845
3852 public Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit) {
3853 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);
3854 return (cPtr == 0) ? null : new Assignment(cPtr, false);
3855 }
3856
3861 long cPtr = mainJNI.Solver_makeDefaultSolutionPool(swigCPtr, this);
3862 return (cPtr == 0) ? null : new SolutionPool(cPtr, false);
3863 }
3864
3869 try {
3870 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);
3871 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3872 } finally {
3873 keepAliveDecisionBuilder(sub_decision_builder);
3874 }
3875 }
3876
3878 try {
3879 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);
3880 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3881 } finally {
3882 keepAliveDecisionBuilder(sub_decision_builder);
3883 }
3884 }
3885
3887 try {
3888 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);
3889 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3890 } finally {
3891 keepAliveDecisionBuilder(sub_decision_builder);
3892 }
3893 }
3894
3896 try {
3897 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);
3898 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3899 } finally {
3900 keepAliveDecisionBuilder(sub_decision_builder);
3901 }
3902 }
3903
3905 try {
3906 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);
3907 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3908 } finally {
3909 keepAliveDecisionBuilder(sub_decision_builder);
3910 }
3911 }
3912
3914 try {
3915 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);
3916 return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
3917 } finally {
3918 keepAliveDecisionBuilder(sub_decision_builder);
3919 }
3920 }
3921
3926 long cPtr = mainJNI.Solver_MakeAcceptFilter(swigCPtr, this);
3927 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3928 }
3929
3931 long cPtr = mainJNI.Solver_MakeRejectFilter(swigCPtr, this);
3932 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3933 }
3934
3936 long cPtr = mainJNI.Solver_makeVariableDomainFilter(swigCPtr, this);
3937 return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
3938 }
3939
3940 public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum) {
3941 long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_0(swigCPtr, this, vars, values, filter_enum);
3942 return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
3943 }
3944
3945 public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum) {
3946 long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_1(swigCPtr, this, vars, secondary_vars, values, filter_enum);
3947 return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
3948 }
3949
3954 public void topPeriodicCheck() {
3955 mainJNI.Solver_topPeriodicCheck(swigCPtr, this);
3956 }
3957
3963 public int topProgressPercent() {
3964 return mainJNI.Solver_topProgressPercent(swigCPtr, this);
3965 }
3966
3972 public void pushState() {
3973 mainJNI.Solver_pushState(swigCPtr, this);
3974 }
3975
3976 public void popState() {
3977 mainJNI.Solver_popState(swigCPtr, this);
3978 }
3979
3984 public int searchDepth() {
3985 return mainJNI.Solver_searchDepth(swigCPtr, this);
3986 }
3987
3992 public int searchLeftDepth() {
3993 return mainJNI.Solver_searchLeftDepth(swigCPtr, this);
3994 }
3995
4000 public int solveDepth() {
4001 return mainJNI.Solver_solveDepth(swigCPtr, this);
4002 }
4003
4007 public long rand64(long size) {
4008 return mainJNI.Solver_rand64(swigCPtr, this, size);
4009 }
4010
4014 public int rand32(int size) {
4015 return mainJNI.Solver_rand32(swigCPtr, this, size);
4016 }
4017
4021 public void reSeed(int seed) {
4022 mainJNI.Solver_reSeed(swigCPtr, this, seed);
4023 }
4024
4030 public void exportProfilingOverview(String filename) {
4031 mainJNI.Solver_exportProfilingOverview(swigCPtr, this, filename);
4032 }
4033
4037 public String localSearchProfile() {
4038 return mainJNI.Solver_localSearchProfile(swigCPtr, this);
4039 }
4040
4046 public boolean currentlyInSolve() {
4047 return mainJNI.Solver_currentlyInSolve(swigCPtr, this);
4048 }
4049
4054 public int constraints() {
4055 return mainJNI.Solver_constraints(swigCPtr, this);
4056 }
4057
4061 public void accept(ModelVisitor visitor) {
4062 mainJNI.Solver_accept(swigCPtr, this, ModelVisitor.getCPtr(visitor), visitor);
4063 }
4064
4066 long cPtr = mainJNI.Solver_balancing_decision(swigCPtr, this);
4067 return (cPtr == 0) ? null : new Decision(cPtr, false);
4068 }
4069
4073 public void clear_fail_intercept() {
4074 mainJNI.Solver_clear_fail_intercept(swigCPtr, this);
4075 }
4076
4081 public void SetUseFastLocalSearch(boolean use_fast_local_search) {
4082 mainJNI.Solver_SetUseFastLocalSearch(swigCPtr, this, use_fast_local_search);
4083 }
4084
4088 public boolean UseFastLocalSearch() {
4089 return mainJNI.Solver_UseFastLocalSearch(swigCPtr, this);
4090 }
4091
4095 public boolean hasName(PropagationBaseObject object) {
4096 return mainJNI.Solver_hasName(swigCPtr, this, PropagationBaseObject.getCPtr(object), object);
4097 }
4098
4102 public Demon registerDemon(Demon demon) {
4103 long cPtr = mainJNI.Solver_registerDemon(swigCPtr, this, Demon.getCPtr(demon), demon);
4104 return (cPtr == 0) ? null : new Demon(cPtr, false);
4105 }
4106
4111 long cPtr = mainJNI.Solver_registerIntExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr);
4112 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
4113 }
4114
4119 long cPtr = mainJNI.Solver_registerIntVar(swigCPtr, this, IntVar.getCPtr(var), var);
4120 return (cPtr == 0) ? null : new IntVar(cPtr, false);
4121 }
4122
4128 long cPtr = mainJNI.Solver_registerIntervalVar(swigCPtr, this, IntervalVar.getCPtr(var), var);
4129 return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
4130 }
4131
4136 long cPtr = mainJNI.Solver_cache(swigCPtr, this);
4137 return (cPtr == 0) ? null : new ModelCache(cPtr, false);
4138 }
4139
4143 public boolean instrumentsDemons() {
4144 return mainJNI.Solver_instrumentsDemons(swigCPtr, this);
4145 }
4146
4150 public boolean isProfilingEnabled() {
4151 return mainJNI.Solver_isProfilingEnabled(swigCPtr, this);
4152 }
4153
4158 return mainJNI.Solver_isLocalSearchProfilingEnabled(swigCPtr, this);
4159 }
4160
4164 public boolean instrumentsVariables() {
4165 return mainJNI.Solver_instrumentsVariables(swigCPtr, this);
4166 }
4167
4171 public boolean nameAllVariables() {
4172 return mainJNI.Solver_nameAllVariables(swigCPtr, this);
4173 }
4174
4178 public String model_name() {
4179 return mainJNI.Solver_model_name(swigCPtr, this);
4180 }
4181
4186 long cPtr = mainJNI.Solver_getPropagationMonitor(swigCPtr, this);
4187 return (cPtr == 0) ? null : new PropagationMonitor(cPtr, false);
4188 }
4189
4195 mainJNI.Solver_addPropagationMonitor(swigCPtr, this, PropagationMonitor.getCPtr(monitor), monitor);
4196 }
4197
4202 long cPtr = mainJNI.Solver_getLocalSearchMonitor(swigCPtr, this);
4203 return (cPtr == 0) ? null : new LocalSearchMonitor(cPtr, false);
4204 }
4205
4211 mainJNI.Solver_addLocalSearchMonitor(swigCPtr, this, LocalSearchMonitor.getCPtr(monitor), monitor);
4212 }
4213
4214 public boolean AcceptSolution(SWIGTYPE_p_operations_research__Search search) {
4215 return mainJNI.Solver_AcceptSolution(swigCPtr, this, SWIGTYPE_p_operations_research__Search.getCPtr(search));
4216 }
4217
4222 long cPtr = mainJNI.Solver_GetOrCreateLocalSearchState(swigCPtr, this);
4223 return (cPtr == 0) ? null : new Assignment(cPtr, false);
4224 }
4225
4230 mainJNI.Solver_ClearLocalSearchState(swigCPtr, this);
4231 }
4232
4239 public void setTmpVector(long[] value) {
4240 mainJNI.Solver_tmpVector_set(swigCPtr, this, value);
4241 }
4242
4249 public long[] getTmpVector() {
4250 return mainJNI.Solver_tmpVector_get(swigCPtr, this);
4251}
4252
4258 long cPtr = mainJNI.Solver_castExpression(swigCPtr, this, IntVar.getCPtr(var), var);
4259 return (cPtr == 0) ? null : new IntExpr(cPtr, false);
4260 }
4261
4265 public void finishCurrentSearch() {
4266 mainJNI.Solver_finishCurrentSearch(swigCPtr, this);
4267 }
4268
4269 public void restartCurrentSearch() {
4270 mainJNI.Solver_restartCurrentSearch(swigCPtr, this);
4271 }
4272
4277 public void shouldFail() {
4278 mainJNI.Solver_shouldFail(swigCPtr, this);
4279 }
4280
4281 public void checkFail() {
4282 mainJNI.Solver_checkFail(swigCPtr, this);
4283 }
4284
4289 try {
4290 long cPtr = mainJNI.Solver_MakeProfiledDecisionBuilderWrapper(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
4291 return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
4292 } finally {
4294 }
4295 }
4296
4300 public final static int kNumPriorities = mainJNI.Solver_kNumPriorities_get();
4301 // IntVarStrategy
4306
4310 public final static int INT_VAR_DEFAULT = mainJNI.Solver_INT_VAR_DEFAULT_get();
4314 public final static int INT_VAR_SIMPLE = mainJNI.Solver_INT_VAR_SIMPLE_get();
4320 public final static int CHOOSE_FIRST_UNBOUND = mainJNI.Solver_CHOOSE_FIRST_UNBOUND_get();
4324 public final static int CHOOSE_RANDOM = mainJNI.Solver_CHOOSE_RANDOM_get();
4333 public final static int CHOOSE_MIN_SIZE_LOWEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MIN_get();
4342 public final static int CHOOSE_MIN_SIZE_HIGHEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MIN_get();
4351 public final static int CHOOSE_MIN_SIZE_LOWEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MAX_get();
4360 public final static int CHOOSE_MIN_SIZE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MAX_get();
4367 public final static int CHOOSE_LOWEST_MIN = mainJNI.Solver_CHOOSE_LOWEST_MIN_get();
4374 public final static int CHOOSE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_HIGHEST_MAX_get();
4380 public final static int CHOOSE_MIN_SIZE = mainJNI.Solver_CHOOSE_MIN_SIZE_get();
4386 public final static int CHOOSE_MAX_SIZE = mainJNI.Solver_CHOOSE_MAX_SIZE_get();
4391 public final static int CHOOSE_MAX_REGRET_ON_MIN = mainJNI.Solver_CHOOSE_MAX_REGRET_ON_MIN_get();
4396 public final static int CHOOSE_PATH = mainJNI.Solver_CHOOSE_PATH_get();
4397
4398 // IntValueStrategy
4403
4407 public final static int INT_VALUE_DEFAULT = mainJNI.Solver_INT_VALUE_DEFAULT_get();
4411 public final static int INT_VALUE_SIMPLE = mainJNI.Solver_INT_VALUE_SIMPLE_get();
4415 public final static int ASSIGN_MIN_VALUE = mainJNI.Solver_ASSIGN_MIN_VALUE_get();
4419 public final static int ASSIGN_MAX_VALUE = mainJNI.Solver_ASSIGN_MAX_VALUE_get();
4423 public final static int ASSIGN_RANDOM_VALUE = mainJNI.Solver_ASSIGN_RANDOM_VALUE_get();
4429 public final static int ASSIGN_CENTER_VALUE = mainJNI.Solver_ASSIGN_CENTER_VALUE_get();
4434 public final static int SPLIT_LOWER_HALF = mainJNI.Solver_SPLIT_LOWER_HALF_get();
4439 public final static int SPLIT_UPPER_HALF = mainJNI.Solver_SPLIT_UPPER_HALF_get();
4440
4441 // EvaluatorStrategy
4454
4461 public final static int CHOOSE_STATIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_STATIC_GLOBAL_BEST_get();
4468 public final static int CHOOSE_DYNAMIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_DYNAMIC_GLOBAL_BEST_get();
4469
4470 // SequenceStrategy
4474
4475 public final static int SEQUENCE_DEFAULT = mainJNI.Solver_SEQUENCE_DEFAULT_get();
4476 public final static int SEQUENCE_SIMPLE = mainJNI.Solver_SEQUENCE_SIMPLE_get();
4477 public final static int CHOOSE_MIN_SLACK_RANK_FORWARD = mainJNI.Solver_CHOOSE_MIN_SLACK_RANK_FORWARD_get();
4478 public final static int CHOOSE_RANDOM_RANK_FORWARD = mainJNI.Solver_CHOOSE_RANDOM_RANK_FORWARD_get();
4479
4480 // IntervalStrategy
4485
4489 public final static int INTERVAL_DEFAULT = mainJNI.Solver_INTERVAL_DEFAULT_get();
4493 public final static int INTERVAL_SIMPLE = mainJNI.Solver_INTERVAL_SIMPLE_get();
4498 public final static int INTERVAL_SET_TIMES_FORWARD = mainJNI.Solver_INTERVAL_SET_TIMES_FORWARD_get();
4503 public final static int INTERVAL_SET_TIMES_BACKWARD = mainJNI.Solver_INTERVAL_SET_TIMES_BACKWARD_get();
4504
4505 // LocalSearchOperators
4510
4524 public final static int TWOOPT = mainJNI.Solver_TWOOPT_get();
4542 public final static int OROPT = mainJNI.Solver_OROPT_get();
4546 public final static int RELOCATE = mainJNI.Solver_RELOCATE_get();
4558 public final static int EXCHANGE = mainJNI.Solver_EXCHANGE_get();
4572 public final static int CROSS = mainJNI.Solver_CROSS_get();
4583 public final static int MAKEACTIVE = mainJNI.Solver_MAKEACTIVE_get();
4593 public final static int MAKEINACTIVE = mainJNI.Solver_MAKEINACTIVE_get();
4604 public final static int MAKECHAININACTIVE = mainJNI.Solver_MAKECHAININACTIVE_get();
4614 public final static int SWAPACTIVE = mainJNI.Solver_SWAPACTIVE_get();
4625 public final static int SWAPACTIVECHAIN = mainJNI.Solver_SWAPACTIVECHAIN_get();
4640 public final static int EXTENDEDSWAPACTIVE = mainJNI.Solver_EXTENDEDSWAPACTIVE_get();
4650 public final static int PATHLNS = mainJNI.Solver_PATHLNS_get();
4655 public final static int FULLPATHLNS = mainJNI.Solver_FULLPATHLNS_get();
4661 public final static int UNACTIVELNS = mainJNI.Solver_UNACTIVELNS_get();
4672 public final static int INCREMENT = mainJNI.Solver_INCREMENT_get();
4678 public final static int DECREMENT = mainJNI.Solver_DECREMENT_get();
4688 public final static int SIMPLELNS = mainJNI.Solver_SIMPLELNS_get();
4689
4690 // EvaluatorLocalSearchOperators
4695
4702 public final static int LK = mainJNI.Solver_LK_get();
4711 public final static int TSPOPT = mainJNI.Solver_TSPOPT_get();
4720 public final static int TSPLNS = mainJNI.Solver_TSPLNS_get();
4721
4722 // LocalSearchFilterBound
4729
4733 public final static int GE = mainJNI.Solver_GE_get();
4737 public final static int LE = mainJNI.Solver_LE_get();
4742 public final static int EQ = mainJNI.Solver_EQ_get();
4743
4744 // DemonPriority
4750
4755 public final static int DELAYED_PRIORITY = mainJNI.Solver_DELAYED_PRIORITY_get();
4759 public final static int VAR_PRIORITY = mainJNI.Solver_VAR_PRIORITY_get();
4763 public final static int NORMAL_PRIORITY = mainJNI.Solver_NORMAL_PRIORITY_get();
4764
4765 // BinaryIntervalRelation
4770
4774 public final static int ENDS_AFTER_END = mainJNI.Solver_ENDS_AFTER_END_get();
4778 public final static int ENDS_AFTER_START = mainJNI.Solver_ENDS_AFTER_START_get();
4782 public final static int ENDS_AT_END = mainJNI.Solver_ENDS_AT_END_get();
4786 public final static int ENDS_AT_START = mainJNI.Solver_ENDS_AT_START_get();
4790 public final static int STARTS_AFTER_END = mainJNI.Solver_STARTS_AFTER_END_get();
4794 public final static int STARTS_AFTER_START = mainJNI.Solver_STARTS_AFTER_START_get();
4798 public final static int STARTS_AT_END = mainJNI.Solver_STARTS_AT_END_get();
4802 public final static int STARTS_AT_START = mainJNI.Solver_STARTS_AT_START_get();
4808 public final static int STAYS_IN_SYNC = mainJNI.Solver_STAYS_IN_SYNC_get();
4809
4810 // UnaryIntervalRelation
4815
4819 public final static int ENDS_AFTER = mainJNI.Solver_ENDS_AFTER_get();
4823 public final static int ENDS_AT = mainJNI.Solver_ENDS_AT_get();
4827 public final static int ENDS_BEFORE = mainJNI.Solver_ENDS_BEFORE_get();
4831 public final static int STARTS_AFTER = mainJNI.Solver_STARTS_AFTER_get();
4835 public final static int STARTS_AT = mainJNI.Solver_STARTS_AT_get();
4839 public final static int STARTS_BEFORE = mainJNI.Solver_STARTS_BEFORE_get();
4845 public final static int CROSS_DATE = mainJNI.Solver_CROSS_DATE_get();
4851 public final static int AVOID_DATE = mainJNI.Solver_AVOID_DATE_get();
4852
4853 // DecisionModification
4861
4866 public final static int NO_CHANGE = mainJNI.Solver_NO_CHANGE_get();
4872 public final static int KEEP_LEFT = mainJNI.Solver_KEEP_LEFT_get();
4878 public final static int KEEP_RIGHT = mainJNI.Solver_KEEP_RIGHT_get();
4883 public final static int KILL_BOTH = mainJNI.Solver_KILL_BOTH_get();
4888 public final static int SWITCH_BRANCHES = mainJNI.Solver_SWITCH_BRANCHES_get();
4889
4890 // MarkerType
4895
4896 public final static int SENTINEL = mainJNI.Solver_SENTINEL_get();
4897 public final static int SIMPLE_MARKER = mainJNI.Solver_SIMPLE_MARKER_get();
4898 public final static int CHOICE_POINT = mainJNI.Solver_CHOICE_POINT_get();
4899 public final static int REVERSIBLE_ACTION = mainJNI.Solver_REVERSIBLE_ACTION_get();
4900
4901 // SolverState
4905
4909 public final static int OUTSIDE_SEARCH = mainJNI.Solver_OUTSIDE_SEARCH_get();
4913 public final static int IN_ROOT_NODE = mainJNI.Solver_IN_ROOT_NODE_get();
4917 public final static int IN_SEARCH = mainJNI.Solver_IN_SEARCH_get();
4921 public final static int AT_SOLUTION = mainJNI.Solver_AT_SOLUTION_get();
4925 public final static int NO_MORE_SOLUTIONS = mainJNI.Solver_NO_MORE_SOLUTIONS_get();
4929 public final static int PROBLEM_INFEASIBLE = mainJNI.Solver_PROBLEM_INFEASIBLE_get();
4930
4931 // OptimizationDirection
4935
4936 public final static int NOT_SET = mainJNI.Solver_NOT_SET_get();
4937 public final static int MAXIMIZATION = mainJNI.Solver_MAXIMIZATION_get();
4938 public final static int MINIMIZATION = mainJNI.Solver_MINIMIZATION_get();
4939
4940}
IntegerCastInfo(IntVar v, IntExpr e, Constraint c)
Definition Solver.java:260
Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var)
Definition Solver.java:1036
IntVar makeIsDifferentCstVar(IntExpr var, long value)
Definition Solver.java:1237
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1)
Definition Solver.java:3527
Constraint makeNotBetweenCt(IntExpr expr, long l, long u)
Definition Solver.java:1659
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str)
Definition Solver.java:3395
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2)
Definition Solver.java:2389
void exportProfilingOverview(String filename)
Definition Solver.java:4030
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst)
Definition Solver.java:1549
Constraint makeElementEquality(int[] vals, IntVar index, IntVar target)
Definition Solver.java:1584
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:2945
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition Solver.java:3545
SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize)
Definition Solver.java:2626
Decision makeScheduleOrPostpone(IntervalVar var, long est, SWIGTYPE_p_long marker)
Definition Solver.java:3353
Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size)
Definition Solver.java:1787
LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values)
Definition Solver.java:3678
Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max)
Definition Solver.java:1797
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name)
Definition Solver.java:2456
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name)
Definition Solver.java:2472
void newSearch(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:490
IntExpr makeMax(IntExpr left, IntExpr right)
Definition Solver.java:1084
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states)
Definition Solver.java:2133
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:463
Constraint makeIntervalVarRelationWithDelay(IntervalVar t1, int r, IntervalVar t2, long delay)
Definition Solver.java:2370
LocalSearchOperator makeOperator(IntVar[] vars, int op, SWIGTYPE_p_std__functionT_std__vectorT_int_t_const_Rfint_intF_t get_incoming_neighbors)
Definition Solver.java:3601
IntExpr makeProd(IntExpr left, IntExpr right)
Definition Solver.java:916
Constraint makeIntervalVarRelation(IntervalVar t1, int r, IntervalVar t2)
Definition Solver.java:2359
IntVar makeIsEqualCstVar(IntExpr var, long value)
Definition Solver.java:1181
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:3614
void SetGuidedLocalSearchPenaltyCallback(LongTernaryOperator penalty_callback)
Definition Solver.java:761
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional, String name)
Definition Solver.java:178
Constraint makeNotMemberCt(IntExpr expr, int[] values)
Definition Solver.java:1699
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str)
Definition Solver.java:3279
IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2283
SolutionCollector makeFirstSolutionCollector(Assignment assignment)
Definition Solver.java:2544
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2731
DisjunctiveConstraint makeStrictDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition Solver.java:2408
Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half)
Definition Solver.java:3119
IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value)
Definition Solver.java:1144
Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst)
Definition Solver.java:1559
Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b)
Definition Solver.java:1667
SearchMonitor makeSymmetryManager(SymmetryBreaker[] visitors)
Definition Solver.java:3076
SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize)
Definition Solver.java:2581
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters)
Definition Solver.java:3816
Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum)
Definition Solver.java:1838
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition Solver.java:3179
DecisionBuilder makePhase(IntVar v0, int var_str, int val_str)
Definition Solver.java:3326
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2)
Definition Solver.java:3169
Constraint makeAbsEquality(IntVar var, IntVar abs_var)
Definition Solver.java:1602
SolutionCollector makeBestValueSolutionCollector(boolean maximize)
Definition Solver.java:2602
Decision makeVariableGreaterOrEqualValue(IntVar var, long value)
Definition Solver.java:3114
Constraint makeMemberCt(IntExpr expr, long[] values)
Definition Solver.java:1681
SearchMonitor makeSearchTrace(String prefix)
Definition Solver.java:3034
DecisionBuilder makePhase(SequenceVar[] sequences, int str)
Definition Solver.java:3422
IntervalVar makeIntervalRelaxedMax(IntervalVar interval_var)
Definition Solver.java:2342
IntVar makeIsLessOrEqualCstVar(IntExpr var, long value)
Definition Solver.java:1293
Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar)
Definition Solver.java:1723
SolutionCollector makeLastSolutionCollector()
Definition Solver.java:2570
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors)
Definition Solver.java:3563
SWIGTYPE_p_operations_research__ConstraintSolverParameters const_parameters()
Definition Solver.java:320
IntervalVar makeFixedInterval(long start, long duration, String name)
Definition Solver.java:2232
Constraint makeLexicalLess(IntVar[] left, IntVar[] right)
Definition Solver.java:1897
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum)
Definition Solver.java:3940
Constraint makeSumLessOrEqual(IntVar[] vars, long cst)
Definition Solver.java:1509
Decision makeAssignVariablesValues(IntVar[] vars, long[] values)
Definition Solver.java:3134
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:2158
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops, int seed)
Definition Solver.java:3743
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2)
Definition Solver.java:3473
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name)
Definition Solver.java:2224
Decision MakeAssignVariablesValuesOrDoNothing(IntVar[] vars, long[] values)
Definition Solver.java:3139
Constraint makeSumEquality(IntVar[] vars, IntVar var)
Definition Solver.java:1524
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step)
Definition Solver.java:3518
Constraint makeIsGreaterOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1365
void newSearch(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:506
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:593
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2699
Constraint makeSubCircuit(IntVar[] nexts)
Definition Solver.java:2028
Constraint makeMinEquality(IntVar[] vars, IntVar min_var)
Definition Solver.java:1569
IntVar makeIntVar(long[] values, String name)
Definition Solver.java:780
Constraint makeIsLessCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1477
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3, SymmetryBreaker v4)
Definition Solver.java:3096
Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition Solver.java:2173
IntExpr makeElement(int[] values, IntVar index)
Definition Solver.java:980
Decision MakeAssignVariablesValuesOrFail(IntVar[] vars, long[] values)
Definition Solver.java:3144
IntExpr makeModulo(IntExpr x, long mod)
Definition Solver.java:1128
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition Solver.java:3904
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:2241
Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends)
Definition Solver.java:1715
Constraint makeIsLessOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1309
Constraint makeCount(IntVar[] vars, long value, IntVar max_count)
Definition Solver.java:1754
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:585
LocalSearchOperator makeMoveTowardTargetOperator(Assignment target)
Definition Solver.java:3665
SearchLimit makeLimit(SearchLimit limit_1, SearchLimit limit_2)
Definition Solver.java:2934
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target)
Definition Solver.java:1544
DecisionBuilder makeSolveOnce(DecisionBuilder db)
Definition Solver.java:3455
SolutionCollector MakeNBestLexicographicValueSolutionCollector(Assignment assignment, int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2635
RegularLimit makeBranchesLimit(long branches)
Definition Solver.java:2840
void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr)
Definition Solver.java:384
Solver(long cPtr, boolean cMemoryOwn)
Definition Solver.java:79
SolutionCollector MakeBestLexicographicValueSolutionCollector(SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2611
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, IntIntToLongFunction evaluator)
Definition Solver.java:3724
Constraint makeIsLessCstCt(IntExpr v, long c, IntVar b)
Definition Solver.java:1453
IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2)
Definition Solver.java:1011
IntVar makeIsMemberVar(IntExpr expr, long[] values)
Definition Solver.java:1733
Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1285
SearchLimit makeCustomLimit(BooleanSupplier limiter)
Definition Solver.java:2963
Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars)
Definition Solver.java:1962
SearchMonitor makeSearchLog(int branch_period)
Definition Solver.java:2972
IntExpr makeElement(long[] values, IntVar index)
Definition Solver.java:972
ObjectiveMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure)
Definition Solver.java:2777
IntVar makeIsDifferentCstVar(IntExpr v1, IntExpr v2)
Definition Solver.java:1245
Constraint makeCount(IntVar[] vars, long value, long max_count)
Definition Solver.java:1746
Constraint makeMemberCt(IntExpr expr, int[] values)
Definition Solver.java:1686
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:2153
Assignment makeAssignment(Assignment a)
Definition Solver.java:2536
Constraint makeLessOrEqual(IntExpr expr, int value)
Definition Solver.java:1333
IntExpr makeMin(IntExpr expr, int value)
Definition Solver.java:1068
static long swigRelease(Solver obj)
Definition Solver.java:88
Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst)
Definition Solver.java:1514
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst)
Definition Solver.java:1534
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables)
Definition Solver.java:3648
Constraint makeCircuit(IntVar[] nexts)
Definition Solver.java:2019
RegularLimit makeLimit(long time, long branches, long failures, long solutions)
Definition Solver.java:2908
Constraint makeGreaterOrEqual(IntExpr left, IntExpr right)
Definition Solver.java:1373
Constraint makeLess(IntExpr expr, int value)
Definition Solver.java:1501
Constraint makeCover(IntervalVar[] vars, IntervalVar target_var)
Definition Solver.java:2512
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst)
Definition Solver.java:1529
Constraint makeSortingConstraint(IntVar[] vars, IntVar[] sorted)
Definition Solver.java:1888
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2707
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3)
Definition Solver.java:3091
IntExpr makeElement(IntVar[] vars, IntVar index)
Definition Solver.java:1019
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator)
Definition Solver.java:3284
IntExpr makeProd(IntExpr expr, long value)
Definition Solver.java:924
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed)
Definition Solver.java:3653
IntExpr makeDiv(IntExpr numerator, IntExpr denominator)
Definition Solver.java:940
Constraint makeEquality(IntervalVar var1, IntervalVar var2)
Definition Solver.java:2520
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2)
Definition Solver.java:3086
Constraint makeIndexOfFirstMinValueConstraint(IntVar index, IntVar[] vars)
Definition Solver.java:1951
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum)
Definition Solver.java:3945
IntVar[] makeBoolVarArray(int count, String name)
Definition Solver.java:153
IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost)
Definition Solver.java:1108
IntervalVar makeIntervalRelaxedMin(IntervalVar interval_var)
Definition Solver.java:2318
RegularLimit makeTimeLimit(SWIGTYPE_p_absl__Duration time)
Definition Solver.java:2826
LocalSearchOperator MultiArmedBanditConcatenateOperators(LocalSearchOperator[] ops, double memory_coefficient, double exploration_coefficient, boolean maximize)
Definition Solver.java:3757
IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2261
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst)
Definition Solver.java:1554
Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value)
Definition Solver.java:1974
RegularLimit makeLimit(com.google.ortools.constraintsolver.RegularLimitParameters proto)
Definition Solver.java:2893
boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:561
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name)
Definition Solver.java:2215
SearchMonitor makeLubyRestart(int scale_factor)
Definition Solver.java:2809
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step)
Definition Solver.java:2715
ObjectiveMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature)
Definition Solver.java:2785
SearchMonitor makeAtSolutionCallback(Runnable callback)
Definition Solver.java:3052
RegularLimit makeSolutionsLimit(long solutions)
Definition Solver.java:2858
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op)
Definition Solver.java:3634
Constraint makeLess(IntExpr expr, long value)
Definition Solver.java:1493
Constraint makeIndexOfFirstMaxValueConstraint(IntVar index, IntVar[] vars)
Definition Solver.java:1942
SearchMonitor makeSearchLog(int branch_period, IntVar[] vars, Supplier< String > display_callback)
Definition Solver.java:3007
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative)
Definition Solver.java:2867
Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status)
Definition Solver.java:2084
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check)
Definition Solver.java:2903
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name)
Definition Solver.java:2424
IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2294
IntVar makeIsLessVar(IntExpr left, IntExpr right)
Definition Solver.java:1469
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager)
Definition Solver.java:3886
Constraint MakeIsLexicalLessOrEqualWithOffsetsCt(IntVar[] left, IntVar[] right, long[] offsets, IntVar boolvar)
Definition Solver.java:1922
IntExpr makeMin(IntExpr expr, long value)
Definition Solver.java:1060
Constraint makeGreaterOrEqual(IntExpr expr, int value)
Definition Solver.java:1389
Pack makePack(IntVar[] vars, int number_of_bins)
Definition Solver.java:2195
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:2183
IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step)
Definition Solver.java:1117
OptimizeVar makeMinimize(IntVar v, long step)
Definition Solver.java:2665
IntervalVar registerIntervalVar(IntervalVar var)
Definition Solver.java:4127
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition Solver.java:3482
Decision MakeAssignVariableValueOrDoNothing(IntVar var, long value)
Definition Solver.java:3129
IntVar makeIntVar(long min, long max, String name)
Definition Solver.java:772
SearchMonitor makeExitSearchCallback(Runnable callback)
Definition Solver.java:3047
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str)
Definition Solver.java:3336
IntVar makeIsGreaterOrEqualCstVar(IntExpr var, long value)
Definition Solver.java:1349
boolean checkAssignment(Assignment solution)
Definition Solver.java:604
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:3593
RegularLimit makeTimeLimit(long time_in_ms)
Definition Solver.java:2831
Constraint makeBetweenCt(IntExpr expr, long l, long u)
Definition Solver.java:1648
DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str)
Definition Solver.java:3331
IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition Solver.java:2272
DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str)
Definition Solver.java:3274
SolutionCollector makeFirstSolutionCollector()
Definition Solver.java:2553
void accept(ModelVisitor visitor)
Definition Solver.java:4061
Constraint makeInversePermutationConstraint(IntVar[] left, IntVar[] right)
Definition Solver.java:1933
Demon makeDelayedConstraintInitialPropagateCallback(Constraint ct)
Definition Solver.java:1632
boolean checkConstraint(Constraint ct)
Definition Solver.java:613
Constraint makeGreater(IntExpr expr, int value)
Definition Solver.java:1445
Decision makeRankLastInterval(SequenceVar sequence, int index)
Definition Solver.java:3383
void addLocalSearchMonitor(LocalSearchMonitor monitor)
Definition Solver.java:4210
Constraint makeNonEquality(IntExpr expr, int value)
Definition Solver.java:1277
Constraint makeIsGreaterCt(IntExpr left, IntExpr right, IntVar b)
Definition Solver.java:1421
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions)
Definition Solver.java:2885
IntVar makeIsLessOrEqualVar(IntExpr left, IntExpr right)
Definition Solver.java:1301
boolean solveAndCommit(DecisionBuilder db)
Definition Solver.java:569
Constraint makeIntervalVarRelation(IntervalVar t, int r, long d)
Definition Solver.java:2351
Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max)
Definition Solver.java:1807
void addPropagationMonitor(PropagationMonitor monitor)
Definition Solver.java:4194
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str)
Definition Solver.java:3409
Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards)
Definition Solver.java:1770
RegularLimit makeLimit(SWIGTYPE_p_absl__Duration time, long branches, long failures, long solutions, boolean smart_time_check)
Definition Solver.java:2876
Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards)
Definition Solver.java:1762
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager)
Definition Solver.java:3913
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition Solver.java:3868
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition Solver.java:3491
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition Solver.java:471
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2)
Definition Solver.java:3536
IntExpr makePower(IntExpr expr, long n)
Definition Solver.java:964
Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1173
IntVar makeIsLessCstVar(IntExpr var, long value)
Definition Solver.java:1461
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition Solver.java:3804
SearchMonitor makeEnterSearchCallback(Runnable callback)
Definition Solver.java:3042
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, boolean restart)
Definition Solver.java:3719
IntVar makeIsEqualVar(IntExpr v1, IntExpr v2)
Definition Solver.java:1197
RegularLimit makeFailuresLimit(long failures)
Definition Solver.java:2849
Constraint makeGreater(IntExpr expr, long value)
Definition Solver.java:1437
IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name)
Definition Solver.java:2206
SolutionCollector makeAllSolutionCollector(Assignment assignment)
Definition Solver.java:2648
Constraint makeEquality(IntExpr expr, int value)
Definition Solver.java:1221
ObjectiveMonitor makeTabuSearch(boolean maximize, IntVar objective, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor)
Definition Solver.java:2763
Constraint makeLess(IntExpr left, IntExpr right)
Definition Solver.java:1485
IntVar makeIsGreaterOrEqualVar(IntExpr left, IntExpr right)
Definition Solver.java:1357
SolutionCollector MakeNBestLexicographicValueSolutionCollector(int solution_count, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2640
void newSearch(DecisionBuilder db)
Definition Solver.java:498
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition Solver.java:3190
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name)
Definition Solver.java:2440
Constraint makeIsDifferentCstCt(IntExpr v1, IntExpr v2, IntVar b)
Definition Solver.java:1253
Constraint makeGreaterOrEqual(IntExpr expr, long value)
Definition Solver.java:1381
Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1229
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition Solver.java:2039
Constraint makeEquality(IntExpr left, IntExpr right)
Definition Solver.java:1205
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator)
Definition Solver.java:3293
Constraint makeMapDomain(IntVar var, IntVar[] actives)
Definition Solver.java:2094
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops)
Definition Solver.java:3714
IntExpr makeDifference(IntExpr left, IntExpr right)
Definition Solver.java:892
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:3500
DecisionBuilder compose(DecisionBuilder[] dbs)
Definition Solver.java:3202
OptimizeVar MakeLexicographicOptimize(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] variables, long[] steps)
Definition Solver.java:2740
SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier< String > display_callback)
Definition Solver.java:2998
Constraint makeElementEquality(IntVar[] vars, IntVar index, long target)
Definition Solver.java:1594
IntExpr makeMax(IntExpr expr, long value)
Definition Solver.java:1092
Constraint makeLessOrEqual(IntExpr left, IntExpr right)
Definition Solver.java:1317
Constraint makeAllDifferent(IntVar[] vars)
Definition Solver.java:1847
IntExpr makeDiv(IntExpr expr, long value)
Definition Solver.java:932
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition Solver.java:530
Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar)
Definition Solver.java:1728
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths)
Definition Solver.java:2011
Decision makeRankFirstInterval(SequenceVar sequence, int index)
Definition Solver.java:3374
Constraint makeFalseConstraint(String explanation)
Definition Solver.java:1165
IntExpr makeSum(IntExpr left, IntExpr right)
Definition Solver.java:852
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1)
Definition Solver.java:3464
IntExpr makeMax(IntExpr expr, int value)
Definition Solver.java:1100
Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation)
Definition Solver.java:1857
IntExpr makeSum(IntExpr expr, long value)
Definition Solver.java:860
DecisionBuilder makePhase(IntervalVar[] intervals, int str)
Definition Solver.java:3417
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition Solver.java:3238
Decision makeScheduleOrExpedite(IntervalVar var, long est, SWIGTYPE_p_long marker)
Definition Solver.java:3365
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name)
Definition Solver.java:2486
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition Solver.java:3303
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:577
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:2954
boolean solve(DecisionBuilder db, SearchMonitor[] monitors)
Definition Solver.java:431
static com.google.ortools.constraintsolver.ConstraintSolverParameters defaultSolverParameters()
Definition Solver.java:327
DecisionBuilder makeLocalSearchPhase(SequenceVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition Solver.java:3826
SearchMonitor makeSearchLog(int branch_period, IntVar var)
Definition Solver.java:2980
Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends)
Definition Solver.java:1707
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator)
Definition Solver.java:3298
Constraint makeIsEqualVar(IntExpr v1, IntExpr v2, IntVar b)
Definition Solver.java:1189
boolean solve(DecisionBuilder db)
Definition Solver.java:439
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator)
Definition Solver.java:2061
boolean solve(DecisionBuilder db, SearchMonitor m1)
Definition Solver.java:447
void SetUseFastLocalSearch(boolean use_fast_local_search)
Definition Solver.java:4081
Constraint makeLexicalLessOrEqual(IntVar[] left, IntVar[] right)
Definition Solver.java:1906
Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value)
Definition Solver.java:1866
DecisionBuilder tryDecisions(DecisionBuilder[] dbs)
Definition Solver.java:3261
DecisionBuilder makeDefaultPhase(IntVar[] vars, DefaultPhaseParameters parameters)
Definition Solver.java:3318
IntExpr makeMin(IntExpr left, IntExpr right)
Definition Solver.java:1052
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition Solver.java:3877
SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize)
Definition Solver.java:2621
com.google.ortools.constraintsolver.RegularLimitParameters makeDefaultRegularLimitParameters()
Definition Solver.java:2916
OptimizeVar makeMaximize(IntVar v, long step)
Definition Solver.java:2673
Constraint makeLessOrEqual(IntExpr expr, long value)
Definition Solver.java:1325
DecisionBuilder makeConstraintAdder(Constraint ct)
Definition Solver.java:3444
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler)
Definition Solver.java:1990
Assignment RunUncheckedLocalSearch(Assignment initial_solution, LocalSearchFilterManager filter_manager, LocalSearchOperator ls_operator, SearchMonitor[] monitors, RegularLimit limit)
Definition Solver.java:3852
Constraint makeNonEquality(IntExpr left, IntExpr right)
Definition Solver.java:1261
BaseObjectiveMonitor MakeRoundRobinCompoundObjectiveMonitor(SWIGTYPE_p_std__vectorT_operations_research__BaseObjectiveMonitor_p_t monitors, int num_max_local_optima_before_metaheuristic_switch)
Definition Solver.java:2799
boolean hasName(PropagationBaseObject object)
Definition Solver.java:4095
IntVar makeIntVar(int[] values, String name)
Definition Solver.java:788
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator)
Definition Solver.java:2074
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var)
Definition Solver.java:3016
Constraint makeElementEquality(long[] vals, IntVar index, IntVar target)
Definition Solver.java:1579
Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max)
Definition Solver.java:1817
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:514
Constraint makeDistribute(IntVar[] vars, IntVar[] cards)
Definition Solver.java:1778
IntExpr makeDifference(long value, IntExpr expr)
Definition Solver.java:900
Solver(String name, com.google.ortools.constraintsolver.ConstraintSolverParameters parameters)
Definition Solver.java:300
DecisionBuilder makeLocalSearchPhase(Assignment assignment, LocalSearchPhaseParameters parameters)
Definition Solver.java:3799
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target)
Definition Solver.java:1539
IntVar makeIntVar(long min, long max)
Definition Solver.java:796
SearchMonitor makeSymmetryManager(SymmetryBreaker v1)
Definition Solver.java:3081
SearchMonitor makeConstantRestart(int frequency)
Definition Solver.java:2818
IntExpr makeElement(LongUnaryOperator values, IntVar index)
Definition Solver.java:990
LocalSearchOperator makeOperator(IntVar[] vars, LongTernaryOperator evaluator, int op)
Definition Solver.java:3629
IntExpr makeModulo(IntExpr x, IntExpr mod)
Definition Solver.java:1136
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops)
Definition Solver.java:3733
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition Solver.java:3895
Constraint makeAllowedAssignment(IntVar[] vars, IntTupleSet tuples)
Definition Solver.java:2105
Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target)
Definition Solver.java:1613
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:3841
Constraint makeGreater(IntExpr left, IntExpr right)
Definition Solver.java:1429
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:2178
Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition Solver.java:1341
void set_optimization_direction(int direction)
Definition Solver.java:757
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str)
Definition Solver.java:3341
LocalSearchOperator makeOperator(IntVar[] vars, int op)
Definition Solver.java:3609
IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index)
Definition Solver.java:1003
Decision makeAssignVariableValueOrFail(IntVar var, long value)
Definition Solver.java:3124
Constraint makeMaxEquality(IntVar[] vars, IntVar max_var)
Definition Solver.java:1574
Constraint makeSumEquality(IntVar[] vars, long cst)
Definition Solver.java:1519
Constraint makeNotMemberCt(IntExpr expr, long[] values)
Definition Solver.java:1694
Decision makeAssignVariableValue(IntVar var, long val)
Definition Solver.java:3104
void keepAliveDecisionBuilder(DecisionBuilder db)
Definition Solver.java:198
Constraint MakeLexicalLessOrEqualWithOffsets(IntVar[] left, IntVar[] right, long[] offsets)
Definition Solver.java:1917
DecisionBuilder makeDefaultPhase(IntVar[] vars)
Definition Solver.java:3313
Constraint makeEquality(IntExpr expr, long value)
Definition Solver.java:1213
LocalSearchOperator makeNeighborhoodLimit(LocalSearchOperator op, long limit)
Definition Solver.java:3769
Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition Solver.java:2048
long GetGuidedLocalSearchPenalty(long i, long j, long k)
Definition Solver.java:765
boolean AcceptSolution(SWIGTYPE_p_operations_research__Search search)
Definition Solver.java:4214
Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst)
Definition Solver.java:1564
IntVar[] makeIntVarArray(int count, long min, long max, String name)
Definition Solver.java:136
SolutionCollector MakeBestLexicographicValueSolutionCollector(Assignment assignment, SWIGTYPE_p_std__vectorT_bool_t maximize)
Definition Solver.java:2590
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:2768
SolutionCollector makeLastSolutionCollector(Assignment assignment)
Definition Solver.java:2561
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name)
Definition Solver.java:2500
ObjectiveMonitor MakeLexicographicSimulatedAnnealing(SWIGTYPE_p_std__vectorT_bool_t maximize, IntVar[] vars, long[] steps, long[] initial_temperatures)
Definition Solver.java:2790
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition Solver.java:3554
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:3619
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2)
Definition Solver.java:3228
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition Solver.java:3249
DecisionBuilder makeRestoreAssignment(Assignment assignment)
Definition Solver.java:3576
Demon makeConstraintInitialPropagateCallback(Constraint ct)
Definition Solver.java:1622
Decision makeDecision(Consumer< Solver > apply, Consumer< Solver > refute)
Definition Solver.java:3154
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op)
Definition Solver.java:3624
com.google.ortools.constraintsolver.ConstraintSolverParameters parameters()
Definition Solver.java:307
DisjunctiveConstraint makeDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition Solver.java:2398
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2, IntVar alt)
Definition Solver.java:2380
Decision makeVariableLessOrEqualValue(IntVar var, long value)
Definition Solver.java:3109
IntVar[] makeIntVarArray(int count, long min, long max)
Definition Solver.java:128
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition Solver.java:3308
IntVar makeIsBetweenVar(IntExpr v, long l, long u)
Definition Solver.java:1672
IntExpr makeScalProd(IntVar[] vars, int[] coefs)
Definition Solver.java:884
IntVar makeIntConst(long val, String name)
Definition Solver.java:836
Demon makeClosureDemon(Runnable closure)
Definition Solver.java:1640
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2690
Constraint makeNonEquality(IntExpr expr, long value)
Definition Solver.java:1269
IntVar makeIsGreaterVar(IntExpr left, IntExpr right)
Definition Solver.java:1413
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states)
Definition Solver.java:2119
SearchMonitor makeSearchLog(int branch_period, Supplier< String > display_callback)
Definition Solver.java:2989
Constraint makeIsGreaterCstCt(IntExpr v, long c, IntVar b)
Definition Solver.java:1397
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional)
Definition Solver.java:162
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step)
Definition Solver.java:2723
Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target)
Definition Solver.java:1589
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition Solver.java:455
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier< String > display_callback)
Definition Solver.java:3025
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative)
Definition Solver.java:2898
Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max)
Definition Solver.java:1827
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition Solver.java:522
DecisionBuilder makeStoreAssignment(Assignment assignment)
Definition Solver.java:3585
IntVar makeIsGreaterCstVar(IntExpr var, long value)
Definition Solver.java:1405
void keepAliveDecisionBuilder(DecisionBuilder[] dbs)
Definition Solver.java:204
IntVar makeIsMemberVar(IntExpr expr, int[] values)
Definition Solver.java:1738
IntExpr makeIndexExpression(IntVar[] vars, long value)
Definition Solver.java:1028
IntExpr makeScalProd(IntVar[] vars, long[] coefs)
Definition Solver.java:876
Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition Solver.java:2148
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active)
Definition Solver.java:2006
DecisionBuilder MakeProfiledDecisionBuilderWrapper(DecisionBuilder db)
Definition Solver.java:4288
IntervalVar makeMirrorInterval(IntervalVar interval_var)
Definition Solver.java:2250
DecisionBuilder makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars)
Definition Solver.java:3431
OptimizeVar makeOptimize(boolean maximize, IntVar v, long step)
Definition Solver.java:2681