All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.ortools.sat.CpObjectiveProto Maven / Gradle / Ivy

The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: ortools/sat/cp_model.proto

package com.google.ortools.sat;

/**
 * 
 * Optimization objective.
 * This is in a message because decision problems don't have any objective.
 * 
* * Protobuf type {@code operations_research.sat.CpObjectiveProto} */ public final class CpObjectiveProto extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:operations_research.sat.CpObjectiveProto) CpObjectiveProtoOrBuilder { private static final long serialVersionUID = 0L; // Use CpObjectiveProto.newBuilder() to construct. private CpObjectiveProto(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private CpObjectiveProto() { vars_ = emptyIntList(); coeffs_ = emptyLongList(); domain_ = emptyLongList(); } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance( UnusedPrivateParameter unused) { return new CpObjectiveProto(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } private CpObjectiveProto( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { this(); if (extensionRegistry == null) { throw new java.lang.NullPointerException(); } int mutable_bitField0_ = 0; com.google.protobuf.UnknownFieldSet.Builder unknownFields = com.google.protobuf.UnknownFieldSet.newBuilder(); try { boolean done = false; while (!done) { int tag = input.readTag(); switch (tag) { case 0: done = true; break; case 8: { if (!((mutable_bitField0_ & 0x00000001) != 0)) { vars_ = newIntList(); mutable_bitField0_ |= 0x00000001; } vars_.addInt(input.readInt32()); break; } case 10: { int length = input.readRawVarint32(); int limit = input.pushLimit(length); if (!((mutable_bitField0_ & 0x00000001) != 0) && input.getBytesUntilLimit() > 0) { vars_ = newIntList(); mutable_bitField0_ |= 0x00000001; } while (input.getBytesUntilLimit() > 0) { vars_.addInt(input.readInt32()); } input.popLimit(limit); break; } case 17: { offset_ = input.readDouble(); break; } case 25: { scalingFactor_ = input.readDouble(); break; } case 32: { if (!((mutable_bitField0_ & 0x00000002) != 0)) { coeffs_ = newLongList(); mutable_bitField0_ |= 0x00000002; } coeffs_.addLong(input.readInt64()); break; } case 34: { int length = input.readRawVarint32(); int limit = input.pushLimit(length); if (!((mutable_bitField0_ & 0x00000002) != 0) && input.getBytesUntilLimit() > 0) { coeffs_ = newLongList(); mutable_bitField0_ |= 0x00000002; } while (input.getBytesUntilLimit() > 0) { coeffs_.addLong(input.readInt64()); } input.popLimit(limit); break; } case 40: { if (!((mutable_bitField0_ & 0x00000004) != 0)) { domain_ = newLongList(); mutable_bitField0_ |= 0x00000004; } domain_.addLong(input.readInt64()); break; } case 42: { int length = input.readRawVarint32(); int limit = input.pushLimit(length); if (!((mutable_bitField0_ & 0x00000004) != 0) && input.getBytesUntilLimit() > 0) { domain_ = newLongList(); mutable_bitField0_ |= 0x00000004; } while (input.getBytesUntilLimit() > 0) { domain_.addLong(input.readInt64()); } input.popLimit(limit); break; } default: { if (!parseUnknownField( input, unknownFields, extensionRegistry, tag)) { done = true; } break; } } } } catch (com.google.protobuf.InvalidProtocolBufferException e) { throw e.setUnfinishedMessage(this); } catch (java.io.IOException e) { throw new com.google.protobuf.InvalidProtocolBufferException( e).setUnfinishedMessage(this); } finally { if (((mutable_bitField0_ & 0x00000001) != 0)) { vars_.makeImmutable(); // C } if (((mutable_bitField0_ & 0x00000002) != 0)) { coeffs_.makeImmutable(); // C } if (((mutable_bitField0_ & 0x00000004) != 0)) { domain_.makeImmutable(); // C } this.unknownFields = unknownFields.build(); makeExtensionsImmutable(); } } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CpObjectiveProto_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CpObjectiveProto_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.ortools.sat.CpObjectiveProto.class, com.google.ortools.sat.CpObjectiveProto.Builder.class); } public static final int VARS_FIELD_NUMBER = 1; private com.google.protobuf.Internal.IntList vars_; /** *
   * The linear terms of the objective to minimize.
   * For a maximization problem, one can negate all coefficients in the
   * objective and set a scaling_factor to -1.
   * 
* * repeated int32 vars = 1; * @return A list containing the vars. */ @java.lang.Override public java.util.List getVarsList() { return vars_; } /** *
   * The linear terms of the objective to minimize.
   * For a maximization problem, one can negate all coefficients in the
   * objective and set a scaling_factor to -1.
   * 
* * repeated int32 vars = 1; * @return The count of vars. */ public int getVarsCount() { return vars_.size(); } /** *
   * The linear terms of the objective to minimize.
   * For a maximization problem, one can negate all coefficients in the
   * objective and set a scaling_factor to -1.
   * 
* * repeated int32 vars = 1; * @param index The index of the element to return. * @return The vars at the given index. */ public int getVars(int index) { return vars_.getInt(index); } private int varsMemoizedSerializedSize = -1; public static final int COEFFS_FIELD_NUMBER = 4; private com.google.protobuf.Internal.LongList coeffs_; /** * repeated int64 coeffs = 4; * @return A list containing the coeffs. */ @java.lang.Override public java.util.List getCoeffsList() { return coeffs_; } /** * repeated int64 coeffs = 4; * @return The count of coeffs. */ public int getCoeffsCount() { return coeffs_.size(); } /** * repeated int64 coeffs = 4; * @param index The index of the element to return. * @return The coeffs at the given index. */ public long getCoeffs(int index) { return coeffs_.getLong(index); } private int coeffsMemoizedSerializedSize = -1; public static final int OFFSET_FIELD_NUMBER = 2; private double offset_; /** *
   * The displayed objective is always:
   *   scaling_factor * (sum(coefficients[i] * objective_vars[i]) + offset).
   * This is needed to have a consistent objective after presolve or when
   * scaling a double problem to express it with integers.
   * Note that if scaling_factor is zero, then it is assumed to be 1, so that by
   * default these fields have no effect.
   * 
* * double offset = 2; * @return The offset. */ @java.lang.Override public double getOffset() { return offset_; } public static final int SCALING_FACTOR_FIELD_NUMBER = 3; private double scalingFactor_; /** * double scaling_factor = 3; * @return The scalingFactor. */ @java.lang.Override public double getScalingFactor() { return scalingFactor_; } public static final int DOMAIN_FIELD_NUMBER = 5; private com.google.protobuf.Internal.LongList domain_; /** *
   * If non-empty, only look for an objective value in the given domain.
   * Note that this does not depend on the offset or scaling factor, it is a
   * domain on the sum of the objective terms only.
   * 
* * repeated int64 domain = 5; * @return A list containing the domain. */ @java.lang.Override public java.util.List getDomainList() { return domain_; } /** *
   * If non-empty, only look for an objective value in the given domain.
   * Note that this does not depend on the offset or scaling factor, it is a
   * domain on the sum of the objective terms only.
   * 
* * repeated int64 domain = 5; * @return The count of domain. */ public int getDomainCount() { return domain_.size(); } /** *
   * If non-empty, only look for an objective value in the given domain.
   * Note that this does not depend on the offset or scaling factor, it is a
   * domain on the sum of the objective terms only.
   * 
* * repeated int64 domain = 5; * @param index The index of the element to return. * @return The domain at the given index. */ public long getDomain(int index) { return domain_.getLong(index); } private int domainMemoizedSerializedSize = -1; private byte memoizedIsInitialized = -1; @java.lang.Override public final boolean isInitialized() { byte isInitialized = memoizedIsInitialized; if (isInitialized == 1) return true; if (isInitialized == 0) return false; memoizedIsInitialized = 1; return true; } @java.lang.Override public void writeTo(com.google.protobuf.CodedOutputStream output) throws java.io.IOException { getSerializedSize(); if (getVarsList().size() > 0) { output.writeUInt32NoTag(10); output.writeUInt32NoTag(varsMemoizedSerializedSize); } for (int i = 0; i < vars_.size(); i++) { output.writeInt32NoTag(vars_.getInt(i)); } if (offset_ != 0D) { output.writeDouble(2, offset_); } if (scalingFactor_ != 0D) { output.writeDouble(3, scalingFactor_); } if (getCoeffsList().size() > 0) { output.writeUInt32NoTag(34); output.writeUInt32NoTag(coeffsMemoizedSerializedSize); } for (int i = 0; i < coeffs_.size(); i++) { output.writeInt64NoTag(coeffs_.getLong(i)); } if (getDomainList().size() > 0) { output.writeUInt32NoTag(42); output.writeUInt32NoTag(domainMemoizedSerializedSize); } for (int i = 0; i < domain_.size(); i++) { output.writeInt64NoTag(domain_.getLong(i)); } unknownFields.writeTo(output); } @java.lang.Override public int getSerializedSize() { int size = memoizedSize; if (size != -1) return size; size = 0; { int dataSize = 0; for (int i = 0; i < vars_.size(); i++) { dataSize += com.google.protobuf.CodedOutputStream .computeInt32SizeNoTag(vars_.getInt(i)); } size += dataSize; if (!getVarsList().isEmpty()) { size += 1; size += com.google.protobuf.CodedOutputStream .computeInt32SizeNoTag(dataSize); } varsMemoizedSerializedSize = dataSize; } if (offset_ != 0D) { size += com.google.protobuf.CodedOutputStream .computeDoubleSize(2, offset_); } if (scalingFactor_ != 0D) { size += com.google.protobuf.CodedOutputStream .computeDoubleSize(3, scalingFactor_); } { int dataSize = 0; for (int i = 0; i < coeffs_.size(); i++) { dataSize += com.google.protobuf.CodedOutputStream .computeInt64SizeNoTag(coeffs_.getLong(i)); } size += dataSize; if (!getCoeffsList().isEmpty()) { size += 1; size += com.google.protobuf.CodedOutputStream .computeInt32SizeNoTag(dataSize); } coeffsMemoizedSerializedSize = dataSize; } { int dataSize = 0; for (int i = 0; i < domain_.size(); i++) { dataSize += com.google.protobuf.CodedOutputStream .computeInt64SizeNoTag(domain_.getLong(i)); } size += dataSize; if (!getDomainList().isEmpty()) { size += 1; size += com.google.protobuf.CodedOutputStream .computeInt32SizeNoTag(dataSize); } domainMemoizedSerializedSize = dataSize; } size += unknownFields.getSerializedSize(); memoizedSize = size; return size; } @java.lang.Override public boolean equals(final java.lang.Object obj) { if (obj == this) { return true; } if (!(obj instanceof com.google.ortools.sat.CpObjectiveProto)) { return super.equals(obj); } com.google.ortools.sat.CpObjectiveProto other = (com.google.ortools.sat.CpObjectiveProto) obj; if (!getVarsList() .equals(other.getVarsList())) return false; if (!getCoeffsList() .equals(other.getCoeffsList())) return false; if (java.lang.Double.doubleToLongBits(getOffset()) != java.lang.Double.doubleToLongBits( other.getOffset())) return false; if (java.lang.Double.doubleToLongBits(getScalingFactor()) != java.lang.Double.doubleToLongBits( other.getScalingFactor())) return false; if (!getDomainList() .equals(other.getDomainList())) return false; if (!unknownFields.equals(other.unknownFields)) return false; return true; } @java.lang.Override public int hashCode() { if (memoizedHashCode != 0) { return memoizedHashCode; } int hash = 41; hash = (19 * hash) + getDescriptor().hashCode(); if (getVarsCount() > 0) { hash = (37 * hash) + VARS_FIELD_NUMBER; hash = (53 * hash) + getVarsList().hashCode(); } if (getCoeffsCount() > 0) { hash = (37 * hash) + COEFFS_FIELD_NUMBER; hash = (53 * hash) + getCoeffsList().hashCode(); } hash = (37 * hash) + OFFSET_FIELD_NUMBER; hash = (53 * hash) + com.google.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getOffset())); hash = (37 * hash) + SCALING_FACTOR_FIELD_NUMBER; hash = (53 * hash) + com.google.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getScalingFactor())); if (getDomainCount() > 0) { hash = (37 * hash) + DOMAIN_FIELD_NUMBER; hash = (53 * hash) + getDomainList().hashCode(); } hash = (29 * hash) + unknownFields.hashCode(); memoizedHashCode = hash; return hash; } public static com.google.ortools.sat.CpObjectiveProto parseFrom( java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( com.google.protobuf.ByteString data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.ortools.sat.CpObjectiveProto parseFrom(byte[] data) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static com.google.ortools.sat.CpObjectiveProto parseFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input, extensionRegistry); } public static com.google.ortools.sat.CpObjectiveProto parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input); } public static com.google.ortools.sat.CpObjectiveProto parseDelimitedFrom( java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input, extensionRegistry); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( com.google.protobuf.CodedInputStream input) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static com.google.ortools.sat.CpObjectiveProto parseFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return com.google.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input, extensionRegistry); } @java.lang.Override public Builder newBuilderForType() { return newBuilder(); } public static Builder newBuilder() { return DEFAULT_INSTANCE.toBuilder(); } public static Builder newBuilder(com.google.ortools.sat.CpObjectiveProto prototype) { return DEFAULT_INSTANCE.toBuilder().mergeFrom(prototype); } @java.lang.Override public Builder toBuilder() { return this == DEFAULT_INSTANCE ? new Builder() : new Builder().mergeFrom(this); } @java.lang.Override protected Builder newBuilderForType( com.google.protobuf.GeneratedMessageV3.BuilderParent parent) { Builder builder = new Builder(parent); return builder; } /** *
   * Optimization objective.
   * This is in a message because decision problems don't have any objective.
   * 
* * Protobuf type {@code operations_research.sat.CpObjectiveProto} */ public static final class Builder extends com.google.protobuf.GeneratedMessageV3.Builder implements // @@protoc_insertion_point(builder_implements:operations_research.sat.CpObjectiveProto) com.google.ortools.sat.CpObjectiveProtoOrBuilder { public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CpObjectiveProto_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CpObjectiveProto_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.ortools.sat.CpObjectiveProto.class, com.google.ortools.sat.CpObjectiveProto.Builder.class); } // Construct using com.google.ortools.sat.CpObjectiveProto.newBuilder() private Builder() { maybeForceBuilderInitialization(); } private Builder( com.google.protobuf.GeneratedMessageV3.BuilderParent parent) { super(parent); maybeForceBuilderInitialization(); } private void maybeForceBuilderInitialization() { if (com.google.protobuf.GeneratedMessageV3 .alwaysUseFieldBuilders) { } } @java.lang.Override public Builder clear() { super.clear(); vars_ = emptyIntList(); bitField0_ = (bitField0_ & ~0x00000001); coeffs_ = emptyLongList(); bitField0_ = (bitField0_ & ~0x00000002); offset_ = 0D; scalingFactor_ = 0D; domain_ = emptyLongList(); bitField0_ = (bitField0_ & ~0x00000004); return this; } @java.lang.Override public com.google.protobuf.Descriptors.Descriptor getDescriptorForType() { return com.google.ortools.sat.CpModelProtobuf.internal_static_operations_research_sat_CpObjectiveProto_descriptor; } @java.lang.Override public com.google.ortools.sat.CpObjectiveProto getDefaultInstanceForType() { return com.google.ortools.sat.CpObjectiveProto.getDefaultInstance(); } @java.lang.Override public com.google.ortools.sat.CpObjectiveProto build() { com.google.ortools.sat.CpObjectiveProto result = buildPartial(); if (!result.isInitialized()) { throw newUninitializedMessageException(result); } return result; } @java.lang.Override public com.google.ortools.sat.CpObjectiveProto buildPartial() { com.google.ortools.sat.CpObjectiveProto result = new com.google.ortools.sat.CpObjectiveProto(this); int from_bitField0_ = bitField0_; if (((bitField0_ & 0x00000001) != 0)) { vars_.makeImmutable(); bitField0_ = (bitField0_ & ~0x00000001); } result.vars_ = vars_; if (((bitField0_ & 0x00000002) != 0)) { coeffs_.makeImmutable(); bitField0_ = (bitField0_ & ~0x00000002); } result.coeffs_ = coeffs_; result.offset_ = offset_; result.scalingFactor_ = scalingFactor_; if (((bitField0_ & 0x00000004) != 0)) { domain_.makeImmutable(); bitField0_ = (bitField0_ & ~0x00000004); } result.domain_ = domain_; onBuilt(); return result; } @java.lang.Override public Builder clone() { return super.clone(); } @java.lang.Override public Builder setField( com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.setField(field, value); } @java.lang.Override public Builder clearField( com.google.protobuf.Descriptors.FieldDescriptor field) { return super.clearField(field); } @java.lang.Override public Builder clearOneof( com.google.protobuf.Descriptors.OneofDescriptor oneof) { return super.clearOneof(oneof); } @java.lang.Override public Builder setRepeatedField( com.google.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value) { return super.setRepeatedField(field, index, value); } @java.lang.Override public Builder addRepeatedField( com.google.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.addRepeatedField(field, value); } @java.lang.Override public Builder mergeFrom(com.google.protobuf.Message other) { if (other instanceof com.google.ortools.sat.CpObjectiveProto) { return mergeFrom((com.google.ortools.sat.CpObjectiveProto)other); } else { super.mergeFrom(other); return this; } } public Builder mergeFrom(com.google.ortools.sat.CpObjectiveProto other) { if (other == com.google.ortools.sat.CpObjectiveProto.getDefaultInstance()) return this; if (!other.vars_.isEmpty()) { if (vars_.isEmpty()) { vars_ = other.vars_; bitField0_ = (bitField0_ & ~0x00000001); } else { ensureVarsIsMutable(); vars_.addAll(other.vars_); } onChanged(); } if (!other.coeffs_.isEmpty()) { if (coeffs_.isEmpty()) { coeffs_ = other.coeffs_; bitField0_ = (bitField0_ & ~0x00000002); } else { ensureCoeffsIsMutable(); coeffs_.addAll(other.coeffs_); } onChanged(); } if (other.getOffset() != 0D) { setOffset(other.getOffset()); } if (other.getScalingFactor() != 0D) { setScalingFactor(other.getScalingFactor()); } if (!other.domain_.isEmpty()) { if (domain_.isEmpty()) { domain_ = other.domain_; bitField0_ = (bitField0_ & ~0x00000004); } else { ensureDomainIsMutable(); domain_.addAll(other.domain_); } onChanged(); } this.mergeUnknownFields(other.unknownFields); onChanged(); return this; } @java.lang.Override public final boolean isInitialized() { return true; } @java.lang.Override public Builder mergeFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { com.google.ortools.sat.CpObjectiveProto parsedMessage = null; try { parsedMessage = PARSER.parsePartialFrom(input, extensionRegistry); } catch (com.google.protobuf.InvalidProtocolBufferException e) { parsedMessage = (com.google.ortools.sat.CpObjectiveProto) e.getUnfinishedMessage(); throw e.unwrapIOException(); } finally { if (parsedMessage != null) { mergeFrom(parsedMessage); } } return this; } private int bitField0_; private com.google.protobuf.Internal.IntList vars_ = emptyIntList(); private void ensureVarsIsMutable() { if (!((bitField0_ & 0x00000001) != 0)) { vars_ = mutableCopy(vars_); bitField0_ |= 0x00000001; } } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @return A list containing the vars. */ public java.util.List getVarsList() { return ((bitField0_ & 0x00000001) != 0) ? java.util.Collections.unmodifiableList(vars_) : vars_; } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @return The count of vars. */ public int getVarsCount() { return vars_.size(); } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @param index The index of the element to return. * @return The vars at the given index. */ public int getVars(int index) { return vars_.getInt(index); } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @param index The index to set the value at. * @param value The vars to set. * @return This builder for chaining. */ public Builder setVars( int index, int value) { ensureVarsIsMutable(); vars_.setInt(index, value); onChanged(); return this; } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @param value The vars to add. * @return This builder for chaining. */ public Builder addVars(int value) { ensureVarsIsMutable(); vars_.addInt(value); onChanged(); return this; } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @param values The vars to add. * @return This builder for chaining. */ public Builder addAllVars( java.lang.Iterable values) { ensureVarsIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, vars_); onChanged(); return this; } /** *
     * The linear terms of the objective to minimize.
     * For a maximization problem, one can negate all coefficients in the
     * objective and set a scaling_factor to -1.
     * 
