Detailed Description

A linear Boolean problem.

Protobuf type operations_research.sat.LinearBooleanProblem

Definition at line 646 of file LinearBooleanProblem.java.

Inheritance diagram for com.google.ortools.sat.LinearBooleanProblem.Builder:

Public Member Functions
Builder	clear ()
com.google.protobuf.Descriptors.Descriptor	getDescriptorForType ()
com.google.ortools.sat.LinearBooleanProblem	getDefaultInstanceForType ()
com.google.ortools.sat.LinearBooleanProblem	build ()
com.google.ortools.sat.LinearBooleanProblem	buildPartial ()
Builder	mergeFrom (com.google.protobuf.Message other)
Builder	mergeFrom (com.google.ortools.sat.LinearBooleanProblem other)
final boolean	isInitialized ()
Builder	mergeFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
boolean	hasName ()
java.lang.String	getName ()
com.google.protobuf.ByteString	getNameBytes ()
Builder	setName (java.lang.String value)
Builder	clearName ()
Builder	setNameBytes (com.google.protobuf.ByteString value)
boolean	hasNumVariables ()
int	getNumVariables ()
Builder	setNumVariables (int value)
Builder	clearNumVariables ()
java.util.List< com.google.ortools.sat.LinearBooleanConstraint >	getConstraintsList ()
int	getConstraintsCount ()
com.google.ortools.sat.LinearBooleanConstraint	getConstraints (int index)
Builder	setConstraints (int index, com.google.ortools.sat.LinearBooleanConstraint value)
Builder	setConstraints (int index, com.google.ortools.sat.LinearBooleanConstraint.Builder builderForValue)
Builder	addConstraints (com.google.ortools.sat.LinearBooleanConstraint value)
Builder	addConstraints (int index, com.google.ortools.sat.LinearBooleanConstraint value)
Builder	addConstraints (com.google.ortools.sat.LinearBooleanConstraint.Builder builderForValue)
Builder	addConstraints (int index, com.google.ortools.sat.LinearBooleanConstraint.Builder builderForValue)
Builder	addAllConstraints (java.lang.Iterable<? extends com.google.ortools.sat.LinearBooleanConstraint > values)
Builder	clearConstraints ()
Builder	removeConstraints (int index)
com.google.ortools.sat.LinearBooleanConstraint.Builder	getConstraintsBuilder (int index)
com.google.ortools.sat.LinearBooleanConstraintOrBuilder	getConstraintsOrBuilder (int index)
java.util.List<? extends com.google.ortools.sat.LinearBooleanConstraintOrBuilder >	getConstraintsOrBuilderList ()
com.google.ortools.sat.LinearBooleanConstraint.Builder	addConstraintsBuilder ()
com.google.ortools.sat.LinearBooleanConstraint.Builder	addConstraintsBuilder (int index)
java.util.List< com.google.ortools.sat.LinearBooleanConstraint.Builder >	getConstraintsBuilderList ()
boolean	hasObjective ()
com.google.ortools.sat.LinearObjective	getObjective ()
Builder	setObjective (com.google.ortools.sat.LinearObjective value)
Builder	setObjective (com.google.ortools.sat.LinearObjective.Builder builderForValue)
Builder	mergeObjective (com.google.ortools.sat.LinearObjective value)
Builder	clearObjective ()
com.google.ortools.sat.LinearObjective.Builder	getObjectiveBuilder ()
com.google.ortools.sat.LinearObjectiveOrBuilder	getObjectiveOrBuilder ()
com.google.protobuf.ProtocolStringList	getVarNamesList ()
int	getVarNamesCount ()
java.lang.String	getVarNames (int index)
com.google.protobuf.ByteString	getVarNamesBytes (int index)
Builder	setVarNames (int index, java.lang.String value)
Builder	addVarNames (java.lang.String value)
Builder	addAllVarNames (java.lang.Iterable< java.lang.String > values)
Builder	clearVarNames ()
Builder	addVarNamesBytes (com.google.protobuf.ByteString value)
boolean	hasAssignment ()
com.google.ortools.sat.BooleanAssignment	getAssignment ()
Builder	setAssignment (com.google.ortools.sat.BooleanAssignment value)
Builder	setAssignment (com.google.ortools.sat.BooleanAssignment.Builder builderForValue)
Builder	mergeAssignment (com.google.ortools.sat.BooleanAssignment value)
Builder	clearAssignment ()
com.google.ortools.sat.BooleanAssignment.Builder	getAssignmentBuilder ()
com.google.ortools.sat.BooleanAssignmentOrBuilder	getAssignmentOrBuilder ()
boolean	hasOriginalNumVariables ()
int	getOriginalNumVariables ()
Builder	setOriginalNumVariables (int value)
Builder	clearOriginalNumVariables ()

