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

org.tensorflow.framework.HistogramProto Maven / Gradle / Ivy

The newest version!
// Generated by the protocol buffer compiler.  DO NOT EDIT!
// source: tensorflow/core/framework/summary.proto

package org.tensorflow.framework;

/**
 * 
 * Serialization format for histogram module in
 * core/lib/histogram/histogram.h
 * 
* * Protobuf type {@code tensorflow.HistogramProto} */ public final class HistogramProto extends org.nd4j.shade.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:tensorflow.HistogramProto) HistogramProtoOrBuilder { private static final long serialVersionUID = 0L; // Use HistogramProto.newBuilder() to construct. private HistogramProto(org.nd4j.shade.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private HistogramProto() { bucketLimit_ = emptyDoubleList(); bucket_ = emptyDoubleList(); } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance( UnusedPrivateParameter unused) { return new HistogramProto(); } @java.lang.Override public final org.nd4j.shade.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } private HistogramProto( org.nd4j.shade.protobuf.CodedInputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { this(); if (extensionRegistry == null) { throw new java.lang.NullPointerException(); } int mutable_bitField0_ = 0; org.nd4j.shade.protobuf.UnknownFieldSet.Builder unknownFields = org.nd4j.shade.protobuf.UnknownFieldSet.newBuilder(); try { boolean done = false; while (!done) { int tag = input.readTag(); switch (tag) { case 0: done = true; break; case 9: { min_ = input.readDouble(); break; } case 17: { max_ = input.readDouble(); break; } case 25: { num_ = input.readDouble(); break; } case 33: { sum_ = input.readDouble(); break; } case 41: { sumSquares_ = input.readDouble(); break; } case 49: { if (!((mutable_bitField0_ & 0x00000001) != 0)) { bucketLimit_ = newDoubleList(); mutable_bitField0_ |= 0x00000001; } bucketLimit_.addDouble(input.readDouble()); break; } case 50: { int length = input.readRawVarint32(); int limit = input.pushLimit(length); if (!((mutable_bitField0_ & 0x00000001) != 0) && input.getBytesUntilLimit() > 0) { bucketLimit_ = newDoubleList(); mutable_bitField0_ |= 0x00000001; } while (input.getBytesUntilLimit() > 0) { bucketLimit_.addDouble(input.readDouble()); } input.popLimit(limit); break; } case 57: { if (!((mutable_bitField0_ & 0x00000002) != 0)) { bucket_ = newDoubleList(); mutable_bitField0_ |= 0x00000002; } bucket_.addDouble(input.readDouble()); break; } case 58: { int length = input.readRawVarint32(); int limit = input.pushLimit(length); if (!((mutable_bitField0_ & 0x00000002) != 0) && input.getBytesUntilLimit() > 0) { bucket_ = newDoubleList(); mutable_bitField0_ |= 0x00000002; } while (input.getBytesUntilLimit() > 0) { bucket_.addDouble(input.readDouble()); } input.popLimit(limit); break; } default: { if (!parseUnknownField( input, unknownFields, extensionRegistry, tag)) { done = true; } break; } } } } catch (org.nd4j.shade.protobuf.InvalidProtocolBufferException e) { throw e.setUnfinishedMessage(this); } catch (org.nd4j.shade.protobuf.UninitializedMessageException e) { throw e.asInvalidProtocolBufferException().setUnfinishedMessage(this); } catch (java.io.IOException e) { throw new org.nd4j.shade.protobuf.InvalidProtocolBufferException( e).setUnfinishedMessage(this); } finally { if (((mutable_bitField0_ & 0x00000001) != 0)) { bucketLimit_.makeImmutable(); // C } if (((mutable_bitField0_ & 0x00000002) != 0)) { bucket_.makeImmutable(); // C } this.unknownFields = unknownFields.build(); makeExtensionsImmutable(); } } public static final org.nd4j.shade.protobuf.Descriptors.Descriptor getDescriptor() { return org.tensorflow.framework.SummaryProtos.internal_static_tensorflow_HistogramProto_descriptor; } @java.lang.Override protected org.nd4j.shade.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return org.tensorflow.framework.SummaryProtos.internal_static_tensorflow_HistogramProto_fieldAccessorTable .ensureFieldAccessorsInitialized( org.tensorflow.framework.HistogramProto.class, org.tensorflow.framework.HistogramProto.Builder.class); } public static final int MIN_FIELD_NUMBER = 1; private double min_; /** * double min = 1; * @return The min. */ @java.lang.Override public double getMin() { return min_; } public static final int MAX_FIELD_NUMBER = 2; private double max_; /** * double max = 2; * @return The max. */ @java.lang.Override public double getMax() { return max_; } public static final int NUM_FIELD_NUMBER = 3; private double num_; /** * double num = 3; * @return The num. */ @java.lang.Override public double getNum() { return num_; } public static final int SUM_FIELD_NUMBER = 4; private double sum_; /** * double sum = 4; * @return The sum. */ @java.lang.Override public double getSum() { return sum_; } public static final int SUM_SQUARES_FIELD_NUMBER = 5; private double sumSquares_; /** * double sum_squares = 5; * @return The sumSquares. */ @java.lang.Override public double getSumSquares() { return sumSquares_; } public static final int BUCKET_LIMIT_FIELD_NUMBER = 6; private org.nd4j.shade.protobuf.Internal.DoubleList bucketLimit_; /** *
   * Parallel arrays encoding the bucket boundaries and the bucket values.
   * bucket(i) is the count for the bucket i.  The range for
   * a bucket is:
   *   i == 0:  -DBL_MAX .. bucket_limit(0)
   *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
   * 
* * repeated double bucket_limit = 6 [packed = true]; * @return A list containing the bucketLimit. */ @java.lang.Override public java.util.List getBucketLimitList() { return bucketLimit_; } /** *
   * Parallel arrays encoding the bucket boundaries and the bucket values.
   * bucket(i) is the count for the bucket i.  The range for
   * a bucket is:
   *   i == 0:  -DBL_MAX .. bucket_limit(0)
   *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
   * 
* * repeated double bucket_limit = 6 [packed = true]; * @return The count of bucketLimit. */ public int getBucketLimitCount() { return bucketLimit_.size(); } /** *
   * Parallel arrays encoding the bucket boundaries and the bucket values.
   * bucket(i) is the count for the bucket i.  The range for
   * a bucket is:
   *   i == 0:  -DBL_MAX .. bucket_limit(0)
   *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
   * 
* * repeated double bucket_limit = 6 [packed = true]; * @param index The index of the element to return. * @return The bucketLimit at the given index. */ public double getBucketLimit(int index) { return bucketLimit_.getDouble(index); } private int bucketLimitMemoizedSerializedSize = -1; public static final int BUCKET_FIELD_NUMBER = 7; private org.nd4j.shade.protobuf.Internal.DoubleList bucket_; /** * repeated double bucket = 7 [packed = true]; * @return A list containing the bucket. */ @java.lang.Override public java.util.List getBucketList() { return bucket_; } /** * repeated double bucket = 7 [packed = true]; * @return The count of bucket. */ public int getBucketCount() { return bucket_.size(); } /** * repeated double bucket = 7 [packed = true]; * @param index The index of the element to return. * @return The bucket at the given index. */ public double getBucket(int index) { return bucket_.getDouble(index); } private int bucketMemoizedSerializedSize = -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(org.nd4j.shade.protobuf.CodedOutputStream output) throws java.io.IOException { getSerializedSize(); if (java.lang.Double.doubleToRawLongBits(min_) != 0) { output.writeDouble(1, min_); } if (java.lang.Double.doubleToRawLongBits(max_) != 0) { output.writeDouble(2, max_); } if (java.lang.Double.doubleToRawLongBits(num_) != 0) { output.writeDouble(3, num_); } if (java.lang.Double.doubleToRawLongBits(sum_) != 0) { output.writeDouble(4, sum_); } if (java.lang.Double.doubleToRawLongBits(sumSquares_) != 0) { output.writeDouble(5, sumSquares_); } if (getBucketLimitList().size() > 0) { output.writeUInt32NoTag(50); output.writeUInt32NoTag(bucketLimitMemoizedSerializedSize); } for (int i = 0; i < bucketLimit_.size(); i++) { output.writeDoubleNoTag(bucketLimit_.getDouble(i)); } if (getBucketList().size() > 0) { output.writeUInt32NoTag(58); output.writeUInt32NoTag(bucketMemoizedSerializedSize); } for (int i = 0; i < bucket_.size(); i++) { output.writeDoubleNoTag(bucket_.getDouble(i)); } unknownFields.writeTo(output); } @java.lang.Override public int getSerializedSize() { int size = memoizedSize; if (size != -1) return size; size = 0; if (java.lang.Double.doubleToRawLongBits(min_) != 0) { size += org.nd4j.shade.protobuf.CodedOutputStream .computeDoubleSize(1, min_); } if (java.lang.Double.doubleToRawLongBits(max_) != 0) { size += org.nd4j.shade.protobuf.CodedOutputStream .computeDoubleSize(2, max_); } if (java.lang.Double.doubleToRawLongBits(num_) != 0) { size += org.nd4j.shade.protobuf.CodedOutputStream .computeDoubleSize(3, num_); } if (java.lang.Double.doubleToRawLongBits(sum_) != 0) { size += org.nd4j.shade.protobuf.CodedOutputStream .computeDoubleSize(4, sum_); } if (java.lang.Double.doubleToRawLongBits(sumSquares_) != 0) { size += org.nd4j.shade.protobuf.CodedOutputStream .computeDoubleSize(5, sumSquares_); } { int dataSize = 0; dataSize = 8 * getBucketLimitList().size(); size += dataSize; if (!getBucketLimitList().isEmpty()) { size += 1; size += org.nd4j.shade.protobuf.CodedOutputStream .computeInt32SizeNoTag(dataSize); } bucketLimitMemoizedSerializedSize = dataSize; } { int dataSize = 0; dataSize = 8 * getBucketList().size(); size += dataSize; if (!getBucketList().isEmpty()) { size += 1; size += org.nd4j.shade.protobuf.CodedOutputStream .computeInt32SizeNoTag(dataSize); } bucketMemoizedSerializedSize = 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 org.tensorflow.framework.HistogramProto)) { return super.equals(obj); } org.tensorflow.framework.HistogramProto other = (org.tensorflow.framework.HistogramProto) obj; if (java.lang.Double.doubleToLongBits(getMin()) != java.lang.Double.doubleToLongBits( other.getMin())) return false; if (java.lang.Double.doubleToLongBits(getMax()) != java.lang.Double.doubleToLongBits( other.getMax())) return false; if (java.lang.Double.doubleToLongBits(getNum()) != java.lang.Double.doubleToLongBits( other.getNum())) return false; if (java.lang.Double.doubleToLongBits(getSum()) != java.lang.Double.doubleToLongBits( other.getSum())) return false; if (java.lang.Double.doubleToLongBits(getSumSquares()) != java.lang.Double.doubleToLongBits( other.getSumSquares())) return false; if (!getBucketLimitList() .equals(other.getBucketLimitList())) return false; if (!getBucketList() .equals(other.getBucketList())) 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(); hash = (37 * hash) + MIN_FIELD_NUMBER; hash = (53 * hash) + org.nd4j.shade.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getMin())); hash = (37 * hash) + MAX_FIELD_NUMBER; hash = (53 * hash) + org.nd4j.shade.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getMax())); hash = (37 * hash) + NUM_FIELD_NUMBER; hash = (53 * hash) + org.nd4j.shade.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getNum())); hash = (37 * hash) + SUM_FIELD_NUMBER; hash = (53 * hash) + org.nd4j.shade.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getSum())); hash = (37 * hash) + SUM_SQUARES_FIELD_NUMBER; hash = (53 * hash) + org.nd4j.shade.protobuf.Internal.hashLong( java.lang.Double.doubleToLongBits(getSumSquares())); if (getBucketLimitCount() > 0) { hash = (37 * hash) + BUCKET_LIMIT_FIELD_NUMBER; hash = (53 * hash) + getBucketLimitList().hashCode(); } if (getBucketCount() > 0) { hash = (37 * hash) + BUCKET_FIELD_NUMBER; hash = (53 * hash) + getBucketList().hashCode(); } hash = (29 * hash) + unknownFields.hashCode(); memoizedHashCode = hash; return hash; } public static org.tensorflow.framework.HistogramProto parseFrom( java.nio.ByteBuffer data) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static org.tensorflow.framework.HistogramProto parseFrom( java.nio.ByteBuffer data, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static org.tensorflow.framework.HistogramProto parseFrom( org.nd4j.shade.protobuf.ByteString data) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static org.tensorflow.framework.HistogramProto parseFrom( org.nd4j.shade.protobuf.ByteString data, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static org.tensorflow.framework.HistogramProto parseFrom(byte[] data) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data); } public static org.tensorflow.framework.HistogramProto parseFrom( byte[] data, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return PARSER.parseFrom(data, extensionRegistry); } public static org.tensorflow.framework.HistogramProto parseFrom(java.io.InputStream input) throws java.io.IOException { return org.nd4j.shade.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static org.tensorflow.framework.HistogramProto parseFrom( java.io.InputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return org.nd4j.shade.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input, extensionRegistry); } public static org.tensorflow.framework.HistogramProto parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException { return org.nd4j.shade.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input); } public static org.tensorflow.framework.HistogramProto parseDelimitedFrom( java.io.InputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return org.nd4j.shade.protobuf.GeneratedMessageV3 .parseDelimitedWithIOException(PARSER, input, extensionRegistry); } public static org.tensorflow.framework.HistogramProto parseFrom( org.nd4j.shade.protobuf.CodedInputStream input) throws java.io.IOException { return org.nd4j.shade.protobuf.GeneratedMessageV3 .parseWithIOException(PARSER, input); } public static org.tensorflow.framework.HistogramProto parseFrom( org.nd4j.shade.protobuf.CodedInputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { return org.nd4j.shade.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(org.tensorflow.framework.HistogramProto 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( org.nd4j.shade.protobuf.GeneratedMessageV3.BuilderParent parent) { Builder builder = new Builder(parent); return builder; } /** *
   * Serialization format for histogram module in
   * core/lib/histogram/histogram.h
   * 
* * Protobuf type {@code tensorflow.HistogramProto} */ public static final class Builder extends org.nd4j.shade.protobuf.GeneratedMessageV3.Builder implements // @@protoc_insertion_point(builder_implements:tensorflow.HistogramProto) org.tensorflow.framework.HistogramProtoOrBuilder { public static final org.nd4j.shade.protobuf.Descriptors.Descriptor getDescriptor() { return org.tensorflow.framework.SummaryProtos.internal_static_tensorflow_HistogramProto_descriptor; } @java.lang.Override protected org.nd4j.shade.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return org.tensorflow.framework.SummaryProtos.internal_static_tensorflow_HistogramProto_fieldAccessorTable .ensureFieldAccessorsInitialized( org.tensorflow.framework.HistogramProto.class, org.tensorflow.framework.HistogramProto.Builder.class); } // Construct using org.tensorflow.framework.HistogramProto.newBuilder() private Builder() { maybeForceBuilderInitialization(); } private Builder( org.nd4j.shade.protobuf.GeneratedMessageV3.BuilderParent parent) { super(parent); maybeForceBuilderInitialization(); } private void maybeForceBuilderInitialization() { if (org.nd4j.shade.protobuf.GeneratedMessageV3 .alwaysUseFieldBuilders) { } } @java.lang.Override public Builder clear() { super.clear(); min_ = 0D; max_ = 0D; num_ = 0D; sum_ = 0D; sumSquares_ = 0D; bucketLimit_ = emptyDoubleList(); bitField0_ = (bitField0_ & ~0x00000001); bucket_ = emptyDoubleList(); bitField0_ = (bitField0_ & ~0x00000002); return this; } @java.lang.Override public org.nd4j.shade.protobuf.Descriptors.Descriptor getDescriptorForType() { return org.tensorflow.framework.SummaryProtos.internal_static_tensorflow_HistogramProto_descriptor; } @java.lang.Override public org.tensorflow.framework.HistogramProto getDefaultInstanceForType() { return org.tensorflow.framework.HistogramProto.getDefaultInstance(); } @java.lang.Override public org.tensorflow.framework.HistogramProto build() { org.tensorflow.framework.HistogramProto result = buildPartial(); if (!result.isInitialized()) { throw newUninitializedMessageException(result); } return result; } @java.lang.Override public org.tensorflow.framework.HistogramProto buildPartial() { org.tensorflow.framework.HistogramProto result = new org.tensorflow.framework.HistogramProto(this); int from_bitField0_ = bitField0_; result.min_ = min_; result.max_ = max_; result.num_ = num_; result.sum_ = sum_; result.sumSquares_ = sumSquares_; if (((bitField0_ & 0x00000001) != 0)) { bucketLimit_.makeImmutable(); bitField0_ = (bitField0_ & ~0x00000001); } result.bucketLimit_ = bucketLimit_; if (((bitField0_ & 0x00000002) != 0)) { bucket_.makeImmutable(); bitField0_ = (bitField0_ & ~0x00000002); } result.bucket_ = bucket_; onBuilt(); return result; } @java.lang.Override public Builder clone() { return super.clone(); } @java.lang.Override public Builder setField( org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.setField(field, value); } @java.lang.Override public Builder clearField( org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field) { return super.clearField(field); } @java.lang.Override public Builder clearOneof( org.nd4j.shade.protobuf.Descriptors.OneofDescriptor oneof) { return super.clearOneof(oneof); } @java.lang.Override public Builder setRepeatedField( org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field, int index, java.lang.Object value) { return super.setRepeatedField(field, index, value); } @java.lang.Override public Builder addRepeatedField( org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field, java.lang.Object value) { return super.addRepeatedField(field, value); } @java.lang.Override public Builder mergeFrom(org.nd4j.shade.protobuf.Message other) { if (other instanceof org.tensorflow.framework.HistogramProto) { return mergeFrom((org.tensorflow.framework.HistogramProto)other); } else { super.mergeFrom(other); return this; } } public Builder mergeFrom(org.tensorflow.framework.HistogramProto other) { if (other == org.tensorflow.framework.HistogramProto.getDefaultInstance()) return this; if (other.getMin() != 0D) { setMin(other.getMin()); } if (other.getMax() != 0D) { setMax(other.getMax()); } if (other.getNum() != 0D) { setNum(other.getNum()); } if (other.getSum() != 0D) { setSum(other.getSum()); } if (other.getSumSquares() != 0D) { setSumSquares(other.getSumSquares()); } if (!other.bucketLimit_.isEmpty()) { if (bucketLimit_.isEmpty()) { bucketLimit_ = other.bucketLimit_; bitField0_ = (bitField0_ & ~0x00000001); } else { ensureBucketLimitIsMutable(); bucketLimit_.addAll(other.bucketLimit_); } onChanged(); } if (!other.bucket_.isEmpty()) { if (bucket_.isEmpty()) { bucket_ = other.bucket_; bitField0_ = (bitField0_ & ~0x00000002); } else { ensureBucketIsMutable(); bucket_.addAll(other.bucket_); } onChanged(); } this.mergeUnknownFields(other.unknownFields); onChanged(); return this; } @java.lang.Override public final boolean isInitialized() { return true; } @java.lang.Override public Builder mergeFrom( org.nd4j.shade.protobuf.CodedInputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws java.io.IOException { org.tensorflow.framework.HistogramProto parsedMessage = null; try { parsedMessage = PARSER.parsePartialFrom(input, extensionRegistry); } catch (org.nd4j.shade.protobuf.InvalidProtocolBufferException e) { parsedMessage = (org.tensorflow.framework.HistogramProto) e.getUnfinishedMessage(); throw e.unwrapIOException(); } finally { if (parsedMessage != null) { mergeFrom(parsedMessage); } } return this; } private int bitField0_; private double min_ ; /** * double min = 1; * @return The min. */ @java.lang.Override public double getMin() { return min_; } /** * double min = 1; * @param value The min to set. * @return This builder for chaining. */ public Builder setMin(double value) { min_ = value; onChanged(); return this; } /** * double min = 1; * @return This builder for chaining. */ public Builder clearMin() { min_ = 0D; onChanged(); return this; } private double max_ ; /** * double max = 2; * @return The max. */ @java.lang.Override public double getMax() { return max_; } /** * double max = 2; * @param value The max to set. * @return This builder for chaining. */ public Builder setMax(double value) { max_ = value; onChanged(); return this; } /** * double max = 2; * @return This builder for chaining. */ public Builder clearMax() { max_ = 0D; onChanged(); return this; } private double num_ ; /** * double num = 3; * @return The num. */ @java.lang.Override public double getNum() { return num_; } /** * double num = 3; * @param value The num to set. * @return This builder for chaining. */ public Builder setNum(double value) { num_ = value; onChanged(); return this; } /** * double num = 3; * @return This builder for chaining. */ public Builder clearNum() { num_ = 0D; onChanged(); return this; } private double sum_ ; /** * double sum = 4; * @return The sum. */ @java.lang.Override public double getSum() { return sum_; } /** * double sum = 4; * @param value The sum to set. * @return This builder for chaining. */ public Builder setSum(double value) { sum_ = value; onChanged(); return this; } /** * double sum = 4; * @return This builder for chaining. */ public Builder clearSum() { sum_ = 0D; onChanged(); return this; } private double sumSquares_ ; /** * double sum_squares = 5; * @return The sumSquares. */ @java.lang.Override public double getSumSquares() { return sumSquares_; } /** * double sum_squares = 5; * @param value The sumSquares to set. * @return This builder for chaining. */ public Builder setSumSquares(double value) { sumSquares_ = value; onChanged(); return this; } /** * double sum_squares = 5; * @return This builder for chaining. */ public Builder clearSumSquares() { sumSquares_ = 0D; onChanged(); return this; } private org.nd4j.shade.protobuf.Internal.DoubleList bucketLimit_ = emptyDoubleList(); private void ensureBucketLimitIsMutable() { if (!((bitField0_ & 0x00000001) != 0)) { bucketLimit_ = mutableCopy(bucketLimit_); bitField0_ |= 0x00000001; } } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @return A list containing the bucketLimit. */ public java.util.List getBucketLimitList() { return ((bitField0_ & 0x00000001) != 0) ? java.util.Collections.unmodifiableList(bucketLimit_) : bucketLimit_; } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @return The count of bucketLimit. */ public int getBucketLimitCount() { return bucketLimit_.size(); } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @param index The index of the element to return. * @return The bucketLimit at the given index. */ public double getBucketLimit(int index) { return bucketLimit_.getDouble(index); } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @param index The index to set the value at. * @param value The bucketLimit to set. * @return This builder for chaining. */ public Builder setBucketLimit( int index, double value) { ensureBucketLimitIsMutable(); bucketLimit_.setDouble(index, value); onChanged(); return this; } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @param value The bucketLimit to add. * @return This builder for chaining. */ public Builder addBucketLimit(double value) { ensureBucketLimitIsMutable(); bucketLimit_.addDouble(value); onChanged(); return this; } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @param values The bucketLimit to add. * @return This builder for chaining. */ public Builder addAllBucketLimit( java.lang.Iterable values) { ensureBucketLimitIsMutable(); org.nd4j.shade.protobuf.AbstractMessageLite.Builder.addAll( values, bucketLimit_); onChanged(); return this; } /** *
     * Parallel arrays encoding the bucket boundaries and the bucket values.
     * bucket(i) is the count for the bucket i.  The range for
     * a bucket is:
     *   i == 0:  -DBL_MAX .. bucket_limit(0)
     *   i != 0:  bucket_limit(i-1) .. bucket_limit(i)
     * 
* * repeated double bucket_limit = 6 [packed = true]; * @return This builder for chaining. */ public Builder clearBucketLimit() { bucketLimit_ = emptyDoubleList(); bitField0_ = (bitField0_ & ~0x00000001); onChanged(); return this; } private org.nd4j.shade.protobuf.Internal.DoubleList bucket_ = emptyDoubleList(); private void ensureBucketIsMutable() { if (!((bitField0_ & 0x00000002) != 0)) { bucket_ = mutableCopy(bucket_); bitField0_ |= 0x00000002; } } /** * repeated double bucket = 7 [packed = true]; * @return A list containing the bucket. */ public java.util.List getBucketList() { return ((bitField0_ & 0x00000002) != 0) ? java.util.Collections.unmodifiableList(bucket_) : bucket_; } /** * repeated double bucket = 7 [packed = true]; * @return The count of bucket. */ public int getBucketCount() { return bucket_.size(); } /** * repeated double bucket = 7 [packed = true]; * @param index The index of the element to return. * @return The bucket at the given index. */ public double getBucket(int index) { return bucket_.getDouble(index); } /** * repeated double bucket = 7 [packed = true]; * @param index The index to set the value at. * @param value The bucket to set. * @return This builder for chaining. */ public Builder setBucket( int index, double value) { ensureBucketIsMutable(); bucket_.setDouble(index, value); onChanged(); return this; } /** * repeated double bucket = 7 [packed = true]; * @param value The bucket to add. * @return This builder for chaining. */ public Builder addBucket(double value) { ensureBucketIsMutable(); bucket_.addDouble(value); onChanged(); return this; } /** * repeated double bucket = 7 [packed = true]; * @param values The bucket to add. * @return This builder for chaining. */ public Builder addAllBucket( java.lang.Iterable values) { ensureBucketIsMutable(); org.nd4j.shade.protobuf.AbstractMessageLite.Builder.addAll( values, bucket_); onChanged(); return this; } /** * repeated double bucket = 7 [packed = true]; * @return This builder for chaining. */ public Builder clearBucket() { bucket_ = emptyDoubleList(); bitField0_ = (bitField0_ & ~0x00000002); onChanged(); return this; } @java.lang.Override public final Builder setUnknownFields( final org.nd4j.shade.protobuf.UnknownFieldSet unknownFields) { return super.setUnknownFields(unknownFields); } @java.lang.Override public final Builder mergeUnknownFields( final org.nd4j.shade.protobuf.UnknownFieldSet unknownFields) { return super.mergeUnknownFields(unknownFields); } // @@protoc_insertion_point(builder_scope:tensorflow.HistogramProto) } // @@protoc_insertion_point(class_scope:tensorflow.HistogramProto) private static final org.tensorflow.framework.HistogramProto DEFAULT_INSTANCE; static { DEFAULT_INSTANCE = new org.tensorflow.framework.HistogramProto(); } public static org.tensorflow.framework.HistogramProto getDefaultInstance() { return DEFAULT_INSTANCE; } private static final org.nd4j.shade.protobuf.Parser PARSER = new org.nd4j.shade.protobuf.AbstractParser() { @java.lang.Override public HistogramProto parsePartialFrom( org.nd4j.shade.protobuf.CodedInputStream input, org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) throws org.nd4j.shade.protobuf.InvalidProtocolBufferException { return new HistogramProto(input, extensionRegistry); } }; public static org.nd4j.shade.protobuf.Parser parser() { return PARSER; } @java.lang.Override public org.nd4j.shade.protobuf.Parser getParserForType() { return PARSER; } @java.lang.Override public org.tensorflow.framework.HistogramProto getDefaultInstanceForType() { return DEFAULT_INSTANCE; } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy