Package com.google.ortools.sat
Class ConstraintProto.Builder
java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<BuilderType>
com.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
com.google.ortools.sat.ConstraintProto.Builder
- All Implemented Interfaces:
ConstraintProtoOrBuilder,com.google.protobuf.Message.Builder,com.google.protobuf.MessageLite.Builder,com.google.protobuf.MessageLiteOrBuilder,com.google.protobuf.MessageOrBuilder,java.lang.Cloneable
- Enclosing class:
- ConstraintProto
public static final class ConstraintProto.Builder extends com.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder> implements ConstraintProtoOrBuilder
Next id: 30Protobuf type
operations_research.sat.ConstraintProto-
Method Summary
Modifier and Type Method Description ConstraintProto.BuilderaddAllEnforcementLiteral(java.lang.Iterable<? extends java.lang.Integer> values)The constraint will be enforced iff all literals listed here are true.ConstraintProto.BuilderaddEnforcementLiteral(int value)The constraint will be enforced iff all literals listed here are true.ConstraintProto.BuilderaddRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)ConstraintProtobuild()ConstraintProtobuildPartial()ConstraintProto.Builderclear()ConstraintProto.BuilderclearAllDiff()The all_diff constraint forces all variables to take different values.ConstraintProto.BuilderclearAtMostOne()The at_most_one constraint enforces that no more than one literal is true at the same time.ConstraintProto.BuilderclearAutomaton()The automaton constraint forces a sequence of variables to be accepted by an automaton.ConstraintProto.BuilderclearBoolAnd()The bool_and constraint forces all of the literals to be true.ConstraintProto.BuilderclearBoolOr()The bool_or constraint forces at least one literal to be true.ConstraintProto.BuilderclearBoolXor()The bool_xor constraint forces an odd number of the literals to be true.ConstraintProto.BuilderclearCircuit()The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.ConstraintProto.BuilderclearConstraint()ConstraintProto.BuilderclearCumulative()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.ConstraintProto.BuilderclearElement()The element constraint forces the variable with the given index to be equal to the target.ConstraintProto.BuilderclearEnforcementLiteral()The constraint will be enforced iff all literals listed here are true.ConstraintProto.BuilderclearExactlyOne()The exactly_one constraint force exactly one literal to true and no more.ConstraintProto.BuilderclearField(com.google.protobuf.Descriptors.FieldDescriptor field)ConstraintProto.BuilderclearIntDiv()The int_div constraint forces the target to equal vars[0] / vars[1].ConstraintProto.BuilderclearInterval()The interval constraint takes a start, end, and size, and forces start + size == end.ConstraintProto.BuilderclearIntMax()The int_max constraint forces the target to equal the maximum of all variables.ConstraintProto.BuilderclearIntMin()The int_min constraint forces the target to equal the minimum of all variables.ConstraintProto.BuilderclearIntMod()The int_mod constraint forces the target to equal vars[0] % vars[1].ConstraintProto.BuilderclearIntProd()The int_prod constraint forces the target to equal the product of all variables.ConstraintProto.BuilderclearInverse()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.ConstraintProto.BuilderclearLinear()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.ConstraintProto.BuilderclearLinMax().operations_research.sat.LinearArgumentProto lin_max = 27;ConstraintProto.BuilderclearLinMin().operations_research.sat.LinearArgumentProto lin_min = 28;ConstraintProto.BuilderclearName()For debug/logging only.ConstraintProto.BuilderclearNoOverlap()The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.ConstraintProto.BuilderclearNoOverlap2D()The no_overlap_2d constraint prevents a set of boxes from overlapping.ConstraintProto.BuilderclearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof)ConstraintProto.BuilderclearReservoir()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.ConstraintProto.BuilderclearRoutes()The routes constraint implements the vehicle routing problem.ConstraintProto.BuilderclearTable()The table constraint enforces what values a tuple of variables may take.ConstraintProto.Builderclone()AllDifferentConstraintProtogetAllDiff()The all_diff constraint forces all variables to take different values.AllDifferentConstraintProto.BuildergetAllDiffBuilder()The all_diff constraint forces all variables to take different values.AllDifferentConstraintProtoOrBuildergetAllDiffOrBuilder()The all_diff constraint forces all variables to take different values.BoolArgumentProtogetAtMostOne()The at_most_one constraint enforces that no more than one literal is true at the same time.BoolArgumentProto.BuildergetAtMostOneBuilder()The at_most_one constraint enforces that no more than one literal is true at the same time.BoolArgumentProtoOrBuildergetAtMostOneOrBuilder()The at_most_one constraint enforces that no more than one literal is true at the same time.AutomatonConstraintProtogetAutomaton()The automaton constraint forces a sequence of variables to be accepted by an automaton.AutomatonConstraintProto.BuildergetAutomatonBuilder()The automaton constraint forces a sequence of variables to be accepted by an automaton.AutomatonConstraintProtoOrBuildergetAutomatonOrBuilder()The automaton constraint forces a sequence of variables to be accepted by an automaton.BoolArgumentProtogetBoolAnd()The bool_and constraint forces all of the literals to be true.BoolArgumentProto.BuildergetBoolAndBuilder()The bool_and constraint forces all of the literals to be true.BoolArgumentProtoOrBuildergetBoolAndOrBuilder()The bool_and constraint forces all of the literals to be true.BoolArgumentProtogetBoolOr()The bool_or constraint forces at least one literal to be true.BoolArgumentProto.BuildergetBoolOrBuilder()The bool_or constraint forces at least one literal to be true.BoolArgumentProtoOrBuildergetBoolOrOrBuilder()The bool_or constraint forces at least one literal to be true.BoolArgumentProtogetBoolXor()The bool_xor constraint forces an odd number of the literals to be true.BoolArgumentProto.BuildergetBoolXorBuilder()The bool_xor constraint forces an odd number of the literals to be true.BoolArgumentProtoOrBuildergetBoolXorOrBuilder()The bool_xor constraint forces an odd number of the literals to be true.CircuitConstraintProtogetCircuit()The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.CircuitConstraintProto.BuildergetCircuitBuilder()The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.CircuitConstraintProtoOrBuildergetCircuitOrBuilder()The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.ConstraintProto.ConstraintCasegetConstraintCase()CumulativeConstraintProtogetCumulative()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.CumulativeConstraintProto.BuildergetCumulativeBuilder()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.CumulativeConstraintProtoOrBuildergetCumulativeOrBuilder()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.ConstraintProtogetDefaultInstanceForType()static com.google.protobuf.Descriptors.DescriptorgetDescriptor()com.google.protobuf.Descriptors.DescriptorgetDescriptorForType()ElementConstraintProtogetElement()The element constraint forces the variable with the given index to be equal to the target.ElementConstraintProto.BuildergetElementBuilder()The element constraint forces the variable with the given index to be equal to the target.ElementConstraintProtoOrBuildergetElementOrBuilder()The element constraint forces the variable with the given index to be equal to the target.intgetEnforcementLiteral(int index)The constraint will be enforced iff all literals listed here are true.intgetEnforcementLiteralCount()The constraint will be enforced iff all literals listed here are true.java.util.List<java.lang.Integer>getEnforcementLiteralList()The constraint will be enforced iff all literals listed here are true.BoolArgumentProtogetExactlyOne()The exactly_one constraint force exactly one literal to true and no more.BoolArgumentProto.BuildergetExactlyOneBuilder()The exactly_one constraint force exactly one literal to true and no more.BoolArgumentProtoOrBuildergetExactlyOneOrBuilder()The exactly_one constraint force exactly one literal to true and no more.IntegerArgumentProtogetIntDiv()The int_div constraint forces the target to equal vars[0] / vars[1].IntegerArgumentProto.BuildergetIntDivBuilder()The int_div constraint forces the target to equal vars[0] / vars[1].IntegerArgumentProtoOrBuildergetIntDivOrBuilder()The int_div constraint forces the target to equal vars[0] / vars[1].IntervalConstraintProtogetInterval()The interval constraint takes a start, end, and size, and forces start + size == end.IntervalConstraintProto.BuildergetIntervalBuilder()The interval constraint takes a start, end, and size, and forces start + size == end.IntervalConstraintProtoOrBuildergetIntervalOrBuilder()The interval constraint takes a start, end, and size, and forces start + size == end.IntegerArgumentProtogetIntMax()The int_max constraint forces the target to equal the maximum of all variables.IntegerArgumentProto.BuildergetIntMaxBuilder()The int_max constraint forces the target to equal the maximum of all variables.IntegerArgumentProtoOrBuildergetIntMaxOrBuilder()The int_max constraint forces the target to equal the maximum of all variables.IntegerArgumentProtogetIntMin()The int_min constraint forces the target to equal the minimum of all variables.IntegerArgumentProto.BuildergetIntMinBuilder()The int_min constraint forces the target to equal the minimum of all variables.IntegerArgumentProtoOrBuildergetIntMinOrBuilder()The int_min constraint forces the target to equal the minimum of all variables.IntegerArgumentProtogetIntMod()The int_mod constraint forces the target to equal vars[0] % vars[1].IntegerArgumentProto.BuildergetIntModBuilder()The int_mod constraint forces the target to equal vars[0] % vars[1].IntegerArgumentProtoOrBuildergetIntModOrBuilder()The int_mod constraint forces the target to equal vars[0] % vars[1].IntegerArgumentProtogetIntProd()The int_prod constraint forces the target to equal the product of all variables.IntegerArgumentProto.BuildergetIntProdBuilder()The int_prod constraint forces the target to equal the product of all variables.IntegerArgumentProtoOrBuildergetIntProdOrBuilder()The int_prod constraint forces the target to equal the product of all variables.InverseConstraintProtogetInverse()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.InverseConstraintProto.BuildergetInverseBuilder()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.InverseConstraintProtoOrBuildergetInverseOrBuilder()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.LinearConstraintProtogetLinear()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.LinearConstraintProto.BuildergetLinearBuilder()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.LinearConstraintProtoOrBuildergetLinearOrBuilder()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.LinearArgumentProtogetLinMax().operations_research.sat.LinearArgumentProto lin_max = 27;LinearArgumentProto.BuildergetLinMaxBuilder().operations_research.sat.LinearArgumentProto lin_max = 27;LinearArgumentProtoOrBuildergetLinMaxOrBuilder().operations_research.sat.LinearArgumentProto lin_max = 27;LinearArgumentProtogetLinMin().operations_research.sat.LinearArgumentProto lin_min = 28;LinearArgumentProto.BuildergetLinMinBuilder().operations_research.sat.LinearArgumentProto lin_min = 28;LinearArgumentProtoOrBuildergetLinMinOrBuilder().operations_research.sat.LinearArgumentProto lin_min = 28;java.lang.StringgetName()For debug/logging only.com.google.protobuf.ByteStringgetNameBytes()For debug/logging only.NoOverlapConstraintProtogetNoOverlap()The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.NoOverlap2DConstraintProtogetNoOverlap2D()The no_overlap_2d constraint prevents a set of boxes from overlapping.NoOverlap2DConstraintProto.BuildergetNoOverlap2DBuilder()The no_overlap_2d constraint prevents a set of boxes from overlapping.NoOverlap2DConstraintProtoOrBuildergetNoOverlap2DOrBuilder()The no_overlap_2d constraint prevents a set of boxes from overlapping.NoOverlapConstraintProto.BuildergetNoOverlapBuilder()The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.NoOverlapConstraintProtoOrBuildergetNoOverlapOrBuilder()The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.ReservoirConstraintProtogetReservoir()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.ReservoirConstraintProto.BuildergetReservoirBuilder()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.ReservoirConstraintProtoOrBuildergetReservoirOrBuilder()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.RoutesConstraintProtogetRoutes()The routes constraint implements the vehicle routing problem.RoutesConstraintProto.BuildergetRoutesBuilder()The routes constraint implements the vehicle routing problem.RoutesConstraintProtoOrBuildergetRoutesOrBuilder()The routes constraint implements the vehicle routing problem.TableConstraintProtogetTable()The table constraint enforces what values a tuple of variables may take.TableConstraintProto.BuildergetTableBuilder()The table constraint enforces what values a tuple of variables may take.TableConstraintProtoOrBuildergetTableOrBuilder()The table constraint enforces what values a tuple of variables may take.booleanhasAllDiff()The all_diff constraint forces all variables to take different values.booleanhasAtMostOne()The at_most_one constraint enforces that no more than one literal is true at the same time.booleanhasAutomaton()The automaton constraint forces a sequence of variables to be accepted by an automaton.booleanhasBoolAnd()The bool_and constraint forces all of the literals to be true.booleanhasBoolOr()The bool_or constraint forces at least one literal to be true.booleanhasBoolXor()The bool_xor constraint forces an odd number of the literals to be true.booleanhasCircuit()The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.booleanhasCumulative()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.booleanhasElement()The element constraint forces the variable with the given index to be equal to the target.booleanhasExactlyOne()The exactly_one constraint force exactly one literal to true and no more.booleanhasIntDiv()The int_div constraint forces the target to equal vars[0] / vars[1].booleanhasInterval()The interval constraint takes a start, end, and size, and forces start + size == end.booleanhasIntMax()The int_max constraint forces the target to equal the maximum of all variables.booleanhasIntMin()The int_min constraint forces the target to equal the minimum of all variables.booleanhasIntMod()The int_mod constraint forces the target to equal vars[0] % vars[1].booleanhasIntProd()The int_prod constraint forces the target to equal the product of all variables.booleanhasInverse()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.booleanhasLinear()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.booleanhasLinMax().operations_research.sat.LinearArgumentProto lin_max = 27;booleanhasLinMin().operations_research.sat.LinearArgumentProto lin_min = 28;booleanhasNoOverlap()The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.booleanhasNoOverlap2D()The no_overlap_2d constraint prevents a set of boxes from overlapping.booleanhasReservoir()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.booleanhasRoutes()The routes constraint implements the vehicle routing problem.booleanhasTable()The table constraint enforces what values a tuple of variables may take.protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTableinternalGetFieldAccessorTable()booleanisInitialized()ConstraintProto.BuildermergeAllDiff(AllDifferentConstraintProto value)The all_diff constraint forces all variables to take different values.ConstraintProto.BuildermergeAtMostOne(BoolArgumentProto value)The at_most_one constraint enforces that no more than one literal is true at the same time.ConstraintProto.BuildermergeAutomaton(AutomatonConstraintProto value)The automaton constraint forces a sequence of variables to be accepted by an automaton.ConstraintProto.BuildermergeBoolAnd(BoolArgumentProto value)The bool_and constraint forces all of the literals to be true.ConstraintProto.BuildermergeBoolOr(BoolArgumentProto value)The bool_or constraint forces at least one literal to be true.ConstraintProto.BuildermergeBoolXor(BoolArgumentProto value)The bool_xor constraint forces an odd number of the literals to be true.ConstraintProto.BuildermergeCircuit(CircuitConstraintProto value)The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.ConstraintProto.BuildermergeCumulative(CumulativeConstraintProto value)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.ConstraintProto.BuildermergeElement(ElementConstraintProto value)The element constraint forces the variable with the given index to be equal to the target.ConstraintProto.BuildermergeExactlyOne(BoolArgumentProto value)The exactly_one constraint force exactly one literal to true and no more.ConstraintProto.BuildermergeFrom(ConstraintProto other)ConstraintProto.BuildermergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)ConstraintProto.BuildermergeFrom(com.google.protobuf.Message other)ConstraintProto.BuildermergeIntDiv(IntegerArgumentProto value)The int_div constraint forces the target to equal vars[0] / vars[1].ConstraintProto.BuildermergeInterval(IntervalConstraintProto value)The interval constraint takes a start, end, and size, and forces start + size == end.ConstraintProto.BuildermergeIntMax(IntegerArgumentProto value)The int_max constraint forces the target to equal the maximum of all variables.ConstraintProto.BuildermergeIntMin(IntegerArgumentProto value)The int_min constraint forces the target to equal the minimum of all variables.ConstraintProto.BuildermergeIntMod(IntegerArgumentProto value)The int_mod constraint forces the target to equal vars[0] % vars[1].ConstraintProto.BuildermergeIntProd(IntegerArgumentProto value)The int_prod constraint forces the target to equal the product of all variables.ConstraintProto.BuildermergeInverse(InverseConstraintProto value)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.ConstraintProto.BuildermergeLinear(LinearConstraintProto value)The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.ConstraintProto.BuildermergeLinMax(LinearArgumentProto value).operations_research.sat.LinearArgumentProto lin_max = 27;ConstraintProto.BuildermergeLinMin(LinearArgumentProto value).operations_research.sat.LinearArgumentProto lin_min = 28;ConstraintProto.BuildermergeNoOverlap(NoOverlapConstraintProto value)The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.ConstraintProto.BuildermergeNoOverlap2D(NoOverlap2DConstraintProto value)The no_overlap_2d constraint prevents a set of boxes from overlapping.ConstraintProto.BuildermergeReservoir(ReservoirConstraintProto value)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.ConstraintProto.BuildermergeRoutes(RoutesConstraintProto value)The routes constraint implements the vehicle routing problem.ConstraintProto.BuildermergeTable(TableConstraintProto value)The table constraint enforces what values a tuple of variables may take.ConstraintProto.BuildermergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)ConstraintProto.BuildersetAllDiff(AllDifferentConstraintProto value)The all_diff constraint forces all variables to take different values.ConstraintProto.BuildersetAllDiff(AllDifferentConstraintProto.Builder builderForValue)The all_diff constraint forces all variables to take different values.ConstraintProto.BuildersetAtMostOne(BoolArgumentProto value)The at_most_one constraint enforces that no more than one literal is true at the same time.ConstraintProto.BuildersetAtMostOne(BoolArgumentProto.Builder builderForValue)The at_most_one constraint enforces that no more than one literal is true at the same time.ConstraintProto.BuildersetAutomaton(AutomatonConstraintProto value)The automaton constraint forces a sequence of variables to be accepted by an automaton.ConstraintProto.BuildersetAutomaton(AutomatonConstraintProto.Builder builderForValue)The automaton constraint forces a sequence of variables to be accepted by an automaton.ConstraintProto.BuildersetBoolAnd(BoolArgumentProto value)The bool_and constraint forces all of the literals to be true.ConstraintProto.BuildersetBoolAnd(BoolArgumentProto.Builder builderForValue)The bool_and constraint forces all of the literals to be true.ConstraintProto.BuildersetBoolOr(BoolArgumentProto value)The bool_or constraint forces at least one literal to be true.ConstraintProto.BuildersetBoolOr(BoolArgumentProto.Builder builderForValue)The bool_or constraint forces at least one literal to be true.ConstraintProto.BuildersetBoolXor(BoolArgumentProto value)The bool_xor constraint forces an odd number of the literals to be true.ConstraintProto.BuildersetBoolXor(BoolArgumentProto.Builder builderForValue)The bool_xor constraint forces an odd number of the literals to be true.ConstraintProto.BuildersetCircuit(CircuitConstraintProto value)The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.ConstraintProto.BuildersetCircuit(CircuitConstraintProto.Builder builderForValue)The circuit constraint takes a graph and forces the arcs present (with arc presence indicated by a literal) to form a unique cycle.ConstraintProto.BuildersetCumulative(CumulativeConstraintProto value)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.ConstraintProto.BuildersetCumulative(CumulativeConstraintProto.Builder builderForValue)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.ConstraintProto.BuildersetElement(ElementConstraintProto value)The element constraint forces the variable with the given index to be equal to the target.ConstraintProto.BuildersetElement(ElementConstraintProto.Builder builderForValue)The element constraint forces the variable with the given index to be equal to the target.ConstraintProto.BuildersetEnforcementLiteral(int index, int value)The constraint will be enforced iff all literals listed here are true.ConstraintProto.BuildersetExactlyOne(BoolArgumentProto value)The exactly_one constraint force exactly one literal to true and no more.ConstraintProto.BuildersetExactlyOne(BoolArgumentProto.Builder builderForValue)The exactly_one constraint force exactly one literal to true and no more.ConstraintProto.BuildersetField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)ConstraintProto.BuildersetIntDiv(IntegerArgumentProto value)The int_div constraint forces the target to equal vars[0] / vars[1].ConstraintProto.BuildersetIntDiv(IntegerArgumentProto.Builder builderForValue)The int_div constraint forces the target to equal vars[0] / vars[1].ConstraintProto.BuildersetInterval(IntervalConstraintProto value)The interval constraint takes a start, end, and size, and forces start + size == end.ConstraintProto.BuildersetInterval(IntervalConstraintProto.Builder builderForValue)The interval constraint takes a start, end, and size, and forces start + size == end.ConstraintProto.BuildersetIntMax(IntegerArgumentProto value)The int_max constraint forces the target to equal the maximum of all variables.ConstraintProto.BuildersetIntMax(IntegerArgumentProto.Builder builderForValue)The int_max constraint forces the target to equal the maximum of all variables.ConstraintProto.BuildersetIntMin(IntegerArgumentProto value)The int_min constraint forces the target to equal the minimum of all variables.ConstraintProto.BuildersetIntMin(IntegerArgumentProto.Builder builderForValue)The int_min constraint forces the target to equal the minimum of all variables.ConstraintProto.BuildersetIntMod(IntegerArgumentProto value)The int_mod constraint forces the target to equal vars[0] % vars[1].ConstraintProto.BuildersetIntMod(IntegerArgumentProto.Builder builderForValue)The int_mod constraint forces the target to equal vars[0] % vars[1].ConstraintProto.BuildersetIntProd(IntegerArgumentProto value)The int_prod constraint forces the target to equal the product of all variables.ConstraintProto.BuildersetIntProd(IntegerArgumentProto.Builder builderForValue)The int_prod constraint forces the target to equal the product of all variables.ConstraintProto.BuildersetInverse(InverseConstraintProto value)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.ConstraintProto.BuildersetInverse(InverseConstraintProto.Builder builderForValue)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.ConstraintProto.BuildersetLinear(LinearConstraintProto value)The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.ConstraintProto.BuildersetLinear(LinearConstraintProto.Builder builderForValue)The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.ConstraintProto.BuildersetLinMax(LinearArgumentProto value).operations_research.sat.LinearArgumentProto lin_max = 27;ConstraintProto.BuildersetLinMax(LinearArgumentProto.Builder builderForValue).operations_research.sat.LinearArgumentProto lin_max = 27;ConstraintProto.BuildersetLinMin(LinearArgumentProto value).operations_research.sat.LinearArgumentProto lin_min = 28;ConstraintProto.BuildersetLinMin(LinearArgumentProto.Builder builderForValue).operations_research.sat.LinearArgumentProto lin_min = 28;ConstraintProto.BuildersetName(java.lang.String value)For debug/logging only.ConstraintProto.BuildersetNameBytes(com.google.protobuf.ByteString value)For debug/logging only.ConstraintProto.BuildersetNoOverlap(NoOverlapConstraintProto value)The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.ConstraintProto.BuildersetNoOverlap(NoOverlapConstraintProto.Builder builderForValue)The no_overlap constraint prevents a set of intervals from overlapping; in scheduling, this is called a disjunctive constraint.ConstraintProto.BuildersetNoOverlap2D(NoOverlap2DConstraintProto value)The no_overlap_2d constraint prevents a set of boxes from overlapping.ConstraintProto.BuildersetNoOverlap2D(NoOverlap2DConstraintProto.Builder builderForValue)The no_overlap_2d constraint prevents a set of boxes from overlapping.ConstraintProto.BuildersetRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)ConstraintProto.BuildersetReservoir(ReservoirConstraintProto value)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.ConstraintProto.BuildersetReservoir(ReservoirConstraintProto.Builder builderForValue)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.ConstraintProto.BuildersetRoutes(RoutesConstraintProto value)The routes constraint implements the vehicle routing problem.ConstraintProto.BuildersetRoutes(RoutesConstraintProto.Builder builderForValue)The routes constraint implements the vehicle routing problem.ConstraintProto.BuildersetTable(TableConstraintProto value)The table constraint enforces what values a tuple of variables may take.ConstraintProto.BuildersetTable(TableConstraintProto.Builder builderForValue)The table constraint enforces what values a tuple of variables may take.ConstraintProto.BuildersetUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)Methods inherited from class com.google.protobuf.GeneratedMessageV3.Builder
getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMutableMapField, isClean, markClean, newBuilderForField, onBuilt, onChanged, setUnknownFieldsProto3Methods inherited from class com.google.protobuf.AbstractMessage.Builder
findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringMethods inherited from class com.google.protobuf.AbstractMessageLite.Builder
addAll, addAll, mergeFrom, newUninitializedMessageExceptionMethods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface com.google.protobuf.MessageLite.Builder
mergeFromMethods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
-
Method Details
-
getDescriptor
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() -
internalGetFieldAccessorTable
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()- Specified by:
internalGetFieldAccessorTablein classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
clear
- Specified by:
clearin interfacecom.google.protobuf.Message.Builder- Specified by:
clearin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clearin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
getDescriptorForType
public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.Message.Builder- Specified by:
getDescriptorForTypein interfacecom.google.protobuf.MessageOrBuilder- Overrides:
getDescriptorForTypein classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
getDefaultInstanceForType
- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageLiteOrBuilder- Specified by:
getDefaultInstanceForTypein interfacecom.google.protobuf.MessageOrBuilder
-
build
- Specified by:
buildin interfacecom.google.protobuf.Message.Builder- Specified by:
buildin interfacecom.google.protobuf.MessageLite.Builder
-
buildPartial
- Specified by:
buildPartialin interfacecom.google.protobuf.Message.Builder- Specified by:
buildPartialin interfacecom.google.protobuf.MessageLite.Builder
-
clone
- Specified by:
clonein interfacecom.google.protobuf.Message.Builder- Specified by:
clonein interfacecom.google.protobuf.MessageLite.Builder- Overrides:
clonein classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
setField
public ConstraintProto.Builder setField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)- Specified by:
setFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
setFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
clearField
- Specified by:
clearFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
clearFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
clearOneof
- Specified by:
clearOneofin interfacecom.google.protobuf.Message.Builder- Overrides:
clearOneofin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
setRepeatedField
public ConstraintProto.Builder setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value)- Specified by:
setRepeatedFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
setRepeatedFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
addRepeatedField
public ConstraintProto.Builder addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value)- Specified by:
addRepeatedFieldin interfacecom.google.protobuf.Message.Builder- Overrides:
addRepeatedFieldin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
mergeFrom
- Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<ConstraintProto.Builder>
-
mergeFrom
-
isInitialized
public final boolean isInitialized()- Specified by:
isInitializedin interfacecom.google.protobuf.MessageLiteOrBuilder- Overrides:
isInitializedin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
mergeFrom
public ConstraintProto.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException- Specified by:
mergeFromin interfacecom.google.protobuf.Message.Builder- Specified by:
mergeFromin interfacecom.google.protobuf.MessageLite.Builder- Overrides:
mergeFromin classcom.google.protobuf.AbstractMessage.Builder<ConstraintProto.Builder>- Throws:
java.io.IOException
-
getConstraintCase
- Specified by:
getConstraintCasein interfaceConstraintProtoOrBuilder
-
clearConstraint
-
getName
public java.lang.String getName()For debug/logging only. Can be empty.
string name = 1;- Specified by:
getNamein interfaceConstraintProtoOrBuilder- Returns:
- The name.
-
getNameBytes
public com.google.protobuf.ByteString getNameBytes()For debug/logging only. Can be empty.
string name = 1;- Specified by:
getNameBytesin interfaceConstraintProtoOrBuilder- Returns:
- The bytes for name.
-
setName
For debug/logging only. Can be empty.
string name = 1;- Parameters:
value- The name to set.- Returns:
- This builder for chaining.
-
clearName
For debug/logging only. Can be empty.
string name = 1;- Returns:
- This builder for chaining.
-
setNameBytes
For debug/logging only. Can be empty.
string name = 1;- Parameters:
value- The bytes for name to set.- Returns:
- This builder for chaining.
-
getEnforcementLiteralList
public java.util.List<java.lang.Integer> getEnforcementLiteralList()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;- Specified by:
getEnforcementLiteralListin interfaceConstraintProtoOrBuilder- Returns:
- A list containing the enforcementLiteral.
-
getEnforcementLiteralCount
public int getEnforcementLiteralCount()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;- Specified by:
getEnforcementLiteralCountin interfaceConstraintProtoOrBuilder- Returns:
- The count of enforcementLiteral.
-
getEnforcementLiteral
public int getEnforcementLiteral(int index)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;- Specified by:
getEnforcementLiteralin interfaceConstraintProtoOrBuilder- Parameters:
index- The index of the element to return.- Returns:
- The enforcementLiteral at the given index.
-
setEnforcementLiteral
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.
-
addEnforcementLiteral
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.
-
addAllEnforcementLiteral
public ConstraintProto.Builder addAllEnforcementLiteral(java.lang.Iterable<? extends java.lang.Integer> values)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.
-
clearEnforcementLiteral
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.
-
hasBoolOr
public boolean hasBoolOr()The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;- Specified by:
hasBoolOrin interfaceConstraintProtoOrBuilder- Returns:
- Whether the boolOr field is set.
-
getBoolOr
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;- Specified by:
getBoolOrin interfaceConstraintProtoOrBuilder- Returns:
- The boolOr.
-
setBoolOr
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3; -
setBoolOr
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3; -
mergeBoolOr
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3; -
clearBoolOr
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3; -
getBoolOrBuilder
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3; -
getBoolOrOrBuilder
The bool_or constraint forces at least one literal to be true.
.operations_research.sat.BoolArgumentProto bool_or = 3;- Specified by:
getBoolOrOrBuilderin interfaceConstraintProtoOrBuilder
-
hasBoolAnd
public boolean hasBoolAnd()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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;- Specified by:
hasBoolAndin interfaceConstraintProtoOrBuilder- Returns:
- Whether the boolAnd field is set.
-
getBoolAnd
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;- Specified by:
getBoolAndin interfaceConstraintProtoOrBuilder- Returns:
- The boolAnd.
-
setBoolAnd
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4; -
setBoolAnd
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4; -
mergeBoolAnd
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4; -
clearBoolAnd
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4; -
getBoolAndBuilder
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4; -
getBoolAndOrBuilder
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 or at_most_one. It is just more space efficient and handled slightly differently internally.
.operations_research.sat.BoolArgumentProto bool_and = 4;- Specified by:
getBoolAndOrBuilderin interfaceConstraintProtoOrBuilder
-
hasAtMostOne
public boolean hasAtMostOne()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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26;- Specified by:
hasAtMostOnein interfaceConstraintProtoOrBuilder- Returns:
- Whether the atMostOne field is set.
-
getAtMostOne
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26;- Specified by:
getAtMostOnein interfaceConstraintProtoOrBuilder- Returns:
- The atMostOne.
-
setAtMostOne
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26; -
setAtMostOne
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26; -
mergeAtMostOne
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26; -
clearAtMostOne
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26; -
getAtMostOneBuilder
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26; -
getAtMostOneOrBuilder
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. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto at_most_one = 26;- Specified by:
getAtMostOneOrBuilderin interfaceConstraintProtoOrBuilder
-
hasExactlyOne
public boolean hasExactlyOne()The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29;- Specified by:
hasExactlyOnein interfaceConstraintProtoOrBuilder- Returns:
- Whether the exactlyOne field is set.
-
getExactlyOne
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29;- Specified by:
getExactlyOnein interfaceConstraintProtoOrBuilder- Returns:
- The exactlyOne.
-
setExactlyOne
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29; -
setExactlyOne
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29; -
mergeExactlyOne
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29; -
clearExactlyOne
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29; -
getExactlyOneBuilder
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29; -
getExactlyOneOrBuilder
The exactly_one constraint force exactly one literal to true and no more. Anytime a bool_or (it could have been called at_least_one) is included into an at_most_one, then the bool_or is actually an exactly one constraint, and the extra literal in the at_most_one can be set to false. So in this sense, this constraint is not really needed. it is just here for a better description of the problem structure and to facilitate some algorithm. This constraint does not support enforcement_literal. Just use a linear constraint if you need to enforce it. You also do not need to use it directly, we will extract it from the model in most situations.
.operations_research.sat.BoolArgumentProto exactly_one = 29;- Specified by:
getExactlyOneOrBuilderin interfaceConstraintProtoOrBuilder
-
hasBoolXor
public boolean hasBoolXor()The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;- Specified by:
hasBoolXorin interfaceConstraintProtoOrBuilder- Returns:
- Whether the boolXor field is set.
-
getBoolXor
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;- Specified by:
getBoolXorin interfaceConstraintProtoOrBuilder- Returns:
- The boolXor.
-
setBoolXor
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5; -
setBoolXor
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5; -
mergeBoolXor
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5; -
clearBoolXor
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5; -
getBoolXorBuilder
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5; -
getBoolXorOrBuilder
The bool_xor constraint forces an odd number of the literals to be true.
.operations_research.sat.BoolArgumentProto bool_xor = 5;- Specified by:
getBoolXorOrBuilderin interfaceConstraintProtoOrBuilder
-
hasIntDiv
public boolean hasIntDiv()The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7;- Specified by:
hasIntDivin interfaceConstraintProtoOrBuilder- Returns:
- Whether the intDiv field is set.
-
getIntDiv
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7;- Specified by:
getIntDivin interfaceConstraintProtoOrBuilder- Returns:
- The intDiv.
-
setIntDiv
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7; -
setIntDiv
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7; -
mergeIntDiv
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7; -
clearIntDiv
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7; -
getIntDivBuilder
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7; -
getIntDivOrBuilder
The int_div constraint forces the target to equal vars[0] / vars[1]. In particular, vars[1] can never take the value 0.
.operations_research.sat.IntegerArgumentProto int_div = 7;- Specified by:
getIntDivOrBuilderin interfaceConstraintProtoOrBuilder
-
hasIntMod
public boolean hasIntMod()The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8;- Specified by:
hasIntModin interfaceConstraintProtoOrBuilder- Returns:
- Whether the intMod field is set.
-
getIntMod
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8;- Specified by:
getIntModin interfaceConstraintProtoOrBuilder- Returns:
- The intMod.
-
setIntMod
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8; -
setIntMod
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8; -
mergeIntMod
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8; -
clearIntMod
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8; -
getIntModBuilder
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8; -
getIntModOrBuilder
The int_mod constraint forces the target to equal vars[0] % vars[1]. The domain of vars[1] must be strictly positive.
.operations_research.sat.IntegerArgumentProto int_mod = 8;- Specified by:
getIntModOrBuilderin interfaceConstraintProtoOrBuilder
-
hasIntMax
public boolean hasIntMax()The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;- Specified by:
hasIntMaxin interfaceConstraintProtoOrBuilder- Returns:
- Whether the intMax field is set.
-
getIntMax
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;- Specified by:
getIntMaxin interfaceConstraintProtoOrBuilder- Returns:
- The intMax.
-
setIntMax
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9; -
setIntMax
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9; -
mergeIntMax
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9; -
clearIntMax
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9; -
getIntMaxBuilder
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9; -
getIntMaxOrBuilder
The int_max constraint forces the target to equal the maximum of all variables. The lin_max constraint forces the target to equal the maximum of all linear expressions. TODO(user): Remove int_max in favor of lin_max.
.operations_research.sat.IntegerArgumentProto int_max = 9;- Specified by:
getIntMaxOrBuilderin interfaceConstraintProtoOrBuilder
-
hasLinMax
public boolean hasLinMax().operations_research.sat.LinearArgumentProto lin_max = 27;- Specified by:
hasLinMaxin interfaceConstraintProtoOrBuilder- Returns:
- Whether the linMax field is set.
-
getLinMax
.operations_research.sat.LinearArgumentProto lin_max = 27;- Specified by:
getLinMaxin interfaceConstraintProtoOrBuilder- Returns:
- The linMax.
-
setLinMax
.operations_research.sat.LinearArgumentProto lin_max = 27; -
setLinMax
.operations_research.sat.LinearArgumentProto lin_max = 27; -
mergeLinMax
.operations_research.sat.LinearArgumentProto lin_max = 27; -
clearLinMax
.operations_research.sat.LinearArgumentProto lin_max = 27; -
getLinMaxBuilder
.operations_research.sat.LinearArgumentProto lin_max = 27; -
getLinMaxOrBuilder
.operations_research.sat.LinearArgumentProto lin_max = 27;- Specified by:
getLinMaxOrBuilderin interfaceConstraintProtoOrBuilder
-
hasIntMin
public boolean hasIntMin()The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;- Specified by:
hasIntMinin interfaceConstraintProtoOrBuilder- Returns:
- Whether the intMin field is set.
-
getIntMin
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;- Specified by:
getIntMinin interfaceConstraintProtoOrBuilder- Returns:
- The intMin.
-
setIntMin
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10; -
setIntMin
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10; -
mergeIntMin
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10; -
clearIntMin
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10; -
getIntMinBuilder
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10; -
getIntMinOrBuilder
The int_min constraint forces the target to equal the minimum of all variables. The lin_min constraint forces the target to equal the minimum of all linear expressions. TODO(user): Remove int_min in favor of lin_min.
.operations_research.sat.IntegerArgumentProto int_min = 10;- Specified by:
getIntMinOrBuilderin interfaceConstraintProtoOrBuilder
-
hasLinMin
public boolean hasLinMin().operations_research.sat.LinearArgumentProto lin_min = 28;- Specified by:
hasLinMinin interfaceConstraintProtoOrBuilder- Returns:
- Whether the linMin field is set.
-
getLinMin
.operations_research.sat.LinearArgumentProto lin_min = 28;- Specified by:
getLinMinin interfaceConstraintProtoOrBuilder- Returns:
- The linMin.
-
setLinMin
.operations_research.sat.LinearArgumentProto lin_min = 28; -
setLinMin
.operations_research.sat.LinearArgumentProto lin_min = 28; -
mergeLinMin
.operations_research.sat.LinearArgumentProto lin_min = 28; -
clearLinMin
.operations_research.sat.LinearArgumentProto lin_min = 28; -
getLinMinBuilder
.operations_research.sat.LinearArgumentProto lin_min = 28; -
getLinMinOrBuilder
.operations_research.sat.LinearArgumentProto lin_min = 28;- Specified by:
getLinMinOrBuilderin interfaceConstraintProtoOrBuilder
-
hasIntProd
public boolean hasIntProd()The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11;- Specified by:
hasIntProdin interfaceConstraintProtoOrBuilder- Returns:
- Whether the intProd field is set.
-
getIntProd
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11;- Specified by:
getIntProdin interfaceConstraintProtoOrBuilder- Returns:
- The intProd.
-
setIntProd
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11; -
setIntProd
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11; -
mergeIntProd
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11; -
clearIntProd
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11; -
getIntProdBuilder
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11; -
getIntProdOrBuilder
The int_prod constraint forces the target to equal the product of all variables. By convention, because we can just remove term equal to one, the empty product forces the target to be one. TODO(user): Support more than two terms in the product.
.operations_research.sat.IntegerArgumentProto int_prod = 11;- Specified by:
getIntProdOrBuilderin interfaceConstraintProtoOrBuilder
-
hasLinear
public boolean hasLinear()The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;- Specified by:
hasLinearin interfaceConstraintProtoOrBuilder- Returns:
- Whether the linear field is set.
-
getLinear
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;- Specified by:
getLinearin interfaceConstraintProtoOrBuilder- Returns:
- The linear.
-
setLinear
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12; -
setLinear
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12; -
mergeLinear
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12; -
clearLinear
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12; -
getLinearBuilder
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12; -
getLinearOrBuilder
The linear constraint enforces a linear inequality among the variables, such as 0 <= x + 2y <= 10.
.operations_research.sat.LinearConstraintProto linear = 12;- Specified by:
getLinearOrBuilderin interfaceConstraintProtoOrBuilder
-
hasAllDiff
public boolean hasAllDiff()The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;- Specified by:
hasAllDiffin interfaceConstraintProtoOrBuilder- Returns:
- Whether the allDiff field is set.
-
getAllDiff
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;- Specified by:
getAllDiffin interfaceConstraintProtoOrBuilder- Returns:
- The allDiff.
-
setAllDiff
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13; -
setAllDiff
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13; -
mergeAllDiff
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13; -
clearAllDiff
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13; -
getAllDiffBuilder
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13; -
getAllDiffOrBuilder
The all_diff constraint forces all variables to take different values.
.operations_research.sat.AllDifferentConstraintProto all_diff = 13;- Specified by:
getAllDiffOrBuilderin interfaceConstraintProtoOrBuilder
-
hasElement
public boolean hasElement()The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;- Specified by:
hasElementin interfaceConstraintProtoOrBuilder- Returns:
- Whether the element field is set.
-
getElement
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;- Specified by:
getElementin interfaceConstraintProtoOrBuilder- Returns:
- The element.
-
setElement
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14; -
setElement
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14; -
mergeElement
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14; -
clearElement
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14; -
getElementBuilder
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14; -
getElementOrBuilder
The element constraint forces the variable with the given index to be equal to the target.
.operations_research.sat.ElementConstraintProto element = 14;- Specified by:
getElementOrBuilderin interfaceConstraintProtoOrBuilder
-
hasCircuit
public boolean hasCircuit()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;- Specified by:
hasCircuitin interfaceConstraintProtoOrBuilder- Returns:
- Whether the circuit field is set.
-
getCircuit
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;- Specified by:
getCircuitin interfaceConstraintProtoOrBuilder- Returns:
- The circuit.
-
setCircuit
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; -
setCircuit
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; -
mergeCircuit
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; -
clearCircuit
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; -
getCircuitBuilder
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; -
getCircuitOrBuilder
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;- Specified by:
getCircuitOrBuilderin interfaceConstraintProtoOrBuilder
-
hasRoutes
public boolean hasRoutes()The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;- Specified by:
hasRoutesin interfaceConstraintProtoOrBuilder- Returns:
- Whether the routes field is set.
-
getRoutes
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;- Specified by:
getRoutesin interfaceConstraintProtoOrBuilder- Returns:
- The routes.
-
setRoutes
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23; -
setRoutes
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23; -
mergeRoutes
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23; -
clearRoutes
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23; -
getRoutesBuilder
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23; -
getRoutesOrBuilder
The routes constraint implements the vehicle routing problem.
.operations_research.sat.RoutesConstraintProto routes = 23;- Specified by:
getRoutesOrBuilderin interfaceConstraintProtoOrBuilder
-
hasTable
public boolean hasTable()The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;- Specified by:
hasTablein interfaceConstraintProtoOrBuilder- Returns:
- Whether the table field is set.
-
getTable
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;- Specified by:
getTablein interfaceConstraintProtoOrBuilder- Returns:
- The table.
-
setTable
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16; -
setTable
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16; -
mergeTable
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16; -
clearTable
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16; -
getTableBuilder
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16; -
getTableOrBuilder
The table constraint enforces what values a tuple of variables may take.
.operations_research.sat.TableConstraintProto table = 16;- Specified by:
getTableOrBuilderin interfaceConstraintProtoOrBuilder
-
hasAutomaton
public boolean hasAutomaton()The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;- Specified by:
hasAutomatonin interfaceConstraintProtoOrBuilder- Returns:
- Whether the automaton field is set.
-
getAutomaton
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;- Specified by:
getAutomatonin interfaceConstraintProtoOrBuilder- Returns:
- The automaton.
-
setAutomaton
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17; -
setAutomaton
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17; -
mergeAutomaton
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17; -
clearAutomaton
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17; -
getAutomatonBuilder
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17; -
getAutomatonOrBuilder
The automaton constraint forces a sequence of variables to be accepted by an automaton.
.operations_research.sat.AutomatonConstraintProto automaton = 17;- Specified by:
getAutomatonOrBuilderin interfaceConstraintProtoOrBuilder
-
hasInverse
public boolean hasInverse()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;- Specified by:
hasInversein interfaceConstraintProtoOrBuilder- Returns:
- Whether the inverse field is set.
-
getInverse
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;- Specified by:
getInversein interfaceConstraintProtoOrBuilder- Returns:
- The inverse.
-
setInverse
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; -
setInverse
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; -
mergeInverse
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; -
clearInverse
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; -
getInverseBuilder
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; -
getInverseOrBuilder
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;- Specified by:
getInverseOrBuilderin interfaceConstraintProtoOrBuilder
-
hasReservoir
public boolean hasReservoir()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;- Specified by:
hasReservoirin interfaceConstraintProtoOrBuilder- Returns:
- Whether the reservoir field is set.
-
getReservoir
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;- Specified by:
getReservoirin interfaceConstraintProtoOrBuilder- Returns:
- The reservoir.
-
setReservoir
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; -
setReservoir
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; -
mergeReservoir
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; -
clearReservoir
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; -
getReservoirBuilder
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; -
getReservoirOrBuilder
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;- Specified by:
getReservoirOrBuilderin interfaceConstraintProtoOrBuilder
-
hasInterval
public boolean hasInterval()The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;- Specified by:
hasIntervalin interfaceConstraintProtoOrBuilder- Returns:
- Whether the interval field is set.
-
getInterval
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;- Specified by:
getIntervalin interfaceConstraintProtoOrBuilder- Returns:
- The interval.
-
setInterval
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19; -
setInterval
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19; -
mergeInterval
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19; -
clearInterval
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19; -
getIntervalBuilder
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19; -
getIntervalOrBuilder
The interval constraint takes a start, end, and size, and forces start + size == end.
.operations_research.sat.IntervalConstraintProto interval = 19;- Specified by:
getIntervalOrBuilderin interfaceConstraintProtoOrBuilder
-
hasNoOverlap
public boolean hasNoOverlap()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;- Specified by:
hasNoOverlapin interfaceConstraintProtoOrBuilder- Returns:
- Whether the noOverlap field is set.
-
getNoOverlap
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;- Specified by:
getNoOverlapin interfaceConstraintProtoOrBuilder- Returns:
- The noOverlap.
-
setNoOverlap
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; -
setNoOverlap
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; -
mergeNoOverlap
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; -
clearNoOverlap
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; -
getNoOverlapBuilder
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; -
getNoOverlapOrBuilder
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;- Specified by:
getNoOverlapOrBuilderin interfaceConstraintProtoOrBuilder
-
hasNoOverlap2D
public boolean hasNoOverlap2D()The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;- Specified by:
hasNoOverlap2Din interfaceConstraintProtoOrBuilder- Returns:
- Whether the noOverlap2d field is set.
-
getNoOverlap2D
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;- Specified by:
getNoOverlap2Din interfaceConstraintProtoOrBuilder- Returns:
- The noOverlap2d.
-
setNoOverlap2D
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21; -
setNoOverlap2D
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21; -
mergeNoOverlap2D
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21; -
clearNoOverlap2D
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21; -
getNoOverlap2DBuilder
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21; -
getNoOverlap2DOrBuilder
The no_overlap_2d constraint prevents a set of boxes from overlapping.
.operations_research.sat.NoOverlap2DConstraintProto no_overlap_2d = 21;- Specified by:
getNoOverlap2DOrBuilderin interfaceConstraintProtoOrBuilder
-
hasCumulative
public boolean hasCumulative()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;- Specified by:
hasCumulativein interfaceConstraintProtoOrBuilder- Returns:
- Whether the cumulative field is set.
-
getCumulative
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;- Specified by:
getCumulativein interfaceConstraintProtoOrBuilder- Returns:
- The cumulative.
-
setCumulative
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; -
setCumulative
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; -
mergeCumulative
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; -
clearCumulative
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; -
getCumulativeBuilder
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; -
getCumulativeOrBuilder
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;- Specified by:
getCumulativeOrBuilderin interfaceConstraintProtoOrBuilder
-
setUnknownFields
public final ConstraintProto.Builder setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)- Specified by:
setUnknownFieldsin interfacecom.google.protobuf.Message.Builder- Overrides:
setUnknownFieldsin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-
mergeUnknownFields
public final ConstraintProto.Builder mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)- Specified by:
mergeUnknownFieldsin interfacecom.google.protobuf.Message.Builder- Overrides:
mergeUnknownFieldsin classcom.google.protobuf.GeneratedMessageV3.Builder<ConstraintProto.Builder>
-