C++ Reference
C++ Reference: Routing
Solver Member List
This is the complete list of members for Solver, including all inherited members.
| Accept(ModelVisitor *const visitor) const | Solver | |
| accepted_neighbors() const | Solver | inline |
| Action typedef | Solver | |
| ActiveSearch() const | Solver | |
| AddBacktrackAction(Action a, bool fast) | Solver | |
| AddCastConstraint(CastConstraint *const constraint, IntVar *const target_var, IntExpr *const expr) | Solver | |
| AddConstraint(Constraint *const c) | Solver | |
| AddLocalSearchMonitor(LocalSearchMonitor *monitor) | Solver | |
| AddPropagationMonitor(PropagationMonitor *const monitor) | Solver | |
| ASSIGN_CENTER_VALUE enum value | Solver | |
| ASSIGN_MAX_VALUE enum value | Solver | |
| ASSIGN_MIN_VALUE enum value | Solver | |
| ASSIGN_RANDOM_VALUE enum value | Solver | |
| AT_SOLUTION enum value | Solver | |
| AVOID_DATE enum value | Solver | |
| balancing_decision() const | Solver | inline |
| BaseIntExpr class | Solver | friend |
| BinaryIntervalRelation enum name | Solver | |
| branches() const | Solver | inline |
| BranchSelector typedef | Solver | |
| Cache() const | Solver | |
| CastExpression(const IntVar *const var) const | Solver | |
| CheckAssignment(Assignment *const solution) | Solver | |
| CheckConstraint(Constraint *const ct) | Solver | |
| CheckFail() | Solver | inline |
| CHOICE_POINT enum value | Solver | |
| CHOOSE_DYNAMIC_GLOBAL_BEST enum value | Solver | |
| CHOOSE_FIRST_UNBOUND enum value | Solver | |
| CHOOSE_HIGHEST_MAX enum value | Solver | |
| CHOOSE_LOWEST_MIN enum value | Solver | |
| CHOOSE_MAX_REGRET_ON_MIN enum value | Solver | |
| CHOOSE_MAX_SIZE enum value | Solver | |
| CHOOSE_MIN_SIZE enum value | Solver | |
| CHOOSE_MIN_SIZE_HIGHEST_MAX enum value | Solver | |
| CHOOSE_MIN_SIZE_HIGHEST_MIN enum value | Solver | |
| CHOOSE_MIN_SIZE_LOWEST_MAX enum value | Solver | |
| CHOOSE_MIN_SIZE_LOWEST_MIN enum value | Solver | |
| CHOOSE_MIN_SLACK_RANK_FORWARD enum value | Solver | |
| CHOOSE_PATH enum value | Solver | |
| CHOOSE_RANDOM enum value | Solver | |
| CHOOSE_RANDOM_RANK_FORWARD enum value | Solver | |
| CHOOSE_STATIC_GLOBAL_BEST enum value | Solver | |
| clear_fail_intercept() | Solver | inline |
| ClearLocalSearchState() | Solver | inline |
| Closure typedef | Solver | |
| Compose(DecisionBuilder *const db1, DecisionBuilder *const db2) | Solver | |
| Compose(DecisionBuilder *const db1, DecisionBuilder *const db2, DecisionBuilder *const db3) | Solver | |
| Compose(DecisionBuilder *const db1, DecisionBuilder *const db2, DecisionBuilder *const db3, DecisionBuilder *const db4) | Solver | |
| Compose(const std::vector< DecisionBuilder * > &dbs) | Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops) | Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, bool restart) | Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, std::function< int64(int, int)> evaluator) | Solver | |
| Constraint class | Solver | friend |
| constraints() const | Solver | inline |
| CROSS enum value | Solver | |
| CROSS_DATE enum value | Solver | |
| CurrentlyInSolve() const | Solver | |
| DebugString() const | Solver | |
| DecisionModification enum name | Solver | |
| DECREMENT enum value | Solver | |
| DefaultSolverParameters() | Solver | static |
| DELAYED_PRIORITY enum value | Solver | |
| demon_profiler() const | Solver | inline |
| demon_runs(DemonPriority p) const | Solver | inline |
| DemonPriority enum name | Solver | |
| DemonProfiler class | Solver | friend |
| ENDS_AFTER enum value | Solver | |
| ENDS_AFTER_END enum value | Solver | |
| ENDS_AFTER_START enum value | Solver | |
| ENDS_AT enum value | Solver | |
| ENDS_AT_END enum value | Solver | |
| ENDS_AT_START enum value | Solver | |
| ENDS_BEFORE enum value | Solver | |
| EndSearch() | Solver | |
| EQ enum value | Solver | |
| EvaluatorLocalSearchOperators enum name | Solver | |
| EvaluatorStrategy enum name | Solver | |
| EXCHANGE enum value | Solver | |
| ExportProfilingOverview(const std::string &filename) | Solver | |
| EXTENDEDSWAPACTIVE enum value | Solver | |
| Fail() | Solver | |
| fail_stamp() const | Solver | |
| failures() const | Solver | inline |
| filtered_neighbors() const | Solver | inline |
| FindOneNeighbor class | Solver | friend |
| FinishCurrentSearch() | Solver | |
| FULLPATHLNS enum value | Solver | |
| GE enum value | Solver | |
| GetLocalSearchMonitor() const | Solver | |
| GetOrCreateLocalSearchState() | Solver | |
| GetPropagationMonitor() const | Solver | |
| HasName(const PropagationBaseObject *object) const | Solver | |
| IN_ROOT_NODE enum value | Solver | |
| IN_SEARCH enum value | Solver | |
| INCREMENT enum value | Solver | |
| IndexEvaluator1 typedef | Solver | |
| IndexEvaluator2 typedef | Solver | |
| IndexEvaluator3 typedef | Solver | |
| IndexFilter1 typedef | Solver | |
| InstrumentsDemons() const | Solver | |
| InstrumentsVariables() const | Solver | |
| Int64ToIntVar typedef | Solver | |
| INT_VALUE_DEFAULT enum value | Solver | |
| INT_VALUE_SIMPLE enum value | Solver | |
| INT_VAR_DEFAULT enum value | Solver | |
| INT_VAR_SIMPLE enum value | Solver | |
| InternalSaveBooleanVarValue(Solver *const, IntVar *const) | Solver | friend |
| INTERVAL_DEFAULT enum value | Solver | |
| INTERVAL_SET_TIMES_BACKWARD enum value | Solver | |
| INTERVAL_SET_TIMES_FORWARD enum value | Solver | |
| INTERVAL_SIMPLE enum value | Solver | |
| IntervalStrategy enum name | Solver | |
| IntValueStrategy enum name | Solver | |
| IntVar class | Solver | friend |
| IntVarStrategy enum name | Solver | |
| IsBooleanVar(IntExpr *const expr, IntVar **inner_var, bool *is_negated) const | Solver | |
| IsLocalSearchProfilingEnabled() const | Solver | |
| IsProduct(IntExpr *const expr, IntExpr **inner_expr, int64 *coefficient) | Solver | |
| IsProfilingEnabled() const | Solver | |
| KEEP_LEFT enum value | Solver | |
| KEEP_RIGHT enum value | Solver | |
| KILL_BOTH enum value | Solver | |
| kNumPriorities | Solver | static |
| LE enum value | Solver | |
| LK enum value | Solver | |
| LocalSearchFilterBound enum name | Solver | |
| LocalSearchOperators enum name | Solver | |
| LocalSearchProfile() const | Solver | |
| LocalSearchProfiler class | Solver | friend |
| MakeAbs(IntExpr *const expr) | Solver | |
| MakeAbsEquality(IntVar *const var, IntVar *const abs_var) | Solver | |
| MakeAcceptFilter() | Solver | |
| MakeActionDemon(Action action) | Solver | |
| MAKEACTIVE enum value | Solver | |
| MakeAllDifferent(const std::vector< IntVar * > &vars) | Solver | |
| MakeAllDifferent(const std::vector< IntVar * > &vars, bool stronger_propagation) | Solver | |
| MakeAllDifferentExcept(const std::vector< IntVar * > &vars, int64 escape_value) | Solver | |
| MakeAllowedAssignments(const std::vector< IntVar * > &vars, const IntTupleSet &tuples) | Solver | |
| MakeAllSolutionCollector(const Assignment *const assignment) | Solver | |
| MakeAllSolutionCollector() | Solver | |
| MakeApplyBranchSelector(BranchSelector bs) | Solver | |
| MakeAssignment() | Solver | |
| MakeAssignment(const Assignment *const a) | Solver | |
| MakeAssignVariablesValues(const std::vector< IntVar * > &vars, const std::vector< int64 > &values) | Solver | |
| MakeAssignVariableValue(IntVar *const var, int64 val) | Solver | |
| MakeAssignVariableValueOrDoNothing(IntVar *const var, int64 value) | Solver | |
| MakeAssignVariableValueOrFail(IntVar *const var, int64 value) | Solver | |
| MakeAtMost(std::vector< IntVar * > vars, int64 value, int64 max_count) | Solver | |
| MakeAtSolutionCallback(std::function< void()> callback) | Solver | |
| MakeBestValueSolutionCollector(const Assignment *const assignment, bool maximize) | Solver | |
| MakeBestValueSolutionCollector(bool maximize) | Solver | |
| MakeBetweenCt(IntExpr *const expr, int64 l, int64 u) | Solver | |
| MakeBoolVar(const std::string &name) | Solver | |
| MakeBoolVar() | Solver | |
| MakeBoolVarArray(int var_count, const std::string &name, std::vector< IntVar * > *vars) | Solver | |
| MakeBoolVarArray(int var_count, std::vector< IntVar * > *vars) | Solver | |
| MakeBoolVarArray(int var_count, const std::string &name) | Solver | |
| MakeBranchesLimit(int64 branches) | Solver | |
| MAKECHAININACTIVE enum value | Solver | |
| MakeCircuit(const std::vector< IntVar * > &nexts) | Solver | |
| MakeClosureDemon(Closure closure) | Solver | |
| MakeConditionalExpression(IntVar *const condition, IntExpr *const expr, int64 unperformed_value) | Solver | |
| MakeConstantRestart(int frequency) | Solver | |
| MakeConstraintAdder(Constraint *const ct) | Solver | |
| MakeConstraintInitialPropagateCallback(Constraint *const ct) | Solver | |
| MakeConvexPiecewiseExpr(IntExpr *expr, int64 early_cost, int64 early_date, int64 late_date, int64 late_cost) | Solver | |
| MakeCount(const std::vector< IntVar * > &vars, int64 value, int64 max_count) | Solver | |
| MakeCount(const std::vector< IntVar * > &vars, int64 value, IntVar *const max_count) | Solver | |
| MakeCover(const std::vector< IntervalVar * > &vars, IntervalVar *const target_var) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int64 > &demands, int64 capacity, const std::string &name) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int > &demands, int64 capacity, const std::string &name) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int64 > &demands, IntVar *const capacity, const std::string &name) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int > &demands, IntVar *const capacity, const std::string &name) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< IntVar * > &demands, int64 capacity, const std::string &name) | Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< IntVar * > &demands, IntVar *const capacity, const std::string &name) | Solver | |
| MakeCustomLimit(std::function< bool()> limiter) | Solver | |
| MakeDecision(Action apply, Action refute) | Solver | |
| MakeDecisionBuilderFromAssignment(Assignment *const assignment, DecisionBuilder *const db, const std::vector< IntVar * > &vars) | Solver | |
| MakeDefaultPhase(const std::vector< IntVar * > &vars) | Solver | |
| MakeDefaultPhase(const std::vector< IntVar * > &vars, const DefaultPhaseParameters ¶meters) | Solver | |
| MakeDefaultRegularLimitParameters() const | Solver | |
| MakeDefaultSolutionPool() | Solver | |
| MakeDelayedConstraintInitialPropagateCallback(Constraint *const ct) | Solver | |
| MakeDelayedPathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &transits) | Solver | |
| MakeDeviation(const std::vector< IntVar * > &vars, IntVar *const deviation_var, int64 total_sum) | Solver | |
| MakeDifference(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeDifference(int64 value, IntExpr *const expr) | Solver | |
| MakeDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64 > &values, const std::vector< IntVar * > &cards) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &values, const std::vector< IntVar * > &cards) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &cards) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, int64 card_min, int64 card_max, int64 card_size) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64 > &card_min, const std::vector< int64 > &card_max) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &card_min, const std::vector< int > &card_max) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64 > &values, const std::vector< int64 > &card_min, const std::vector< int64 > &card_max) | Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &values, const std::vector< int > &card_min, const std::vector< int > &card_max) | Solver | |
| MakeDiv(IntExpr *const expr, int64 value) | Solver | |
| MakeDiv(IntExpr *const numerator, IntExpr *const denominator) | Solver | |
| MakeElement(const std::vector< int64 > &values, IntVar *const index) | Solver | |
| MakeElement(const std::vector< int > &values, IntVar *const index) | Solver | |
| MakeElement(IndexEvaluator1 values, IntVar *const index) | Solver | |
| MakeElement(IndexEvaluator2 values, IntVar *const index1, IntVar *const index2) | Solver | |
| MakeElement(const std::vector< IntVar * > &vars, IntVar *const index) | Solver | |
| MakeElement(Int64ToIntVar vars, int64 range_start, int64 range_end, IntVar *argument) | Solver | |
| MakeElementEquality(const std::vector< int64 > &vals, IntVar *const index, IntVar *const target) | Solver | |
| MakeElementEquality(const std::vector< int > &vals, IntVar *const index, IntVar *const target) | Solver | |
| MakeElementEquality(const std::vector< IntVar * > &vars, IntVar *const index, IntVar *const target) | Solver | |
| MakeElementEquality(const std::vector< IntVar * > &vars, IntVar *const index, int64 target) | Solver | |
| MakeEnterSearchCallback(std::function< void()> callback) | Solver | |
| MakeEquality(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeEquality(IntExpr *const expr, int64 value) | Solver | |
| MakeEquality(IntExpr *const expr, int value) | Solver | |
| MakeEquality(IntervalVar *const var1, IntervalVar *const var2) | Solver | |
| MakeExitSearchCallback(std::function< void()> callback) | Solver | |
| MakeFailDecision() | Solver | |
| MakeFailuresLimit(int64 failures) | Solver | |
| MakeFalseConstraint() | Solver | |
| MakeFalseConstraint(const std::string &explanation) | Solver | |
| MakeFirstSolutionCollector(const Assignment *const assignment) | Solver | |
| MakeFirstSolutionCollector() | Solver | |
| MakeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar *const interval_var, int64 duration, int64 offset) | Solver | |
| MakeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar *const interval_var, int64 duration, int64 offset) | Solver | |
| MakeFixedDurationIntervalVar(int64 start_min, int64 start_max, int64 duration, bool optional, const std::string &name) | Solver | |
| MakeFixedDurationIntervalVar(IntVar *const start_variable, int64 duration, const std::string &name) | Solver | |
| MakeFixedDurationIntervalVar(IntVar *const start_variable, int64 duration, IntVar *const performed_variable, const std::string &name) | Solver | |
| MakeFixedDurationIntervalVarArray(int count, int64 start_min, int64 start_max, int64 duration, bool optional, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, int64 duration, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, const std::vector< int64 > &durations, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, const std::vector< int > &durations, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, const std::vector< int64 > &durations, const std::vector< IntVar * > &performed_variables, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, const std::vector< int > &durations, const std::vector< IntVar * > &performed_variables, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar *const interval_var, int64 duration, int64 offset) | Solver | |
| MakeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar *const interval_var, int64 duration, int64 offset) | Solver | |
| MakeFixedInterval(int64 start, int64 duration, const std::string &name) | Solver | |
| MakeGenericTabuSearch(bool maximize, IntVar *const v, int64 step, const std::vector< IntVar * > &tabu_vars, int64 forbid_tenure) | Solver | |
| MakeGreater(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeGreater(IntExpr *const expr, int64 value) | Solver | |
| MakeGreater(IntExpr *const expr, int value) | Solver | |
| MakeGreaterOrEqual(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeGreaterOrEqual(IntExpr *const expr, int64 value) | Solver | |
| MakeGreaterOrEqual(IntExpr *const expr, int value) | Solver | |
| MakeGuidedLocalSearch(bool maximize, IntVar *const objective, IndexEvaluator2 objective_function, int64 step, const std::vector< IntVar * > &vars, double penalty_factor) | Solver | |
| MakeGuidedLocalSearch(bool maximize, IntVar *const objective, IndexEvaluator3 objective_function, int64 step, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, double penalty_factor) | Solver | |
| MakeIfThenElseCt(IntVar *const condition, IntExpr *const then_expr, IntExpr *const else_expr, IntVar *const target_var) | Solver | |
| MAKEINACTIVE enum value | Solver | |
| MakeIndexExpression(const std::vector< IntVar * > &vars, int64 value) | Solver | |
| MakeIndexOfConstraint(const std::vector< IntVar * > &vars, IntVar *const index, int64 target) | Solver | |
| MakeIndexOfFirstMaxValueConstraint(IntVar *index, const std::vector< IntVar * > &vars) | Solver | |
| MakeIndexOfFirstMinValueConstraint(IntVar *index, const std::vector< IntVar * > &vars) | Solver | |
| MakeIntConst(int64 val, const std::string &name) | Solver | |
| MakeIntConst(int64 val) | Solver | |
| MakeIntervalRelaxedMax(IntervalVar *const interval_var) | Solver | |
| MakeIntervalRelaxedMin(IntervalVar *const interval_var) | Solver | |
| MakeIntervalVar(int64 start_min, int64 start_max, int64 duration_min, int64 duration_max, int64 end_min, int64 end_max, bool optional, const std::string &name) | Solver | |
| MakeIntervalVarArray(int count, int64 start_min, int64 start_max, int64 duration_min, int64 duration_max, int64 end_min, int64 end_max, bool optional, const std::string &name, std::vector< IntervalVar * > *const array) | Solver | |
| MakeIntervalVarRelation(IntervalVar *const t, UnaryIntervalRelation r, int64 d) | Solver | |
| MakeIntervalVarRelation(IntervalVar *const t1, BinaryIntervalRelation r, IntervalVar *const t2) | Solver | |
| MakeIntervalVarRelationWithDelay(IntervalVar *const t1, BinaryIntervalRelation r, IntervalVar *const t2, int64 delay) | Solver | |
| MakeIntVar(int64 min, int64 max, const std::string &name) | Solver | |
| MakeIntVar(const std::vector< int64 > &values, const std::string &name) | Solver | |
| MakeIntVar(const std::vector< int > &values, const std::string &name) | Solver | |
| MakeIntVar(int64 min, int64 max) | Solver | |
| MakeIntVar(const std::vector< int64 > &values) | Solver | |
| MakeIntVar(const std::vector< int > &values) | Solver | |
| MakeIntVarArray(int var_count, int64 vmin, int64 vmax, const std::string &name, std::vector< IntVar * > *vars) | Solver | |
| MakeIntVarArray(int var_count, int64 vmin, int64 vmax, std::vector< IntVar * > *vars) | Solver | |
| MakeIntVarArray(int var_count, int64 vmin, int64 vmax, const std::string &name) | Solver | |
| MakeInversePermutationConstraint(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | Solver | |
| MakeIsBetweenCt(IntExpr *const expr, int64 l, int64 u, IntVar *const b) | Solver | |
| MakeIsBetweenVar(IntExpr *const v, int64 l, int64 u) | Solver | |
| MakeIsDifferentCstCt(IntExpr *const var, int64 value, IntVar *const boolvar) | Solver | |
| MakeIsDifferentCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsDifferentCt(IntExpr *const v1, IntExpr *const v2, IntVar *const b) | Solver | |
| MakeIsDifferentVar(IntExpr *const v1, IntExpr *const v2) | Solver | |
| MakeIsEqualCstCt(IntExpr *const var, int64 value, IntVar *const boolvar) | Solver | |
| MakeIsEqualCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsEqualCt(IntExpr *const v1, IntExpr *v2, IntVar *const b) | Solver | |
| MakeIsEqualVar(IntExpr *const v1, IntExpr *v2) | Solver | |
| MakeIsGreaterCstCt(IntExpr *const v, int64 c, IntVar *const b) | Solver | |
| MakeIsGreaterCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsGreaterCt(IntExpr *const left, IntExpr *const right, IntVar *const b) | Solver | |
| MakeIsGreaterOrEqualCstCt(IntExpr *const var, int64 value, IntVar *const boolvar) | Solver | |
| MakeIsGreaterOrEqualCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsGreaterOrEqualCt(IntExpr *const left, IntExpr *const right, IntVar *const b) | Solver | |
| MakeIsGreaterOrEqualVar(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeIsGreaterVar(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeIsLessCstCt(IntExpr *const v, int64 c, IntVar *const b) | Solver | |
| MakeIsLessCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsLessCt(IntExpr *const left, IntExpr *const right, IntVar *const b) | Solver | |
| MakeIsLessOrEqualCstCt(IntExpr *const var, int64 value, IntVar *const boolvar) | Solver | |
| MakeIsLessOrEqualCstVar(IntExpr *const var, int64 value) | Solver | |
| MakeIsLessOrEqualCt(IntExpr *const left, IntExpr *const right, IntVar *const b) | Solver | |
| MakeIsLessOrEqualVar(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeIsLessVar(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeIsMemberCt(IntExpr *const expr, const std::vector< int64 > &values, IntVar *const boolvar) | Solver | |
| MakeIsMemberCt(IntExpr *const expr, const std::vector< int > &values, IntVar *const boolvar) | Solver | |
| MakeIsMemberVar(IntExpr *const expr, const std::vector< int64 > &values) | Solver | |
| MakeIsMemberVar(IntExpr *const expr, const std::vector< int > &values) | Solver | |
| MakeLastSolutionCollector(const Assignment *const assignment) | Solver | |
| MakeLastSolutionCollector() | Solver | |
| MakeLess(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeLess(IntExpr *const expr, int64 value) | Solver | |
| MakeLess(IntExpr *const expr, int value) | Solver | |
| MakeLessOrEqual(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeLessOrEqual(IntExpr *const expr, int64 value) | Solver | |
| MakeLessOrEqual(IntExpr *const expr, int value) | Solver | |
| MakeLexicalLess(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | Solver | |
| MakeLexicalLessOrEqual(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | Solver | |
| MakeLimit(int64 time, int64 branches, int64 failures, int64 solutions) | Solver | |
| MakeLimit(int64 time, int64 branches, int64 failures, int64 solutions, bool smart_time_check) | Solver | |
| MakeLimit(int64 time, int64 branches, int64 failures, int64 solutions, bool smart_time_check, bool cumulative) | Solver | |
| MakeLimit(const RegularLimitParameters &proto) | Solver | |
| MakeLimit(SearchLimit *const limit_1, SearchLimit *const limit_2) | Solver | |
| MakeLocalSearchPhase(Assignment *const assignment, LocalSearchPhaseParameters *const parameters) | Solver | |
| MakeLocalSearchPhase(const std::vector< IntVar * > &vars, DecisionBuilder *const first_solution, LocalSearchPhaseParameters *const parameters) | Solver | |
| MakeLocalSearchPhase(const std::vector< IntVar * > &vars, DecisionBuilder *const first_solution, DecisionBuilder *const first_solution_sub_decision_builder, LocalSearchPhaseParameters *const parameters) | Solver | |
| MakeLocalSearchPhase(const std::vector< SequenceVar * > &vars, DecisionBuilder *const first_solution, LocalSearchPhaseParameters *const parameters) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder, RegularLimit *const limit) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder, RegularLimit *const limit, const std::vector< LocalSearchFilter * > &filters) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *const pool, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *const pool, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder, RegularLimit *const limit) | Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *const pool, LocalSearchOperator *const ls_operator, DecisionBuilder *const sub_decision_builder, RegularLimit *const limit, const std::vector< LocalSearchFilter * > &filters) | Solver | |
| MakeLubyRestart(int scale_factor) | Solver | |
| MakeMapDomain(IntVar *const var, const std::vector< IntVar * > &actives) | Solver | |
| MakeMax(const std::vector< IntVar * > &vars) | Solver | |
| MakeMax(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeMax(IntExpr *const expr, int64 value) | Solver | |
| MakeMax(IntExpr *const expr, int value) | Solver | |
| MakeMaxEquality(const std::vector< IntVar * > &vars, IntVar *const max_var) | Solver | |
| MakeMaximize(IntVar *const v, int64 step) | Solver | |
| MakeMemberCt(IntExpr *const expr, const std::vector< int64 > &values) | Solver | |
| MakeMemberCt(IntExpr *const expr, const std::vector< int > &values) | Solver | |
| MakeMin(const std::vector< IntVar * > &vars) | Solver | |
| MakeMin(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeMin(IntExpr *const expr, int64 value) | Solver | |
| MakeMin(IntExpr *const expr, int value) | Solver | |
| MakeMinEquality(const std::vector< IntVar * > &vars, IntVar *const min_var) | Solver | |
| MakeMinimize(IntVar *const v, int64 step) | Solver | |
| MakeMirrorInterval(IntervalVar *const interval_var) | Solver | |
| MakeModulo(IntExpr *const x, int64 mod) | Solver | |
| MakeModulo(IntExpr *const x, IntExpr *const mod) | Solver | |
| MakeMonotonicElement(IndexEvaluator1 values, bool increasing, IntVar *const index) | Solver | |
| MakeMoveTowardTargetOperator(const Assignment &target) | Solver | |
| MakeMoveTowardTargetOperator(const std::vector< IntVar * > &variables, const std::vector< int64 > &target_values) | Solver | |
| MakeNBestValueSolutionCollector(const Assignment *const assignment, int solution_count, bool maximize) | Solver | |
| MakeNBestValueSolutionCollector(int solution_count, bool maximize) | Solver | |
| MakeNeighborhoodLimit(LocalSearchOperator *const op, int64 limit) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step, SearchMonitor *const monitor1) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step, SearchMonitor *const monitor1, SearchMonitor *const monitor2) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step, SearchMonitor *const monitor1, SearchMonitor *const monitor2, SearchMonitor *const monitor3) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step, SearchMonitor *const monitor1, SearchMonitor *const monitor2, SearchMonitor *const monitor3, SearchMonitor *const monitor4) | Solver | |
| MakeNestedOptimize(DecisionBuilder *const db, Assignment *const solution, bool maximize, int64 step, const std::vector< SearchMonitor * > &monitors) | Solver | |
| MakeNoCycle(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, IndexFilter1 sink_handler=nullptr) | Solver | |
| MakeNoCycle(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, IndexFilter1 sink_handler, bool assume_paths) | Solver | |
| MakeNonEquality(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeNonEquality(IntExpr *const expr, int64 value) | Solver | |
| MakeNonEquality(IntExpr *const expr, int value) | Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size) | Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< int64 > &x_size, const std::vector< int64 > &y_size) | Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< int > &x_size, const std::vector< int > &y_size) | Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size) | Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< int64 > &x_size, const std::vector< int64 > &y_size) | Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< int > &x_size, const std::vector< int > &y_size) | Solver | |
| MakeNotBetweenCt(IntExpr *const expr, int64 l, int64 u) | Solver | |
| MakeNotMemberCt(IntExpr *const expr, const std::vector< int64 > &values) | Solver | |
| MakeNotMemberCt(IntExpr *const expr, const std::vector< int > &values) | Solver | |
| MakeNotMemberCt(IntExpr *const expr, std::vector< int64 > starts, std::vector< int64 > ends) | Solver | |
| MakeNotMemberCt(IntExpr *const expr, std::vector< int > starts, std::vector< int > ends) | Solver | |
| MakeNotMemberCt(IntExpr *expr, SortedDisjointIntervalList intervals) | Solver | |
| MakeNullIntersect(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars) | Solver | |
| MakeNullIntersectExcept(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars, int64 escape_value) | Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, LocalSearchOperators op) | Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchOperators op) | Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, IndexEvaluator3 evaluator, EvaluatorLocalSearchOperators op) | Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, IndexEvaluator3 evaluator, EvaluatorLocalSearchOperators op) | Solver | |
| MakeOpposite(IntExpr *const expr) | Solver | |
| MakeOptimize(bool maximize, IntVar *const v, int64 step) | Solver | |
| MakePack(const std::vector< IntVar * > &vars, int number_of_bins) | Solver | |
| MakePathConnected(std::vector< IntVar * > nexts, std::vector< int64 > sources, std::vector< int64 > sinks, std::vector< IntVar * > status) | Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &transits) | Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, IndexEvaluator2 transit_evaluator) | Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &slacks, IndexEvaluator2 transit_evaluator) | Solver | |
| MakePathPrecedenceConstraint(std::vector< IntVar * > nexts, const std::vector< std::pair< int, int >> &precedences) | Solver | |
| MakePathPrecedenceConstraint(std::vector< IntVar * > nexts, const std::vector< std::pair< int, int >> &precedences, const std::vector< int > &lifo_path_starts, const std::vector< int > &fifo_path_starts) | Solver | |
| MakePathTransitPrecedenceConstraint(std::vector< IntVar * > nexts, std::vector< IntVar * > transits, const std::vector< std::pair< int, int >> &precedences) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IntValueStrategy val_str) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IntValueStrategy val_str) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IndexEvaluator2 value_evaluator) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, VariableValueComparator var_val1_val2_comparator) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IndexEvaluator2 value_evaluator) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IndexEvaluator2 value_evaluator, IndexEvaluator1 tie_breaker) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IndexEvaluator2 value_evaluator, IndexEvaluator1 tie_breaker) | Solver | |
| MakePhase(IntVar *const v0, IntVarStrategy var_str, IntValueStrategy val_str) | Solver | |
| MakePhase(IntVar *const v0, IntVar *const v1, IntVarStrategy var_str, IntValueStrategy val_str) | Solver | |
| MakePhase(IntVar *const v0, IntVar *const v1, IntVar *const v2, IntVarStrategy var_str, IntValueStrategy val_str) | Solver | |
| MakePhase(IntVar *const v0, IntVar *const v1, IntVar *const v2, IntVar *const v3, IntVarStrategy var_str, IntValueStrategy val_str) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator2 eval, EvaluatorStrategy str) | Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator2 eval, IndexEvaluator1 tie_breaker, EvaluatorStrategy str) | Solver | |
| MakePhase(const std::vector< IntervalVar * > &intervals, IntervalStrategy str) | Solver | |
| MakePhase(const std::vector< SequenceVar * > &sequences, SequenceStrategy str) | Solver | |
| MakePiecewiseLinearExpr(IntExpr *expr, const PiecewiseLinearFunction &f) | Solver | |
| MakePower(IntExpr *const expr, int64 n) | Solver | |
| MakePrintModelVisitor() | Solver | |
| MakeProd(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeProd(IntExpr *const expr, int64 value) | Solver | |
| MakeRandomLnsOperator(const std::vector< IntVar * > &vars, int number_of_variables) | Solver | |
| MakeRandomLnsOperator(const std::vector< IntVar * > &vars, int number_of_variables, int32 seed) | Solver | |
| MakeRankFirstInterval(SequenceVar *const sequence, int index) | Solver | |
| MakeRankLastInterval(SequenceVar *const sequence, int index) | Solver | |
| MakeRejectFilter() | Solver | |
| MakeRestoreAssignment(Assignment *assignment) | Solver | |
| MakeScalProd(const std::vector< IntVar * > &vars, const std::vector< int64 > &coefs) | Solver | |
| MakeScalProd(const std::vector< IntVar * > &vars, const std::vector< int > &coefs) | Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int64 > &coefficients, int64 cst) | Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, int64 cst) | Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int64 > &coefficients, IntVar *const target) | Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, IntVar *const target) | Solver | |
| MakeScalProdGreaterOrEqual(const std::vector< IntVar * > &vars, const std::vector< int64 > &coeffs, int64 cst) | Solver | |
| MakeScalProdGreaterOrEqual(const std::vector< IntVar * > &vars, const std::vector< int > &coeffs, int64 cst) | Solver | |
| MakeScalProdLessOrEqual(const std::vector< IntVar * > &vars, const std::vector< int64 > &coefficients, int64 cst) | Solver | |
| MakeScalProdLessOrEqual(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, int64 cst) | Solver | |
| MakeScheduleOrExpedite(IntervalVar *const var, int64 est, int64 *const marker) | Solver | |
| MakeScheduleOrPostpone(IntervalVar *const var, int64 est, int64 *const marker) | Solver | |
| MakeSearchLog(int branch_period) | Solver | |
| MakeSearchLog(int branch_period, IntVar *const var) | Solver | |
| MakeSearchLog(int branch_period, std::function< std::string()> display_callback) | Solver | |
| MakeSearchLog(int branch_period, IntVar *var, std::function< std::string()> display_callback) | Solver | |
| MakeSearchLog(int branch_period, OptimizeVar *const opt_var) | Solver | |
| MakeSearchLog(int branch_period, OptimizeVar *const opt_var, std::function< std::string()> display_callback) | Solver | |
| MakeSearchLog(SearchLogParameters parameters) | Solver | |
| MakeSearchTrace(const std::string &prefix) | Solver | |
| MakeSemiContinuousExpr(IntExpr *const expr, int64 fixed_charge, int64 step) | Solver | |
| MakeSimulatedAnnealing(bool maximize, IntVar *const v, int64 step, int64 initial_temperature) | Solver | |
| MakeSolutionsLimit(int64 solutions) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db, SearchMonitor *const monitor1) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db, SearchMonitor *const monitor1, SearchMonitor *const monitor2) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db, SearchMonitor *const monitor1, SearchMonitor *const monitor2, SearchMonitor *const monitor3) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db, SearchMonitor *const monitor1, SearchMonitor *const monitor2, SearchMonitor *const monitor3, SearchMonitor *const monitor4) | Solver | |
| MakeSolveOnce(DecisionBuilder *const db, const std::vector< SearchMonitor * > &monitors) | Solver | |
| MakeSortingConstraint(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &sorted) | Solver | |
| MakeSplitVariableDomain(IntVar *const var, int64 val, bool start_with_lower_half) | Solver | |
| MakeSquare(IntExpr *const expr) | Solver | |
| MakeStatisticsModelVisitor() | Solver | |
| MakeStoreAssignment(Assignment *assignment) | Solver | |
| MakeStrictDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name) | Solver | |
| MakeSubCircuit(const std::vector< IntVar * > &nexts) | Solver | |
| MakeSum(IntExpr *const left, IntExpr *const right) | Solver | |
| MakeSum(IntExpr *const expr, int64 value) | Solver | |
| MakeSum(const std::vector< IntVar * > &vars) | Solver | |
| MakeSumEquality(const std::vector< IntVar * > &vars, int64 cst) | Solver | |
| MakeSumEquality(const std::vector< IntVar * > &vars, IntVar *const var) | Solver | |
| MakeSumGreaterOrEqual(const std::vector< IntVar * > &vars, int64 cst) | Solver | |
| MakeSumLessOrEqual(const std::vector< IntVar * > &vars, int64 cst) | Solver | |
| MakeSumObjectiveFilter(const std::vector< IntVar * > &vars, IndexEvaluator2 values, Solver::LocalSearchFilterBound filter_enum) | Solver | |
| MakeSumObjectiveFilter(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, IndexEvaluator3 values, Solver::LocalSearchFilterBound filter_enum) | Solver | |
| MakeSymmetryManager(const std::vector< SymmetryBreaker * > &visitors) | Solver | |
| MakeSymmetryManager(SymmetryBreaker *const v1) | Solver | |
| MakeSymmetryManager(SymmetryBreaker *const v1, SymmetryBreaker *const v2) | Solver | |
| MakeSymmetryManager(SymmetryBreaker *const v1, SymmetryBreaker *const v2, SymmetryBreaker *const v3) | Solver | |
| MakeSymmetryManager(SymmetryBreaker *const v1, SymmetryBreaker *const v2, SymmetryBreaker *const v3, SymmetryBreaker *const v4) | Solver | |
| MakeTabuSearch(bool maximize, IntVar *const v, int64 step, const std::vector< IntVar * > &vars, int64 keep_tenure, int64 forbid_tenure, double tabu_factor) | Solver | |
| MakeTemporalDisjunction(IntervalVar *const t1, IntervalVar *const t2, IntVar *const alt) | Solver | |
| MakeTemporalDisjunction(IntervalVar *const t1, IntervalVar *const t2) | Solver | |
| MakeTimeLimit(int64 time_in_ms) | Solver | |
| MakeTransitionConstraint(const std::vector< IntVar * > &vars, const IntTupleSet &transition_table, int64 initial_state, const std::vector< int64 > &final_states) | Solver | |
| MakeTransitionConstraint(const std::vector< IntVar * > &vars, const IntTupleSet &transition_table, int64 initial_state, const std::vector< int > &final_states) | Solver | |
| MakeTrueConstraint() | Solver | |
| MakeVariableDegreeVisitor(absl::flat_hash_map< const IntVar *, int > *const map) | Solver | |
| MakeVariableDomainFilter() | Solver | |
| MakeVariableGreaterOrEqualValue(IntVar *const var, int64 value) | Solver | |
| MakeVariableLessOrEqualValue(IntVar *const var, int64 value) | Solver | |
| MakeWeightedMaximize(const std::vector< IntVar * > &sub_objectives, const std::vector< int64 > &weights, int64 step) | Solver | |
| MakeWeightedMaximize(const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64 step) | Solver | |
| MakeWeightedMinimize(const std::vector< IntVar * > &sub_objectives, const std::vector< int64 > &weights, int64 step) | Solver | |
| MakeWeightedMinimize(const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64 step) | Solver | |
| MakeWeightedOptimize(bool maximize, const std::vector< IntVar * > &sub_objectives, const std::vector< int64 > &weights, int64 step) | Solver | |
| MakeWeightedOptimize(bool maximize, const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64 step) | Solver | |
| MarkerType enum name | Solver | |
| MAXIMIZATION enum value | Solver | |
| MemoryUsage() | Solver | static |
| MINIMIZATION enum value | Solver | |
| model_name() const | Solver | |
| NameAllVariables() const | Solver | |
| neighbors() const | Solver | inline |
| NewSearch(DecisionBuilder *const db, const std::vector< SearchMonitor * > &monitors) | Solver | |
| NewSearch(DecisionBuilder *const db) | Solver | |
| NewSearch(DecisionBuilder *const db, SearchMonitor *const m1) | Solver | |
| NewSearch(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2) | Solver | |
| NewSearch(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2, SearchMonitor *const m3) | Solver | |
| NewSearch(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2, SearchMonitor *const m3, SearchMonitor *const m4) | Solver | |
| NextSolution() | Solver | |
| NO_CHANGE enum value | Solver | |
| NO_MORE_SOLUTIONS enum value | Solver | |
| NORMAL_PRIORITY enum value | Solver | |
| NOT_SET enum value | Solver | |
| Now() const | Solver | |
| optimization_direction() const | Solver | inline |
| OptimizationDirection enum name | Solver | |
| OROPT enum value | Solver | |
| OUTSIDE_SEARCH enum value | Solver | |
| parameters() const | Solver | inline |
| PATHLNS enum value | Solver | |
| PopState() | Solver | |
| PROBLEM_INFEASIBLE enum value | Solver | |
| PropagationBaseObject class | Solver | friend |
| PushState() | Solver | |
| Queue class | Solver | friend |
| Rand32(int32 size) | Solver | inline |
| Rand64(int64 size) | Solver | inline |
| RandomConcatenateOperators(const std::vector< LocalSearchOperator * > &ops) | Solver | |
| RandomConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, int32 seed) | Solver | |
| RegisterDemon(Demon *const demon) | Solver | |
| RegisterIntervalVar(IntervalVar *const var) | Solver | |
| RegisterIntExpr(IntExpr *const expr) | Solver | |
| RegisterIntVar(IntVar *const var) | Solver | |
| RELOCATE enum value | Solver | |
| ReSeed(int32 seed) | Solver | inline |
| RestartCurrentSearch() | Solver | |
| RestartSearch() | Solver | |
| RevAlloc(T *object) | Solver | inline |
| RevAllocArray(T *object) | Solver | inline |
| REVERSIBLE_ACTION enum value | Solver | |
| RevImmutableMultiMap class | Solver | friend |
| RoutingModel class | Solver | friend |
| SaveAndAdd(T *adr, T val) | Solver | inline |
| SaveAndSetValue(T *adr, T val) | Solver | inline |
| SaveValue(T *o) | Solver | inline |
| SearchContext() const | Solver | |
| SearchContext(const Search *search) const | Solver | |
| SearchDepth() const | Solver | |
| SearchLeftDepth() const | Solver | |
| SearchLimit class | Solver | friend |
| SearchMonitor class | Solver | friend |
| SENTINEL enum value | Solver | |
| SEQUENCE_DEFAULT enum value | Solver | |
| SEQUENCE_SIMPLE enum value | Solver | |
| SequenceStrategy enum name | Solver | |
| set_fail_intercept(std::function< void()> fail_intercept) | Solver | inline |
| set_optimization_direction(OptimizationDirection direction) | Solver | inline |
| SetBranchSelector(BranchSelector bs) | Solver | |
| SetSearchContext(Search *search, const std::string &search_context) | Solver | |
| SetUseFastLocalSearch(bool use_fast_local_search) | Solver | inline |
| ShouldFail() | Solver | inline |
| SIMPLE_MARKER enum value | Solver | |
| SIMPLELNS enum value | Solver | |
| SimpleRevFIFO class | Solver | friend |
| solutions() const | Solver | |
| Solve(DecisionBuilder *const db, const std::vector< SearchMonitor * > &monitors) | Solver | |
| Solve(DecisionBuilder *const db) | Solver | |
| Solve(DecisionBuilder *const db, SearchMonitor *const m1) | Solver | |
| Solve(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2) | Solver | |
| Solve(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2, SearchMonitor *const m3) | Solver | |
| Solve(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2, SearchMonitor *const m3, SearchMonitor *const m4) | Solver | |
| SolveAndCommit(DecisionBuilder *const db, const std::vector< SearchMonitor * > &monitors) | Solver | |
| SolveAndCommit(DecisionBuilder *const db) | Solver | |
| SolveAndCommit(DecisionBuilder *const db, SearchMonitor *const m1) | Solver | |
| SolveAndCommit(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2) | Solver | |
| SolveAndCommit(DecisionBuilder *const db, SearchMonitor *const m1, SearchMonitor *const m2, SearchMonitor *const m3) | Solver | |
| SolveDepth() const | Solver | |
| Solver(const std::string &name) | Solver | explicit |
| Solver(const std::string &name, const ConstraintSolverParameters ¶meters) | Solver | |
| SolverState enum name | Solver | |
| SPLIT_LOWER_HALF enum value | Solver | |
| SPLIT_UPPER_HALF enum value | Solver | |
| stamp() const | Solver | |
| STARTS_AFTER enum value | Solver | |
| STARTS_AFTER_END enum value | Solver | |
| STARTS_AFTER_START enum value | Solver | |
| STARTS_AT enum value | Solver | |
| STARTS_AT_END enum value | Solver | |
| STARTS_AT_START enum value | Solver | |
| STARTS_BEFORE enum value | Solver | |
| state() const | Solver | inline |
| STAYS_IN_SYNC enum value | Solver | |
| SWAPACTIVE enum value | Solver | |
| SWITCH_BRANCHES enum value | Solver | |
| tmp_vector_ | Solver | |
| TopPeriodicCheck() | Solver | |
| TopProgressPercent() | Solver | |
| Try(DecisionBuilder *const db1, DecisionBuilder *const db2) | Solver | |
| Try(DecisionBuilder *const db1, DecisionBuilder *const db2, DecisionBuilder *const db3) | Solver | |
| Try(DecisionBuilder *const db1, DecisionBuilder *const db2, DecisionBuilder *const db3, DecisionBuilder *const db4) | Solver | |
| Try(const std::vector< DecisionBuilder * > &dbs) | Solver | |
| TSPLNS enum value | Solver | |
| TSPOPT enum value | Solver | |
| TWOOPT enum value | Solver | |
| UNACTIVELNS enum value | Solver | |
| UnaryIntervalRelation enum name | Solver | |
| unchecked_solutions() const | Solver | |
| UseFastLocalSearch() const | Solver | inline |
| VAR_PRIORITY enum value | Solver | |
| VariableIndexSelector typedef | Solver | |
| VariableValueComparator typedef | Solver | |
| VariableValueSelector typedef | Solver | |
| wall_time() const | Solver | |
| ~Solver() | Solver |