Static Public Member Functions
static final com.google.protobuf.Descriptors.Descriptor	getDescriptor ()

Protected Member Functions
com.google.protobuf.GeneratedMessage.FieldAccessorTable	internalGetFieldAccessorTable ()

Member Function Documentation

◆ addAllConstraints()

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 1286 of file LinearBooleanProblem.java.

◆ addAllVarNames()

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;

Parameters

values The varNames to add.

Returns: This builder for chaining.

Definition at line 1704 of file LinearBooleanProblem.java.

◆ addConstraints() [1/4]

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 1209 of file LinearBooleanProblem.java.

◆ addConstraints() [2/4]

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 1250 of file LinearBooleanProblem.java.

◆ addConstraints() [3/4]

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 1229 of file LinearBooleanProblem.java.

◆ addConstraints() [4/4]

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 1268 of file LinearBooleanProblem.java.

◆ addConstraintsBuilder() [1/2]

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 1379 of file LinearBooleanProblem.java.

◆ addConstraintsBuilder() [2/2]

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 1390 of file LinearBooleanProblem.java.

◆ addVarNames()

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;

Parameters

value The varNames to add.

Returns: This builder for chaining.

Definition at line 1684 of file LinearBooleanProblem.java.

◆ addVarNamesBytes()

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;

Parameters

value The bytes of the varNames to add.

Returns: This builder for chaining.

Definition at line 1741 of file LinearBooleanProblem.java.

◆ build()

com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.build ( )

Definition at line 722 of file LinearBooleanProblem.java.

◆ buildPartial()

com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.buildPartial ( )

Definition at line 731 of file LinearBooleanProblem.java.

◆ clear()

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clear ( )

Definition at line 682 of file LinearBooleanProblem.java.

◆ clearAssignment()

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 1856 of file LinearBooleanProblem.java.

◆ clearConstraints()

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearConstraints ( )

The constraints of the problem.

repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;

Definition at line 1305 of file LinearBooleanProblem.java.

◆ clearName()

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.clearName ( )

The name of the problem.

optional string name = 1 [default = ""];

Returns: This builder for chaining.

Definition at line 1021 of file LinearBooleanProblem.java.

◆ clearNumVariables()

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;

Returns: This builder for chaining.

Definition at line 1102 of file LinearBooleanProblem.java.

◆ clearObjective()

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 1526 of file LinearBooleanProblem.java.

◆ clearOriginalNumVariables()

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;

Returns: This builder for chaining.

Definition at line 1978 of file LinearBooleanProblem.java.

◆ clearVarNames()

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;

Returns: This builder for chaining.

Definition at line 1723 of file LinearBooleanProblem.java.

◆ getAssignment()

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;

Returns: The assignment.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1775 of file LinearBooleanProblem.java.

◆ getAssignmentBuilder()

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 1874 of file LinearBooleanProblem.java.

◆ getAssignmentOrBuilder()

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 1887 of file LinearBooleanProblem.java.

◆ getConstraints()

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 1156 of file LinearBooleanProblem.java.

◆ getConstraintsBuilder()

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 1339 of file LinearBooleanProblem.java.

◆ getConstraintsBuilderList()

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 1403 of file LinearBooleanProblem.java.

◆ getConstraintsCount()

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 1142 of file LinearBooleanProblem.java.

◆ getConstraintsList()

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 1128 of file LinearBooleanProblem.java.

◆ getConstraintsOrBuilder()

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 1350 of file LinearBooleanProblem.java.

◆ getConstraintsOrBuilderList()

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 1365 of file LinearBooleanProblem.java.

◆ getDefaultInstanceForType()