* * repeated int32 vars = 1; * @return This builder for chaining. */ public Builder clearVars() { vars_ = emptyIntList(); bitField0_ = (bitField0_ & ~0x00000001); onChanged(); return this; } private com.google.protobuf.Internal.LongList coeffs_ = emptyLongList(); private void ensureCoeffsIsMutable() { if (!((bitField0_ & 0x00000002) != 0)) { coeffs_ = mutableCopy(coeffs_); bitField0_ |= 0x00000002; } } /** * repeated int64 coeffs = 4; * @return A list containing the coeffs. */ public java.util.List getCoeffsList() { return ((bitField0_ & 0x00000002) != 0) ? java.util.Collections.unmodifiableList(coeffs_) : coeffs_; } /** * repeated int64 coeffs = 4; * @return The count of coeffs. */ public int getCoeffsCount() { return coeffs_.size(); } /** * repeated int64 coeffs = 4; * @param index The index of the element to return. * @return The coeffs at the given index. */ public long getCoeffs(int index) { return coeffs_.getLong(index); } /** * repeated int64 coeffs = 4; * @param index The index to set the value at. * @param value The coeffs to set. * @return This builder for chaining. */ public Builder setCoeffs( int index, long value) { ensureCoeffsIsMutable(); coeffs_.setLong(index, value); onChanged(); return this; } /** * repeated int64 coeffs = 4; * @param value The coeffs to add. * @return This builder for chaining. */ public Builder addCoeffs(long value) { ensureCoeffsIsMutable(); coeffs_.addLong(value); onChanged(); return this; } /** * repeated int64 coeffs = 4; * @param values The coeffs to add. * @return This builder for chaining. */ public Builder addAllCoeffs( java.lang.Iterable values) { ensureCoeffsIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, coeffs_); onChanged(); return this; } /** * repeated int64 coeffs = 4; * @return This builder for chaining. */ public Builder clearCoeffs() { coeffs_ = emptyLongList(); bitField0_ = (bitField0_ & ~0x00000002); onChanged(); return this; } private double offset_ ; /** *
     * The displayed objective is always:
     *   scaling_factor * (sum(coefficients[i] * objective_vars[i]) + offset).
     * This is needed to have a consistent objective after presolve or when
     * scaling a double problem to express it with integers.
     * Note that if scaling_factor is zero, then it is assumed to be 1, so that by
     * default these fields have no effect.
     * 
* * double offset = 2; * @return The offset. */ @java.lang.Override public double getOffset() { return offset_; } /** *
     * The displayed objective is always:
     *   scaling_factor * (sum(coefficients[i] * objective_vars[i]) + offset).
     * This is needed to have a consistent objective after presolve or when
     * scaling a double problem to express it with integers.
     * Note that if scaling_factor is zero, then it is assumed to be 1, so that by
     * default these fields have no effect.
     * 
* * double offset = 2; * @param value The offset to set. * @return This builder for chaining. */ public Builder setOffset(double value) { offset_ = value; onChanged(); return this; } /** *
     * The displayed objective is always:
     *   scaling_factor * (sum(coefficients[i] * objective_vars[i]) + offset).
     * This is needed to have a consistent objective after presolve or when
     * scaling a double problem to express it with integers.
     * Note that if scaling_factor is zero, then it is assumed to be 1, so that by
     * default these fields have no effect.
     * 
* * double offset = 2; * @return This builder for chaining. */ public Builder clearOffset() { offset_ = 0D; onChanged(); return this; } private double scalingFactor_ ; /** * double scaling_factor = 3; * @return The scalingFactor. */ @java.lang.Override public double getScalingFactor() { return scalingFactor_; } /** * double scaling_factor = 3; * @param value The scalingFactor to set. * @return This builder for chaining. */ public Builder setScalingFactor(double value) { scalingFactor_ = value; onChanged(); return this; } /** * double scaling_factor = 3; * @return This builder for chaining. */ public Builder clearScalingFactor() { scalingFactor_ = 0D; onChanged(); return this; } private com.google.protobuf.Internal.LongList domain_ = emptyLongList(); private void ensureDomainIsMutable() { if (!((bitField0_ & 0x00000004) != 0)) { domain_ = mutableCopy(domain_); bitField0_ |= 0x00000004; } } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @return A list containing the domain. */ public java.util.List getDomainList() { return ((bitField0_ & 0x00000004) != 0) ? java.util.Collections.unmodifiableList(domain_) : domain_; } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @return The count of domain. */ public int getDomainCount() { return domain_.size(); } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @param index The index of the element to return. * @return The domain at the given index. */ public long getDomain(int index) { return domain_.getLong(index); } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @param index The index to set the value at. * @param value The domain to set. * @return This builder for chaining. */ public Builder setDomain( int index, long value) { ensureDomainIsMutable(); domain_.setLong(index, value); onChanged(); return this; } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @param value The domain to add. * @return This builder for chaining. */ public Builder addDomain(long value) { ensureDomainIsMutable(); domain_.addLong(value); onChanged(); return this; } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @param values The domain to add. * @return This builder for chaining. */ public Builder addAllDomain( java.lang.Iterable values) { ensureDomainIsMutable(); com.google.protobuf.AbstractMessageLite.Builder.addAll( values, domain_); onChanged(); return this; } /** *
     * If non-empty, only look for an objective value in the given domain.
     * Note that this does not depend on the offset or scaling factor, it is a
     * domain on the sum of the objective terms only.
     * 
* * repeated int64 domain = 5; * @return This builder for chaining. */ public Builder clearDomain() { domain_ = emptyLongList(); bitField0_ = (bitField0_ & ~0x00000004); onChanged(); return this; } @java.lang.Override public final Builder setUnknownFields( final com.google.protobuf.UnknownFieldSet unknownFields) { return super.setUnknownFields(unknownFields); } @java.lang.Override public final Builder mergeUnknownFields( final com.google.protobuf.UnknownFieldSet unknownFields) { return super.mergeUnknownFields(unknownFields); } // @@protoc_insertion_point(builder_scope:operations_research.sat.CpObjectiveProto) } // @@protoc_insertion_point(class_scope:operations_research.sat.CpObjectiveProto) private static final com.google.ortools.sat.CpObjectiveProto DEFAULT_INSTANCE; static { DEFAULT_INSTANCE = new com.google.ortools.sat.CpObjectiveProto(); } public static com.google.ortools.sat.CpObjectiveProto getDefaultInstance() { return DEFAULT_INSTANCE; } private static final com.google.protobuf.Parser PARSER = new com.google.protobuf.AbstractParser() { @java.lang.Override public CpObjectiveProto parsePartialFrom( com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws com.google.protobuf.InvalidProtocolBufferException { return new CpObjectiveProto(input, extensionRegistry); } }; public static com.google.protobuf.Parser parser() { return PARSER; } @java.lang.Override public com.google.protobuf.Parser getParserForType() { return PARSER; } @java.lang.Override public com.google.ortools.sat.CpObjectiveProto getDefaultInstanceForType() { return DEFAULT_INSTANCE; } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy