Java Reference
Java Reference
Detailed Description
Definition at line 6 of file MPConstraintProtoOrBuilder.java.
Public Member Functions | |
| java.util.List< java.lang.Integer > | getVarIndexList () |
| int | getVarIndexCount () |
| int | getVarIndex (int index) |
| java.util.List< java.lang.Double > | getCoefficientList () |
| int | getCoefficientCount () |
| double | getCoefficient (int index) |
| boolean | hasLowerBound () |
| double | getLowerBound () |
| boolean | hasUpperBound () |
optional double upper_bound = 3 [default = inf]; More... | |
| double | getUpperBound () |
optional double upper_bound = 3 [default = inf]; More... | |
| boolean | hasName () |
| java.lang.String | getName () |
| com.google.protobuf.ByteString | getNameBytes () |
| boolean | hasIsLazy () |
| boolean | getIsLazy () |
Member Function Documentation
◆ getCoefficient()
| double getCoefficient | ( | int | index | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
- Parameters
-
index The index of the element to return.
- Returns
- The coefficient at the given index.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getCoefficientCount()
| int getCoefficientCount | ( | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
- Returns
- The count of coefficient.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getCoefficientList()
| java.util.List<java.lang.Double> getCoefficientList | ( | ) |
Must be finite.
repeated double coefficient = 7 [packed = true];
- Returns
- A list containing the coefficient.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getIsLazy()
| boolean getIsLazy | ( | ) |
[Advanced usage: do not use this if you don't know what you're doing.] A lazy constraint is handled differently by the core solving engine, but it does not change the result. It may or may not impact the performance. For more info see: http://tinyurl.com/lazy-constraints.
optional bool is_lazy = 5 [default = false];
- Returns
- The isLazy.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getLowerBound()
| double getLowerBound | ( | ) |
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
- Returns
- The lowerBound.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getName()
| java.lang.String getName | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
- Returns
- The name.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getNameBytes()
| com.google.protobuf.ByteString getNameBytes | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
- Returns
- The bytes for name.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getUpperBound()
| double getUpperBound | ( | ) |
optional double upper_bound = 3 [default = inf];
- Returns
- The upperBound.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getVarIndex()
| int getVarIndex | ( | int | index | ) |
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
- Parameters
-
index The index of the element to return.
- Returns
- The varIndex at the given index.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getVarIndexCount()
| int getVarIndexCount | ( | ) |
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
- Returns
- The count of varIndex.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ getVarIndexList()
| java.util.List<java.lang.Integer> getVarIndexList | ( | ) |
var_index[i] is the variable index (w.r.t. to "variable" field of MPModelProto) of the i-th linear term involved in this constraint, and coefficient[i] is its coefficient. Only the terms with non-zero coefficients need to appear. var_index may not contain duplicates.
repeated int32 var_index = 6 [packed = true];
- Returns
- A list containing the varIndex.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ hasIsLazy()
| boolean hasIsLazy | ( | ) |
[Advanced usage: do not use this if you don't know what you're doing.] A lazy constraint is handled differently by the core solving engine, but it does not change the result. It may or may not impact the performance. For more info see: http://tinyurl.com/lazy-constraints.
optional bool is_lazy = 5 [default = false];
- Returns
- Whether the isLazy field is set.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ hasLowerBound()
| boolean hasLowerBound | ( | ) |
lower_bound must be <= upper_bound.
optional double lower_bound = 2 [default = -inf];
- Returns
- Whether the lowerBound field is set.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ hasName()
| boolean hasName | ( | ) |
The name of the constraint.
optional string name = 4 [default = ""];
- Returns
- Whether the name field is set.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
◆ hasUpperBound()
| boolean hasUpperBound | ( | ) |
optional double upper_bound = 3 [default = inf];
- Returns
- Whether the upperBound field is set.
Implemented in MPConstraintProto.Builder, and MPConstraintProto.
The documentation for this interface was generated from the following file: