Java Reference

Java Reference

Solver.java
Go to the documentation of this file.
1 /* ----------------------------------------------------------------------------
2  * This file was automatically generated by SWIG (http://www.swig.org).
3  * Version 4.0.2
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 
9 package com.google.ortools.constraintsolver;
10 
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
16 import 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
19 import java.util.function.BooleanSupplier;
20 
21 // Used to wrap IndexEvaluator1 (std::function<int64(int64)>)
22 // see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongUnaryOperator.html
23 import java.util.function.LongUnaryOperator;
24 // Used to wrap IndexEvaluator2 (std::function<int64(int64, int64)>)
25 // see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongBinaryOperator.html
26 import java.util.function.LongBinaryOperator;
27 // Used to wrap IndexEvaluator3 (std::function<int64(int64, int64, int64)>)
28 // note: Java does not provide TernaryOperator so we provide it.
30 // Used to wrap std::function<int64(int, int)>
31 // note: Java does not provide it, so we provide it.
33 
34 // Used to wrap IndexFilter1 (std::function<bool(int64)>)
35 // see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongPredicate.html
36 import java.util.function.LongPredicate;
37 
38 // Used to wrap std::function<bool(int64, int64, int64)>
39 // note: Java does not provide TernaryPredicate so we provide it
41 
42 // Used to wrap std::function<void(Solver*)>
43 // see https://docs.oracle.com/javase/8/docs/api/java/util/function/Consumer.html
44 import java.util.function.Consumer;
45 
46 // Used to wrap ObjectiveWatcher (std::function<void(int64)>)
47 // see https://docs.oracle.com/javase/8/docs/api/java/util/function/LongConsumer.html
48 import 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
52 import java.lang.Runnable;
53 
54 public class Solver {
55  private transient long swigCPtr;
56  protected transient boolean swigCMemOwn;
57 
58  protected Solver(long cPtr, boolean cMemoryOwn) {
59  swigCMemOwn = cMemoryOwn;
60  swigCPtr = cPtr;
61  }
62 
63  protected static long getCPtr(Solver obj) {
64  return (obj == null) ? 0 : obj.swigCPtr;
65  }
66 
67  @SuppressWarnings("deprecation")
68  protected void finalize() {
69  delete();
70  }
71 
72  public synchronized void delete() {
73  if (swigCPtr != 0) {
74  if (swigCMemOwn) {
75  swigCMemOwn = false;
76  mainJNI.delete_Solver(swigCPtr);
77  }
78  swigCPtr = 0;
79  }
80  }
81 
85  public static class FailException extends Exception {
86  public FailException() {
87  super();
88  }
89 
90  public FailException(String message) {
91  super(message);
92  }
93  }
94 
95  public IntVar[] makeIntVarArray(int count, long min, long max) {
96  IntVar[] array = new IntVar[count];
97  for (int i = 0; i < count; ++i) {
98  array[i] = makeIntVar(min, max);
99  }
100  return array;
101  }
102 
103  public IntVar[] makeIntVarArray(int count, long min, long max, String name) {
104  IntVar[] array = new IntVar[count];
105  for (int i = 0; i < count; ++i) {
106  String var_name = name + i;
107  array[i] = makeIntVar(min, max, var_name);
108  }
109  return array;
110  }
111 
112  public IntVar[] makeBoolVarArray(int count) {
113  IntVar[] array = new IntVar[count];
114  for (int i = 0; i < count; ++i) {
115  array[i] = makeBoolVar();
116  }
117  return array;
118  }
119 
120  public IntVar[] makeBoolVarArray(int count, String name) {
121  IntVar[] array = new IntVar[count];
122  for (int i = 0; i < count; ++i) {
123  String var_name = name + i;
124  array[i] = makeBoolVar(var_name);
125  }
126  return array;
127  }
128 
130  long start_min,
131  long start_max,
132  long duration,
133  boolean optional) {
134  IntervalVar[] array = new IntervalVar[count];
135  for (int i = 0; i < count; ++i) {
136  array[i] = makeFixedDurationIntervalVar(start_min,
137  start_max,
138  duration,
139  optional,
140  "");
141  }
142  return array;
143  }
144 
146  long start_min,
147  long start_max,
148  long duration,
149  boolean optional,
150  String name) {
151  IntervalVar[] array = new IntervalVar[count];
152  for (int i = 0; i < count; ++i) {
153  array[i] = makeFixedDurationIntervalVar(start_min,
154  start_max,
155  duration,
156  optional,
157  name + i);
158  }
159  return array;
160  }
161 
162  static public class IntegerCastInfo {
163  private transient long swigCPtr;
164  protected transient boolean swigCMemOwn;
165 
166  protected IntegerCastInfo(long cPtr, boolean cMemoryOwn) {
167  swigCMemOwn = cMemoryOwn;
168  swigCPtr = cPtr;
169  }
170 
171  protected static long getCPtr(IntegerCastInfo obj) {
172  return (obj == null) ? 0 : obj.swigCPtr;
173  }
174 
175  @SuppressWarnings("deprecation")
176  protected void finalize() {
177  delete();
178  }
179 
180  public synchronized void delete() {
181  if (swigCPtr != 0) {
182  if (swigCMemOwn) {
183  swigCMemOwn = false;
184  mainJNI.delete_Solver_IntegerCastInfo(swigCPtr);
185  }
186  swigCPtr = 0;
187  }
188  }
189 
190  public IntegerCastInfo() {
191  this(mainJNI.new_Solver_IntegerCastInfo__SWIG_0(), true);
192  }
193 
195  this(mainJNI.new_Solver_IntegerCastInfo__SWIG_1(IntVar.getCPtr(v), v, IntExpr.getCPtr(e), e, Constraint.getCPtr(c), c), true);
196  }
197 
198  public void setVariable(IntVar value) {
199  mainJNI.Solver_IntegerCastInfo_variable_set(swigCPtr, this, IntVar.getCPtr(value), value);
200  }
201 
202  public IntVar getVariable() {
203  long cPtr = mainJNI.Solver_IntegerCastInfo_variable_get(swigCPtr, this);
204  return (cPtr == 0) ? null : new IntVar(cPtr, false);
205  }
206 
207  public void setExpression(IntExpr value) {
208  mainJNI.Solver_IntegerCastInfo_expression_set(swigCPtr, this, IntExpr.getCPtr(value), value);
209  }
210 
212  long cPtr = mainJNI.Solver_IntegerCastInfo_expression_get(swigCPtr, this);
213  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
214  }
215 
216  public void setMaintainer(Constraint value) {
217  mainJNI.Solver_IntegerCastInfo_maintainer_set(swigCPtr, this, Constraint.getCPtr(value), value);
218  }
219 
221  long cPtr = mainJNI.Solver_IntegerCastInfo_maintainer_get(swigCPtr, this);
222  return (cPtr == 0) ? null : new Constraint(cPtr, false);
223  }
224 
225  }
226 
227  public Solver(String name) {
228  this(mainJNI.new_Solver__SWIG_0(name), true);
229  }
230 
232  this(mainJNI.new_Solver__SWIG_1(name, parameters.toByteArray()), true);
233  }
234 
236  byte[] buf = mainJNI.Solver_parameters(swigCPtr, this);
237  if (buf == null || buf.length == 0) {
238  return null;
239  }
240  try {
242  } catch (com.google.protobuf.InvalidProtocolBufferException e) {
243  throw new RuntimeException(
244  "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
245  }
246 }
247 
249  byte[] buf = mainJNI.Solver_defaultSolverParameters();
250  if (buf == null || buf.length == 0) {
251  return null;
252  }
253  try {
255  } catch (com.google.protobuf.InvalidProtocolBufferException e) {
256  throw new RuntimeException(
257  "Unable to parse com.google.ortools.constraintsolver.ConstraintSolverParameters protocol message.");
258  }
259 }
260 
261  public void addConstraint(Constraint c) {
262  mainJNI.Solver_addConstraint(swigCPtr, this, Constraint.getCPtr(c), c);
263  }
264 
265  public void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr) {
266  mainJNI.Solver_addCastConstraint(swigCPtr, this, CastConstraint.getCPtr(constraint), constraint, IntVar.getCPtr(target_var), target_var, IntExpr.getCPtr(expr), expr);
267  }
268 
269  public boolean solve(DecisionBuilder db, SearchMonitor[] monitors) {
270  return mainJNI.Solver_solve__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
271  }
272 
273  public boolean solve(DecisionBuilder db) {
274  return mainJNI.Solver_solve__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
275  }
276 
277  public boolean solve(DecisionBuilder db, SearchMonitor m1) {
278  return mainJNI.Solver_solve__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
279  }
280 
281  public boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2) {
282  return mainJNI.Solver_solve__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
283  }
284 
286  return mainJNI.Solver_solve__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
287  }
288 
290  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);
291  }
292 
293  public void newSearch(DecisionBuilder db, SearchMonitor[] monitors) {
294  mainJNI.Solver_newSearch__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
295  }
296 
297  public void newSearch(DecisionBuilder db) {
298  mainJNI.Solver_newSearch__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
299  }
300 
302  mainJNI.Solver_newSearch__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
303  }
304 
306  mainJNI.Solver_newSearch__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
307  }
308 
310  mainJNI.Solver_newSearch__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
311  }
312 
314  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);
315  }
316 
317  public boolean nextSolution() {
318  return mainJNI.Solver_nextSolution(swigCPtr, this);
319  }
320 
321  public void restartSearch() {
322  mainJNI.Solver_restartSearch(swigCPtr, this);
323  }
324 
325  public void endSearch() {
326  mainJNI.Solver_endSearch(swigCPtr, this);
327  }
328 
329  public boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors) {
330  return mainJNI.Solver_solveAndCommit__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
331  }
332 
333  public boolean solveAndCommit(DecisionBuilder db) {
334  return mainJNI.Solver_solveAndCommit__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
335  }
336 
338  return mainJNI.Solver_solveAndCommit__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1);
339  }
340 
342  return mainJNI.Solver_solveAndCommit__SWIG_3(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2);
343  }
344 
346  return mainJNI.Solver_solveAndCommit__SWIG_4(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(m1), m1, SearchMonitor.getCPtr(m2), m2, SearchMonitor.getCPtr(m3), m3);
347  }
348 
349  public boolean checkAssignment(Assignment solution) {
350  return mainJNI.Solver_checkAssignment(swigCPtr, this, Assignment.getCPtr(solution), solution);
351  }
352 
353  public boolean checkConstraint(Constraint ct) {
354  return mainJNI.Solver_checkConstraint(swigCPtr, this, Constraint.getCPtr(ct), ct);
355  }
356 
357  public int state() {
358  return mainJNI.Solver_state(swigCPtr, this);
359  }
360 
361  public void fail() {
362  mainJNI.Solver_fail(swigCPtr, this);
363  }
364 
365  public String toString() {
366  return mainJNI.Solver_toString(swigCPtr, this);
367  }
368 
369  public static long memoryUsage() {
370  return mainJNI.Solver_memoryUsage();
371  }
372 
373  public long wallTime() {
374  return mainJNI.Solver_wallTime(swigCPtr, this);
375  }
376 
377  public long branches() {
378  return mainJNI.Solver_branches(swigCPtr, this);
379  }
380 
381  public long solutions() {
382  return mainJNI.Solver_solutions(swigCPtr, this);
383  }
384 
385  public long unchecked_solutions() {
386  return mainJNI.Solver_unchecked_solutions(swigCPtr, this);
387  }
388 
389  public long demon_runs(int p) {
390  return mainJNI.Solver_demon_runs(swigCPtr, this, p);
391  }
392 
393  public long failures() {
394  return mainJNI.Solver_failures(swigCPtr, this);
395  }
396 
397  public long neighbors() {
398  return mainJNI.Solver_neighbors(swigCPtr, this);
399  }
400 
401  public long filteredNeighbors() {
402  return mainJNI.Solver_filteredNeighbors(swigCPtr, this);
403  }
404 
405  public long acceptedNeighbors() {
406  return mainJNI.Solver_acceptedNeighbors(swigCPtr, this);
407  }
408 
409  public long stamp() {
410  return mainJNI.Solver_stamp(swigCPtr, this);
411  }
412 
413  public long fail_stamp() {
414  return mainJNI.Solver_fail_stamp(swigCPtr, this);
415  }
416 
417  public int optimization_direction() {
418  return mainJNI.Solver_optimization_direction(swigCPtr, this);
419  }
420 
421  public void set_optimization_direction(int direction) {
422  mainJNI.Solver_set_optimization_direction(swigCPtr, this, direction);
423  }
424 
425  public IntVar makeIntVar(long min, long max, String name) {
426  long cPtr = mainJNI.Solver_makeIntVar__SWIG_0(swigCPtr, this, min, max, name);
427  return (cPtr == 0) ? null : new IntVar(cPtr, false);
428  }
429 
430  public IntVar makeIntVar(long[] values, String name) {
431  long cPtr = mainJNI.Solver_makeIntVar__SWIG_1(swigCPtr, this, values, name);
432  return (cPtr == 0) ? null : new IntVar(cPtr, false);
433  }
434 
435  public IntVar makeIntVar(int[] values, String name) {
436  long cPtr = mainJNI.Solver_makeIntVar__SWIG_2(swigCPtr, this, values, name);
437  return (cPtr == 0) ? null : new IntVar(cPtr, false);
438  }
439 
440  public IntVar makeIntVar(long min, long max) {
441  long cPtr = mainJNI.Solver_makeIntVar__SWIG_3(swigCPtr, this, min, max);
442  return (cPtr == 0) ? null : new IntVar(cPtr, false);
443  }
444 
445  public IntVar makeIntVar(long[] values) {
446  long cPtr = mainJNI.Solver_makeIntVar__SWIG_4(swigCPtr, this, values);
447  return (cPtr == 0) ? null : new IntVar(cPtr, false);
448  }
449 
450  public IntVar makeIntVar(int[] values) {
451  long cPtr = mainJNI.Solver_makeIntVar__SWIG_5(swigCPtr, this, values);
452  return (cPtr == 0) ? null : new IntVar(cPtr, false);
453  }
454 
455  public IntVar makeBoolVar(String name) {
456  long cPtr = mainJNI.Solver_makeBoolVar__SWIG_0(swigCPtr, this, name);
457  return (cPtr == 0) ? null : new IntVar(cPtr, false);
458  }
459 
460  public IntVar makeBoolVar() {
461  long cPtr = mainJNI.Solver_makeBoolVar__SWIG_1(swigCPtr, this);
462  return (cPtr == 0) ? null : new IntVar(cPtr, false);
463  }
464 
465  public IntVar makeIntConst(long val, String name) {
466  long cPtr = mainJNI.Solver_makeIntConst__SWIG_0(swigCPtr, this, val, name);
467  return (cPtr == 0) ? null : new IntVar(cPtr, false);
468  }
469 
470  public IntVar makeIntConst(long val) {
471  long cPtr = mainJNI.Solver_makeIntConst__SWIG_1(swigCPtr, this, val);
472  return (cPtr == 0) ? null : new IntVar(cPtr, false);
473  }
474 
475  public IntExpr makeSum(IntExpr left, IntExpr right) {
476  long cPtr = mainJNI.Solver_makeSum__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
477  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
478  }
479 
480  public IntExpr makeSum(IntExpr expr, long value) {
481  long cPtr = mainJNI.Solver_makeSum__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
482  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
483  }
484 
485  public IntExpr makeSum(IntVar[] vars) {
486  long cPtr = mainJNI.Solver_makeSum__SWIG_2(swigCPtr, this, vars);
487  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
488  }
489 
490  public IntExpr makeScalProd(IntVar[] vars, long[] coefs) {
491  long cPtr = mainJNI.Solver_makeScalProd__SWIG_0(swigCPtr, this, vars, coefs);
492  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
493  }
494 
495  public IntExpr makeScalProd(IntVar[] vars, int[] coefs) {
496  long cPtr = mainJNI.Solver_makeScalProd__SWIG_1(swigCPtr, this, vars, coefs);
497  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
498  }
499 
500  public IntExpr makeDifference(IntExpr left, IntExpr right) {
501  long cPtr = mainJNI.Solver_makeDifference__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
502  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
503  }
504 
505  public IntExpr makeDifference(long value, IntExpr expr) {
506  long cPtr = mainJNI.Solver_makeDifference__SWIG_1(swigCPtr, this, value, IntExpr.getCPtr(expr), expr);
507  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
508  }
509 
510  public IntExpr makeOpposite(IntExpr expr) {
511  long cPtr = mainJNI.Solver_makeOpposite(swigCPtr, this, IntExpr.getCPtr(expr), expr);
512  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
513  }
514 
515  public IntExpr makeProd(IntExpr left, IntExpr right) {
516  long cPtr = mainJNI.Solver_makeProd__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
517  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
518  }
519 
520  public IntExpr makeProd(IntExpr expr, long value) {
521  long cPtr = mainJNI.Solver_makeProd__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
522  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
523  }
524 
525  public IntExpr makeDiv(IntExpr expr, long value) {
526  long cPtr = mainJNI.Solver_makeDiv__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
527  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
528  }
529 
530  public IntExpr makeDiv(IntExpr numerator, IntExpr denominator) {
531  long cPtr = mainJNI.Solver_makeDiv__SWIG_1(swigCPtr, this, IntExpr.getCPtr(numerator), numerator, IntExpr.getCPtr(denominator), denominator);
532  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
533  }
534 
535  public IntExpr makeAbs(IntExpr expr) {
536  long cPtr = mainJNI.Solver_makeAbs(swigCPtr, this, IntExpr.getCPtr(expr), expr);
537  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
538  }
539 
540  public IntExpr makeSquare(IntExpr expr) {
541  long cPtr = mainJNI.Solver_makeSquare(swigCPtr, this, IntExpr.getCPtr(expr), expr);
542  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
543  }
544 
545  public IntExpr makePower(IntExpr expr, long n) {
546  long cPtr = mainJNI.Solver_makePower(swigCPtr, this, IntExpr.getCPtr(expr), expr, n);
547  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
548  }
549 
550  public IntExpr makeElement(long[] values, IntVar index) {
551  long cPtr = mainJNI.Solver_makeElement__SWIG_0(swigCPtr, this, values, IntVar.getCPtr(index), index);
552  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
553  }
554 
555  public IntExpr makeElement(int[] values, IntVar index) {
556  long cPtr = mainJNI.Solver_makeElement__SWIG_1(swigCPtr, this, values, IntVar.getCPtr(index), index);
557  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
558  }
559 
560  public IntExpr makeElement(LongUnaryOperator values, IntVar index) {
561  long cPtr = mainJNI.Solver_makeElement__SWIG_2(swigCPtr, this, values, IntVar.getCPtr(index), index);
562  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
563  }
564 
565  public IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index) {
566  long cPtr = mainJNI.Solver_makeMonotonicElement(swigCPtr, this, values, increasing, IntVar.getCPtr(index), index);
567  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
568  }
569 
570  public IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2) {
571  long cPtr = mainJNI.Solver_makeElement__SWIG_3(swigCPtr, this, values, IntVar.getCPtr(index1), index1, IntVar.getCPtr(index2), index2);
572  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
573  }
574 
575  public IntExpr makeElement(IntVar[] vars, IntVar index) {
576  long cPtr = mainJNI.Solver_makeElement__SWIG_4(swigCPtr, this, vars, IntVar.getCPtr(index), index);
577  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
578  }
579 
580  public IntExpr makeIndexExpression(IntVar[] vars, long value) {
581  long cPtr = mainJNI.Solver_makeIndexExpression(swigCPtr, this, vars, value);
582  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
583  }
584 
585  public Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var) {
586  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);
587  return (cPtr == 0) ? null : new Constraint(cPtr, false);
588  }
589 
590  public IntExpr makeMin(IntVar[] vars) {
591  long cPtr = mainJNI.Solver_makeMin__SWIG_0(swigCPtr, this, vars);
592  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
593  }
594 
595  public IntExpr makeMin(IntExpr left, IntExpr right) {
596  long cPtr = mainJNI.Solver_makeMin__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
597  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
598  }
599 
600  public IntExpr makeMin(IntExpr expr, long value) {
601  long cPtr = mainJNI.Solver_makeMin__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
602  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
603  }
604 
605  public IntExpr makeMin(IntExpr expr, int value) {
606  long cPtr = mainJNI.Solver_makeMin__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
607  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
608  }
609 
610  public IntExpr makeMax(IntVar[] vars) {
611  long cPtr = mainJNI.Solver_makeMax__SWIG_0(swigCPtr, this, vars);
612  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
613  }
614 
615  public IntExpr makeMax(IntExpr left, IntExpr right) {
616  long cPtr = mainJNI.Solver_makeMax__SWIG_1(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
617  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
618  }
619 
620  public IntExpr makeMax(IntExpr expr, long value) {
621  long cPtr = mainJNI.Solver_makeMax__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
622  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
623  }
624 
625  public IntExpr makeMax(IntExpr expr, int value) {
626  long cPtr = mainJNI.Solver_makeMax__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
627  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
628  }
629 
630  public IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost) {
631  long cPtr = mainJNI.Solver_makeConvexPiecewiseExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, early_cost, early_date, late_date, late_cost);
632  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
633  }
634 
635  public IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step) {
636  long cPtr = mainJNI.Solver_makeSemiContinuousExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr, fixed_charge, step);
637  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
638  }
639 
640  public IntExpr makeModulo(IntExpr x, long mod) {
641  long cPtr = mainJNI.Solver_makeModulo__SWIG_0(swigCPtr, this, IntExpr.getCPtr(x), x, mod);
642  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
643  }
644 
646  long cPtr = mainJNI.Solver_makeModulo__SWIG_1(swigCPtr, this, IntExpr.getCPtr(x), x, IntExpr.getCPtr(mod), mod);
647  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
648  }
649 
650  public IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value) {
651  long cPtr = mainJNI.Solver_makeConditionalExpression(swigCPtr, this, IntVar.getCPtr(condition), condition, IntExpr.getCPtr(expr), expr, unperformed_value);
652  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
653  }
654 
656  long cPtr = mainJNI.Solver_makeTrueConstraint(swigCPtr, this);
657  return (cPtr == 0) ? null : new Constraint(cPtr, false);
658  }
659 
661  long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_0(swigCPtr, this);
662  return (cPtr == 0) ? null : new Constraint(cPtr, false);
663  }
664 
665  public Constraint makeFalseConstraint(String explanation) {
666  long cPtr = mainJNI.Solver_makeFalseConstraint__SWIG_1(swigCPtr, this, explanation);
667  return (cPtr == 0) ? null : new Constraint(cPtr, false);
668  }
669 
670  public Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar) {
671  long cPtr = mainJNI.Solver_makeIsEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
672  return (cPtr == 0) ? null : new Constraint(cPtr, false);
673  }
674 
675  public IntVar makeIsEqualCstVar(IntExpr var, long value) {
676  long cPtr = mainJNI.Solver_makeIsEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
677  return (cPtr == 0) ? null : new IntVar(cPtr, false);
678  }
679 
681  long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
682  return (cPtr == 0) ? null : new Constraint(cPtr, false);
683  }
684 
686  long cPtr = mainJNI.Solver_makeIsEqualVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
687  return (cPtr == 0) ? null : new IntVar(cPtr, false);
688  }
689 
690  public Constraint makeEquality(IntExpr left, IntExpr right) {
691  long cPtr = mainJNI.Solver_makeEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
692  return (cPtr == 0) ? null : new Constraint(cPtr, false);
693  }
694 
695  public Constraint makeEquality(IntExpr expr, long value) {
696  long cPtr = mainJNI.Solver_makeEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
697  return (cPtr == 0) ? null : new Constraint(cPtr, false);
698  }
699 
700  public Constraint makeEquality(IntExpr expr, int value) {
701  long cPtr = mainJNI.Solver_makeEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
702  return (cPtr == 0) ? null : new Constraint(cPtr, false);
703  }
704 
705  public Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar) {
706  long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
707  return (cPtr == 0) ? null : new Constraint(cPtr, false);
708  }
709 
710  public IntVar makeIsDifferentCstVar(IntExpr var, long value) {
711  long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(var), var, value);
712  return (cPtr == 0) ? null : new IntVar(cPtr, false);
713  }
714 
716  long cPtr = mainJNI.Solver_makeIsDifferentCstVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2);
717  return (cPtr == 0) ? null : new IntVar(cPtr, false);
718  }
719 
721  long cPtr = mainJNI.Solver_makeIsDifferentCstCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(v1), v1, IntExpr.getCPtr(v2), v2, IntVar.getCPtr(b), b);
722  return (cPtr == 0) ? null : new Constraint(cPtr, false);
723  }
724 
726  long cPtr = mainJNI.Solver_makeNonEquality__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
727  return (cPtr == 0) ? null : new Constraint(cPtr, false);
728  }
729 
730  public Constraint makeNonEquality(IntExpr expr, long value) {
731  long cPtr = mainJNI.Solver_makeNonEquality__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
732  return (cPtr == 0) ? null : new Constraint(cPtr, false);
733  }
734 
735  public Constraint makeNonEquality(IntExpr expr, int value) {
736  long cPtr = mainJNI.Solver_makeNonEquality__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
737  return (cPtr == 0) ? null : new Constraint(cPtr, false);
738  }
739 
740  public Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
741  long cPtr = mainJNI.Solver_makeIsLessOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
742  return (cPtr == 0) ? null : new Constraint(cPtr, false);
743  }
744 
745  public IntVar makeIsLessOrEqualCstVar(IntExpr var, long value) {
746  long cPtr = mainJNI.Solver_makeIsLessOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
747  return (cPtr == 0) ? null : new IntVar(cPtr, false);
748  }
749 
751  long cPtr = mainJNI.Solver_makeIsLessOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
752  return (cPtr == 0) ? null : new IntVar(cPtr, false);
753  }
754 
756  long cPtr = mainJNI.Solver_makeIsLessOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
757  return (cPtr == 0) ? null : new Constraint(cPtr, false);
758  }
759 
761  long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
762  return (cPtr == 0) ? null : new Constraint(cPtr, false);
763  }
764 
765  public Constraint makeLessOrEqual(IntExpr expr, long value) {
766  long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
767  return (cPtr == 0) ? null : new Constraint(cPtr, false);
768  }
769 
770  public Constraint makeLessOrEqual(IntExpr expr, int value) {
771  long cPtr = mainJNI.Solver_makeLessOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
772  return (cPtr == 0) ? null : new Constraint(cPtr, false);
773  }
774 
775  public Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar) {
776  long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstCt(swigCPtr, this, IntExpr.getCPtr(var), var, value, IntVar.getCPtr(boolvar), boolvar);
777  return (cPtr == 0) ? null : new Constraint(cPtr, false);
778  }
779 
780  public IntVar makeIsGreaterOrEqualCstVar(IntExpr var, long value) {
781  long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
782  return (cPtr == 0) ? null : new IntVar(cPtr, false);
783  }
784 
786  long cPtr = mainJNI.Solver_makeIsGreaterOrEqualVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
787  return (cPtr == 0) ? null : new IntVar(cPtr, false);
788  }
789 
791  long cPtr = mainJNI.Solver_makeIsGreaterOrEqualCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
792  return (cPtr == 0) ? null : new Constraint(cPtr, false);
793  }
794 
796  long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
797  return (cPtr == 0) ? null : new Constraint(cPtr, false);
798  }
799 
800  public Constraint makeGreaterOrEqual(IntExpr expr, long value) {
801  long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
802  return (cPtr == 0) ? null : new Constraint(cPtr, false);
803  }
804 
805  public Constraint makeGreaterOrEqual(IntExpr expr, int value) {
806  long cPtr = mainJNI.Solver_makeGreaterOrEqual__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
807  return (cPtr == 0) ? null : new Constraint(cPtr, false);
808  }
809 
811  long cPtr = mainJNI.Solver_makeIsGreaterCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
812  return (cPtr == 0) ? null : new Constraint(cPtr, false);
813  }
814 
815  public IntVar makeIsGreaterCstVar(IntExpr var, long value) {
816  long cPtr = mainJNI.Solver_makeIsGreaterCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
817  return (cPtr == 0) ? null : new IntVar(cPtr, false);
818  }
819 
820  public IntVar makeIsGreaterVar(IntExpr left, IntExpr right) {
821  long cPtr = mainJNI.Solver_makeIsGreaterVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
822  return (cPtr == 0) ? null : new IntVar(cPtr, false);
823  }
824 
826  long cPtr = mainJNI.Solver_makeIsGreaterCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
827  return (cPtr == 0) ? null : new Constraint(cPtr, false);
828  }
829 
830  public Constraint makeGreater(IntExpr left, IntExpr right) {
831  long cPtr = mainJNI.Solver_makeGreater__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
832  return (cPtr == 0) ? null : new Constraint(cPtr, false);
833  }
834 
835  public Constraint makeGreater(IntExpr expr, long value) {
836  long cPtr = mainJNI.Solver_makeGreater__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
837  return (cPtr == 0) ? null : new Constraint(cPtr, false);
838  }
839 
840  public Constraint makeGreater(IntExpr expr, int value) {
841  long cPtr = mainJNI.Solver_makeGreater__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
842  return (cPtr == 0) ? null : new Constraint(cPtr, false);
843  }
844 
845  public Constraint makeIsLessCstCt(IntExpr v, long c, IntVar b) {
846  long cPtr = mainJNI.Solver_makeIsLessCstCt(swigCPtr, this, IntExpr.getCPtr(v), v, c, IntVar.getCPtr(b), b);
847  return (cPtr == 0) ? null : new Constraint(cPtr, false);
848  }
849 
850  public IntVar makeIsLessCstVar(IntExpr var, long value) {
851  long cPtr = mainJNI.Solver_makeIsLessCstVar(swigCPtr, this, IntExpr.getCPtr(var), var, value);
852  return (cPtr == 0) ? null : new IntVar(cPtr, false);
853  }
854 
855  public IntVar makeIsLessVar(IntExpr left, IntExpr right) {
856  long cPtr = mainJNI.Solver_makeIsLessVar(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
857  return (cPtr == 0) ? null : new IntVar(cPtr, false);
858  }
859 
860  public Constraint makeIsLessCt(IntExpr left, IntExpr right, IntVar b) {
861  long cPtr = mainJNI.Solver_makeIsLessCt(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right, IntVar.getCPtr(b), b);
862  return (cPtr == 0) ? null : new Constraint(cPtr, false);
863  }
864 
865  public Constraint makeLess(IntExpr left, IntExpr right) {
866  long cPtr = mainJNI.Solver_makeLess__SWIG_0(swigCPtr, this, IntExpr.getCPtr(left), left, IntExpr.getCPtr(right), right);
867  return (cPtr == 0) ? null : new Constraint(cPtr, false);
868  }
869 
870  public Constraint makeLess(IntExpr expr, long value) {
871  long cPtr = mainJNI.Solver_makeLess__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
872  return (cPtr == 0) ? null : new Constraint(cPtr, false);
873  }
874 
875  public Constraint makeLess(IntExpr expr, int value) {
876  long cPtr = mainJNI.Solver_makeLess__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, value);
877  return (cPtr == 0) ? null : new Constraint(cPtr, false);
878  }
879 
880  public Constraint makeSumLessOrEqual(IntVar[] vars, long cst) {
881  long cPtr = mainJNI.Solver_makeSumLessOrEqual(swigCPtr, this, vars, cst);
882  return (cPtr == 0) ? null : new Constraint(cPtr, false);
883  }
884 
885  public Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst) {
886  long cPtr = mainJNI.Solver_makeSumGreaterOrEqual(swigCPtr, this, vars, cst);
887  return (cPtr == 0) ? null : new Constraint(cPtr, false);
888  }
889 
890  public Constraint makeSumEquality(IntVar[] vars, long cst) {
891  long cPtr = mainJNI.Solver_makeSumEquality__SWIG_0(swigCPtr, this, vars, cst);
892  return (cPtr == 0) ? null : new Constraint(cPtr, false);
893  }
894 
895  public Constraint makeSumEquality(IntVar[] vars, IntVar var) {
896  long cPtr = mainJNI.Solver_makeSumEquality__SWIG_1(swigCPtr, this, vars, IntVar.getCPtr(var), var);
897  return (cPtr == 0) ? null : new Constraint(cPtr, false);
898  }
899 
900  public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst) {
901  long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_0(swigCPtr, this, vars, coefficients, cst);
902  return (cPtr == 0) ? null : new Constraint(cPtr, false);
903  }
904 
905  public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst) {
906  long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_1(swigCPtr, this, vars, coefficients, cst);
907  return (cPtr == 0) ? null : new Constraint(cPtr, false);
908  }
909 
910  public Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target) {
911  long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_2(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
912  return (cPtr == 0) ? null : new Constraint(cPtr, false);
913  }
914 
915  public Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target) {
916  long cPtr = mainJNI.Solver_makeScalProdEquality__SWIG_3(swigCPtr, this, vars, coefficients, IntVar.getCPtr(target), target);
917  return (cPtr == 0) ? null : new Constraint(cPtr, false);
918  }
919 
920  public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst) {
921  long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_0(swigCPtr, this, vars, coeffs, cst);
922  return (cPtr == 0) ? null : new Constraint(cPtr, false);
923  }
924 
925  public Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst) {
926  long cPtr = mainJNI.Solver_makeScalProdGreaterOrEqual__SWIG_1(swigCPtr, this, vars, coeffs, cst);
927  return (cPtr == 0) ? null : new Constraint(cPtr, false);
928  }
929 
930  public Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst) {
931  long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_0(swigCPtr, this, vars, coefficients, cst);
932  return (cPtr == 0) ? null : new Constraint(cPtr, false);
933  }
934 
935  public Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst) {
936  long cPtr = mainJNI.Solver_makeScalProdLessOrEqual__SWIG_1(swigCPtr, this, vars, coefficients, cst);
937  return (cPtr == 0) ? null : new Constraint(cPtr, false);
938  }
939 
940  public Constraint makeMinEquality(IntVar[] vars, IntVar min_var) {
941  long cPtr = mainJNI.Solver_makeMinEquality(swigCPtr, this, vars, IntVar.getCPtr(min_var), min_var);
942  return (cPtr == 0) ? null : new Constraint(cPtr, false);
943  }
944 
945  public Constraint makeMaxEquality(IntVar[] vars, IntVar max_var) {
946  long cPtr = mainJNI.Solver_makeMaxEquality(swigCPtr, this, vars, IntVar.getCPtr(max_var), max_var);
947  return (cPtr == 0) ? null : new Constraint(cPtr, false);
948  }
949 
950  public Constraint makeElementEquality(long[] vals, IntVar index, IntVar target) {
951  long cPtr = mainJNI.Solver_makeElementEquality__SWIG_0(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
952  return (cPtr == 0) ? null : new Constraint(cPtr, false);
953  }
954 
955  public Constraint makeElementEquality(int[] vals, IntVar index, IntVar target) {
956  long cPtr = mainJNI.Solver_makeElementEquality__SWIG_1(swigCPtr, this, vals, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
957  return (cPtr == 0) ? null : new Constraint(cPtr, false);
958  }
959 
960  public Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target) {
961  long cPtr = mainJNI.Solver_makeElementEquality__SWIG_2(swigCPtr, this, vars, IntVar.getCPtr(index), index, IntVar.getCPtr(target), target);
962  return (cPtr == 0) ? null : new Constraint(cPtr, false);
963  }
964 
965  public Constraint makeElementEquality(IntVar[] vars, IntVar index, long target) {
966  long cPtr = mainJNI.Solver_makeElementEquality__SWIG_3(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
967  return (cPtr == 0) ? null : new Constraint(cPtr, false);
968  }
969 
970  public Constraint makeAbsEquality(IntVar var, IntVar abs_var) {
971  long cPtr = mainJNI.Solver_makeAbsEquality(swigCPtr, this, IntVar.getCPtr(var), var, IntVar.getCPtr(abs_var), abs_var);
972  return (cPtr == 0) ? null : new Constraint(cPtr, false);
973  }
974 
975  public Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target) {
976  long cPtr = mainJNI.Solver_makeIndexOfConstraint(swigCPtr, this, vars, IntVar.getCPtr(index), index, target);
977  return (cPtr == 0) ? null : new Constraint(cPtr, false);
978  }
979 
981  long cPtr = mainJNI.Solver_makeConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
982  return (cPtr == 0) ? null : new Demon(cPtr, false);
983  }
984 
986  long cPtr = mainJNI.Solver_makeDelayedConstraintInitialPropagateCallback(swigCPtr, this, Constraint.getCPtr(ct), ct);
987  return (cPtr == 0) ? null : new Demon(cPtr, false);
988  }
989 
990  public Demon makeClosureDemon(Runnable closure) {
991  long cPtr = mainJNI.Solver_makeClosureDemon(swigCPtr, this, closure);
992  return (cPtr == 0) ? null : new Demon(cPtr, false);
993  }
994 
995  public Constraint makeBetweenCt(IntExpr expr, long l, long u) {
996  long cPtr = mainJNI.Solver_makeBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
997  return (cPtr == 0) ? null : new Constraint(cPtr, false);
998  }
999 
1000  public Constraint makeNotBetweenCt(IntExpr expr, long l, long u) {
1001  long cPtr = mainJNI.Solver_makeNotBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u);
1002  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1003  }
1004 
1005  public Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b) {
1006  long cPtr = mainJNI.Solver_makeIsBetweenCt(swigCPtr, this, IntExpr.getCPtr(expr), expr, l, u, IntVar.getCPtr(b), b);
1007  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1008  }
1009 
1010  public IntVar makeIsBetweenVar(IntExpr v, long l, long u) {
1011  long cPtr = mainJNI.Solver_makeIsBetweenVar(swigCPtr, this, IntExpr.getCPtr(v), v, l, u);
1012  return (cPtr == 0) ? null : new IntVar(cPtr, false);
1013  }
1014 
1015  public Constraint makeMemberCt(IntExpr expr, long[] values) {
1016  long cPtr = mainJNI.Solver_makeMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1017  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1018  }
1019 
1020  public Constraint makeMemberCt(IntExpr expr, int[] values) {
1021  long cPtr = mainJNI.Solver_makeMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1022  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1023  }
1024 
1025  public Constraint makeNotMemberCt(IntExpr expr, long[] values) {
1026  long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1027  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1028  }
1029 
1030  public Constraint makeNotMemberCt(IntExpr expr, int[] values) {
1031  long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1032  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1033  }
1034 
1035  public Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends) {
1036  long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_2(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1037  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1038  }
1039 
1040  public Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends) {
1041  long cPtr = mainJNI.Solver_makeNotMemberCt__SWIG_3(swigCPtr, this, IntExpr.getCPtr(expr), expr, starts, ends);
1042  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1043  }
1044 
1045  public Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar) {
1046  long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1047  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1048  }
1049 
1050  public Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar) {
1051  long cPtr = mainJNI.Solver_makeIsMemberCt__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values, IntVar.getCPtr(boolvar), boolvar);
1052  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1053  }
1054 
1055  public IntVar makeIsMemberVar(IntExpr expr, long[] values) {
1056  long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_0(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1057  return (cPtr == 0) ? null : new IntVar(cPtr, false);
1058  }
1059 
1060  public IntVar makeIsMemberVar(IntExpr expr, int[] values) {
1061  long cPtr = mainJNI.Solver_makeIsMemberVar__SWIG_1(swigCPtr, this, IntExpr.getCPtr(expr), expr, values);
1062  return (cPtr == 0) ? null : new IntVar(cPtr, false);
1063  }
1064 
1065  public Constraint makeCount(IntVar[] vars, long value, long max_count) {
1066  long cPtr = mainJNI.Solver_makeCount__SWIG_0(swigCPtr, this, vars, value, max_count);
1067  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1068  }
1069 
1070  public Constraint makeCount(IntVar[] vars, long value, IntVar max_count) {
1071  long cPtr = mainJNI.Solver_makeCount__SWIG_1(swigCPtr, this, vars, value, IntVar.getCPtr(max_count), max_count);
1072  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1073  }
1074 
1075  public Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards) {
1076  long cPtr = mainJNI.Solver_makeDistribute__SWIG_0(swigCPtr, this, vars, values, cards);
1077  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1078  }
1079 
1080  public Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards) {
1081  long cPtr = mainJNI.Solver_makeDistribute__SWIG_1(swigCPtr, this, vars, values, cards);
1082  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1083  }
1084 
1085  public Constraint makeDistribute(IntVar[] vars, IntVar[] cards) {
1086  long cPtr = mainJNI.Solver_makeDistribute__SWIG_2(swigCPtr, this, vars, cards);
1087  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1088  }
1089 
1090  public Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size) {
1091  long cPtr = mainJNI.Solver_makeDistribute__SWIG_3(swigCPtr, this, vars, card_min, card_max, card_size);
1092  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1093  }
1094 
1095  public Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max) {
1096  long cPtr = mainJNI.Solver_makeDistribute__SWIG_4(swigCPtr, this, vars, card_min, card_max);
1097  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1098  }
1099 
1100  public Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max) {
1101  long cPtr = mainJNI.Solver_makeDistribute__SWIG_5(swigCPtr, this, vars, card_min, card_max);
1102  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1103  }
1104 
1105  public Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max) {
1106  long cPtr = mainJNI.Solver_makeDistribute__SWIG_6(swigCPtr, this, vars, values, card_min, card_max);
1107  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1108  }
1109 
1110  public Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max) {
1111  long cPtr = mainJNI.Solver_makeDistribute__SWIG_7(swigCPtr, this, vars, values, card_min, card_max);
1112  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1113  }
1114 
1115  public Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum) {
1116  long cPtr = mainJNI.Solver_makeDeviation(swigCPtr, this, vars, IntVar.getCPtr(deviation_var), deviation_var, total_sum);
1117  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1118  }
1119 
1121  long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_0(swigCPtr, this, vars);
1122  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1123  }
1124 
1125  public Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation) {
1126  long cPtr = mainJNI.Solver_makeAllDifferent__SWIG_1(swigCPtr, this, vars, stronger_propagation);
1127  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1128  }
1129 
1130  public Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value) {
1131  long cPtr = mainJNI.Solver_makeAllDifferentExcept(swigCPtr, this, vars, escape_value);
1132  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1133  }
1134 
1135  public Constraint makeSortingConstraint(IntVar[] vars, IntVar[] sorted) {
1136  long cPtr = mainJNI.Solver_makeSortingConstraint(swigCPtr, this, vars, sorted);
1137  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1138  }
1139 
1140  public Constraint makeLexicalLess(IntVar[] left, IntVar[] right) {
1141  long cPtr = mainJNI.Solver_makeLexicalLess(swigCPtr, this, left, right);
1142  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1143  }
1144 
1146  long cPtr = mainJNI.Solver_makeLexicalLessOrEqual(swigCPtr, this, left, right);
1147  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1148  }
1149 
1151  long cPtr = mainJNI.Solver_makeInversePermutationConstraint(swigCPtr, this, left, right);
1152  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1153  }
1154 
1156  long cPtr = mainJNI.Solver_makeIndexOfFirstMaxValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1157  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1158  }
1159 
1161  long cPtr = mainJNI.Solver_makeIndexOfFirstMinValueConstraint(swigCPtr, this, IntVar.getCPtr(index), index, vars);
1162  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1163  }
1164 
1165  public Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars) {
1166  long cPtr = mainJNI.Solver_makeNullIntersect(swigCPtr, this, first_vars, second_vars);
1167  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1168  }
1169 
1170  public Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value) {
1171  long cPtr = mainJNI.Solver_makeNullIntersectExcept(swigCPtr, this, first_vars, second_vars, escape_value);
1172  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1173  }
1174 
1175  public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler) {
1176  long cPtr = mainJNI.Solver_makeNoCycle__SWIG_0(swigCPtr, this, nexts, active, sink_handler);
1177  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1178  }
1179 
1180  public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active) {
1181  long cPtr = mainJNI.Solver_makeNoCycle__SWIG_1(swigCPtr, this, nexts, active);
1182  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1183  }
1184 
1185  public Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths) {
1186  long cPtr = mainJNI.Solver_makeNoCycle__SWIG_2(swigCPtr, this, nexts, active, sink_handler, assume_paths);
1187  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1188  }
1189 
1190  public Constraint makeCircuit(IntVar[] nexts) {
1191  long cPtr = mainJNI.Solver_makeCircuit(swigCPtr, this, nexts);
1192  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1193  }
1194 
1196  long cPtr = mainJNI.Solver_makeSubCircuit(swigCPtr, this, nexts);
1197  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1198  }
1199 
1200  public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
1201  long cPtr = mainJNI.Solver_makePathCumul__SWIG_0(swigCPtr, this, nexts, active, cumuls, transits);
1202  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1203  }
1204 
1205  public Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits) {
1206  long cPtr = mainJNI.Solver_makeDelayedPathCumul(swigCPtr, this, nexts, active, cumuls, transits);
1207  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1208  }
1209 
1210  public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator) {
1211  long cPtr = mainJNI.Solver_makePathCumul__SWIG_1(swigCPtr, this, nexts, active, cumuls, transit_evaluator);
1212  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1213  }
1214 
1215  public Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator) {
1216  long cPtr = mainJNI.Solver_makePathCumul__SWIG_2(swigCPtr, this, nexts, active, cumuls, slacks, transit_evaluator);
1217  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1218  }
1219 
1220  public Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status) {
1221  long cPtr = mainJNI.Solver_makePathConnected(swigCPtr, this, nexts, sources, sinks, status);
1222  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1223  }
1224 
1225  public Constraint makeMapDomain(IntVar var, IntVar[] actives) {
1226  long cPtr = mainJNI.Solver_makeMapDomain(swigCPtr, this, IntVar.getCPtr(var), var, actives);
1227  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1228  }
1229 
1231  long cPtr = mainJNI.Solver_makeAllowedAssignment(swigCPtr, this, vars, IntTupleSet.getCPtr(tuples), tuples);
1232  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1233  }
1234 
1235  public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states) {
1236  long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_0(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
1237  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1238  }
1239 
1240  public Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states) {
1241  long cPtr = mainJNI.Solver_makeTransitionConstraint__SWIG_1(swigCPtr, this, vars, IntTupleSet.getCPtr(transition_table), transition_table, initial_state, final_states);
1242  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1243  }
1244 
1245  public Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
1246  long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1247  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1248  }
1249 
1250  public Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, long[] x_size, long[] y_size) {
1251  long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_1(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1252  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1253  }
1254 
1255  public Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, int[] x_size, int[] y_size) {
1256  long cPtr = mainJNI.Solver_makeNonOverlappingBoxesConstraint__SWIG_2(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1257  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1258  }
1259 
1260  public Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size) {
1261  long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_0(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1262  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1263  }
1264 
1265  public Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, long[] x_size, long[] y_size) {
1266  long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_1(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1267  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1268  }
1269 
1270  public Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, int[] x_size, int[] y_size) {
1271  long cPtr = mainJNI.Solver_makeNonOverlappingNonStrictBoxesConstraint__SWIG_2(swigCPtr, this, x_vars, y_vars, x_size, y_size);
1272  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1273  }
1274 
1275  public Pack makePack(IntVar[] vars, int number_of_bins) {
1276  long cPtr = mainJNI.Solver_makePack(swigCPtr, this, vars, number_of_bins);
1277  return (cPtr == 0) ? null : new Pack(cPtr, false);
1278  }
1279 
1280  public IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name) {
1281  long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_0(swigCPtr, this, start_min, start_max, duration, optional, name);
1282  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1283  }
1284 
1285  public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name) {
1286  long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_1(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, name);
1287  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1288  }
1289 
1290  public IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name) {
1291  long cPtr = mainJNI.Solver_makeFixedDurationIntervalVar__SWIG_2(swigCPtr, this, IntVar.getCPtr(start_variable), start_variable, duration, IntVar.getCPtr(performed_variable), performed_variable, name);
1292  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1293  }
1294 
1295  public IntervalVar makeFixedInterval(long start, long duration, String name) {
1296  long cPtr = mainJNI.Solver_makeFixedInterval(swigCPtr, this, start, duration, name);
1297  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1298  }
1299 
1300  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) {
1301  long cPtr = mainJNI.Solver_makeIntervalVar(swigCPtr, this, start_min, start_max, duration_min, duration_max, end_min, end_max, optional, name);
1302  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1303  }
1304 
1306  long cPtr = mainJNI.Solver_makeMirrorInterval(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
1307  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1308  }
1309 
1310  public IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
1311  long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
1312  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1313  }
1314 
1315  public IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
1316  long cPtr = mainJNI.Solver_makeFixedDurationStartSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
1317  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1318  }
1319 
1320  public IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset) {
1321  long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnStartIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
1322  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1323  }
1324 
1325  public IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset) {
1326  long cPtr = mainJNI.Solver_makeFixedDurationEndSyncedOnEndIntervalVar(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var, duration, offset);
1327  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1328  }
1329 
1331  long cPtr = mainJNI.Solver_makeIntervalRelaxedMin(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
1332  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1333  }
1334 
1336  long cPtr = mainJNI.Solver_makeIntervalRelaxedMax(swigCPtr, this, IntervalVar.getCPtr(interval_var), interval_var);
1337  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
1338  }
1339 
1341  long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t), t, r, d);
1342  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1343  }
1344 
1346  long cPtr = mainJNI.Solver_makeIntervalVarRelation__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2);
1347  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1348  }
1349 
1351  long cPtr = mainJNI.Solver_makeIntervalVarRelationWithDelay(swigCPtr, this, IntervalVar.getCPtr(t1), t1, r, IntervalVar.getCPtr(t2), t2, delay);
1352  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1353  }
1354 
1356  long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_0(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2, IntVar.getCPtr(alt), alt);
1357  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1358  }
1359 
1361  long cPtr = mainJNI.Solver_makeTemporalDisjunction__SWIG_1(swigCPtr, this, IntervalVar.getCPtr(t1), t1, IntervalVar.getCPtr(t2), t2);
1362  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1363  }
1364 
1366  long cPtr = mainJNI.Solver_makeDisjunctiveConstraint(swigCPtr, this, intervals, name);
1367  return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
1368  }
1369 
1371  long cPtr = mainJNI.Solver_makeStrictDisjunctiveConstraint(swigCPtr, this, intervals, name);
1372  return (cPtr == 0) ? null : new DisjunctiveConstraint(cPtr, false);
1373  }
1374 
1375  public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name) {
1376  long cPtr = mainJNI.Solver_makeCumulative__SWIG_0(swigCPtr, this, intervals, demands, capacity, name);
1377  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1378  }
1379 
1380  public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name) {
1381  long cPtr = mainJNI.Solver_makeCumulative__SWIG_1(swigCPtr, this, intervals, demands, capacity, name);
1382  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1383  }
1384 
1385  public Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name) {
1386  long cPtr = mainJNI.Solver_makeCumulative__SWIG_2(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
1387  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1388  }
1389 
1390  public Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name) {
1391  long cPtr = mainJNI.Solver_makeCumulative__SWIG_3(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
1392  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1393  }
1394 
1395  public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name) {
1396  long cPtr = mainJNI.Solver_makeCumulative__SWIG_4(swigCPtr, this, intervals, demands, capacity, name);
1397  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1398  }
1399 
1400  public Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name) {
1401  long cPtr = mainJNI.Solver_makeCumulative__SWIG_5(swigCPtr, this, intervals, demands, IntVar.getCPtr(capacity), capacity, name);
1402  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1403  }
1404 
1405  public Constraint makeCover(IntervalVar[] vars, IntervalVar target_var) {
1406  long cPtr = mainJNI.Solver_makeCover(swigCPtr, this, vars, IntervalVar.getCPtr(target_var), target_var);
1407  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1408  }
1409 
1411  long cPtr = mainJNI.Solver_makeEquality__SWIG_3(swigCPtr, this, IntervalVar.getCPtr(var1), var1, IntervalVar.getCPtr(var2), var2);
1412  return (cPtr == 0) ? null : new Constraint(cPtr, false);
1413  }
1414 
1416  long cPtr = mainJNI.Solver_makeAssignment__SWIG_0(swigCPtr, this);
1417  return (cPtr == 0) ? null : new Assignment(cPtr, false);
1418  }
1419 
1421  long cPtr = mainJNI.Solver_makeAssignment__SWIG_1(swigCPtr, this, Assignment.getCPtr(a), a);
1422  return (cPtr == 0) ? null : new Assignment(cPtr, false);
1423  }
1424 
1426  long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
1427  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1428  }
1429 
1431  long cPtr = mainJNI.Solver_makeFirstSolutionCollector__SWIG_1(swigCPtr, this);
1432  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1433  }
1434 
1436  long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
1437  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1438  }
1439 
1441  long cPtr = mainJNI.Solver_makeLastSolutionCollector__SWIG_1(swigCPtr, this);
1442  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1443  }
1444 
1445  public SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize) {
1446  long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, maximize);
1447  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1448  }
1449 
1451  long cPtr = mainJNI.Solver_makeBestValueSolutionCollector__SWIG_1(swigCPtr, this, maximize);
1452  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1453  }
1454 
1455  public SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize) {
1456  long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, solution_count, maximize);
1457  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1458  }
1459 
1460  public SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize) {
1461  long cPtr = mainJNI.Solver_makeNBestValueSolutionCollector__SWIG_1(swigCPtr, this, solution_count, maximize);
1462  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1463  }
1464 
1466  long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
1467  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1468  }
1469 
1471  long cPtr = mainJNI.Solver_makeAllSolutionCollector__SWIG_1(swigCPtr, this);
1472  return (cPtr == 0) ? null : new SolutionCollector(cPtr, false);
1473  }
1474 
1475  public OptimizeVar makeMinimize(IntVar v, long step) {
1476  long cPtr = mainJNI.Solver_makeMinimize(swigCPtr, this, IntVar.getCPtr(v), v, step);
1477  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1478  }
1479 
1480  public OptimizeVar makeMaximize(IntVar v, long step) {
1481  long cPtr = mainJNI.Solver_makeMaximize(swigCPtr, this, IntVar.getCPtr(v), v, step);
1482  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1483  }
1484 
1485  public OptimizeVar makeOptimize(boolean maximize, IntVar v, long step) {
1486  long cPtr = mainJNI.Solver_makeOptimize(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step);
1487  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1488  }
1489 
1490  public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step) {
1491  long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
1492  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1493  }
1494 
1495  public OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step) {
1496  long cPtr = mainJNI.Solver_makeWeightedMinimize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
1497  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1498  }
1499 
1500  public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step) {
1501  long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_0(swigCPtr, this, sub_objectives, weights, step);
1502  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1503  }
1504 
1505  public OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step) {
1506  long cPtr = mainJNI.Solver_makeWeightedMaximize__SWIG_1(swigCPtr, this, sub_objectives, weights, step);
1507  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1508  }
1509 
1510  public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step) {
1511  long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_0(swigCPtr, this, maximize, sub_objectives, weights, step);
1512  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1513  }
1514 
1515  public OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step) {
1516  long cPtr = mainJNI.Solver_makeWeightedOptimize__SWIG_1(swigCPtr, this, maximize, sub_objectives, weights, step);
1517  return (cPtr == 0) ? null : new OptimizeVar(cPtr, false);
1518  }
1519 
1520  public SearchMonitor makeTabuSearch(boolean maximize, IntVar v, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor) {
1521  long cPtr = mainJNI.Solver_makeTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, vars, keep_tenure, forbid_tenure, tabu_factor);
1522  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1523  }
1524 
1525  public SearchMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure) {
1526  long cPtr = mainJNI.Solver_makeGenericTabuSearch(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, tabu_vars, forbid_tenure);
1527  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1528  }
1529 
1530  public SearchMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature) {
1531  long cPtr = mainJNI.Solver_makeSimulatedAnnealing(swigCPtr, this, maximize, IntVar.getCPtr(v), v, step, initial_temperature);
1532  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1533  }
1534 
1535  public SearchMonitor makeGuidedLocalSearch(boolean maximize, IntVar objective, LongBinaryOperator objective_function, long step, IntVar[] vars, double penalty_factor) {
1536  long cPtr = mainJNI.Solver_makeGuidedLocalSearch__SWIG_0(swigCPtr, this, maximize, IntVar.getCPtr(objective), objective, objective_function, step, vars, penalty_factor);
1537  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1538  }
1539 
1540  public SearchMonitor makeGuidedLocalSearch(boolean maximize, IntVar objective, LongTernaryOperator objective_function, long step, IntVar[] vars, IntVar[] secondary_vars, double penalty_factor) {
1541  long cPtr = mainJNI.Solver_makeGuidedLocalSearch__SWIG_1(swigCPtr, this, maximize, IntVar.getCPtr(objective), objective, objective_function, step, vars, secondary_vars, penalty_factor);
1542  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1543  }
1544 
1545  public SearchMonitor makeLubyRestart(int scale_factor) {
1546  long cPtr = mainJNI.Solver_makeLubyRestart(swigCPtr, this, scale_factor);
1547  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1548  }
1549 
1550  public SearchMonitor makeConstantRestart(int frequency) {
1551  long cPtr = mainJNI.Solver_makeConstantRestart(swigCPtr, this, frequency);
1552  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1553  }
1554 
1555  public RegularLimit makeTimeLimit(long time_in_ms) {
1556  long cPtr = mainJNI.Solver_makeTimeLimit(swigCPtr, this, time_in_ms);
1557  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1558  }
1559 
1561  long cPtr = mainJNI.Solver_makeBranchesLimit(swigCPtr, this, branches);
1562  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1563  }
1564 
1566  long cPtr = mainJNI.Solver_makeFailuresLimit(swigCPtr, this, failures);
1567  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1568  }
1569 
1571  long cPtr = mainJNI.Solver_makeSolutionsLimit(swigCPtr, this, solutions);
1572  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1573  }
1574 
1575  public RegularLimit makeLimit(long time, long branches, long failures, long solutions) {
1576  long cPtr = mainJNI.Solver_makeLimit__SWIG_0(swigCPtr, this, time, branches, failures, solutions);
1577  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1578  }
1579 
1580  public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check) {
1581  long cPtr = mainJNI.Solver_makeLimit__SWIG_1(swigCPtr, this, time, branches, failures, solutions, smart_time_check);
1582  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1583  }
1584 
1585  public RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative) {
1586  long cPtr = mainJNI.Solver_makeLimit__SWIG_2(swigCPtr, this, time, branches, failures, solutions, smart_time_check, cumulative);
1587  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1588  }
1589 
1591  long cPtr = mainJNI.Solver_makeLimit__SWIG_3(swigCPtr, this, proto.toByteArray());
1592  return (cPtr == 0) ? null : new RegularLimit(cPtr, false);
1593  }
1594 
1596  byte[] buf = mainJNI.Solver_makeDefaultRegularLimitParameters(swigCPtr, this);
1597  if (buf == null || buf.length == 0) {
1598  return null;
1599  }
1600  try {
1602  } catch (com.google.protobuf.InvalidProtocolBufferException e) {
1603  throw new RuntimeException(
1604  "Unable to parse com.google.ortools.constraintsolver.RegularLimitParameters protocol message.");
1605  }
1606 }
1607 
1608  public SearchLimit makeLimit(SearchLimit limit_1, SearchLimit limit_2) {
1609  long cPtr = mainJNI.Solver_makeLimit__SWIG_4(swigCPtr, this, SearchLimit.getCPtr(limit_1), limit_1, SearchLimit.getCPtr(limit_2), limit_2);
1610  return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
1611  }
1612 
1613  public SearchLimit makeCustomLimit(BooleanSupplier limiter) {
1614  long cPtr = mainJNI.Solver_makeCustomLimit(swigCPtr, this, limiter);
1615  return (cPtr == 0) ? null : new SearchLimit(cPtr, false);
1616  }
1617 
1618  public SearchMonitor makeSearchLog(int branch_period) {
1619  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_0(swigCPtr, this, branch_period);
1620  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1621  }
1622 
1623  public SearchMonitor makeSearchLog(int branch_period, IntVar var) {
1624  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_1(swigCPtr, this, branch_period, IntVar.getCPtr(var), var);
1625  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1626  }
1627 
1628  public SearchMonitor makeSearchLog(int branch_period, Supplier<String> display_callback) {
1629  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_2(swigCPtr, this, branch_period, display_callback);
1630  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1631  }
1632 
1633  public SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier<String> display_callback) {
1634  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_3(swigCPtr, this, branch_period, IntVar.getCPtr(var), var, display_callback);
1635  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1636  }
1637 
1638  public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var) {
1639  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_4(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var);
1640  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1641  }
1642 
1643  public SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier<String> display_callback) {
1644  long cPtr = mainJNI.Solver_makeSearchLog__SWIG_5(swigCPtr, this, branch_period, OptimizeVar.getCPtr(opt_var), opt_var, display_callback);
1645  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1646  }
1647 
1648  public SearchMonitor makeSearchTrace(String prefix) {
1649  long cPtr = mainJNI.Solver_makeSearchTrace(swigCPtr, this, prefix);
1650  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1651  }
1652 
1653  public SearchMonitor makeEnterSearchCallback(Runnable callback) {
1654  long cPtr = mainJNI.Solver_makeEnterSearchCallback(swigCPtr, this, callback);
1655  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1656  }
1657 
1658  public SearchMonitor makeExitSearchCallback(Runnable callback) {
1659  long cPtr = mainJNI.Solver_makeExitSearchCallback(swigCPtr, this, callback);
1660  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1661  }
1662 
1663  public SearchMonitor makeAtSolutionCallback(Runnable callback) {
1664  long cPtr = mainJNI.Solver_makeAtSolutionCallback(swigCPtr, this, callback);
1665  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1666  }
1667 
1669  long cPtr = mainJNI.Solver_makePrintModelVisitor(swigCPtr, this);
1670  return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
1671  }
1672 
1674  long cPtr = mainJNI.Solver_makeStatisticsModelVisitor(swigCPtr, this);
1675  return (cPtr == 0) ? null : new ModelVisitor(cPtr, false);
1676  }
1677 
1679  long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_0(swigCPtr, this, visitors);
1680  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1681  }
1682 
1684  long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_1(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1);
1685  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1686  }
1687 
1689  long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_2(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2);
1690  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1691  }
1692 
1694  long cPtr = mainJNI.Solver_makeSymmetryManager__SWIG_3(swigCPtr, this, SymmetryBreaker.getCPtr(v1), v1, SymmetryBreaker.getCPtr(v2), v2, SymmetryBreaker.getCPtr(v3), v3);
1695  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1696  }
1697 
1699  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);
1700  return (cPtr == 0) ? null : new SearchMonitor(cPtr, false);
1701  }
1702 
1703  public Decision makeAssignVariableValue(IntVar var, long val) {
1704  long cPtr = mainJNI.Solver_makeAssignVariableValue(swigCPtr, this, IntVar.getCPtr(var), var, val);
1705  return (cPtr == 0) ? null : new Decision(cPtr, false);
1706  }
1707 
1709  long cPtr = mainJNI.Solver_makeVariableLessOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
1710  return (cPtr == 0) ? null : new Decision(cPtr, false);
1711  }
1712 
1714  long cPtr = mainJNI.Solver_makeVariableGreaterOrEqualValue(swigCPtr, this, IntVar.getCPtr(var), var, value);
1715  return (cPtr == 0) ? null : new Decision(cPtr, false);
1716  }
1717 
1718  public Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half) {
1719  long cPtr = mainJNI.Solver_makeSplitVariableDomain(swigCPtr, this, IntVar.getCPtr(var), var, val, start_with_lower_half);
1720  return (cPtr == 0) ? null : new Decision(cPtr, false);
1721  }
1722 
1724  long cPtr = mainJNI.Solver_makeAssignVariableValueOrFail(swigCPtr, this, IntVar.getCPtr(var), var, value);
1725  return (cPtr == 0) ? null : new Decision(cPtr, false);
1726  }
1727 
1729  long cPtr = mainJNI.Solver_MakeAssignVariableValueOrDoNothing(swigCPtr, this, IntVar.getCPtr(var), var, value);
1730  return (cPtr == 0) ? null : new Decision(cPtr, false);
1731  }
1732 
1733  public Decision makeAssignVariablesValues(IntVar[] vars, long[] values) {
1734  long cPtr = mainJNI.Solver_makeAssignVariablesValues(swigCPtr, this, vars, values);
1735  return (cPtr == 0) ? null : new Decision(cPtr, false);
1736  }
1737 
1739  long cPtr = mainJNI.Solver_makeFailDecision(swigCPtr, this);
1740  return (cPtr == 0) ? null : new Decision(cPtr, false);
1741  }
1742 
1743  public Decision makeDecision(Consumer<Solver> apply, Consumer<Solver> refute) {
1744  long cPtr = mainJNI.Solver_makeDecision(swigCPtr, this, apply, refute);
1745  return (cPtr == 0) ? null : new Decision(cPtr, false);
1746  }
1747 
1749  long cPtr = mainJNI.Solver_compose__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
1750  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1751  }
1752 
1754  long cPtr = mainJNI.Solver_compose__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
1755  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1756  }
1757 
1759  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);
1760  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1761  }
1762 
1764  long cPtr = mainJNI.Solver_compose__SWIG_3(swigCPtr, this, dbs);
1765  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1766  }
1767 
1769  long cPtr = mainJNI.Solver_tryDecisions__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2);
1770  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1771  }
1772 
1774  long cPtr = mainJNI.Solver_tryDecisions__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db1), db1, DecisionBuilder.getCPtr(db2), db2, DecisionBuilder.getCPtr(db3), db3);
1775  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1776  }
1777 
1779  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);
1780  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1781  }
1782 
1784  long cPtr = mainJNI.Solver_tryDecisions__SWIG_3(swigCPtr, this, dbs);
1785  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1786  }
1787 
1788  public DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str) {
1789  long cPtr = mainJNI.Solver_makePhase__SWIG_0(swigCPtr, this, vars, var_str, val_str);
1790  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1791  }
1792 
1793  public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str) {
1794  long cPtr = mainJNI.Solver_makePhase__SWIG_1(swigCPtr, this, vars, var_evaluator, val_str);
1795  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1796  }
1797 
1798  public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator) {
1799  long cPtr = mainJNI.Solver_makePhase__SWIG_2(swigCPtr, this, vars, var_str, value_evaluator);
1800  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1801  }
1802 
1803  public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator) {
1804  long cPtr = mainJNI.Solver_makePhase__SWIG_3(swigCPtr, this, vars, var_str, var_val1_val2_comparator);
1805  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1806  }
1807 
1808  public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator) {
1809  long cPtr = mainJNI.Solver_makePhase__SWIG_4(swigCPtr, this, vars, var_evaluator, value_evaluator);
1810  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1811  }
1812 
1813  public DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
1814  long cPtr = mainJNI.Solver_makePhase__SWIG_5(swigCPtr, this, vars, var_str, value_evaluator, tie_breaker);
1815  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1816  }
1817 
1818  public DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) {
1819  long cPtr = mainJNI.Solver_makePhase__SWIG_6(swigCPtr, this, vars, var_evaluator, value_evaluator, tie_breaker);
1820  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1821  }
1822 
1824  long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_0(swigCPtr, this, vars);
1825  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1826  }
1827 
1829  long cPtr = mainJNI.Solver_makeDefaultPhase__SWIG_1(swigCPtr, this, vars, DefaultPhaseParameters.getCPtr(parameters), parameters);
1830  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1831  }
1832 
1833  public DecisionBuilder makePhase(IntVar v0, int var_str, int val_str) {
1834  long cPtr = mainJNI.Solver_makePhase__SWIG_7(swigCPtr, this, IntVar.getCPtr(v0), v0, var_str, val_str);
1835  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1836  }
1837 
1838  public DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str) {
1839  long cPtr = mainJNI.Solver_makePhase__SWIG_8(swigCPtr, this, IntVar.getCPtr(v0), v0, IntVar.getCPtr(v1), v1, var_str, val_str);
1840  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1841  }
1842 
1843  public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str) {
1844  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);
1845  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1846  }
1847 
1848  public DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str) {
1849  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);
1850  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1851  }
1852 
1853  public Decision makeScheduleOrPostpone(IntervalVar var, long est, int[] marker) {
1854  long cPtr = mainJNI.Solver_makeScheduleOrPostpone(swigCPtr, this, IntervalVar.getCPtr(var), var, est, marker);
1855  return (cPtr == 0) ? null : new Decision(cPtr, false);
1856  }
1857 
1858  public Decision makeScheduleOrExpedite(IntervalVar var, long est, int[] marker) {
1859  long cPtr = mainJNI.Solver_makeScheduleOrExpedite(swigCPtr, this, IntervalVar.getCPtr(var), var, est, marker);
1860  return (cPtr == 0) ? null : new Decision(cPtr, false);
1861  }
1862 
1863  public Decision makeRankFirstInterval(SequenceVar sequence, int index) {
1864  long cPtr = mainJNI.Solver_makeRankFirstInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
1865  return (cPtr == 0) ? null : new Decision(cPtr, false);
1866  }
1867 
1868  public Decision makeRankLastInterval(SequenceVar sequence, int index) {
1869  long cPtr = mainJNI.Solver_makeRankLastInterval(swigCPtr, this, SequenceVar.getCPtr(sequence), sequence, index);
1870  return (cPtr == 0) ? null : new Decision(cPtr, false);
1871  }
1872 
1873  public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str) {
1874  long cPtr = mainJNI.Solver_makePhase__SWIG_11(swigCPtr, this, vars, eval, str);
1875  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1876  }
1877 
1878  public DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str) {
1879  long cPtr = mainJNI.Solver_makePhase__SWIG_12(swigCPtr, this, vars, eval, tie_breaker, str);
1880  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1881  }
1882 
1883  public DecisionBuilder makePhase(IntervalVar[] intervals, int str) {
1884  long cPtr = mainJNI.Solver_makePhase__SWIG_13(swigCPtr, this, intervals, str);
1885  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1886  }
1887 
1888  public DecisionBuilder makePhase(SequenceVar[] sequences, int str) {
1889  long cPtr = mainJNI.Solver_makePhase__SWIG_14(swigCPtr, this, sequences, str);
1890  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1891  }
1892 
1894  long cPtr = mainJNI.Solver_makeDecisionBuilderFromAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment, DecisionBuilder.getCPtr(db), db, vars);
1895  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1896  }
1897 
1899  long cPtr = mainJNI.Solver_makeConstraintAdder(swigCPtr, this, Constraint.getCPtr(ct), ct);
1900  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1901  }
1902 
1904  long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db);
1905  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1906  }
1907 
1909  long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1);
1910  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1911  }
1912 
1914  long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_2(swigCPtr, this, DecisionBuilder.getCPtr(db), db, SearchMonitor.getCPtr(monitor1), monitor1, SearchMonitor.getCPtr(monitor2), monitor2);
1915  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1916  }
1917 
1919  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);
1920  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1921  }
1922 
1924  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);
1925  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1926  }
1927 
1929  long cPtr = mainJNI.Solver_makeSolveOnce__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, monitors);
1930  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1931  }
1932 
1933  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step) {
1934  long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_0(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step);
1935  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1936  }
1937 
1938  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1) {
1939  long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_1(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, SearchMonitor.getCPtr(monitor1), monitor1);
1940  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1941  }
1942 
1943  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2) {
1944  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);
1945  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1946  }
1947 
1948  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) {
1949  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);
1950  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1951  }
1952 
1953  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) {
1954  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);
1955  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1956  }
1957 
1958  public DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors) {
1959  long cPtr = mainJNI.Solver_makeNestedOptimize__SWIG_5(swigCPtr, this, DecisionBuilder.getCPtr(db), db, Assignment.getCPtr(solution), solution, maximize, step, monitors);
1960  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1961  }
1962 
1964  long cPtr = mainJNI.Solver_makeRestoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
1965  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1966  }
1967 
1969  long cPtr = mainJNI.Solver_makeStoreAssignment(swigCPtr, this, Assignment.getCPtr(assignment), assignment);
1970  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
1971  }
1972 
1973  public LocalSearchOperator makeOperator(IntVar[] vars, int op) {
1974  long cPtr = mainJNI.Solver_makeOperator__SWIG_0(swigCPtr, this, vars, op);
1975  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
1976  }
1977 
1978  public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op) {
1979  long cPtr = mainJNI.Solver_makeOperator__SWIG_1(swigCPtr, this, vars, secondary_vars, op);
1980  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
1981  }
1982 
1983  public LocalSearchOperator makeOperator(IntVar[] vars, LongTernaryOperator evaluator, int op) {
1984  long cPtr = mainJNI.Solver_makeOperator__SWIG_2(swigCPtr, this, vars, evaluator, op);
1985  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
1986  }
1987 
1988  public LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op) {
1989  long cPtr = mainJNI.Solver_makeOperator__SWIG_3(swigCPtr, this, vars, secondary_vars, evaluator, op);
1990  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
1991  }
1992 
1993  public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables) {
1994  long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_0(swigCPtr, this, vars, number_of_variables);
1995  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
1996  }
1997 
1998  public LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed) {
1999  long cPtr = mainJNI.Solver_makeRandomLnsOperator__SWIG_1(swigCPtr, this, vars, number_of_variables, seed);
2000  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2001  }
2002 
2004  long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_0(swigCPtr, this, Assignment.getCPtr(target), target);
2005  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2006  }
2007 
2008  public LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values) {
2009  long cPtr = mainJNI.Solver_makeMoveTowardTargetOperator__SWIG_1(swigCPtr, this, variables, target_values);
2010  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2011  }
2012 
2014  long cPtr = mainJNI.Solver_concatenateOperators__SWIG_0(swigCPtr, this, ops);
2015  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2016  }
2017 
2019  long cPtr = mainJNI.Solver_concatenateOperators__SWIG_1(swigCPtr, this, ops, restart);
2020  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2021  }
2022 
2024  long cPtr = mainJNI.Solver_concatenateOperators__SWIG_2(swigCPtr, this, ops, evaluator);
2025  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2026  }
2027 
2029  long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_0(swigCPtr, this, ops);
2030  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2031  }
2032 
2034  long cPtr = mainJNI.Solver_randomConcatenateOperators__SWIG_1(swigCPtr, this, ops, seed);
2035  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2036  }
2037 
2039  long cPtr = mainJNI.Solver_makeNeighborhoodLimit(swigCPtr, this, LocalSearchOperator.getCPtr(op), op, limit);
2040  return (cPtr == 0) ? null : new LocalSearchOperator(cPtr, false);
2041  }
2042 
2044  long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_0(swigCPtr, this, Assignment.getCPtr(assignment), assignment, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
2045  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
2046  }
2047 
2049  long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_1(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
2050  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
2051  }
2052 
2053  public DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) {
2054  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);
2055  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
2056  }
2057 
2059  long cPtr = mainJNI.Solver_makeLocalSearchPhase__SWIG_3(swigCPtr, this, vars, DecisionBuilder.getCPtr(first_solution), first_solution, LocalSearchPhaseParameters.getCPtr(parameters), parameters);
2060  return (cPtr == 0) ? null : new DecisionBuilder(cPtr, false);
2061  }
2062 
2064  long cPtr = mainJNI.Solver_makeDefaultSolutionPool(swigCPtr, this);
2065  return (cPtr == 0) ? null : new SolutionPool(cPtr, false);
2066  }
2067 
2069  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);
2070  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2071  }
2072 
2074  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);
2075  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2076  }
2077 
2079  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, filters);
2080  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2081  }
2082 
2084  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);
2085  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2086  }
2087 
2089  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);
2090  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2091  }
2092 
2094  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, filters);
2095  return (cPtr == 0) ? null : new LocalSearchPhaseParameters(cPtr, false);
2096  }
2097 
2099  long cPtr = mainJNI.Solver_MakeAcceptFilter(swigCPtr, this);
2100  return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
2101  }
2102 
2104  long cPtr = mainJNI.Solver_MakeRejectFilter(swigCPtr, this);
2105  return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
2106  }
2107 
2109  long cPtr = mainJNI.Solver_makeVariableDomainFilter(swigCPtr, this);
2110  return (cPtr == 0) ? null : new LocalSearchFilter(cPtr, false);
2111  }
2112 
2113  public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum) {
2114  long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_0(swigCPtr, this, vars, values, filter_enum);
2115  return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
2116  }
2117 
2118  public IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum) {
2119  long cPtr = mainJNI.Solver_makeSumObjectiveFilter__SWIG_1(swigCPtr, this, vars, secondary_vars, values, filter_enum);
2120  return (cPtr == 0) ? null : new IntVarLocalSearchFilter(cPtr, false);
2121  }
2122 
2123  public void topPeriodicCheck() {
2124  mainJNI.Solver_topPeriodicCheck(swigCPtr, this);
2125  }
2126 
2127  public int topProgressPercent() {
2128  return mainJNI.Solver_topProgressPercent(swigCPtr, this);
2129  }
2130 
2131  public void pushState() {
2132  mainJNI.Solver_pushState(swigCPtr, this);
2133  }
2134 
2135  public void popState() {
2136  mainJNI.Solver_popState(swigCPtr, this);
2137  }
2138 
2139  public int searchDepth() {
2140  return mainJNI.Solver_searchDepth(swigCPtr, this);
2141  }
2142 
2143  public int searchLeftDepth() {
2144  return mainJNI.Solver_searchLeftDepth(swigCPtr, this);
2145  }
2146 
2147  public int solveDepth() {
2148  return mainJNI.Solver_solveDepth(swigCPtr, this);
2149  }
2150 
2151  public long rand64(long size) {
2152  return mainJNI.Solver_rand64(swigCPtr, this, size);
2153  }
2154 
2155  public int rand32(int size) {
2156  return mainJNI.Solver_rand32(swigCPtr, this, size);
2157  }
2158 
2159  public void reSeed(int seed) {
2160  mainJNI.Solver_reSeed(swigCPtr, this, seed);
2161  }
2162 
2163  public void exportProfilingOverview(String filename) {
2164  mainJNI.Solver_exportProfilingOverview(swigCPtr, this, filename);
2165  }
2166 
2167  public String localSearchProfile() {
2168  return mainJNI.Solver_localSearchProfile(swigCPtr, this);
2169  }
2170 
2171  public boolean currentlyInSolve() {
2172  return mainJNI.Solver_currentlyInSolve(swigCPtr, this);
2173  }
2174 
2175  public int constraints() {
2176  return mainJNI.Solver_constraints(swigCPtr, this);
2177  }
2178 
2179  public void accept(ModelVisitor visitor) {
2180  mainJNI.Solver_accept(swigCPtr, this, ModelVisitor.getCPtr(visitor), visitor);
2181  }
2182 
2184  long cPtr = mainJNI.Solver_balancing_decision(swigCPtr, this);
2185  return (cPtr == 0) ? null : new Decision(cPtr, false);
2186  }
2187 
2188  public void clear_fail_intercept() {
2189  mainJNI.Solver_clear_fail_intercept(swigCPtr, this);
2190  }
2191 
2192  public void SetUseFastLocalSearch(boolean use_fast_local_search) {
2193  mainJNI.Solver_SetUseFastLocalSearch(swigCPtr, this, use_fast_local_search);
2194  }
2195 
2196  public boolean UseFastLocalSearch() {
2197  return mainJNI.Solver_UseFastLocalSearch(swigCPtr, this);
2198  }
2199 
2200  public boolean hasName(PropagationBaseObject object) {
2201  return mainJNI.Solver_hasName(swigCPtr, this, PropagationBaseObject.getCPtr(object), object);
2202  }
2203 
2204  public Demon registerDemon(Demon demon) {
2205  long cPtr = mainJNI.Solver_registerDemon(swigCPtr, this, Demon.getCPtr(demon), demon);
2206  return (cPtr == 0) ? null : new Demon(cPtr, false);
2207  }
2208 
2210  long cPtr = mainJNI.Solver_registerIntExpr(swigCPtr, this, IntExpr.getCPtr(expr), expr);
2211  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
2212  }
2213 
2215  long cPtr = mainJNI.Solver_registerIntVar(swigCPtr, this, IntVar.getCPtr(var), var);
2216  return (cPtr == 0) ? null : new IntVar(cPtr, false);
2217  }
2218 
2220  long cPtr = mainJNI.Solver_registerIntervalVar(swigCPtr, this, IntervalVar.getCPtr(var), var);
2221  return (cPtr == 0) ? null : new IntervalVar(cPtr, false);
2222  }
2223 
2224  public ModelCache cache() {
2225  long cPtr = mainJNI.Solver_cache(swigCPtr, this);
2226  return (cPtr == 0) ? null : new ModelCache(cPtr, false);
2227  }
2228 
2229  public boolean instrumentsDemons() {
2230  return mainJNI.Solver_instrumentsDemons(swigCPtr, this);
2231  }
2232 
2233  public boolean isProfilingEnabled() {
2234  return mainJNI.Solver_isProfilingEnabled(swigCPtr, this);
2235  }
2236 
2238  return mainJNI.Solver_isLocalSearchProfilingEnabled(swigCPtr, this);
2239  }
2240 
2241  public boolean instrumentsVariables() {
2242  return mainJNI.Solver_instrumentsVariables(swigCPtr, this);
2243  }
2244 
2245  public boolean nameAllVariables() {
2246  return mainJNI.Solver_nameAllVariables(swigCPtr, this);
2247  }
2248 
2249  public String model_name() {
2250  return mainJNI.Solver_model_name(swigCPtr, this);
2251  }
2252 
2254  long cPtr = mainJNI.Solver_getPropagationMonitor(swigCPtr, this);
2255  return (cPtr == 0) ? null : new PropagationMonitor(cPtr, false);
2256  }
2257 
2259  mainJNI.Solver_addPropagationMonitor(swigCPtr, this, PropagationMonitor.getCPtr(monitor), monitor);
2260  }
2261 
2263  long cPtr = mainJNI.Solver_getLocalSearchMonitor(swigCPtr, this);
2264  return (cPtr == 0) ? null : new LocalSearchMonitor(cPtr, false);
2265  }
2266 
2268  mainJNI.Solver_addLocalSearchMonitor(swigCPtr, this, LocalSearchMonitor.getCPtr(monitor), monitor);
2269  }
2270 
2272  long cPtr = mainJNI.Solver_GetOrCreateLocalSearchState(swigCPtr, this);
2273  return (cPtr == 0) ? null : new Assignment(cPtr, false);
2274  }
2275 
2276  public void ClearLocalSearchState() {
2277  mainJNI.Solver_ClearLocalSearchState(swigCPtr, this);
2278  }
2279 
2280  public void setTmp_vector_(long[] value) {
2281  mainJNI.Solver_tmp_vector__set(swigCPtr, this, value);
2282  }
2283 
2284  public long[] getTmp_vector_() {
2285  return mainJNI.Solver_tmp_vector__get(swigCPtr, this);
2286 }
2287 
2289  long cPtr = mainJNI.Solver_castExpression(swigCPtr, this, IntVar.getCPtr(var), var);
2290  return (cPtr == 0) ? null : new IntExpr(cPtr, false);
2291  }
2292 
2293  public void finishCurrentSearch() {
2294  mainJNI.Solver_finishCurrentSearch(swigCPtr, this);
2295  }
2296 
2297  public void restartCurrentSearch() {
2298  mainJNI.Solver_restartCurrentSearch(swigCPtr, this);
2299  }
2300 
2301  public void shouldFail() {
2302  mainJNI.Solver_shouldFail(swigCPtr, this);
2303  }
2304 
2305  public void checkFail() {
2306  mainJNI.Solver_checkFail(swigCPtr, this);
2307  }
2308 
2309  public final static int kNumPriorities = mainJNI.Solver_kNumPriorities_get();
2310  // IntVarStrategy
2311  public final static int INT_VAR_DEFAULT = mainJNI.Solver_INT_VAR_DEFAULT_get();
2312  public final static int INT_VAR_SIMPLE = mainJNI.Solver_INT_VAR_SIMPLE_get();
2313  public final static int CHOOSE_FIRST_UNBOUND = mainJNI.Solver_CHOOSE_FIRST_UNBOUND_get();
2314  public final static int CHOOSE_RANDOM = mainJNI.Solver_CHOOSE_RANDOM_get();
2315  public final static int CHOOSE_MIN_SIZE_LOWEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MIN_get();
2316  public final static int CHOOSE_MIN_SIZE_HIGHEST_MIN = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MIN_get();
2317  public final static int CHOOSE_MIN_SIZE_LOWEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_LOWEST_MAX_get();
2318  public final static int CHOOSE_MIN_SIZE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_MIN_SIZE_HIGHEST_MAX_get();
2319  public final static int CHOOSE_LOWEST_MIN = mainJNI.Solver_CHOOSE_LOWEST_MIN_get();
2320  public final static int CHOOSE_HIGHEST_MAX = mainJNI.Solver_CHOOSE_HIGHEST_MAX_get();
2321  public final static int CHOOSE_MIN_SIZE = mainJNI.Solver_CHOOSE_MIN_SIZE_get();
2322  public final static int CHOOSE_MAX_SIZE = mainJNI.Solver_CHOOSE_MAX_SIZE_get();
2323  public final static int CHOOSE_MAX_REGRET_ON_MIN = mainJNI.Solver_CHOOSE_MAX_REGRET_ON_MIN_get();
2324  public final static int CHOOSE_PATH = mainJNI.Solver_CHOOSE_PATH_get();
2325 
2326  // IntValueStrategy
2327  public final static int INT_VALUE_DEFAULT = mainJNI.Solver_INT_VALUE_DEFAULT_get();
2328  public final static int INT_VALUE_SIMPLE = mainJNI.Solver_INT_VALUE_SIMPLE_get();
2329  public final static int ASSIGN_MIN_VALUE = mainJNI.Solver_ASSIGN_MIN_VALUE_get();
2330  public final static int ASSIGN_MAX_VALUE = mainJNI.Solver_ASSIGN_MAX_VALUE_get();
2331  public final static int ASSIGN_RANDOM_VALUE = mainJNI.Solver_ASSIGN_RANDOM_VALUE_get();
2332  public final static int ASSIGN_CENTER_VALUE = mainJNI.Solver_ASSIGN_CENTER_VALUE_get();
2333  public final static int SPLIT_LOWER_HALF = mainJNI.Solver_SPLIT_LOWER_HALF_get();
2334  public final static int SPLIT_UPPER_HALF = mainJNI.Solver_SPLIT_UPPER_HALF_get();
2335 
2336  // EvaluatorStrategy
2337  public final static int CHOOSE_STATIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_STATIC_GLOBAL_BEST_get();
2338  public final static int CHOOSE_DYNAMIC_GLOBAL_BEST = mainJNI.Solver_CHOOSE_DYNAMIC_GLOBAL_BEST_get();
2339 
2340  // SequenceStrategy
2341  public final static int SEQUENCE_DEFAULT = mainJNI.Solver_SEQUENCE_DEFAULT_get();
2342  public final static int SEQUENCE_SIMPLE = mainJNI.Solver_SEQUENCE_SIMPLE_get();
2343  public final static int CHOOSE_MIN_SLACK_RANK_FORWARD = mainJNI.Solver_CHOOSE_MIN_SLACK_RANK_FORWARD_get();
2344  public final static int CHOOSE_RANDOM_RANK_FORWARD = mainJNI.Solver_CHOOSE_RANDOM_RANK_FORWARD_get();
2345 
2346  // IntervalStrategy
2347  public final static int INTERVAL_DEFAULT = mainJNI.Solver_INTERVAL_DEFAULT_get();
2348  public final static int INTERVAL_SIMPLE = mainJNI.Solver_INTERVAL_SIMPLE_get();
2349  public final static int INTERVAL_SET_TIMES_FORWARD = mainJNI.Solver_INTERVAL_SET_TIMES_FORWARD_get();
2350  public final static int INTERVAL_SET_TIMES_BACKWARD = mainJNI.Solver_INTERVAL_SET_TIMES_BACKWARD_get();
2351 
2352  // LocalSearchOperators
2353  public final static int TWOOPT = mainJNI.Solver_TWOOPT_get();
2354  public final static int OROPT = mainJNI.Solver_OROPT_get();
2355  public final static int RELOCATE = mainJNI.Solver_RELOCATE_get();
2356  public final static int EXCHANGE = mainJNI.Solver_EXCHANGE_get();
2357  public final static int CROSS = mainJNI.Solver_CROSS_get();
2358  public final static int MAKEACTIVE = mainJNI.Solver_MAKEACTIVE_get();
2359  public final static int MAKEINACTIVE = mainJNI.Solver_MAKEINACTIVE_get();
2360  public final static int MAKECHAININACTIVE = mainJNI.Solver_MAKECHAININACTIVE_get();
2361  public final static int SWAPACTIVE = mainJNI.Solver_SWAPACTIVE_get();
2362  public final static int EXTENDEDSWAPACTIVE = mainJNI.Solver_EXTENDEDSWAPACTIVE_get();
2363  public final static int PATHLNS = mainJNI.Solver_PATHLNS_get();
2364  public final static int FULLPATHLNS = mainJNI.Solver_FULLPATHLNS_get();
2365  public final static int UNACTIVELNS = mainJNI.Solver_UNACTIVELNS_get();
2366  public final static int INCREMENT = mainJNI.Solver_INCREMENT_get();
2367  public final static int DECREMENT = mainJNI.Solver_DECREMENT_get();
2368  public final static int SIMPLELNS = mainJNI.Solver_SIMPLELNS_get();
2369 
2370  // EvaluatorLocalSearchOperators
2371  public final static int LK = mainJNI.Solver_LK_get();
2372  public final static int TSPOPT = mainJNI.Solver_TSPOPT_get();
2373  public final static int TSPLNS = mainJNI.Solver_TSPLNS_get();
2374 
2375  // LocalSearchFilterBound
2376  public final static int GE = mainJNI.Solver_GE_get();
2377  public final static int LE = mainJNI.Solver_LE_get();
2378  public final static int EQ = mainJNI.Solver_EQ_get();
2379 
2380  // DemonPriority
2381  public final static int DELAYED_PRIORITY = mainJNI.Solver_DELAYED_PRIORITY_get();
2382  public final static int VAR_PRIORITY = mainJNI.Solver_VAR_PRIORITY_get();
2383  public final static int NORMAL_PRIORITY = mainJNI.Solver_NORMAL_PRIORITY_get();
2384 
2385  // BinaryIntervalRelation
2386  public final static int ENDS_AFTER_END = mainJNI.Solver_ENDS_AFTER_END_get();
2387  public final static int ENDS_AFTER_START = mainJNI.Solver_ENDS_AFTER_START_get();
2388  public final static int ENDS_AT_END = mainJNI.Solver_ENDS_AT_END_get();
2389  public final static int ENDS_AT_START = mainJNI.Solver_ENDS_AT_START_get();
2390  public final static int STARTS_AFTER_END = mainJNI.Solver_STARTS_AFTER_END_get();
2391  public final static int STARTS_AFTER_START = mainJNI.Solver_STARTS_AFTER_START_get();
2392  public final static int STARTS_AT_END = mainJNI.Solver_STARTS_AT_END_get();
2393  public final static int STARTS_AT_START = mainJNI.Solver_STARTS_AT_START_get();
2394  public final static int STAYS_IN_SYNC = mainJNI.Solver_STAYS_IN_SYNC_get();
2395 
2396  // UnaryIntervalRelation
2397  public final static int ENDS_AFTER = mainJNI.Solver_ENDS_AFTER_get();
2398  public final static int ENDS_AT = mainJNI.Solver_ENDS_AT_get();
2399  public final static int ENDS_BEFORE = mainJNI.Solver_ENDS_BEFORE_get();
2400  public final static int STARTS_AFTER = mainJNI.Solver_STARTS_AFTER_get();
2401  public final static int STARTS_AT = mainJNI.Solver_STARTS_AT_get();
2402  public final static int STARTS_BEFORE = mainJNI.Solver_STARTS_BEFORE_get();
2403  public final static int CROSS_DATE = mainJNI.Solver_CROSS_DATE_get();
2404  public final static int AVOID_DATE = mainJNI.Solver_AVOID_DATE_get();
2405 
2406  // DecisionModification
2407  public final static int NO_CHANGE = mainJNI.Solver_NO_CHANGE_get();
2408  public final static int KEEP_LEFT = mainJNI.Solver_KEEP_LEFT_get();
2409  public final static int KEEP_RIGHT = mainJNI.Solver_KEEP_RIGHT_get();
2410  public final static int KILL_BOTH = mainJNI.Solver_KILL_BOTH_get();
2411  public final static int SWITCH_BRANCHES = mainJNI.Solver_SWITCH_BRANCHES_get();
2412 
2413  // MarkerType
2414  public final static int SENTINEL = mainJNI.Solver_SENTINEL_get();
2415  public final static int SIMPLE_MARKER = mainJNI.Solver_SIMPLE_MARKER_get();
2416  public final static int CHOICE_POINT = mainJNI.Solver_CHOICE_POINT_get();
2417  public final static int REVERSIBLE_ACTION = mainJNI.Solver_REVERSIBLE_ACTION_get();
2418 
2419  // SolverState
2420  public final static int OUTSIDE_SEARCH = mainJNI.Solver_OUTSIDE_SEARCH_get();
2421  public final static int IN_ROOT_NODE = mainJNI.Solver_IN_ROOT_NODE_get();
2422  public final static int IN_SEARCH = mainJNI.Solver_IN_SEARCH_get();
2423  public final static int AT_SOLUTION = mainJNI.Solver_AT_SOLUTION_get();
2424  public final static int NO_MORE_SOLUTIONS = mainJNI.Solver_NO_MORE_SOLUTIONS_get();
2425  public final static int PROBLEM_INFEASIBLE = mainJNI.Solver_PROBLEM_INFEASIBLE_get();
2426 
2427  // OptimizationDirection
2428  public final static int NOT_SET = mainJNI.Solver_NOT_SET_get();
2429  public final static int MAXIMIZATION = mainJNI.Solver_MAXIMIZATION_get();
2430  public final static int MINIMIZATION = mainJNI.Solver_MINIMIZATION_get();
2431 
2432 }
SolutionCollector makeLastSolutionCollector()
Definition: Solver.java:1440
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition: Solver.java:313
RegularLimit makeBranchesLimit(long branches)
Definition: Solver.java:1560
Constraint makeAllDifferent(IntVar[] vars)
Definition: Solver.java:1120
Decision makeAssignVariablesValues(IntVar[] vars, long[] values)
Definition: Solver.java:1733
IntExpr makeMax(IntExpr expr, int value)
Definition: Solver.java:625
IntegerCastInfo(IntVar v, IntExpr e, Constraint c)
Definition: Solver.java:194
static final int AVOID_DATE
Definition: Solver.java:2404
DecisionBuilder makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars)
Definition: Solver.java:1893
IntExpr makeSum(IntVar[] vars)
Definition: Solver.java:485
Constraint makePathConnected(IntVar[] nexts, long[] sources, long[] sinks, IntVar[] status)
Definition: Solver.java:1220
Decision makeSplitVariableDomain(IntVar var, long val, boolean start_with_lower_half)
Definition: Solver.java:1718
String localSearchProfile()
Definition: Solver.java:2167
IntExpr makeDifference(long value, IntExpr expr)
Definition: Solver.java:505
Constraint makeIndexOfFirstMinValueConstraint(IntVar index, IntVar[] vars)
Definition: Solver.java:1160
Constraint makeDelayedPathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition: Solver.java:1205
static final int CHOOSE_MIN_SLACK_RANK_FORWARD
Definition: Solver.java:2343
static final int ENDS_AT
Definition: Solver.java:2398
void clear_fail_intercept()
Definition: Solver.java:2188
SearchMonitor makeGenericTabuSearch(boolean maximize, IntVar v, long step, IntVar[] tabu_vars, long forbid_tenure)
Definition: Solver.java:1525
Constraint makeMemberCt(IntExpr expr, long[] values)
Definition: Solver.java:1015
IntVar[] makeIntVarArray(int count, long min, long max, String name)
Definition: Solver.java:103
boolean solveAndCommit(DecisionBuilder db)
Definition: Solver.java:333
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, long[] coeffs, long cst)
Definition: Solver.java:920
boolean solve(DecisionBuilder db)
Definition: Solver.java:273
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, IntVar target)
Definition: Solver.java:915
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1)
Definition: Solver.java:337
static com.google.ortools.constraintsolver.ConstraintSolverParameters parseFrom(java.nio.ByteBuffer data)
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition: Solver.java:1778
IntVar makeIsGreaterVar(IntExpr left, IntExpr right)
Definition: Solver.java:820
boolean nameAllVariables()
Definition: Solver.java:2245
IntExpr castExpression(IntVar var)
Definition: Solver.java:2288
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, int str)
Definition: Solver.java:1873
DecisionBuilder makeDefaultPhase(IntVar[] vars, DefaultPhaseParameters parameters)
Definition: Solver.java:1828
void accept(ModelVisitor visitor)
Definition: Solver.java:2179
DecisionBuilder makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str)
Definition: Solver.java:1878
IntExpr registerIntExpr(IntExpr expr)
Definition: Solver.java:2209
Constraint makeSumEquality(IntVar[] vars, long cst)
Definition: Solver.java:890
DecisionBuilder makeStoreAssignment(Assignment assignment)
Definition: Solver.java:1968
static final int INTERVAL_SET_TIMES_BACKWARD
Definition: Solver.java:2350
void popState()
Definition: Solver.java:2135
LocalSearchOperator makeOperator(IntVar[] vars, LongTernaryOperator evaluator, int op)
Definition: Solver.java:1983
Constraint makeAllDifferent(IntVar[] vars, boolean stronger_propagation)
Definition: Solver.java:1125
Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, long[] x_size, long[] y_size)
Definition: Solver.java:1250
void reSeed(int seed)
Definition: Solver.java:2159
Constraint makeIsLessOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition: Solver.java:740
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, long[] weights, long step)
Definition: Solver.java:1500
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, String name)
Definition: Solver.java:1285
Constraint makeSortingConstraint(IntVar[] vars, IntVar[] sorted)
Definition: Solver.java:1135
Constraint makeIsDifferentCstCt(IntExpr v1, IntExpr v2, IntVar b)
Definition: Solver.java:720
Solver(String name)
Definition: Solver.java:227
Constraint makeNullIntersect(IntVar[] first_vars, IntVar[] second_vars)
Definition: Solver.java:1165
static final int ENDS_AFTER_START
Definition: Solver.java:2387
Decision makeAssignVariableValue(IntVar var, long val)
Definition: Solver.java:1703
IntVar makeIntVar(long[] values)
Definition: Solver.java:445
void newSearch(DecisionBuilder db, SearchMonitor m1)
Definition: Solver.java:301
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)
Definition: Solver.java:1758
static final int REVERSIBLE_ACTION
Definition: Solver.java:2417
Solver(String name, com.google.ortools.constraintsolver.ConstraintSolverParameters parameters)
Definition: Solver.java:231
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, long capacity, String name)
Definition: Solver.java:1380
IntExpr makeConditionalExpression(IntVar condition, IntExpr expr, long unperformed_value)
Definition: Solver.java:650
SearchMonitor makeLubyRestart(int scale_factor)
Definition: Solver.java:1545
void topPeriodicCheck()
Definition: Solver.java:2123
boolean instrumentsDemons()
Definition: Solver.java:2229
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilter[] filters)
Definition: Solver.java:2078
static long memoryUsage()
Definition: Solver.java:369
Constraint makeNonEquality(IntExpr expr, int value)
Definition: Solver.java:735
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2)
Definition: Solver.java:1768
IntExpr makeDiv(IntExpr expr, long value)
Definition: Solver.java:525
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition: Solver.java:281
Constraint makeDeviation(IntVar[] vars, IntVar deviation_var, long total_sum)
Definition: Solver.java:1115
Represents a function that accepts two int-valued arguments and produces a long-valued result.
static final int UNACTIVELNS
Definition: Solver.java:2365
IntExpr makeModulo(IntExpr x, long mod)
Definition: Solver.java:640
int constraints()
Definition: Solver.java:2175
void fail()
Definition: Solver.java:361
SearchMonitor makeAtSolutionCallback(Runnable callback)
Definition: Solver.java:1663
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2, IntVar alt)
Definition: Solver.java:1355
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var, Supplier< String > display_callback)
Definition: Solver.java:1643
void setMaintainer(Constraint value)
Definition: Solver.java:216
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops)
Definition: Solver.java:2028
Constraint makeCover(IntervalVar[] vars, IntervalVar target_var)
Definition: Solver.java:1405
Constraint makeNotMemberCt(IntExpr expr, long[] starts, long[] ends)
Definition: Solver.java:1035
Definition: ModelCache.java:11
void setExpression(IntExpr value)
Definition: Solver.java:207
IntExpr makeModulo(IntExpr x, IntExpr mod)
Definition: Solver.java:645
static final int CROSS_DATE
Definition: Solver.java:2403
Constraint makeScalProdLessOrEqual(IntVar[] vars, long[] coefficients, long cst)
Definition: Solver.java:930
IntExpr makeIndexExpression(IntVar[] vars, long value)
Definition: Solver.java:580
IntExpr makeScalProd(IntVar[] vars, int[] coefs)
Definition: Solver.java:495
SolutionCollector makeAllSolutionCollector()
Definition: Solver.java:1470
com.google.ortools.constraintsolver.RegularLimitParameters makeDefaultRegularLimitParameters()
Definition: Solver.java:1595
static final int CHOOSE_STATIC_GLOBAL_BEST
Definition: Solver.java:2337
Definition: IntExpr.java:11
static final int CHOOSE_RANDOM_RANK_FORWARD
Definition: Solver.java:2344
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check, boolean cumulative)
Definition: Solver.java:1585
static final int INTERVAL_SIMPLE
Definition: Solver.java:2348
boolean hasName(PropagationBaseObject object)
Definition: Solver.java:2200
void restartSearch()
Definition: Solver.java:321
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition: Solver.java:1818
Constraint makeElementEquality(IntVar[] vars, IntVar index, IntVar target)
Definition: Solver.java:960
int solveDepth()
Definition: Solver.java:2147
Constraint makeIsMemberCt(IntExpr expr, long[] values, IntVar boolvar)
Definition: Solver.java:1045
SolutionCollector makeBestValueSolutionCollector(boolean maximize)
Definition: Solver.java:1450
Constraint makeSubCircuit(IntVar[] nexts)
Definition: Solver.java:1195
void addCastConstraint(CastConstraint constraint, IntVar target_var, IntExpr expr)
Definition: Solver.java:265
Constraint makeNotBetweenCt(IntExpr expr, long l, long u)
Definition: Solver.java:1000
static final int ASSIGN_CENTER_VALUE
Definition: Solver.java:2332
IntervalVar makeFixedDurationIntervalVar(IntVar start_variable, long duration, IntVar performed_variable, String name)
Definition: Solver.java:1290
SearchMonitor makeSearchLog(int branch_period, OptimizeVar opt_var)
Definition: Solver.java:1638
Constraint makeScalProdGreaterOrEqual(IntVar[] vars, int[] coeffs, long cst)
Definition: Solver.java:925
static final int ASSIGN_MIN_VALUE
Definition: Solver.java:2329
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, int[] weights, long step)
Definition: Solver.java:1495
void setTmp_vector_(long[] value)
Definition: Solver.java:2280
RegularLimit makeLimit(long time, long branches, long failures, long solutions, boolean smart_time_check)
Definition: Solver.java:1580
static final int FULLPATHLNS
Definition: Solver.java:2364
IntervalVar makeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition: Solver.java:1325
IntExpr makeSquare(IntExpr expr)
Definition: Solver.java:540
Constraint makeIntervalVarRelation(IntervalVar t1, int r, IntervalVar t2)
Definition: Solver.java:1345
static final int INT_VAR_SIMPLE
Definition: Solver.java:2312
IntExpr makeElement(long[] values, IntVar index)
Definition: Solver.java:550
Assignment makeAssignment()
Definition: Solver.java:1415
IntExpr makeMonotonicElement(LongUnaryOperator values, boolean increasing, IntVar index)
Definition: Solver.java:565
static final int OUTSIDE_SEARCH
Definition: Solver.java:2420
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, IntIntToLongFunction evaluator)
Definition: Solver.java:2023
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator)
Definition: Solver.java:1808
static final int SPLIT_UPPER_HALF
Definition: Solver.java:2334
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, long[] final_states)
Definition: Solver.java:1235
Constraint makeIsLessOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition: Solver.java:755
Constraint makeIsGreaterCt(IntExpr left, IntExpr right, IntVar b)
Definition: Solver.java:825
DecisionBuilder makeConstraintAdder(Constraint ct)
Definition: Solver.java:1898
Decision makeScheduleOrPostpone(IntervalVar var, long est, int[] marker)
Definition: Solver.java:1853
Constraint makeScalProdLessOrEqual(IntVar[] vars, int[] coefficients, long cst)
Definition: Solver.java:935
Constraint makeDistribute(IntVar[] vars, IntVar[] cards)
Definition: Solver.java:1085
static final int MAKEINACTIVE
Definition: Solver.java:2359
SearchMonitor makeSymmetryManager(SymmetryBreaker[] visitors)
Definition: Solver.java:1678
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler, boolean assume_paths)
Definition: Solver.java:1185
Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition: Solver.java:1260
IntExpr makePower(IntExpr expr, long n)
Definition: Solver.java:545
IntExpr makeSum(IntExpr expr, long value)
Definition: Solver.java:480
static final int TSPLNS
Definition: Solver.java:2373
Constraint makeEquality(IntExpr expr, int value)
Definition: Solver.java:700
void finishCurrentSearch()
Definition: Solver.java:2293
long[] getTmp_vector_()
Definition: Solver.java:2284
DecisionBuilder makePhase(IntVar v0, IntVar v1, int var_str, int val_str)
Definition: Solver.java:1838
SearchMonitor makeSearchTrace(String prefix)
Definition: Solver.java:1648
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step)
Definition: Solver.java:1933
static final int MAKEACTIVE
Definition: Solver.java:2358
Solver(long cPtr, boolean cMemoryOwn)
Definition: Solver.java:58
static final int CROSS
Definition: Solver.java:2357
static final int STARTS_AT_START
Definition: Solver.java:2393
IntegerCastInfo()
Definition: Solver.java:190
Decision makeVariableLessOrEqualValue(IntVar var, long value)
Definition: Solver.java:1708
Constraint makeElementEquality(long[] vals, IntVar index, IntVar target)
Definition: Solver.java:950
static final int STARTS_BEFORE
Definition: Solver.java:2402
DecisionBuilder makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str)
Definition: Solver.java:1793
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3, SymmetryBreaker v4)
Definition: Solver.java:1698
static final int ASSIGN_MAX_VALUE
Definition: Solver.java:2330
FailException(String message)
Definition: Solver.java:90
IntVar makeIntConst(long val)
Definition: Solver.java:470
IntVar makeBoolVar(String name)
Definition: Solver.java:455
SolutionPool makeDefaultSolutionPool()
Definition: Solver.java:2063
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters)
Definition: Solver.java:2053
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, IntVar target)
Definition: Solver.java:910
Constraint makeDistribute(IntVar[] vars, long[] values, long[] card_min, long[] card_max)
Definition: Solver.java:1105
SearchMonitor makeSearchLog(int branch_period)
Definition: Solver.java:1618
IntervalVar makeFixedInterval(long start, long duration, String name)
Definition: Solver.java:1295
IntVar[] makeBoolVarArray(int count)
Definition: Solver.java:112
static final int DECREMENT
Definition: Solver.java:2367
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, IntVar capacity, String name)
Definition: Solver.java:1400
IntExpr makeConvexPiecewiseExpr(IntExpr expr, long early_cost, long early_date, long late_date, long late_cost)
Definition: Solver.java:630
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops, boolean restart)
Definition: Solver.java:2018
IntervalVar makeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition: Solver.java:1315
void exportProfilingOverview(String filename)
Definition: Solver.java:2163
IntVar makeIsLessOrEqualVar(IntExpr left, IntExpr right)
Definition: Solver.java:750
Constraint makeScalProdEquality(IntVar[] vars, long[] coefficients, long cst)
Definition: Solver.java:900
Decision MakeAssignVariableValueOrDoNothing(IntVar var, long value)
Definition: Solver.java:1728
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] slacks, LongBinaryOperator transit_evaluator)
Definition: Solver.java:1215
IntegerCastInfo(long cPtr, boolean cMemoryOwn)
Definition: Solver.java:166
String model_name()
Definition: Solver.java:2249
Decision balancing_decision()
Definition: Solver.java:2183
boolean isLocalSearchProfilingEnabled()
Definition: Solver.java:2237
Represents a predicate (boolean-valued function) uppon three.
Constraint makeLess(IntExpr expr, long value)
Definition: Solver.java:870
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor[] monitors)
Definition: Solver.java:1928
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1)
Definition: Solver.java:1938
static final int INCREMENT
Definition: Solver.java:2366
Constraint makeIntervalVarRelationWithDelay(IntervalVar t1, int r, IntervalVar t2, long delay)
Definition: Solver.java:1350
Constraint makeIsMemberCt(IntExpr expr, int[] values, IntVar boolvar)
Definition: Solver.java:1050
Constraint makeGreater(IntExpr expr, int value)
Definition: Solver.java:840
int optimization_direction()
Definition: Solver.java:417
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, LongBinaryOperator transit_evaluator)
Definition: Solver.java:1210
static final int NO_MORE_SOLUTIONS
Definition: Solver.java:2424
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2)
Definition: Solver.java:1688
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional)
Definition: Solver.java:129
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition: Solver.java:1953
PropagationMonitor getPropagationMonitor()
Definition: Solver.java:2253
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, LongBinaryOperator values, int filter_enum)
Definition: Solver.java:2113
Constraint makeIndexOfFirstMaxValueConstraint(IntVar index, IntVar[] vars)
Definition: Solver.java:1155
long fail_stamp()
Definition: Solver.java:413
Decision makeFailDecision()
Definition: Solver.java:1738
IntVarLocalSearchFilter makeSumObjectiveFilter(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator values, int filter_enum)
Definition: Solver.java:2118
DisjunctiveConstraint makeStrictDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition: Solver.java:1370
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition: Solver.java:305
IntExpr makeMin(IntExpr expr, long value)
Definition: Solver.java:600
void endSearch()
Definition: Solver.java:325
static final int INT_VAR_DEFAULT
Definition: Solver.java:2311
IntExpr makeMin(IntExpr left, IntExpr right)
Definition: Solver.java:595
static final int INTERVAL_DEFAULT
Definition: Solver.java:2347
boolean solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors)
Definition: Solver.java:329
void ClearLocalSearchState()
Definition: Solver.java:2276
This exceptions signal that a failure has been raised in the C++ world.
Definition: Solver.java:85
DecisionBuilder makePhase(SequenceVar[] sequences, int str)
Definition: Solver.java:1888
IntervalVar makeIntervalRelaxedMax(IntervalVar interval_var)
Definition: Solver.java:1335
LocalSearchFilter MakeAcceptFilter()
Definition: Solver.java:2098
Demon makeClosureDemon(Runnable closure)
Definition: Solver.java:990
Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, long[] x_size, long[] y_size)
Definition: Solver.java:1265
long filteredNeighbors()
Definition: Solver.java:401
Constraint makeMinEquality(IntVar[] vars, IntVar min_var)
Definition: Solver.java:940
Constraint makeNotMemberCt(IntExpr expr, int[] starts, int[] ends)
Definition: Solver.java:1040
IntervalVar[] makeFixedDurationIntervalVarArray(int count, long start_min, long start_max, long duration, boolean optional, String name)
Definition: Solver.java:145
long rand64(long size)
Definition: Solver.java:2151
Constraint makeEquality(IntExpr expr, long value)
Definition: Solver.java:695
void addConstraint(Constraint c)
Definition: Solver.java:261
Constraint makeGreaterOrEqual(IntExpr expr, int value)
Definition: Solver.java:805
RegularLimit makeFailuresLimit(long failures)
Definition: Solver.java:1565
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, IntVar v3, int var_str, int val_str)
Definition: Solver.java:1848
Constraint makeIfThenElseCt(IntVar condition, IntExpr then_expr, IntExpr else_expr, IntVar target_var)
Definition: Solver.java:585
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, int[] weights, long step)
Definition: Solver.java:1515
static final int CHOOSE_MIN_SIZE_LOWEST_MIN
Definition: Solver.java:2315
void newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition: Solver.java:309
static final int SEQUENCE_SIMPLE
Definition: Solver.java:2342
Constraint makeCumulative(IntervalVar[] intervals, IntVar[] demands, long capacity, String name)
Definition: Solver.java:1395
Constraint makeIntervalVarRelation(IntervalVar t, int r, long d)
Definition: Solver.java:1340
LocalSearchOperator makeMoveTowardTargetOperator(IntVar[] variables, long[] target_values)
Definition: Solver.java:2008
IntVar[] makeIntVarArray(int count, long min, long max)
Definition: Solver.java:95
IntVar makeIntVar(int[] values, String name)
Definition: Solver.java:435
Constraint makeTrueConstraint()
Definition: Solver.java:655
static final int INTERVAL_SET_TIMES_FORWARD
Definition: Solver.java:2349
LocalSearchFilter MakeRejectFilter()
Definition: Solver.java:2103
SearchMonitor makeSymmetryManager(SymmetryBreaker v1, SymmetryBreaker v2, SymmetryBreaker v3)
Definition: Solver.java:1693
OptimizeVar makeWeightedOptimize(boolean maximize, IntVar[] sub_objectives, long[] weights, long step)
Definition: Solver.java:1510
Decision makeRankFirstInterval(SequenceVar sequence, int index)
Definition: Solver.java:1863
IntervalVar registerIntervalVar(IntervalVar var)
Definition: Solver.java:2219
Constraint getMaintainer()
Definition: Solver.java:220
static final int CHOOSE_MIN_SIZE_HIGHEST_MAX
Definition: Solver.java:2318
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator)
Definition: Solver.java:1798
RegularLimit makeLimit(com.google.ortools.constraintsolver.RegularLimitParameters proto)
Definition: Solver.java:1590
IntVar makeIsDifferentCstVar(IntExpr var, long value)
Definition: Solver.java:710
IntVar makeIsGreaterCstVar(IntExpr var, long value)
Definition: Solver.java:815
Constraint makeNotMemberCt(IntExpr expr, long[] values)
Definition: Solver.java:1025
LocalSearchFilter makeVariableDomainFilter()
Definition: Solver.java:2108
static final int kNumPriorities
Definition: Solver.java:2309
Constraint makeSumEquality(IntVar[] vars, IntVar var)
Definition: Solver.java:895
LocalSearchOperator makeMoveTowardTargetOperator(Assignment target)
Definition: Solver.java:2003
DecisionBuilder makeDefaultPhase(IntVar[] vars)
Definition: Solver.java:1823
DecisionBuilder makePhase(IntVar v0, int var_str, int val_str)
Definition: Solver.java:1833
IntExpr makeElement(IntVar[] vars, IntVar index)
Definition: Solver.java:575
Constraint makeIsEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition: Solver.java:670
static final int STARTS_AT_END
Definition: Solver.java:2392
static final int CHOOSE_RANDOM
Definition: Solver.java:2314
Constraint makeIsLessCt(IntExpr left, IntExpr right, IntVar b)
Definition: Solver.java:860
long branches()
Definition: Solver.java:377
static final int STARTS_AFTER_START
Definition: Solver.java:2391
SearchMonitor makeGuidedLocalSearch(boolean maximize, IntVar objective, LongBinaryOperator objective_function, long step, IntVar[] vars, double penalty_factor)
Definition: Solver.java:1535
IntVar makeIntConst(long val, String name)
Definition: Solver.java:465
static final int SEQUENCE_DEFAULT
Definition: Solver.java:2341
static final int AT_SOLUTION
Definition: Solver.java:2423
OptimizeVar makeMaximize(IntVar v, long step)
Definition: Solver.java:1480
OptimizeVar makeWeightedMinimize(IntVar[] sub_objectives, long[] weights, long step)
Definition: Solver.java:1490
IntervalVar makeFixedDurationIntervalVar(long start_min, long start_max, long duration, boolean optional, String name)
Definition: Solver.java:1280
Definition: Demon.java:11
Constraint makeTransitionConstraint(IntVar[] vars, IntTupleSet transition_table, long initial_state, int[] final_states)
Definition: Solver.java:1240
static final int ENDS_AFTER_END
Definition: Solver.java:2386
boolean checkAssignment(Assignment solution)
Definition: Solver.java:349
Constraint makeIsGreaterOrEqualCt(IntExpr left, IntExpr right, IntVar b)
Definition: Solver.java:790
static final int EQ
Definition: Solver.java:2378
Constraint makeIsGreaterCstCt(IntExpr v, long c, IntVar b)
Definition: Solver.java:810
IntExpr makeMax(IntExpr expr, long value)
Definition: Solver.java:620
Decision makeAssignVariableValueOrFail(IntVar var, long value)
Definition: Solver.java:1723
IntExpr makeMax(IntExpr left, IntExpr right)
Definition: Solver.java:615
static final int CHOOSE_MIN_SIZE_HIGHEST_MIN
Definition: Solver.java:2316
void set_optimization_direction(int direction)
Definition: Solver.java:421
DecisionBuilder makeLocalSearchPhase(Assignment assignment, LocalSearchPhaseParameters parameters)
Definition: Solver.java:2043
SearchMonitor makeEnterSearchCallback(Runnable callback)
Definition: Solver.java:1653
static final int VAR_PRIORITY
Definition: Solver.java:2382
static final int STARTS_AFTER
Definition: Solver.java:2400
static final int MAKECHAININACTIVE
Definition: Solver.java:2360
static final int CHOOSE_LOWEST_MIN
Definition: Solver.java:2319
DecisionBuilder makeRestoreAssignment(Assignment assignment)
Definition: Solver.java:1963
IntervalVar makeMirrorInterval(IntervalVar interval_var)
Definition: Solver.java:1305
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:1300
DecisionBuilder makePhase(IntervalVar[] intervals, int str)
Definition: Solver.java:1883
SearchLimit makeCustomLimit(BooleanSupplier limiter)
Definition: Solver.java:1613
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition: Solver.java:1948
Constraint makeIsEqualVar(IntExpr v1, IntExpr v2, IntVar b)
Definition: Solver.java:680
boolean nextSolution()
Definition: Solver.java:317
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2)
Definition: Solver.java:1748
Constraint makeIsGreaterOrEqualCstCt(IntExpr var, long value, IntVar boolvar)
Definition: Solver.java:775
Constraint makeBetweenCt(IntExpr expr, long l, long u)
Definition: Solver.java:995
SolutionCollector makeBestValueSolutionCollector(Assignment assignment, boolean maximize)
Definition: Solver.java:1445
static com.google.ortools.constraintsolver.ConstraintSolverParameters defaultSolverParameters()
Definition: Solver.java:248
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1)
Definition: Solver.java:1908
SearchMonitor makeSearchLog(int branch_period, Supplier< String > display_callback)
Definition: Solver.java:1628
Definition: Assignment.java:11
Constraint makeLessOrEqual(IntExpr expr, long value)
Definition: Solver.java:765
Decision makeDecision(Consumer< Solver > apply, Consumer< Solver > refute)
Definition: Solver.java:1743
static final int TWOOPT
Definition: Solver.java:2353
Constraint makeCumulative(IntervalVar[] intervals, int[] demands, IntVar capacity, String name)
Definition: Solver.java:1390
static final int PATHLNS
Definition: Solver.java:2363
Constraint makeNonEquality(IntExpr expr, long value)
Definition: Solver.java:730
static final int CHOOSE_PATH
Definition: Solver.java:2324
SearchMonitor makeSimulatedAnnealing(boolean maximize, IntVar v, long step, long initial_temperature)
Definition: Solver.java:1530
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition: Solver.java:2068
long solutions()
Definition: Solver.java:381
Constraint makeIsBetweenCt(IntExpr expr, long l, long u, IntVar b)
Definition: Solver.java:1005
static final int CHOOSE_MIN_SIZE
Definition: Solver.java:2321
static final int STARTS_AT
Definition: Solver.java:2401
void shouldFail()
Definition: Solver.java:2301
Decision makeScheduleOrExpedite(IntervalVar var, long est, int[] marker)
Definition: Solver.java:1858
IntExpr makeMax(IntVar[] vars)
Definition: Solver.java:610
static final int LE
Definition: Solver.java:2377
IntVar makeIntVar(long[] values, String name)
Definition: Solver.java:430
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker)
Definition: Solver.java:1813
ModelCache cache()
Definition: Solver.java:2224
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition: Solver.java:2073
LocalSearchOperator randomConcatenateOperators(LocalSearchOperator[] ops, int seed)
Definition: Solver.java:2033
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, LongTernaryOperator evaluator, int op)
Definition: Solver.java:1988
LocalSearchMonitor getLocalSearchMonitor()
Definition: Solver.java:2262
IntervalVar makeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition: Solver.java:1310
Constraint makeAllDifferentExcept(IntVar[] vars, long escape_value)
Definition: Solver.java:1130
SearchMonitor makeSearchLog(int branch_period, IntVar var, Supplier< String > display_callback)
Definition: Solver.java:1633
static final int ENDS_AT_END
Definition: Solver.java:2388
Constraint makeDistribute(IntVar[] vars, int[] values, IntVar[] cards)
Definition: Solver.java:1080
static final int SIMPLE_MARKER
Definition: Solver.java:2415
void newSearch(DecisionBuilder db, SearchMonitor[] monitors)
Definition: Solver.java:293
OptimizeVar makeWeightedMaximize(IntVar[] sub_objectives, int[] weights, long step)
Definition: Solver.java:1505
IntExpr makeDifference(IntExpr left, IntExpr right)
Definition: Solver.java:500
int searchLeftDepth()
Definition: Solver.java:2143
Constraint makeSumLessOrEqual(IntVar[] vars, long cst)
Definition: Solver.java:880
static final int KILL_BOTH
Definition: Solver.java:2410
DecisionBuilder makeLocalSearchPhase(SequenceVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition: Solver.java:2058
Constraint makeNonEquality(IntExpr left, IntExpr right)
Definition: Solver.java:725
IntExpr makeOpposite(IntExpr expr)
Definition: Solver.java:510
Constraint makeDistribute(IntVar[] vars, int[] card_min, int[] card_max)
Definition: Solver.java:1100
IntExpr getExpression()
Definition: Solver.java:211
void addLocalSearchMonitor(LocalSearchMonitor monitor)
Definition: Solver.java:2267
static final int SPLIT_LOWER_HALF
Definition: Solver.java:2333
DisjunctiveConstraint makeDisjunctiveConstraint(IntervalVar[] intervals, String name)
Definition: Solver.java:1365
long failures()
Definition: Solver.java:393
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit)
Definition: Solver.java:2088
SolutionCollector makeAllSolutionCollector(Assignment assignment)
Definition: Solver.java:1465
SearchLimit makeLimit(SearchLimit limit_1, SearchLimit limit_2)
Definition: Solver.java:1608
static final int IN_ROOT_NODE
Definition: Solver.java:2421
DecisionBuilder makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator)
Definition: Solver.java:1803
IntVar makeIsMemberVar(IntExpr expr, int[] values)
Definition: Solver.java:1060
RegularLimit makeLimit(long time, long branches, long failures, long solutions)
Definition: Solver.java:1575
DecisionBuilder tryDecisions(DecisionBuilder[] dbs)
Definition: Solver.java:1783
Definition: Decision.java:11
static final int SWAPACTIVE
Definition: Solver.java:2361
Assignment GetOrCreateLocalSearchState()
Definition: Solver.java:2271
Constraint makeNotMemberCt(IntExpr expr, int[] values)
Definition: Solver.java:1030
static final int KEEP_LEFT
Definition: Solver.java:2408
Constraint makeIsDifferentCstCt(IntExpr var, long value, IntVar boolvar)
Definition: Solver.java:705
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2)
Definition: Solver.java:341
DecisionBuilder makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters)
Definition: Solver.java:2048
IntVar makeIsLessVar(IntExpr left, IntExpr right)
Definition: Solver.java:855
Constraint makePathCumul(IntVar[] nexts, IntVar[] active, IntVar[] cumuls, IntVar[] transits)
Definition: Solver.java:1200
Constraint makeDistribute(IntVar[] vars, long[] card_min, long[] card_max)
Definition: Solver.java:1095
static final int KEEP_RIGHT
Definition: Solver.java:2409
Constraint makeLessOrEqual(IntExpr expr, int value)
Definition: Solver.java:770
Constraint makeFalseConstraint()
Definition: Solver.java:660
SearchMonitor makeConstantRestart(int frequency)
Definition: Solver.java:1550
Constraint makeIndexOfConstraint(IntVar[] vars, IntVar index, long target)
Definition: Solver.java:975
Demon makeConstraintInitialPropagateCallback(Constraint ct)
Definition: Solver.java:980
SearchMonitor makeSymmetryManager(SymmetryBreaker v1)
Definition: Solver.java:1683
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder)
Definition: Solver.java:2083
IntVar getVariable()
Definition: Solver.java:202
IntVar[] makeBoolVarArray(int count, String name)
Definition: Solver.java:120
IntVar makeIsDifferentCstVar(IntExpr v1, IntExpr v2)
Definition: Solver.java:715
Constraint makeDistribute(IntVar[] vars, int[] values, int[] card_min, int[] card_max)
Definition: Solver.java:1110
Constraint makeMemberCt(IntExpr expr, int[] values)
Definition: Solver.java:1020
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active, LongPredicate sink_handler)
Definition: Solver.java:1175
Constraint makeAllowedAssignment(IntVar[] vars, IntTupleSet tuples)
Definition: Solver.java:1230
static com.google.ortools.constraintsolver.RegularLimitParameters parseFrom(java.nio.ByteBuffer data)
IntervalVar makeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar interval_var, long duration, long offset)
Definition: Solver.java:1320
static final int RELOCATE
Definition: Solver.java:2355
Constraint makeNullIntersectExcept(IntVar[] first_vars, IntVar[] second_vars, long escape_value)
Definition: Solver.java:1170
ModelVisitor makeStatisticsModelVisitor()
Definition: Solver.java:1673
static final int NOT_SET
Definition: Solver.java:2428
Decision makeVariableGreaterOrEqualValue(IntVar var, long value)
Definition: Solver.java:1713
Constraint makeCount(IntVar[] vars, long value, IntVar max_count)
Definition: Solver.java:1070
boolean currentlyInSolve()
Definition: Solver.java:2171
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors)
Definition: Solver.java:1958
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4)
Definition: Solver.java:1923
static final int IN_SEARCH
Definition: Solver.java:2422
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables)
Definition: Solver.java:1993
Constraint makeDistribute(IntVar[] vars, long card_min, long card_max, long card_size)
Definition: Solver.java:1090
DecisionBuilder compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition: Solver.java:1753
LocalSearchOperator makeOperator(IntVar[] vars, int op)
Definition: Solver.java:1973
void SetUseFastLocalSearch(boolean use_fast_local_search)
Definition: Solver.java:2192
IntExpr makeDiv(IntExpr numerator, IntExpr denominator)
Definition: Solver.java:530
String toString()
Definition: Solver.java:365
SolutionCollector makeNBestValueSolutionCollector(int solution_count, boolean maximize)
Definition: Solver.java:1460
static final int SIMPLELNS
Definition: Solver.java:2368
int state()
Definition: Solver.java:357
Constraint makeElementEquality(int[] vals, IntVar index, IntVar target)
Definition: Solver.java:955
LocalSearchPhaseParameters makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilter[] filters)
Definition: Solver.java:2093
static final int TSPOPT
Definition: Solver.java:2372
Constraint makeNonOverlappingNonStrictBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, int[] x_size, int[] y_size)
Definition: Solver.java:1270
static final int NO_CHANGE
Definition: Solver.java:2407
Constraint makeEquality(IntExpr left, IntExpr right)
Definition: Solver.java:690
Constraint makeLess(IntExpr left, IntExpr right)
Definition: Solver.java:865
static final int ENDS_AT_START
Definition: Solver.java:2389
boolean UseFastLocalSearch()
Definition: Solver.java:2196
Represents an operation upon three.
Demon makeDelayedConstraintInitialPropagateCallback(Constraint ct)
Definition: Solver.java:985
boolean solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition: Solver.java:345
static final int OROPT
Definition: Solver.java:2354
IntExpr makeMin(IntExpr expr, int value)
Definition: Solver.java:605
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, IntVar capacity, String name)
Definition: Solver.java:1385
Constraint makeGreaterOrEqual(IntExpr expr, long value)
Definition: Solver.java:800
Constraint makeEquality(IntervalVar var1, IntervalVar var2)
Definition: Solver.java:1410
IntVar makeIsGreaterOrEqualCstVar(IntExpr var, long value)
Definition: Solver.java:780
static final int GE
Definition: Solver.java:2376
Constraint makeCumulative(IntervalVar[] intervals, long[] demands, long capacity, String name)
Definition: Solver.java:1375
static final int INT_VALUE_DEFAULT
Definition: Solver.java:2327
IntExpr makeElement(LongUnaryOperator values, IntVar index)
Definition: Solver.java:560
FailException()
Definition: Solver.java:86
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3)
Definition: Solver.java:285
static final int STARTS_AFTER_END
Definition: Solver.java:2390
com.google.ortools.constraintsolver.ConstraintSolverParameters parameters()
Definition: Solver.java:235
Constraint makeScalProdEquality(IntVar[] vars, int[] coefficients, long cst)
Definition: Solver.java:905
RegularLimit makeSolutionsLimit(long solutions)
Definition: Solver.java:1570
Constraint makeGreaterOrEqual(IntExpr left, IntExpr right)
Definition: Solver.java:795
IntervalVar makeIntervalRelaxedMin(IntervalVar interval_var)
Definition: Solver.java:1330
DecisionBuilder makePhase(IntVar v0, IntVar v1, IntVar v2, int var_str, int val_str)
Definition: Solver.java:1843
static final int INT_VALUE_SIMPLE
Definition: Solver.java:2328
OptimizeVar makeMinimize(IntVar v, long step)
Definition: Solver.java:1475
Constraint makeMaxEquality(IntVar[] vars, IntVar max_var)
Definition: Solver.java:945
Constraint makeGreater(IntExpr expr, long value)
Definition: Solver.java:835
static final int CHOICE_POINT
Definition: Solver.java:2416
OptimizeVar makeOptimize(boolean maximize, IntVar v, long step)
Definition: Solver.java:1485
LocalSearchOperator makeRandomLnsOperator(IntVar[] vars, int number_of_variables, int seed)
Definition: Solver.java:1998
DecisionBuilder tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3)
Definition: Solver.java:1773
static final int CHOOSE_MAX_REGRET_ON_MIN
Definition: Solver.java:2323
RegularLimit makeTimeLimit(long time_in_ms)
Definition: Solver.java:1555
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3)
Definition: Solver.java:1918
LocalSearchOperator concatenateOperators(LocalSearchOperator[] ops)
Definition: Solver.java:2013
Constraint makeInversePermutationConstraint(IntVar[] left, IntVar[] right)
Definition: Solver.java:1150
IntExpr makeSum(IntExpr left, IntExpr right)
Definition: Solver.java:475
Constraint makeCircuit(IntVar[] nexts)
Definition: Solver.java:1190
static final int STAYS_IN_SYNC
Definition: Solver.java:2394
static final int LK
Definition: Solver.java:2371
LocalSearchOperator makeNeighborhoodLimit(LocalSearchOperator op, long limit)
Definition: Solver.java:2038
SearchMonitor makeTabuSearch(boolean maximize, IntVar v, long step, IntVar[] vars, long keep_tenure, long forbid_tenure, double tabu_factor)
Definition: Solver.java:1520
void checkFail()
Definition: Solver.java:2305
Definition: Pack.java:18
DecisionBuilder compose(DecisionBuilder[] dbs)
Definition: Solver.java:1763
IntVar makeIsMemberVar(IntExpr expr, long[] values)
Definition: Solver.java:1055
SolutionCollector makeFirstSolutionCollector()
Definition: Solver.java:1430
DecisionBuilder makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2)
Definition: Solver.java:1943
IntVar makeIntVar(long min, long max)
Definition: Solver.java:440
IntVar makeIsGreaterOrEqualVar(IntExpr left, IntExpr right)
Definition: Solver.java:785
void restartCurrentSearch()
Definition: Solver.java:2297
Constraint makeSumGreaterOrEqual(IntVar[] vars, long cst)
Definition: Solver.java:885
ModelVisitor makePrintModelVisitor()
Definition: Solver.java:1668
static final int ENDS_BEFORE
Definition: Solver.java:2399
static final int PROBLEM_INFEASIBLE
Definition: Solver.java:2425
Constraint makeTemporalDisjunction(IntervalVar t1, IntervalVar t2)
Definition: Solver.java:1360
Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, int[] x_size, int[] y_size)
Definition: Solver.java:1255
long wallTime()
Definition: Solver.java:373
int rand32(int size)
Definition: Solver.java:2155
Constraint makeFalseConstraint(String explanation)
Definition: Solver.java:665
static final int SENTINEL
Definition: Solver.java:2414
static final int CHOOSE_FIRST_UNBOUND
Definition: Solver.java:2313
static final int NORMAL_PRIORITY
Definition: Solver.java:2383
long neighbors()
Definition: Solver.java:397
boolean solve(DecisionBuilder db, SearchMonitor m1)
Definition: Solver.java:277
DecisionBuilder makePhase(IntVar[] vars, int var_str, int val_str)
Definition: Solver.java:1788
long unchecked_solutions()
Definition: Solver.java:385
Demon registerDemon(Demon demon)
Definition: Solver.java:2204
IntExpr makeElement(int[] values, IntVar index)
Definition: Solver.java:555
static final int MINIMIZATION
Definition: Solver.java:2430
static final int CHOOSE_HIGHEST_MAX
Definition: Solver.java:2320
Constraint makeElementEquality(IntVar[] vars, IntVar index, long target)
Definition: Solver.java:965
IntExpr makeProd(IntExpr expr, long value)
Definition: Solver.java:520
IntVar makeIsLessCstVar(IntExpr var, long value)
Definition: Solver.java:850
Constraint makeLessOrEqual(IntExpr left, IntExpr right)
Definition: Solver.java:760
SearchMonitor makeExitSearchCallback(Runnable callback)
Definition: Solver.java:1658
Constraint makeCount(IntVar[] vars, long value, long max_count)
Definition: Solver.java:1065
DecisionBuilder makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2)
Definition: Solver.java:1913
IntVar registerIntVar(IntVar var)
Definition: Solver.java:2214
boolean solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4)
Definition: Solver.java:289
static final int DELAYED_PRIORITY
Definition: Solver.java:2381
SolutionCollector makeNBestValueSolutionCollector(Assignment assignment, int solution_count, boolean maximize)
Definition: Solver.java:1455
Pack makePack(IntVar[] vars, int number_of_bins)
Definition: Solver.java:1275
Constraint makeDistribute(IntVar[] vars, long[] values, IntVar[] cards)
Definition: Solver.java:1075
boolean checkConstraint(Constraint ct)
Definition: Solver.java:353
IntExpr makeAbs(IntExpr expr)
Definition: Solver.java:535
Constraint makeMapDomain(IntVar var, IntVar[] actives)
Definition: Solver.java:1225
long stamp()
Definition: Solver.java:409
Definition: Solver.java:162
void pushState()
Definition: Solver.java:2131
Constraint makeIsLessCstCt(IntExpr v, long c, IntVar b)
Definition: Solver.java:845
IntExpr makeSemiContinuousExpr(IntExpr expr, long fixed_charge, long step)
Definition: Solver.java:635
void setVariable(IntVar value)
Definition: Solver.java:198
DecisionBuilder makeSolveOnce(DecisionBuilder db)
Definition: Solver.java:1903
IntVar makeIsEqualCstVar(IntExpr var, long value)
Definition: Solver.java:675
void newSearch(DecisionBuilder db)
Definition: Solver.java:297
static final int EXTENDEDSWAPACTIVE
Definition: Solver.java:2362
static final int ASSIGN_RANDOM_VALUE
Definition: Solver.java:2331
static final int ENDS_AFTER
Definition: Solver.java:2397
int searchDepth()
Definition: Solver.java:2139
Constraint makeAbsEquality(IntVar var, IntVar abs_var)
Definition: Solver.java:970
Decision makeRankLastInterval(SequenceVar sequence, int index)
Definition: Solver.java:1868
IntVar makeIsBetweenVar(IntExpr v, long l, long u)
Definition: Solver.java:1010
Constraint makeNoCycle(IntVar[] nexts, IntVar[] active)
Definition: Solver.java:1180
static final int CHOOSE_DYNAMIC_GLOBAL_BEST
Definition: Solver.java:2338
static final int EXCHANGE
Definition: Solver.java:2356
static final int CHOOSE_MIN_SIZE_LOWEST_MAX
Definition: Solver.java:2317
static final int CHOOSE_MAX_SIZE
Definition: Solver.java:2322
Assignment makeAssignment(Assignment a)
Definition: Solver.java:1420
IntExpr makeMin(IntVar[] vars)
Definition: Solver.java:590
Constraint makeLexicalLess(IntVar[] left, IntVar[] right)
Definition: Solver.java:1140
Constraint makeLexicalLessOrEqual(IntVar[] left, IntVar[] right)
Definition: Solver.java:1145
Constraint makeGreater(IntExpr left, IntExpr right)
Definition: Solver.java:830
void addPropagationMonitor(PropagationMonitor monitor)
Definition: Solver.java:2258
SolutionCollector makeFirstSolutionCollector(Assignment assignment)
Definition: Solver.java:1425
IntVar makeIsLessOrEqualCstVar(IntExpr var, long value)
Definition: Solver.java:745
boolean instrumentsVariables()
Definition: Solver.java:2241
IntExpr makeElement(LongBinaryOperator values, IntVar index1, IntVar index2)
Definition: Solver.java:570
long acceptedNeighbors()
Definition: Solver.java:405
LocalSearchOperator makeOperator(IntVar[] vars, IntVar[] secondary_vars, int op)
Definition: Solver.java:1978
SolutionCollector makeLastSolutionCollector(Assignment assignment)
Definition: Solver.java:1435
Definition: Solver.java:54
IntVar makeIntVar(long min, long max, String name)
Definition: Solver.java:425
SearchMonitor makeGuidedLocalSearch(boolean maximize, IntVar objective, LongTernaryOperator objective_function, long step, IntVar[] vars, IntVar[] secondary_vars, double penalty_factor)
Definition: Solver.java:1540
IntExpr makeProd(IntExpr left, IntExpr right)
Definition: Solver.java:515
SearchMonitor makeSearchLog(int branch_period, IntVar var)
Definition: Solver.java:1623
IntVar makeBoolVar()
Definition: Solver.java:460
int topProgressPercent()
Definition: Solver.java:2127
boolean solve(DecisionBuilder db, SearchMonitor[] monitors)
Definition: Solver.java:269
static final int SWITCH_BRANCHES
Definition: Solver.java:2411
IntExpr makeScalProd(IntVar[] vars, long[] coefs)
Definition: Solver.java:490
boolean isProfilingEnabled()
Definition: Solver.java:2233
IntVar makeIntVar(int[] values)
Definition: Solver.java:450
Constraint makeLess(IntExpr expr, int value)
Definition: Solver.java:875
long demon_runs(int p)
Definition: Solver.java:389
IntVar makeIsEqualVar(IntExpr v1, IntExpr v2)
Definition: Solver.java:685
static final int MAXIMIZATION
Definition: Solver.java:2429
Constraint makeNonOverlappingBoxesConstraint(IntVar[] x_vars, IntVar[] y_vars, IntVar[] x_size, IntVar[] y_size)
Definition: Solver.java:1245