public static final class LinearBooleanProblem.Builder extends com.google.protobuf.GeneratedMessage.Builder<LinearBooleanProblem.Builder> implements LinearBooleanProblemOrBuilder
A linear Boolean problem.Protobuf type
operations_research.sat.LinearBooleanProblem| Modifier and Type | Method and Description |
|---|---|
LinearBooleanProblem.Builder |
addAllConstraints(java.lang.Iterable<? extends LinearBooleanConstraint> values)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
addAllVarNames(java.lang.Iterable<java.lang.String> values)
The names of the problem variables.
|
LinearBooleanProblem.Builder |
addConstraints(int index,
LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
addConstraints(int index,
LinearBooleanConstraint value)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
addConstraints(LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
addConstraints(LinearBooleanConstraint value)
The constraints of the problem.
|
LinearBooleanConstraint.Builder |
addConstraintsBuilder()
The constraints of the problem.
|
LinearBooleanConstraint.Builder |
addConstraintsBuilder(int index)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
addVarNames(java.lang.String value)
The names of the problem variables.
|
LinearBooleanProblem.Builder |
addVarNamesBytes(com.google.protobuf.ByteString value)
The names of the problem variables.
|
LinearBooleanProblem |
build() |
LinearBooleanProblem |
buildPartial() |
LinearBooleanProblem.Builder |
clear() |
LinearBooleanProblem.Builder |
clearAssignment()
Stores an assignment of the problem variables.
|
LinearBooleanProblem.Builder |
clearConstraints()
The constraints of the problem.
|
LinearBooleanProblem.Builder |
clearName()
The name of the problem.
|
LinearBooleanProblem.Builder |
clearNumVariables()
The number of variables in the problem.
|
LinearBooleanProblem.Builder |
clearObjective()
The objective of the problem.
|
LinearBooleanProblem.Builder |
clearOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created.
|
LinearBooleanProblem.Builder |
clearVarNames()
The names of the problem variables.
|
BooleanAssignment |
getAssignment()
Stores an assignment of the problem variables.
|
BooleanAssignment.Builder |
getAssignmentBuilder()
Stores an assignment of the problem variables.
|
BooleanAssignmentOrBuilder |
getAssignmentOrBuilder()
Stores an assignment of the problem variables.
|
LinearBooleanConstraint |
getConstraints(int index)
The constraints of the problem.
|
LinearBooleanConstraint.Builder |
getConstraintsBuilder(int index)
The constraints of the problem.
|
java.util.List<LinearBooleanConstraint.Builder> |
getConstraintsBuilderList()
The constraints of the problem.
|
int |
getConstraintsCount()
The constraints of the problem.
|
java.util.List<LinearBooleanConstraint> |
getConstraintsList()
The constraints of the problem.
|
LinearBooleanConstraintOrBuilder |
getConstraintsOrBuilder(int index)
The constraints of the problem.
|
java.util.List<? extends LinearBooleanConstraintOrBuilder> |
getConstraintsOrBuilderList()
The constraints of the problem.
|
LinearBooleanProblem |
getDefaultInstanceForType() |
static com.google.protobuf.Descriptors.Descriptor |
getDescriptor() |
com.google.protobuf.Descriptors.Descriptor |
getDescriptorForType() |
java.lang.String |
getName()
The name of the problem.
|
com.google.protobuf.ByteString |
getNameBytes()
The name of the problem.
|
int |
getNumVariables()
The number of variables in the problem.
|
LinearObjective |
getObjective()
The objective of the problem.
|
LinearObjective.Builder |
getObjectiveBuilder()
The objective of the problem.
|
LinearObjectiveOrBuilder |
getObjectiveOrBuilder()
The objective of the problem.
|
int |
getOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created.
|
java.lang.String |
getVarNames(int index)
The names of the problem variables.
|
com.google.protobuf.ByteString |
getVarNamesBytes(int index)
The names of the problem variables.
|
int |
getVarNamesCount()
The names of the problem variables.
|
com.google.protobuf.ProtocolStringList |
getVarNamesList()
The names of the problem variables.
|
boolean |
hasAssignment()
Stores an assignment of the problem variables.
|
boolean |
hasName()
The name of the problem.
|
boolean |
hasNumVariables()
The number of variables in the problem.
|
boolean |
hasObjective()
The objective of the problem.
|
boolean |
hasOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created.
|
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable |
internalGetFieldAccessorTable() |
boolean |
isInitialized() |
LinearBooleanProblem.Builder |
mergeAssignment(BooleanAssignment value)
Stores an assignment of the problem variables.
|
LinearBooleanProblem.Builder |
mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
LinearBooleanProblem.Builder |
mergeFrom(LinearBooleanProblem other) |
LinearBooleanProblem.Builder |
mergeFrom(com.google.protobuf.Message other) |
LinearBooleanProblem.Builder |
mergeObjective(LinearObjective value)
The objective of the problem.
|
LinearBooleanProblem.Builder |
removeConstraints(int index)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
setAssignment(BooleanAssignment.Builder builderForValue)
Stores an assignment of the problem variables.
|
LinearBooleanProblem.Builder |
setAssignment(BooleanAssignment value)
Stores an assignment of the problem variables.
|
LinearBooleanProblem.Builder |
setConstraints(int index,
LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
setConstraints(int index,
LinearBooleanConstraint value)
The constraints of the problem.
|
LinearBooleanProblem.Builder |
setName(java.lang.String value)
The name of the problem.
|
LinearBooleanProblem.Builder |
setNameBytes(com.google.protobuf.ByteString value)
The name of the problem.
|
LinearBooleanProblem.Builder |
setNumVariables(int value)
The number of variables in the problem.
|
LinearBooleanProblem.Builder |
setObjective(LinearObjective.Builder builderForValue)
The objective of the problem.
|
LinearBooleanProblem.Builder |
setObjective(LinearObjective value)
The objective of the problem.
|
LinearBooleanProblem.Builder |
setOriginalNumVariables(int value)
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra
variables need to be created.
|
LinearBooleanProblem.Builder |
setVarNames(int index,
java.lang.String value)
The names of the problem variables.
|
addRepeatedField, clearField, clearOneof, clone, getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, getUnknownFieldSetBuilder, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, internalGetMutableMapField, internalGetMutableMapFieldReflection, isClean, markClean, mergeUnknownFields, mergeUnknownLengthDelimitedField, mergeUnknownVarintField, newBuilderForField, onBuilt, onChanged, parseUnknownField, setField, setRepeatedField, setUnknownFields, setUnknownFieldSetBuilder, setUnknownFieldsProto3findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringaddAll, addAll, mergeDelimitedFrom, mergeDelimitedFrom, newUninitializedMessageExceptionequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitpublic static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()
internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessage.Builder<LinearBooleanProblem.Builder>public LinearBooleanProblem.Builder clear()
clear in interface com.google.protobuf.Message.Builderclear in interface com.google.protobuf.MessageLite.Builderclear in class com.google.protobuf.GeneratedMessage.Builder<LinearBooleanProblem.Builder>public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
getDescriptorForType in interface com.google.protobuf.Message.BuildergetDescriptorForType in interface com.google.protobuf.MessageOrBuildergetDescriptorForType in class com.google.protobuf.GeneratedMessage.Builder<LinearBooleanProblem.Builder>public LinearBooleanProblem getDefaultInstanceForType()
getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuildergetDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilderpublic LinearBooleanProblem build()
build in interface com.google.protobuf.Message.Builderbuild in interface com.google.protobuf.MessageLite.Builderpublic LinearBooleanProblem buildPartial()
buildPartial in interface com.google.protobuf.Message.BuilderbuildPartial in interface com.google.protobuf.MessageLite.Builderpublic LinearBooleanProblem.Builder mergeFrom(com.google.protobuf.Message other)
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<LinearBooleanProblem.Builder>public LinearBooleanProblem.Builder mergeFrom(LinearBooleanProblem other)
public final boolean isInitialized()
isInitialized in interface com.google.protobuf.MessageLiteOrBuilderisInitialized in class com.google.protobuf.GeneratedMessage.Builder<LinearBooleanProblem.Builder>public LinearBooleanProblem.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in interface com.google.protobuf.MessageLite.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<LinearBooleanProblem.Builder>java.io.IOExceptionpublic boolean hasName()
The name of the problem.
optional string name = 1 [default = ""];hasName in interface LinearBooleanProblemOrBuilderpublic java.lang.String getName()
The name of the problem.
optional string name = 1 [default = ""];getName in interface LinearBooleanProblemOrBuilderpublic com.google.protobuf.ByteString getNameBytes()
The name of the problem.
optional string name = 1 [default = ""];getNameBytes in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setName(java.lang.String value)
The name of the problem.
optional string name = 1 [default = ""];value - The name to set.public LinearBooleanProblem.Builder clearName()
The name of the problem.
optional string name = 1 [default = ""];public LinearBooleanProblem.Builder setNameBytes(com.google.protobuf.ByteString value)
The name of the problem.
optional string name = 1 [default = ""];value - The bytes for name to set.public boolean hasNumVariables()
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;hasNumVariables in interface LinearBooleanProblemOrBuilderpublic int getNumVariables()
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;getNumVariables in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setNumVariables(int value)
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;value - The numVariables to set.public LinearBooleanProblem.Builder clearNumVariables()
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;public java.util.List<LinearBooleanConstraint> getConstraintsList()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;getConstraintsList in interface LinearBooleanProblemOrBuilderpublic int getConstraintsCount()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;getConstraintsCount in interface LinearBooleanProblemOrBuilderpublic LinearBooleanConstraint getConstraints(int index)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;getConstraints in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setConstraints(int index, LinearBooleanConstraint value)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder setConstraints(int index, LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder addConstraints(LinearBooleanConstraint value)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder addConstraints(int index, LinearBooleanConstraint value)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder addConstraints(LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder addConstraints(int index, LinearBooleanConstraint.Builder builderForValue)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder addAllConstraints(java.lang.Iterable<? extends LinearBooleanConstraint> values)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder clearConstraints()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanProblem.Builder removeConstraints(int index)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanConstraint.Builder getConstraintsBuilder(int index)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanConstraintOrBuilder getConstraintsOrBuilder(int index)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;getConstraintsOrBuilder in interface LinearBooleanProblemOrBuilderpublic java.util.List<? extends LinearBooleanConstraintOrBuilder> getConstraintsOrBuilderList()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;getConstraintsOrBuilderList in interface LinearBooleanProblemOrBuilderpublic LinearBooleanConstraint.Builder addConstraintsBuilder()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public LinearBooleanConstraint.Builder addConstraintsBuilder(int index)
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public java.util.List<LinearBooleanConstraint.Builder> getConstraintsBuilderList()
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;public boolean hasObjective()
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;hasObjective in interface LinearBooleanProblemOrBuilderpublic LinearObjective getObjective()
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;getObjective in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setObjective(LinearObjective value)
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;public LinearBooleanProblem.Builder setObjective(LinearObjective.Builder builderForValue)
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;public LinearBooleanProblem.Builder mergeObjective(LinearObjective value)
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;public LinearBooleanProblem.Builder clearObjective()
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;public LinearObjective.Builder getObjectiveBuilder()
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;public LinearObjectiveOrBuilder getObjectiveOrBuilder()
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;getObjectiveOrBuilder in interface LinearBooleanProblemOrBuilderpublic com.google.protobuf.ProtocolStringList getVarNamesList()
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;getVarNamesList in interface LinearBooleanProblemOrBuilderpublic int getVarNamesCount()
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;getVarNamesCount in interface LinearBooleanProblemOrBuilderpublic java.lang.String getVarNames(int index)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;getVarNames in interface LinearBooleanProblemOrBuilderindex - The index of the element to return.public com.google.protobuf.ByteString getVarNamesBytes(int index)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;getVarNamesBytes in interface LinearBooleanProblemOrBuilderindex - The index of the value to return.public LinearBooleanProblem.Builder setVarNames(int index, java.lang.String value)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;index - The index to set the value at.value - The varNames to set.public LinearBooleanProblem.Builder addVarNames(java.lang.String value)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;value - The varNames to add.public LinearBooleanProblem.Builder addAllVarNames(java.lang.Iterable<java.lang.String> values)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;values - The varNames to add.public LinearBooleanProblem.Builder clearVarNames()
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;public LinearBooleanProblem.Builder addVarNamesBytes(com.google.protobuf.ByteString value)
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;value - The bytes of the varNames to add.public boolean hasAssignment()
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;hasAssignment in interface LinearBooleanProblemOrBuilderpublic BooleanAssignment getAssignment()
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;getAssignment in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setAssignment(BooleanAssignment value)
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;public LinearBooleanProblem.Builder setAssignment(BooleanAssignment.Builder builderForValue)
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;public LinearBooleanProblem.Builder mergeAssignment(BooleanAssignment value)
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;public LinearBooleanProblem.Builder clearAssignment()
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;public BooleanAssignment.Builder getAssignmentBuilder()
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;public BooleanAssignmentOrBuilder getAssignmentOrBuilder()
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;getAssignmentOrBuilder in interface LinearBooleanProblemOrBuilderpublic boolean hasOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;hasOriginalNumVariables in interface LinearBooleanProblemOrBuilderpublic int getOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;getOriginalNumVariables in interface LinearBooleanProblemOrBuilderpublic LinearBooleanProblem.Builder setOriginalNumVariables(int value)
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;value - The originalNumVariables to set.public LinearBooleanProblem.Builder clearOriginalNumVariables()
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;Copyright © 2025. All rights reserved.