Java Reference
Java Reference
Detailed Description
The response returned by a solver trying to solve a CpModelProto. TODO(user): support returning multiple solutions. Look at the Stubby streaming API as we probably wants to get them as they are found. Next id: 24
Protobuf type
Definition at line 16 of file CpSolverResponse.java.
Classes | |
| class | Builder |
Public Member Functions | |
| .lang.Override final com.google.protobuf.UnknownFieldSet | getUnknownFields () |
| .lang.Override int | getStatusValue () |
| .lang.Override com.google.ortools.sat.CpSolverStatus | getStatus () |
| .lang.Override java.util.List< java.lang.Long > | getSolutionList () |
| int | getSolutionCount () |
| long | getSolution (int index) |
| .lang.Override double | getObjectiveValue () |
| .lang.Override double | getBestObjectiveBound () |
| .lang.Override java.util.List< java.lang.Long > | getSolutionLowerBoundsList () |
| int | getSolutionLowerBoundsCount () |
| long | getSolutionLowerBounds (int index) |
| .lang.Override java.util.List< java.lang.Long > | getSolutionUpperBoundsList () |
repeated int64 solution_upper_bounds = 19; More... | |
| int | getSolutionUpperBoundsCount () |
repeated int64 solution_upper_bounds = 19; More... | |
| long | getSolutionUpperBounds (int index) |
repeated int64 solution_upper_bounds = 19; More... | |
| .lang.Override java.util.List< com.google.ortools.sat.IntegerVariableProto > | getTightenedVariablesList () |
| .lang.Override java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuilder > | getTightenedVariablesOrBuilderList () |
| .lang.Override int | getTightenedVariablesCount () |
| .lang.Override com.google.ortools.sat.IntegerVariableProto | getTightenedVariables (int index) |
| .lang.Override com.google.ortools.sat.IntegerVariableProtoOrBuilder | getTightenedVariablesOrBuilder (int index) |
| .lang.Override java.util.List< java.lang.Integer > | getSufficientAssumptionsForInfeasibilityList () |
| int | getSufficientAssumptionsForInfeasibilityCount () |
| int | getSufficientAssumptionsForInfeasibility (int index) |
| .lang.Override boolean | getAllSolutionsWereFound () |
| .lang.Override long | getNumBooleans () |
| .lang.Override long | getNumConflicts () |
int64 num_conflicts = 11; More... | |
| .lang.Override long | getNumBranches () |
int64 num_branches = 12; More... | |
| .lang.Override long | getNumBinaryPropagations () |
int64 num_binary_propagations = 13; More... | |
| .lang.Override long | getNumIntegerPropagations () |
int64 num_integer_propagations = 14; More... | |
| .lang.Override double | getWallTime () |
double wall_time = 15; More... | |
| .lang.Override double | getUserTime () |
double user_time = 16; More... | |
| .lang.Override double | getDeterministicTime () |
double deterministic_time = 17; More... | |
| .lang.Override double | getPrimalIntegral () |
double primal_integral = 22; More... | |
| .lang.Override java.lang.String | getSolutionInfo () |
| .lang.Override com.google.protobuf.ByteString | getSolutionInfoBytes () |
| .lang.Override final boolean | isInitialized () |
| .lang.Override void | writeTo (com.google.protobuf.CodedOutputStream output) throws java.io.IOException |
| .lang.Override int | getSerializedSize () |
| .lang.Override boolean | equals (final java.lang.Object obj) |
| .lang.Override int | hashCode () |
| .lang.Override Builder | newBuilderForType () |
| .lang.Override Builder | toBuilder () |
| .lang.Override com.google.protobuf.Parser< CpSolverResponse > | getParserForType () |
| .lang.Override com.google.ortools.sat.CpSolverResponse | getDefaultInstanceForType () |
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 | |
| .lang.Override java.lang.Object | newInstance (UnusedPrivateParameter unused) |
| .lang.Override com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
| .lang.Override Builder | newBuilderForType (com.google.protobuf.GeneratedMessageV3.BuilderParent parent) |
Member Function Documentation
◆ equals()
|
inline |
Definition at line 1032 of file CpSolverResponse.java.
◆ getAllSolutionsWereFound()
|
inline |
This will be true iff the solver was asked to find all solutions to a satisfiability problem (or all optimal solutions to an optimization problem), and it was successful in doing so. TODO(user): Remove as we also use the OPTIMAL vs FEASIBLE status for that.
bool all_solutions_were_found = 5;
- Returns
- The allSolutionsWereFound.
Implements CpSolverResponseOrBuilder.
Definition at line 661 of file CpSolverResponse.java.
◆ getBestObjectiveBound()
|
inline |
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;
- Returns
- The bestObjectiveBound.
Implements CpSolverResponseOrBuilder.
Definition at line 385 of file CpSolverResponse.java.
◆ getDefaultInstance()
|
inlinestatic |
Definition at line 3230 of file CpSolverResponse.java.
◆ getDefaultInstanceForType()
|
inline |
Definition at line 3255 of file CpSolverResponse.java.
◆ getDescriptor()
|
inlinestatic |
Definition at line 266 of file CpSolverResponse.java.
◆ getDeterministicTime()
|
inline |
double deterministic_time = 17;
- Returns
- The deterministicTime.
Implements CpSolverResponseOrBuilder.
Definition at line 753 of file CpSolverResponse.java.
◆ getNumBinaryPropagations()
|
inline |
int64 num_binary_propagations = 13;
- Returns
- The numBinaryPropagations.
Implements CpSolverResponseOrBuilder.
Definition at line 709 of file CpSolverResponse.java.
◆ getNumBooleans()
|
inline |
Some statistics about the solve.
int64 num_booleans = 10;
- Returns
- The numBooleans.
Implements CpSolverResponseOrBuilder.
Definition at line 676 of file CpSolverResponse.java.
◆ getNumBranches()
|
inline |
int64 num_branches = 12;
- Returns
- The numBranches.
Implements CpSolverResponseOrBuilder.
Definition at line 698 of file CpSolverResponse.java.
◆ getNumConflicts()
|
inline |
int64 num_conflicts = 11;
- Returns
- The numConflicts.
Implements CpSolverResponseOrBuilder.
Definition at line 687 of file CpSolverResponse.java.
◆ getNumIntegerPropagations()
|
inline |
int64 num_integer_propagations = 14;
- Returns
- The numIntegerPropagations.
Implements CpSolverResponseOrBuilder.
Definition at line 720 of file CpSolverResponse.java.
◆ getObjectiveValue()
|
inline |
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;
- Returns
- The objectiveValue.
Implements CpSolverResponseOrBuilder.
Definition at line 368 of file CpSolverResponse.java.
◆ getParserForType()
|
inline |
Definition at line 3250 of file CpSolverResponse.java.
◆ getPrimalIntegral()
|
inline |
double primal_integral = 22;
- Returns
- The primalIntegral.
Implements CpSolverResponseOrBuilder.
Definition at line 764 of file CpSolverResponse.java.
◆ getSerializedSize()
|
inline |
Definition at line 906 of file CpSolverResponse.java.
◆ getSolution()
|
inline |
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;
- Parameters
-
index The index of the element to return.
- Returns
- The solution at the given index.
Implements CpSolverResponseOrBuilder.
Definition at line 349 of file CpSolverResponse.java.
◆ getSolutionCount()
|
inline |
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;
- Returns
- The count of solution.
Implements CpSolverResponseOrBuilder.
Definition at line 334 of file CpSolverResponse.java.
◆ getSolutionInfo()
|
inline |
Additional information about how the solution was found.
string solution_info = 20;
- Returns
- The solutionInfo.
Implements CpSolverResponseOrBuilder.
Definition at line 779 of file CpSolverResponse.java.
◆ getSolutionInfoBytes()
|
inline |
Additional information about how the solution was found.
string solution_info = 20;
- Returns
- The bytes for solutionInfo.
Implements CpSolverResponseOrBuilder.
Definition at line 801 of file CpSolverResponse.java.
◆ getSolutionList()
|
inline |
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;
- Returns
- A list containing the solution.
Implements CpSolverResponseOrBuilder.
Definition at line 320 of file CpSolverResponse.java.
◆ getSolutionLowerBounds()
|
inline |
Advanced usage. If the problem has some variables that are not fixed at the end of the search (because of a particular search strategy in the CpModelProto) then this will be used instead of filling the solution above. The two fields will then contains the lower and upper bounds of each variable as they were when the best "solution" was found.
repeated int64 solution_lower_bounds = 18;
- Parameters
-
index The index of the element to return.
- Returns
- The solutionLowerBounds at the given index.
Implements CpSolverResponseOrBuilder.
Definition at line 439 of file CpSolverResponse.java.
◆ getSolutionLowerBoundsCount()
|
inline |
Advanced usage. If the problem has some variables that are not fixed at the end of the search (because of a particular search strategy in the CpModelProto) then this will be used instead of filling the solution above. The two fields will then contains the lower and upper bounds of each variable as they were when the best "solution" was found.
repeated int64 solution_lower_bounds = 18;
- Returns
- The count of solutionLowerBounds.
Implements CpSolverResponseOrBuilder.
Definition at line 422 of file CpSolverResponse.java.
◆ getSolutionLowerBoundsList()
|
inline |
Advanced usage. If the problem has some variables that are not fixed at the end of the search (because of a particular search strategy in the CpModelProto) then this will be used instead of filling the solution above. The two fields will then contains the lower and upper bounds of each variable as they were when the best "solution" was found.
repeated int64 solution_lower_bounds = 18;
- Returns
- A list containing the solutionLowerBounds.
Implements CpSolverResponseOrBuilder.
Definition at line 406 of file CpSolverResponse.java.
◆ getSolutionUpperBounds()
|
inline |
repeated int64 solution_upper_bounds = 19;
- Parameters
-
index The index of the element to return.
- Returns
- The solutionUpperBounds at the given index.
Implements CpSolverResponseOrBuilder.
Definition at line 467 of file CpSolverResponse.java.
◆ getSolutionUpperBoundsCount()
|
inline |
repeated int64 solution_upper_bounds = 19;
- Returns
- The count of solutionUpperBounds.
Implements CpSolverResponseOrBuilder.
Definition at line 459 of file CpSolverResponse.java.
◆ getSolutionUpperBoundsList()
|
inline |
repeated int64 solution_upper_bounds = 19;
- Returns
- A list containing the solutionUpperBounds.
Implements CpSolverResponseOrBuilder.
Definition at line 452 of file CpSolverResponse.java.
◆ getStatus()
|
inline |
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;
- Returns
- The status.
Implements CpSolverResponseOrBuilder.
Definition at line 299 of file CpSolverResponse.java.
◆ getStatusValue()
|
inline |
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;
- Returns
- The enum numeric value on the wire for status.
Implements CpSolverResponseOrBuilder.
Definition at line 288 of file CpSolverResponse.java.
◆ getSufficientAssumptionsForInfeasibility()
|
inline |
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.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
- Parameters
-
index The index of the element to return.
- Returns
- The sufficientAssumptionsForInfeasibility at the given index.
Implements CpSolverResponseOrBuilder.
Definition at line 642 of file CpSolverResponse.java.
◆ getSufficientAssumptionsForInfeasibilityCount()
|
inline |
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.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
- Returns
- The count of sufficientAssumptionsForInfeasibility.
Implements CpSolverResponseOrBuilder.
Definition at line 620 of file CpSolverResponse.java.
◆ getSufficientAssumptionsForInfeasibilityList()
|
inline |
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.
repeated int32 sufficient_assumptions_for_infeasibility = 23;
- Returns
- A list containing the sufficientAssumptionsForInfeasibility.
Implements CpSolverResponseOrBuilder.
Definition at line 599 of file CpSolverResponse.java.
◆ getTightenedVariables()
|
inline |
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. If the problem is a feasibility problem, then these bounds will be valid for any feasible solution. If the problem is an optimization problem, then these bounds will only be valid for any OPTIMAL solutions, it can exclude sub-optimal feasible ones.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements CpSolverResponseOrBuilder.
Definition at line 552 of file CpSolverResponse.java.
◆ getTightenedVariablesCount()
|
inline |
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. If the problem is a feasibility problem, then these bounds will be valid for any feasible solution. If the problem is an optimization problem, then these bounds will only be valid for any OPTIMAL solutions, it can exclude sub-optimal feasible ones.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements CpSolverResponseOrBuilder.
Definition at line 532 of file CpSolverResponse.java.
◆ getTightenedVariablesList()
|
inline |
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. If the problem is a feasibility problem, then these bounds will be valid for any feasible solution. If the problem is an optimization problem, then these bounds will only be valid for any OPTIMAL solutions, it can exclude sub-optimal feasible ones.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements CpSolverResponseOrBuilder.
Definition at line 491 of file CpSolverResponse.java.
◆ getTightenedVariablesOrBuilder()
|
inline |
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. If the problem is a feasibility problem, then these bounds will be valid for any feasible solution. If the problem is an optimization problem, then these bounds will only be valid for any OPTIMAL solutions, it can exclude sub-optimal feasible ones.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements CpSolverResponseOrBuilder.
Definition at line 572 of file CpSolverResponse.java.
◆ getTightenedVariablesOrBuilderList()
|
inline |
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. If the problem is a feasibility problem, then these bounds will be valid for any feasible solution. If the problem is an optimization problem, then these bounds will only be valid for any OPTIMAL solutions, it can exclude sub-optimal feasible ones.
repeated .operations_research.sat.IntegerVariableProto tightened_variables = 21;
Implements CpSolverResponseOrBuilder.
Definition at line 512 of file CpSolverResponse.java.
◆ getUnknownFields()
|
inline |
Definition at line 44 of file CpSolverResponse.java.
◆ getUserTime()
|
inline |
double user_time = 16;
- Returns
- The userTime.
Implements CpSolverResponseOrBuilder.
Definition at line 742 of file CpSolverResponse.java.
◆ getWallTime()
|
inline |
double wall_time = 15;
- Returns
- The wallTime.
Implements CpSolverResponseOrBuilder.
Definition at line 731 of file CpSolverResponse.java.
◆ hashCode()
|
inline |
Definition at line 1089 of file CpSolverResponse.java.
◆ internalGetFieldAccessorTable()
|
inlineprotected |
Definition at line 272 of file CpSolverResponse.java.
◆ isInitialized()
|
inline |
Definition at line 816 of file CpSolverResponse.java.
◆ newBuilder() [1/2]
|
inlinestatic |
Definition at line 1232 of file CpSolverResponse.java.
◆ newBuilder() [2/2]
|
inlinestatic |
Definition at line 1235 of file CpSolverResponse.java.
◆ newBuilderForType() [1/2]
|
inline |
Definition at line 1231 of file CpSolverResponse.java.
◆ newBuilderForType() [2/2]
|
inlineprotected |
Definition at line 1245 of file CpSolverResponse.java.
◆ newInstance()
|
inlineprotected |
Definition at line 37 of file CpSolverResponse.java.
◆ parseDelimitedFrom() [1/2]
|
inlinestatic |
Definition at line 1204 of file CpSolverResponse.java.
◆ parseDelimitedFrom() [2/2]
|
inlinestatic |
Definition at line 1209 of file CpSolverResponse.java.
◆ parseFrom() [1/10]
|
inlinestatic |
Definition at line 1182 of file CpSolverResponse.java.
◆ parseFrom() [2/10]
|
inlinestatic |
Definition at line 1186 of file CpSolverResponse.java.
◆ parseFrom() [3/10]
|
inlinestatic |
Definition at line 1171 of file CpSolverResponse.java.
◆ parseFrom() [4/10]
|
inlinestatic |
Definition at line 1176 of file CpSolverResponse.java.
◆ parseFrom() [5/10]
|
inlinestatic |
Definition at line 1216 of file CpSolverResponse.java.
◆ parseFrom() [6/10]
|
inlinestatic |
Definition at line 1222 of file CpSolverResponse.java.
◆ parseFrom() [7/10]
|
inlinestatic |
Definition at line 1192 of file CpSolverResponse.java.
◆ parseFrom() [8/10]
|
inlinestatic |
Definition at line 1197 of file CpSolverResponse.java.
◆ parseFrom() [9/10]
|
inlinestatic |
Definition at line 1160 of file CpSolverResponse.java.
◆ parseFrom() [10/10]
|
inlinestatic |
Definition at line 1165 of file CpSolverResponse.java.
◆ parser()
|
inlinestatic |
Definition at line 3245 of file CpSolverResponse.java.
◆ toBuilder()
|
inline |
Definition at line 1239 of file CpSolverResponse.java.
◆ writeTo()
|
inline |
Definition at line 826 of file CpSolverResponse.java.
Member Data Documentation
◆ ALL_SOLUTIONS_WERE_FOUND_FIELD_NUMBER
|
static |
Definition at line 647 of file CpSolverResponse.java.
◆ BEST_OBJECTIVE_BOUND_FIELD_NUMBER
|
static |
Definition at line 372 of file CpSolverResponse.java.
◆ DETERMINISTIC_TIME_FIELD_NUMBER
|
static |
Definition at line 746 of file CpSolverResponse.java.
◆ NUM_BINARY_PROPAGATIONS_FIELD_NUMBER
|
static |
Definition at line 702 of file CpSolverResponse.java.
◆ NUM_BOOLEANS_FIELD_NUMBER
|
static |
Definition at line 665 of file CpSolverResponse.java.
◆ NUM_BRANCHES_FIELD_NUMBER
|
static |
Definition at line 691 of file CpSolverResponse.java.
◆ NUM_CONFLICTS_FIELD_NUMBER
|
static |
Definition at line 680 of file CpSolverResponse.java.
◆ NUM_INTEGER_PROPAGATIONS_FIELD_NUMBER
|
static |
Definition at line 713 of file CpSolverResponse.java.
◆ OBJECTIVE_VALUE_FIELD_NUMBER
|
static |
Definition at line 354 of file CpSolverResponse.java.
◆ PRIMAL_INTEGRAL_FIELD_NUMBER
|
static |
Definition at line 757 of file CpSolverResponse.java.
◆ SOLUTION_FIELD_NUMBER
|
static |
Definition at line 305 of file CpSolverResponse.java.
◆ SOLUTION_INFO_FIELD_NUMBER
|
static |
Definition at line 768 of file CpSolverResponse.java.
◆ SOLUTION_LOWER_BOUNDS_FIELD_NUMBER
|
static |
Definition at line 389 of file CpSolverResponse.java.
◆ SOLUTION_UPPER_BOUNDS_FIELD_NUMBER
|
static |
Definition at line 444 of file CpSolverResponse.java.
◆ STATUS_FIELD_NUMBER
|
static |
Definition at line 278 of file CpSolverResponse.java.
◆ SUFFICIENT_ASSUMPTIONS_FOR_INFEASIBILITY_FIELD_NUMBER
|
static |
Definition at line 577 of file CpSolverResponse.java.
◆ TIGHTENED_VARIABLES_FIELD_NUMBER
|
static |
Definition at line 472 of file CpSolverResponse.java.
◆ USER_TIME_FIELD_NUMBER
|
static |
Definition at line 735 of file CpSolverResponse.java.
◆ WALL_TIME_FIELD_NUMBER
|
static |
Definition at line 724 of file CpSolverResponse.java.
The documentation for this class was generated from the following file: