Java Reference

Java Reference

CpModelProto.Builder

Detailed Description

A constraint programming problem.

Protobuf type

operations_research.sat.CpModelProto

Definition at line 861 of file CpModelProto.java.

Public Member Functions

.lang.Override Builder clear ()
 
.lang.Override com.google.protobuf.Descriptors.Descriptor getDescriptorForType ()
 
.lang.Override com.google.ortools.sat.CpModelProto getDefaultInstanceForType ()
 
.lang.Override com.google.ortools.sat.CpModelProto build ()
 
.lang.Override com.google.ortools.sat.CpModelProto buildPartial ()
 
.lang.Override Builder clone ()
 
.lang.Override Builder setField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
 
.lang.Override Builder clearField (com.google.protobuf.Descriptors.FieldDescriptor field)
 
.lang.Override Builder clearOneof (com.google.protobuf.Descriptors.OneofDescriptor oneof)
 
.lang.Override Builder setRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)
 
.lang.Override Builder addRepeatedField (com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)
 
.lang.Override Builder mergeFrom (com.google.protobuf.Message other)
 
Builder mergeFrom (com.google.ortools.sat.CpModelProto other)
 
.lang.Override final boolean isInitialized ()
 
.lang.Override Builder mergeFrom (com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException
 
java.lang.String getName ()
 
com.google.protobuf.ByteString getNameBytes ()
 
Builder setName (java.lang.String value)
 
Builder clearName ()
 
Builder setNameBytes (com.google.protobuf.ByteString value)
 
java.util.List< com.google.ortools.sat.IntegerVariableProtogetVariablesList ()
 
int getVariablesCount ()
 
com.google.ortools.sat.IntegerVariableProto getVariables (int index)
 
Builder setVariables (int index, com.google.ortools.sat.IntegerVariableProto value)
 
Builder setVariables (int index, com.google.ortools.sat.IntegerVariableProto.Builder builderForValue)
 
Builder addVariables (com.google.ortools.sat.IntegerVariableProto value)
 
Builder addVariables (int index, com.google.ortools.sat.IntegerVariableProto value)
 
Builder addVariables (com.google.ortools.sat.IntegerVariableProto.Builder builderForValue)
 
Builder addVariables (int index, com.google.ortools.sat.IntegerVariableProto.Builder builderForValue)
 
Builder addAllVariables (java.lang.Iterable<? extends com.google.ortools.sat.IntegerVariableProto > values)
 
Builder clearVariables ()
 
Builder removeVariables (int index)
 
com.google.ortools.sat.IntegerVariableProto.Builder getVariablesBuilder (int index)
 
com.google.ortools.sat.IntegerVariableProtoOrBuilder getVariablesOrBuilder (int index)
 
java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuildergetVariablesOrBuilderList ()
 
com.google.ortools.sat.IntegerVariableProto.Builder addVariablesBuilder ()
 
com.google.ortools.sat.IntegerVariableProto.Builder addVariablesBuilder (int index)
 
java.util.List< com.google.ortools.sat.IntegerVariableProto.BuildergetVariablesBuilderList ()
 
java.util.List< com.google.ortools.sat.ConstraintProtogetConstraintsList ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
int getConstraintsCount ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
com.google.ortools.sat.ConstraintProto getConstraints (int index)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder setConstraints (int index, com.google.ortools.sat.ConstraintProto value)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder setConstraints (int index, com.google.ortools.sat.ConstraintProto.Builder builderForValue)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder addConstraints (com.google.ortools.sat.ConstraintProto value)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder addConstraints (int index, com.google.ortools.sat.ConstraintProto value)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder addConstraints (com.google.ortools.sat.ConstraintProto.Builder builderForValue)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder addConstraints (int index, com.google.ortools.sat.ConstraintProto.Builder builderForValue)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder addAllConstraints (java.lang.Iterable<? extends com.google.ortools.sat.ConstraintProto > values)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder clearConstraints ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
Builder removeConstraints (int index)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
com.google.ortools.sat.ConstraintProto.Builder getConstraintsBuilder (int index)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
com.google.ortools.sat.ConstraintProtoOrBuilder getConstraintsOrBuilder (int index)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
java.util.List<? extends com.google.ortools.sat.ConstraintProtoOrBuildergetConstraintsOrBuilderList ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
com.google.ortools.sat.ConstraintProto.Builder addConstraintsBuilder ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
com.google.ortools.sat.ConstraintProto.Builder addConstraintsBuilder (int index)
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
java.util.List< com.google.ortools.sat.ConstraintProto.BuildergetConstraintsBuilderList ()
 repeated .operations_research.sat.ConstraintProto constraints = 3; More...
 
boolean hasObjective ()
 
com.google.ortools.sat.CpObjectiveProto getObjective ()
 
Builder setObjective (com.google.ortools.sat.CpObjectiveProto value)
 
Builder setObjective (com.google.ortools.sat.CpObjectiveProto.Builder builderForValue)
 
Builder mergeObjective (com.google.ortools.sat.CpObjectiveProto value)
 
Builder clearObjective ()
 
com.google.ortools.sat.CpObjectiveProto.Builder getObjectiveBuilder ()
 
com.google.ortools.sat.CpObjectiveProtoOrBuilder getObjectiveOrBuilder ()
 
java.util.List< com.google.ortools.sat.DecisionStrategyProtogetSearchStrategyList ()
 
int getSearchStrategyCount ()
 
com.google.ortools.sat.DecisionStrategyProto getSearchStrategy (int index)
 
Builder setSearchStrategy (int index, com.google.ortools.sat.DecisionStrategyProto value)
 
Builder setSearchStrategy (int index, com.google.ortools.sat.DecisionStrategyProto.Builder builderForValue)
 
Builder addSearchStrategy (com.google.ortools.sat.DecisionStrategyProto value)
 
Builder addSearchStrategy (int index, com.google.ortools.sat.DecisionStrategyProto value)
 
Builder addSearchStrategy (com.google.ortools.sat.DecisionStrategyProto.Builder builderForValue)
 
Builder addSearchStrategy (int index, com.google.ortools.sat.DecisionStrategyProto.Builder builderForValue)
 
Builder addAllSearchStrategy (java.lang.Iterable<? extends com.google.ortools.sat.DecisionStrategyProto > values)
 
Builder clearSearchStrategy ()
 
Builder removeSearchStrategy (int index)
 
com.google.ortools.sat.DecisionStrategyProto.Builder getSearchStrategyBuilder (int index)
 
com.google.ortools.sat.DecisionStrategyProtoOrBuilder getSearchStrategyOrBuilder (int index)
 
java.util.List<? extends com.google.ortools.sat.DecisionStrategyProtoOrBuildergetSearchStrategyOrBuilderList ()
 
com.google.ortools.sat.DecisionStrategyProto.Builder addSearchStrategyBuilder ()
 
com.google.ortools.sat.DecisionStrategyProto.Builder addSearchStrategyBuilder (int index)
 
java.util.List< com.google.ortools.sat.DecisionStrategyProto.BuildergetSearchStrategyBuilderList ()
 
boolean hasSolutionHint ()
 
com.google.ortools.sat.PartialVariableAssignment getSolutionHint ()
 
Builder setSolutionHint (com.google.ortools.sat.PartialVariableAssignment value)
 
Builder setSolutionHint (com.google.ortools.sat.PartialVariableAssignment.Builder builderForValue)
 
Builder mergeSolutionHint (com.google.ortools.sat.PartialVariableAssignment value)
 
Builder clearSolutionHint ()
 
com.google.ortools.sat.PartialVariableAssignment.Builder getSolutionHintBuilder ()
 
com.google.ortools.sat.PartialVariableAssignmentOrBuilder getSolutionHintOrBuilder ()
 
java.util.List< java.lang.Integer > getAssumptionsList ()
 
int getAssumptionsCount ()
 
int getAssumptions (int index)
 
Builder setAssumptions (int index, int value)
 
Builder addAssumptions (int value)
 
Builder addAllAssumptions (java.lang.Iterable<? extends java.lang.Integer > values)
 
Builder clearAssumptions ()
 
.lang.Override final Builder setUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)
 
