Uses of Class
com.google.ortools.constraintsolver.DecisionBuilder
Packages that use DecisionBuilder
-
Uses of DecisionBuilder in com.google.ortools.constraintsolver
Subclasses of DecisionBuilder in com.google.ortools.constraintsolverModifier and TypeClassDescriptionclassThis class acts as a intermediate step between a c++ decision builder and a java one.Methods in com.google.ortools.constraintsolver that return DecisionBuilderModifier and TypeMethodDescriptionSolver.compose(DecisionBuilder[] dbs) Solver.compose(DecisionBuilder db1, DecisionBuilder db2) Creates a decision builder which sequentially composes decision builders.
At each leaf of a decision builder, the next decision builder is therefore
called.Solver.compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3) Solver.compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4) DefaultPhaseParameters.getDecisionBuilder()When defined, this overrides the default impact based decision builder.Solver.makeConstraintAdder(Constraint ct) Returns a decision builder that will add the given constraint to
the model.Solver.makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars) Returns a decision builder for which the left-most leaf corresponds
to assignment, the rest of the tree being explored using 'db'.Solver.makeDefaultPhase(IntVar[] vars) Solver.makeDefaultPhase(IntVar[] vars, DefaultPhaseParameters parameters) RoutingModel.makeGuidedSlackFinalizer(RoutingDimension dimension, LongUnaryOperator initializer) The next few members are in the public section only for testing purposes.
MakeGuidedSlackFinalizer creates a DecisionBuilder for the slacks of a
dimension using a callback to choose which values to start with.
The finalizer works only when all next variables in the model have
been fixed.Solver.makeLocalSearchPhase(Assignment assignment, LocalSearchPhaseParameters parameters) Local Search decision builders factories.
Local search is used to improve a given solution.Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) Variant with a sub_decison_builder specific to the first solution.Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters) Solver.makeLocalSearchPhase(SequenceVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step) NestedOptimize will collapse a search tree described by a
decision builder 'db' and a set of monitors and wrap it into a
single point.Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) Solver.makePhase(IntervalVar[] intervals, int str) Scheduling phases.Phases on IntVar arrays.
for all other functions that have several homonyms in this .h).Solver.makePhase(IntVar[] vars, int var_str, LongTernaryPredicate var_val1_val2_comparator) var_val1_val2_comparator(var, val1, val2) is true iff assigning value
"val1" to variable "var" is better than assigning value "val2".Solver.makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator) Solver.makePhase(IntVar[] vars, int var_str, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) Solver.makePhase(IntVar[] vars, LongBinaryOperator eval, int str) Returns a decision builder which assigns values to variables which
minimize the values returned by the evaluator.Solver.makePhase(IntVar[] vars, LongBinaryOperator eval, LongUnaryOperator tie_breaker, int str) Returns a decision builder which assigns values to variables
which minimize the values returned by the evaluator.Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, int val_str) Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator) Solver.makePhase(IntVar[] vars, LongUnaryOperator var_evaluator, LongBinaryOperator value_evaluator, LongUnaryOperator tie_breaker) Shortcuts for small arrays.Solver.makePhase(SequenceVar[] sequences, int str) Activates profiling on a decision builder.Solver.makeRestoreAssignment(Assignment assignment) Returns a DecisionBuilder which restores an Assignment
(calls void Assignment::Restore())RoutingModel.makeSelfDependentDimensionFinalizer(RoutingDimension dimension) MakeSelfDependentDimensionFinalizer is a finalizer for the slacks of a
self-dependent dimension.Solver.makeSolveOnce(DecisionBuilder db) SolveOnce will collapse a search tree described by a decision
builder 'db' and a set of monitors and wrap it into a single point.
If there are no solutions to this nested tree, then SolveOnce will
fail.Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor[] monitors) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) Solver.makeStoreAssignment(Assignment assignment) Returns a DecisionBuilder which stores an Assignment
(calls void Assignment::Store())Solver.tryDecisions(DecisionBuilder[] dbs) Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2) Creates a decision builder which will create a search tree where each
decision builder is called from the top of the search tree.Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3) Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4) Methods in com.google.ortools.constraintsolver with parameters of type DecisionBuilderModifier and TypeMethodDescriptionvoidOptimizeVar.beginNextDecision(DecisionBuilder db) Internal methods.voidSearchLimit.beginNextDecision(DecisionBuilder b) voidSearchMonitor.beginNextDecision(DecisionBuilder b) Before calling DecisionBuilder::Next.Solver.compose(DecisionBuilder[] dbs) Solver.compose(DecisionBuilder db1, DecisionBuilder db2) Creates a decision builder which sequentially composes decision builders.
At each leaf of a decision builder, the next decision builder is therefore
called.Solver.compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3) Solver.compose(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4) static final voidmainJNI.DecisionBuilder_change_ownership(DecisionBuilder obj, long cptr, boolean take_or_release) static final voidmainJNI.DecisionBuilder_director_connect(DecisionBuilder obj, long cptr, boolean mem_own, boolean weak_global) static final StringmainJNI.DecisionBuilder_GetName(long jarg1, DecisionBuilder jarg1_) static final longmainJNI.DecisionBuilder_nextWrap(long jarg1, DecisionBuilder jarg1_, long jarg2, Solver jarg2_) static final voidmainJNI.DecisionBuilder_set_name(long jarg1, DecisionBuilder jarg1_, String jarg2) static final StringmainJNI.DecisionBuilder_toString(long jarg1, DecisionBuilder jarg1_) static final StringmainJNI.DecisionBuilder_toStringSwigExplicitDecisionBuilder(long jarg1, DecisionBuilder jarg1_) static final voidmainJNI.DefaultPhaseParameters_decisionBuilder_set(long jarg1, DefaultPhaseParameters jarg1_, long jarg2, DecisionBuilder jarg2_) voidSearchMonitor.endNextDecision(DecisionBuilder b, Decision d) After calling DecisionBuilder::Next, along with the returned decision.static longDecisionBuilder.getCPtr(DecisionBuilder obj) voidDefaultPhaseParameters.keepAliveDecisionBuilder(DecisionBuilder db) voidOptimizeVar.keepAliveDecisionBuilder(DecisionBuilder db) voidSearchLimit.keepAliveDecisionBuilder(DecisionBuilder db) voidSearchMonitor.keepAliveDecisionBuilder(DecisionBuilder db) voidSolver.keepAliveDecisionBuilder(DecisionBuilder db) voidSolver.keepAliveDecisionBuilder(DecisionBuilder[] dbs) Solver.makeDecisionBuilderFromAssignment(Assignment assignment, DecisionBuilder db, IntVar[] vars) Returns a decision builder for which the left-most leaf corresponds
to assignment, the rest of the tree being explored using 'db'.Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, DecisionBuilder first_solution_sub_decision_builder, LocalSearchPhaseParameters parameters) Variant with a sub_decison_builder specific to the first solution.Solver.makeLocalSearchPhase(IntVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters) Solver.makeLocalSearchPhase(SequenceVar[] vars, DecisionBuilder first_solution, LocalSearchPhaseParameters parameters) Solver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder) Local Search Phase ParametersSolver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit) Solver.makeLocalSearchPhaseParameters(IntVar objective, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit) Solver.makeLocalSearchPhaseParameters(IntVar objective, SolutionPool pool, LocalSearchOperator ls_operator, DecisionBuilder sub_decision_builder, RegularLimit limit, LocalSearchFilterManager filter_manager) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step) NestedOptimize will collapse a search tree described by a
decision builder 'db' and a set of monitors and wrap it into a
single point.Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor[] monitors) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) Solver.makeNestedOptimize(DecisionBuilder db, Assignment solution, boolean maximize, long step, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) Activates profiling on a decision builder.Solver.makeSolveOnce(DecisionBuilder db) SolveOnce will collapse a search tree described by a decision
builder 'db' and a set of monitors and wrap it into a single point.
If there are no solutions to this nested tree, then SolveOnce will
fail.Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor[] monitors) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3) Solver.makeSolveOnce(DecisionBuilder db, SearchMonitor monitor1, SearchMonitor monitor2, SearchMonitor monitor3, SearchMonitor monitor4) voidSolver.newSearch(DecisionBuilder db) voidSolver.newSearch(DecisionBuilder db, SearchMonitor m1) voidSolver.newSearch(DecisionBuilder db, SearchMonitor[] monitors)
Decomposed search.
The code for a top level search should look like
solver->NewSearch(db);
while (solver->NextSolution()) {
.. use the current solution
}
solver()->EndSearch();voidSolver.newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2) voidSolver.newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3) voidSolver.newSearch(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4) static final voidmainJNI.OptimizeVar_beginNextDecision(long jarg1, OptimizeVar jarg1_, long jarg2, DecisionBuilder jarg2_) static final voidmainJNI.SearchLimit_beginNextDecision(long jarg1, SearchLimit jarg1_, long jarg2, DecisionBuilder jarg2_) static final voidmainJNI.SearchMonitor_beginNextDecision(long jarg1, SearchMonitor jarg1_, long jarg2, DecisionBuilder jarg2_) static final voidmainJNI.SearchMonitor_beginNextDecisionSwigExplicitSearchMonitor(long jarg1, SearchMonitor jarg1_, long jarg2, DecisionBuilder jarg2_) static final voidmainJNI.SearchMonitor_endNextDecision(long jarg1, SearchMonitor jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Decision jarg3_) static final voidmainJNI.SearchMonitor_endNextDecisionSwigExplicitSearchMonitor(long jarg1, SearchMonitor jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Decision jarg3_) voidDefaultPhaseParameters.setDecisionBuilder(DecisionBuilder value) When defined, this overrides the default impact based decision builder.booleanSolver.solve(DecisionBuilder db) booleanSolver.solve(DecisionBuilder db, SearchMonitor m1) booleanSolver.solve(DecisionBuilder db, SearchMonitor[] monitors)
Solves the problem using the given DecisionBuilder and returns true if a
solution was found and accepted.
These methods are the ones most users should use to search for a solution.
Note that the definition of 'solution' is subtle.booleanSolver.solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2) booleanSolver.solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3) booleanSolver.solve(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3, SearchMonitor m4) booleanSolver.solveAndCommit(DecisionBuilder db) booleanSolver.solveAndCommit(DecisionBuilder db, SearchMonitor m1) booleanSolver.solveAndCommit(DecisionBuilder db, SearchMonitor[] monitors)
SolveAndCommit using a decision builder and up to three
search monitors, usually one for the objective, one for the limits
and one to collect solutions.
The difference between a SolveAndCommit() and a Solve() method
call is the fact that SolveAndCommit will not backtrack all
modifications at the end of the search.booleanSolver.solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2) booleanSolver.solveAndCommit(DecisionBuilder db, SearchMonitor m1, SearchMonitor m2, SearchMonitor m3) static final longmainJNI.Solver_compose__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_) static final longmainJNI.Solver_compose__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_) static final longmainJNI.Solver_compose__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, DecisionBuilder jarg5_) static final longmainJNI.Solver_compose__SWIG_3(long jarg1, Solver jarg1_, DecisionBuilder[] jarg2) static final longmainJNI.Solver_makeDecisionBuilderFromAssignment(long jarg1, Solver jarg1_, long jarg2, Assignment jarg2_, long jarg3, DecisionBuilder jarg3_, IntVar[] jarg4) static final longmainJNI.Solver_makeLocalSearchPhase__SWIG_1(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, DecisionBuilder jarg3_, long jarg4, LocalSearchPhaseParameters jarg4_) static final longmainJNI.Solver_makeLocalSearchPhase__SWIG_2(long jarg1, Solver jarg1_, IntVar[] jarg2, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, LocalSearchPhaseParameters jarg5_) static final longmainJNI.Solver_makeLocalSearchPhase__SWIG_3(long jarg1, Solver jarg1_, SequenceVar[] jarg2, long jarg3, DecisionBuilder jarg3_, long jarg4, LocalSearchPhaseParameters jarg4_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_0(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_1(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, RegularLimit jarg5_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_2(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, LocalSearchOperator jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, RegularLimit jarg5_, long jarg6, LocalSearchFilterManager jarg6_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_3(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_4(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_, long jarg6, RegularLimit jarg6_) static final longmainJNI.Solver_makeLocalSearchPhaseParameters__SWIG_5(long jarg1, Solver jarg1_, long jarg2, IntVar jarg2_, long jarg3, SolutionPool jarg3_, long jarg4, LocalSearchOperator jarg4_, long jarg5, DecisionBuilder jarg5_, long jarg6, RegularLimit jarg6_, long jarg7, LocalSearchFilterManager jarg7_) static final longmainJNI.Solver_makeNestedOptimize__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5) static final longmainJNI.Solver_makeNestedOptimize__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5, long jarg6, SearchMonitor jarg6_) static final longmainJNI.Solver_makeNestedOptimize__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5, long jarg6, SearchMonitor jarg6_, long jarg7, SearchMonitor jarg7_) static final longmainJNI.Solver_makeNestedOptimize__SWIG_3(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5, long jarg6, SearchMonitor jarg6_, long jarg7, SearchMonitor jarg7_, long jarg8, SearchMonitor jarg8_) static final longmainJNI.Solver_makeNestedOptimize__SWIG_4(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5, long jarg6, SearchMonitor jarg6_, long jarg7, SearchMonitor jarg7_, long jarg8, SearchMonitor jarg8_, long jarg9, SearchMonitor jarg9_) static final longmainJNI.Solver_makeNestedOptimize__SWIG_5(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, Assignment jarg3_, boolean jarg4, long jarg5, SearchMonitor[] jarg6) static final longmainJNI.Solver_MakeProfiledDecisionBuilderWrapper(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_) static final longmainJNI.Solver_makeSolveOnce__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_) static final longmainJNI.Solver_makeSolveOnce__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_) static final longmainJNI.Solver_makeSolveOnce__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_) static final longmainJNI.Solver_makeSolveOnce__SWIG_3(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_) static final longmainJNI.Solver_makeSolveOnce__SWIG_4(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_, long jarg6, SearchMonitor jarg6_) static final longmainJNI.Solver_makeSolveOnce__SWIG_5(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, SearchMonitor[] jarg3) static final voidmainJNI.Solver_newSearch__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, SearchMonitor[] jarg3) static final voidmainJNI.Solver_newSearch__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_) static final voidmainJNI.Solver_newSearch__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_) static final voidmainJNI.Solver_newSearch__SWIG_3(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_) static final voidmainJNI.Solver_newSearch__SWIG_4(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_) static final voidmainJNI.Solver_newSearch__SWIG_5(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_, long jarg6, SearchMonitor jarg6_) static final booleanmainJNI.Solver_solve__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, SearchMonitor[] jarg3) static final booleanmainJNI.Solver_solve__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_) static final booleanmainJNI.Solver_solve__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_) static final booleanmainJNI.Solver_solve__SWIG_3(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_) static final booleanmainJNI.Solver_solve__SWIG_4(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_) static final booleanmainJNI.Solver_solve__SWIG_5(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_, long jarg6, SearchMonitor jarg6_) static final booleanmainJNI.Solver_solveAndCommit__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, SearchMonitor[] jarg3) static final booleanmainJNI.Solver_solveAndCommit__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_) static final booleanmainJNI.Solver_solveAndCommit__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_) static final booleanmainJNI.Solver_solveAndCommit__SWIG_3(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_) static final booleanmainJNI.Solver_solveAndCommit__SWIG_4(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, SearchMonitor jarg3_, long jarg4, SearchMonitor jarg4_, long jarg5, SearchMonitor jarg5_) static final longmainJNI.Solver_tryDecisions__SWIG_0(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_) static final longmainJNI.Solver_tryDecisions__SWIG_1(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_) static final longmainJNI.Solver_tryDecisions__SWIG_2(long jarg1, Solver jarg1_, long jarg2, DecisionBuilder jarg2_, long jarg3, DecisionBuilder jarg3_, long jarg4, DecisionBuilder jarg4_, long jarg5, DecisionBuilder jarg5_) static final longmainJNI.Solver_tryDecisions__SWIG_3(long jarg1, Solver jarg1_, DecisionBuilder[] jarg2) static longmainJNI.SwigDirector_DecisionBuilder_nextWrap(DecisionBuilder jself, long s) static StringmainJNI.SwigDirector_DecisionBuilder_toString(DecisionBuilder jself) static longDecisionBuilder.swigRelease(DecisionBuilder obj) Solver.tryDecisions(DecisionBuilder[] dbs) Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2) Creates a decision builder which will create a search tree where each
decision builder is called from the top of the search tree.Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3) Solver.tryDecisions(DecisionBuilder db1, DecisionBuilder db2, DecisionBuilder db3, DecisionBuilder db4)