public final class CpSolverResponse extends com.google.protobuf.GeneratedMessage implements CpSolverResponseOrBuilder
The response returned by a solver trying to solve a CpModelProto. Next id: 31Protobuf type
operations_research.sat.CpSolverResponse| Modifier and Type | Class and Description |
|---|---|
static class |
CpSolverResponse.Builder
The response returned by a solver trying to solve a CpModelProto.
|
com.google.protobuf.GeneratedMessage.ExtendableBuilder<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>,BuilderT extends com.google.protobuf.GeneratedMessage.ExtendableBuilder<MessageT,BuilderT>>, com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>>, com.google.protobuf.GeneratedMessage.ExtendableMessageOrBuilder<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>>, com.google.protobuf.GeneratedMessage.FieldAccessorTable, com.google.protobuf.GeneratedMessage.GeneratedExtension<ContainingT extends com.google.protobuf.Message,T>, com.google.protobuf.GeneratedMessage.UnusedPrivateParameter| Modifier and Type | Field and Description |
|---|---|
static int |
ADDITIONAL_SOLUTIONS_FIELD_NUMBER |
static int |
BEST_OBJECTIVE_BOUND_FIELD_NUMBER |
static int |
DETERMINISTIC_TIME_FIELD_NUMBER |
static int |
GAP_INTEGRAL_FIELD_NUMBER |
static int |
INNER_OBJECTIVE_LOWER_BOUND_FIELD_NUMBER |
static int |
INTEGER_OBJECTIVE_FIELD_NUMBER |
static int |
NUM_BINARY_PROPAGATIONS_FIELD_NUMBER |
static int |
NUM_BOOLEANS_FIELD_NUMBER |
static int |
NUM_BRANCHES_FIELD_NUMBER |
static int |
NUM_CONFLICTS_FIELD_NUMBER |
static int |
NUM_INTEGER_PROPAGATIONS_FIELD_NUMBER |
static int |
NUM_INTEGERS_FIELD_NUMBER |
static int |
NUM_LP_ITERATIONS_FIELD_NUMBER |
static int |
NUM_RESTARTS_FIELD_NUMBER |
static int |
OBJECTIVE_VALUE_FIELD_NUMBER |
static int |
SOLUTION_FIELD_NUMBER |
static int |
SOLUTION_INFO_FIELD_NUMBER |
static int |
SOLVE_LOG_FIELD_NUMBER |
static int |
STATUS_FIELD_NUMBER |
static int |
SUFFICIENT_ASSUMPTIONS_FOR_INFEASIBILITY_FIELD_NUMBER |
static int |
TIGHTENED_VARIABLES_FIELD_NUMBER |
static int |
USER_TIME_FIELD_NUMBER |
static int |
WALL_TIME_FIELD_NUMBER |
| Modifier and Type | Method and Description |
|---|---|
boolean |
equals(java.lang.Object obj) |
CpSolverSolution |
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.
|
int |
getAdditionalSolutionsCount()
If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.
|
java.util.List<CpSolverSolution> |
getAdditionalSolutionsList()
If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.
|
CpSolverSolutionOrBuilder |
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.
|
java.util.List<? extends CpSolverSolutionOrBuilder> |
getAdditionalSolutionsOrBuilderList()
If the parameter fill_additional_solutions_in_response is set, then we
copy all the solutions from our internal solution pool here.
|
double |
getBestObjectiveBound()
Only make sense for an optimization problem.
|
static CpSolverResponse |
getDefaultInstance() |
CpSolverResponse |
getDefaultInstanceForType() |
static com.google.protobuf.Descriptors.Descriptor |
getDescriptor() |
double |
getDeterministicTime()
double deterministic_time = 17; |
double |
getGapIntegral()
The integral of log(1 + absolute_objective_gap) over time.
|
long |
getInnerObjectiveLowerBound()
Advanced usage.
|
CpObjectiveProto |
getIntegerObjective()
Contains the integer objective optimized internally.
|
CpObjectiveProtoOrBuilder |
getIntegerObjectiveOrBuilder()
Contains the integer objective optimized internally.
|
long |
getNumBinaryPropagations()
int64 num_binary_propagations = 13; |
long |
getNumBooleans()
int64 num_booleans = 10; |
long |
getNumBranches()
int64 num_branches = 12; |
long |
getNumConflicts()
int64 num_conflicts = 11; |
long |
getNumIntegerPropagations()
int64 num_integer_propagations = 14; |
long |
getNumIntegers()
Some statistics about the solve.
|
long |
getNumLpIterations()
int64 num_lp_iterations = 25; |
long |
getNumRestarts()
int64 num_restarts = 24; |
double |
getObjectiveValue()
Only make sense for an optimization problem.
|
com.google.protobuf.Parser<CpSolverResponse> |
getParserForType() |
int |
getSerializedSize() |
long |
getSolution(int index)
A feasible solution to the given problem.
|
int |
getSolutionCount()
A feasible solution to the given problem.
|
java.lang.String |
getSolutionInfo()
Additional information about how the solution was found.
|
com.google.protobuf.ByteString |
getSolutionInfoBytes()
Additional information about how the solution was found.
|
java.util.List<java.lang.Long> |
getSolutionList()
A feasible solution to the given problem.
|
java.lang.String |
getSolveLog()
The solve log will be filled if the parameter log_to_response is set to
true.
|
com.google.protobuf.ByteString |
getSolveLogBytes()
The solve log will be filled if the parameter log_to_response is set to
true.
|
CpSolverStatus |
getStatus()
The status of the solve.
|
int |
getStatusValue()
The status of the solve.
|
int |
getSufficientAssumptionsForInfeasibility(int index)
A subset of the model "assumptions" field.
|
int |
getSufficientAssumptionsForInfeasibilityCount()
A subset of the model "assumptions" field.
|
java.util.List<java.lang.Integer> |
getSufficientAssumptionsForInfeasibilityList()
A subset of the model "assumptions" field.
|
IntegerVariableProto |
getTightenedVariables(int index)
Advanced usage.
|
int |
getTightenedVariablesCount()
Advanced usage.
|
java.util.List<IntegerVariableProto> |
getTightenedVariablesList()
Advanced usage.
|
IntegerVariableProtoOrBuilder |
getTightenedVariablesOrBuilder(int index)
Advanced usage.
|
java.util.List<? extends IntegerVariableProtoOrBuilder> |
getTightenedVariablesOrBuilderList()
Advanced usage.
|
double |
getUserTime()
double user_time = 16; |
double |
getWallTime()
The time counted from the beginning of the Solve() call.
|
int |
hashCode() |
boolean |
hasIntegerObjective()
Contains the integer objective optimized internally.
|
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable |
internalGetFieldAccessorTable() |
boolean |
isInitialized() |
static CpSolverResponse.Builder |
newBuilder() |
static CpSolverResponse.Builder |
newBuilder(CpSolverResponse prototype) |
CpSolverResponse.Builder |
newBuilderForType() |
protected CpSolverResponse.Builder |
newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent) |
static CpSolverResponse |
parseDelimitedFrom(java.io.InputStream input) |
static CpSolverResponse |
parseDelimitedFrom(java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static CpSolverResponse |
parseFrom(byte[] data) |
static CpSolverResponse |
parseFrom(byte[] data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static CpSolverResponse |
parseFrom(java.nio.ByteBuffer data) |
static CpSolverResponse |
parseFrom(java.nio.ByteBuffer data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static CpSolverResponse |
parseFrom(com.google.protobuf.ByteString data) |
static CpSolverResponse |
parseFrom(com.google.protobuf.ByteString data,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static CpSolverResponse |
parseFrom(com.google.protobuf.CodedInputStream input) |
static CpSolverResponse |
parseFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static CpSolverResponse |
parseFrom(java.io.InputStream input) |
static CpSolverResponse |
parseFrom(java.io.InputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
static com.google.protobuf.Parser<CpSolverResponse> |
parser() |
CpSolverResponse.Builder |
toBuilder() |
void |
writeTo(com.google.protobuf.CodedOutputStream output) |
canUseUnsafe, computeStringSize, computeStringSizeNoTag, emptyBooleanList, emptyDoubleList, emptyFloatList, emptyIntList, emptyList, emptyLongList, getAllFields, getDescriptorForType, getField, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, isStringEmpty, makeMutableCopy, makeMutableCopy, mergeFromAndMakeImmutableInternal, newFileScopedGeneratedExtension, newInstance, newMessageScopedGeneratedExtension, parseDelimitedWithIOException, parseDelimitedWithIOException, parseUnknownField, parseUnknownFieldProto3, parseWithIOException, parseWithIOException, parseWithIOException, parseWithIOException, serializeBooleanMapTo, serializeIntegerMapTo, serializeLongMapTo, serializeStringMapTo, writeReplace, writeString, writeStringNoTagfindInitializationErrors, getInitializationErrorString, hashFields, toStringaddAll, checkByteStringIsUtf8, toByteArray, toByteString, writeDelimitedTo, writeToclone, finalize, getClass, notify, notifyAll, wait, wait, waitpublic static final int STATUS_FIELD_NUMBER
public static final int SOLUTION_FIELD_NUMBER
public static final int OBJECTIVE_VALUE_FIELD_NUMBER
public static final int BEST_OBJECTIVE_BOUND_FIELD_NUMBER
public static final int ADDITIONAL_SOLUTIONS_FIELD_NUMBER
public static final int TIGHTENED_VARIABLES_FIELD_NUMBER
public static final int SUFFICIENT_ASSUMPTIONS_FOR_INFEASIBILITY_FIELD_NUMBER
public static final int INTEGER_OBJECTIVE_FIELD_NUMBER
public static final int INNER_OBJECTIVE_LOWER_BOUND_FIELD_NUMBER
public static final int NUM_INTEGERS_FIELD_NUMBER
public static final int NUM_BOOLEANS_FIELD_NUMBER
public static final int NUM_CONFLICTS_FIELD_NUMBER
public static final int NUM_BRANCHES_FIELD_NUMBER
public static final int NUM_BINARY_PROPAGATIONS_FIELD_NUMBER
public static final int NUM_INTEGER_PROPAGATIONS_FIELD_NUMBER
public static final int NUM_RESTARTS_FIELD_NUMBER
public static final int NUM_LP_ITERATIONS_FIELD_NUMBER
public static final int WALL_TIME_FIELD_NUMBER
public static final int USER_TIME_FIELD_NUMBER
public static final int DETERMINISTIC_TIME_FIELD_NUMBER
public static final int GAP_INTEGRAL_FIELD_NUMBER
public static final int SOLUTION_INFO_FIELD_NUMBER
public static final int SOLVE_LOG_FIELD_NUMBER
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()
internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessagepublic int getStatusValue()
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;getStatusValue in interface CpSolverResponseOrBuilderpublic CpSolverStatus getStatus()
The status of the solve.
.operations_research.sat.CpSolverStatus status = 1;getStatus in interface CpSolverResponseOrBuilderpublic java.util.List<java.lang.Long> 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;getSolutionList in interface CpSolverResponseOrBuilderpublic int 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;getSolutionCount in interface CpSolverResponseOrBuilderpublic long 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;getSolution in interface CpSolverResponseOrBuilderindex - The index of the element to return.public double 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;getObjectiveValue in interface CpSolverResponseOrBuilderpublic double 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;getBestObjectiveBound in interface CpSolverResponseOrBuilderpublic java.util.List<CpSolverSolution> 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;getAdditionalSolutionsList in interface CpSolverResponseOrBuilderpublic java.util.List<? extends CpSolverSolutionOrBuilder> 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;getAdditionalSolutionsOrBuilderList in interface CpSolverResponseOrBuilderpublic int 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;getAdditionalSolutionsCount in interface CpSolverResponseOrBuilderpublic CpSolverSolution 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;getAdditionalSolutions in interface CpSolverResponseOrBuilderpublic CpSolverSolutionOrBuilder 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;getAdditionalSolutionsOrBuilder in interface CpSolverResponseOrBuilderpublic java.util.List<IntegerVariableProto> 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. 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;getTightenedVariablesList in interface CpSolverResponseOrBuilderpublic java.util.List<? extends IntegerVariableProtoOrBuilder> 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. 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;getTightenedVariablesOrBuilderList in interface CpSolverResponseOrBuilderpublic int 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. 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;getTightenedVariablesCount in interface CpSolverResponseOrBuilderpublic IntegerVariableProto 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. 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;getTightenedVariables in interface CpSolverResponseOrBuilderpublic IntegerVariableProtoOrBuilder 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. 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;getTightenedVariablesOrBuilder in interface CpSolverResponseOrBuilderpublic java.util.List<java.lang.Integer> 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;getSufficientAssumptionsForInfeasibilityList in interface CpSolverResponseOrBuilderpublic int 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;getSufficientAssumptionsForInfeasibilityCount in interface CpSolverResponseOrBuilderpublic int 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;getSufficientAssumptionsForInfeasibility in interface CpSolverResponseOrBuilderindex - The index of the element to return.public boolean 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;hasIntegerObjective in interface CpSolverResponseOrBuilderpublic CpObjectiveProto 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;getIntegerObjective in interface CpSolverResponseOrBuilderpublic CpObjectiveProtoOrBuilder 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;getIntegerObjectiveOrBuilder in interface CpSolverResponseOrBuilderpublic long 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;getInnerObjectiveLowerBound in interface CpSolverResponseOrBuilderpublic long 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;getNumIntegers in interface CpSolverResponseOrBuilderpublic long getNumBooleans()
int64 num_booleans = 10;getNumBooleans in interface CpSolverResponseOrBuilderpublic long getNumConflicts()
int64 num_conflicts = 11;getNumConflicts in interface CpSolverResponseOrBuilderpublic long getNumBranches()
int64 num_branches = 12;getNumBranches in interface CpSolverResponseOrBuilderpublic long getNumBinaryPropagations()
int64 num_binary_propagations = 13;getNumBinaryPropagations in interface CpSolverResponseOrBuilderpublic long getNumIntegerPropagations()
int64 num_integer_propagations = 14;getNumIntegerPropagations in interface CpSolverResponseOrBuilderpublic long getNumRestarts()
int64 num_restarts = 24;getNumRestarts in interface CpSolverResponseOrBuilderpublic long getNumLpIterations()
int64 num_lp_iterations = 25;getNumLpIterations in interface CpSolverResponseOrBuilderpublic double getWallTime()
The time counted from the beginning of the Solve() call.
double wall_time = 15;getWallTime in interface CpSolverResponseOrBuilderpublic double getUserTime()
double user_time = 16;getUserTime in interface CpSolverResponseOrBuilderpublic double getDeterministicTime()
double deterministic_time = 17;getDeterministicTime in interface CpSolverResponseOrBuilderpublic double getGapIntegral()
The integral of log(1 + absolute_objective_gap) over time.
double gap_integral = 22;getGapIntegral in interface CpSolverResponseOrBuilderpublic java.lang.String 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;getSolutionInfo in interface CpSolverResponseOrBuilderpublic com.google.protobuf.ByteString 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;getSolutionInfoBytes in interface CpSolverResponseOrBuilderpublic java.lang.String getSolveLog()
The solve log will be filled if the parameter log_to_response is set to true.
string solve_log = 26;getSolveLog in interface CpSolverResponseOrBuilderpublic com.google.protobuf.ByteString getSolveLogBytes()
The solve log will be filled if the parameter log_to_response is set to true.
string solve_log = 26;getSolveLogBytes in interface CpSolverResponseOrBuilderpublic final boolean isInitialized()
isInitialized in interface com.google.protobuf.MessageLiteOrBuilderisInitialized in class com.google.protobuf.GeneratedMessagepublic void writeTo(com.google.protobuf.CodedOutputStream output)
throws java.io.IOException
writeTo in interface com.google.protobuf.MessageLitewriteTo in class com.google.protobuf.GeneratedMessagejava.io.IOExceptionpublic int getSerializedSize()
getSerializedSize in interface com.google.protobuf.MessageLitegetSerializedSize in class com.google.protobuf.GeneratedMessagepublic boolean equals(java.lang.Object obj)
equals in interface com.google.protobuf.Messageequals in class com.google.protobuf.AbstractMessagepublic int hashCode()
hashCode in interface com.google.protobuf.MessagehashCode in class com.google.protobuf.AbstractMessagepublic static CpSolverResponse parseFrom(java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(byte[] data) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException
com.google.protobuf.InvalidProtocolBufferExceptionpublic static CpSolverResponse parseFrom(java.io.InputStream input) throws java.io.IOException
java.io.IOExceptionpublic static CpSolverResponse parseFrom(java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
java.io.IOExceptionpublic static CpSolverResponse parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException
java.io.IOExceptionpublic static CpSolverResponse parseDelimitedFrom(java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
java.io.IOExceptionpublic static CpSolverResponse parseFrom(com.google.protobuf.CodedInputStream input) throws java.io.IOException
java.io.IOExceptionpublic static CpSolverResponse parseFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
java.io.IOExceptionpublic CpSolverResponse.Builder newBuilderForType()
newBuilderForType in interface com.google.protobuf.MessagenewBuilderForType in interface com.google.protobuf.MessageLitepublic static CpSolverResponse.Builder newBuilder()
public static CpSolverResponse.Builder newBuilder(CpSolverResponse prototype)
public CpSolverResponse.Builder toBuilder()
toBuilder in interface com.google.protobuf.MessagetoBuilder in interface com.google.protobuf.MessageLiteprotected CpSolverResponse.Builder newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent)
newBuilderForType in class com.google.protobuf.AbstractMessagepublic static CpSolverResponse getDefaultInstance()
public static com.google.protobuf.Parser<CpSolverResponse> parser()
public com.google.protobuf.Parser<CpSolverResponse> getParserForType()
getParserForType in interface com.google.protobuf.MessagegetParserForType in interface com.google.protobuf.MessageLitegetParserForType in class com.google.protobuf.GeneratedMessagepublic CpSolverResponse getDefaultInstanceForType()
getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuildergetDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilderCopyright © 2024. All rights reserved.