5package com.google.ortools.glop;
15 com.google.protobuf.GeneratedMessage implements
18private static final long serialVersionUID = 0L;
20 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
21 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
29 private GlopParameters(com.google.protobuf.GeneratedMessage.Builder<?> builder) {
35 optimizationRule_ = 1;
36 refactorizationThreshold_ = 1e-09D;
37 recomputeReducedCostsThreshold_ = 1e-08D;
38 recomputeEdgesNormThreshold_ = 100D;
39 primalFeasibilityTolerance_ = 1e-08D;
40 dualFeasibilityTolerance_ = 1e-08D;
41 ratioTestZeroThreshold_ = 1e-09D;
42 harrisToleranceRatio_ = 0.5D;
43 smallPivotThreshold_ = 1e-06D;
44 minimumAcceptablePivot_ = 1e-06D;
45 dropTolerance_ = 1e-14D;
49 useTransposedMatrix_ =
true;
50 basisRefactorizationPeriod_ = 64;
51 dynamicallyAdjustRefactorizationPeriod_ =
true;
52 solveDualProblem_ = 2;
53 dualizerThreshold_ = 1.5D;
54 solutionFeasibilityTolerance_ = 1e-06D;
55 provideStrongOptimalGuarantee_ =
true;
56 changeStatusToImprecise_ =
true;
57 maxNumberOfReoptimizations_ = 40D;
58 luFactorizationPivotThreshold_ = 0.01D;
59 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
60 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
61 maxNumberOfIterations_ = -1L;
62 markowitzZlatevParameter_ = 3;
63 markowitzSingularityThreshold_ = 1e-15D;
64 devexWeightsResetPeriod_ = 150;
65 usePreprocessing_ =
true;
66 useMiddleProductFormUpdate_ =
true;
67 initializeDevexWithColumnNorms_ =
true;
68 exploitSingletonColumnInInitialBasis_ =
true;
69 dualSmallPivotThreshold_ = 0.0001D;
70 preprocessorZeroTolerance_ = 1e-09D;
71 objectiveLowerLimit_ = Double.NEGATIVE_INFINITY;
72 objectiveUpperLimit_ = Double.POSITIVE_INFINITY;
73 degenerateMinistepFactor_ = 0.01D;
76 useDedicatedDualFeasibilityAlgorithm_ =
true;
77 relativeCostPerturbation_ = 1e-05D;
78 relativeMaxCostPerturbation_ = 1e-07D;
79 initialConditionNumberThreshold_ = 1e+50D;
81 crossoverBoundSnappingDistance_ = Double.POSITIVE_INFINITY;
83 useImpliedFreePreprocessor_ =
true;
84 maxValidMagnitude_ = 1e+30D;
85 dropMagnitude_ = 1e-30D;
88 public static final com.google.protobuf.Descriptors.Descriptor
90 return com.google.ortools.glop.Parameters.internal_static_operations_research_glop_GlopParameters_descriptor;
94 protected com.google.protobuf.GeneratedMessage.FieldAccessorTable
96 return com.google.ortools.glop.Parameters.internal_static_operations_research_glop_GlopParameters_fieldAccessorTable
97 .ensureFieldAccessorsInitialized(
98 com.google.ortools.glop.GlopParameters.class, com.google.ortools.glop.GlopParameters.Builder.class);
113 implements com.google.protobuf.ProtocolMessageEnum {
129 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
130 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
140 public static final int DEFAULT_VALUE = 0;
144 public static final int EQUILIBRATION_VALUE = 1;
148 public static final int LINEAR_PROGRAM_VALUE = 2;
160 @java.lang.Deprecated
162 return forNumber(value);
171 case 0:
return DEFAULT;
172 case 1:
return EQUILIBRATION;
173 case 2:
return LINEAR_PROGRAM;
174 default:
return null;
180 return internalValueMap;
182 private static final com.google.protobuf.Internal.EnumLiteMap<
190 public final com.google.protobuf.Descriptors.EnumValueDescriptor
194 public final com.google.protobuf.Descriptors.EnumDescriptor
198 public static final com.google.protobuf.Descriptors.EnumDescriptor
200 return com.google.ortools.glop.GlopParameters.getDescriptor().getEnumTypes().get(0);
206 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
208 throw new java.lang.IllegalArgumentException(
209 "EnumValueDescriptor is not for this type.");
211 return VALUES[desc.getIndex()];
214 private final int value;
232 implements com.google.protobuf.ProtocolMessageEnum {
248 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
249 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
259 public static final int ALWAYS_DO_VALUE = 0;
263 public static final int NEVER_DO_VALUE = 1;
267 public static final int LET_SOLVER_DECIDE_VALUE = 2;
279 @java.lang.Deprecated
281 return forNumber(value);
290 case 0:
return ALWAYS_DO;
291 case 1:
return NEVER_DO;
292 case 2:
return LET_SOLVER_DECIDE;
293 default:
return null;
297 public static com.google.protobuf.Internal.EnumLiteMap<
SolverBehavior>
299 return internalValueMap;
301 private static final com.google.protobuf.Internal.EnumLiteMap<
309 public final com.google.protobuf.Descriptors.EnumValueDescriptor
313 public final com.google.protobuf.Descriptors.EnumDescriptor
317 public static final com.google.protobuf.Descriptors.EnumDescriptor
319 return com.google.ortools.glop.GlopParameters.getDescriptor().getEnumTypes().get(1);
325 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
327 throw new java.lang.IllegalArgumentException(
328 "EnumValueDescriptor is not for this type.");
330 return VALUES[desc.getIndex()];
333 private final int value;
350 implements com.google.protobuf.ProtocolMessageEnum {
386 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
387 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
406 public static final int DANTZIG_VALUE = 0;
416 public static final int STEEPEST_EDGE_VALUE = 1;
425 public static final int DEVEX_VALUE = 2;
437 @java.lang.Deprecated
439 return forNumber(value);
448 case 0:
return DANTZIG;
449 case 1:
return STEEPEST_EDGE;
450 case 2:
return DEVEX;
451 default:
return null;
455 public static com.google.protobuf.Internal.EnumLiteMap<
PricingRule>
457 return internalValueMap;
459 private static final com.google.protobuf.Internal.EnumLiteMap<
461 new com.google.protobuf.Internal.EnumLiteMap<
PricingRule>() {
467 public final com.google.protobuf.Descriptors.EnumValueDescriptor
471 public final com.google.protobuf.Descriptors.EnumDescriptor
475 public static final com.google.protobuf.Descriptors.EnumDescriptor
477 return com.google.ortools.glop.GlopParameters.getDescriptor().getEnumTypes().get(2);
480 private static final PricingRule[] VALUES = values();
483 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
485 throw new java.lang.IllegalArgumentException(
486 "EnumValueDescriptor is not for this type.");
488 return VALUES[desc.getIndex()];
491 private final int value;
509 implements com.google.protobuf.ProtocolMessageEnum {
556 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
557 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
571 public static final int NONE_VALUE = 0;
584 public static final int BIXBY_VALUE = 1;
596 public static final int TRIANGULAR_VALUE = 2;
606 public static final int MAROS_VALUE = 3;
618 @java.lang.Deprecated
620 return forNumber(value);
630 case 1:
return BIXBY;
631 case 2:
return TRIANGULAR;
632 case 3:
return MAROS;
633 default:
return null;
639 return internalValueMap;
641 private static final com.google.protobuf.Internal.EnumLiteMap<
649 public final com.google.protobuf.Descriptors.EnumValueDescriptor
653 public final com.google.protobuf.Descriptors.EnumDescriptor
657 public static final com.google.protobuf.Descriptors.EnumDescriptor
659 return com.google.ortools.glop.GlopParameters.getDescriptor().getEnumTypes().get(3);
665 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
667 throw new java.lang.IllegalArgumentException(
668 "EnumValueDescriptor is not for this type.");
670 return VALUES[desc.getIndex()];
673 private final int value;
694 implements com.google.protobuf.ProtocolMessageEnum {
732 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
733 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
747 public static final int NO_COST_SCALING_VALUE = 0;
757 public static final int CONTAIN_ONE_COST_SCALING_VALUE = 1;
765 public static final int MEAN_COST_SCALING_VALUE = 2;
773 public static final int MEDIAN_COST_SCALING_VALUE = 3;
785 @java.lang.Deprecated
787 return forNumber(value);
796 case 0:
return NO_COST_SCALING;
797 case 1:
return CONTAIN_ONE_COST_SCALING;
798 case 2:
return MEAN_COST_SCALING;
799 case 3:
return MEDIAN_COST_SCALING;
800 default:
return null;
806 return internalValueMap;
808 private static final com.google.protobuf.Internal.EnumLiteMap<
816 public final com.google.protobuf.Descriptors.EnumValueDescriptor
820 public final com.google.protobuf.Descriptors.EnumDescriptor
824 public static final com.google.protobuf.Descriptors.EnumDescriptor
826 return com.google.ortools.glop.GlopParameters.getDescriptor().getEnumTypes().get(4);
832 com.google.protobuf.Descriptors.EnumValueDescriptor desc) {
834 throw new java.lang.IllegalArgumentException(
835 "EnumValueDescriptor is not for this type.");
837 return VALUES[desc.getIndex()];
840 private final int value;
849 private int bitField0_;
850 private int bitField1_;
852 private int scalingMethod_ = 1;
858 return ((bitField0_ & 0x00000001) != 0);
866 return result ==
null ? com.google.ortools.glop.GlopParameters.ScalingAlgorithm.EQUILIBRATION : result;
870 private int feasibilityRule_ = 1;
880 return ((bitField0_ & 0x00000002) != 0);
892 return result ==
null ? com.google.ortools.glop.GlopParameters.PricingRule.STEEPEST_EDGE : result;
896 private int optimizationRule_ = 1;
906 return ((bitField0_ & 0x00000004) != 0);
918 return result ==
null ? com.google.ortools.glop.GlopParameters.PricingRule.STEEPEST_EDGE : result;
922 private double refactorizationThreshold_ = 1e-09D;
938 return ((bitField0_ & 0x00000008) != 0);
955 return refactorizationThreshold_;
959 private double recomputeReducedCostsThreshold_ = 1e-08D;
974 return ((bitField0_ & 0x00000010) != 0);
990 return recomputeReducedCostsThreshold_;
994 private double recomputeEdgesNormThreshold_ = 100D;
1009 return ((bitField0_ & 0x00000020) != 0);
1025 return recomputeEdgesNormThreshold_;
1029 private double primalFeasibilityTolerance_ = 1e-08D;
1046 return ((bitField0_ & 0x00000040) != 0);
1064 return primalFeasibilityTolerance_;
1068 private double dualFeasibilityTolerance_ = 1e-08D;
1088 return ((bitField0_ & 0x00000080) != 0);
1109 return dualFeasibilityTolerance_;
1113 private double ratioTestZeroThreshold_ = 1e-09D;
1130 return ((bitField0_ & 0x00000100) != 0);
1148 return ratioTestZeroThreshold_;
1152 private double harrisToleranceRatio_ = 0.5D;
1173 return ((bitField0_ & 0x00000200) != 0);
1195 return harrisToleranceRatio_;
1199 private double smallPivotThreshold_ = 1e-06D;
1213 return ((bitField0_ & 0x00000400) != 0);
1228 return smallPivotThreshold_;
1232 private double minimumAcceptablePivot_ = 1e-06D;
1243 return ((bitField0_ & 0x00000800) != 0);
1255 return minimumAcceptablePivot_;
1259 private double dropTolerance_ = 1e-14D;
1272 return ((bitField0_ & 0x00001000) != 0);
1286 return dropTolerance_;
1290 private boolean useScaling_ =
true;
1302 return ((bitField0_ & 0x00002000) != 0);
1319 private int costScaling_ = 1;
1325 return ((bitField0_ & 0x00004000) != 0);
1333 return result ==
null ? com.google.ortools.glop.GlopParameters.CostScalingAlgorithm.CONTAIN_ONE_COST_SCALING : result;
1337 private int initialBasis_ = 2;
1348 return ((bitField0_ & 0x00008000) != 0);
1361 return result ==
null ? com.google.ortools.glop.GlopParameters.InitialBasisHeuristic.TRIANGULAR : result;
1365 private boolean useTransposedMatrix_ =
true;
1378 return ((bitField0_ & 0x00010000) != 0);
1392 return useTransposedMatrix_;
1396 private int basisRefactorizationPeriod_ = 64;
1409 return ((bitField0_ & 0x00020000) != 0);
1423 return basisRefactorizationPeriod_;
1427 private boolean dynamicallyAdjustRefactorizationPeriod_ =
true;
1442 return ((bitField0_ & 0x00040000) != 0);
1458 return dynamicallyAdjustRefactorizationPeriod_;
1462 private int solveDualProblem_ = 2;
1474 return ((bitField0_ & 0x00080000) != 0);
1488 return result ==
null ? com.google.ortools.glop.GlopParameters.SolverBehavior.LET_SOLVER_DECIDE : result;
1492 private double dualizerThreshold_ = 1.5D;
1505 return ((bitField0_ & 0x00100000) != 0);
1519 return dualizerThreshold_;
1523 private double solutionFeasibilityTolerance_ = 1e-06D;
1541 return ((bitField0_ & 0x00200000) != 0);
1560 return solutionFeasibilityTolerance_;
1564 private boolean provideStrongOptimalGuarantee_ =
true;
1592 return ((bitField0_ & 0x00400000) != 0);
1621 return provideStrongOptimalGuarantee_;
1625 private boolean changeStatusToImprecise_ =
true;
1637 return ((bitField0_ & 0x00800000) != 0);
1650 return changeStatusToImprecise_;
1654 private double maxNumberOfReoptimizations_ = 40D;
1668 return ((bitField0_ & 0x01000000) != 0);
1683 return maxNumberOfReoptimizations_;
1687 private double luFactorizationPivotThreshold_ = 0.01D;
1701 return ((bitField0_ & 0x02000000) != 0);
1716 return luFactorizationPivotThreshold_;
1720 private double maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
1731 return ((bitField0_ & 0x04000000) != 0);
1743 return maxTimeInSeconds_;
1747 private double maxDeterministicTime_ = Double.POSITIVE_INFINITY;
1762 return ((bitField0_ & 0x08000000) != 0);
1778 return maxDeterministicTime_;
1782 private long maxNumberOfIterations_ = -1L;
1794 return ((bitField0_ & 0x10000000) != 0);
1807 return maxNumberOfIterations_;
1811 private int markowitzZlatevParameter_ = 3;
1823 return ((bitField0_ & 0x20000000) != 0);
1836 return markowitzZlatevParameter_;
1840 private double markowitzSingularityThreshold_ = 1e-15D;
1854 return ((bitField0_ & 0x40000000) != 0);
1869 return markowitzSingularityThreshold_;
1873 private boolean useDualSimplex_ =
false;
1884 return ((bitField0_ & 0x80000000) != 0);
1896 return useDualSimplex_;
1900 private boolean allowSimplexAlgorithmChange_ =
false;
1914 return ((bitField1_ & 0x00000001) != 0);
1929 return allowSimplexAlgorithmChange_;
1933 private int devexWeightsResetPeriod_ = 150;
1944 return ((bitField1_ & 0x00000002) != 0);
1956 return devexWeightsResetPeriod_;
1960 private boolean usePreprocessing_ =
true;
1971 return ((bitField1_ & 0x00000004) != 0);
1983 return usePreprocessing_;
1987 private boolean useMiddleProductFormUpdate_ =
true;
2004 return ((bitField1_ & 0x00000008) != 0);
2022 return useMiddleProductFormUpdate_;
2026 private boolean initializeDevexWithColumnNorms_ =
true;
2038 return ((bitField1_ & 0x00000010) != 0);
2051 return initializeDevexWithColumnNorms_;
2055 private boolean exploitSingletonColumnInInitialBasis_ =
true;
2067 return ((bitField1_ & 0x00000020) != 0);
2080 return exploitSingletonColumnInInitialBasis_;
2084 private double dualSmallPivotThreshold_ = 0.0001D;
2097 return ((bitField1_ & 0x00000040) != 0);
2111 return dualSmallPivotThreshold_;
2115 private double preprocessorZeroTolerance_ = 1e-09D;
2131 return ((bitField1_ & 0x00000080) != 0);
2148 return preprocessorZeroTolerance_;
2152 private double objectiveLowerLimit_ = Double.NEGATIVE_INFINITY;
2171 return ((bitField1_ & 0x00000100) != 0);
2191 return objectiveLowerLimit_;
2195 private double objectiveUpperLimit_ = Double.POSITIVE_INFINITY;
2202 return ((bitField1_ & 0x00000200) != 0);
2210 return objectiveUpperLimit_;
2214 private double degenerateMinistepFactor_ = 0.01D;
2242 return ((bitField1_ & 0x00000400) != 0);
2271 return degenerateMinistepFactor_;
2275 private int randomSeed_ = 1;
2300 return ((bitField1_ & 0x00000800) != 0);
2330 private int numOmpThreads_ = 1;
2342 return ((bitField1_ & 0x00001000) != 0);
2355 return numOmpThreads_;
2359 private boolean perturbCostsInDualSimplex_ =
false;
2373 return ((bitField1_ & 0x00002000) != 0);
2388 return perturbCostsInDualSimplex_;
2392 private boolean useDedicatedDualFeasibilityAlgorithm_ =
true;
2410 return ((bitField1_ & 0x00004000) != 0);
2429 return useDedicatedDualFeasibilityAlgorithm_;
2433 private double relativeCostPerturbation_ = 1e-05D;
2447 return ((bitField1_ & 0x00008000) != 0);
2462 return relativeCostPerturbation_;
2466 private double relativeMaxCostPerturbation_ = 1e-07D;
2473 return ((bitField1_ & 0x00010000) != 0);
2481 return relativeMaxCostPerturbation_;
2485 private double initialConditionNumberThreshold_ = 1e+50D;
2498 return ((bitField1_ & 0x00020000) != 0);
2512 return initialConditionNumberThreshold_;
2516 private boolean logSearchProgress_ =
false;
2529 return ((bitField1_ & 0x00040000) != 0);
2543 return logSearchProgress_;
2547 private boolean logToStdout_ =
true;
2558 return ((bitField1_ & 0x00080000) != 0);
2570 return logToStdout_;
2574 private double crossoverBoundSnappingDistance_ = Double.POSITIVE_INFINITY;
2599 return ((bitField1_ & 0x00100000) != 0);
2625 return crossoverBoundSnappingDistance_;
2629 private boolean pushToVertex_ =
true;
2645 return ((bitField1_ & 0x00200000) != 0);
2662 return pushToVertex_;
2666 private boolean useImpliedFreePreprocessor_ =
true;
2677 return ((bitField1_ & 0x00400000) != 0);
2689 return useImpliedFreePreprocessor_;
2693 private double maxValidMagnitude_ = 1e+30D;
2709 return ((bitField1_ & 0x00800000) != 0);
2726 return maxValidMagnitude_;
2730 private double dropMagnitude_ = 1e-30D;
2744 return ((bitField1_ & 0x01000000) != 0);
2759 return dropMagnitude_;
2763 private boolean dualPricePrioritizeNorm_ =
false;
2775 return ((bitField1_ & 0x02000000) != 0);
2788 return dualPricePrioritizeNorm_;
2791 private byte memoizedIsInitialized = -1;
2798 memoizedIsInitialized = 1;
2803 public void writeTo(com.google.protobuf.CodedOutputStream output)
2804 throws java.io.IOException {
2805 if (((bitField0_ & 0x00000002) != 0)) {
2806 output.writeEnum(1, feasibilityRule_);
2808 if (((bitField0_ & 0x00000004) != 0)) {
2809 output.writeEnum(2, optimizationRule_);
2811 if (((bitField0_ & 0x00000008) != 0)) {
2812 output.writeDouble(6, refactorizationThreshold_);
2814 if (((bitField0_ & 0x00000010) != 0)) {
2815 output.writeDouble(8, recomputeReducedCostsThreshold_);
2817 if (((bitField0_ & 0x00000020) != 0)) {
2818 output.writeDouble(9, recomputeEdgesNormThreshold_);
2820 if (((bitField0_ & 0x00000040) != 0)) {
2821 output.writeDouble(10, primalFeasibilityTolerance_);
2823 if (((bitField0_ & 0x00000080) != 0)) {
2824 output.writeDouble(11, dualFeasibilityTolerance_);
2826 if (((bitField0_ & 0x00000100) != 0)) {
2827 output.writeDouble(12, ratioTestZeroThreshold_);
2829 if (((bitField0_ & 0x00000200) != 0)) {
2830 output.writeDouble(13, harrisToleranceRatio_);
2832 if (((bitField0_ & 0x00000400) != 0)) {
2833 output.writeDouble(14, smallPivotThreshold_);
2835 if (((bitField0_ & 0x00000800) != 0)) {
2836 output.writeDouble(15, minimumAcceptablePivot_);
2838 if (((bitField0_ & 0x00002000) != 0)) {
2839 output.writeBool(16, useScaling_);
2841 if (((bitField0_ & 0x00008000) != 0)) {
2842 output.writeEnum(17, initialBasis_);
2844 if (((bitField0_ & 0x00010000) != 0)) {
2845 output.writeBool(18, useTransposedMatrix_);
2847 if (((bitField0_ & 0x00020000) != 0)) {
2848 output.writeInt32(19, basisRefactorizationPeriod_);
2850 if (((bitField0_ & 0x00080000) != 0)) {
2851 output.writeEnum(20, solveDualProblem_);
2853 if (((bitField0_ & 0x00100000) != 0)) {
2854 output.writeDouble(21, dualizerThreshold_);
2856 if (((bitField0_ & 0x00200000) != 0)) {
2857 output.writeDouble(22, solutionFeasibilityTolerance_);
2859 if (((bitField0_ & 0x00400000) != 0)) {
2860 output.writeBool(24, provideStrongOptimalGuarantee_);
2862 if (((bitField0_ & 0x02000000) != 0)) {
2863 output.writeDouble(25, luFactorizationPivotThreshold_);
2865 if (((bitField0_ & 0x04000000) != 0)) {
2866 output.writeDouble(26, maxTimeInSeconds_);
2868 if (((bitField0_ & 0x10000000) != 0)) {
2869 output.writeInt64(27, maxNumberOfIterations_);
2871 if (((bitField0_ & 0x20000000) != 0)) {
2872 output.writeInt32(29, markowitzZlatevParameter_);
2874 if (((bitField0_ & 0x40000000) != 0)) {
2875 output.writeDouble(30, markowitzSingularityThreshold_);
2877 if (((bitField0_ & 0x80000000) != 0)) {
2878 output.writeBool(31, useDualSimplex_);
2880 if (((bitField1_ & 0x00000001) != 0)) {
2881 output.writeBool(32, allowSimplexAlgorithmChange_);
2883 if (((bitField1_ & 0x00000002) != 0)) {
2884 output.writeInt32(33, devexWeightsResetPeriod_);
2886 if (((bitField1_ & 0x00000004) != 0)) {
2887 output.writeBool(34, usePreprocessing_);
2889 if (((bitField1_ & 0x00000008) != 0)) {
2890 output.writeBool(35, useMiddleProductFormUpdate_);
2892 if (((bitField1_ & 0x00000010) != 0)) {
2893 output.writeBool(36, initializeDevexWithColumnNorms_);
2895 if (((bitField1_ & 0x00000020) != 0)) {
2896 output.writeBool(37, exploitSingletonColumnInInitialBasis_);
2898 if (((bitField1_ & 0x00000040) != 0)) {
2899 output.writeDouble(38, dualSmallPivotThreshold_);
2901 if (((bitField1_ & 0x00000080) != 0)) {
2902 output.writeDouble(39, preprocessorZeroTolerance_);
2904 if (((bitField1_ & 0x00000100) != 0)) {
2905 output.writeDouble(40, objectiveLowerLimit_);
2907 if (((bitField1_ & 0x00000200) != 0)) {
2908 output.writeDouble(41, objectiveUpperLimit_);
2910 if (((bitField1_ & 0x00000400) != 0)) {
2911 output.writeDouble(42, degenerateMinistepFactor_);
2913 if (((bitField1_ & 0x00000800) != 0)) {
2914 output.writeInt32(43, randomSeed_);
2916 if (((bitField1_ & 0x00001000) != 0)) {
2917 output.writeInt32(44, numOmpThreads_);
2919 if (((bitField0_ & 0x08000000) != 0)) {
2920 output.writeDouble(45, maxDeterministicTime_);
2922 if (((bitField0_ & 0x00001000) != 0)) {
2923 output.writeDouble(52, dropTolerance_);
2925 if (((bitField1_ & 0x00002000) != 0)) {
2926 output.writeBool(53, perturbCostsInDualSimplex_);
2928 if (((bitField1_ & 0x00008000) != 0)) {
2929 output.writeDouble(54, relativeCostPerturbation_);
2931 if (((bitField1_ & 0x00010000) != 0)) {
2932 output.writeDouble(55, relativeMaxCostPerturbation_);
2934 if (((bitField0_ & 0x01000000) != 0)) {
2935 output.writeDouble(56, maxNumberOfReoptimizations_);
2937 if (((bitField0_ & 0x00000001) != 0)) {
2938 output.writeEnum(57, scalingMethod_);
2940 if (((bitField0_ & 0x00800000) != 0)) {
2941 output.writeBool(58, changeStatusToImprecise_);
2943 if (((bitField1_ & 0x00020000) != 0)) {
2944 output.writeDouble(59, initialConditionNumberThreshold_);
2946 if (((bitField0_ & 0x00004000) != 0)) {
2947 output.writeEnum(60, costScaling_);
2949 if (((bitField1_ & 0x00040000) != 0)) {
2950 output.writeBool(61, logSearchProgress_);
2952 if (((bitField1_ & 0x00004000) != 0)) {
2953 output.writeBool(62, useDedicatedDualFeasibilityAlgorithm_);
2955 if (((bitField0_ & 0x00040000) != 0)) {
2956 output.writeBool(63, dynamicallyAdjustRefactorizationPeriod_);
2958 if (((bitField1_ & 0x00100000) != 0)) {
2959 output.writeDouble(64, crossoverBoundSnappingDistance_);
2961 if (((bitField1_ & 0x00200000) != 0)) {
2962 output.writeBool(65, pushToVertex_);
2964 if (((bitField1_ & 0x00080000) != 0)) {
2965 output.writeBool(66, logToStdout_);
2967 if (((bitField1_ & 0x00400000) != 0)) {
2968 output.writeBool(67, useImpliedFreePreprocessor_);
2970 if (((bitField1_ & 0x02000000) != 0)) {
2971 output.writeBool(69, dualPricePrioritizeNorm_);
2973 if (((bitField1_ & 0x00800000) != 0)) {
2974 output.writeDouble(70, maxValidMagnitude_);
2976 if (((bitField1_ & 0x01000000) != 0)) {
2977 output.writeDouble(71, dropMagnitude_);
2979 getUnknownFields().writeTo(output);
2984 int size = memoizedSize;
2985 if (size != -1)
return size;
2988 if (((bitField0_ & 0x00000002) != 0)) {
2989 size += com.google.protobuf.CodedOutputStream
2990 .computeEnumSize(1, feasibilityRule_);
2992 if (((bitField0_ & 0x00000004) != 0)) {
2993 size += com.google.protobuf.CodedOutputStream
2994 .computeEnumSize(2, optimizationRule_);
2996 if (((bitField0_ & 0x00000008) != 0)) {
2997 size += com.google.protobuf.CodedOutputStream
2998 .computeDoubleSize(6, refactorizationThreshold_);
3000 if (((bitField0_ & 0x00000010) != 0)) {
3001 size += com.google.protobuf.CodedOutputStream
3002 .computeDoubleSize(8, recomputeReducedCostsThreshold_);
3004 if (((bitField0_ & 0x00000020) != 0)) {
3005 size += com.google.protobuf.CodedOutputStream
3006 .computeDoubleSize(9, recomputeEdgesNormThreshold_);
3008 if (((bitField0_ & 0x00000040) != 0)) {
3009 size += com.google.protobuf.CodedOutputStream
3010 .computeDoubleSize(10, primalFeasibilityTolerance_);
3012 if (((bitField0_ & 0x00000080) != 0)) {
3013 size += com.google.protobuf.CodedOutputStream
3014 .computeDoubleSize(11, dualFeasibilityTolerance_);
3016 if (((bitField0_ & 0x00000100) != 0)) {
3017 size += com.google.protobuf.CodedOutputStream
3018 .computeDoubleSize(12, ratioTestZeroThreshold_);
3020 if (((bitField0_ & 0x00000200) != 0)) {
3021 size += com.google.protobuf.CodedOutputStream
3022 .computeDoubleSize(13, harrisToleranceRatio_);
3024 if (((bitField0_ & 0x00000400) != 0)) {
3025 size += com.google.protobuf.CodedOutputStream
3026 .computeDoubleSize(14, smallPivotThreshold_);
3028 if (((bitField0_ & 0x00000800) != 0)) {
3029 size += com.google.protobuf.CodedOutputStream
3030 .computeDoubleSize(15, minimumAcceptablePivot_);
3032 if (((bitField0_ & 0x00002000) != 0)) {
3033 size += com.google.protobuf.CodedOutputStream
3034 .computeBoolSize(16, useScaling_);
3036 if (((bitField0_ & 0x00008000) != 0)) {
3037 size += com.google.protobuf.CodedOutputStream
3038 .computeEnumSize(17, initialBasis_);
3040 if (((bitField0_ & 0x00010000) != 0)) {
3041 size += com.google.protobuf.CodedOutputStream
3042 .computeBoolSize(18, useTransposedMatrix_);
3044 if (((bitField0_ & 0x00020000) != 0)) {
3045 size += com.google.protobuf.CodedOutputStream
3046 .computeInt32Size(19, basisRefactorizationPeriod_);
3048 if (((bitField0_ & 0x00080000) != 0)) {
3049 size += com.google.protobuf.CodedOutputStream
3050 .computeEnumSize(20, solveDualProblem_);
3052 if (((bitField0_ & 0x00100000) != 0)) {
3053 size += com.google.protobuf.CodedOutputStream
3054 .computeDoubleSize(21, dualizerThreshold_);
3056 if (((bitField0_ & 0x00200000) != 0)) {
3057 size += com.google.protobuf.CodedOutputStream
3058 .computeDoubleSize(22, solutionFeasibilityTolerance_);
3060 if (((bitField0_ & 0x00400000) != 0)) {
3061 size += com.google.protobuf.CodedOutputStream
3062 .computeBoolSize(24, provideStrongOptimalGuarantee_);
3064 if (((bitField0_ & 0x02000000) != 0)) {
3065 size += com.google.protobuf.CodedOutputStream
3066 .computeDoubleSize(25, luFactorizationPivotThreshold_);
3068 if (((bitField0_ & 0x04000000) != 0)) {
3069 size += com.google.protobuf.CodedOutputStream
3070 .computeDoubleSize(26, maxTimeInSeconds_);
3072 if (((bitField0_ & 0x10000000) != 0)) {
3073 size += com.google.protobuf.CodedOutputStream
3074 .computeInt64Size(27, maxNumberOfIterations_);
3076 if (((bitField0_ & 0x20000000) != 0)) {
3077 size += com.google.protobuf.CodedOutputStream
3078 .computeInt32Size(29, markowitzZlatevParameter_);
3080 if (((bitField0_ & 0x40000000) != 0)) {
3081 size += com.google.protobuf.CodedOutputStream
3082 .computeDoubleSize(30, markowitzSingularityThreshold_);
3084 if (((bitField0_ & 0x80000000) != 0)) {
3085 size += com.google.protobuf.CodedOutputStream
3086 .computeBoolSize(31, useDualSimplex_);
3088 if (((bitField1_ & 0x00000001) != 0)) {
3089 size += com.google.protobuf.CodedOutputStream
3090 .computeBoolSize(32, allowSimplexAlgorithmChange_);
3092 if (((bitField1_ & 0x00000002) != 0)) {
3093 size += com.google.protobuf.CodedOutputStream
3094 .computeInt32Size(33, devexWeightsResetPeriod_);
3096 if (((bitField1_ & 0x00000004) != 0)) {
3097 size += com.google.protobuf.CodedOutputStream
3098 .computeBoolSize(34, usePreprocessing_);
3100 if (((bitField1_ & 0x00000008) != 0)) {
3101 size += com.google.protobuf.CodedOutputStream
3102 .computeBoolSize(35, useMiddleProductFormUpdate_);
3104 if (((bitField1_ & 0x00000010) != 0)) {
3105 size += com.google.protobuf.CodedOutputStream
3106 .computeBoolSize(36, initializeDevexWithColumnNorms_);
3108 if (((bitField1_ & 0x00000020) != 0)) {
3109 size += com.google.protobuf.CodedOutputStream
3110 .computeBoolSize(37, exploitSingletonColumnInInitialBasis_);
3112 if (((bitField1_ & 0x00000040) != 0)) {
3113 size += com.google.protobuf.CodedOutputStream
3114 .computeDoubleSize(38, dualSmallPivotThreshold_);
3116 if (((bitField1_ & 0x00000080) != 0)) {
3117 size += com.google.protobuf.CodedOutputStream
3118 .computeDoubleSize(39, preprocessorZeroTolerance_);
3120 if (((bitField1_ & 0x00000100) != 0)) {
3121 size += com.google.protobuf.CodedOutputStream
3122 .computeDoubleSize(40, objectiveLowerLimit_);
3124 if (((bitField1_ & 0x00000200) != 0)) {
3125 size += com.google.protobuf.CodedOutputStream
3126 .computeDoubleSize(41, objectiveUpperLimit_);
3128 if (((bitField1_ & 0x00000400) != 0)) {
3129 size += com.google.protobuf.CodedOutputStream
3130 .computeDoubleSize(42, degenerateMinistepFactor_);
3132 if (((bitField1_ & 0x00000800) != 0)) {
3133 size += com.google.protobuf.CodedOutputStream
3134 .computeInt32Size(43, randomSeed_);
3136 if (((bitField1_ & 0x00001000) != 0)) {
3137 size += com.google.protobuf.CodedOutputStream
3138 .computeInt32Size(44, numOmpThreads_);
3140 if (((bitField0_ & 0x08000000) != 0)) {
3141 size += com.google.protobuf.CodedOutputStream
3142 .computeDoubleSize(45, maxDeterministicTime_);
3144 if (((bitField0_ & 0x00001000) != 0)) {
3145 size += com.google.protobuf.CodedOutputStream
3146 .computeDoubleSize(52, dropTolerance_);
3148 if (((bitField1_ & 0x00002000) != 0)) {
3149 size += com.google.protobuf.CodedOutputStream
3150 .computeBoolSize(53, perturbCostsInDualSimplex_);
3152 if (((bitField1_ & 0x00008000) != 0)) {
3153 size += com.google.protobuf.CodedOutputStream
3154 .computeDoubleSize(54, relativeCostPerturbation_);
3156 if (((bitField1_ & 0x00010000) != 0)) {
3157 size += com.google.protobuf.CodedOutputStream
3158 .computeDoubleSize(55, relativeMaxCostPerturbation_);
3160 if (((bitField0_ & 0x01000000) != 0)) {
3161 size += com.google.protobuf.CodedOutputStream
3162 .computeDoubleSize(56, maxNumberOfReoptimizations_);
3164 if (((bitField0_ & 0x00000001) != 0)) {
3165 size += com.google.protobuf.CodedOutputStream
3166 .computeEnumSize(57, scalingMethod_);
3168 if (((bitField0_ & 0x00800000) != 0)) {
3169 size += com.google.protobuf.CodedOutputStream
3170 .computeBoolSize(58, changeStatusToImprecise_);
3172 if (((bitField1_ & 0x00020000) != 0)) {
3173 size += com.google.protobuf.CodedOutputStream
3174 .computeDoubleSize(59, initialConditionNumberThreshold_);
3176 if (((bitField0_ & 0x00004000) != 0)) {
3177 size += com.google.protobuf.CodedOutputStream
3178 .computeEnumSize(60, costScaling_);
3180 if (((bitField1_ & 0x00040000) != 0)) {
3181 size += com.google.protobuf.CodedOutputStream
3182 .computeBoolSize(61, logSearchProgress_);
3184 if (((bitField1_ & 0x00004000) != 0)) {
3185 size += com.google.protobuf.CodedOutputStream
3186 .computeBoolSize(62, useDedicatedDualFeasibilityAlgorithm_);
3188 if (((bitField0_ & 0x00040000) != 0)) {
3189 size += com.google.protobuf.CodedOutputStream
3190 .computeBoolSize(63, dynamicallyAdjustRefactorizationPeriod_);
3192 if (((bitField1_ & 0x00100000) != 0)) {
3193 size += com.google.protobuf.CodedOutputStream
3194 .computeDoubleSize(64, crossoverBoundSnappingDistance_);
3196 if (((bitField1_ & 0x00200000) != 0)) {
3197 size += com.google.protobuf.CodedOutputStream
3198 .computeBoolSize(65, pushToVertex_);
3200 if (((bitField1_ & 0x00080000) != 0)) {
3201 size += com.google.protobuf.CodedOutputStream
3202 .computeBoolSize(66, logToStdout_);
3204 if (((bitField1_ & 0x00400000) != 0)) {
3205 size += com.google.protobuf.CodedOutputStream
3206 .computeBoolSize(67, useImpliedFreePreprocessor_);
3208 if (((bitField1_ & 0x02000000) != 0)) {
3209 size += com.google.protobuf.CodedOutputStream
3210 .computeBoolSize(69, dualPricePrioritizeNorm_);
3212 if (((bitField1_ & 0x00800000) != 0)) {
3213 size += com.google.protobuf.CodedOutputStream
3214 .computeDoubleSize(70, maxValidMagnitude_);
3216 if (((bitField1_ & 0x01000000) != 0)) {
3217 size += com.google.protobuf.CodedOutputStream
3218 .computeDoubleSize(71, dropMagnitude_);
3220 size += getUnknownFields().getSerializedSize();
3221 memoizedSize = size;
3226 public boolean equals(
final java.lang.Object obj) {
3230 if (!(obj instanceof com.google.ortools.glop.GlopParameters)) {
3231 return super.equals(obj);
3237 if (scalingMethod_ != other.scalingMethod_)
return false;
3241 if (feasibilityRule_ != other.feasibilityRule_)
return false;
3245 if (optimizationRule_ != other.optimizationRule_)
return false;
3250 != java.lang.Double.doubleToLongBits(
3256 != java.lang.Double.doubleToLongBits(
3262 != java.lang.Double.doubleToLongBits(
3268 != java.lang.Double.doubleToLongBits(
3274 != java.lang.Double.doubleToLongBits(
3280 != java.lang.Double.doubleToLongBits(
3286 != java.lang.Double.doubleToLongBits(
3292 != java.lang.Double.doubleToLongBits(
3298 != java.lang.Double.doubleToLongBits(
3304 != java.lang.Double.doubleToLongBits(
3314 if (costScaling_ != other.costScaling_)
return false;
3318 if (initialBasis_ != other.initialBasis_)
return false;
3337 if (solveDualProblem_ != other.solveDualProblem_)
return false;
3342 != java.lang.Double.doubleToLongBits(
3348 != java.lang.Double.doubleToLongBits(
3364 != java.lang.Double.doubleToLongBits(
3370 != java.lang.Double.doubleToLongBits(
3376 != java.lang.Double.doubleToLongBits(
3382 != java.lang.Double.doubleToLongBits(
3398 != java.lang.Double.doubleToLongBits(
3439 != java.lang.Double.doubleToLongBits(
3445 != java.lang.Double.doubleToLongBits(
3451 != java.lang.Double.doubleToLongBits(
3457 != java.lang.Double.doubleToLongBits(
3463 != java.lang.Double.doubleToLongBits(
3489 != java.lang.Double.doubleToLongBits(
3495 != java.lang.Double.doubleToLongBits(
3501 != java.lang.Double.doubleToLongBits(
3517 != java.lang.Double.doubleToLongBits(
3533 != java.lang.Double.doubleToLongBits(
3539 != java.lang.Double.doubleToLongBits(
3547 if (!getUnknownFields().
equals(other.getUnknownFields()))
return false;
3553 if (memoizedHashCode != 0) {
3554 return memoizedHashCode;
3560 hash = (53 * hash) + scalingMethod_;
3564 hash = (53 * hash) + feasibilityRule_;
3568 hash = (53 * hash) + optimizationRule_;
3572 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3577 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3582 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3587 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3592 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3597 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3602 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3607 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3612 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3617 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3622 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3627 hash = (53 * hash) + costScaling_;
3631 hash = (53 * hash) + initialBasis_;
3635 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3644 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3649 hash = (53 * hash) + solveDualProblem_;
3653 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3658 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3663 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3668 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3673 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3678 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3683 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3688 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3693 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3702 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3707 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3712 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3721 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3726 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3731 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3736 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3741 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3746 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3751 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3756 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3761 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3774 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3779 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3784 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3789 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3794 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3799 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3804 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3809 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3814 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3819 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3824 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3829 hash = (53 * hash) + com.google.protobuf.Internal.hashLong(
3834 hash = (53 * hash) + com.google.protobuf.Internal.hashBoolean(
3837 hash = (29 * hash) + getUnknownFields().hashCode();
3838 memoizedHashCode = hash;
3843 java.nio.ByteBuffer data)
3844 throws com.google.protobuf.InvalidProtocolBufferException {
3845 return PARSER.parseFrom(data);
3848 java.nio.ByteBuffer data,
3849 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3850 throws com.google.protobuf.InvalidProtocolBufferException {
3851 return PARSER.parseFrom(data, extensionRegistry);
3854 com.google.protobuf.ByteString data)
3855 throws com.google.protobuf.InvalidProtocolBufferException {
3856 return PARSER.parseFrom(data);
3859 com.google.protobuf.ByteString data,
3860 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3861 throws com.google.protobuf.InvalidProtocolBufferException {
3862 return PARSER.parseFrom(data, extensionRegistry);
3865 throws com.google.protobuf.InvalidProtocolBufferException {
3866 return PARSER.parseFrom(data);
3870 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3871 throws com.google.protobuf.InvalidProtocolBufferException {
3872 return PARSER.parseFrom(data, extensionRegistry);
3875 throws java.io.IOException {
3876 return com.google.protobuf.GeneratedMessage
3877 .parseWithIOException(PARSER, input);
3880 java.io.InputStream input,
3881 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3882 throws java.io.IOException {
3883 return com.google.protobuf.GeneratedMessage
3884 .parseWithIOException(PARSER, input, extensionRegistry);
3888 throws java.io.IOException {
3889 return com.google.protobuf.GeneratedMessage
3890 .parseDelimitedWithIOException(PARSER, input);
3894 java.io.InputStream input,
3895 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3896 throws java.io.IOException {
3897 return com.google.protobuf.GeneratedMessage
3898 .parseDelimitedWithIOException(PARSER, input, extensionRegistry);
3901 com.google.protobuf.CodedInputStream input)
3902 throws java.io.IOException {
3903 return com.google.protobuf.GeneratedMessage
3904 .parseWithIOException(PARSER, input);
3907 com.google.protobuf.CodedInputStream input,
3908 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
3909 throws java.io.IOException {
3910 return com.google.protobuf.GeneratedMessage
3911 .parseWithIOException(PARSER, input, extensionRegistry);
3924 return this == DEFAULT_INSTANCE
3930 com.google.protobuf.GeneratedMessage.BuilderParent parent) {
3942 com.google.protobuf.GeneratedMessage.
Builder<Builder> implements
3945 public static final com.google.protobuf.Descriptors.Descriptor
3947 return com.google.ortools.glop.Parameters.internal_static_operations_research_glop_GlopParameters_descriptor;
3951 protected com.google.protobuf.GeneratedMessage.FieldAccessorTable
3953 return com.google.ortools.glop.Parameters.internal_static_operations_research_glop_GlopParameters_fieldAccessorTable
3954 .ensureFieldAccessorsInitialized(
3955 com.google.ortools.glop.GlopParameters.class, com.google.ortools.glop.GlopParameters.Builder.class);
3964 com.google.protobuf.GeneratedMessage.BuilderParent parent) {
3974 feasibilityRule_ = 1;
3975 optimizationRule_ = 1;
3976 refactorizationThreshold_ = 1e-09D;
3977 recomputeReducedCostsThreshold_ = 1e-08D;
3978 recomputeEdgesNormThreshold_ = 100D;
3979 primalFeasibilityTolerance_ = 1e-08D;
3980 dualFeasibilityTolerance_ = 1e-08D;
3981 ratioTestZeroThreshold_ = 1e-09D;
3982 harrisToleranceRatio_ = 0.5D;
3983 smallPivotThreshold_ = 1e-06D;
3984 minimumAcceptablePivot_ = 1e-06D;
3985 dropTolerance_ = 1e-14D;
3989 useTransposedMatrix_ =
true;
3990 basisRefactorizationPeriod_ = 64;
3991 dynamicallyAdjustRefactorizationPeriod_ =
true;
3992 solveDualProblem_ = 2;
3993 dualizerThreshold_ = 1.5D;
3994 solutionFeasibilityTolerance_ = 1e-06D;
3995 provideStrongOptimalGuarantee_ =
true;
3996 changeStatusToImprecise_ =
true;
3997 maxNumberOfReoptimizations_ = 40D;
3998 luFactorizationPivotThreshold_ = 0.01D;
3999 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
4000 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
4001 maxNumberOfIterations_ = -1L;
4002 markowitzZlatevParameter_ = 3;
4003 markowitzSingularityThreshold_ = 1e-15D;
4004 useDualSimplex_ =
false;
4005 allowSimplexAlgorithmChange_ =
false;
4006 devexWeightsResetPeriod_ = 150;
4007 usePreprocessing_ =
true;
4008 useMiddleProductFormUpdate_ =
true;
4009 initializeDevexWithColumnNorms_ =
true;
4010 exploitSingletonColumnInInitialBasis_ =
true;
4011 dualSmallPivotThreshold_ = 0.0001D;
4012 preprocessorZeroTolerance_ = 1e-09D;
4013 objectiveLowerLimit_ = Double.NEGATIVE_INFINITY;
4014 objectiveUpperLimit_ = Double.POSITIVE_INFINITY;
4015 degenerateMinistepFactor_ = 0.01D;
4018 perturbCostsInDualSimplex_ =
false;
4019 useDedicatedDualFeasibilityAlgorithm_ =
true;
4020 relativeCostPerturbation_ = 1e-05D;
4021 relativeMaxCostPerturbation_ = 1e-07D;
4022 initialConditionNumberThreshold_ = 1e+50D;
4023 logSearchProgress_ =
false;
4024 logToStdout_ =
true;
4025 crossoverBoundSnappingDistance_ = Double.POSITIVE_INFINITY;
4026 pushToVertex_ =
true;
4027 useImpliedFreePreprocessor_ =
true;
4028 maxValidMagnitude_ = 1e+30D;
4029 dropMagnitude_ = 1e-30D;
4030 dualPricePrioritizeNorm_ =
false;
4035 public com.google.protobuf.Descriptors.Descriptor
4037 return com.google.ortools.glop.Parameters.internal_static_operations_research_glop_GlopParameters_descriptor;
4042 return com.google.ortools.glop.GlopParameters.getDefaultInstance();
4049 throw newUninitializedMessageException(result);
4057 if (bitField0_ != 0) { buildPartial0(result); }
4058 if (bitField1_ != 0) { buildPartial1(result); }
4063 private void buildPartial0(com.google.ortools.glop.GlopParameters result) {
4064 int from_bitField0_ = bitField0_;
4065 int to_bitField0_ = 0;
4066 if (((from_bitField0_ & 0x00000001) != 0)) {
4067 result.scalingMethod_ = scalingMethod_;
4068 to_bitField0_ |= 0x00000001;
4070 if (((from_bitField0_ & 0x00000002) != 0)) {
4071 result.feasibilityRule_ = feasibilityRule_;
4072 to_bitField0_ |= 0x00000002;
4074 if (((from_bitField0_ & 0x00000004) != 0)) {
4075 result.optimizationRule_ = optimizationRule_;
4076 to_bitField0_ |= 0x00000004;
4078 if (((from_bitField0_ & 0x00000008) != 0)) {
4079 result.refactorizationThreshold_ = refactorizationThreshold_;
4080 to_bitField0_ |= 0x00000008;
4082 if (((from_bitField0_ & 0x00000010) != 0)) {
4083 result.recomputeReducedCostsThreshold_ = recomputeReducedCostsThreshold_;
4084 to_bitField0_ |= 0x00000010;
4086 if (((from_bitField0_ & 0x00000020) != 0)) {
4087 result.recomputeEdgesNormThreshold_ = recomputeEdgesNormThreshold_;
4088 to_bitField0_ |= 0x00000020;
4090 if (((from_bitField0_ & 0x00000040) != 0)) {
4091 result.primalFeasibilityTolerance_ = primalFeasibilityTolerance_;
4092 to_bitField0_ |= 0x00000040;
4094 if (((from_bitField0_ & 0x00000080) != 0)) {
4095 result.dualFeasibilityTolerance_ = dualFeasibilityTolerance_;
4096 to_bitField0_ |= 0x00000080;
4098 if (((from_bitField0_ & 0x00000100) != 0)) {
4099 result.ratioTestZeroThreshold_ = ratioTestZeroThreshold_;
4100 to_bitField0_ |= 0x00000100;
4102 if (((from_bitField0_ & 0x00000200) != 0)) {
4103 result.harrisToleranceRatio_ = harrisToleranceRatio_;
4104 to_bitField0_ |= 0x00000200;
4106 if (((from_bitField0_ & 0x00000400) != 0)) {
4107 result.smallPivotThreshold_ = smallPivotThreshold_;
4108 to_bitField0_ |= 0x00000400;
4110 if (((from_bitField0_ & 0x00000800) != 0)) {
4111 result.minimumAcceptablePivot_ = minimumAcceptablePivot_;
4112 to_bitField0_ |= 0x00000800;
4114 if (((from_bitField0_ & 0x00001000) != 0)) {
4115 result.dropTolerance_ = dropTolerance_;
4116 to_bitField0_ |= 0x00001000;
4118 if (((from_bitField0_ & 0x00002000) != 0)) {
4119 result.useScaling_ = useScaling_;
4120 to_bitField0_ |= 0x00002000;
4122 if (((from_bitField0_ & 0x00004000) != 0)) {
4123 result.costScaling_ = costScaling_;
4124 to_bitField0_ |= 0x00004000;
4126 if (((from_bitField0_ & 0x00008000) != 0)) {
4127 result.initialBasis_ = initialBasis_;
4128 to_bitField0_ |= 0x00008000;
4130 if (((from_bitField0_ & 0x00010000) != 0)) {
4131 result.useTransposedMatrix_ = useTransposedMatrix_;
4132 to_bitField0_ |= 0x00010000;
4134 if (((from_bitField0_ & 0x00020000) != 0)) {
4135 result.basisRefactorizationPeriod_ = basisRefactorizationPeriod_;
4136 to_bitField0_ |= 0x00020000;
4138 if (((from_bitField0_ & 0x00040000) != 0)) {
4139 result.dynamicallyAdjustRefactorizationPeriod_ = dynamicallyAdjustRefactorizationPeriod_;
4140 to_bitField0_ |= 0x00040000;
4142 if (((from_bitField0_ & 0x00080000) != 0)) {
4143 result.solveDualProblem_ = solveDualProblem_;
4144 to_bitField0_ |= 0x00080000;
4146 if (((from_bitField0_ & 0x00100000) != 0)) {
4147 result.dualizerThreshold_ = dualizerThreshold_;
4148 to_bitField0_ |= 0x00100000;
4150 if (((from_bitField0_ & 0x00200000) != 0)) {
4151 result.solutionFeasibilityTolerance_ = solutionFeasibilityTolerance_;
4152 to_bitField0_ |= 0x00200000;
4154 if (((from_bitField0_ & 0x00400000) != 0)) {
4155 result.provideStrongOptimalGuarantee_ = provideStrongOptimalGuarantee_;
4156 to_bitField0_ |= 0x00400000;
4158 if (((from_bitField0_ & 0x00800000) != 0)) {
4159 result.changeStatusToImprecise_ = changeStatusToImprecise_;
4160 to_bitField0_ |= 0x00800000;
4162 if (((from_bitField0_ & 0x01000000) != 0)) {
4163 result.maxNumberOfReoptimizations_ = maxNumberOfReoptimizations_;
4164 to_bitField0_ |= 0x01000000;
4166 if (((from_bitField0_ & 0x02000000) != 0)) {
4167 result.luFactorizationPivotThreshold_ = luFactorizationPivotThreshold_;
4168 to_bitField0_ |= 0x02000000;
4170 if (((from_bitField0_ & 0x04000000) != 0)) {
4171 result.maxTimeInSeconds_ = maxTimeInSeconds_;
4172 to_bitField0_ |= 0x04000000;
4174 if (((from_bitField0_ & 0x08000000) != 0)) {
4175 result.maxDeterministicTime_ = maxDeterministicTime_;
4176 to_bitField0_ |= 0x08000000;
4178 if (((from_bitField0_ & 0x10000000) != 0)) {
4179 result.maxNumberOfIterations_ = maxNumberOfIterations_;
4180 to_bitField0_ |= 0x10000000;
4182 if (((from_bitField0_ & 0x20000000) != 0)) {
4183 result.markowitzZlatevParameter_ = markowitzZlatevParameter_;
4184 to_bitField0_ |= 0x20000000;
4186 if (((from_bitField0_ & 0x40000000) != 0)) {
4187 result.markowitzSingularityThreshold_ = markowitzSingularityThreshold_;
4188 to_bitField0_ |= 0x40000000;
4190 if (((from_bitField0_ & 0x80000000) != 0)) {
4191 result.useDualSimplex_ = useDualSimplex_;
4192 to_bitField0_ |= 0x80000000;
4194 result.bitField0_ |= to_bitField0_;
4197 private void buildPartial1(com.google.ortools.glop.GlopParameters result) {
4198 int from_bitField1_ = bitField1_;
4199 int to_bitField1_ = 0;
4200 if (((from_bitField1_ & 0x00000001) != 0)) {
4201 result.allowSimplexAlgorithmChange_ = allowSimplexAlgorithmChange_;
4202 to_bitField1_ |= 0x00000001;
4204 if (((from_bitField1_ & 0x00000002) != 0)) {
4205 result.devexWeightsResetPeriod_ = devexWeightsResetPeriod_;
4206 to_bitField1_ |= 0x00000002;
4208 if (((from_bitField1_ & 0x00000004) != 0)) {
4209 result.usePreprocessing_ = usePreprocessing_;
4210 to_bitField1_ |= 0x00000004;
4212 if (((from_bitField1_ & 0x00000008) != 0)) {
4213 result.useMiddleProductFormUpdate_ = useMiddleProductFormUpdate_;
4214 to_bitField1_ |= 0x00000008;
4216 if (((from_bitField1_ & 0x00000010) != 0)) {
4217 result.initializeDevexWithColumnNorms_ = initializeDevexWithColumnNorms_;
4218 to_bitField1_ |= 0x00000010;
4220 if (((from_bitField1_ & 0x00000020) != 0)) {
4221 result.exploitSingletonColumnInInitialBasis_ = exploitSingletonColumnInInitialBasis_;
4222 to_bitField1_ |= 0x00000020;
4224 if (((from_bitField1_ & 0x00000040) != 0)) {
4225 result.dualSmallPivotThreshold_ = dualSmallPivotThreshold_;
4226 to_bitField1_ |= 0x00000040;
4228 if (((from_bitField1_ & 0x00000080) != 0)) {
4229 result.preprocessorZeroTolerance_ = preprocessorZeroTolerance_;
4230 to_bitField1_ |= 0x00000080;
4232 if (((from_bitField1_ & 0x00000100) != 0)) {
4233 result.objectiveLowerLimit_ = objectiveLowerLimit_;
4234 to_bitField1_ |= 0x00000100;
4236 if (((from_bitField1_ & 0x00000200) != 0)) {
4237 result.objectiveUpperLimit_ = objectiveUpperLimit_;
4238 to_bitField1_ |= 0x00000200;
4240 if (((from_bitField1_ & 0x00000400) != 0)) {
4241 result.degenerateMinistepFactor_ = degenerateMinistepFactor_;
4242 to_bitField1_ |= 0x00000400;
4244 if (((from_bitField1_ & 0x00000800) != 0)) {
4245 result.randomSeed_ = randomSeed_;
4246 to_bitField1_ |= 0x00000800;
4248 if (((from_bitField1_ & 0x00001000) != 0)) {
4249 result.numOmpThreads_ = numOmpThreads_;
4250 to_bitField1_ |= 0x00001000;
4252 if (((from_bitField1_ & 0x00002000) != 0)) {
4253 result.perturbCostsInDualSimplex_ = perturbCostsInDualSimplex_;
4254 to_bitField1_ |= 0x00002000;
4256 if (((from_bitField1_ & 0x00004000) != 0)) {
4257 result.useDedicatedDualFeasibilityAlgorithm_ = useDedicatedDualFeasibilityAlgorithm_;
4258 to_bitField1_ |= 0x00004000;
4260 if (((from_bitField1_ & 0x00008000) != 0)) {
4261 result.relativeCostPerturbation_ = relativeCostPerturbation_;
4262 to_bitField1_ |= 0x00008000;
4264 if (((from_bitField1_ & 0x00010000) != 0)) {
4265 result.relativeMaxCostPerturbation_ = relativeMaxCostPerturbation_;
4266 to_bitField1_ |= 0x00010000;
4268 if (((from_bitField1_ & 0x00020000) != 0)) {
4269 result.initialConditionNumberThreshold_ = initialConditionNumberThreshold_;
4270 to_bitField1_ |= 0x00020000;
4272 if (((from_bitField1_ & 0x00040000) != 0)) {
4273 result.logSearchProgress_ = logSearchProgress_;
4274 to_bitField1_ |= 0x00040000;
4276 if (((from_bitField1_ & 0x00080000) != 0)) {
4277 result.logToStdout_ = logToStdout_;
4278 to_bitField1_ |= 0x00080000;
4280 if (((from_bitField1_ & 0x00100000) != 0)) {
4281 result.crossoverBoundSnappingDistance_ = crossoverBoundSnappingDistance_;
4282 to_bitField1_ |= 0x00100000;
4284 if (((from_bitField1_ & 0x00200000) != 0)) {
4285 result.pushToVertex_ = pushToVertex_;
4286 to_bitField1_ |= 0x00200000;
4288 if (((from_bitField1_ & 0x00400000) != 0)) {
4289 result.useImpliedFreePreprocessor_ = useImpliedFreePreprocessor_;
4290 to_bitField1_ |= 0x00400000;
4292 if (((from_bitField1_ & 0x00800000) != 0)) {
4293 result.maxValidMagnitude_ = maxValidMagnitude_;
4294 to_bitField1_ |= 0x00800000;
4296 if (((from_bitField1_ & 0x01000000) != 0)) {
4297 result.dropMagnitude_ = dropMagnitude_;
4298 to_bitField1_ |= 0x01000000;
4300 if (((from_bitField1_ & 0x02000000) != 0)) {
4301 result.dualPricePrioritizeNorm_ = dualPricePrioritizeNorm_;
4302 to_bitField1_ |= 0x02000000;
4304 result.bitField1_ |= to_bitField1_;
4309 if (other instanceof com.google.ortools.glop.GlopParameters) {
4310 return mergeFrom((com.google.ortools.glop.GlopParameters)other);
4312 super.mergeFrom(other);
4318 if (other == com.google.ortools.glop.GlopParameters.getDefaultInstance())
return this;
4319 if (other.hasScalingMethod()) {
4322 if (other.hasFeasibilityRule()) {
4325 if (other.hasOptimizationRule()) {
4328 if (other.hasRefactorizationThreshold()) {
4331 if (other.hasRecomputeReducedCostsThreshold()) {
4334 if (other.hasRecomputeEdgesNormThreshold()) {
4337 if (other.hasPrimalFeasibilityTolerance()) {
4340 if (other.hasDualFeasibilityTolerance()) {
4343 if (other.hasRatioTestZeroThreshold()) {
4346 if (other.hasHarrisToleranceRatio()) {
4349 if (other.hasSmallPivotThreshold()) {
4352 if (other.hasMinimumAcceptablePivot()) {
4355 if (other.hasDropTolerance()) {
4358 if (other.hasUseScaling()) {
4361 if (other.hasCostScaling()) {
4364 if (other.hasInitialBasis()) {
4367 if (other.hasUseTransposedMatrix()) {
4370 if (other.hasBasisRefactorizationPeriod()) {
4373 if (other.hasDynamicallyAdjustRefactorizationPeriod()) {
4376 if (other.hasSolveDualProblem()) {
4379 if (other.hasDualizerThreshold()) {
4382 if (other.hasSolutionFeasibilityTolerance()) {
4385 if (other.hasProvideStrongOptimalGuarantee()) {
4388 if (other.hasChangeStatusToImprecise()) {
4391 if (other.hasMaxNumberOfReoptimizations()) {
4394 if (other.hasLuFactorizationPivotThreshold()) {
4397 if (other.hasMaxTimeInSeconds()) {
4400 if (other.hasMaxDeterministicTime()) {
4403 if (other.hasMaxNumberOfIterations()) {
4406 if (other.hasMarkowitzZlatevParameter()) {
4409 if (other.hasMarkowitzSingularityThreshold()) {
4412 if (other.hasUseDualSimplex()) {
4415 if (other.hasAllowSimplexAlgorithmChange()) {
4418 if (other.hasDevexWeightsResetPeriod()) {
4421 if (other.hasUsePreprocessing()) {
4424 if (other.hasUseMiddleProductFormUpdate()) {
4427 if (other.hasInitializeDevexWithColumnNorms()) {
4430 if (other.hasExploitSingletonColumnInInitialBasis()) {
4433 if (other.hasDualSmallPivotThreshold()) {
4436 if (other.hasPreprocessorZeroTolerance()) {
4439 if (other.hasObjectiveLowerLimit()) {
4442 if (other.hasObjectiveUpperLimit()) {
4445 if (other.hasDegenerateMinistepFactor()) {
4448 if (other.hasRandomSeed()) {
4451 if (other.hasNumOmpThreads()) {
4454 if (other.hasPerturbCostsInDualSimplex()) {
4457 if (other.hasUseDedicatedDualFeasibilityAlgorithm()) {
4460 if (other.hasRelativeCostPerturbation()) {
4463 if (other.hasRelativeMaxCostPerturbation()) {
4466 if (other.hasInitialConditionNumberThreshold()) {
4469 if (other.hasLogSearchProgress()) {
4472 if (other.hasLogToStdout()) {
4475 if (other.hasCrossoverBoundSnappingDistance()) {
4478 if (other.hasPushToVertex()) {
4481 if (other.hasUseImpliedFreePreprocessor()) {
4484 if (other.hasMaxValidMagnitude()) {
4487 if (other.hasDropMagnitude()) {
4490 if (other.hasDualPricePrioritizeNorm()) {
4493 this.mergeUnknownFields(other.getUnknownFields());
4505 com.google.protobuf.CodedInputStream input,
4506 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
4507 throws java.io.IOException {
4508 if (extensionRegistry ==
null) {
4509 throw new java.lang.NullPointerException();
4512 boolean done =
false;
4514 int tag = input.readTag();
4520 int tmpRaw = input.readEnum();
4522 com.google.ortools.glop.GlopParameters.PricingRule.forNumber(tmpRaw);
4523 if (tmpValue ==
null) {
4524 mergeUnknownVarintField(1, tmpRaw);
4526 feasibilityRule_ = tmpRaw;
4527 bitField0_ |= 0x00000002;
4532 int tmpRaw = input.readEnum();
4534 com.google.ortools.glop.GlopParameters.PricingRule.forNumber(tmpRaw);
4535 if (tmpValue ==
null) {
4536 mergeUnknownVarintField(2, tmpRaw);
4538 optimizationRule_ = tmpRaw;
4539 bitField0_ |= 0x00000004;
4544 refactorizationThreshold_ = input.readDouble();
4545 bitField0_ |= 0x00000008;
4549 recomputeReducedCostsThreshold_ = input.readDouble();
4550 bitField0_ |= 0x00000010;
4554 recomputeEdgesNormThreshold_ = input.readDouble();
4555 bitField0_ |= 0x00000020;
4559 primalFeasibilityTolerance_ = input.readDouble();
4560 bitField0_ |= 0x00000040;
4564 dualFeasibilityTolerance_ = input.readDouble();
4565 bitField0_ |= 0x00000080;
4569 ratioTestZeroThreshold_ = input.readDouble();
4570 bitField0_ |= 0x00000100;
4574 harrisToleranceRatio_ = input.readDouble();
4575 bitField0_ |= 0x00000200;
4579 smallPivotThreshold_ = input.readDouble();
4580 bitField0_ |= 0x00000400;
4584 minimumAcceptablePivot_ = input.readDouble();
4585 bitField0_ |= 0x00000800;
4589 useScaling_ = input.readBool();
4590 bitField0_ |= 0x00002000;
4594 int tmpRaw = input.readEnum();
4596 com.google.ortools.glop.GlopParameters.InitialBasisHeuristic.forNumber(tmpRaw);
4597 if (tmpValue ==
null) {
4598 mergeUnknownVarintField(17, tmpRaw);
4600 initialBasis_ = tmpRaw;
4601 bitField0_ |= 0x00008000;
4606 useTransposedMatrix_ = input.readBool();
4607 bitField0_ |= 0x00010000;
4611 basisRefactorizationPeriod_ = input.readInt32();
4612 bitField0_ |= 0x00020000;
4616 int tmpRaw = input.readEnum();
4618 com.google.ortools.glop.GlopParameters.SolverBehavior.forNumber(tmpRaw);
4619 if (tmpValue ==
null) {
4620 mergeUnknownVarintField(20, tmpRaw);
4622 solveDualProblem_ = tmpRaw;
4623 bitField0_ |= 0x00080000;
4628 dualizerThreshold_ = input.readDouble();
4629 bitField0_ |= 0x00100000;
4633 solutionFeasibilityTolerance_ = input.readDouble();
4634 bitField0_ |= 0x00200000;
4638 provideStrongOptimalGuarantee_ = input.readBool();
4639 bitField0_ |= 0x00400000;
4643 luFactorizationPivotThreshold_ = input.readDouble();
4644 bitField0_ |= 0x02000000;
4648 maxTimeInSeconds_ = input.readDouble();
4649 bitField0_ |= 0x04000000;
4653 maxNumberOfIterations_ = input.readInt64();
4654 bitField0_ |= 0x10000000;
4658 markowitzZlatevParameter_ = input.readInt32();
4659 bitField0_ |= 0x20000000;
4663 markowitzSingularityThreshold_ = input.readDouble();
4664 bitField0_ |= 0x40000000;
4668 useDualSimplex_ = input.readBool();
4669 bitField0_ |= 0x80000000;
4673 allowSimplexAlgorithmChange_ = input.readBool();
4674 bitField1_ |= 0x00000001;
4678 devexWeightsResetPeriod_ = input.readInt32();
4679 bitField1_ |= 0x00000002;
4683 usePreprocessing_ = input.readBool();
4684 bitField1_ |= 0x00000004;
4688 useMiddleProductFormUpdate_ = input.readBool();
4689 bitField1_ |= 0x00000008;
4693 initializeDevexWithColumnNorms_ = input.readBool();
4694 bitField1_ |= 0x00000010;
4698 exploitSingletonColumnInInitialBasis_ = input.readBool();
4699 bitField1_ |= 0x00000020;
4703 dualSmallPivotThreshold_ = input.readDouble();
4704 bitField1_ |= 0x00000040;
4708 preprocessorZeroTolerance_ = input.readDouble();
4709 bitField1_ |= 0x00000080;
4713 objectiveLowerLimit_ = input.readDouble();
4714 bitField1_ |= 0x00000100;
4718 objectiveUpperLimit_ = input.readDouble();
4719 bitField1_ |= 0x00000200;
4723 degenerateMinistepFactor_ = input.readDouble();
4724 bitField1_ |= 0x00000400;
4728 randomSeed_ = input.readInt32();
4729 bitField1_ |= 0x00000800;
4733 numOmpThreads_ = input.readInt32();
4734 bitField1_ |= 0x00001000;
4738 maxDeterministicTime_ = input.readDouble();
4739 bitField0_ |= 0x08000000;
4743 dropTolerance_ = input.readDouble();
4744 bitField0_ |= 0x00001000;
4748 perturbCostsInDualSimplex_ = input.readBool();
4749 bitField1_ |= 0x00002000;
4753 relativeCostPerturbation_ = input.readDouble();
4754 bitField1_ |= 0x00008000;
4758 relativeMaxCostPerturbation_ = input.readDouble();
4759 bitField1_ |= 0x00010000;
4763 maxNumberOfReoptimizations_ = input.readDouble();
4764 bitField0_ |= 0x01000000;
4768 int tmpRaw = input.readEnum();
4770 com.google.ortools.glop.GlopParameters.ScalingAlgorithm.forNumber(tmpRaw);
4771 if (tmpValue ==
null) {
4772 mergeUnknownVarintField(57, tmpRaw);
4774 scalingMethod_ = tmpRaw;
4775 bitField0_ |= 0x00000001;
4780 changeStatusToImprecise_ = input.readBool();
4781 bitField0_ |= 0x00800000;
4785 initialConditionNumberThreshold_ = input.readDouble();
4786 bitField1_ |= 0x00020000;
4790 int tmpRaw = input.readEnum();
4792 com.google.ortools.glop.GlopParameters.CostScalingAlgorithm.forNumber(tmpRaw);
4793 if (tmpValue ==
null) {
4794 mergeUnknownVarintField(60, tmpRaw);
4796 costScaling_ = tmpRaw;
4797 bitField0_ |= 0x00004000;
4802 logSearchProgress_ = input.readBool();
4803 bitField1_ |= 0x00040000;
4807 useDedicatedDualFeasibilityAlgorithm_ = input.readBool();
4808 bitField1_ |= 0x00004000;
4812 dynamicallyAdjustRefactorizationPeriod_ = input.readBool();
4813 bitField0_ |= 0x00040000;
4817 crossoverBoundSnappingDistance_ = input.readDouble();
4818 bitField1_ |= 0x00100000;
4822 pushToVertex_ = input.readBool();
4823 bitField1_ |= 0x00200000;
4827 logToStdout_ = input.readBool();
4828 bitField1_ |= 0x00080000;
4832 useImpliedFreePreprocessor_ = input.readBool();
4833 bitField1_ |= 0x00400000;
4837 dualPricePrioritizeNorm_ = input.readBool();
4838 bitField1_ |= 0x02000000;
4842 maxValidMagnitude_ = input.readDouble();
4843 bitField1_ |= 0x00800000;
4847 dropMagnitude_ = input.readDouble();
4848 bitField1_ |= 0x01000000;
4852 if (!super.parseUnknownField(input, extensionRegistry, tag)) {
4859 }
catch (com.google.protobuf.InvalidProtocolBufferException e) {
4860 throw e.unwrapIOException();
4866 private int bitField0_;
4867 private int bitField1_;
4869 private int scalingMethod_ = 1;
4875 return ((bitField0_ & 0x00000001) != 0);
4884 return result ==
null ? com.google.ortools.glop.GlopParameters.ScalingAlgorithm.EQUILIBRATION : result;
4892 if (value ==
null) {
4893 throw new NullPointerException();
4895 bitField0_ |= 0x00000001;
4896 scalingMethod_ = value.getNumber();
4905 bitField0_ = (bitField0_ & ~0x00000001);
4911 private int feasibilityRule_ = 1;
4921 return ((bitField0_ & 0x00000002) != 0);
4934 return result ==
null ? com.google.ortools.glop.GlopParameters.PricingRule.STEEPEST_EDGE : result;
4946 if (value ==
null) {
4947 throw new NullPointerException();
4949 bitField0_ |= 0x00000002;
4950 feasibilityRule_ = value.getNumber();
4963 bitField0_ = (bitField0_ & ~0x00000002);
4964 feasibilityRule_ = 1;
4969 private int optimizationRule_ = 1;
4979 return ((bitField0_ & 0x00000004) != 0);
4992 return result ==
null ? com.google.ortools.glop.GlopParameters.PricingRule.STEEPEST_EDGE : result;
5004 if (value ==
null) {
5005 throw new NullPointerException();
5007 bitField0_ |= 0x00000004;
5008 optimizationRule_ = value.getNumber();
5021 bitField0_ = (bitField0_ & ~0x00000004);
5022 optimizationRule_ = 1;
5027 private double refactorizationThreshold_ = 1e-09D;
5043 return ((bitField0_ & 0x00000008) != 0);
5060 return refactorizationThreshold_;
5078 refactorizationThreshold_ = value;
5079 bitField0_ |= 0x00000008;
5097 bitField0_ = (bitField0_ & ~0x00000008);
5098 refactorizationThreshold_ = 1e-09D;
5103 private double recomputeReducedCostsThreshold_ = 1e-08D;
5118 return ((bitField0_ & 0x00000010) != 0);
5134 return recomputeReducedCostsThreshold_;
5151 recomputeReducedCostsThreshold_ = value;
5152 bitField0_ |= 0x00000010;
5169 bitField0_ = (bitField0_ & ~0x00000010);
5170 recomputeReducedCostsThreshold_ = 1e-08D;
5175 private double recomputeEdgesNormThreshold_ = 100D;
5190 return ((bitField0_ & 0x00000020) != 0);
5206 return recomputeEdgesNormThreshold_;
5223 recomputeEdgesNormThreshold_ = value;
5224 bitField0_ |= 0x00000020;
5241 bitField0_ = (bitField0_ & ~0x00000020);
5242 recomputeEdgesNormThreshold_ = 100D;
5247 private double primalFeasibilityTolerance_ = 1e-08D;
5264 return ((bitField0_ & 0x00000040) != 0);
5282 return primalFeasibilityTolerance_;
5301 primalFeasibilityTolerance_ = value;
5302 bitField0_ |= 0x00000040;
5321 bitField0_ = (bitField0_ & ~0x00000040);
5322 primalFeasibilityTolerance_ = 1e-08D;
5327 private double dualFeasibilityTolerance_ = 1e-08D;
5347 return ((bitField0_ & 0x00000080) != 0);
5368 return dualFeasibilityTolerance_;
5390 dualFeasibilityTolerance_ = value;
5391 bitField0_ |= 0x00000080;
5413 bitField0_ = (bitField0_ & ~0x00000080);
5414 dualFeasibilityTolerance_ = 1e-08D;
5419 private double ratioTestZeroThreshold_ = 1e-09D;
5436 return ((bitField0_ & 0x00000100) != 0);
5454 return ratioTestZeroThreshold_;
5473 ratioTestZeroThreshold_ = value;
5474 bitField0_ |= 0x00000100;
5493 bitField0_ = (bitField0_ & ~0x00000100);
5494 ratioTestZeroThreshold_ = 1e-09D;
5499 private double harrisToleranceRatio_ = 0.5D;
5520 return ((bitField0_ & 0x00000200) != 0);
5542 return harrisToleranceRatio_;
5565 harrisToleranceRatio_ = value;
5566 bitField0_ |= 0x00000200;
5589 bitField0_ = (bitField0_ & ~0x00000200);
5590 harrisToleranceRatio_ = 0.5D;
5595 private double smallPivotThreshold_ = 1e-06D;
5609 return ((bitField0_ & 0x00000400) != 0);
5624 return smallPivotThreshold_;
5640 smallPivotThreshold_ = value;
5641 bitField0_ |= 0x00000400;
5657 bitField0_ = (bitField0_ & ~0x00000400);
5658 smallPivotThreshold_ = 1e-06D;
5663 private double minimumAcceptablePivot_ = 1e-06D;
5674 return ((bitField0_ & 0x00000800) != 0);
5686 return minimumAcceptablePivot_;
5699 minimumAcceptablePivot_ = value;
5700 bitField0_ |= 0x00000800;
5713 bitField0_ = (bitField0_ & ~0x00000800);
5714 minimumAcceptablePivot_ = 1e-06D;
5719 private double dropTolerance_ = 1e-14D;
5732 return ((bitField0_ & 0x00001000) != 0);
5746 return dropTolerance_;
5761 dropTolerance_ = value;
5762 bitField0_ |= 0x00001000;
5777 bitField0_ = (bitField0_ & ~0x00001000);
5778 dropTolerance_ = 1e-14D;
5783 private boolean useScaling_ =
true;
5795 return ((bitField0_ & 0x00002000) != 0);
5822 useScaling_ = value;
5823 bitField0_ |= 0x00002000;
5837 bitField0_ = (bitField0_ & ~0x00002000);
5843 private int costScaling_ = 1;
5849 return ((bitField0_ & 0x00004000) != 0);
5858 return result ==
null ? com.google.ortools.glop.GlopParameters.CostScalingAlgorithm.CONTAIN_ONE_COST_SCALING : result;
5866 if (value ==
null) {
5867 throw new NullPointerException();
5869 bitField0_ |= 0x00004000;
5870 costScaling_ = value.getNumber();
5879 bitField0_ = (bitField0_ & ~0x00004000);
5885 private int initialBasis_ = 2;
5896 return ((bitField0_ & 0x00008000) != 0);
5910 return result ==
null ? com.google.ortools.glop.GlopParameters.InitialBasisHeuristic.TRIANGULAR : result;
5923 if (value ==
null) {
5924 throw new NullPointerException();
5926 bitField0_ |= 0x00008000;
5927 initialBasis_ = value.getNumber();
5941 bitField0_ = (bitField0_ & ~0x00008000);
5947 private boolean useTransposedMatrix_ =
true;
5960 return ((bitField0_ & 0x00010000) != 0);
5974 return useTransposedMatrix_;
5989 useTransposedMatrix_ = value;
5990 bitField0_ |= 0x00010000;
6005 bitField0_ = (bitField0_ & ~0x00010000);
6006 useTransposedMatrix_ =
true;
6011 private int basisRefactorizationPeriod_ = 64;
6024 return ((bitField0_ & 0x00020000) != 0);
6038 return basisRefactorizationPeriod_;
6053 basisRefactorizationPeriod_ = value;
6054 bitField0_ |= 0x00020000;
6069 bitField0_ = (bitField0_ & ~0x00020000);
6070 basisRefactorizationPeriod_ = 64;
6075 private boolean dynamicallyAdjustRefactorizationPeriod_ =
true;
6090 return ((bitField0_ & 0x00040000) != 0);
6106 return dynamicallyAdjustRefactorizationPeriod_;
6123 dynamicallyAdjustRefactorizationPeriod_ = value;
6124 bitField0_ |= 0x00040000;
6141 bitField0_ = (bitField0_ & ~0x00040000);
6142 dynamicallyAdjustRefactorizationPeriod_ =
true;
6147 private int solveDualProblem_ = 2;
6159 return ((bitField0_ & 0x00080000) != 0);
6174 return result ==
null ? com.google.ortools.glop.GlopParameters.SolverBehavior.LET_SOLVER_DECIDE : result;
6188 if (value ==
null) {
6189 throw new NullPointerException();
6191 bitField0_ |= 0x00080000;
6192 solveDualProblem_ = value.getNumber();
6207 bitField0_ = (bitField0_ & ~0x00080000);
6208 solveDualProblem_ = 2;
6213 private double dualizerThreshold_ = 1.5D;
6226 return ((bitField0_ & 0x00100000) != 0);
6240 return dualizerThreshold_;
6255 dualizerThreshold_ = value;
6256 bitField0_ |= 0x00100000;
6271 bitField0_ = (bitField0_ & ~0x00100000);
6272 dualizerThreshold_ = 1.5D;
6277 private double solutionFeasibilityTolerance_ = 1e-06D;
6295 return ((bitField0_ & 0x00200000) != 0);
6314 return solutionFeasibilityTolerance_;
6334 solutionFeasibilityTolerance_ = value;
6335 bitField0_ |= 0x00200000;
6355 bitField0_ = (bitField0_ & ~0x00200000);
6356 solutionFeasibilityTolerance_ = 1e-06D;
6361 private boolean provideStrongOptimalGuarantee_ =
true;
6389 return ((bitField0_ & 0x00400000) != 0);
6418 return provideStrongOptimalGuarantee_;
6448 provideStrongOptimalGuarantee_ = value;
6449 bitField0_ |= 0x00400000;
6479 bitField0_ = (bitField0_ & ~0x00400000);
6480 provideStrongOptimalGuarantee_ =
true;
6485 private boolean changeStatusToImprecise_ =
true;
6497 return ((bitField0_ & 0x00800000) != 0);
6510 return changeStatusToImprecise_;
6524 changeStatusToImprecise_ = value;
6525 bitField0_ |= 0x00800000;
6539 bitField0_ = (bitField0_ & ~0x00800000);
6540 changeStatusToImprecise_ =
true;
6545 private double maxNumberOfReoptimizations_ = 40D;
6559 return ((bitField0_ & 0x01000000) != 0);
6574 return maxNumberOfReoptimizations_;
6590 maxNumberOfReoptimizations_ = value;
6591 bitField0_ |= 0x01000000;
6607 bitField0_ = (bitField0_ & ~0x01000000);
6608 maxNumberOfReoptimizations_ = 40D;
6613 private double luFactorizationPivotThreshold_ = 0.01D;
6627 return ((bitField0_ & 0x02000000) != 0);
6642 return luFactorizationPivotThreshold_;
6658 luFactorizationPivotThreshold_ = value;
6659 bitField0_ |= 0x02000000;
6675 bitField0_ = (bitField0_ & ~0x02000000);
6676 luFactorizationPivotThreshold_ = 0.01D;
6681 private double maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
6692 return ((bitField0_ & 0x04000000) != 0);
6704 return maxTimeInSeconds_;
6717 maxTimeInSeconds_ = value;
6718 bitField0_ |= 0x04000000;
6731 bitField0_ = (bitField0_ & ~0x04000000);
6732 maxTimeInSeconds_ = Double.POSITIVE_INFINITY;
6737 private double maxDeterministicTime_ = Double.POSITIVE_INFINITY;
6752 return ((bitField0_ & 0x08000000) != 0);
6768 return maxDeterministicTime_;
6785 maxDeterministicTime_ = value;
6786 bitField0_ |= 0x08000000;
6803 bitField0_ = (bitField0_ & ~0x08000000);
6804 maxDeterministicTime_ = Double.POSITIVE_INFINITY;
6809 private long maxNumberOfIterations_ = -1L;
6821 return ((bitField0_ & 0x10000000) != 0);
6834 return maxNumberOfIterations_;
6848 maxNumberOfIterations_ = value;
6849 bitField0_ |= 0x10000000;
6863 bitField0_ = (bitField0_ & ~0x10000000);
6864 maxNumberOfIterations_ = -1L;
6869 private int markowitzZlatevParameter_ = 3;
6881 return ((bitField0_ & 0x20000000) != 0);
6894 return markowitzZlatevParameter_;
6908 markowitzZlatevParameter_ = value;
6909 bitField0_ |= 0x20000000;
6923 bitField0_ = (bitField0_ & ~0x20000000);
6924 markowitzZlatevParameter_ = 3;
6929 private double markowitzSingularityThreshold_ = 1e-15D;
6943 return ((bitField0_ & 0x40000000) != 0);
6958 return markowitzSingularityThreshold_;
6974 markowitzSingularityThreshold_ = value;
6975 bitField0_ |= 0x40000000;
6991 bitField0_ = (bitField0_ & ~0x40000000);
6992 markowitzSingularityThreshold_ = 1e-15D;
6997 private boolean useDualSimplex_ ;
7008 return ((bitField0_ & 0x80000000) != 0);
7020 return useDualSimplex_;
7033 useDualSimplex_ = value;
7034 bitField0_ |= 0x80000000;
7047 bitField0_ = (bitField0_ & ~0x80000000);
7048 useDualSimplex_ =
false;
7053 private boolean allowSimplexAlgorithmChange_ ;
7067 return ((bitField1_ & 0x00000001) != 0);
7082 return allowSimplexAlgorithmChange_;
7098 allowSimplexAlgorithmChange_ = value;
7099 bitField1_ |= 0x00000001;
7115 bitField1_ = (bitField1_ & ~0x00000001);
7116 allowSimplexAlgorithmChange_ =
false;
7121 private int devexWeightsResetPeriod_ = 150;
7132 return ((bitField1_ & 0x00000002) != 0);
7144 return devexWeightsResetPeriod_;
7157 devexWeightsResetPeriod_ = value;
7158 bitField1_ |= 0x00000002;
7171 bitField1_ = (bitField1_ & ~0x00000002);
7172 devexWeightsResetPeriod_ = 150;
7177 private boolean usePreprocessing_ =
true;
7188 return ((bitField1_ & 0x00000004) != 0);
7200 return usePreprocessing_;
7213 usePreprocessing_ = value;
7214 bitField1_ |= 0x00000004;
7227 bitField1_ = (bitField1_ & ~0x00000004);
7228 usePreprocessing_ =
true;
7233 private boolean useMiddleProductFormUpdate_ =
true;
7250 return ((bitField1_ & 0x00000008) != 0);
7268 return useMiddleProductFormUpdate_;
7287 useMiddleProductFormUpdate_ = value;
7288 bitField1_ |= 0x00000008;
7307 bitField1_ = (bitField1_ & ~0x00000008);
7308 useMiddleProductFormUpdate_ =
true;
7313 private boolean initializeDevexWithColumnNorms_ =
true;
7325 return ((bitField1_ & 0x00000010) != 0);
7338 return initializeDevexWithColumnNorms_;
7352 initializeDevexWithColumnNorms_ = value;
7353 bitField1_ |= 0x00000010;
7367 bitField1_ = (bitField1_ & ~0x00000010);
7368 initializeDevexWithColumnNorms_ =
true;
7373 private boolean exploitSingletonColumnInInitialBasis_ =
true;
7385 return ((bitField1_ & 0x00000020) != 0);
7398 return exploitSingletonColumnInInitialBasis_;
7412 exploitSingletonColumnInInitialBasis_ = value;
7413 bitField1_ |= 0x00000020;
7427 bitField1_ = (bitField1_ & ~0x00000020);
7428 exploitSingletonColumnInInitialBasis_ =
true;
7433 private double dualSmallPivotThreshold_ = 0.0001D;
7446 return ((bitField1_ & 0x00000040) != 0);
7460 return dualSmallPivotThreshold_;
7475 dualSmallPivotThreshold_ = value;
7476 bitField1_ |= 0x00000040;
7491 bitField1_ = (bitField1_ & ~0x00000040);
7492 dualSmallPivotThreshold_ = 0.0001D;
7497 private double preprocessorZeroTolerance_ = 1e-09D;
7513 return ((bitField1_ & 0x00000080) != 0);
7530 return preprocessorZeroTolerance_;
7548 preprocessorZeroTolerance_ = value;
7549 bitField1_ |= 0x00000080;
7567 bitField1_ = (bitField1_ & ~0x00000080);
7568 preprocessorZeroTolerance_ = 1e-09D;
7573 private double objectiveLowerLimit_ = Double.NEGATIVE_INFINITY;
7592 return ((bitField1_ & 0x00000100) != 0);
7612 return objectiveLowerLimit_;
7633 objectiveLowerLimit_ = value;
7634 bitField1_ |= 0x00000100;
7655 bitField1_ = (bitField1_ & ~0x00000100);
7656 objectiveLowerLimit_ = Double.NEGATIVE_INFINITY;
7661 private double objectiveUpperLimit_ = Double.POSITIVE_INFINITY;
7668 return ((bitField1_ & 0x00000200) != 0);
7676 return objectiveUpperLimit_;
7685 objectiveUpperLimit_ = value;
7686 bitField1_ |= 0x00000200;
7695 bitField1_ = (bitField1_ & ~0x00000200);
7696 objectiveUpperLimit_ = Double.POSITIVE_INFINITY;
7701 private double degenerateMinistepFactor_ = 0.01D;
7729 return ((bitField1_ & 0x00000400) != 0);
7758 return degenerateMinistepFactor_;
7788 degenerateMinistepFactor_ = value;
7789 bitField1_ |= 0x00000400;
7819 bitField1_ = (bitField1_ & ~0x00000400);
7820 degenerateMinistepFactor_ = 0.01D;
7825 private int randomSeed_ = 1;
7850 return ((bitField1_ & 0x00000800) != 0);
7903 randomSeed_ = value;
7904 bitField1_ |= 0x00000800;
7931 bitField1_ = (bitField1_ & ~0x00000800);
7937 private int numOmpThreads_ = 1;
7949 return ((bitField1_ & 0x00001000) != 0);
7962 return numOmpThreads_;
7976 numOmpThreads_ = value;
7977 bitField1_ |= 0x00001000;
7991 bitField1_ = (bitField1_ & ~0x00001000);
7997 private boolean perturbCostsInDualSimplex_ ;
8011 return ((bitField1_ & 0x00002000) != 0);
8026 return perturbCostsInDualSimplex_;
8042 perturbCostsInDualSimplex_ = value;
8043 bitField1_ |= 0x00002000;
8059 bitField1_ = (bitField1_ & ~0x00002000);
8060 perturbCostsInDualSimplex_ =
false;
8065 private boolean useDedicatedDualFeasibilityAlgorithm_ =
true;
8083 return ((bitField1_ & 0x00004000) != 0);
8102 return useDedicatedDualFeasibilityAlgorithm_;
8122 useDedicatedDualFeasibilityAlgorithm_ = value;
8123 bitField1_ |= 0x00004000;
8143 bitField1_ = (bitField1_ & ~0x00004000);
8144 useDedicatedDualFeasibilityAlgorithm_ =
true;
8149 private double relativeCostPerturbation_ = 1e-05D;
8163 return ((bitField1_ & 0x00008000) != 0);
8178 return relativeCostPerturbation_;
8194 relativeCostPerturbation_ = value;
8195 bitField1_ |= 0x00008000;
8211 bitField1_ = (bitField1_ & ~0x00008000);
8212 relativeCostPerturbation_ = 1e-05D;
8217 private double relativeMaxCostPerturbation_ = 1e-07D;
8224 return ((bitField1_ & 0x00010000) != 0);
8232 return relativeMaxCostPerturbation_;
8241 relativeMaxCostPerturbation_ = value;
8242 bitField1_ |= 0x00010000;
8251 bitField1_ = (bitField1_ & ~0x00010000);
8252 relativeMaxCostPerturbation_ = 1e-07D;
8257 private double initialConditionNumberThreshold_ = 1e+50D;
8270 return ((bitField1_ & 0x00020000) != 0);
8284 return initialConditionNumberThreshold_;
8299 initialConditionNumberThreshold_ = value;
8300 bitField1_ |= 0x00020000;
8315 bitField1_ = (bitField1_ & ~0x00020000);
8316 initialConditionNumberThreshold_ = 1e+50D;
8321 private boolean logSearchProgress_ ;
8334 return ((bitField1_ & 0x00040000) != 0);
8348 return logSearchProgress_;
8363 logSearchProgress_ = value;
8364 bitField1_ |= 0x00040000;
8379 bitField1_ = (bitField1_ & ~0x00040000);
8380 logSearchProgress_ =
false;
8385 private boolean logToStdout_ =
true;
8396 return ((bitField1_ & 0x00080000) != 0);
8408 return logToStdout_;
8421 logToStdout_ = value;
8422 bitField1_ |= 0x00080000;
8435 bitField1_ = (bitField1_ & ~0x00080000);
8436 logToStdout_ =
true;
8441 private double crossoverBoundSnappingDistance_ = Double.POSITIVE_INFINITY;
8466 return ((bitField1_ & 0x00100000) != 0);
8492 return crossoverBoundSnappingDistance_;
8519 crossoverBoundSnappingDistance_ = value;
8520 bitField1_ |= 0x00100000;
8547 bitField1_ = (bitField1_ & ~0x00100000);
8548 crossoverBoundSnappingDistance_ = Double.POSITIVE_INFINITY;
8553 private boolean pushToVertex_ =
true;
8569 return ((bitField1_ & 0x00200000) != 0);
8586 return pushToVertex_;
8604 pushToVertex_ = value;
8605 bitField1_ |= 0x00200000;
8623 bitField1_ = (bitField1_ & ~0x00200000);
8624 pushToVertex_ =
true;
8629 private boolean useImpliedFreePreprocessor_ =
true;
8640 return ((bitField1_ & 0x00400000) != 0);
8652 return useImpliedFreePreprocessor_;
8665 useImpliedFreePreprocessor_ = value;
8666 bitField1_ |= 0x00400000;
8679 bitField1_ = (bitField1_ & ~0x00400000);
8680 useImpliedFreePreprocessor_ =
true;
8685 private double maxValidMagnitude_ = 1e+30D;
8701 return ((bitField1_ & 0x00800000) != 0);
8718 return maxValidMagnitude_;
8736 maxValidMagnitude_ = value;
8737 bitField1_ |= 0x00800000;
8755 bitField1_ = (bitField1_ & ~0x00800000);
8756 maxValidMagnitude_ = 1e+30D;
8761 private double dropMagnitude_ = 1e-30D;
8775 return ((bitField1_ & 0x01000000) != 0);
8790 return dropMagnitude_;
8806 dropMagnitude_ = value;
8807 bitField1_ |= 0x01000000;
8823 bitField1_ = (bitField1_ & ~0x01000000);
8824 dropMagnitude_ = 1e-30D;
8829 private boolean dualPricePrioritizeNorm_ ;
8841 return ((bitField1_ & 0x02000000) != 0);
8854 return dualPricePrioritizeNorm_;
8868 dualPricePrioritizeNorm_ = value;
8869 bitField1_ |= 0x02000000;
8883 bitField1_ = (bitField1_ & ~0x02000000);
8884 dualPricePrioritizeNorm_ =
false;
8895 DEFAULT_INSTANCE =
new com.google.ortools.glop.GlopParameters();
8899 return DEFAULT_INSTANCE;
8903 PARSER =
new com.google.protobuf.AbstractParser<
GlopParameters>() {
8906 com.google.protobuf.CodedInputStream input,
8907 com.google.protobuf.ExtensionRegistryLite extensionRegistry)
8908 throws com.google.protobuf.InvalidProtocolBufferException {
8911 builder.mergeFrom(input, extensionRegistry);
8912 }
catch (com.google.protobuf.InvalidProtocolBufferException e) {
8913 throw e.setUnfinishedMessage(builder.buildPartial());
8914 }
catch (com.google.protobuf.UninitializedMessageException e) {
8915 throw e.asInvalidProtocolBufferException().setUnfinishedMessage(builder.buildPartial());
8916 }
catch (java.io.IOException e) {
8917 throw new com.google.protobuf.InvalidProtocolBufferException(e)
8918 .setUnfinishedMessage(builder.buildPartial());
8920 return builder.buildPartial();
8935 return DEFAULT_INSTANCE;