.lang.Override final Builder mergeUnknownFields (final com.google.protobuf.UnknownFieldSet unknownFields)
 

Static Public Member Functions

static final com.google.protobuf.Descriptors.Descriptor getDescriptor ()
 

Protected Member Functions

.lang.Override com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable ()
 

Member Function Documentation

◆ addAllAssumptions()

Builder addAllAssumptions ( java.lang.Iterable<? extends java.lang.Integer >  values)
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Parameters
valuesThe assumptions to add.
Returns
This builder for chaining.

Definition at line 2809 of file CpModelProto.java.

◆ addAllConstraints()

Builder addAllConstraints ( java.lang.Iterable<? extends com.google.ortools.sat.ConstraintProto values)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1724 of file CpModelProto.java.

◆ addAllSearchStrategy()

Builder addAllSearchStrategy ( java.lang.Iterable<? extends com.google.ortools.sat.DecisionStrategyProto values)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2239 of file CpModelProto.java.

◆ addAllVariables()

Builder addAllVariables ( java.lang.Iterable<? extends com.google.ortools.sat.IntegerVariableProto values)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1452 of file CpModelProto.java.

◆ addAssumptions()

Builder addAssumptions ( int  value)
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Parameters
valueThe assumptions to add.
Returns
This builder for chaining.

Definition at line 2784 of file CpModelProto.java.

◆ addConstraints() [1/4]

Builder addConstraints ( com.google.ortools.sat.ConstraintProto  value)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1663 of file CpModelProto.java.

◆ addConstraints() [2/4]

Builder addConstraints ( com.google.ortools.sat.ConstraintProto.Builder  builderForValue)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1696 of file CpModelProto.java.

◆ addConstraints() [3/4]

Builder addConstraints ( int  index,
com.google.ortools.sat.ConstraintProto  value 
)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1679 of file CpModelProto.java.

◆ addConstraints() [4/4]

Builder addConstraints ( int  index,
com.google.ortools.sat.ConstraintProto.Builder  builderForValue 
)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1710 of file CpModelProto.java.

◆ addConstraintsBuilder() [1/2]

com.google.ortools.sat.ConstraintProto.Builder addConstraintsBuilder ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1793 of file CpModelProto.java.

◆ addConstraintsBuilder() [2/2]

com.google.ortools.sat.ConstraintProto.Builder addConstraintsBuilder ( int  index)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1800 of file CpModelProto.java.

◆ addRepeatedField()

.lang.Override Builder addRepeatedField ( com.google.protobuf.Descriptors.FieldDescriptor  field,
java.lang.Object  value 
)
inline

Definition at line 1034 of file CpModelProto.java.

◆ addSearchStrategy() [1/4]

Builder addSearchStrategy ( com.google.ortools.sat.DecisionStrategyProto  value)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2130 of file CpModelProto.java.

◆ addSearchStrategy() [2/4]

Builder addSearchStrategy ( com.google.ortools.sat.DecisionStrategyProto.Builder  builderForValue)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2187 of file CpModelProto.java.

◆ addSearchStrategy() [3/4]

Builder addSearchStrategy ( int  index,
com.google.ortools.sat.DecisionStrategyProto  value 
)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2158 of file CpModelProto.java.

◆ addSearchStrategy() [4/4]

Builder addSearchStrategy ( int  index,
com.google.ortools.sat.DecisionStrategyProto.Builder  builderForValue 
)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2213 of file CpModelProto.java.

◆ addSearchStrategyBuilder() [1/2]

com.google.ortools.sat.DecisionStrategyProto.Builder addSearchStrategyBuilder ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2380 of file CpModelProto.java.

◆ addSearchStrategyBuilder() [2/2]

com.google.ortools.sat.DecisionStrategyProto.Builder addSearchStrategyBuilder ( int  index)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2399 of file CpModelProto.java.

◆ addVariables() [1/4]

Builder addVariables ( com.google.ortools.sat.IntegerVariableProto  value)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1375 of file CpModelProto.java.

◆ addVariables() [2/4]

Builder addVariables ( com.google.ortools.sat.IntegerVariableProto.Builder  builderForValue)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1416 of file CpModelProto.java.

◆ addVariables() [3/4]

Builder addVariables ( int  index,
com.google.ortools.sat.IntegerVariableProto  value 
)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1395 of file CpModelProto.java.

◆ addVariables() [4/4]

Builder addVariables ( int  index,
com.google.ortools.sat.IntegerVariableProto.Builder  builderForValue 
)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1434 of file CpModelProto.java.

