Package operations_research.pdlp
Class SolveLogOuterClass.InfeasibilityInformation.Builder
java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<BuilderT>
com.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
operations_research.pdlp.SolveLogOuterClass.InfeasibilityInformation.Builder
- All Implemented Interfaces:
com.google.protobuf.Message.Builder,com.google.protobuf.MessageLite.Builder,com.google.protobuf.MessageLiteOrBuilder,com.google.protobuf.MessageOrBuilder,Cloneable,SolveLogOuterClass.InfeasibilityInformationOrBuilder
- Enclosing class:
- SolveLogOuterClass.InfeasibilityInformation
public static final class SolveLogOuterClass.InfeasibilityInformation.Builder
extends com.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
implements SolveLogOuterClass.InfeasibilityInformationOrBuilder
Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria.Protobuf type
operations_research.pdlp.InfeasibilityInformation-
Method Summary
Modifier and TypeMethodDescriptionaddRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value) build()clear()Type of the point used to compute the InfeasibilityInformation.The objective of the linear program labeled (1) in the previous paragraph.clearField(com.google.protobuf.Descriptors.FieldDescriptor field) Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof) The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.clone()Type of the point used to compute the InfeasibilityInformation.static final com.google.protobuf.Descriptors.Descriptorcom.google.protobuf.Descriptors.DescriptordoubleThe objective of the linear program labeled (1) in the previous paragraph.doubleLet (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.doubleLet x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).doubleThe value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.doubleThe l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.booleanType of the point used to compute the InfeasibilityInformation.booleanThe objective of the linear program labeled (1) in the previous paragraph.booleanLet (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.booleanLet x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).booleanThe value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.booleanThe l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTablefinal booleanmergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) mergeFrom(com.google.protobuf.Message other) mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) Type of the point used to compute the InfeasibilityInformation.setDualRayObjective(double value) The objective of the linear program labeled (1) in the previous paragraph.setMaxDualRayInfeasibility(double value) Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one.setMaxPrimalRayInfeasibility(double value) Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero).setPrimalRayLinearObjective(double value) The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.setPrimalRayQuadraticNorm(double value) The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables.setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, Object value) setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) Methods inherited from class com.google.protobuf.GeneratedMessageV3.Builder
getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, getUnknownFieldSetBuilder, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, internalGetMutableMapField, internalGetMutableMapFieldReflection, isClean, markClean, mergeUnknownLengthDelimitedField, mergeUnknownVarintField, newBuilderForField, onBuilt, onChanged, parseUnknownField, setUnknownFieldSetBuilder, setUnknownFieldsProto3Methods inherited from class com.google.protobuf.AbstractMessage.Builder
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringMethods inherited from class com.google.protobuf.AbstractMessageLite.Builder
addAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, newUninitializedMessageExceptionMethods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.protobuf.Message.Builder
mergeDelimitedFrom, mergeDelimitedFromMethods inherited from interface com.google.protobuf.MessageLite.Builder
mergeFromMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Method Details
-
getDescriptor
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() -
internalGetFieldAccessorTable
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()- Specified by:
internalGetFieldAccessorTablein classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
clear
- Specified by:
clearin interfacecom.google.protobuf.Message.Builder- Specified by:
clearin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clearin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
getDescriptorForType
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.Message.Builder- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.MessageOrBuilder- Overrides:
getDescriptorForTypein classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
getDefaultInstanceForType
- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageLiteOrBuilder- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageOrBuilder
-
build
- Specified by:
buildin interfacecom.google.protobuf.Message.Builder- Specified by:
buildin interfacecom.google.protobuf.MessageLite.Builder
-
buildPartial
- Specified by:
buildPartialin interfacecom.google.protobuf.Message.Builder- Specified by:
buildPartialin interfacecom.google.protobuf.MessageLite.Builder
-
clone
- Specified by:
clonein interfacecom.google.protobuf.Message.Builder- Specified by:
clonein interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clonein classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
setField
public SolveLogOuterClass.InfeasibilityInformation.Builder setField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value) - Specified by:
setFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
setFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
clearField
public SolveLogOuterClass.InfeasibilityInformation.Builder clearField(com.google.protobuf.Descriptors.FieldDescriptor field) - Specified by:
clearFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
clearFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
clearOneof
public SolveLogOuterClass.InfeasibilityInformation.Builder clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof) - Specified by:
clearOneofin interfacecom.google.protobuf.Message.Builder- Overrides:
clearOneofin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
setRepeatedField
public SolveLogOuterClass.InfeasibilityInformation.Builder setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, Object value) - Specified by:
setRepeatedFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
setRepeatedFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
addRepeatedField
public SolveLogOuterClass.InfeasibilityInformation.Builder addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value) - Specified by:
addRepeatedFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
addRepeatedFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
mergeFrom
public SolveLogOuterClass.InfeasibilityInformation.Builder mergeFrom(com.google.protobuf.Message other) - Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
mergeFrom
public SolveLogOuterClass.InfeasibilityInformation.Builder mergeFrom(SolveLogOuterClass.InfeasibilityInformation other) -
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
mergeFrom
public SolveLogOuterClass.InfeasibilityInformation.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException - Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Specified by:
mergeFromin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>- Throws:
IOException
-
hasMaxPrimalRayInfeasibility
public boolean hasMaxPrimalRayInfeasibility()Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero). A simple and typical choice of x_ray is x_ray = x / | x |_∞ where x is the current primal iterate projected onto the primal ray sign constraints. For this value compute the maximum absolute error in the primal linear program with the right hand side set to zero.
optional double max_primal_ray_infeasibility = 1;- Specified by:
hasMaxPrimalRayInfeasibilityin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the maxPrimalRayInfeasibility field is set.
-
getMaxPrimalRayInfeasibility
public double getMaxPrimalRayInfeasibility()Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero). A simple and typical choice of x_ray is x_ray = x / | x |_∞ where x is the current primal iterate projected onto the primal ray sign constraints. For this value compute the maximum absolute error in the primal linear program with the right hand side set to zero.
optional double max_primal_ray_infeasibility = 1;- Specified by:
getMaxPrimalRayInfeasibilityin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The maxPrimalRayInfeasibility.
-
setMaxPrimalRayInfeasibility
public SolveLogOuterClass.InfeasibilityInformation.Builder setMaxPrimalRayInfeasibility(double value) Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero). A simple and typical choice of x_ray is x_ray = x / | x |_∞ where x is the current primal iterate projected onto the primal ray sign constraints. For this value compute the maximum absolute error in the primal linear program with the right hand side set to zero.
optional double max_primal_ray_infeasibility = 1;- Parameters:
value- The maxPrimalRayInfeasibility to set.- Returns:
- This builder for chaining.
-
clearMaxPrimalRayInfeasibility
Let x_ray be the algorithm's estimate of the primal extreme ray where x_ray is a vector that satisfies the sign constraints for a ray, scaled such that its infinity norm is one (the sign constraints are the variable bound constraints, with all finite bounds mapped to zero). A simple and typical choice of x_ray is x_ray = x / | x |_∞ where x is the current primal iterate projected onto the primal ray sign constraints. For this value compute the maximum absolute error in the primal linear program with the right hand side set to zero.
optional double max_primal_ray_infeasibility = 1;- Returns:
- This builder for chaining.
-
hasPrimalRayLinearObjective
public boolean hasPrimalRayLinearObjective()The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
optional double primal_ray_linear_objective = 2;- Specified by:
hasPrimalRayLinearObjectivein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the primalRayLinearObjective field is set.
-
getPrimalRayLinearObjective
public double getPrimalRayLinearObjective()The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
optional double primal_ray_linear_objective = 2;- Specified by:
getPrimalRayLinearObjectivein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The primalRayLinearObjective.
-
setPrimalRayLinearObjective
public SolveLogOuterClass.InfeasibilityInformation.Builder setPrimalRayLinearObjective(double value) The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
optional double primal_ray_linear_objective = 2;- Parameters:
value- The primalRayLinearObjective to set.- Returns:
- This builder for chaining.
-
clearPrimalRayLinearObjective
The value of the linear part of the primal objective (ignoring additive constants) evaluated at x_ray, i.e., c' * x_ray where c is the objective coefficient vector.
optional double primal_ray_linear_objective = 2;- Returns:
- This builder for chaining.
-
hasPrimalRayQuadraticNorm
public boolean hasPrimalRayQuadraticNorm()The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables. For linear programming problems this is zero.
optional double primal_ray_quadratic_norm = 3;- Specified by:
hasPrimalRayQuadraticNormin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the primalRayQuadraticNorm field is set.
-
getPrimalRayQuadraticNorm
public double getPrimalRayQuadraticNorm()The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables. For linear programming problems this is zero.
optional double primal_ray_quadratic_norm = 3;- Specified by:
getPrimalRayQuadraticNormin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The primalRayQuadraticNorm.
-
setPrimalRayQuadraticNorm
The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables. For linear programming problems this is zero.
optional double primal_ray_quadratic_norm = 3;- Parameters:
value- The primalRayQuadraticNorm to set.- Returns:
- This builder for chaining.
-
clearPrimalRayQuadraticNorm
The l_∞ norm of the vector resulting from taking the quadratic matrix from primal objective and multiplying it by the primal variables. For linear programming problems this is zero.
optional double primal_ray_quadratic_norm = 3;- Returns:
- This builder for chaining.
-
hasMaxDualRayInfeasibility
public boolean hasMaxDualRayInfeasibility()Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one. A simple and typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞) where y is the current dual iterate and r is the current dual reduced costs. Consider the quadratic program we are solving but with the objective (both quadratic and linear terms) set to zero. This forms a linear program (label this linear program (1)) with no objective. Take the dual of (1) and compute the maximum absolute value of the constraint error for (y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.
optional double max_dual_ray_infeasibility = 4;- Specified by:
hasMaxDualRayInfeasibilityin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the maxDualRayInfeasibility field is set.
-
getMaxDualRayInfeasibility
public double getMaxDualRayInfeasibility()Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one. A simple and typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞) where y is the current dual iterate and r is the current dual reduced costs. Consider the quadratic program we are solving but with the objective (both quadratic and linear terms) set to zero. This forms a linear program (label this linear program (1)) with no objective. Take the dual of (1) and compute the maximum absolute value of the constraint error for (y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.
optional double max_dual_ray_infeasibility = 4;- Specified by:
getMaxDualRayInfeasibilityin interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The maxDualRayInfeasibility.
-
setMaxDualRayInfeasibility
Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one. A simple and typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞) where y is the current dual iterate and r is the current dual reduced costs. Consider the quadratic program we are solving but with the objective (both quadratic and linear terms) set to zero. This forms a linear program (label this linear program (1)) with no objective. Take the dual of (1) and compute the maximum absolute value of the constraint error for (y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.
optional double max_dual_ray_infeasibility = 4;- Parameters:
value- The maxDualRayInfeasibility to set.- Returns:
- This builder for chaining.
-
clearMaxDualRayInfeasibility
Let (y_ray, r_ray) be the algorithm's estimate of the dual and reduced cost extreme ray where (y_ray, r_ray) is a vector (satisfying the dual variable constraints) scaled such that its infinity norm is one. A simple and typical choice of y_ray is (y_ray, r_ray) = (y, r) / max(| y |_∞, | r |_∞) where y is the current dual iterate and r is the current dual reduced costs. Consider the quadratic program we are solving but with the objective (both quadratic and linear terms) set to zero. This forms a linear program (label this linear program (1)) with no objective. Take the dual of (1) and compute the maximum absolute value of the constraint error for (y_ray, r_ray) to obtain the value of max_dual_ray_infeasibility.
optional double max_dual_ray_infeasibility = 4;- Returns:
- This builder for chaining.
-
hasDualRayObjective
public boolean hasDualRayObjective()The objective of the linear program labeled (1) in the previous paragraph.
optional double dual_ray_objective = 5;- Specified by:
hasDualRayObjectivein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the dualRayObjective field is set.
-
getDualRayObjective
public double getDualRayObjective()The objective of the linear program labeled (1) in the previous paragraph.
optional double dual_ray_objective = 5;- Specified by:
getDualRayObjectivein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The dualRayObjective.
-
setDualRayObjective
The objective of the linear program labeled (1) in the previous paragraph.
optional double dual_ray_objective = 5;- Parameters:
value- The dualRayObjective to set.- Returns:
- This builder for chaining.
-
clearDualRayObjective
The objective of the linear program labeled (1) in the previous paragraph.
optional double dual_ray_objective = 5;- Returns:
- This builder for chaining.
-
hasCandidateType
public boolean hasCandidateType()Type of the point used to compute the InfeasibilityInformation.
optional .operations_research.pdlp.PointType candidate_type = 6;- Specified by:
hasCandidateTypein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- Whether the candidateType field is set.
-
getCandidateType
Type of the point used to compute the InfeasibilityInformation.
optional .operations_research.pdlp.PointType candidate_type = 6;- Specified by:
getCandidateTypein interfaceSolveLogOuterClass.InfeasibilityInformationOrBuilder- Returns:
- The candidateType.
-
setCandidateType
public SolveLogOuterClass.InfeasibilityInformation.Builder setCandidateType(SolveLogOuterClass.PointType value) Type of the point used to compute the InfeasibilityInformation.
optional .operations_research.pdlp.PointType candidate_type = 6;- Parameters:
value- The candidateType to set.- Returns:
- This builder for chaining.
-
clearCandidateType
Type of the point used to compute the InfeasibilityInformation.
optional .operations_research.pdlp.PointType candidate_type = 6;- Returns:
- This builder for chaining.
-
setUnknownFields
public final SolveLogOuterClass.InfeasibilityInformation.Builder setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) - Specified by:
setUnknownFieldsin interfacecom.google.protobuf.Message.Builder- Overrides:
setUnknownFieldsin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-
mergeUnknownFields
public final SolveLogOuterClass.InfeasibilityInformation.Builder mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) - Specified by:
mergeUnknownFieldsin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeUnknownFieldsin classcom.google.protobuf.GeneratedMessageV3.Builder<SolveLogOuterClass.InfeasibilityInformation.Builder>
-