com.google.ortools.sat.LinearBooleanProblem com.google.ortools.sat.LinearBooleanProblem.Builder.getDefaultInstanceForType ( )

Definition at line 717 of file LinearBooleanProblem.java.

◆ getDescriptor()

final com.google.protobuf.Descriptors.Descriptor com.google.ortools.sat.LinearBooleanProblem.Builder.getDescriptor ( )

static

Definition at line 651 of file LinearBooleanProblem.java.

◆ getDescriptorForType()

com.google.protobuf.Descriptors.Descriptor com.google.ortools.sat.LinearBooleanProblem.Builder.getDescriptorForType ( )

Definition at line 712 of file LinearBooleanProblem.java.

◆ getName()

java.lang.String com.google.ortools.sat.LinearBooleanProblem.Builder.getName ( )

The name of the problem.

optional string name = 1 [default = ""];

Returns: The name.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 961 of file LinearBooleanProblem.java.

◆ getNameBytes()

com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblem.Builder.getNameBytes ( )

The name of the problem.

optional string name = 1 [default = ""];

Returns: The bytes for name.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 984 of file LinearBooleanProblem.java.

◆ getNumVariables()

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;

Returns: The numVariables.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1071 of file LinearBooleanProblem.java.

◆ getObjective()

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;

Returns: The objective.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1445 of file LinearBooleanProblem.java.

◆ getObjectiveBuilder()

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 1544 of file LinearBooleanProblem.java.

◆ getObjectiveOrBuilder()

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 1557 of file LinearBooleanProblem.java.

◆ getOriginalNumVariables()

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;

Returns: The originalNumVariables.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1945 of file LinearBooleanProblem.java.

◆ getVarNames()

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;

Parameters

index The index of the element to return.

Returns: The varNames at the given index.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1634 of file LinearBooleanProblem.java.

◆ getVarNamesBytes()

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;

Parameters

index The index of the value to return.

Returns: The bytes of the varNames at the given index.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1649 of file LinearBooleanProblem.java.

◆ getVarNamesCount()

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;

Returns: The count of varNames.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1620 of file LinearBooleanProblem.java.

◆ getVarNamesList()

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;

Returns: A list containing the varNames.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1606 of file LinearBooleanProblem.java.

◆ hasAssignment()

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;

Returns: Whether the assignment field is set.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1763 of file LinearBooleanProblem.java.

◆ hasName()

boolean com.google.ortools.sat.LinearBooleanProblem.Builder.hasName ( )

The name of the problem.

optional string name = 1 [default = ""];

Returns: Whether the name field is set.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 950 of file LinearBooleanProblem.java.

◆ hasNumVariables()

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;

Returns: Whether the numVariables field is set.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1057 of file LinearBooleanProblem.java.

◆ hasObjective()

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;

Returns: Whether the objective field is set.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1433 of file LinearBooleanProblem.java.

◆ hasOriginalNumVariables()

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;

Returns: Whether the originalNumVariables field is set.

Implements com.google.ortools.sat.LinearBooleanProblemOrBuilder.

Definition at line 1930 of file LinearBooleanProblem.java.

◆ internalGetFieldAccessorTable()

com.google.protobuf.GeneratedMessage.FieldAccessorTable com.google.ortools.sat.LinearBooleanProblem.Builder.internalGetFieldAccessorTable ( )

protected

Definition at line 657 of file LinearBooleanProblem.java.

◆ isInitialized()

final boolean com.google.ortools.sat.LinearBooleanProblem.Builder.isInitialized ( )

Definition at line 856 of file LinearBooleanProblem.java.

◆ mergeAssignment()

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 1830 of file LinearBooleanProblem.java.

◆ mergeFrom() [1/3]

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeFrom ( com.google.ortools.sat.LinearBooleanProblem other )

Definition at line 795 of file LinearBooleanProblem.java.

◆ mergeFrom() [2/3]

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 861 of file LinearBooleanProblem.java.

◆ mergeFrom() [3/3]

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.mergeFrom ( com.google.protobuf.Message other )

Definition at line 786 of file LinearBooleanProblem.java.

◆ mergeObjective()

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 1500 of file LinearBooleanProblem.java.