◆ addVariablesBuilder() [1/2]

The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1545 of file CpModelProto.java.

◆ addVariablesBuilder() [2/2]

com.google.ortools.sat.IntegerVariableProto.Builder addVariablesBuilder ( int  index)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1556 of file CpModelProto.java.

◆ build()

.lang.Override com.google.ortools.sat.CpModelProto build ( )
inline

Definition at line 948 of file CpModelProto.java.

◆ buildPartial()

.lang.Override com.google.ortools.sat.CpModelProto buildPartial ( )
inline

Definition at line 957 of file CpModelProto.java.

◆ clear()

.lang.Override Builder clear ( )
inline

Definition at line 897 of file CpModelProto.java.

◆ clearAssumptions()

Builder clearAssumptions ( )
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Returns
This builder for chaining.

Definition at line 2835 of file CpModelProto.java.

◆ clearConstraints()

Builder clearConstraints ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1739 of file CpModelProto.java.

◆ clearField()

.lang.Override Builder clearField ( com.google.protobuf.Descriptors.FieldDescriptor  field)
inline

Definition at line 1018 of file CpModelProto.java.

◆ clearName()

Builder clearName ( )
inline
For debug/logging only. Can be empty.

string name = 1;

Returns
This builder for chaining.

Definition at line 1248 of file CpModelProto.java.

◆ clearObjective()

Builder clearObjective ( )
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Definition at line 1923 of file CpModelProto.java.

◆ clearOneof()

.lang.Override Builder clearOneof ( com.google.protobuf.Descriptors.OneofDescriptor  oneof)
inline

Definition at line 1023 of file CpModelProto.java.

◆ clearSearchStrategy()

Builder clearSearchStrategy ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2266 of file CpModelProto.java.

◆ clearSolutionHint()

Builder clearSolutionHint ( )
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Definition at line 2582 of file CpModelProto.java.

◆ clearVariables()

Builder clearVariables ( )
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1471 of file CpModelProto.java.

◆ clone()

.lang.Override Builder clone ( )
inline

Definition at line 1008 of file CpModelProto.java.

◆ getAssumptions()

int getAssumptions ( int  index)
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Parameters
indexThe index of the element to return.
Returns
The assumptions at the given index.

Implements CpModelProtoOrBuilder.

Definition at line 2735 of file CpModelProto.java.

◆ getAssumptionsCount()

int getAssumptionsCount ( )
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Returns
The count of assumptions.

Implements CpModelProtoOrBuilder.

Definition at line 2713 of file CpModelProto.java.

◆ getAssumptionsList()

java.util.List<java.lang.Integer> getAssumptionsList ( )
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Returns
A list containing the assumptions.

Implements CpModelProtoOrBuilder.

Definition at line 2691 of file CpModelProto.java.

◆ getConstraints()

com.google.ortools.sat.ConstraintProto getConstraints ( int  index)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Implements CpModelProtoOrBuilder.

Definition at line 1622 of file CpModelProto.java.

◆ getConstraintsBuilder()

com.google.ortools.sat.ConstraintProto.Builder getConstraintsBuilder ( int  index)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1765 of file CpModelProto.java.

◆ getConstraintsBuilderList()

java.util.List<com.google.ortools.sat.ConstraintProto.Builder> getConstraintsBuilderList ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1809 of file CpModelProto.java.

◆ getConstraintsCount()

int getConstraintsCount ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Implements CpModelProtoOrBuilder.

Definition at line 1612 of file CpModelProto.java.

◆ getConstraintsList()

java.util.List<com.google.ortools.sat.ConstraintProto> getConstraintsList ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Implements CpModelProtoOrBuilder.

Definition at line 1602 of file CpModelProto.java.

◆ getConstraintsOrBuilder()

com.google.ortools.sat.ConstraintProtoOrBuilder getConstraintsOrBuilder ( int  index)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Implements CpModelProtoOrBuilder.

Definition at line 1772 of file CpModelProto.java.

◆ getConstraintsOrBuilderList()

java.util.List<? extends com.google.ortools.sat.ConstraintProtoOrBuilder> getConstraintsOrBuilderList ( )
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Implements CpModelProtoOrBuilder.

Definition at line 1783 of file CpModelProto.java.

