Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Classes | |
class | Builder |
Static Public Member Functions | |
static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
static com.google.ortools.sat.CpSolverResponse | parseFrom (java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (byte[] data) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (java.io.InputStream input) throws java.io.IOException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
static com.google.ortools.sat.CpSolverResponse | parseDelimitedFrom (java.io.InputStream input) throws java.io.IOException |
static com.google.ortools.sat.CpSolverResponse | parseDelimitedFrom (java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (com.google.protobuf.CodedInputStream input) throws java.io.IOException |
static com.google.ortools.sat.CpSolverResponse | parseFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException |
static Builder | newBuilder () |
static Builder | newBuilder (com.google.ortools.sat.CpSolverResponse prototype) |
static com.google.ortools.sat.CpSolverResponse | getDefaultInstance () |
static com.google.protobuf.Parser< CpSolverResponse > | parser () |
Protected Member Functions | |
com.google.protobuf.GeneratedMessage.FieldAccessorTable | internalGetFieldAccessorTable () |
Builder | newBuilderForType (com.google.protobuf.GeneratedMessage.BuilderParent parent) |
The response returned by a solver trying to solve a CpModelProto. Next id: 31
Protobuf type operations_research.sat.CpSolverResponse
Definition at line 16 of file CpSolverResponse.java.
boolean com.google.ortools.sat.CpSolverResponse.equals | ( | final java.lang.Object | obj | ) |
Definition at line 1015 of file CpSolverResponse.java.
com.google.ortools.sat.CpSolverSolution com.google.ortools.sat.CpSolverResponse.getAdditionalSolutions | ( | int | index | ) |
If the parameter fill_additional_solutions_in_response is set, then we copy all the solutions from our internal solution pool here. Note that the one returned in the solution field will likely appear here too. Do not rely on the solutions order as it depends on our internal representation (after postsolve).
repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 235 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsCount | ( | ) |
If the parameter fill_additional_solutions_in_response is set, then we copy all the solutions from our internal solution pool here. Note that the one returned in the solution field will likely appear here too. Do not rely on the solutions order as it depends on our internal representation (after postsolve).
repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 219 of file CpSolverResponse.java.
java.util.List< com.google.ortools.sat.CpSolverSolution > com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsList | ( | ) |
If the parameter fill_additional_solutions_in_response is set, then we copy all the solutions from our internal solution pool here. Note that the one returned in the solution field will likely appear here too. Do not rely on the solutions order as it depends on our internal representation (after postsolve).
repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 186 of file CpSolverResponse.java.
com.google.ortools.sat.CpSolverSolutionOrBuilder com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsOrBuilder | ( | int | index | ) |
If the parameter fill_additional_solutions_in_response is set, then we copy all the solutions from our internal solution pool here. Note that the one returned in the solution field will likely appear here too. Do not rely on the solutions order as it depends on our internal representation (after postsolve).
repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 251 of file CpSolverResponse.java.
java.util.List<? extends com.google.ortools.sat.CpSolverSolutionOrBuilder > com.google.ortools.sat.CpSolverResponse.getAdditionalSolutionsOrBuilderList | ( | ) |
If the parameter fill_additional_solutions_in_response is set, then we copy all the solutions from our internal solution pool here. Note that the one returned in the solution field will likely appear here too. Do not rely on the solutions order as it depends on our internal representation (after postsolve).
repeated .operations_research.sat.CpSolverSolution additional_solutions = 27;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 203 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getBestObjectiveBound | ( | ) |
Only make sense for an optimization problem. A proven lower-bound on the objective for a minimization problem, or a proven upper-bound for a maximization problem.
double best_objective_bound = 4;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 166 of file CpSolverResponse.java.
|
static |
Definition at line 4216 of file CpSolverResponse.java.
com.google.ortools.sat.CpSolverResponse com.google.ortools.sat.CpSolverResponse.getDefaultInstanceForType | ( | ) |
Definition at line 4252 of file CpSolverResponse.java.
|
static |
Definition at line 45 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getDeterministicTime | ( | ) |
double deterministic_time = 17;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 681 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getGapIntegral | ( | ) |
The integral of log(1 + absolute_objective_gap) over time.
double gap_integral = 22;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 696 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getInnerObjectiveLowerBound | ( | ) |
Advanced usage. A lower bound on the inner integer expression of the objective. This is either a bound on the expression in the returned integer_objective or on the integer expression of the original objective if the problem already has an integer objective.
int64 inner_objective_lower_bound = 29;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 548 of file CpSolverResponse.java.
com.google.ortools.sat.CpObjectiveProto com.google.ortools.sat.CpSolverResponse.getIntegerObjective | ( | ) |
Contains the integer objective optimized internally. This is only filled if the problem had a floating point objective, and on the final response, not the ones given to callbacks.
.operations_research.sat.CpObjectiveProto integer_objective = 28;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 515 of file CpSolverResponse.java.
com.google.ortools.sat.CpObjectiveProtoOrBuilder com.google.ortools.sat.CpSolverResponse.getIntegerObjectiveOrBuilder | ( | ) |
Contains the integer objective optimized internally. This is only filled if the problem had a floating point objective, and on the final response, not the ones given to callbacks.
.operations_research.sat.CpObjectiveProto integer_objective = 28;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 528 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumBinaryPropagations | ( | ) |
int64 num_binary_propagations = 13;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 611 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumBooleans | ( | ) |
int64 num_booleans = 10;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 578 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumBranches | ( | ) |
int64 num_branches = 12;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 600 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumConflicts | ( | ) |
int64 num_conflicts = 11;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 589 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumIntegerPropagations | ( | ) |
int64 num_integer_propagations = 14;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 622 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumIntegers | ( | ) |
Some statistics about the solve. Important: in multithread, this correspond the statistics of the first subsolver. Which is usually the one with the user defined parameters. Or the default-search if none are specified.
int64 num_integers = 30;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 567 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumLpIterations | ( | ) |
int64 num_lp_iterations = 25;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 644 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getNumRestarts | ( | ) |
int64 num_restarts = 24;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 633 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getObjectiveValue | ( | ) |
Only make sense for an optimization problem. The objective value of the returned solution if it is non-empty. If there is no solution, then for a minimization problem, this will be an upper-bound of the objective of any feasible solution, and a lower-bound for a maximization problem.
double objective_value = 3;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 149 of file CpSolverResponse.java.
com.google.protobuf.Parser< CpSolverResponse > com.google.ortools.sat.CpSolverResponse.getParserForType | ( | ) |
Definition at line 4247 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getSerializedSize | ( | ) |
Definition at line 894 of file CpSolverResponse.java.
long com.google.ortools.sat.CpSolverResponse.getSolution | ( | int | index | ) |
A feasible solution to the given problem. Depending on the returned status it may be optimal or just feasible. This is in one-to-one correspondence with a CpModelProto::variables repeated field and list the values of all the variables.
repeated int64 solution = 2;
index | The index of the element to return. |
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 130 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getSolutionCount | ( | ) |
A feasible solution to the given problem. Depending on the returned status it may be optimal or just feasible. This is in one-to-one correspondence with a CpModelProto::variables repeated field and list the values of all the variables.
repeated int64 solution = 2;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 115 of file CpSolverResponse.java.
java.lang.String com.google.ortools.sat.CpSolverResponse.getSolutionInfo | ( | ) |
Additional information about how the solution was found. It also stores model or parameters errors that caused the model to be invalid.
string solution_info = 20;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 713 of file CpSolverResponse.java.
com.google.protobuf.ByteString com.google.ortools.sat.CpSolverResponse.getSolutionInfoBytes | ( | ) |
Additional information about how the solution was found. It also stores model or parameters errors that caused the model to be invalid.
string solution_info = 20;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 736 of file CpSolverResponse.java.
java.util.List< java.lang.Long > com.google.ortools.sat.CpSolverResponse.getSolutionList | ( | ) |
A feasible solution to the given problem. Depending on the returned status it may be optimal or just feasible. This is in one-to-one correspondence with a CpModelProto::variables repeated field and list the values of all the variables.
repeated int64 solution = 2;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 101 of file CpSolverResponse.java.
java.lang.String com.google.ortools.sat.CpSolverResponse.getSolveLog | ( | ) |
The solve log will be filled if the parameter log_to_response is set to true.
string solve_log = 26;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 762 of file CpSolverResponse.java.
com.google.protobuf.ByteString com.google.ortools.sat.CpSolverResponse.getSolveLogBytes | ( | ) |
The solve log will be filled if the parameter log_to_response is set to true.
string solve_log = 26;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 785 of file CpSolverResponse.java.
com.google.ortools.sat.CpSolverStatus com.google.ortools.sat.CpSolverResponse.getStatus | ( | ) |
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 79 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getStatusValue | ( | ) |
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 68 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibility | ( | int | index | ) |
A subset of the model "assumptions" field. This will only be filled if the status is INFEASIBLE. This subset of assumption will be enough to still get an infeasible problem. This is related to what is called the irreducible inconsistent subsystem or IIS. Except one is only concerned by the provided assumptions. There is also no guarantee that we return an irreducible (aka minimal subset). However, this is based on SAT explanation and there is a good chance it is not too large. If you really want a minimal subset, a possible way to get one is by changing your model to minimize the number of assumptions at false, but this is likely an harder problem to solve. Important: Currently, this is minimized only in single-thread and if the problem is not an optimization problem, otherwise, it will always include all the assumptions. TODO(user): Allows for returning multiple core at once.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
index | The index of the element to return. |
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 483 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibilityCount | ( | ) |
A subset of the model "assumptions" field. This will only be filled if the status is INFEASIBLE. This subset of assumption will be enough to still get an infeasible problem. This is related to what is called the irreducible inconsistent subsystem or IIS. Except one is only concerned by the provided assumptions. There is also no guarantee that we return an irreducible (aka minimal subset). However, this is based on SAT explanation and there is a good chance it is not too large. If you really want a minimal subset, a possible way to get one is by changing your model to minimize the number of assumptions at false, but this is likely an harder problem to solve. Important: Currently, this is minimized only in single-thread and if the problem is not an optimization problem, otherwise, it will always include all the assumptions. TODO(user): Allows for returning multiple core at once.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 453 of file CpSolverResponse.java.
java.util.List< java.lang.Integer > com.google.ortools.sat.CpSolverResponse.getSufficientAssumptionsForInfeasibilityList | ( | ) |
A subset of the model "assumptions" field. This will only be filled if the status is INFEASIBLE. This subset of assumption will be enough to still get an infeasible problem. This is related to what is called the irreducible inconsistent subsystem or IIS. Except one is only concerned by the provided assumptions. There is also no guarantee that we return an irreducible (aka minimal subset). However, this is based on SAT explanation and there is a good chance it is not too large. If you really want a minimal subset, a possible way to get one is by changing your model to minimize the number of assumptions at false, but this is likely an harder problem to solve. Important: Currently, this is minimized only in single-thread and if the problem is not an optimization problem, otherwise, it will always include all the assumptions. TODO(user): Allows for returning multiple core at once.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 424 of file CpSolverResponse.java.
com.google.ortools.sat.IntegerVariableProto com.google.ortools.sat.CpSolverResponse.getTightenedVariables | ( | int | index | ) |
Advanced usage. If the option fill_tightened_domains_in_response is set, then this field will be a copy of the CpModelProto.variables where each domain has been reduced using the information the solver was able to derive. Note that this is only filled with the info derived during a normal search and we do not have any dedicated algorithm to improve it. Warning: if you didn't set keep_all_feasible_solutions_in_presolve, then these domains might exclude valid feasible solution. Otherwise for a feasibility problem, all feasible solution should be there. Warning: For an optimization problem, these will correspond to valid bounds for the problem of finding an improving solution to the best one found so far. It might be better to solve a feasibility version if one just want to explore the feasible region.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 361 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.getTightenedVariablesCount | ( | ) |
Advanced usage. If the option fill_tightened_domains_in_response is set, then this field will be a copy of the CpModelProto.variables where each domain has been reduced using the information the solver was able to derive. Note that this is only filled with the info derived during a normal search and we do not have any dedicated algorithm to improve it. Warning: if you didn't set keep_all_feasible_solutions_in_presolve, then these domains might exclude valid feasible solution. Otherwise for a feasibility problem, all feasible solution should be there. Warning: For an optimization problem, these will correspond to valid bounds for the problem of finding an improving solution to the best one found so far. It might be better to solve a feasibility version if one just want to explore the feasible region.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 335 of file CpSolverResponse.java.
java.util.List< com.google.ortools.sat.IntegerVariableProto > com.google.ortools.sat.CpSolverResponse.getTightenedVariablesList | ( | ) |
Advanced usage. If the option fill_tightened_domains_in_response is set, then this field will be a copy of the CpModelProto.variables where each domain has been reduced using the information the solver was able to derive. Note that this is only filled with the info derived during a normal search and we do not have any dedicated algorithm to improve it. Warning: if you didn't set keep_all_feasible_solutions_in_presolve, then these domains might exclude valid feasible solution. Otherwise for a feasibility problem, all feasible solution should be there. Warning: For an optimization problem, these will correspond to valid bounds for the problem of finding an improving solution to the best one found so far. It might be better to solve a feasibility version if one just want to explore the feasible region.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 282 of file CpSolverResponse.java.
com.google.ortools.sat.IntegerVariableProtoOrBuilder com.google.ortools.sat.CpSolverResponse.getTightenedVariablesOrBuilder | ( | int | index | ) |
Advanced usage. If the option fill_tightened_domains_in_response is set, then this field will be a copy of the CpModelProto.variables where each domain has been reduced using the information the solver was able to derive. Note that this is only filled with the info derived during a normal search and we do not have any dedicated algorithm to improve it. Warning: if you didn't set keep_all_feasible_solutions_in_presolve, then these domains might exclude valid feasible solution. Otherwise for a feasibility problem, all feasible solution should be there. Warning: For an optimization problem, these will correspond to valid bounds for the problem of finding an improving solution to the best one found so far. It might be better to solve a feasibility version if one just want to explore the feasible region.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 387 of file CpSolverResponse.java.
java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuilder > com.google.ortools.sat.CpSolverResponse.getTightenedVariablesOrBuilderList | ( | ) |
Advanced usage. If the option fill_tightened_domains_in_response is set, then this field will be a copy of the CpModelProto.variables where each domain has been reduced using the information the solver was able to derive. Note that this is only filled with the info derived during a normal search and we do not have any dedicated algorithm to improve it. Warning: if you didn't set keep_all_feasible_solutions_in_presolve, then these domains might exclude valid feasible solution. Otherwise for a feasibility problem, all feasible solution should be there. Warning: For an optimization problem, these will correspond to valid bounds for the problem of finding an improving solution to the best one found so far. It might be better to solve a feasibility version if one just want to explore the feasible region.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 309 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getUserTime | ( | ) |
double user_time = 16;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 670 of file CpSolverResponse.java.
double com.google.ortools.sat.CpSolverResponse.getWallTime | ( | ) |
The time counted from the beginning of the Solve() call.
double wall_time = 15;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 659 of file CpSolverResponse.java.
int com.google.ortools.sat.CpSolverResponse.hashCode | ( | ) |
Definition at line 1083 of file CpSolverResponse.java.
boolean com.google.ortools.sat.CpSolverResponse.hasIntegerObjective | ( | ) |
Contains the integer objective optimized internally. This is only filled if the problem had a floating point objective, and on the final response, not the ones given to callbacks.
.operations_research.sat.CpObjectiveProto integer_objective = 28;
Implements com.google.ortools.sat.CpSolverResponseOrBuilder.
Definition at line 501 of file CpSolverResponse.java.
|
protected |
Definition at line 51 of file CpSolverResponse.java.
final boolean com.google.ortools.sat.CpSolverResponse.isInitialized | ( | ) |
Definition at line 800 of file CpSolverResponse.java.
|
static |
Definition at line 1239 of file CpSolverResponse.java.
|
static |
Definition at line 1242 of file CpSolverResponse.java.
Builder com.google.ortools.sat.CpSolverResponse.newBuilderForType | ( | ) |
Definition at line 1238 of file CpSolverResponse.java.
|
protected |
Definition at line 1252 of file CpSolverResponse.java.
|
static |
Definition at line 1210 of file CpSolverResponse.java.
|
static |
Definition at line 1216 of file CpSolverResponse.java.
|
static |
Definition at line 1187 of file CpSolverResponse.java.
|
static |
Definition at line 1191 of file CpSolverResponse.java.
|
static |
Definition at line 1176 of file CpSolverResponse.java.
|
static |
Definition at line 1181 of file CpSolverResponse.java.
|
static |
Definition at line 1223 of file CpSolverResponse.java.
|
static |
Definition at line 1229 of file CpSolverResponse.java.
|
static |
Definition at line 1197 of file CpSolverResponse.java.
|
static |
Definition at line 1202 of file CpSolverResponse.java.
|
static |
Definition at line 1165 of file CpSolverResponse.java.
|
static |
Definition at line 1170 of file CpSolverResponse.java.
|
static |
Definition at line 4242 of file CpSolverResponse.java.
Builder com.google.ortools.sat.CpSolverResponse.toBuilder | ( | ) |
Definition at line 1246 of file CpSolverResponse.java.
void com.google.ortools.sat.CpSolverResponse.writeTo | ( | com.google.protobuf.CodedOutputStream | output | ) | throws java.io.IOException |
Definition at line 810 of file CpSolverResponse.java.
|
static |
Definition at line 170 of file CpSolverResponse.java.
|
static |
Definition at line 153 of file CpSolverResponse.java.
|
static |
Definition at line 674 of file CpSolverResponse.java.
|
static |
Definition at line 685 of file CpSolverResponse.java.
|
static |
Definition at line 532 of file CpSolverResponse.java.
|
static |
Definition at line 488 of file CpSolverResponse.java.
|
static |
Definition at line 604 of file CpSolverResponse.java.
|
static |
Definition at line 571 of file CpSolverResponse.java.
|
static |
Definition at line 593 of file CpSolverResponse.java.
|
static |
Definition at line 582 of file CpSolverResponse.java.
|
static |
Definition at line 615 of file CpSolverResponse.java.
|
static |
Definition at line 552 of file CpSolverResponse.java.
|
static |
Definition at line 637 of file CpSolverResponse.java.
|
static |
Definition at line 626 of file CpSolverResponse.java.
|
static |
Definition at line 135 of file CpSolverResponse.java.
|
static |
Definition at line 84 of file CpSolverResponse.java.
|
static |
Definition at line 700 of file CpSolverResponse.java.
|
static |
Definition at line 749 of file CpSolverResponse.java.
|
static |
Definition at line 58 of file CpSolverResponse.java.
|
static |
Definition at line 392 of file CpSolverResponse.java.
|
static |
Definition at line 256 of file CpSolverResponse.java.
|
static |
Definition at line 663 of file CpSolverResponse.java.
|
static |
Definition at line 648 of file CpSolverResponse.java.