6package com.google.ortools.bop;
18@com.google.protobuf.Generated
19public final class BopParameters
extends
20 com.google.protobuf.GeneratedMessage implements
23private static final long serialVersionUID = 0L;
25 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
26 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
31 BopParameters.class.getName());
34 private BopParameters(com.google.protobuf.GeneratedMessage.Builder<?> builder) {
37 private BopParameters() {
38 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
39 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
40 lpMaxDeterministicTime_ = 1D;
41 relativeGapLimit_ = 0.0001D;
42 maxNumDecisionsInLs_ = 4;
43 maxNumBrokenConstraintsInLs_ = 2147483647;
44 computeEstimatedImpact_ =
true;
48 maxNumberOfConflictsInRandomLns_ = 2500;
49 numRandomLnsTries_ = 1;
50 maxNumberOfBacktracksInLs_ = 100000000L;
52 useSatToChooseLnsNeighbourhood_ =
true;
53 maxNumberOfConflictsForQuickCheck_ = 10;
54 maxNumberOfConflictsInRandomSolutionGeneration_ = 500;
55 maxNumberOfExploredAssignmentsPerTryInLs_ = 10000L;
56 useTranspositionTableInLs_ =
true;
57 useLearnedBinaryClausesInLp_ =
true;
59 synchronizationType_ = 0;
60 solverOptimizerSets_ = java.util.Collections.emptyList();
61 defaultSolverOptimizerSets_ =
"methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } ";
62 decomposerNumVariablesThreshold_ = 50;
63 numBopSolversUsedByDecomposition_ = 1;
64 guidedSatConflictsChunk_ = 1000;
67 public static final com.google.protobuf.Descriptors.Descriptor
69 return com.google.ortools.bop.BopParametersOuterClass.internal_static_operations_research_bop_BopParameters_descriptor;
73 protected com.google.protobuf.GeneratedMessage.FieldAccessorTable
75 return com.google.ortools.bop.BopParametersOuterClass.internal_static_operations_research_bop_BopParameters_fieldAccessorTable
76 .ensureFieldAccessorsInitialized(
77 com.google.ortools.bop.BopParameters.class, com.google.ortools.bop.BopParameters.Builder.class);
89 public enum ThreadSynchronizationType
90 implements com.google.protobuf.ProtocolMessageEnum {
143 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
144 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
149 ThreadSynchronizationType.class.getName());
211 @java.lang.Deprecated
212 public static ThreadSynchronizationType
valueOf(
int value) {
220 public static ThreadSynchronizationType
forNumber(
int value) {
225 default:
return null;
231 return internalValueMap;
233 private static final com.google.protobuf.Internal.EnumLiteMap<
241 public final com.google.protobuf.Descriptors.EnumValueDescriptor
245 public final com.google.protobuf.Descriptors.EnumDescriptor
249 public static com.google.protobuf.Descriptors.EnumDescriptor
251 return com.google.ortools.bop.BopParameters.getDescriptor().getEnumTypes().get(0);
256 public static ThreadSynchronizationType
valueOf(
257 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
259 throw new java.lang.IllegalArgumentException(
260 "EnumValueDescriptor is not for this type.");
262 return VALUES[desc.getIndex()];
265 private final int value;
274 private int bitField0_;
275 private int bitField1_;
277 private double maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
289 return ((bitField0_ & 0x00000001) != 0);
302 return maxTimeInSeconds_;
306 private double maxDeterministicTime_ = Double.POSITIVE_INFINITY;
321 return ((bitField0_ & 0x00000002) != 0);
337 return maxDeterministicTime_;
341 private double lpMaxDeterministicTime_ = 1D;
354 return ((bitField0_ & 0x00000004) != 0);
368 return lpMaxDeterministicTime_;
372 private int maxNumberOfConsecutiveFailingOptimizerCalls_ = 0;
387 return ((bitField0_ & 0x00000008) != 0);
403 return maxNumberOfConsecutiveFailingOptimizerCalls_;
407 private double relativeGapLimit_ = 0.0001D;
422 return ((bitField0_ & 0x00000010) != 0);
438 return relativeGapLimit_;
442 private int maxNumDecisionsInLs_ = 4;
454 return ((bitField0_ & 0x00000020) != 0);
467 return maxNumDecisionsInLs_;
471 private int maxNumBrokenConstraintsInLs_ = 2147483647;
484 return ((bitField0_ & 0x00000040) != 0);
498 return maxNumBrokenConstraintsInLs_;
502 private boolean logSearchProgress_ =
false;
513 return ((bitField0_ & 0x00000080) != 0);
525 return logSearchProgress_;
529 private boolean computeEstimatedImpact_ =
true;
540 return ((bitField0_ & 0x00000100) != 0);
552 return computeEstimatedImpact_;
556 private boolean pruneSearchTree_ =
false;
567 return ((bitField0_ & 0x00000200) != 0);
579 return pruneSearchTree_;
583 private boolean sortConstraintsByNumTerms_ =
false;
595 return ((bitField0_ & 0x00000400) != 0);
608 return sortConstraintsByNumTerms_;
612 private boolean useRandomLns_ =
true;
623 return ((bitField0_ & 0x00000800) != 0);
635 return useRandomLns_;
639 private int randomSeed_ = 8;
654 return ((bitField0_ & 0x00001000) != 0);
674 private int numRelaxedVars_ = 10;
685 return ((bitField0_ & 0x00002000) != 0);
697 return numRelaxedVars_;
701 private int maxNumberOfConflictsInRandomLns_ = 2500;
713 return ((bitField0_ & 0x00004000) != 0);
726 return maxNumberOfConflictsInRandomLns_;
730 private int numRandomLnsTries_ = 1;
741 return ((bitField0_ & 0x00008000) != 0);
753 return numRandomLnsTries_;
757 private long maxNumberOfBacktracksInLs_ = 100000000L;
769 return ((bitField0_ & 0x00010000) != 0);
782 return maxNumberOfBacktracksInLs_;
786 private boolean useLpLns_ =
true;
797 return ((bitField0_ & 0x00020000) != 0);
813 private boolean useSatToChooseLnsNeighbourhood_ =
true;
824 return ((bitField0_ & 0x00040000) != 0);
836 return useSatToChooseLnsNeighbourhood_;
840 private int maxNumberOfConflictsForQuickCheck_ = 10;
852 return ((bitField0_ & 0x00080000) != 0);
865 return maxNumberOfConflictsForQuickCheck_;
869 private boolean useSymmetry_ =
false;
884 return ((bitField0_ & 0x00100000) != 0);
904 private boolean exploitSymmetryInSatFirstSolution_ =
false;
919 return ((bitField0_ & 0x00200000) != 0);
935 return exploitSymmetryInSatFirstSolution_;
939 private int maxNumberOfConflictsInRandomSolutionGeneration_ = 500;
950 return ((bitField0_ & 0x00400000) != 0);
962 return maxNumberOfConflictsInRandomSolutionGeneration_;
966 private long maxNumberOfExploredAssignmentsPerTryInLs_ = 10000L;
980 return ((bitField0_ & 0x00800000) != 0);
995 return maxNumberOfExploredAssignmentsPerTryInLs_;
999 private boolean useTranspositionTableInLs_ =
true;
1013 return ((bitField0_ & 0x01000000) != 0);
1028 return useTranspositionTableInLs_;
1032 private boolean usePotentialOneFlipRepairsInLs_ =
false;
1045 return ((bitField0_ & 0x02000000) != 0);
1059 return usePotentialOneFlipRepairsInLs_;
1063 private boolean useLearnedBinaryClausesInLp_ =
true;
1074 return ((bitField0_ & 0x04000000) != 0);
1086 return useLearnedBinaryClausesInLp_;
1090 private int numberOfSolvers_ = 1;
1103 return ((bitField0_ & 0x08000000) != 0);
1117 return numberOfSolvers_;
1121 private int synchronizationType_ = 0;
1127 return ((bitField0_ & 0x10000000) != 0);
1139 @SuppressWarnings(
"serial")
1153 return solverOptimizerSets_;
1166 public java.util.List<? extends com.google.ortools.bop.BopSolverOptimizerSetOrBuilder>
1168 return solverOptimizerSets_;
1182 return solverOptimizerSets_.size();
1196 return solverOptimizerSets_.get(index);
1211 return solverOptimizerSets_.get(index);
1215 @SuppressWarnings(
"serial")
1216 private volatile java.lang.Object defaultSolverOptimizerSets_ =
"methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } ";
1223 return ((bitField0_ & 0x20000000) != 0);
1231 java.lang.Object ref = defaultSolverOptimizerSets_;
1232 if (ref instanceof java.lang.String) {
1233 return (java.lang.String) ref;
1235 com.google.protobuf.ByteString bs =
1236 (com.google.protobuf.ByteString) ref;
1237 java.lang.String s = bs.toStringUtf8();
1238 if (bs.isValidUtf8()) {
1239 defaultSolverOptimizerSets_ = s;
1249 public com.google.protobuf.ByteString
1251 java.lang.Object ref = defaultSolverOptimizerSets_;
1252 if (ref instanceof java.lang.String) {
1253 com.google.protobuf.ByteString b =
1254 com.google.protobuf.ByteString.copyFromUtf8(
1255 (java.lang.String) ref);
1256 defaultSolverOptimizerSets_ = b;
1259 return (com.google.protobuf.ByteString) ref;
1264 private boolean useLpStrongBranching_ =
false;
1283 return ((bitField0_ & 0x40000000) != 0);
1303 return useLpStrongBranching_;
1307 private int decomposerNumVariablesThreshold_ = 50;
1319 return ((bitField0_ & 0x80000000) != 0);
1332 return decomposerNumVariablesThreshold_;
1336 private int numBopSolversUsedByDecomposition_ = 1;
1349 return ((bitField1_ & 0x00000001) != 0);
1363 return numBopSolversUsedByDecomposition_;
1367 private double decomposedProblemMinTimeInSeconds_ = 0D;
1381 return ((bitField1_ & 0x00000002) != 0);
1396 return decomposedProblemMinTimeInSeconds_;
1400 private int guidedSatConflictsChunk_ = 1000;
1413 return ((bitField1_ & 0x00000004) != 0);
1427 return guidedSatConflictsChunk_;
1431 private int maxLpSolveForFeasibilityProblems_ = 0;
1445 return ((bitField1_ & 0x00000008) != 0);
1460 return maxLpSolveForFeasibilityProblems_;
1463 private byte memoizedIsInitialized = -1;
1470 memoizedIsInitialized = 1;
1475 public void writeTo(com.google.protobuf.CodedOutputStream output)
1476 throws java.io.IOException {
1477 if (((bitField0_ & 0x00000001) != 0)) {
1478 output.writeDouble(1, maxTimeInSeconds_);
1480 if (((bitField0_ & 0x00000020) != 0)) {
1481 output.writeInt32(2, maxNumDecisionsInLs_);
1483 if (((bitField0_ & 0x00000100) != 0)) {
1484 output.writeBool(3, computeEstimatedImpact_);
1486 if (((bitField0_ & 0x00000200) != 0)) {
1487 output.writeBool(4, pruneSearchTree_);
1489 if (((bitField0_ & 0x00000400) != 0)) {
1490 output.writeBool(5, sortConstraintsByNumTerms_);
1492 if (((bitField0_ & 0x00000800) != 0)) {
1493 output.writeBool(6, useRandomLns_);
1495 if (((bitField0_ & 0x00001000) != 0)) {
1496 output.writeInt32(7, randomSeed_);
1498 if (((bitField0_ & 0x00002000) != 0)) {
1499 output.writeInt32(8, numRelaxedVars_);
1501 if (((bitField0_ & 0x00004000) != 0)) {
1502 output.writeInt32(9, maxNumberOfConflictsInRandomLns_);
1504 if (((bitField0_ & 0x00008000) != 0)) {
1505 output.writeInt32(10, numRandomLnsTries_);
1507 if (((bitField0_ & 0x00010000) != 0)) {
1508 output.writeInt64(11, maxNumberOfBacktracksInLs_);
1510 if (((bitField0_ & 0x00020000) != 0)) {
1511 output.writeBool(12, useLpLns_);
1513 if (((bitField0_ & 0x00000080) != 0)) {
1514 output.writeBool(14, logSearchProgress_);
1516 if (((bitField0_ & 0x00040000) != 0)) {
1517 output.writeBool(15, useSatToChooseLnsNeighbourhood_);
1519 if (((bitField0_ & 0x00080000) != 0)) {
1520 output.writeInt32(16, maxNumberOfConflictsForQuickCheck_);
1522 if (((bitField0_ & 0x00100000) != 0)) {
1523 output.writeBool(17, useSymmetry_);
1525 if (((bitField0_ & 0x00400000) != 0)) {
1526 output.writeInt32(20, maxNumberOfConflictsInRandomSolutionGeneration_);
1528 if (((bitField0_ & 0x00800000) != 0)) {
1529 output.writeInt64(21, maxNumberOfExploredAssignmentsPerTryInLs_);
1531 if (((bitField0_ & 0x01000000) != 0)) {
1532 output.writeBool(22, useTranspositionTableInLs_);
1534 if (((bitField0_ & 0x04000000) != 0)) {
1535 output.writeBool(23, useLearnedBinaryClausesInLp_);
1537 if (((bitField0_ & 0x08000000) != 0)) {
1538 output.writeInt32(24, numberOfSolvers_);
1540 if (((bitField0_ & 0x10000000) != 0)) {
1541 output.writeEnum(25, synchronizationType_);
1543 for (
int i = 0; i < solverOptimizerSets_.size(); i++) {
1544 output.writeMessage(26, solverOptimizerSets_.get(i));
1546 if (((bitField0_ & 0x00000002) != 0)) {
1547 output.writeDouble(27, maxDeterministicTime_);
1549 if (((bitField0_ & 0x00000010) != 0)) {
1550 output.writeDouble(28, relativeGapLimit_);
1552 if (((bitField0_ & 0x40000000) != 0)) {
1553 output.writeBool(29, useLpStrongBranching_);
1555 if (((bitField0_ & 0x80000000) != 0)) {
1556 output.writeInt32(30, decomposerNumVariablesThreshold_);
1558 if (((bitField1_ & 0x00000001) != 0)) {
1559 output.writeInt32(31, numBopSolversUsedByDecomposition_);
1561 if (((bitField0_ & 0x20000000) != 0)) {
1562 com.google.protobuf.GeneratedMessage.writeString(output, 33, defaultSolverOptimizerSets_);
1564 if (((bitField1_ & 0x00000004) != 0)) {
1565 output.writeInt32(34, guidedSatConflictsChunk_);
1567 if (((bitField0_ & 0x00000008) != 0)) {
1568 output.writeInt32(35, maxNumberOfConsecutiveFailingOptimizerCalls_);
1570 if (((bitField1_ & 0x00000002) != 0)) {
1571 output.writeDouble(36, decomposedProblemMinTimeInSeconds_);
1573 if (((bitField0_ & 0x00000004) != 0)) {
1574 output.writeDouble(37, lpMaxDeterministicTime_);
1576 if (((bitField0_ & 0x00000040) != 0)) {
1577 output.writeInt32(38, maxNumBrokenConstraintsInLs_);
1579 if (((bitField0_ & 0x02000000) != 0)) {
1580 output.writeBool(39, usePotentialOneFlipRepairsInLs_);
1582 if (((bitField0_ & 0x00200000) != 0)) {
1583 output.writeBool(40, exploitSymmetryInSatFirstSolution_);
1585 if (((bitField1_ & 0x00000008) != 0)) {
1586 output.writeInt32(41, maxLpSolveForFeasibilityProblems_);
1588 getUnknownFields().writeTo(output);
1593 int size = memoizedSize;
1594 if (size != -1)
return size;
1597 if (((bitField0_ & 0x00000001) != 0)) {
1598 size += com.google.protobuf.CodedOutputStream
1599 .computeDoubleSize(1, maxTimeInSeconds_);
1601 if (((bitField0_ & 0x00000020) != 0)) {
1602 size += com.google.protobuf.CodedOutputStream
1603 .computeInt32Size(2, maxNumDecisionsInLs_);
1605 if (((bitField0_ & 0x00000100) != 0)) {
1606 size += com.google.protobuf.CodedOutputStream
1607 .computeBoolSize(3, computeEstimatedImpact_);
1609 if (((bitField0_ & 0x00000200) != 0)) {
1610 size += com.google.protobuf.CodedOutputStream
1611 .computeBoolSize(4, pruneSearchTree_);
1613 if (((bitField0_ & 0x00000400) != 0)) {
1614 size += com.google.protobuf.CodedOutputStream
1615 .computeBoolSize(5, sortConstraintsByNumTerms_);
1617 if (((bitField0_ & 0x00000800) != 0)) {
1618 size += com.google.protobuf.CodedOutputStream
1619 .computeBoolSize(6, useRandomLns_);
1621 if (((bitField0_ & 0x00001000) != 0)) {
1622 size += com.google.protobuf.CodedOutputStream
1623 .computeInt32Size(7, randomSeed_);
1625 if (((bitField0_ & 0x00002000) != 0)) {
1626 size += com.google.protobuf.CodedOutputStream
1627 .computeInt32Size(8, numRelaxedVars_);
1629 if (((bitField0_ & 0x00004000) != 0)) {
1630 size += com.google.protobuf.CodedOutputStream
1631 .computeInt32Size(9, maxNumberOfConflictsInRandomLns_);
1633 if (((bitField0_ & 0x00008000) != 0)) {
1634 size += com.google.protobuf.CodedOutputStream
1635 .computeInt32Size(10, numRandomLnsTries_);
1637 if (((bitField0_ & 0x00010000) != 0)) {
1638 size += com.google.protobuf.CodedOutputStream
1639 .computeInt64Size(11, maxNumberOfBacktracksInLs_);
1641 if (((bitField0_ & 0x00020000) != 0)) {
1642 size += com.google.protobuf.CodedOutputStream
1643 .computeBoolSize(12, useLpLns_);
1645 if (((bitField0_ & 0x00000080) != 0)) {
1646 size += com.google.protobuf.CodedOutputStream
1647 .computeBoolSize(14, logSearchProgress_);
1649 if (((bitField0_ & 0x00040000) != 0)) {
1650 size += com.google.protobuf.CodedOutputStream
1651 .computeBoolSize(15, useSatToChooseLnsNeighbourhood_);
1653 if (((bitField0_ & 0x00080000) != 0)) {
1654 size += com.google.protobuf.CodedOutputStream
1655 .computeInt32Size(16, maxNumberOfConflictsForQuickCheck_);
1657 if (((bitField0_ & 0x00100000) != 0)) {
1658 size += com.google.protobuf.CodedOutputStream
1659 .computeBoolSize(17, useSymmetry_);
1661 if (((bitField0_ & 0x00400000) != 0)) {
1662 size += com.google.protobuf.CodedOutputStream
1663 .computeInt32Size(20, maxNumberOfConflictsInRandomSolutionGeneration_);
1665 if (((bitField0_ & 0x00800000) != 0)) {
1666 size += com.google.protobuf.CodedOutputStream
1667 .computeInt64Size(21, maxNumberOfExploredAssignmentsPerTryInLs_);
1669 if (((bitField0_ & 0x01000000) != 0)) {
1670 size += com.google.protobuf.CodedOutputStream
1671 .computeBoolSize(22, useTranspositionTableInLs_);
1673 if (((bitField0_ & 0x04000000) != 0)) {
1674 size += com.google.protobuf.CodedOutputStream
1675 .computeBoolSize(23, useLearnedBinaryClausesInLp_);
1677 if (((bitField0_ & 0x08000000) != 0)) {
1678 size += com.google.protobuf.CodedOutputStream
1679 .computeInt32Size(24, numberOfSolvers_);
1681 if (((bitField0_ & 0x10000000) != 0)) {
1682 size += com.google.protobuf.CodedOutputStream
1683 .computeEnumSize(25, synchronizationType_);
1685 for (
int i = 0; i < solverOptimizerSets_.size(); i++) {
1686 size += com.google.protobuf.CodedOutputStream
1687 .computeMessageSize(26, solverOptimizerSets_.get(i));
1689 if (((bitField0_ & 0x00000002) != 0)) {
1690 size += com.google.protobuf.CodedOutputStream
1691 .computeDoubleSize(27, maxDeterministicTime_);
1693 if (((bitField0_ & 0x00000010) != 0)) {
1694 size += com.google.protobuf.CodedOutputStream
1695 .computeDoubleSize(28, relativeGapLimit_);
1697 if (((bitField0_ & 0x40000000) != 0)) {
1698 size += com.google.protobuf.CodedOutputStream
1699 .computeBoolSize(29, useLpStrongBranching_);
1701 if (((bitField0_ & 0x80000000) != 0)) {
1702 size += com.google.protobuf.CodedOutputStream
1703 .computeInt32Size(30, decomposerNumVariablesThreshold_);
1705 if (((bitField1_ & 0x00000001) != 0)) {
1706 size += com.google.protobuf.CodedOutputStream
1707 .computeInt32Size(31, numBopSolversUsedByDecomposition_);
1709 if (((bitField0_ & 0x20000000) != 0)) {
1710 size += com.google.protobuf.GeneratedMessage.computeStringSize(33, defaultSolverOptimizerSets_);
1712 if (((bitField1_ & 0x00000004) != 0)) {
1713 size += com.google.protobuf.CodedOutputStream
1714 .computeInt32Size(34, guidedSatConflictsChunk_);
1716 if (((bitField0_ & 0x00000008) != 0)) {
1717 size += com.google.protobuf.CodedOutputStream
1718 .computeInt32Size(35, maxNumberOfConsecutiveFailingOptimizerCalls_);
1720 if (((bitField1_ & 0x00000002) != 0)) {
1721 size += com.google.protobuf.CodedOutputStream
1722 .computeDoubleSize(36, decomposedProblemMinTimeInSeconds_);
1724 if (((bitField0_ & 0x00000004) != 0)) {
1725 size += com.google.protobuf.CodedOutputStream
1726 .computeDoubleSize(37, lpMaxDeterministicTime_);
1728 if (((bitField0_ & 0x00000040) != 0)) {
1729 size += com.google.protobuf.CodedOutputStream
1730 .computeInt32Size(38, maxNumBrokenConstraintsInLs_);
1732 if (((bitField0_ & 0x02000000) != 0)) {
1733 size += com.google.protobuf.CodedOutputStream
1734 .computeBoolSize(39, usePotentialOneFlipRepairsInLs_);
1736 if (((bitField0_ & 0x00200000) != 0)) {
1737 size += com.google.protobuf.CodedOutputStream
1738 .computeBoolSize(40, exploitSymmetryInSatFirstSolution_);
1740 if (((bitField1_ & 0x00000008) != 0)) {
1741 size += com.google.protobuf.CodedOutputStream
1742 .computeInt32Size(41, maxLpSolveForFeasibilityProblems_);
1744 size += getUnknownFields().getSerializedSize();
1745 memoizedSize = size;
1750 public boolean equals(
final java.lang.Object obj) {
1754 if (!(obj instanceof com.google.ortools.bop.BopParameters)) {
1755 return super.equals(obj);
1762 != java.lang.Double.doubleToLongBits(
1768 != java.lang.Double.doubleToLongBits(
1774 != java.lang.Double.doubleToLongBits(
1785 != java.lang.Double.doubleToLongBits(
1905 if (synchronizationType_ != other.synchronizationType_)
return false;
1932 != java.lang.Double.doubleToLongBits(
1945 if (!getUnknownFields().
equals(other.getUnknownFields()))
return false;
1951 if (memoizedHashCode != 0) {
1952 return memoizedHashCode;
1958 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
1963 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
1968 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
1977 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
1990 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
1995 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2000 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2005 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2010 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2031 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
2036 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2041 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2050 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2055 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2064 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
2069 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2074 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2079 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2088 hash = (53 * hash) + synchronizationType_;
2100 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
2113 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
2124 hash = (29 * hash) + getUnknownFields().hashCode();
2125 memoizedHashCode = hash;
2130 java.nio.ByteBuffer data)
2131 throws com.google.protobuf.InvalidProtocolBufferException {
2132 return PARSER.parseFrom(data);
2135 java.nio.ByteBuffer data,
2136 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2137 throws com.google.protobuf.InvalidProtocolBufferException {
2138 return PARSER.parseFrom(data, extensionRegistry);
2141 com.google.protobuf.ByteString data)
2142 throws com.google.protobuf.InvalidProtocolBufferException {
2143 return PARSER.parseFrom(data);
2146 com.google.protobuf.ByteString data,
2147 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2148 throws com.google.protobuf.InvalidProtocolBufferException {
2149 return PARSER.parseFrom(data, extensionRegistry);
2152 throws com.google.protobuf.InvalidProtocolBufferException {
2153 return PARSER.parseFrom(data);
2157 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2158 throws com.google.protobuf.InvalidProtocolBufferException {
2159 return PARSER.parseFrom(data, extensionRegistry);
2162 throws java.io.IOException {
2163 return com.google.protobuf.GeneratedMessage
2164 .parseWithIOException(PARSER, input);
2167 java.io.InputStream input,
2168 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2169 throws java.io.IOException {
2170 return com.google.protobuf.GeneratedMessage
2171 .parseWithIOException(PARSER, input, extensionRegistry);
2175 throws java.io.IOException {
2176 return com.google.protobuf.GeneratedMessage
2177 .parseDelimitedWithIOException(PARSER, input);
2181 java.io.InputStream input,
2182 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2183 throws java.io.IOException {
2184 return com.google.protobuf.GeneratedMessage
2185 .parseDelimitedWithIOException(PARSER, input, extensionRegistry);
2188 com.google.protobuf.CodedInputStream input)
2189 throws java.io.IOException {
2190 return com.google.protobuf.GeneratedMessage
2191 .parseWithIOException(PARSER, input);
2194 com.google.protobuf.CodedInputStream input,
2195 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2196 throws java.io.IOException {
2197 return com.google.protobuf.GeneratedMessage
2198 .parseWithIOException(PARSER, input, extensionRegistry);
2204 return DEFAULT_INSTANCE.toBuilder();
2207 return DEFAULT_INSTANCE.toBuilder().
mergeFrom(prototype);
2211 return this == DEFAULT_INSTANCE
2217 com.google.protobuf.GeneratedMessage.BuilderParent parent) {
2231 public static final class Builder
extends
2232 com.google.protobuf.GeneratedMessage.Builder<Builder> implements
2235 public static final com.google.protobuf.Descriptors.Descriptor
2237 return com.google.ortools.bop.BopParametersOuterClass.internal_static_operations_research_bop_BopParameters_descriptor;
2241 protected com.google.protobuf.GeneratedMessage.FieldAccessorTable
2243 return com.google.ortools.bop.BopParametersOuterClass.internal_static_operations_research_bop_BopParameters_fieldAccessorTable
2244 .ensureFieldAccessorsInitialized(
2245 com.google.ortools.bop.BopParameters.class, com.google.ortools.bop.BopParameters.Builder.class);
2254 com.google.protobuf.GeneratedMessage.BuilderParent parent) {
2263 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
2264 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
2265 lpMaxDeterministicTime_ = 1D;
2266 maxNumberOfConsecutiveFailingOptimizerCalls_ = 0;
2267 relativeGapLimit_ = 0.0001D;
2268 maxNumDecisionsInLs_ = 4;
2269 maxNumBrokenConstraintsInLs_ = 2147483647;
2270 logSearchProgress_ =
false;
2271 computeEstimatedImpact_ =
true;
2272 pruneSearchTree_ =
false;
2273 sortConstraintsByNumTerms_ =
false;
2274 useRandomLns_ =
true;
2276 numRelaxedVars_ = 10;
2277 maxNumberOfConflictsInRandomLns_ = 2500;
2278 numRandomLnsTries_ = 1;
2279 maxNumberOfBacktracksInLs_ = 100000000L;
2281 useSatToChooseLnsNeighbourhood_ =
true;
2282 maxNumberOfConflictsForQuickCheck_ = 10;
2283 useSymmetry_ =
false;
2284 exploitSymmetryInSatFirstSolution_ =
false;
2285 maxNumberOfConflictsInRandomSolutionGeneration_ = 500;
2286 maxNumberOfExploredAssignmentsPerTryInLs_ = 10000L;
2287 useTranspositionTableInLs_ =
true;
2288 usePotentialOneFlipRepairsInLs_ =
false;
2289 useLearnedBinaryClausesInLp_ =
true;
2290 numberOfSolvers_ = 1;
2291 synchronizationType_ = 0;
2292 if (solverOptimizerSetsBuilder_ ==
null) {
2293 solverOptimizerSets_ = java.util.Collections.emptyList();
2295 solverOptimizerSets_ =
null;
2296 solverOptimizerSetsBuilder_.clear();
2298 bitField0_ = (bitField0_ & ~0x20000000);
2299 defaultSolverOptimizerSets_ =
"methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } ";
2300 useLpStrongBranching_ =
false;
2301 decomposerNumVariablesThreshold_ = 50;
2302 numBopSolversUsedByDecomposition_ = 1;
2303 decomposedProblemMinTimeInSeconds_ = 0D;
2304 guidedSatConflictsChunk_ = 1000;
2305 maxLpSolveForFeasibilityProblems_ = 0;
2310 public com.google.protobuf.Descriptors.Descriptor
2312 return com.google.ortools.bop.BopParametersOuterClass.internal_static_operations_research_bop_BopParameters_descriptor;
2317 return com.google.ortools.bop.BopParameters.getDefaultInstance();
2324 throw newUninitializedMessageException(result);
2332 buildPartialRepeatedFields(result);
2333 if (bitField0_ != 0) { buildPartial0(result); }
2334 if (bitField1_ != 0) { buildPartial1(result); }
2339 private void buildPartialRepeatedFields(com.google.ortools.bop.BopParameters result) {
2340 if (solverOptimizerSetsBuilder_ ==
null) {
2341 if (((bitField0_ & 0x20000000) != 0)) {
2342 solverOptimizerSets_ = java.util.Collections.unmodifiableList(solverOptimizerSets_);
2343 bitField0_ = (bitField0_ & ~0x20000000);
2345 result.solverOptimizerSets_ = solverOptimizerSets_;
2347 result.solverOptimizerSets_ = solverOptimizerSetsBuilder_.build();
2351 private void buildPartial0(com.google.ortools.bop.BopParameters result) {
2352 int from_bitField0_ = bitField0_;
2353 int to_bitField0_ = 0;
2354 if (((from_bitField0_ & 0x00000001) != 0)) {
2355 result.maxTimeInSeconds_ = maxTimeInSeconds_;
2356 to_bitField0_ |= 0x00000001;
2358 if (((from_bitField0_ & 0x00000002) != 0)) {
2359 result.maxDeterministicTime_ = maxDeterministicTime_;
2360 to_bitField0_ |= 0x00000002;
2362 if (((from_bitField0_ & 0x00000004) != 0)) {
2363 result.lpMaxDeterministicTime_ = lpMaxDeterministicTime_;
2364 to_bitField0_ |= 0x00000004;
2366 if (((from_bitField0_ & 0x00000008) != 0)) {
2367 result.maxNumberOfConsecutiveFailingOptimizerCalls_ = maxNumberOfConsecutiveFailingOptimizerCalls_;
2368 to_bitField0_ |= 0x00000008;
2370 if (((from_bitField0_ & 0x00000010) != 0)) {
2371 result.relativeGapLimit_ = relativeGapLimit_;
2372 to_bitField0_ |= 0x00000010;
2374 if (((from_bitField0_ & 0x00000020) != 0)) {
2375 result.maxNumDecisionsInLs_ = maxNumDecisionsInLs_;
2376 to_bitField0_ |= 0x00000020;
2378 if (((from_bitField0_ & 0x00000040) != 0)) {
2379 result.maxNumBrokenConstraintsInLs_ = maxNumBrokenConstraintsInLs_;
2380 to_bitField0_ |= 0x00000040;
2382 if (((from_bitField0_ & 0x00000080) != 0)) {
2383 result.logSearchProgress_ = logSearchProgress_;
2384 to_bitField0_ |= 0x00000080;
2386 if (((from_bitField0_ & 0x00000100) != 0)) {
2387 result.computeEstimatedImpact_ = computeEstimatedImpact_;
2388 to_bitField0_ |= 0x00000100;
2390 if (((from_bitField0_ & 0x00000200) != 0)) {
2391 result.pruneSearchTree_ = pruneSearchTree_;
2392 to_bitField0_ |= 0x00000200;
2394 if (((from_bitField0_ & 0x00000400) != 0)) {
2395 result.sortConstraintsByNumTerms_ = sortConstraintsByNumTerms_;
2396 to_bitField0_ |= 0x00000400;
2398 if (((from_bitField0_ & 0x00000800) != 0)) {
2399 result.useRandomLns_ = useRandomLns_;
2400 to_bitField0_ |= 0x00000800;
2402 if (((from_bitField0_ & 0x00001000) != 0)) {
2403 result.randomSeed_ = randomSeed_;
2404 to_bitField0_ |= 0x00001000;
2406 if (((from_bitField0_ & 0x00002000) != 0)) {
2407 result.numRelaxedVars_ = numRelaxedVars_;
2408 to_bitField0_ |= 0x00002000;
2410 if (((from_bitField0_ & 0x00004000) != 0)) {
2411 result.maxNumberOfConflictsInRandomLns_ = maxNumberOfConflictsInRandomLns_;
2412 to_bitField0_ |= 0x00004000;
2414 if (((from_bitField0_ & 0x00008000) != 0)) {
2415 result.numRandomLnsTries_ = numRandomLnsTries_;
2416 to_bitField0_ |= 0x00008000;
2418 if (((from_bitField0_ & 0x00010000) != 0)) {
2419 result.maxNumberOfBacktracksInLs_ = maxNumberOfBacktracksInLs_;
2420 to_bitField0_ |= 0x00010000;
2422 if (((from_bitField0_ & 0x00020000) != 0)) {
2423 result.useLpLns_ = useLpLns_;
2424 to_bitField0_ |= 0x00020000;
2426 if (((from_bitField0_ & 0x00040000) != 0)) {
2427 result.useSatToChooseLnsNeighbourhood_ = useSatToChooseLnsNeighbourhood_;
2428 to_bitField0_ |= 0x00040000;
2430 if (((from_bitField0_ & 0x00080000) != 0)) {
2431 result.maxNumberOfConflictsForQuickCheck_ = maxNumberOfConflictsForQuickCheck_;
2432 to_bitField0_ |= 0x00080000;
2434 if (((from_bitField0_ & 0x00100000) != 0)) {
2435 result.useSymmetry_ = useSymmetry_;
2436 to_bitField0_ |= 0x00100000;
2438 if (((from_bitField0_ & 0x00200000) != 0)) {
2439 result.exploitSymmetryInSatFirstSolution_ = exploitSymmetryInSatFirstSolution_;
2440 to_bitField0_ |= 0x00200000;
2442 if (((from_bitField0_ & 0x00400000) != 0)) {
2443 result.maxNumberOfConflictsInRandomSolutionGeneration_ = maxNumberOfConflictsInRandomSolutionGeneration_;
2444 to_bitField0_ |= 0x00400000;
2446 if (((from_bitField0_ & 0x00800000) != 0)) {
2447 result.maxNumberOfExploredAssignmentsPerTryInLs_ = maxNumberOfExploredAssignmentsPerTryInLs_;
2448 to_bitField0_ |= 0x00800000;
2450 if (((from_bitField0_ & 0x01000000) != 0)) {
2451 result.useTranspositionTableInLs_ = useTranspositionTableInLs_;
2452 to_bitField0_ |= 0x01000000;
2454 if (((from_bitField0_ & 0x02000000) != 0)) {
2455 result.usePotentialOneFlipRepairsInLs_ = usePotentialOneFlipRepairsInLs_;
2456 to_bitField0_ |= 0x02000000;
2458 if (((from_bitField0_ & 0x04000000) != 0)) {
2459 result.useLearnedBinaryClausesInLp_ = useLearnedBinaryClausesInLp_;
2460 to_bitField0_ |= 0x04000000;
2462 if (((from_bitField0_ & 0x08000000) != 0)) {
2463 result.numberOfSolvers_ = numberOfSolvers_;
2464 to_bitField0_ |= 0x08000000;
2466 if (((from_bitField0_ & 0x10000000) != 0)) {
2467 result.synchronizationType_ = synchronizationType_;
2468 to_bitField0_ |= 0x10000000;
2470 if (((from_bitField0_ & 0x40000000) != 0)) {
2471 result.defaultSolverOptimizerSets_ = defaultSolverOptimizerSets_;
2472 to_bitField0_ |= 0x20000000;
2474 if (((from_bitField0_ & 0x80000000) != 0)) {
2475 result.useLpStrongBranching_ = useLpStrongBranching_;
2476 to_bitField0_ |= 0x40000000;
2478 result.bitField0_ |= to_bitField0_;
2481 private void buildPartial1(com.google.ortools.bop.BopParameters result) {
2482 int from_bitField1_ = bitField1_;
2483 int to_bitField0_ = 0;
2484 if (((from_bitField1_ & 0x00000001) != 0)) {
2485 result.decomposerNumVariablesThreshold_ = decomposerNumVariablesThreshold_;
2486 to_bitField0_ |= 0x80000000;
2488 int to_bitField1_ = 0;
2489 if (((from_bitField1_ & 0x00000002) != 0)) {
2490 result.numBopSolversUsedByDecomposition_ = numBopSolversUsedByDecomposition_;
2491 to_bitField1_ |= 0x00000001;
2493 if (((from_bitField1_ & 0x00000004) != 0)) {
2494 result.decomposedProblemMinTimeInSeconds_ = decomposedProblemMinTimeInSeconds_;
2495 to_bitField1_ |= 0x00000002;
2497 if (((from_bitField1_ & 0x00000008) != 0)) {
2498 result.guidedSatConflictsChunk_ = guidedSatConflictsChunk_;
2499 to_bitField1_ |= 0x00000004;
2501 if (((from_bitField1_ & 0x00000010) != 0)) {
2502 result.maxLpSolveForFeasibilityProblems_ = maxLpSolveForFeasibilityProblems_;
2503 to_bitField1_ |= 0x00000008;
2505 result.bitField0_ |= to_bitField0_;
2506 result.bitField1_ |= to_bitField1_;
2510 public Builder
mergeFrom(com.google.protobuf.Message other) {
2511 if (other instanceof com.google.ortools.bop.BopParameters) {
2512 return mergeFrom((com.google.ortools.bop.BopParameters)other);
2514 super.mergeFrom(other);
2519 public Builder
mergeFrom(com.google.ortools.bop.BopParameters other) {
2520 if (other == com.google.ortools.bop.BopParameters.getDefaultInstance())
return this;
2521 if (other.hasMaxTimeInSeconds()) {
2524 if (other.hasMaxDeterministicTime()) {
2527 if (other.hasLpMaxDeterministicTime()) {
2530 if (other.hasMaxNumberOfConsecutiveFailingOptimizerCalls()) {
2533 if (other.hasRelativeGapLimit()) {
2536 if (other.hasMaxNumDecisionsInLs()) {
2539 if (other.hasMaxNumBrokenConstraintsInLs()) {
2542 if (other.hasLogSearchProgress()) {
2545 if (other.hasComputeEstimatedImpact()) {
2548 if (other.hasPruneSearchTree()) {
2551 if (other.hasSortConstraintsByNumTerms()) {
2554 if (other.hasUseRandomLns()) {
2557 if (other.hasRandomSeed()) {
2560 if (other.hasNumRelaxedVars()) {
2563 if (other.hasMaxNumberOfConflictsInRandomLns()) {
2566 if (other.hasNumRandomLnsTries()) {
2569 if (other.hasMaxNumberOfBacktracksInLs()) {
2572 if (other.hasUseLpLns()) {
2575 if (other.hasUseSatToChooseLnsNeighbourhood()) {
2578 if (other.hasMaxNumberOfConflictsForQuickCheck()) {
2581 if (other.hasUseSymmetry()) {
2584 if (other.hasExploitSymmetryInSatFirstSolution()) {
2587 if (other.hasMaxNumberOfConflictsInRandomSolutionGeneration()) {
2590 if (other.hasMaxNumberOfExploredAssignmentsPerTryInLs()) {
2593 if (other.hasUseTranspositionTableInLs()) {
2596 if (other.hasUsePotentialOneFlipRepairsInLs()) {
2599 if (other.hasUseLearnedBinaryClausesInLp()) {
2602 if (other.hasNumberOfSolvers()) {
2605 if (other.hasSynchronizationType()) {
2608 if (solverOptimizerSetsBuilder_ ==
null) {
2609 if (!other.solverOptimizerSets_.isEmpty()) {
2610 if (solverOptimizerSets_.isEmpty()) {
2611 solverOptimizerSets_ = other.solverOptimizerSets_;
2612 bitField0_ = (bitField0_ & ~0x20000000);
2614 ensureSolverOptimizerSetsIsMutable();
2615 solverOptimizerSets_.addAll(other.solverOptimizerSets_);
2620 if (!other.solverOptimizerSets_.isEmpty()) {
2621 if (solverOptimizerSetsBuilder_.isEmpty()) {
2622 solverOptimizerSetsBuilder_.dispose();
2623 solverOptimizerSetsBuilder_ =
null;
2624 solverOptimizerSets_ = other.solverOptimizerSets_;
2625 bitField0_ = (bitField0_ & ~0x20000000);
2626 solverOptimizerSetsBuilder_ =
2627 com.google.protobuf.GeneratedMessage.alwaysUseFieldBuilders ?
2628 internalGetSolverOptimizerSetsFieldBuilder() :
null;
2630 solverOptimizerSetsBuilder_.addAllMessages(other.solverOptimizerSets_);
2634 if (other.hasDefaultSolverOptimizerSets()) {
2635 defaultSolverOptimizerSets_ = other.defaultSolverOptimizerSets_;
2636 bitField0_ |= 0x40000000;
2639 if (other.hasUseLpStrongBranching()) {
2642 if (other.hasDecomposerNumVariablesThreshold()) {
2645 if (other.hasNumBopSolversUsedByDecomposition()) {
2648 if (other.hasDecomposedProblemMinTimeInSeconds()) {
2651 if (other.hasGuidedSatConflictsChunk()) {
2654 if (other.hasMaxLpSolveForFeasibilityProblems()) {
2657 this.mergeUnknownFields(other.getUnknownFields());
2669 com.google.protobuf.CodedInputStream input,
2670 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
2671 throws java.io.IOException {
2672 if (extensionRegistry ==
null) {
2673 throw new java.lang.NullPointerException();
2676 boolean done =
false;
2678 int tag = input.readTag();
2684 maxTimeInSeconds_ = input.readDouble();
2685 bitField0_ |= 0x00000001;
2689 maxNumDecisionsInLs_ = input.readInt32();
2690 bitField0_ |= 0x00000020;
2694 computeEstimatedImpact_ = input.readBool();
2695 bitField0_ |= 0x00000100;
2699 pruneSearchTree_ = input.readBool();
2700 bitField0_ |= 0x00000200;
2704 sortConstraintsByNumTerms_ = input.readBool();
2705 bitField0_ |= 0x00000400;
2709 useRandomLns_ = input.readBool();
2710 bitField0_ |= 0x00000800;
2714 randomSeed_ = input.readInt32();
2715 bitField0_ |= 0x00001000;
2719 numRelaxedVars_ = input.readInt32();
2720 bitField0_ |= 0x00002000;
2724 maxNumberOfConflictsInRandomLns_ = input.readInt32();
2725 bitField0_ |= 0x00004000;
2729 numRandomLnsTries_ = input.readInt32();
2730 bitField0_ |= 0x00008000;
2734 maxNumberOfBacktracksInLs_ = input.readInt64();
2735 bitField0_ |= 0x00010000;
2739 useLpLns_ = input.readBool();
2740 bitField0_ |= 0x00020000;
2744 logSearchProgress_ = input.readBool();
2745 bitField0_ |= 0x00000080;
2749 useSatToChooseLnsNeighbourhood_ = input.readBool();
2750 bitField0_ |= 0x00040000;
2754 maxNumberOfConflictsForQuickCheck_ = input.readInt32();
2755 bitField0_ |= 0x00080000;
2759 useSymmetry_ = input.readBool();
2760 bitField0_ |= 0x00100000;
2764 maxNumberOfConflictsInRandomSolutionGeneration_ = input.readInt32();
2765 bitField0_ |= 0x00400000;
2769 maxNumberOfExploredAssignmentsPerTryInLs_ = input.readInt64();
2770 bitField0_ |= 0x00800000;
2774 useTranspositionTableInLs_ = input.readBool();
2775 bitField0_ |= 0x01000000;
2779 useLearnedBinaryClausesInLp_ = input.readBool();
2780 bitField0_ |= 0x04000000;
2784 numberOfSolvers_ = input.readInt32();
2785 bitField0_ |= 0x08000000;
2789 int tmpRaw = input.readEnum();
2791 com.google.ortools.bop.BopParameters.ThreadSynchronizationType.forNumber(tmpRaw);
2792 if (tmpValue ==
null) {
2793 mergeUnknownVarintField(25, tmpRaw);
2795 synchronizationType_ = tmpRaw;
2796 bitField0_ |= 0x10000000;
2803 com.google.ortools.bop.BopSolverOptimizerSet.parser(),
2805 if (solverOptimizerSetsBuilder_ ==
null) {
2806 ensureSolverOptimizerSetsIsMutable();
2807 solverOptimizerSets_.add(m);
2809 solverOptimizerSetsBuilder_.addMessage(m);
2814 maxDeterministicTime_ = input.readDouble();
2815 bitField0_ |= 0x00000002;
2819 relativeGapLimit_ = input.readDouble();
2820 bitField0_ |= 0x00000010;
2824 useLpStrongBranching_ = input.readBool();
2825 bitField0_ |= 0x80000000;
2829 decomposerNumVariablesThreshold_ = input.readInt32();
2830 bitField1_ |= 0x00000001;
2834 numBopSolversUsedByDecomposition_ = input.readInt32();
2835 bitField1_ |= 0x00000002;
2839 defaultSolverOptimizerSets_ = input.readBytes();
2840 bitField0_ |= 0x40000000;
2844 guidedSatConflictsChunk_ = input.readInt32();
2845 bitField1_ |= 0x00000008;
2849 maxNumberOfConsecutiveFailingOptimizerCalls_ = input.readInt32();
2850 bitField0_ |= 0x00000008;
2854 decomposedProblemMinTimeInSeconds_ = input.readDouble();
2855 bitField1_ |= 0x00000004;
2859 lpMaxDeterministicTime_ = input.readDouble();
2860 bitField0_ |= 0x00000004;
2864 maxNumBrokenConstraintsInLs_ = input.readInt32();
2865 bitField0_ |= 0x00000040;
2869 usePotentialOneFlipRepairsInLs_ = input.readBool();
2870 bitField0_ |= 0x02000000;
2874 exploitSymmetryInSatFirstSolution_ = input.readBool();
2875 bitField0_ |= 0x00200000;
2879 maxLpSolveForFeasibilityProblems_ = input.readInt32();
2880 bitField1_ |= 0x00000010;
2884 if (!super.parseUnknownField(input, extensionRegistry, tag)) {
2891 }
catch (com.google.protobuf.InvalidProtocolBufferException e) {
2892 throw e.unwrapIOException();
2898 private int bitField0_;
2899 private int bitField1_;
2901 private double maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
2913 return ((bitField0_ & 0x00000001) != 0);
2926 return maxTimeInSeconds_;
2940 maxTimeInSeconds_ = value;
2941 bitField0_ |= 0x00000001;
2955 bitField0_ = (bitField0_ & ~0x00000001);
2956 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
2961 private double maxDeterministicTime_ = Double.POSITIVE_INFINITY;
2976 return ((bitField0_ & 0x00000002) != 0);
2992 return maxDeterministicTime_;
3009 maxDeterministicTime_ = value;
3010 bitField0_ |= 0x00000002;
3027 bitField0_ = (bitField0_ & ~0x00000002);
3028 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
3033 private double lpMaxDeterministicTime_ = 1D;
3046 return ((bitField0_ & 0x00000004) != 0);
3060 return lpMaxDeterministicTime_;
3075 lpMaxDeterministicTime_ = value;
3076 bitField0_ |= 0x00000004;
3091 bitField0_ = (bitField0_ & ~0x00000004);
3092 lpMaxDeterministicTime_ = 1D;
3097 private int maxNumberOfConsecutiveFailingOptimizerCalls_ ;
3112 return ((bitField0_ & 0x00000008) != 0);
3128 return maxNumberOfConsecutiveFailingOptimizerCalls_;
3145 maxNumberOfConsecutiveFailingOptimizerCalls_ = value;
3146 bitField0_ |= 0x00000008;
3163 bitField0_ = (bitField0_ & ~0x00000008);
3164 maxNumberOfConsecutiveFailingOptimizerCalls_ = 0;
3169 private double relativeGapLimit_ = 0.0001D;
3184 return ((bitField0_ & 0x00000010) != 0);
3200 return relativeGapLimit_;
3217 relativeGapLimit_ = value;
3218 bitField0_ |= 0x00000010;
3235 bitField0_ = (bitField0_ & ~0x00000010);
3236 relativeGapLimit_ = 0.0001D;
3241 private int maxNumDecisionsInLs_ = 4;
3253 return ((bitField0_ & 0x00000020) != 0);
3266 return maxNumDecisionsInLs_;
3280 maxNumDecisionsInLs_ = value;
3281 bitField0_ |= 0x00000020;
3295 bitField0_ = (bitField0_ & ~0x00000020);
3296 maxNumDecisionsInLs_ = 4;
3301 private int maxNumBrokenConstraintsInLs_ = 2147483647;
3314 return ((bitField0_ & 0x00000040) != 0);
3328 return maxNumBrokenConstraintsInLs_;
3343 maxNumBrokenConstraintsInLs_ = value;
3344 bitField0_ |= 0x00000040;
3359 bitField0_ = (bitField0_ & ~0x00000040);
3360 maxNumBrokenConstraintsInLs_ = 2147483647;
3365 private boolean logSearchProgress_ ;
3376 return ((bitField0_ & 0x00000080) != 0);
3388 return logSearchProgress_;
3401 logSearchProgress_ = value;
3402 bitField0_ |= 0x00000080;
3415 bitField0_ = (bitField0_ & ~0x00000080);
3416 logSearchProgress_ =
false;
3421 private boolean computeEstimatedImpact_ =
true;
3432 return ((bitField0_ & 0x00000100) != 0);
3444 return computeEstimatedImpact_;
3457 computeEstimatedImpact_ = value;
3458 bitField0_ |= 0x00000100;
3471 bitField0_ = (bitField0_ & ~0x00000100);
3472 computeEstimatedImpact_ =
true;
3477 private boolean pruneSearchTree_ ;
3488 return ((bitField0_ & 0x00000200) != 0);
3500 return pruneSearchTree_;
3513 pruneSearchTree_ = value;
3514 bitField0_ |= 0x00000200;
3527 bitField0_ = (bitField0_ & ~0x00000200);
3528 pruneSearchTree_ =
false;
3533 private boolean sortConstraintsByNumTerms_ ;
3545 return ((bitField0_ & 0x00000400) != 0);
3558 return sortConstraintsByNumTerms_;
3572 sortConstraintsByNumTerms_ = value;
3573 bitField0_ |= 0x00000400;
3587 bitField0_ = (bitField0_ & ~0x00000400);
3588 sortConstraintsByNumTerms_ =
false;
3593 private boolean useRandomLns_ =
true;
3604 return ((bitField0_ & 0x00000800) != 0);
3616 return useRandomLns_;
3629 useRandomLns_ = value;
3630 bitField0_ |= 0x00000800;
3643 bitField0_ = (bitField0_ & ~0x00000800);
3644 useRandomLns_ =
true;
3649 private int randomSeed_ = 8;
3664 return ((bitField0_ & 0x00001000) != 0);
3697 randomSeed_ = value;
3698 bitField0_ |= 0x00001000;
3715 bitField0_ = (bitField0_ & ~0x00001000);
3721 private int numRelaxedVars_ = 10;
3732 return ((bitField0_ & 0x00002000) != 0);
3744 return numRelaxedVars_;
3757 numRelaxedVars_ = value;
3758 bitField0_ |= 0x00002000;
3771 bitField0_ = (bitField0_ & ~0x00002000);
3772 numRelaxedVars_ = 10;
3777 private int maxNumberOfConflictsInRandomLns_ = 2500;
3789 return ((bitField0_ & 0x00004000) != 0);
3802 return maxNumberOfConflictsInRandomLns_;
3816 maxNumberOfConflictsInRandomLns_ = value;
3817 bitField0_ |= 0x00004000;
3831 bitField0_ = (bitField0_ & ~0x00004000);
3832 maxNumberOfConflictsInRandomLns_ = 2500;
3837 private int numRandomLnsTries_ = 1;
3848 return ((bitField0_ & 0x00008000) != 0);
3860 return numRandomLnsTries_;
3873 numRandomLnsTries_ = value;
3874 bitField0_ |= 0x00008000;
3887 bitField0_ = (bitField0_ & ~0x00008000);
3888 numRandomLnsTries_ = 1;
3893 private long maxNumberOfBacktracksInLs_ = 100000000L;
3905 return ((bitField0_ & 0x00010000) != 0);
3918 return maxNumberOfBacktracksInLs_;
3932 maxNumberOfBacktracksInLs_ = value;
3933 bitField0_ |= 0x00010000;
3947 bitField0_ = (bitField0_ & ~0x00010000);
3948 maxNumberOfBacktracksInLs_ = 100000000L;
3953 private boolean useLpLns_ =
true;
3964 return ((bitField0_ & 0x00020000) != 0);
3990 bitField0_ |= 0x00020000;
4003 bitField0_ = (bitField0_ & ~0x00020000);
4009 private boolean useSatToChooseLnsNeighbourhood_ =
true;
4020 return ((bitField0_ & 0x00040000) != 0);
4032 return useSatToChooseLnsNeighbourhood_;
4045 useSatToChooseLnsNeighbourhood_ = value;
4046 bitField0_ |= 0x00040000;
4059 bitField0_ = (bitField0_ & ~0x00040000);
4060 useSatToChooseLnsNeighbourhood_ =
true;
4065 private int maxNumberOfConflictsForQuickCheck_ = 10;
4077 return ((bitField0_ & 0x00080000) != 0);
4090 return maxNumberOfConflictsForQuickCheck_;
4104 maxNumberOfConflictsForQuickCheck_ = value;
4105 bitField0_ |= 0x00080000;
4119 bitField0_ = (bitField0_ & ~0x00080000);
4120 maxNumberOfConflictsForQuickCheck_ = 10;
4125 private boolean useSymmetry_ ;
4140 return ((bitField0_ & 0x00100000) != 0);
4156 return useSymmetry_;
4173 useSymmetry_ = value;
4174 bitField0_ |= 0x00100000;
4191 bitField0_ = (bitField0_ & ~0x00100000);
4192 useSymmetry_ =
false;
4197 private boolean exploitSymmetryInSatFirstSolution_ ;
4212 return ((bitField0_ & 0x00200000) != 0);
4228 return exploitSymmetryInSatFirstSolution_;
4245 exploitSymmetryInSatFirstSolution_ = value;
4246 bitField0_ |= 0x00200000;
4263 bitField0_ = (bitField0_ & ~0x00200000);
4264 exploitSymmetryInSatFirstSolution_ =
false;
4269 private int maxNumberOfConflictsInRandomSolutionGeneration_ = 500;
4280 return ((bitField0_ & 0x00400000) != 0);
4292 return maxNumberOfConflictsInRandomSolutionGeneration_;
4305 maxNumberOfConflictsInRandomSolutionGeneration_ = value;
4306 bitField0_ |= 0x00400000;
4319 bitField0_ = (bitField0_ & ~0x00400000);
4320 maxNumberOfConflictsInRandomSolutionGeneration_ = 500;
4325 private long maxNumberOfExploredAssignmentsPerTryInLs_ = 10000L;
4339 return ((bitField0_ & 0x00800000) != 0);
4354 return maxNumberOfExploredAssignmentsPerTryInLs_;
4370 maxNumberOfExploredAssignmentsPerTryInLs_ = value;
4371 bitField0_ |= 0x00800000;
4387 bitField0_ = (bitField0_ & ~0x00800000);
4388 maxNumberOfExploredAssignmentsPerTryInLs_ = 10000L;
4393 private boolean useTranspositionTableInLs_ =
true;
4407 return ((bitField0_ & 0x01000000) != 0);
4422 return useTranspositionTableInLs_;
4438 useTranspositionTableInLs_ = value;
4439 bitField0_ |= 0x01000000;
4455 bitField0_ = (bitField0_ & ~0x01000000);
4456 useTranspositionTableInLs_ =
true;
4461 private boolean usePotentialOneFlipRepairsInLs_ ;
4474 return ((bitField0_ & 0x02000000) != 0);
4488 return usePotentialOneFlipRepairsInLs_;
4503 usePotentialOneFlipRepairsInLs_ = value;
4504 bitField0_ |= 0x02000000;
4519 bitField0_ = (bitField0_ & ~0x02000000);
4520 usePotentialOneFlipRepairsInLs_ =
false;
4525 private boolean useLearnedBinaryClausesInLp_ =
true;
4536 return ((bitField0_ & 0x04000000) != 0);
4548 return useLearnedBinaryClausesInLp_;
4561 useLearnedBinaryClausesInLp_ = value;
4562 bitField0_ |= 0x04000000;
4575 bitField0_ = (bitField0_ & ~0x04000000);
4576 useLearnedBinaryClausesInLp_ =
true;
4581 private int numberOfSolvers_ = 1;
4594 return ((bitField0_ & 0x08000000) != 0);
4608 return numberOfSolvers_;
4623 numberOfSolvers_ = value;
4624 bitField0_ |= 0x08000000;
4639 bitField0_ = (bitField0_ & ~0x08000000);
4640 numberOfSolvers_ = 1;
4645 private int synchronizationType_ = 0;
4651 return ((bitField0_ & 0x10000000) != 0);
4668 if (value ==
null) {
throw new NullPointerException(); }
4669 bitField0_ |= 0x10000000;
4670 synchronizationType_ = value.getNumber();
4679 bitField0_ = (bitField0_ & ~0x10000000);
4680 synchronizationType_ = 0;
4685 private java.util.List<com.google.ortools.bop.BopSolverOptimizerSet> solverOptimizerSets_ =
4686 java.util.Collections.emptyList();
4687 private void ensureSolverOptimizerSetsIsMutable() {
4688 if (!((bitField0_ & 0x20000000) != 0)) {
4689 solverOptimizerSets_ =
new java.util.ArrayList<com.google.ortools.bop.BopSolverOptimizerSet>(solverOptimizerSets_);
4690 bitField0_ |= 0x20000000;
4694 private com.google.protobuf.RepeatedFieldBuilder<
4695 com.google.ortools.bop.BopSolverOptimizerSet, com.google.ortools.bop.BopSolverOptimizerSet.Builder, com.google.ortools.bop.BopSolverOptimizerSetOrBuilder> solverOptimizerSetsBuilder_;
4708 if (solverOptimizerSetsBuilder_ ==
null) {
4709 return java.util.Collections.unmodifiableList(solverOptimizerSets_);
4711 return solverOptimizerSetsBuilder_.getMessageList();
4725 if (solverOptimizerSetsBuilder_ ==
null) {
4726 return solverOptimizerSets_.size();
4728 return solverOptimizerSetsBuilder_.getCount();
4742 if (solverOptimizerSetsBuilder_ ==
null) {
4743 return solverOptimizerSets_.get(index);
4745 return solverOptimizerSetsBuilder_.getMessage(index);
4759 int index, com.google.ortools.bop.BopSolverOptimizerSet value) {
4760 if (solverOptimizerSetsBuilder_ ==
null) {
4761 if (value ==
null) {
4762 throw new NullPointerException();
4764 ensureSolverOptimizerSetsIsMutable();
4765 solverOptimizerSets_.set(index, value);
4768 solverOptimizerSetsBuilder_.setMessage(index, value);
4783 int index, com.google.ortools.bop.BopSolverOptimizerSet.Builder builderForValue) {
4784 if (solverOptimizerSetsBuilder_ ==
null) {
4785 ensureSolverOptimizerSetsIsMutable();
4786 solverOptimizerSets_.set(index, builderForValue.build());
4789 solverOptimizerSetsBuilder_.setMessage(index, builderForValue.build());
4804 if (solverOptimizerSetsBuilder_ ==
null) {
4805 if (value ==
null) {
4806 throw new NullPointerException();
4808 ensureSolverOptimizerSetsIsMutable();
4809 solverOptimizerSets_.add(value);
4812 solverOptimizerSetsBuilder_.addMessage(value);
4827 int index, com.google.ortools.bop.BopSolverOptimizerSet value) {
4828 if (solverOptimizerSetsBuilder_ ==
null) {
4829 if (value ==
null) {
4830 throw new NullPointerException();
4832 ensureSolverOptimizerSetsIsMutable();
4833 solverOptimizerSets_.add(index, value);
4836 solverOptimizerSetsBuilder_.addMessage(index, value);
4851 com.google.ortools.bop.BopSolverOptimizerSet.Builder builderForValue) {
4852 if (solverOptimizerSetsBuilder_ ==
null) {
4853 ensureSolverOptimizerSetsIsMutable();
4854 solverOptimizerSets_.add(builderForValue.build());
4857 solverOptimizerSetsBuilder_.addMessage(builderForValue.build());
4872 int index, com.google.ortools.bop.BopSolverOptimizerSet.Builder builderForValue) {
4873 if (solverOptimizerSetsBuilder_ ==
null) {
4874 ensureSolverOptimizerSetsIsMutable();
4875 solverOptimizerSets_.add(index, builderForValue.build());
4878 solverOptimizerSetsBuilder_.addMessage(index, builderForValue.build());
4893 java.lang.Iterable<? extends com.google.ortools.bop.BopSolverOptimizerSet> values) {
4894 if (solverOptimizerSetsBuilder_ ==
null) {
4895 ensureSolverOptimizerSetsIsMutable();
4896 com.google.protobuf.AbstractMessageLite.Builder.addAll(
4897 values, solverOptimizerSets_);
4900 solverOptimizerSetsBuilder_.addAllMessages(values);
4915 if (solverOptimizerSetsBuilder_ ==
null) {
4916 solverOptimizerSets_ = java.util.Collections.emptyList();
4917 bitField0_ = (bitField0_ & ~0x20000000);
4920 solverOptimizerSetsBuilder_.clear();
4935 if (solverOptimizerSetsBuilder_ ==
null) {
4936 ensureSolverOptimizerSetsIsMutable();
4937 solverOptimizerSets_.remove(index);
4940 solverOptimizerSetsBuilder_.remove(index);
4956 return internalGetSolverOptimizerSetsFieldBuilder().getBuilder(index);
4970 if (solverOptimizerSetsBuilder_ ==
null) {
4971 return solverOptimizerSets_.get(index); }
else {
4972 return solverOptimizerSetsBuilder_.getMessageOrBuilder(index);
4985 public java.util.List<? extends com.google.ortools.bop.BopSolverOptimizerSetOrBuilder>
4987 if (solverOptimizerSetsBuilder_ !=
null) {
4988 return solverOptimizerSetsBuilder_.getMessageOrBuilderList();
4990 return java.util.Collections.unmodifiableList(solverOptimizerSets_);
5004 return internalGetSolverOptimizerSetsFieldBuilder().addBuilder(
5005 com.google.ortools.bop.BopSolverOptimizerSet.getDefaultInstance());
5019 return internalGetSolverOptimizerSetsFieldBuilder().addBuilder(
5020 index, com.google.ortools.bop.BopSolverOptimizerSet.getDefaultInstance());
5032 public java.util.List<com.google.ortools.bop.BopSolverOptimizerSet.Builder>
5034 return internalGetSolverOptimizerSetsFieldBuilder().getBuilderList();
5036 private com.google.protobuf.RepeatedFieldBuilder<
5037 com.google.ortools.bop.BopSolverOptimizerSet, com.google.ortools.bop.BopSolverOptimizerSet.Builder, com.google.ortools.bop.BopSolverOptimizerSetOrBuilder>
5038 internalGetSolverOptimizerSetsFieldBuilder() {
5039 if (solverOptimizerSetsBuilder_ ==
null) {
5040 solverOptimizerSetsBuilder_ =
new com.google.protobuf.RepeatedFieldBuilder<
5041 com.google.ortools.bop.BopSolverOptimizerSet, com.google.ortools.bop.BopSolverOptimizerSet.Builder, com.google.ortools.bop.BopSolverOptimizerSetOrBuilder>(
5042 solverOptimizerSets_,
5043 ((bitField0_ & 0x20000000) != 0),
5044 getParentForChildren(),
5046 solverOptimizerSets_ =
null;
5048 return solverOptimizerSetsBuilder_;
5051 private java.lang.Object defaultSolverOptimizerSets_ =
"methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } ";
5057 return ((bitField0_ & 0x40000000) != 0);
5064 java.lang.Object ref = defaultSolverOptimizerSets_;
5065 if (!(ref instanceof java.lang.String)) {
5066 com.google.protobuf.ByteString bs =
5067 (com.google.protobuf.ByteString) ref;
5068 java.lang.String s = bs.toStringUtf8();
5069 if (bs.isValidUtf8()) {
5070 defaultSolverOptimizerSets_ = s;
5074 return (java.lang.String) ref;
5081 public com.google.protobuf.ByteString
5083 java.lang.Object ref = defaultSolverOptimizerSets_;
5084 if (ref instanceof String) {
5085 com.google.protobuf.ByteString b =
5086 com.google.protobuf.ByteString.copyFromUtf8(
5087 (java.lang.String) ref);
5088 defaultSolverOptimizerSets_ = b;
5091 return (com.google.protobuf.ByteString) ref;
5100 java.lang.String value) {
5101 if (value ==
null) {
throw new NullPointerException(); }
5102 defaultSolverOptimizerSets_ = value;
5103 bitField0_ |= 0x40000000;
5113 bitField0_ = (bitField0_ & ~0x40000000);
5123 com.google.protobuf.ByteString value) {
5124 if (value ==
null) {
throw new NullPointerException(); }
5125 defaultSolverOptimizerSets_ = value;
5126 bitField0_ |= 0x40000000;
5131 private boolean useLpStrongBranching_ ;
5150 return ((bitField0_ & 0x80000000) != 0);
5170 return useLpStrongBranching_;
5191 useLpStrongBranching_ = value;
5192 bitField0_ |= 0x80000000;
5213 bitField0_ = (bitField0_ & ~0x80000000);
5214 useLpStrongBranching_ =
false;
5219 private int decomposerNumVariablesThreshold_ = 50;
5231 return ((bitField1_ & 0x00000001) != 0);
5244 return decomposerNumVariablesThreshold_;
5258 decomposerNumVariablesThreshold_ = value;
5259 bitField1_ |= 0x00000001;
5273 bitField1_ = (bitField1_ & ~0x00000001);
5274 decomposerNumVariablesThreshold_ = 50;
5279 private int numBopSolversUsedByDecomposition_ = 1;
5292 return ((bitField1_ & 0x00000002) != 0);
5306 return numBopSolversUsedByDecomposition_;
5321 numBopSolversUsedByDecomposition_ = value;
5322 bitField1_ |= 0x00000002;
5337 bitField1_ = (bitField1_ & ~0x00000002);
5338 numBopSolversUsedByDecomposition_ = 1;
5343 private double decomposedProblemMinTimeInSeconds_ ;
5357 return ((bitField1_ & 0x00000004) != 0);
5372 return decomposedProblemMinTimeInSeconds_;
5388 decomposedProblemMinTimeInSeconds_ = value;
5389 bitField1_ |= 0x00000004;
5405 bitField1_ = (bitField1_ & ~0x00000004);
5406 decomposedProblemMinTimeInSeconds_ = 0D;
5411 private int guidedSatConflictsChunk_ = 1000;
5424 return ((bitField1_ & 0x00000008) != 0);
5438 return guidedSatConflictsChunk_;
5453 guidedSatConflictsChunk_ = value;
5454 bitField1_ |= 0x00000008;
5469 bitField1_ = (bitField1_ & ~0x00000008);
5470 guidedSatConflictsChunk_ = 1000;
5475 private int maxLpSolveForFeasibilityProblems_ ;
5489 return ((bitField1_ & 0x00000010) != 0);
5504 return maxLpSolveForFeasibilityProblems_;
5520 maxLpSolveForFeasibilityProblems_ = value;
5521 bitField1_ |= 0x00000010;
5537 bitField1_ = (bitField1_ & ~0x00000010);
5538 maxLpSolveForFeasibilityProblems_ = 0;
5549 DEFAULT_INSTANCE =
new com.google.ortools.bop.BopParameters();
5553 return DEFAULT_INSTANCE;
5556 private static final com.google.protobuf.Parser<
BopParameters>
5557 PARSER =
new com.google.protobuf.AbstractParser<
BopParameters>() {
5560 com.google.protobuf.CodedInputStream input,
5561 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
5562 throws com.google.protobuf.InvalidProtocolBufferException {
5565 builder.mergeFrom(input, extensionRegistry);
5566 }
catch (com.google.protobuf.InvalidProtocolBufferException e) {
5567 throw e.setUnfinishedMessage(builder.buildPartial());
5568 }
catch (com.google.protobuf.UninitializedMessageException e) {
5569 throw e.asInvalidProtocolBufferException().setUnfinishedMessage(builder.buildPartial());
5570 }
catch (java.io.IOException e) {
5571 throw new com.google.protobuf.InvalidProtocolBufferException(e)
5572 .setUnfinishedMessage(builder.buildPartial());
5574 return builder.buildPartial();
5578 public static com.google.protobuf.Parser<BopParameters>
parser() {
5589 return DEFAULT_INSTANCE;