◆ getDefaultInstanceForType()

.lang.Override com.google.ortools.sat.CpModelProto getDefaultInstanceForType ( )
inline

Definition at line 943 of file CpModelProto.java.

◆ getDescriptor()

static final com.google.protobuf.Descriptors.Descriptor getDescriptor ( )
inlinestatic

Definition at line 866 of file CpModelProto.java.

◆ getDescriptorForType()

.lang.Override com.google.protobuf.Descriptors.Descriptor getDescriptorForType ( )
inline

Definition at line 938 of file CpModelProto.java.

◆ getName()

java.lang.String getName ( )
inline
For debug/logging only. Can be empty.

string name = 1;

Returns
The name.

Implements CpModelProtoOrBuilder.

Definition at line 1188 of file CpModelProto.java.

◆ getNameBytes()

com.google.protobuf.ByteString getNameBytes ( )
inline
For debug/logging only. Can be empty.

string name = 1;

Returns
The bytes for name.

Implements CpModelProtoOrBuilder.

Definition at line 1209 of file CpModelProto.java.

◆ getObjective()

com.google.ortools.sat.CpObjectiveProto getObjective ( )
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Returns
The objective.

Implements CpModelProtoOrBuilder.

Definition at line 1849 of file CpModelProto.java.

◆ getObjectiveBuilder()

com.google.ortools.sat.CpObjectiveProto.Builder getObjectiveBuilder ( )
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Definition at line 1941 of file CpModelProto.java.

◆ getObjectiveOrBuilder()

com.google.ortools.sat.CpObjectiveProtoOrBuilder getObjectiveOrBuilder ( )
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Implements CpModelProtoOrBuilder.

Definition at line 1953 of file CpModelProto.java.

◆ getSearchStrategy()

com.google.ortools.sat.DecisionStrategyProto getSearchStrategy ( int  index)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Implements CpModelProtoOrBuilder.

Definition at line 2053 of file CpModelProto.java.

◆ getSearchStrategyBuilder()

com.google.ortools.sat.DecisionStrategyProto.Builder getSearchStrategyBuilder ( int  index)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2316 of file CpModelProto.java.

◆ getSearchStrategyBuilderList()

java.util.List<com.google.ortools.sat.DecisionStrategyProto.Builder> getSearchStrategyBuilderList ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2420 of file CpModelProto.java.

◆ getSearchStrategyCount()

int getSearchStrategyCount ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Implements CpModelProtoOrBuilder.

Definition at line 2031 of file CpModelProto.java.

◆ getSearchStrategyList()

java.util.List<com.google.ortools.sat.DecisionStrategyProto> getSearchStrategyList ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Implements CpModelProtoOrBuilder.

Definition at line 2009 of file CpModelProto.java.

◆ getSearchStrategyOrBuilder()

com.google.ortools.sat.DecisionStrategyProtoOrBuilder getSearchStrategyOrBuilder ( int  index)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Implements CpModelProtoOrBuilder.

Definition at line 2335 of file CpModelProto.java.

◆ getSearchStrategyOrBuilderList()

java.util.List<? extends com.google.ortools.sat.DecisionStrategyProtoOrBuilder> getSearchStrategyOrBuilderList ( )
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Implements CpModelProtoOrBuilder.

Definition at line 2358 of file CpModelProto.java.

◆ getSolutionHint()

Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Returns
The solutionHint.

Implements CpModelProtoOrBuilder.

Definition at line 2476 of file CpModelProto.java.

◆ getSolutionHintBuilder()

Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Definition at line 2608 of file CpModelProto.java.

◆ getSolutionHintOrBuilder()

com.google.ortools.sat.PartialVariableAssignmentOrBuilder getSolutionHintOrBuilder ( )
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Implements CpModelProtoOrBuilder.

Definition at line 2628 of file CpModelProto.java.

◆ getVariables()

com.google.ortools.sat.IntegerVariableProto getVariables ( int  index)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Implements CpModelProtoOrBuilder.

Definition at line 1322 of file CpModelProto.java.

◆ getVariablesBuilder()

com.google.ortools.sat.IntegerVariableProto.Builder getVariablesBuilder ( int  index)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1505 of file CpModelProto.java.

◆ getVariablesBuilderList()

