Java Reference
Java Reference
Detailed Description
Next id: 29
Protobuf type
Definition at line 2408 of file ConstraintProto.java.
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
◆ addAllEnforcementLiteral()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Parameters
-
values The enforcementLiteral to add.
- Returns
- This builder for chaining.
Definition at line 3116 of file ConstraintProto.java.
◆ addEnforcementLiteral()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Parameters
-
value The enforcementLiteral to add.
- Returns
- This builder for chaining.
Definition at line 3090 of file ConstraintProto.java.
◆ addRepeatedField()
|
inline |
Definition at line 2689 of file ConstraintProto.java.
◆ build()
|
inline |
Definition at line 2464 of file ConstraintProto.java.
◆ buildPartial()
|
inline |
Definition at line 2473 of file ConstraintProto.java.
◆ clear()
|
inline |
Definition at line 2441 of file ConstraintProto.java.
◆ clearAllDiff()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Definition at line 5516 of file ConstraintProto.java.
◆ clearAtMostOne()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Definition at line 3662 of file ConstraintProto.java.
◆ clearAutomaton()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Definition at line 6620 of file ConstraintProto.java.
◆ clearBoolAnd()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Definition at line 3452 of file ConstraintProto.java.
◆ clearBoolOr()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Definition at line 3257 of file ConstraintProto.java.
◆ clearBoolXor()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Definition at line 3851 of file ConstraintProto.java.
◆ clearCircuit()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Definition at line 5885 of file ConstraintProto.java.
◆ clearCircuitCovering()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Definition at line 6248 of file ConstraintProto.java.
◆ clearConstraint()
|
inline |
Definition at line 2861 of file ConstraintProto.java.
◆ clearCumulative()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Definition at line 7751 of file ConstraintProto.java.
◆ clearElement()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Definition at line 5699 of file ConstraintProto.java.
◆ clearEnforcementLiteral()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Returns
- This builder for chaining.
Definition at line 3143 of file ConstraintProto.java.
◆ clearField()
|
inline |
Definition at line 2673 of file ConstraintProto.java.
◆ clearIntDiv()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Definition at line 4028 of file ConstraintProto.java.
◆ clearInterval()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Definition at line 7187 of file ConstraintProto.java.
◆ clearIntMax()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Definition at line 4394 of file ConstraintProto.java.
◆ clearIntMin()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Definition at line 4775 of file ConstraintProto.java.
◆ clearIntMod()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Definition at line 4205 of file ConstraintProto.java.
◆ clearIntProd()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Definition at line 5150 of file ConstraintProto.java.
◆ clearInverse()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Definition at line 6806 of file ConstraintProto.java.
◆ clearLinear()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Definition at line 5336 of file ConstraintProto.java.
◆ clearLinMax()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Definition at line 4583 of file ConstraintProto.java.
◆ clearLinMin()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Definition at line 4964 of file ConstraintProto.java.
◆ clearName()
|
inline |
For debug/logging only. Can be empty.
string name = 1;
- Returns
- This builder for chaining.
Definition at line 2939 of file ConstraintProto.java.
◆ clearNoOverlap()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Definition at line 7379 of file ConstraintProto.java.
◆ clearNoOverlap2D()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Definition at line 7562 of file ConstraintProto.java.
◆ clearOneof()
|
inline |
Definition at line 2678 of file ConstraintProto.java.
◆ clearReservoir()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Definition at line 6998 of file ConstraintProto.java.
◆ clearRoutes()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Definition at line 6065 of file ConstraintProto.java.
◆ clearTable()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Definition at line 6434 of file ConstraintProto.java.
◆ clone()
|
inline |
Definition at line 2663 of file ConstraintProto.java.
◆ getAllDiff()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
- Returns
- The allDiff.
Implements ConstraintProtoOrBuilder.
Definition at line 5432 of file ConstraintProto.java.
◆ getAllDiffBuilder()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Definition at line 5539 of file ConstraintProto.java.
◆ getAllDiffOrBuilder()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Implements ConstraintProtoOrBuilder.
Definition at line 5550 of file ConstraintProto.java.
◆ getAtMostOne()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
- Returns
- The atMostOne.
Implements ConstraintProtoOrBuilder.
Definition at line 3562 of file ConstraintProto.java.
◆ getAtMostOneBuilder()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Definition at line 3689 of file ConstraintProto.java.
◆ getAtMostOneOrBuilder()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Implements ConstraintProtoOrBuilder.
Definition at line 3704 of file ConstraintProto.java.
◆ getAutomaton()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
- Returns
- The automaton.
Implements ConstraintProtoOrBuilder.
Definition at line 6532 of file ConstraintProto.java.
◆ getAutomatonBuilder()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Definition at line 6644 of file ConstraintProto.java.
◆ getAutomatonOrBuilder()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Implements ConstraintProtoOrBuilder.
Definition at line 6656 of file ConstraintProto.java.
◆ getBoolAnd()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
- Returns
- The boolAnd.
Implements ConstraintProtoOrBuilder.
Definition at line 3356 of file ConstraintProto.java.
◆ getBoolAndBuilder()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Definition at line 3478 of file ConstraintProto.java.
◆ getBoolAndOrBuilder()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Implements ConstraintProtoOrBuilder.
Definition at line 3492 of file ConstraintProto.java.
◆ getBoolOr()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
- Returns
- The boolOr.
Implements ConstraintProtoOrBuilder.
Definition at line 3173 of file ConstraintProto.java.
◆ getBoolOrBuilder()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Definition at line 3280 of file ConstraintProto.java.
◆ getBoolOrOrBuilder()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Implements ConstraintProtoOrBuilder.
Definition at line 3291 of file ConstraintProto.java.
◆ getBoolXor()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
- Returns
- The boolXor.
Implements ConstraintProtoOrBuilder.
Definition at line 3767 of file ConstraintProto.java.
◆ getBoolXorBuilder()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Definition at line 3874 of file ConstraintProto.java.
◆ getBoolXorOrBuilder()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Implements ConstraintProtoOrBuilder.
Definition at line 3885 of file ConstraintProto.java.
◆ getCircuit()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
- Returns
- The circuit.
Implements ConstraintProtoOrBuilder.
Definition at line 5797 of file ConstraintProto.java.
◆ getCircuitBuilder()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Definition at line 5909 of file ConstraintProto.java.
◆ getCircuitCovering()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
- Returns
- The circuitCovering.
Implements ConstraintProtoOrBuilder.
Definition at line 6160 of file ConstraintProto.java.
◆ getCircuitCoveringBuilder()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Definition at line 6272 of file ConstraintProto.java.
◆ getCircuitCoveringOrBuilder()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Implements ConstraintProtoOrBuilder.
Definition at line 6284 of file ConstraintProto.java.
◆ getCircuitOrBuilder()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Implements ConstraintProtoOrBuilder.
Definition at line 5921 of file ConstraintProto.java.
◆ getConstraintCase()
|
inline |
Implements ConstraintProtoOrBuilder.
Definition at line 2856 of file ConstraintProto.java.
◆ getCumulative()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
- Returns
- The cumulative.
Implements ConstraintProtoOrBuilder.
Definition at line 7659 of file ConstraintProto.java.
◆ getCumulativeBuilder()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Definition at line 7776 of file ConstraintProto.java.
◆ getCumulativeOrBuilder()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Implements ConstraintProtoOrBuilder.
Definition at line 7789 of file ConstraintProto.java.
◆ getDefaultInstanceForType()
|
inline |
Definition at line 2459 of file ConstraintProto.java.
◆ getDescriptor()
|
inlinestatic |
Definition at line 2413 of file ConstraintProto.java.
◆ getDescriptorForType()
|
inline |
Definition at line 2454 of file ConstraintProto.java.
◆ getElement()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
- Returns
- The element.
Implements ConstraintProtoOrBuilder.
Definition at line 5611 of file ConstraintProto.java.
◆ getElementBuilder()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Definition at line 5723 of file ConstraintProto.java.
◆ getElementOrBuilder()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Implements ConstraintProtoOrBuilder.
Definition at line 5735 of file ConstraintProto.java.
◆ getEnforcementLiteral()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Parameters
-
index The index of the element to return.
- Returns
- The enforcementLiteral at the given index.
Implements ConstraintProtoOrBuilder.
Definition at line 3039 of file ConstraintProto.java.
◆ getEnforcementLiteralCount()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Returns
- The count of enforcementLiteral.
Implements ConstraintProtoOrBuilder.
Definition at line 3016 of file ConstraintProto.java.
◆ getEnforcementLiteralList()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Returns
- A list containing the enforcementLiteral.
Implements ConstraintProtoOrBuilder.
Definition at line 2993 of file ConstraintProto.java.
◆ getIntDiv()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
- Returns
- The intDiv.
Implements ConstraintProtoOrBuilder.
Definition at line 3944 of file ConstraintProto.java.
◆ getIntDivBuilder()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Definition at line 4051 of file ConstraintProto.java.
◆ getIntDivOrBuilder()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Implements ConstraintProtoOrBuilder.
Definition at line 4062 of file ConstraintProto.java.
◆ getInterval()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
- Returns
- The interval.
Implements ConstraintProtoOrBuilder.
Definition at line 7099 of file ConstraintProto.java.
◆ getIntervalBuilder()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Definition at line 7211 of file ConstraintProto.java.
◆ getIntervalOrBuilder()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Implements ConstraintProtoOrBuilder.
Definition at line 7223 of file ConstraintProto.java.
◆ getIntMax()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
- Returns
- The intMax.
Implements ConstraintProtoOrBuilder.
Definition at line 4302 of file ConstraintProto.java.
◆ getIntMaxBuilder()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Definition at line 4419 of file ConstraintProto.java.
◆ getIntMaxOrBuilder()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Implements ConstraintProtoOrBuilder.
Definition at line 4432 of file ConstraintProto.java.
◆ getIntMin()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
- Returns
- The intMin.
Implements ConstraintProtoOrBuilder.
Definition at line 4683 of file ConstraintProto.java.
◆ getIntMinBuilder()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Definition at line 4800 of file ConstraintProto.java.
◆ getIntMinOrBuilder()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Implements ConstraintProtoOrBuilder.
Definition at line 4813 of file ConstraintProto.java.
◆ getIntMod()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
- Returns
- The intMod.
Implements ConstraintProtoOrBuilder.
Definition at line 4121 of file ConstraintProto.java.
◆ getIntModBuilder()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Definition at line 4228 of file ConstraintProto.java.
◆ getIntModOrBuilder()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Implements ConstraintProtoOrBuilder.
Definition at line 4239 of file ConstraintProto.java.
◆ getIntProd()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
- Returns
- The intProd.
Implements ConstraintProtoOrBuilder.
Definition at line 5062 of file ConstraintProto.java.
◆ getIntProdBuilder()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Definition at line 5174 of file ConstraintProto.java.
◆ getIntProdOrBuilder()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Implements ConstraintProtoOrBuilder.
Definition at line 5186 of file ConstraintProto.java.
◆ getInverse()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
- Returns
- The inverse.
Implements ConstraintProtoOrBuilder.
Definition at line 6718 of file ConstraintProto.java.
◆ getInverseBuilder()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Definition at line 6830 of file ConstraintProto.java.
◆ getInverseOrBuilder()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Implements ConstraintProtoOrBuilder.
Definition at line 6842 of file ConstraintProto.java.
◆ getLinear()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
- Returns
- The linear.
Implements ConstraintProtoOrBuilder.
Definition at line 5248 of file ConstraintProto.java.
◆ getLinearBuilder()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Definition at line 5360 of file ConstraintProto.java.
◆ getLinearOrBuilder()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Implements ConstraintProtoOrBuilder.
Definition at line 5372 of file ConstraintProto.java.
◆ getLinMax()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
- Returns
- The linMax.
Implements ConstraintProtoOrBuilder.
Definition at line 4495 of file ConstraintProto.java.
◆ getLinMaxBuilder()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Definition at line 4607 of file ConstraintProto.java.
◆ getLinMaxOrBuilder()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Implements ConstraintProtoOrBuilder.
Definition at line 4619 of file ConstraintProto.java.
◆ getLinMin()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
- Returns
- The linMin.
Implements ConstraintProtoOrBuilder.
Definition at line 4876 of file ConstraintProto.java.
◆ getLinMinBuilder()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Definition at line 4988 of file ConstraintProto.java.
◆ getLinMinOrBuilder()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Implements ConstraintProtoOrBuilder.
Definition at line 5000 of file ConstraintProto.java.
◆ getName()
|
inline |
For debug/logging only. Can be empty.
string name = 1;
- Returns
- The name.
Implements ConstraintProtoOrBuilder.
Definition at line 2879 of file ConstraintProto.java.
◆ getNameBytes()
|
inline |
For debug/logging only. Can be empty.
string name = 1;
- Returns
- The bytes for name.
Implements ConstraintProtoOrBuilder.
Definition at line 2900 of file ConstraintProto.java.
◆ getNoOverlap()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
- Returns
- The noOverlap.
Implements ConstraintProtoOrBuilder.
Definition at line 7287 of file ConstraintProto.java.
◆ getNoOverlap2D()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
- Returns
- The noOverlap2d.
Implements ConstraintProtoOrBuilder.
Definition at line 7478 of file ConstraintProto.java.
◆ getNoOverlap2DBuilder()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Definition at line 7585 of file ConstraintProto.java.
◆ getNoOverlap2DOrBuilder()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Implements ConstraintProtoOrBuilder.
Definition at line 7596 of file ConstraintProto.java.
◆ getNoOverlapBuilder()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Definition at line 7404 of file ConstraintProto.java.
◆ getNoOverlapOrBuilder()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Implements ConstraintProtoOrBuilder.
Definition at line 7417 of file ConstraintProto.java.
◆ getReservoir()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
- Returns
- The reservoir.
Implements ConstraintProtoOrBuilder.
Definition at line 6906 of file ConstraintProto.java.
◆ getReservoirBuilder()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Definition at line 7023 of file ConstraintProto.java.
◆ getReservoirOrBuilder()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Implements ConstraintProtoOrBuilder.
Definition at line 7036 of file ConstraintProto.java.
◆ getRoutes()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
- Returns
- The routes.
Implements ConstraintProtoOrBuilder.
Definition at line 5981 of file ConstraintProto.java.
◆ getRoutesBuilder()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Definition at line 6088 of file ConstraintProto.java.
◆ getRoutesOrBuilder()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Implements ConstraintProtoOrBuilder.
Definition at line 6099 of file ConstraintProto.java.
◆ getTable()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
- Returns
- The table.
Implements ConstraintProtoOrBuilder.
Definition at line 6346 of file ConstraintProto.java.
◆ getTableBuilder()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Definition at line 6458 of file ConstraintProto.java.
◆ getTableOrBuilder()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Implements ConstraintProtoOrBuilder.
Definition at line 6470 of file ConstraintProto.java.
◆ hasAllDiff()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
- Returns
- Whether the allDiff field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5420 of file ConstraintProto.java.
◆ hasAtMostOne()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
- Returns
- Whether the atMostOne field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 3546 of file ConstraintProto.java.
◆ hasAutomaton()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
- Returns
- Whether the automaton field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 6519 of file ConstraintProto.java.
◆ hasBoolAnd()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
- Returns
- Whether the boolAnd field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 3341 of file ConstraintProto.java.
◆ hasBoolOr()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
- Returns
- Whether the boolOr field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 3161 of file ConstraintProto.java.
◆ hasBoolXor()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
- Returns
- Whether the boolXor field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 3755 of file ConstraintProto.java.
◆ hasCircuit()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
- Returns
- Whether the circuit field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5784 of file ConstraintProto.java.
◆ hasCircuitCovering()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
- Returns
- Whether the circuitCovering field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 6147 of file ConstraintProto.java.
◆ hasCumulative()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
- Returns
- Whether the cumulative field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 7645 of file ConstraintProto.java.
◆ hasElement()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
- Returns
- Whether the element field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5598 of file ConstraintProto.java.
◆ hasIntDiv()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
- Returns
- Whether the intDiv field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 3932 of file ConstraintProto.java.
◆ hasInterval()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
- Returns
- Whether the interval field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 7086 of file ConstraintProto.java.
◆ hasIntMax()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
- Returns
- Whether the intMax field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 4288 of file ConstraintProto.java.
◆ hasIntMin()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
- Returns
- Whether the intMin field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 4669 of file ConstraintProto.java.
◆ hasIntMod()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
- Returns
- Whether the intMod field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 4109 of file ConstraintProto.java.
◆ hasIntProd()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
- Returns
- Whether the intProd field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5049 of file ConstraintProto.java.
◆ hasInverse()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
- Returns
- Whether the inverse field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 6705 of file ConstraintProto.java.
◆ hasLinear()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
- Returns
- Whether the linear field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5235 of file ConstraintProto.java.
◆ hasLinMax()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
- Returns
- Whether the linMax field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 4482 of file ConstraintProto.java.
◆ hasLinMin()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
- Returns
- Whether the linMin field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 4863 of file ConstraintProto.java.
◆ hasNoOverlap()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
- Returns
- Whether the noOverlap field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 7273 of file ConstraintProto.java.
◆ hasNoOverlap2D()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
- Returns
- Whether the noOverlap2d field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 7466 of file ConstraintProto.java.
◆ hasReservoir()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
- Returns
- Whether the reservoir field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 6892 of file ConstraintProto.java.
◆ hasRoutes()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
- Returns
- Whether the routes field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 5969 of file ConstraintProto.java.
◆ hasTable()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
- Returns
- Whether the table field is set.
Implements ConstraintProtoOrBuilder.
Definition at line 6333 of file ConstraintProto.java.
◆ internalGetFieldAccessorTable()
|
inlineprotected |
Definition at line 2419 of file ConstraintProto.java.
◆ isInitialized()
|
inline |
Definition at line 2831 of file ConstraintProto.java.
◆ mergeAllDiff()
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Definition at line 5490 of file ConstraintProto.java.
◆ mergeAtMostOne()
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Definition at line 3632 of file ConstraintProto.java.
◆ mergeAutomaton()
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Definition at line 6593 of file ConstraintProto.java.
◆ mergeBoolAnd()
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Definition at line 3423 of file ConstraintProto.java.
◆ mergeBoolOr()
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Definition at line 3231 of file ConstraintProto.java.
◆ mergeBoolXor()
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Definition at line 3825 of file ConstraintProto.java.
◆ mergeCircuit()
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Definition at line 5858 of file ConstraintProto.java.
◆ mergeCircuitCovering()
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Definition at line 6221 of file ConstraintProto.java.
◆ mergeCumulative()
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Definition at line 7723 of file ConstraintProto.java.
◆ mergeElement()
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Definition at line 5672 of file ConstraintProto.java.
◆ mergeFrom() [1/3]
|
inline |
Definition at line 2704 of file ConstraintProto.java.
◆ mergeFrom() [2/3]
|
inline |
Definition at line 2836 of file ConstraintProto.java.
◆ mergeFrom() [3/3]
|
inline |
Definition at line 2695 of file ConstraintProto.java.
◆ mergeIntDiv()
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Definition at line 4002 of file ConstraintProto.java.
◆ mergeInterval()
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Definition at line 7160 of file ConstraintProto.java.
◆ mergeIntMax()
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Definition at line 4366 of file ConstraintProto.java.
◆ mergeIntMin()
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Definition at line 4747 of file ConstraintProto.java.
◆ mergeIntMod()
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Definition at line 4179 of file ConstraintProto.java.
◆ mergeIntProd()
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Definition at line 5123 of file ConstraintProto.java.
◆ mergeInverse()
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Definition at line 6779 of file ConstraintProto.java.
◆ mergeLinear()
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Definition at line 5309 of file ConstraintProto.java.
◆ mergeLinMax()
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Definition at line 4556 of file ConstraintProto.java.
◆ mergeLinMin()
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Definition at line 4937 of file ConstraintProto.java.
◆ mergeNoOverlap()
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Definition at line 7351 of file ConstraintProto.java.
◆ mergeNoOverlap2D()
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Definition at line 7536 of file ConstraintProto.java.
◆ mergeReservoir()
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Definition at line 6970 of file ConstraintProto.java.
◆ mergeRoutes()
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Definition at line 6039 of file ConstraintProto.java.
◆ mergeTable()
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Definition at line 6407 of file ConstraintProto.java.
◆ mergeUnknownFields()
|
inline |
Definition at line 7833 of file ConstraintProto.java.
◆ setAllDiff() [1/2]
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Definition at line 5452 of file ConstraintProto.java.
◆ setAllDiff() [2/2]
|
inline |
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;
Definition at line 5472 of file ConstraintProto.java.
◆ setAtMostOne() [1/2]
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Definition at line 3586 of file ConstraintProto.java.
◆ setAtMostOne() [2/2]
|
inline |
The at_most_one constraint enforces that no more than one literal is true at the same time. Note that an at most one constraint of length n could be encoded with n bool_and constraint with n-1 term on the right hand side. So in a sense, this constraint contribute directly to the "implication-graph" or the 2-SAT part of the model.
.operations_research.sat.BoolArgumentProto at_most_one = 26;
Definition at line 3610 of file ConstraintProto.java.
◆ setAutomaton() [1/2]
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Definition at line 6553 of file ConstraintProto.java.
◆ setAutomaton() [2/2]
|
inline |
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;
Definition at line 6574 of file ConstraintProto.java.
◆ setBoolAnd() [1/2]
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Definition at line 3379 of file ConstraintProto.java.
◆ setBoolAnd() [2/2]
|
inline |
The bool_and constraint forces all of the literals to be true. This is a "redundant" constraint in the sense that this can easily be encoded with many bool_or. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;
Definition at line 3402 of file ConstraintProto.java.
◆ setBoolOr() [1/2]
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Definition at line 3193 of file ConstraintProto.java.
◆ setBoolOr() [2/2]
|
inline |
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;
Definition at line 3213 of file ConstraintProto.java.
◆ setBoolXor() [1/2]
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Definition at line 3787 of file ConstraintProto.java.
◆ setBoolXor() [2/2]
|
inline |
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;
Definition at line 3807 of file ConstraintProto.java.
◆ setCircuit() [1/2]
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Definition at line 5818 of file ConstraintProto.java.
◆ setCircuit() [2/2]
|
inline |
The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.
.operations_research.sat.CircuitConstraintProto circuit = 15;
Definition at line 5839 of file ConstraintProto.java.
◆ setCircuitCovering() [1/2]
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Definition at line 6181 of file ConstraintProto.java.
◆ setCircuitCovering() [2/2]
|
inline |
The circuit_covering constraint is similar to the circuit constraint, but allows multiple non-overlapping cycles instead of just one.
.operations_research.sat.CircuitCoveringConstraintProto circuit_covering = 25;
Definition at line 6202 of file ConstraintProto.java.
◆ setCumulative() [1/2]
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Definition at line 7681 of file ConstraintProto.java.
◆ setCumulative() [2/2]
|
inline |
The cumulative constraint ensures that for any integer point, the sum of the demands of the intervals containing that point does not exceed the capacity.
.operations_research.sat.CumulativeConstraintProto cumulative = 22;
Definition at line 7703 of file ConstraintProto.java.
◆ setElement() [1/2]
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Definition at line 5632 of file ConstraintProto.java.
◆ setElement() [2/2]
|
inline |
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;
Definition at line 5653 of file ConstraintProto.java.
◆ setEnforcementLiteral()
|
inline |
The constraint will be enforced iff all literals listed here are true. If this is empty, then the constraint will always be enforced. An enforced constraint must be satisfied, and an un-enforced one will simply be ignored. This is also called half-reification. To have an equivalence between a literal and a constraint (full reification), one must add both a constraint (controlled by a literal l) and its negation (controlled by the negation of l). Important: as of September 2018, only a few constraint support enforcement:
- bool_or, bool_and, linear: fully supported.
- interval: only support a single enforcement literal.
- other: no support (but can be added on a per-demand basis).
repeated int32 enforcement_literal = 2;
- Parameters
-
index The index to set the value at. value The enforcementLiteral to set.
- Returns
- This builder for chaining.
Definition at line 3063 of file ConstraintProto.java.
◆ setField()
|
inline |
Definition at line 2667 of file ConstraintProto.java.
◆ setIntDiv() [1/2]
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Definition at line 3964 of file ConstraintProto.java.
◆ setIntDiv() [2/2]
|
inline |
The int_div constraint forces the target to equal vars[0] / vars[1].
.operations_research.sat.IntegerArgumentProto int_div = 7;
Definition at line 3984 of file ConstraintProto.java.
◆ setInterval() [1/2]
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Definition at line 7120 of file ConstraintProto.java.
◆ setInterval() [2/2]
|
inline |
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;
Definition at line 7141 of file ConstraintProto.java.
◆ setIntMax() [1/2]
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Definition at line 4324 of file ConstraintProto.java.
◆ setIntMax() [2/2]
|
inline |
The int_max constraint forces the target to equal the maximum of all variables. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;
Definition at line 4346 of file ConstraintProto.java.
◆ setIntMin() [1/2]
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Definition at line 4705 of file ConstraintProto.java.
◆ setIntMin() [2/2]
|
inline |
The int_min constraint forces the target to equal the minimum of all variables. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;
Definition at line 4727 of file ConstraintProto.java.
◆ setIntMod() [1/2]
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Definition at line 4141 of file ConstraintProto.java.
◆ setIntMod() [2/2]
|
inline |
The int_mod constraint forces the target to equal vars[0] % vars[1].
.operations_research.sat.IntegerArgumentProto int_mod = 8;
Definition at line 4161 of file ConstraintProto.java.
◆ setIntProd() [1/2]
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Definition at line 5083 of file ConstraintProto.java.
◆ setIntProd() [2/2]
|
inline |
The int_prod constraint forces the target to equal the product of all variables.
.operations_research.sat.IntegerArgumentProto int_prod = 11;
Definition at line 5104 of file ConstraintProto.java.
◆ setInverse() [1/2]
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Definition at line 6739 of file ConstraintProto.java.
◆ setInverse() [2/2]
|
inline |
The inverse constraint forces two arrays to be inverses of each other: the values of one are the indices of the other, and vice versa.
.operations_research.sat.InverseConstraintProto inverse = 18;
Definition at line 6760 of file ConstraintProto.java.
◆ setLinear() [1/2]
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Definition at line 5269 of file ConstraintProto.java.
◆ setLinear() [2/2]
|
inline |
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;
Definition at line 5290 of file ConstraintProto.java.
◆ setLinMax() [1/2]
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Definition at line 4516 of file ConstraintProto.java.
◆ setLinMax() [2/2]
|
inline |
The lin_max constraint forces the target to equal the maximum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_max = 27;
Definition at line 4537 of file ConstraintProto.java.
◆ setLinMin() [1/2]
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Definition at line 4897 of file ConstraintProto.java.
◆ setLinMin() [2/2]
|
inline |
The lin_min constraint forces the target to equal the minimum of all linear expressions.
.operations_research.sat.LinearArgumentProto lin_min = 28;
Definition at line 4918 of file ConstraintProto.java.
◆ setName()
|
inline |
For debug/logging only. Can be empty.
string name = 1;
- Parameters
-
value The name to set.
- Returns
- This builder for chaining.
Definition at line 2921 of file ConstraintProto.java.
◆ setNameBytes()
|
inline |
For debug/logging only. Can be empty.
string name = 1;
- Parameters
-
value The bytes for name to set.
- Returns
- This builder for chaining.
Definition at line 2954 of file ConstraintProto.java.
◆ setNoOverlap() [1/2]
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Definition at line 7309 of file ConstraintProto.java.
◆ setNoOverlap() [2/2]
|
inline |
The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.
.operations_research.sat.NoOverlapConstraintProto no_overlap = 20;
Definition at line 7331 of file ConstraintProto.java.
◆ setNoOverlap2D() [1/2]
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Definition at line 7498 of file ConstraintProto.java.
◆ setNoOverlap2D() [2/2]
|
inline |
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;
Definition at line 7518 of file ConstraintProto.java.
◆ setRepeatedField()
|
inline |
Definition at line 2683 of file ConstraintProto.java.
◆ setReservoir() [1/2]
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Definition at line 6928 of file ConstraintProto.java.
◆ setReservoir() [2/2]
|
inline |
The reservoir constraint forces the sum of a set of active demands to always be between a specified minimum and maximum value during specific times.
.operations_research.sat.ReservoirConstraintProto reservoir = 24;
Definition at line 6950 of file ConstraintProto.java.
◆ setRoutes() [1/2]
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Definition at line 6001 of file ConstraintProto.java.
◆ setRoutes() [2/2]
|
inline |
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;
Definition at line 6021 of file ConstraintProto.java.
◆ setTable() [1/2]
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Definition at line 6367 of file ConstraintProto.java.
◆ setTable() [2/2]
|
inline |
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;
Definition at line 6388 of file ConstraintProto.java.
◆ setUnknownFields()
|
inline |
Definition at line 7827 of file ConstraintProto.java.
The documentation for this class was generated from the following file: