Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
|
Static Public Member Functions | |
static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
com.google.protobuf.GeneratedMessageV3.FieldAccessorTable | internalGetFieldAccessorTable () |
A linear Boolean problem.
Protobuf type operations_research.sat.LinearBooleanProblem
Definition at line 642 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addAllConstraints | ( | java.lang.Iterable<? extends com.google.ortools.sat.LinearBooleanConstraint > | values | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1314 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1732 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraints | ( | com.google.ortools.sat.LinearBooleanConstraint | value | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1237 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraints | ( | com.google.ortools.sat.LinearBooleanConstraint.Builder | builderForValue | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1278 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraints | ( | int | index, |
com.google.ortools.sat.LinearBooleanConstraint | value ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1257 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraints | ( | int | index, |
com.google.ortools.sat.LinearBooleanConstraint.Builder | builderForValue ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1296 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanConstraint.Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraintsBuilder | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1407 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanConstraint.Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addConstraintsBuilder | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1418 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.addRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
java.lang.Object | value ) |
Definition at line 808 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1712 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1769 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.build | ( | ) |
Definition at line 718 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.buildPartial | ( | ) |
Definition at line 727 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clear | ( | ) |
Definition at line 678 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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;
Definition at line 1884 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearConstraints | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1333 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field | ) |
Definition at line 792 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearName | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Definition at line 1049 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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;
Definition at line 1130 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearObjective | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Definition at line 1554 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearOneof | ( | com.google.protobuf.Descriptors.OneofDescriptor | oneof | ) |
Definition at line 797 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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;
Definition at line 2006 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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;
Definition at line 1751 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clone | ( | ) |
Definition at line 782 of file LinearBooleanProblem.java.
com.google.ortools.sat.BooleanAssignment com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1803 of file LinearBooleanProblem.java.
com.google.ortools.sat.BooleanAssignment.Builder com.google.ortools.sat.LinearBooleanProblem.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;
Definition at line 1902 of file LinearBooleanProblem.java.
com.google.ortools.sat.BooleanAssignmentOrBuilder com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1915 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanConstraint com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraints | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1184 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanConstraint.Builder com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsBuilder | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1367 of file LinearBooleanProblem.java.
java.util.List< com.google.ortools.sat.LinearBooleanConstraint.Builder > com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsBuilderList | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1431 of file LinearBooleanProblem.java.
int com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsCount | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1170 of file LinearBooleanProblem.java.
java.util.List< com.google.ortools.sat.LinearBooleanConstraint > com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsList | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1156 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanConstraintOrBuilder com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsOrBuilder | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1378 of file LinearBooleanProblem.java.
java.util.List<? extends com.google.ortools.sat.LinearBooleanConstraintOrBuilder > com.google.ortools.sat.LinearBooleanProblem.Builder.getConstraintsOrBuilderList | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1393 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.getDefaultInstanceForType | ( | ) |
Definition at line 713 of file LinearBooleanProblem.java.
|
static |
Definition at line 647 of file LinearBooleanProblem.java.
com.google.protobuf.Descriptors.Descriptor com.google.ortools.sat.LinearBooleanProblem.Builder.getDescriptorForType | ( | ) |
Definition at line 708 of file LinearBooleanProblem.java.
java.lang.String com.google.ortools.sat.LinearBooleanProblem.Builder.getName | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 989 of file LinearBooleanProblem.java.
com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblem.Builder.getNameBytes | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1012 of file LinearBooleanProblem.java.
int com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1099 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearObjective com.google.ortools.sat.LinearBooleanProblem.Builder.getObjective | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1473 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearObjective.Builder com.google.ortools.sat.LinearBooleanProblem.Builder.getObjectiveBuilder | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Definition at line 1572 of file LinearBooleanProblem.java.
com.google.ortools.sat.LinearObjectiveOrBuilder com.google.ortools.sat.LinearBooleanProblem.Builder.getObjectiveOrBuilder | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1585 of file LinearBooleanProblem.java.
int com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1973 of file LinearBooleanProblem.java.
java.lang.String com.google.ortools.sat.LinearBooleanProblem.Builder.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;
index | The index of the element to return. |
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1662 of file LinearBooleanProblem.java.
com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblem.Builder.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;
index | The index of the value to return. |
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1677 of file LinearBooleanProblem.java.
int com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1648 of file LinearBooleanProblem.java.
com.google.protobuf.ProtocolStringList com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1634 of file LinearBooleanProblem.java.
boolean com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1791 of file LinearBooleanProblem.java.
boolean com.google.ortools.sat.LinearBooleanProblem.Builder.hasName | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 978 of file LinearBooleanProblem.java.
boolean com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1085 of file LinearBooleanProblem.java.
boolean com.google.ortools.sat.LinearBooleanProblem.Builder.hasObjective | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1461 of file LinearBooleanProblem.java.
boolean com.google.ortools.sat.LinearBooleanProblem.Builder.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;
Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.
Definition at line 1958 of file LinearBooleanProblem.java.
|
protected |
Definition at line 653 of file LinearBooleanProblem.java.
final boolean com.google.ortools.sat.LinearBooleanProblem.Builder.isInitialized | ( | ) |
Definition at line 884 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeAssignment | ( | com.google.ortools.sat.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;
Definition at line 1858 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeFrom | ( | com.google.ortools.sat.LinearBooleanProblem | other | ) |
Definition at line 823 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeFrom | ( | com.google.protobuf.CodedInputStream | input, |
com.google.protobuf.ExtensionRegistryLite | extensionRegistry ) throws java.io.IOException |
Definition at line 889 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeFrom | ( | com.google.protobuf.Message | other | ) |
Definition at line 814 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeObjective | ( | com.google.ortools.sat.LinearObjective | value | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Definition at line 1528 of file LinearBooleanProblem.java.
final Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 2019 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.removeConstraints | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1350 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setAssignment | ( | com.google.ortools.sat.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;
Definition at line 1818 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setAssignment | ( | com.google.ortools.sat.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;
Definition at line 1839 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setConstraints | ( | int | index, |
com.google.ortools.sat.LinearBooleanConstraint | value ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1198 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setConstraints | ( | int | index, |
com.google.ortools.sat.LinearBooleanConstraint.Builder | builderForValue ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Definition at line 1219 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
java.lang.Object | value ) |
Definition at line 786 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setName | ( | java.lang.String | value | ) |
The name of the problem.
optional string name = 1 [default = ""];
value | The name to set. |
Definition at line 1033 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1064 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1113 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setObjective | ( | com.google.ortools.sat.LinearObjective | value | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Definition at line 1488 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setObjective | ( | com.google.ortools.sat.LinearObjective.Builder | builderForValue | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Definition at line 1509 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1988 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setRepeatedField | ( | com.google.protobuf.Descriptors.FieldDescriptor | field, |
int | index, | ||
java.lang.Object | value ) |
Definition at line 802 of file LinearBooleanProblem.java.
final Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setUnknownFields | ( | final com.google.protobuf.UnknownFieldSet | unknownFields | ) |
Definition at line 2013 of file LinearBooleanProblem.java.
Builder com.google.ortools.sat.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. |
Definition at line 1692 of file LinearBooleanProblem.java.