java.util.List<com.google.ortools.sat.IntegerVariableProto.Builder> getVariablesBuilderList ( )
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1569 of file CpModelProto.java.

◆ getVariablesCount()

int getVariablesCount ( )
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Implements CpModelProtoOrBuilder.

Definition at line 1308 of file CpModelProto.java.

◆ getVariablesList()

java.util.List<com.google.ortools.sat.IntegerVariableProto> getVariablesList ( )
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Implements CpModelProtoOrBuilder.

Definition at line 1294 of file CpModelProto.java.

◆ getVariablesOrBuilder()

com.google.ortools.sat.IntegerVariableProtoOrBuilder getVariablesOrBuilder ( int  index)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Implements CpModelProtoOrBuilder.

Definition at line 1516 of file CpModelProto.java.

◆ getVariablesOrBuilderList()

java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuilder> getVariablesOrBuilderList ( )
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Implements CpModelProtoOrBuilder.

Definition at line 1531 of file CpModelProto.java.

◆ hasObjective()

boolean hasObjective ( )
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Returns
Whether the objective field is set.

Implements CpModelProtoOrBuilder.

Definition at line 1838 of file CpModelProto.java.

◆ hasSolutionHint()

boolean hasSolutionHint ( )
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Returns
Whether the solutionHint field is set.

Implements CpModelProtoOrBuilder.

Definition at line 2457 of file CpModelProto.java.

◆ internalGetFieldAccessorTable()

.lang.Override com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable ( )
inlineprotected

Definition at line 872 of file CpModelProto.java.

◆ isInitialized()

.lang.Override final boolean isInitialized ( )
inline

Definition at line 1155 of file CpModelProto.java.

◆ mergeFrom() [1/3]

Builder mergeFrom ( com.google.ortools.sat.CpModelProto  other)
inline

Definition at line 1049 of file CpModelProto.java.

◆ mergeFrom() [2/3]

.lang.Override Builder mergeFrom ( com.google.protobuf.CodedInputStream  input,
com.google.protobuf.ExtensionRegistryLite  extensionRegistry 
) throws java.io.IOException
inline

Definition at line 1160 of file CpModelProto.java.

◆ mergeFrom() [3/3]

.lang.Override Builder mergeFrom ( com.google.protobuf.Message  other)
inline

Definition at line 1040 of file CpModelProto.java.

◆ mergeObjective()

Builder mergeObjective ( com.google.ortools.sat.CpObjectiveProto  value)
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Definition at line 1901 of file CpModelProto.java.

◆ mergeSolutionHint()

Builder mergeSolutionHint ( com.google.ortools.sat.PartialVariableAssignment  value)
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Definition at line 2552 of file CpModelProto.java.

◆ mergeUnknownFields()

.lang.Override final Builder mergeUnknownFields ( final com.google.protobuf.UnknownFieldSet  unknownFields)
inline

Definition at line 2848 of file CpModelProto.java.

◆ removeConstraints()

Builder removeConstraints ( int  index)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1752 of file CpModelProto.java.

◆ removeSearchStrategy()

Builder removeSearchStrategy ( int  index)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2291 of file CpModelProto.java.

◆ removeVariables()

Builder removeVariables ( int  index)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1488 of file CpModelProto.java.

◆ setAssumptions()

Builder setAssumptions ( int  index,
int  value 
)
inline
A list of literals. The model will be solved assuming all these literals
are true. Compared to just fixing the domain of these literals, using this
mechanism is slower but allows in case the model is INFEASIBLE to get a
potentially small subset of them that can be used to explain the
infeasibility.
Think (IIS), except when you are only concerned by the provided
assumptions. This is powerful as it allows to group a set of logicially
related constraint under only one enforcement literal which can potentially
give you a good and interpretable explanation for infeasiblity.
Such infeasibility explanation will be available in the
sufficient_assumptions_for_infeasibility response field.

repeated int32 assumptions = 7;

Parameters
indexThe index to set the value at.
valueThe assumptions to set.
Returns
This builder for chaining.

Definition at line 2758 of file CpModelProto.java.

◆ setConstraints() [1/2]

Builder setConstraints ( int  index,
com.google.ortools.sat.ConstraintProto  value 
)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1632 of file CpModelProto.java.

