* Distribution represents a frequency distribution of double-valued sample * points. It contains the size of the population of sample points plus * additional optional information: * * the arithmetic mean of the samples * * the minimum and maximum of the samples * * the sum-squared-deviation of the samples, used to compute variance * * a histogram of the values of the sample points ** * Protobuf type {@code google.api.servicecontrol.v1.Distribution} */ public final class Distribution extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:google.api.servicecontrol.v1.Distribution) DistributionOrBuilder { private static final long serialVersionUID = 0L; // Use Distribution.newBuilder() to construct. private Distribution(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private Distribution() { bucketCounts_ = emptyLongList(); exemplars_ = java.util.Collections.emptyList(); } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance(UnusedPrivateParameter unused) { return new Distribution(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.api.servicecontrol.v1.Distribution.class, com.google.api.servicecontrol.v1.Distribution.Builder.class); } public interface LinearBucketsOrBuilder extends // @@protoc_insertion_point(interface_extends:google.api.servicecontrol.v1.Distribution.LinearBuckets) com.google.protobuf.MessageOrBuilder { /** * * *
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
int getNumFiniteBuckets();
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
* Must be strictly positive.
*
*
* double width = 2;
*
* @return The width.
*/
double getWidth();
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
*
*
* double offset = 3;
*
* @return The offset.
*/
double getOffset();
}
/**
*
*
* * Describing buckets with constant width. ** * Protobuf type {@code google.api.servicecontrol.v1.Distribution.LinearBuckets} */ public static final class LinearBuckets extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:google.api.servicecontrol.v1.Distribution.LinearBuckets) LinearBucketsOrBuilder { private static final long serialVersionUID = 0L; // Use LinearBuckets.newBuilder() to construct. private LinearBuckets(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private LinearBuckets() {} @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance(UnusedPrivateParameter unused) { return new LinearBuckets(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_LinearBuckets_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_LinearBuckets_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.api.servicecontrol.v1.Distribution.LinearBuckets.class, com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder.class); } public static final int NUM_FINITE_BUCKETS_FIELD_NUMBER = 1; private int numFiniteBuckets_ = 0; /** * * *
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
@java.lang.Override
public int getNumFiniteBuckets() {
return numFiniteBuckets_;
}
public static final int WIDTH_FIELD_NUMBER = 2;
private double width_ = 0D;
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
* Must be strictly positive.
*
*
* double width = 2;
*
* @return The width.
*/
@java.lang.Override
public double getWidth() {
return width_;
}
public static final int OFFSET_FIELD_NUMBER = 3;
private double offset_ = 0D;
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
*
*
* double offset = 3;
*
* @return The offset.
*/
@java.lang.Override
public double getOffset() {
return offset_;
}
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 {
if (numFiniteBuckets_ != 0) {
output.writeInt32(1, numFiniteBuckets_);
}
if (java.lang.Double.doubleToRawLongBits(width_) != 0) {
output.writeDouble(2, width_);
}
if (java.lang.Double.doubleToRawLongBits(offset_) != 0) {
output.writeDouble(3, offset_);
}
getUnknownFields().writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
if (numFiniteBuckets_ != 0) {
size += com.google.protobuf.CodedOutputStream.computeInt32Size(1, numFiniteBuckets_);
}
if (java.lang.Double.doubleToRawLongBits(width_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(2, width_);
}
if (java.lang.Double.doubleToRawLongBits(offset_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(3, offset_);
}
size += getUnknownFields().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.api.servicecontrol.v1.Distribution.LinearBuckets)) {
return super.equals(obj);
}
com.google.api.servicecontrol.v1.Distribution.LinearBuckets other =
(com.google.api.servicecontrol.v1.Distribution.LinearBuckets) obj;
if (getNumFiniteBuckets() != other.getNumFiniteBuckets()) return false;
if (java.lang.Double.doubleToLongBits(getWidth())
!= java.lang.Double.doubleToLongBits(other.getWidth())) return false;
if (java.lang.Double.doubleToLongBits(getOffset())
!= java.lang.Double.doubleToLongBits(other.getOffset())) return false;
if (!getUnknownFields().equals(other.getUnknownFields())) 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) + NUM_FINITE_BUCKETS_FIELD_NUMBER;
hash = (53 * hash) + getNumFiniteBuckets();
hash = (37 * hash) + WIDTH_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getWidth()));
hash = (37 * hash) + OFFSET_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getOffset()));
hash = (29 * hash) + getUnknownFields().hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets 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.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(byte[] data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets 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.api.servicecontrol.v1.Distribution.LinearBuckets parseDelimitedFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseDelimitedWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets 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.api.servicecontrol.v1.Distribution.LinearBuckets parseFrom(
com.google.protobuf.CodedInputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets 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.api.servicecontrol.v1.Distribution.LinearBuckets 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;
}
/**
*
*
*
* Describing buckets with constant width.
*
*
* Protobuf type {@code google.api.servicecontrol.v1.Distribution.LinearBuckets}
*/
public static final class Builder
extends com.google.protobuf.GeneratedMessageV3.Builder
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
@java.lang.Override
public int getNumFiniteBuckets() {
return numFiniteBuckets_;
}
/**
*
*
*
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @param value The numFiniteBuckets to set.
* @return This builder for chaining.
*/
public Builder setNumFiniteBuckets(int value) {
numFiniteBuckets_ = value;
bitField0_ |= 0x00000001;
onChanged();
return this;
}
/**
*
*
*
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return This builder for chaining.
*/
public Builder clearNumFiniteBuckets() {
bitField0_ = (bitField0_ & ~0x00000001);
numFiniteBuckets_ = 0;
onChanged();
return this;
}
private double width_;
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
* Must be strictly positive.
*
*
* double width = 2;
*
* @return The width.
*/
@java.lang.Override
public double getWidth() {
return width_;
}
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
* Must be strictly positive.
*
*
* double width = 2;
*
* @param value The width to set.
* @return This builder for chaining.
*/
public Builder setWidth(double value) {
width_ = value;
bitField0_ |= 0x00000002;
onChanged();
return this;
}
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
* Must be strictly positive.
*
*
* double width = 2;
*
* @return This builder for chaining.
*/
public Builder clearWidth() {
bitField0_ = (bitField0_ & ~0x00000002);
width_ = 0D;
onChanged();
return this;
}
private double offset_;
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
*
*
* double offset = 3;
*
* @return The offset.
*/
@java.lang.Override
public double getOffset() {
return offset_;
}
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
*
*
* double offset = 3;
*
* @param value The offset to set.
* @return This builder for chaining.
*/
public Builder setOffset(double value) {
offset_ = value;
bitField0_ |= 0x00000004;
onChanged();
return this;
}
/**
*
*
*
* The i'th linear bucket covers the interval
* [offset + (i-1) * width, offset + i * width)
* where i ranges from 1 to num_finite_buckets, inclusive.
*
*
* double offset = 3;
*
* @return This builder for chaining.
*/
public Builder clearOffset() {
bitField0_ = (bitField0_ & ~0x00000004);
offset_ = 0D;
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:google.api.servicecontrol.v1.Distribution.LinearBuckets)
}
// @@protoc_insertion_point(class_scope:google.api.servicecontrol.v1.Distribution.LinearBuckets)
private static final com.google.api.servicecontrol.v1.Distribution.LinearBuckets
DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new com.google.api.servicecontrol.v1.Distribution.LinearBuckets();
}
public static com.google.api.servicecontrol.v1.Distribution.LinearBuckets getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
int getNumFiniteBuckets();
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be larger than 1.0.
*
*
* double growth_factor = 2;
*
* @return The growthFactor.
*/
double getGrowthFactor();
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be > 0.
*
*
* double scale = 3;
*
* @return The scale.
*/
double getScale();
}
/**
*
*
* * Describing buckets with exponentially growing width. ** * Protobuf type {@code google.api.servicecontrol.v1.Distribution.ExponentialBuckets} */ public static final class ExponentialBuckets extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:google.api.servicecontrol.v1.Distribution.ExponentialBuckets) ExponentialBucketsOrBuilder { private static final long serialVersionUID = 0L; // Use ExponentialBuckets.newBuilder() to construct. private ExponentialBuckets(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private ExponentialBuckets() {} @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance(UnusedPrivateParameter unused) { return new ExponentialBuckets(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_ExponentialBuckets_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_ExponentialBuckets_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.class, com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder.class); } public static final int NUM_FINITE_BUCKETS_FIELD_NUMBER = 1; private int numFiniteBuckets_ = 0; /** * * *
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
@java.lang.Override
public int getNumFiniteBuckets() {
return numFiniteBuckets_;
}
public static final int GROWTH_FACTOR_FIELD_NUMBER = 2;
private double growthFactor_ = 0D;
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be larger than 1.0.
*
*
* double growth_factor = 2;
*
* @return The growthFactor.
*/
@java.lang.Override
public double getGrowthFactor() {
return growthFactor_;
}
public static final int SCALE_FIELD_NUMBER = 3;
private double scale_ = 0D;
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be > 0.
*
*
* double scale = 3;
*
* @return The scale.
*/
@java.lang.Override
public double getScale() {
return scale_;
}
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 {
if (numFiniteBuckets_ != 0) {
output.writeInt32(1, numFiniteBuckets_);
}
if (java.lang.Double.doubleToRawLongBits(growthFactor_) != 0) {
output.writeDouble(2, growthFactor_);
}
if (java.lang.Double.doubleToRawLongBits(scale_) != 0) {
output.writeDouble(3, scale_);
}
getUnknownFields().writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
if (numFiniteBuckets_ != 0) {
size += com.google.protobuf.CodedOutputStream.computeInt32Size(1, numFiniteBuckets_);
}
if (java.lang.Double.doubleToRawLongBits(growthFactor_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(2, growthFactor_);
}
if (java.lang.Double.doubleToRawLongBits(scale_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(3, scale_);
}
size += getUnknownFields().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.api.servicecontrol.v1.Distribution.ExponentialBuckets)) {
return super.equals(obj);
}
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets other =
(com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) obj;
if (getNumFiniteBuckets() != other.getNumFiniteBuckets()) return false;
if (java.lang.Double.doubleToLongBits(getGrowthFactor())
!= java.lang.Double.doubleToLongBits(other.getGrowthFactor())) return false;
if (java.lang.Double.doubleToLongBits(getScale())
!= java.lang.Double.doubleToLongBits(other.getScale())) return false;
if (!getUnknownFields().equals(other.getUnknownFields())) 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) + NUM_FINITE_BUCKETS_FIELD_NUMBER;
hash = (53 * hash) + getNumFiniteBuckets();
hash = (37 * hash) + GROWTH_FACTOR_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getGrowthFactor()));
hash = (37 * hash) + SCALE_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getScale()));
hash = (29 * hash) + getUnknownFields().hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets 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.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
byte[] data) throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets 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.api.servicecontrol.v1.Distribution.ExponentialBuckets
parseDelimitedFrom(java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseDelimitedWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
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.api.servicecontrol.v1.Distribution.ExponentialBuckets parseFrom(
com.google.protobuf.CodedInputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets 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.api.servicecontrol.v1.Distribution.ExponentialBuckets 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;
}
/**
*
*
*
* Describing buckets with exponentially growing width.
*
*
* Protobuf type {@code google.api.servicecontrol.v1.Distribution.ExponentialBuckets}
*/
public static final class Builder
extends com.google.protobuf.GeneratedMessageV3.Builder
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return The numFiniteBuckets.
*/
@java.lang.Override
public int getNumFiniteBuckets() {
return numFiniteBuckets_;
}
/**
*
*
*
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @param value The numFiniteBuckets to set.
* @return This builder for chaining.
*/
public Builder setNumFiniteBuckets(int value) {
numFiniteBuckets_ = value;
bitField0_ |= 0x00000001;
onChanged();
return this;
}
/**
*
*
*
* The number of finite buckets. With the underflow and overflow buckets,
* the total number of buckets is `num_finite_buckets` + 2.
* See comments on `bucket_options` for details.
*
*
* int32 num_finite_buckets = 1;
*
* @return This builder for chaining.
*/
public Builder clearNumFiniteBuckets() {
bitField0_ = (bitField0_ & ~0x00000001);
numFiniteBuckets_ = 0;
onChanged();
return this;
}
private double growthFactor_;
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be larger than 1.0.
*
*
* double growth_factor = 2;
*
* @return The growthFactor.
*/
@java.lang.Override
public double getGrowthFactor() {
return growthFactor_;
}
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be larger than 1.0.
*
*
* double growth_factor = 2;
*
* @param value The growthFactor to set.
* @return This builder for chaining.
*/
public Builder setGrowthFactor(double value) {
growthFactor_ = value;
bitField0_ |= 0x00000002;
onChanged();
return this;
}
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be larger than 1.0.
*
*
* double growth_factor = 2;
*
* @return This builder for chaining.
*/
public Builder clearGrowthFactor() {
bitField0_ = (bitField0_ & ~0x00000002);
growthFactor_ = 0D;
onChanged();
return this;
}
private double scale_;
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be > 0.
*
*
* double scale = 3;
*
* @return The scale.
*/
@java.lang.Override
public double getScale() {
return scale_;
}
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be > 0.
*
*
* double scale = 3;
*
* @param value The scale to set.
* @return This builder for chaining.
*/
public Builder setScale(double value) {
scale_ = value;
bitField0_ |= 0x00000004;
onChanged();
return this;
}
/**
*
*
*
* The i'th exponential bucket covers the interval
* [scale * growth_factor^(i-1), scale * growth_factor^i)
* where i ranges from 1 to num_finite_buckets inclusive.
* Must be > 0.
*
*
* double scale = 3;
*
* @return This builder for chaining.
*/
public Builder clearScale() {
bitField0_ = (bitField0_ & ~0x00000004);
scale_ = 0D;
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:google.api.servicecontrol.v1.Distribution.ExponentialBuckets)
}
// @@protoc_insertion_point(class_scope:google.api.servicecontrol.v1.Distribution.ExponentialBuckets)
private static final com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets();
}
public static com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return A list containing the bounds.
*/
java.util.List
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return The count of bounds.
*/
int getBoundsCount();
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param index The index of the element to return.
* @return The bounds at the given index.
*/
double getBounds(int index);
}
/**
*
*
* * Describing buckets with arbitrary user-provided width. ** * Protobuf type {@code google.api.servicecontrol.v1.Distribution.ExplicitBuckets} */ public static final class ExplicitBuckets extends com.google.protobuf.GeneratedMessageV3 implements // @@protoc_insertion_point(message_implements:google.api.servicecontrol.v1.Distribution.ExplicitBuckets) ExplicitBucketsOrBuilder { private static final long serialVersionUID = 0L; // Use ExplicitBuckets.newBuilder() to construct. private ExplicitBuckets(com.google.protobuf.GeneratedMessageV3.Builder builder) { super(builder); } private ExplicitBuckets() { bounds_ = emptyDoubleList(); } @java.lang.Override @SuppressWarnings({"unused"}) protected java.lang.Object newInstance(UnusedPrivateParameter unused) { return new ExplicitBuckets(); } @java.lang.Override public final com.google.protobuf.UnknownFieldSet getUnknownFields() { return this.unknownFields; } public static final com.google.protobuf.Descriptors.Descriptor getDescriptor() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_ExplicitBuckets_descriptor; } @java.lang.Override protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable() { return com.google.api.servicecontrol.v1.DistributionProto .internal_static_google_api_servicecontrol_v1_Distribution_ExplicitBuckets_fieldAccessorTable .ensureFieldAccessorsInitialized( com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.class, com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder.class); } public static final int BOUNDS_FIELD_NUMBER = 1; @SuppressWarnings("serial") private com.google.protobuf.Internal.DoubleList bounds_; /** * * *
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return A list containing the bounds.
*/
@java.lang.Override
public java.util.List
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return The count of bounds.
*/
public int getBoundsCount() {
return bounds_.size();
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param index The index of the element to return.
* @return The bounds at the given index.
*/
public double getBounds(int index) {
return bounds_.getDouble(index);
}
private int boundsMemoizedSerializedSize = -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 (getBoundsList().size() > 0) {
output.writeUInt32NoTag(10);
output.writeUInt32NoTag(boundsMemoizedSerializedSize);
}
for (int i = 0; i < bounds_.size(); i++) {
output.writeDoubleNoTag(bounds_.getDouble(i));
}
getUnknownFields().writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
{
int dataSize = 0;
dataSize = 8 * getBoundsList().size();
size += dataSize;
if (!getBoundsList().isEmpty()) {
size += 1;
size += com.google.protobuf.CodedOutputStream.computeInt32SizeNoTag(dataSize);
}
boundsMemoizedSerializedSize = dataSize;
}
size += getUnknownFields().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.api.servicecontrol.v1.Distribution.ExplicitBuckets)) {
return super.equals(obj);
}
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets other =
(com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) obj;
if (!getBoundsList().equals(other.getBoundsList())) return false;
if (!getUnknownFields().equals(other.getUnknownFields())) return false;
return true;
}
@java.lang.Override
public int hashCode() {
if (memoizedHashCode != 0) {
return memoizedHashCode;
}
int hash = 41;
hash = (19 * hash) + getDescriptor().hashCode();
if (getBoundsCount() > 0) {
hash = (37 * hash) + BOUNDS_FIELD_NUMBER;
hash = (53 * hash) + getBoundsList().hashCode();
}
hash = (29 * hash) + getUnknownFields().hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
java.nio.ByteBuffer data) throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets 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.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
byte[] data) throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets 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.api.servicecontrol.v1.Distribution.ExplicitBuckets parseDelimitedFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseDelimitedWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets 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.api.servicecontrol.v1.Distribution.ExplicitBuckets parseFrom(
com.google.protobuf.CodedInputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets 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.api.servicecontrol.v1.Distribution.ExplicitBuckets 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;
}
/**
*
*
*
* Describing buckets with arbitrary user-provided width.
*
*
* Protobuf type {@code google.api.servicecontrol.v1.Distribution.ExplicitBuckets}
*/
public static final class Builder
extends com.google.protobuf.GeneratedMessageV3.Builder
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return A list containing the bounds.
*/
public java.util.List
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return The count of bounds.
*/
public int getBoundsCount() {
return bounds_.size();
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param index The index of the element to return.
* @return The bounds at the given index.
*/
public double getBounds(int index) {
return bounds_.getDouble(index);
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param index The index to set the value at.
* @param value The bounds to set.
* @return This builder for chaining.
*/
public Builder setBounds(int index, double value) {
ensureBoundsIsMutable();
bounds_.setDouble(index, value);
onChanged();
return this;
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param value The bounds to add.
* @return This builder for chaining.
*/
public Builder addBounds(double value) {
ensureBoundsIsMutable();
bounds_.addDouble(value);
onChanged();
return this;
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @param values The bounds to add.
* @return This builder for chaining.
*/
public Builder addAllBounds(java.lang.Iterable values) {
ensureBoundsIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(values, bounds_);
onChanged();
return this;
}
/**
*
*
*
* 'bound' is a list of strictly increasing boundaries between
* buckets. Note that a list of length N-1 defines N buckets because
* of fenceposting. See comments on `bucket_options` for details.
* The i'th finite bucket covers the interval
* [bound[i-1], bound[i])
* where i ranges from 1 to bound_size() - 1. Note that there are no
* finite buckets at all if 'bound' only contains a single element; in
* that special case the single bound defines the boundary between the
* underflow and overflow buckets.
* bucket number lower bound upper bound
* i == 0 (underflow) -inf bound[i]
* 0 < i < bound_size() bound[i-1] bound[i]
* i == bound_size() (overflow) bound[i-1] +inf
*
*
* repeated double bounds = 1;
*
* @return This builder for chaining.
*/
public Builder clearBounds() {
bounds_ = emptyDoubleList();
bitField0_ = (bitField0_ & ~0x00000001);
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:google.api.servicecontrol.v1.Distribution.ExplicitBuckets)
}
// @@protoc_insertion_point(class_scope:google.api.servicecontrol.v1.Distribution.ExplicitBuckets)
private static final com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets
DEFAULT_INSTANCE;
static {
DEFAULT_INSTANCE = new com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets();
}
public static com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets
getDefaultInstance() {
return DEFAULT_INSTANCE;
}
private static final com.google.protobuf.Parser* The total number of samples in the distribution. Must be >= 0. ** *
int64 count = 1;
*
* @return The count.
*/
@java.lang.Override
public long getCount() {
return count_;
}
public static final int MEAN_FIELD_NUMBER = 2;
private double mean_ = 0D;
/**
*
*
* * The arithmetic mean of the samples in the distribution. If `count` is * zero then this field must be zero. ** *
double mean = 2;
*
* @return The mean.
*/
@java.lang.Override
public double getMean() {
return mean_;
}
public static final int MINIMUM_FIELD_NUMBER = 3;
private double minimum_ = 0D;
/**
*
*
* * The minimum of the population of values. Ignored if `count` is zero. ** *
double minimum = 3;
*
* @return The minimum.
*/
@java.lang.Override
public double getMinimum() {
return minimum_;
}
public static final int MAXIMUM_FIELD_NUMBER = 4;
private double maximum_ = 0D;
/**
*
*
* * The maximum of the population of values. Ignored if `count` is zero. ** *
double maximum = 4;
*
* @return The maximum.
*/
@java.lang.Override
public double getMaximum() {
return maximum_;
}
public static final int SUM_OF_SQUARED_DEVIATION_FIELD_NUMBER = 5;
private double sumOfSquaredDeviation_ = 0D;
/**
*
*
* * The sum of squared deviations from the mean: * Sum[i=1..count]((x_i - mean)^2) * where each x_i is a sample values. If `count` is zero then this field * must be zero, otherwise validation of the request fails. ** *
double sum_of_squared_deviation = 5;
*
* @return The sumOfSquaredDeviation.
*/
@java.lang.Override
public double getSumOfSquaredDeviation() {
return sumOfSquaredDeviation_;
}
public static final int BUCKET_COUNTS_FIELD_NUMBER = 6;
@SuppressWarnings("serial")
private com.google.protobuf.Internal.LongList bucketCounts_;
/**
*
*
* * The number of samples in each histogram bucket. `bucket_counts` are * optional. If present, they must sum to the `count` value. * The buckets are defined below in `bucket_option`. There are N buckets. * `bucket_counts[0]` is the number of samples in the underflow bucket. * `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples * in each of the finite buckets. And `bucket_counts[N] is the number * of samples in the overflow bucket. See the comments of `bucket_option` * below for more details. * Any suffix of trailing zeros may be omitted. ** *
repeated int64 bucket_counts = 6;
*
* @return A list containing the bucketCounts.
*/
@java.lang.Override
public java.util.List* The number of samples in each histogram bucket. `bucket_counts` are * optional. If present, they must sum to the `count` value. * The buckets are defined below in `bucket_option`. There are N buckets. * `bucket_counts[0]` is the number of samples in the underflow bucket. * `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples * in each of the finite buckets. And `bucket_counts[N] is the number * of samples in the overflow bucket. See the comments of `bucket_option` * below for more details. * Any suffix of trailing zeros may be omitted. ** *
repeated int64 bucket_counts = 6;
*
* @return The count of bucketCounts.
*/
public int getBucketCountsCount() {
return bucketCounts_.size();
}
/**
*
*
* * The number of samples in each histogram bucket. `bucket_counts` are * optional. If present, they must sum to the `count` value. * The buckets are defined below in `bucket_option`. There are N buckets. * `bucket_counts[0]` is the number of samples in the underflow bucket. * `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples * in each of the finite buckets. And `bucket_counts[N] is the number * of samples in the overflow bucket. See the comments of `bucket_option` * below for more details. * Any suffix of trailing zeros may be omitted. ** *
repeated int64 bucket_counts = 6;
*
* @param index The index of the element to return.
* @return The bucketCounts at the given index.
*/
public long getBucketCounts(int index) {
return bucketCounts_.getLong(index);
}
private int bucketCountsMemoizedSerializedSize = -1;
public static final int LINEAR_BUCKETS_FIELD_NUMBER = 7;
/**
*
*
* * Buckets with constant width. ** *
.google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*
* @return Whether the linearBuckets field is set.
*/
@java.lang.Override
public boolean hasLinearBuckets() {
return bucketOptionCase_ == 7;
}
/**
*
*
* * Buckets with constant width. ** *
.google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*
* @return The linearBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.LinearBuckets getLinearBuckets() {
if (bucketOptionCase_ == 7) {
return (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
}
/**
*
*
* * Buckets with constant width. ** *
.google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.LinearBucketsOrBuilder
getLinearBucketsOrBuilder() {
if (bucketOptionCase_ == 7) {
return (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
}
public static final int EXPONENTIAL_BUCKETS_FIELD_NUMBER = 8;
/**
*
*
* * Buckets with exponentially growing width. ** *
.google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*
* @return Whether the exponentialBuckets field is set.
*/
@java.lang.Override
public boolean hasExponentialBuckets() {
return bucketOptionCase_ == 8;
}
/**
*
*
* * Buckets with exponentially growing width. ** *
.google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*
* @return The exponentialBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets getExponentialBuckets() {
if (bucketOptionCase_ == 8) {
return (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.getDefaultInstance();
}
/**
*
*
* * Buckets with exponentially growing width. ** *
.google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExponentialBucketsOrBuilder
getExponentialBucketsOrBuilder() {
if (bucketOptionCase_ == 8) {
return (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.getDefaultInstance();
}
public static final int EXPLICIT_BUCKETS_FIELD_NUMBER = 9;
/**
*
*
* * Buckets with arbitrary user-provided width. ** *
.google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*
* @return Whether the explicitBuckets field is set.
*/
@java.lang.Override
public boolean hasExplicitBuckets() {
return bucketOptionCase_ == 9;
}
/**
*
*
* * Buckets with arbitrary user-provided width. ** *
.google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*
* @return The explicitBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets getExplicitBuckets() {
if (bucketOptionCase_ == 9) {
return (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
}
/**
*
*
* * Buckets with arbitrary user-provided width. ** *
.google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExplicitBucketsOrBuilder
getExplicitBucketsOrBuilder() {
if (bucketOptionCase_ == 9) {
return (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
}
public static final int EXEMPLARS_FIELD_NUMBER = 10;
@SuppressWarnings("serial")
private java.util.List* Example points. Must be in increasing order of `value` field. ** *
repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
@java.lang.Override
public java.util.List* Example points. Must be in increasing order of `value` field. ** *
repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
@java.lang.Override
public java.util.List
getExemplarsOrBuilderList() {
return exemplars_;
}
/**
*
*
* * Example points. Must be in increasing order of `value` field. ** *
repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
@java.lang.Override
public int getExemplarsCount() {
return exemplars_.size();
}
/**
*
*
* * Example points. Must be in increasing order of `value` field. ** *
repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
@java.lang.Override
public com.google.api.Distribution.Exemplar getExemplars(int index) {
return exemplars_.get(index);
}
/**
*
*
* * Example points. Must be in increasing order of `value` field. ** *
repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
@java.lang.Override
public com.google.api.Distribution.ExemplarOrBuilder getExemplarsOrBuilder(int index) {
return exemplars_.get(index);
}
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 (count_ != 0L) {
output.writeInt64(1, count_);
}
if (java.lang.Double.doubleToRawLongBits(mean_) != 0) {
output.writeDouble(2, mean_);
}
if (java.lang.Double.doubleToRawLongBits(minimum_) != 0) {
output.writeDouble(3, minimum_);
}
if (java.lang.Double.doubleToRawLongBits(maximum_) != 0) {
output.writeDouble(4, maximum_);
}
if (java.lang.Double.doubleToRawLongBits(sumOfSquaredDeviation_) != 0) {
output.writeDouble(5, sumOfSquaredDeviation_);
}
if (getBucketCountsList().size() > 0) {
output.writeUInt32NoTag(50);
output.writeUInt32NoTag(bucketCountsMemoizedSerializedSize);
}
for (int i = 0; i < bucketCounts_.size(); i++) {
output.writeInt64NoTag(bucketCounts_.getLong(i));
}
if (bucketOptionCase_ == 7) {
output.writeMessage(
7, (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_);
}
if (bucketOptionCase_ == 8) {
output.writeMessage(
8, (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_);
}
if (bucketOptionCase_ == 9) {
output.writeMessage(
9, (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_);
}
for (int i = 0; i < exemplars_.size(); i++) {
output.writeMessage(10, exemplars_.get(i));
}
getUnknownFields().writeTo(output);
}
@java.lang.Override
public int getSerializedSize() {
int size = memoizedSize;
if (size != -1) return size;
size = 0;
if (count_ != 0L) {
size += com.google.protobuf.CodedOutputStream.computeInt64Size(1, count_);
}
if (java.lang.Double.doubleToRawLongBits(mean_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(2, mean_);
}
if (java.lang.Double.doubleToRawLongBits(minimum_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(3, minimum_);
}
if (java.lang.Double.doubleToRawLongBits(maximum_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(4, maximum_);
}
if (java.lang.Double.doubleToRawLongBits(sumOfSquaredDeviation_) != 0) {
size += com.google.protobuf.CodedOutputStream.computeDoubleSize(5, sumOfSquaredDeviation_);
}
{
int dataSize = 0;
for (int i = 0; i < bucketCounts_.size(); i++) {
dataSize +=
com.google.protobuf.CodedOutputStream.computeInt64SizeNoTag(bucketCounts_.getLong(i));
}
size += dataSize;
if (!getBucketCountsList().isEmpty()) {
size += 1;
size += com.google.protobuf.CodedOutputStream.computeInt32SizeNoTag(dataSize);
}
bucketCountsMemoizedSerializedSize = dataSize;
}
if (bucketOptionCase_ == 7) {
size +=
com.google.protobuf.CodedOutputStream.computeMessageSize(
7, (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_);
}
if (bucketOptionCase_ == 8) {
size +=
com.google.protobuf.CodedOutputStream.computeMessageSize(
8, (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_);
}
if (bucketOptionCase_ == 9) {
size +=
com.google.protobuf.CodedOutputStream.computeMessageSize(
9, (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_);
}
for (int i = 0; i < exemplars_.size(); i++) {
size += com.google.protobuf.CodedOutputStream.computeMessageSize(10, exemplars_.get(i));
}
size += getUnknownFields().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.api.servicecontrol.v1.Distribution)) {
return super.equals(obj);
}
com.google.api.servicecontrol.v1.Distribution other =
(com.google.api.servicecontrol.v1.Distribution) obj;
if (getCount() != other.getCount()) return false;
if (java.lang.Double.doubleToLongBits(getMean())
!= java.lang.Double.doubleToLongBits(other.getMean())) return false;
if (java.lang.Double.doubleToLongBits(getMinimum())
!= java.lang.Double.doubleToLongBits(other.getMinimum())) return false;
if (java.lang.Double.doubleToLongBits(getMaximum())
!= java.lang.Double.doubleToLongBits(other.getMaximum())) return false;
if (java.lang.Double.doubleToLongBits(getSumOfSquaredDeviation())
!= java.lang.Double.doubleToLongBits(other.getSumOfSquaredDeviation())) return false;
if (!getBucketCountsList().equals(other.getBucketCountsList())) return false;
if (!getExemplarsList().equals(other.getExemplarsList())) return false;
if (!getBucketOptionCase().equals(other.getBucketOptionCase())) return false;
switch (bucketOptionCase_) {
case 7:
if (!getLinearBuckets().equals(other.getLinearBuckets())) return false;
break;
case 8:
if (!getExponentialBuckets().equals(other.getExponentialBuckets())) return false;
break;
case 9:
if (!getExplicitBuckets().equals(other.getExplicitBuckets())) return false;
break;
case 0:
default:
}
if (!getUnknownFields().equals(other.getUnknownFields())) 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) + COUNT_FIELD_NUMBER;
hash = (53 * hash) + com.google.protobuf.Internal.hashLong(getCount());
hash = (37 * hash) + MEAN_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(java.lang.Double.doubleToLongBits(getMean()));
hash = (37 * hash) + MINIMUM_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getMinimum()));
hash = (37 * hash) + MAXIMUM_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getMaximum()));
hash = (37 * hash) + SUM_OF_SQUARED_DEVIATION_FIELD_NUMBER;
hash =
(53 * hash)
+ com.google.protobuf.Internal.hashLong(
java.lang.Double.doubleToLongBits(getSumOfSquaredDeviation()));
if (getBucketCountsCount() > 0) {
hash = (37 * hash) + BUCKET_COUNTS_FIELD_NUMBER;
hash = (53 * hash) + getBucketCountsList().hashCode();
}
if (getExemplarsCount() > 0) {
hash = (37 * hash) + EXEMPLARS_FIELD_NUMBER;
hash = (53 * hash) + getExemplarsList().hashCode();
}
switch (bucketOptionCase_) {
case 7:
hash = (37 * hash) + LINEAR_BUCKETS_FIELD_NUMBER;
hash = (53 * hash) + getLinearBuckets().hashCode();
break;
case 8:
hash = (37 * hash) + EXPONENTIAL_BUCKETS_FIELD_NUMBER;
hash = (53 * hash) + getExponentialBuckets().hashCode();
break;
case 9:
hash = (37 * hash) + EXPLICIT_BUCKETS_FIELD_NUMBER;
hash = (53 * hash) + getExplicitBuckets().hashCode();
break;
case 0:
default:
}
hash = (29 * hash) + getUnknownFields().hashCode();
memoizedHashCode = hash;
return hash;
}
public static com.google.api.servicecontrol.v1.Distribution parseFrom(java.nio.ByteBuffer data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution parseFrom(
java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution parseFrom(
com.google.protobuf.ByteString data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution 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.api.servicecontrol.v1.Distribution parseFrom(byte[] data)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data);
}
public static com.google.api.servicecontrol.v1.Distribution parseFrom(
byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)
throws com.google.protobuf.InvalidProtocolBufferException {
return PARSER.parseFrom(data, extensionRegistry);
}
public static com.google.api.servicecontrol.v1.Distribution parseFrom(java.io.InputStream input)
throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution 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.api.servicecontrol.v1.Distribution parseDelimitedFrom(
java.io.InputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseDelimitedWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution 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.api.servicecontrol.v1.Distribution parseFrom(
com.google.protobuf.CodedInputStream input) throws java.io.IOException {
return com.google.protobuf.GeneratedMessageV3.parseWithIOException(PARSER, input);
}
public static com.google.api.servicecontrol.v1.Distribution 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.api.servicecontrol.v1.Distribution 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;
}
/**
*
*
* * Distribution represents a frequency distribution of double-valued sample * points. It contains the size of the population of sample points plus * additional optional information: * * the arithmetic mean of the samples * * the minimum and maximum of the samples * * the sum-squared-deviation of the samples, used to compute variance * * a histogram of the values of the sample points ** * Protobuf type {@code google.api.servicecontrol.v1.Distribution} */ public static final class Builder extends com.google.protobuf.GeneratedMessageV3.Builder
* The total number of samples in the distribution. Must be >= 0.
*
*
* int64 count = 1;
*
* @return The count.
*/
@java.lang.Override
public long getCount() {
return count_;
}
/**
*
*
*
* The total number of samples in the distribution. Must be >= 0.
*
*
* int64 count = 1;
*
* @param value The count to set.
* @return This builder for chaining.
*/
public Builder setCount(long value) {
count_ = value;
bitField0_ |= 0x00000001;
onChanged();
return this;
}
/**
*
*
*
* The total number of samples in the distribution. Must be >= 0.
*
*
* int64 count = 1;
*
* @return This builder for chaining.
*/
public Builder clearCount() {
bitField0_ = (bitField0_ & ~0x00000001);
count_ = 0L;
onChanged();
return this;
}
private double mean_;
/**
*
*
*
* The arithmetic mean of the samples in the distribution. If `count` is
* zero then this field must be zero.
*
*
* double mean = 2;
*
* @return The mean.
*/
@java.lang.Override
public double getMean() {
return mean_;
}
/**
*
*
*
* The arithmetic mean of the samples in the distribution. If `count` is
* zero then this field must be zero.
*
*
* double mean = 2;
*
* @param value The mean to set.
* @return This builder for chaining.
*/
public Builder setMean(double value) {
mean_ = value;
bitField0_ |= 0x00000002;
onChanged();
return this;
}
/**
*
*
*
* The arithmetic mean of the samples in the distribution. If `count` is
* zero then this field must be zero.
*
*
* double mean = 2;
*
* @return This builder for chaining.
*/
public Builder clearMean() {
bitField0_ = (bitField0_ & ~0x00000002);
mean_ = 0D;
onChanged();
return this;
}
private double minimum_;
/**
*
*
*
* The minimum of the population of values. Ignored if `count` is zero.
*
*
* double minimum = 3;
*
* @return The minimum.
*/
@java.lang.Override
public double getMinimum() {
return minimum_;
}
/**
*
*
*
* The minimum of the population of values. Ignored if `count` is zero.
*
*
* double minimum = 3;
*
* @param value The minimum to set.
* @return This builder for chaining.
*/
public Builder setMinimum(double value) {
minimum_ = value;
bitField0_ |= 0x00000004;
onChanged();
return this;
}
/**
*
*
*
* The minimum of the population of values. Ignored if `count` is zero.
*
*
* double minimum = 3;
*
* @return This builder for chaining.
*/
public Builder clearMinimum() {
bitField0_ = (bitField0_ & ~0x00000004);
minimum_ = 0D;
onChanged();
return this;
}
private double maximum_;
/**
*
*
*
* The maximum of the population of values. Ignored if `count` is zero.
*
*
* double maximum = 4;
*
* @return The maximum.
*/
@java.lang.Override
public double getMaximum() {
return maximum_;
}
/**
*
*
*
* The maximum of the population of values. Ignored if `count` is zero.
*
*
* double maximum = 4;
*
* @param value The maximum to set.
* @return This builder for chaining.
*/
public Builder setMaximum(double value) {
maximum_ = value;
bitField0_ |= 0x00000008;
onChanged();
return this;
}
/**
*
*
*
* The maximum of the population of values. Ignored if `count` is zero.
*
*
* double maximum = 4;
*
* @return This builder for chaining.
*/
public Builder clearMaximum() {
bitField0_ = (bitField0_ & ~0x00000008);
maximum_ = 0D;
onChanged();
return this;
}
private double sumOfSquaredDeviation_;
/**
*
*
*
* The sum of squared deviations from the mean:
* Sum[i=1..count]((x_i - mean)^2)
* where each x_i is a sample values. If `count` is zero then this field
* must be zero, otherwise validation of the request fails.
*
*
* double sum_of_squared_deviation = 5;
*
* @return The sumOfSquaredDeviation.
*/
@java.lang.Override
public double getSumOfSquaredDeviation() {
return sumOfSquaredDeviation_;
}
/**
*
*
*
* The sum of squared deviations from the mean:
* Sum[i=1..count]((x_i - mean)^2)
* where each x_i is a sample values. If `count` is zero then this field
* must be zero, otherwise validation of the request fails.
*
*
* double sum_of_squared_deviation = 5;
*
* @param value The sumOfSquaredDeviation to set.
* @return This builder for chaining.
*/
public Builder setSumOfSquaredDeviation(double value) {
sumOfSquaredDeviation_ = value;
bitField0_ |= 0x00000010;
onChanged();
return this;
}
/**
*
*
*
* The sum of squared deviations from the mean:
* Sum[i=1..count]((x_i - mean)^2)
* where each x_i is a sample values. If `count` is zero then this field
* must be zero, otherwise validation of the request fails.
*
*
* double sum_of_squared_deviation = 5;
*
* @return This builder for chaining.
*/
public Builder clearSumOfSquaredDeviation() {
bitField0_ = (bitField0_ & ~0x00000010);
sumOfSquaredDeviation_ = 0D;
onChanged();
return this;
}
private com.google.protobuf.Internal.LongList bucketCounts_ = emptyLongList();
private void ensureBucketCountsIsMutable() {
if (!((bitField0_ & 0x00000020) != 0)) {
bucketCounts_ = mutableCopy(bucketCounts_);
bitField0_ |= 0x00000020;
}
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @return A list containing the bucketCounts.
*/
public java.util.List
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @return The count of bucketCounts.
*/
public int getBucketCountsCount() {
return bucketCounts_.size();
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @param index The index of the element to return.
* @return The bucketCounts at the given index.
*/
public long getBucketCounts(int index) {
return bucketCounts_.getLong(index);
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @param index The index to set the value at.
* @param value The bucketCounts to set.
* @return This builder for chaining.
*/
public Builder setBucketCounts(int index, long value) {
ensureBucketCountsIsMutable();
bucketCounts_.setLong(index, value);
onChanged();
return this;
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @param value The bucketCounts to add.
* @return This builder for chaining.
*/
public Builder addBucketCounts(long value) {
ensureBucketCountsIsMutable();
bucketCounts_.addLong(value);
onChanged();
return this;
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @param values The bucketCounts to add.
* @return This builder for chaining.
*/
public Builder addAllBucketCounts(java.lang.Iterable values) {
ensureBucketCountsIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(values, bucketCounts_);
onChanged();
return this;
}
/**
*
*
*
* The number of samples in each histogram bucket. `bucket_counts` are
* optional. If present, they must sum to the `count` value.
* The buckets are defined below in `bucket_option`. There are N buckets.
* `bucket_counts[0]` is the number of samples in the underflow bucket.
* `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples
* in each of the finite buckets. And `bucket_counts[N] is the number
* of samples in the overflow bucket. See the comments of `bucket_option`
* below for more details.
* Any suffix of trailing zeros may be omitted.
*
*
* repeated int64 bucket_counts = 6;
*
* @return This builder for chaining.
*/
public Builder clearBucketCounts() {
bucketCounts_ = emptyLongList();
bitField0_ = (bitField0_ & ~0x00000020);
onChanged();
return this;
}
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.LinearBuckets,
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.LinearBucketsOrBuilder>
linearBucketsBuilder_;
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*
* @return Whether the linearBuckets field is set.
*/
@java.lang.Override
public boolean hasLinearBuckets() {
return bucketOptionCase_ == 7;
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*
* @return The linearBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.LinearBuckets getLinearBuckets() {
if (linearBucketsBuilder_ == null) {
if (bucketOptionCase_ == 7) {
return (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
} else {
if (bucketOptionCase_ == 7) {
return linearBucketsBuilder_.getMessage();
}
return com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
public Builder setLinearBuckets(
com.google.api.servicecontrol.v1.Distribution.LinearBuckets value) {
if (linearBucketsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
bucketOption_ = value;
onChanged();
} else {
linearBucketsBuilder_.setMessage(value);
}
bucketOptionCase_ = 7;
return this;
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
public Builder setLinearBuckets(
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder builderForValue) {
if (linearBucketsBuilder_ == null) {
bucketOption_ = builderForValue.build();
onChanged();
} else {
linearBucketsBuilder_.setMessage(builderForValue.build());
}
bucketOptionCase_ = 7;
return this;
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
public Builder mergeLinearBuckets(
com.google.api.servicecontrol.v1.Distribution.LinearBuckets value) {
if (linearBucketsBuilder_ == null) {
if (bucketOptionCase_ == 7
&& bucketOption_
!= com.google.api.servicecontrol.v1.Distribution.LinearBuckets
.getDefaultInstance()) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.newBuilder(
(com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_)
.mergeFrom(value)
.buildPartial();
} else {
bucketOption_ = value;
}
onChanged();
} else {
if (bucketOptionCase_ == 7) {
linearBucketsBuilder_.mergeFrom(value);
} else {
linearBucketsBuilder_.setMessage(value);
}
}
bucketOptionCase_ = 7;
return this;
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
public Builder clearLinearBuckets() {
if (linearBucketsBuilder_ == null) {
if (bucketOptionCase_ == 7) {
bucketOptionCase_ = 0;
bucketOption_ = null;
onChanged();
}
} else {
if (bucketOptionCase_ == 7) {
bucketOptionCase_ = 0;
bucketOption_ = null;
}
linearBucketsBuilder_.clear();
}
return this;
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
public com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder
getLinearBucketsBuilder() {
return getLinearBucketsFieldBuilder().getBuilder();
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.LinearBucketsOrBuilder
getLinearBucketsOrBuilder() {
if ((bucketOptionCase_ == 7) && (linearBucketsBuilder_ != null)) {
return linearBucketsBuilder_.getMessageOrBuilder();
} else {
if (bucketOptionCase_ == 7) {
return (com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with constant width.
*
*
* .google.api.servicecontrol.v1.Distribution.LinearBuckets linear_buckets = 7;
*/
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.LinearBuckets,
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.LinearBucketsOrBuilder>
getLinearBucketsFieldBuilder() {
if (linearBucketsBuilder_ == null) {
if (!(bucketOptionCase_ == 7)) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.getDefaultInstance();
}
linearBucketsBuilder_ =
new com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.LinearBuckets,
com.google.api.servicecontrol.v1.Distribution.LinearBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.LinearBucketsOrBuilder>(
(com.google.api.servicecontrol.v1.Distribution.LinearBuckets) bucketOption_,
getParentForChildren(),
isClean());
bucketOption_ = null;
}
bucketOptionCase_ = 7;
onChanged();
return linearBucketsBuilder_;
}
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets,
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExponentialBucketsOrBuilder>
exponentialBucketsBuilder_;
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*
* @return Whether the exponentialBuckets field is set.
*/
@java.lang.Override
public boolean hasExponentialBuckets() {
return bucketOptionCase_ == 8;
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*
* @return The exponentialBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
getExponentialBuckets() {
if (exponentialBucketsBuilder_ == null) {
if (bucketOptionCase_ == 8) {
return (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
.getDefaultInstance();
} else {
if (bucketOptionCase_ == 8) {
return exponentialBucketsBuilder_.getMessage();
}
return com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
public Builder setExponentialBuckets(
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets value) {
if (exponentialBucketsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
bucketOption_ = value;
onChanged();
} else {
exponentialBucketsBuilder_.setMessage(value);
}
bucketOptionCase_ = 8;
return this;
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
public Builder setExponentialBuckets(
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder builderForValue) {
if (exponentialBucketsBuilder_ == null) {
bucketOption_ = builderForValue.build();
onChanged();
} else {
exponentialBucketsBuilder_.setMessage(builderForValue.build());
}
bucketOptionCase_ = 8;
return this;
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
public Builder mergeExponentialBuckets(
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets value) {
if (exponentialBucketsBuilder_ == null) {
if (bucketOptionCase_ == 8
&& bucketOption_
!= com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
.getDefaultInstance()) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.newBuilder(
(com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets)
bucketOption_)
.mergeFrom(value)
.buildPartial();
} else {
bucketOption_ = value;
}
onChanged();
} else {
if (bucketOptionCase_ == 8) {
exponentialBucketsBuilder_.mergeFrom(value);
} else {
exponentialBucketsBuilder_.setMessage(value);
}
}
bucketOptionCase_ = 8;
return this;
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
public Builder clearExponentialBuckets() {
if (exponentialBucketsBuilder_ == null) {
if (bucketOptionCase_ == 8) {
bucketOptionCase_ = 0;
bucketOption_ = null;
onChanged();
}
} else {
if (bucketOptionCase_ == 8) {
bucketOptionCase_ = 0;
bucketOption_ = null;
}
exponentialBucketsBuilder_.clear();
}
return this;
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
public com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder
getExponentialBucketsBuilder() {
return getExponentialBucketsFieldBuilder().getBuilder();
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExponentialBucketsOrBuilder
getExponentialBucketsOrBuilder() {
if ((bucketOptionCase_ == 8) && (exponentialBucketsBuilder_ != null)) {
return exponentialBucketsBuilder_.getMessageOrBuilder();
} else {
if (bucketOptionCase_ == 8) {
return (com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets
.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with exponentially growing width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExponentialBuckets exponential_buckets = 8;
*
*/
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets,
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExponentialBucketsOrBuilder>
getExponentialBucketsFieldBuilder() {
if (exponentialBucketsBuilder_ == null) {
if (!(bucketOptionCase_ == 8)) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.getDefaultInstance();
}
exponentialBucketsBuilder_ =
new com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets,
com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExponentialBucketsOrBuilder>(
(com.google.api.servicecontrol.v1.Distribution.ExponentialBuckets) bucketOption_,
getParentForChildren(),
isClean());
bucketOption_ = null;
}
bucketOptionCase_ = 8;
onChanged();
return exponentialBucketsBuilder_;
}
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets,
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExplicitBucketsOrBuilder>
explicitBucketsBuilder_;
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*
* @return Whether the explicitBuckets field is set.
*/
@java.lang.Override
public boolean hasExplicitBuckets() {
return bucketOptionCase_ == 9;
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*
* @return The explicitBuckets.
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets getExplicitBuckets() {
if (explicitBucketsBuilder_ == null) {
if (bucketOptionCase_ == 9) {
return (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
} else {
if (bucketOptionCase_ == 9) {
return explicitBucketsBuilder_.getMessage();
}
return com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
public Builder setExplicitBuckets(
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets value) {
if (explicitBucketsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
bucketOption_ = value;
onChanged();
} else {
explicitBucketsBuilder_.setMessage(value);
}
bucketOptionCase_ = 9;
return this;
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
public Builder setExplicitBuckets(
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder builderForValue) {
if (explicitBucketsBuilder_ == null) {
bucketOption_ = builderForValue.build();
onChanged();
} else {
explicitBucketsBuilder_.setMessage(builderForValue.build());
}
bucketOptionCase_ = 9;
return this;
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
public Builder mergeExplicitBuckets(
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets value) {
if (explicitBucketsBuilder_ == null) {
if (bucketOptionCase_ == 9
&& bucketOption_
!= com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets
.getDefaultInstance()) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.newBuilder(
(com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_)
.mergeFrom(value)
.buildPartial();
} else {
bucketOption_ = value;
}
onChanged();
} else {
if (bucketOptionCase_ == 9) {
explicitBucketsBuilder_.mergeFrom(value);
} else {
explicitBucketsBuilder_.setMessage(value);
}
}
bucketOptionCase_ = 9;
return this;
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
public Builder clearExplicitBuckets() {
if (explicitBucketsBuilder_ == null) {
if (bucketOptionCase_ == 9) {
bucketOptionCase_ = 0;
bucketOption_ = null;
onChanged();
}
} else {
if (bucketOptionCase_ == 9) {
bucketOptionCase_ = 0;
bucketOption_ = null;
}
explicitBucketsBuilder_.clear();
}
return this;
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
public com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder
getExplicitBucketsBuilder() {
return getExplicitBucketsFieldBuilder().getBuilder();
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
@java.lang.Override
public com.google.api.servicecontrol.v1.Distribution.ExplicitBucketsOrBuilder
getExplicitBucketsOrBuilder() {
if ((bucketOptionCase_ == 9) && (explicitBucketsBuilder_ != null)) {
return explicitBucketsBuilder_.getMessageOrBuilder();
} else {
if (bucketOptionCase_ == 9) {
return (com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_;
}
return com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
}
}
/**
*
*
*
* Buckets with arbitrary user-provided width.
*
*
* .google.api.servicecontrol.v1.Distribution.ExplicitBuckets explicit_buckets = 9;
*/
private com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets,
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExplicitBucketsOrBuilder>
getExplicitBucketsFieldBuilder() {
if (explicitBucketsBuilder_ == null) {
if (!(bucketOptionCase_ == 9)) {
bucketOption_ =
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.getDefaultInstance();
}
explicitBucketsBuilder_ =
new com.google.protobuf.SingleFieldBuilderV3<
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets,
com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets.Builder,
com.google.api.servicecontrol.v1.Distribution.ExplicitBucketsOrBuilder>(
(com.google.api.servicecontrol.v1.Distribution.ExplicitBuckets) bucketOption_,
getParentForChildren(),
isClean());
bucketOption_ = null;
}
bucketOptionCase_ = 9;
onChanged();
return explicitBucketsBuilder_;
}
private java.util.List
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public java.util.List
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public int getExemplarsCount() {
if (exemplarsBuilder_ == null) {
return exemplars_.size();
} else {
return exemplarsBuilder_.getCount();
}
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public com.google.api.Distribution.Exemplar getExemplars(int index) {
if (exemplarsBuilder_ == null) {
return exemplars_.get(index);
} else {
return exemplarsBuilder_.getMessage(index);
}
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder setExemplars(int index, com.google.api.Distribution.Exemplar value) {
if (exemplarsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureExemplarsIsMutable();
exemplars_.set(index, value);
onChanged();
} else {
exemplarsBuilder_.setMessage(index, value);
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder setExemplars(
int index, com.google.api.Distribution.Exemplar.Builder builderForValue) {
if (exemplarsBuilder_ == null) {
ensureExemplarsIsMutable();
exemplars_.set(index, builderForValue.build());
onChanged();
} else {
exemplarsBuilder_.setMessage(index, builderForValue.build());
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder addExemplars(com.google.api.Distribution.Exemplar value) {
if (exemplarsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureExemplarsIsMutable();
exemplars_.add(value);
onChanged();
} else {
exemplarsBuilder_.addMessage(value);
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder addExemplars(int index, com.google.api.Distribution.Exemplar value) {
if (exemplarsBuilder_ == null) {
if (value == null) {
throw new NullPointerException();
}
ensureExemplarsIsMutable();
exemplars_.add(index, value);
onChanged();
} else {
exemplarsBuilder_.addMessage(index, value);
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder addExemplars(com.google.api.Distribution.Exemplar.Builder builderForValue) {
if (exemplarsBuilder_ == null) {
ensureExemplarsIsMutable();
exemplars_.add(builderForValue.build());
onChanged();
} else {
exemplarsBuilder_.addMessage(builderForValue.build());
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder addExemplars(
int index, com.google.api.Distribution.Exemplar.Builder builderForValue) {
if (exemplarsBuilder_ == null) {
ensureExemplarsIsMutable();
exemplars_.add(index, builderForValue.build());
onChanged();
} else {
exemplarsBuilder_.addMessage(index, builderForValue.build());
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder addAllExemplars(
java.lang.Iterable values) {
if (exemplarsBuilder_ == null) {
ensureExemplarsIsMutable();
com.google.protobuf.AbstractMessageLite.Builder.addAll(values, exemplars_);
onChanged();
} else {
exemplarsBuilder_.addAllMessages(values);
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder clearExemplars() {
if (exemplarsBuilder_ == null) {
exemplars_ = java.util.Collections.emptyList();
bitField0_ = (bitField0_ & ~0x00000200);
onChanged();
} else {
exemplarsBuilder_.clear();
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public Builder removeExemplars(int index) {
if (exemplarsBuilder_ == null) {
ensureExemplarsIsMutable();
exemplars_.remove(index);
onChanged();
} else {
exemplarsBuilder_.remove(index);
}
return this;
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public com.google.api.Distribution.Exemplar.Builder getExemplarsBuilder(int index) {
return getExemplarsFieldBuilder().getBuilder(index);
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public com.google.api.Distribution.ExemplarOrBuilder getExemplarsOrBuilder(int index) {
if (exemplarsBuilder_ == null) {
return exemplars_.get(index);
} else {
return exemplarsBuilder_.getMessageOrBuilder(index);
}
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public java.util.List
getExemplarsOrBuilderList() {
if (exemplarsBuilder_ != null) {
return exemplarsBuilder_.getMessageOrBuilderList();
} else {
return java.util.Collections.unmodifiableList(exemplars_);
}
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public com.google.api.Distribution.Exemplar.Builder addExemplarsBuilder() {
return getExemplarsFieldBuilder()
.addBuilder(com.google.api.Distribution.Exemplar.getDefaultInstance());
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public com.google.api.Distribution.Exemplar.Builder addExemplarsBuilder(int index) {
return getExemplarsFieldBuilder()
.addBuilder(index, com.google.api.Distribution.Exemplar.getDefaultInstance());
}
/**
*
*
*
* Example points. Must be in increasing order of `value` field.
*
*
* repeated .google.api.Distribution.Exemplar exemplars = 10;
*/
public java.util.List