◆ removeConstraints()

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 1322 of file LinearBooleanProblem.java.

◆ setAssignment() [1/2]

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 1790 of file LinearBooleanProblem.java.

◆ setAssignment() [2/2]

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 1811 of file LinearBooleanProblem.java.

◆ setConstraints() [1/2]

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 1170 of file LinearBooleanProblem.java.

◆ setConstraints() [2/2]

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 1191 of file LinearBooleanProblem.java.

◆ setName()

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setName ( java.lang.String value )

The name of the problem.

optional string name = 1 [default = ""];

Parameters

value The name to set.

Returns: This builder for chaining.

Definition at line 1005 of file LinearBooleanProblem.java.

◆ setNameBytes()

Builder com.google.ortools.sat.LinearBooleanProblem.Builder.setNameBytes ( com.google.protobuf.ByteString value )

The name of the problem.

optional string name = 1 [default = ""];

Parameters

value The bytes for name to set.

Returns: This builder for chaining.

Definition at line 1036 of file LinearBooleanProblem.java.

◆ setNumVariables()

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;

Parameters

value The numVariables to set.

Returns: This builder for chaining.

Definition at line 1085 of file LinearBooleanProblem.java.

◆ setObjective() [1/2]

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 1460 of file LinearBooleanProblem.java.

◆ setObjective() [2/2]

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 1481 of file LinearBooleanProblem.java.

◆ setOriginalNumVariables()

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;

Parameters

value The originalNumVariables to set.

Returns: This builder for chaining.

Definition at line 1960 of file LinearBooleanProblem.java.

◆ setVarNames()

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;

Parameters

index	The index to set the value at.
value	The varNames to set.

Returns: This builder for chaining.

Definition at line 1664 of file LinearBooleanProblem.java.

The documentation for this class was generated from the following file:

build/java/ortools-java/src/main/java/com/google/ortools/sat/LinearBooleanProblem.java

Detailed Description

Public Member Functions

Static Public Member Functions

Protected Member Functions

Member Function Documentation

◆ addAllConstraints()

◆ addAllVarNames()

◆ addConstraints() [1/4]

◆ addConstraints() [2/4]

◆ addConstraints() [3/4]

◆ addConstraints() [4/4]

◆ addConstraintsBuilder() [1/2]

◆ addConstraintsBuilder() [2/2]

◆ addVarNames()

◆ addVarNamesBytes()

◆ build()

◆ buildPartial()

◆ clear()

◆ clearAssignment()

◆ clearConstraints()

◆ clearName()

◆ clearNumVariables()

◆ clearObjective()

◆ clearOriginalNumVariables()

◆ clearVarNames()

◆ getAssignment()

◆ getAssignmentBuilder()

◆ getAssignmentOrBuilder()

◆ getConstraints()

◆ getConstraintsBuilder()

◆ getConstraintsBuilderList()

◆ getConstraintsCount()

◆ getConstraintsList()

◆ getConstraintsOrBuilder()

◆ getConstraintsOrBuilderList()

◆ getDefaultInstanceForType()

◆ getDescriptor()

◆ getDescriptorForType()

◆ getName()

◆ getNameBytes()

◆ getNumVariables()

◆ getObjective()

◆ getObjectiveBuilder()

◆ getObjectiveOrBuilder()

◆ getOriginalNumVariables()

◆ getVarNames()

◆ getVarNamesBytes()

◆ getVarNamesCount()

◆ getVarNamesList()

◆ hasAssignment()

◆ hasName()

◆ hasNumVariables()

◆ hasObjective()

◆ hasOriginalNumVariables()

◆ internalGetFieldAccessorTable()

◆ isInitialized()

◆ mergeAssignment()

◆ mergeFrom() [1/3]

◆ mergeFrom() [2/3]

◆ mergeFrom() [3/3]

◆ mergeObjective()

◆ removeConstraints()

◆ setAssignment() [1/2]

◆ setAssignment() [2/2]

◆ setConstraints() [1/2]

◆ setConstraints() [2/2]

◆ setName()

◆ setNameBytes()

◆ setNumVariables()

◆ setObjective() [1/2]

◆ setObjective() [2/2]

◆ setOriginalNumVariables()

◆ setVarNames()