◆ setConstraints() [2/2]

Builder setConstraints ( int  index,
com.google.ortools.sat.ConstraintProto.Builder  builderForValue 
)
inline

repeated .operations_research.sat.ConstraintProto constraints = 3;

Definition at line 1649 of file CpModelProto.java.

◆ setField()

.lang.Override Builder setField ( com.google.protobuf.Descriptors.FieldDescriptor  field,
java.lang.Object  value 
)
inline

Definition at line 1012 of file CpModelProto.java.

◆ setName()

Builder setName ( java.lang.String  value)
inline
For debug/logging only. Can be empty.

string name = 1;

Parameters
valueThe name to set.
Returns
This builder for chaining.

Definition at line 1230 of file CpModelProto.java.

◆ setNameBytes()

Builder setNameBytes ( com.google.protobuf.ByteString  value)
inline
For debug/logging only. Can be empty.

string name = 1;

Parameters
valueThe bytes for name to set.
Returns
This builder for chaining.

Definition at line 1263 of file CpModelProto.java.

◆ setObjective() [1/2]

Builder setObjective ( com.google.ortools.sat.CpObjectiveProto  value)
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Definition at line 1863 of file CpModelProto.java.

◆ setObjective() [2/2]

Builder setObjective ( com.google.ortools.sat.CpObjectiveProto.Builder  builderForValue)
inline
The objective to minimize. Can be empty for pure decision problems.

.operations_research.sat.CpObjectiveProto objective = 4;

Definition at line 1883 of file CpModelProto.java.

◆ setRepeatedField()

.lang.Override Builder setRepeatedField ( com.google.protobuf.Descriptors.FieldDescriptor  field,
int  index,
java.lang.Object  value 
)
inline

Definition at line 1028 of file CpModelProto.java.

◆ setSearchStrategy() [1/2]

Builder setSearchStrategy ( int  index,
com.google.ortools.sat.DecisionStrategyProto  value 
)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2075 of file CpModelProto.java.

◆ setSearchStrategy() [2/2]

Builder setSearchStrategy ( int  index,
com.google.ortools.sat.DecisionStrategyProto.Builder  builderForValue 
)
inline
Defines the strategy that the solver should follow when the
search_branching parameter is set to FIXED_SEARCH. Note that this strategy
is also used as a heuristic when we are not in fixed search.
Advanced Usage: if not all variables appears and the parameter
"instantiate_all_variables" is set to false, then the solver will not try
to instantiate the variables that do not appear. Thus, at the end of the
search, not all variables may be fixed and this is why we have the
solution_lower_bounds and solution_upper_bounds fields in the
CpSolverResponse.

repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;

Definition at line 2104 of file CpModelProto.java.

◆ setSolutionHint() [1/2]

Builder setSolutionHint ( com.google.ortools.sat.PartialVariableAssignment  value)
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Definition at line 2498 of file CpModelProto.java.

◆ setSolutionHint() [2/2]

Builder setSolutionHint ( com.google.ortools.sat.PartialVariableAssignment.Builder  builderForValue)
inline
Solution hint.
If a feasible or almost-feasible solution to the problem is already known,
it may be helpful to pass it to the solver so that it can be used. The
solver will try to use this information to create its initial feasible
solution.
Note that it may not always be faster to give a hint like this to the
solver. There is also no guarantee that the solver will use this hint or
try to return a solution "close" to this assignment in case of multiple
optimal solutions.

.operations_research.sat.PartialVariableAssignment solution_hint = 6;

Definition at line 2526 of file CpModelProto.java.

◆ setUnknownFields()

.lang.Override final Builder setUnknownFields ( final com.google.protobuf.UnknownFieldSet  unknownFields)
inline

Definition at line 2842 of file CpModelProto.java.

◆ setVariables() [1/2]

Builder setVariables ( int  index,
com.google.ortools.sat.IntegerVariableProto  value 
)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1336 of file CpModelProto.java.

◆ setVariables() [2/2]

Builder setVariables ( int  index,
com.google.ortools.sat.IntegerVariableProto.Builder  builderForValue 
)
inline
The associated Protos should be referred by their index in these fields.

repeated .operations_research.sat.IntegerVariableProto variables = 2;

Definition at line 1357 of file CpModelProto.java.


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