public static final class DistributionAggregation.Builder extends com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder> implements DistributionAggregationOrBuilder
opencensus.proto.stats.v1.DistributionAggregation| Modifier and Type | Method and Description |
|---|---|
DistributionAggregation.Builder |
addAllBucketBounds(Iterable<? extends Double> values)
A Distribution may optionally contain a histogram of the values in the
population.
|
DistributionAggregation.Builder |
addBucketBounds(double value)
A Distribution may optionally contain a histogram of the values in the
population.
|
DistributionAggregation.Builder |
addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
Object value) |
DistributionAggregation |
build() |
DistributionAggregation |
buildPartial() |
DistributionAggregation.Builder |
clear() |
DistributionAggregation.Builder |
clearBucketBounds()
A Distribution may optionally contain a histogram of the values in the
population.
|
DistributionAggregation.Builder |
clearField(com.google.protobuf.Descriptors.FieldDescriptor field) |
DistributionAggregation.Builder |
clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof) |
DistributionAggregation.Builder |
clone() |
double |
getBucketBounds(int index)
A Distribution may optionally contain a histogram of the values in the
population.
|
int |
getBucketBoundsCount()
A Distribution may optionally contain a histogram of the values in the
population.
|
List<Double> |
getBucketBoundsList()
A Distribution may optionally contain a histogram of the values in the
population.
|
DistributionAggregation |
getDefaultInstanceForType() |
static com.google.protobuf.Descriptors.Descriptor |
getDescriptor() |
com.google.protobuf.Descriptors.Descriptor |
getDescriptorForType() |
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable |
internalGetFieldAccessorTable() |
boolean |
isInitialized() |
DistributionAggregation.Builder |
mergeFrom(com.google.protobuf.CodedInputStream input,
com.google.protobuf.ExtensionRegistryLite extensionRegistry) |
DistributionAggregation.Builder |
mergeFrom(DistributionAggregation other) |
DistributionAggregation.Builder |
mergeFrom(com.google.protobuf.Message other) |
DistributionAggregation.Builder |
mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
DistributionAggregation.Builder |
setBucketBounds(int index,
double value)
A Distribution may optionally contain a histogram of the values in the
population.
|
DistributionAggregation.Builder |
setField(com.google.protobuf.Descriptors.FieldDescriptor field,
Object value) |
DistributionAggregation.Builder |
setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field,
int index,
Object value) |
DistributionAggregation.Builder |
setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields) |
getAllFields, getField, getFieldBuilder, getOneofFieldDescriptor, getParentForChildren, getRepeatedField, getRepeatedFieldBuilder, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMutableMapField, isClean, markClean, newBuilderForField, onBuilt, onChanged, setUnknownFieldsProto3findInitializationErrors, getInitializationErrorString, internalMergeFrom, mergeDelimitedFrom, mergeDelimitedFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, mergeFrom, newUninitializedMessageException, toStringaddAll, addAll, mergeFrom, newUninitializedMessageExceptionequals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitpublic static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()
internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder clear()
clear in interface com.google.protobuf.Message.Builderclear in interface com.google.protobuf.MessageLite.Builderclear in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
getDescriptorForType in interface com.google.protobuf.Message.BuildergetDescriptorForType in interface com.google.protobuf.MessageOrBuildergetDescriptorForType in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation getDefaultInstanceForType()
getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuildergetDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilderpublic DistributionAggregation build()
build in interface com.google.protobuf.Message.Builderbuild in interface com.google.protobuf.MessageLite.Builderpublic DistributionAggregation buildPartial()
buildPartial in interface com.google.protobuf.Message.BuilderbuildPartial in interface com.google.protobuf.MessageLite.Builderpublic DistributionAggregation.Builder clone()
clone in interface com.google.protobuf.Message.Builderclone in interface com.google.protobuf.MessageLite.Builderclone in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder setField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value)
setField in interface com.google.protobuf.Message.BuildersetField in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder clearField(com.google.protobuf.Descriptors.FieldDescriptor field)
clearField in interface com.google.protobuf.Message.BuilderclearField in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder clearOneof(com.google.protobuf.Descriptors.OneofDescriptor oneof)
clearOneof in interface com.google.protobuf.Message.BuilderclearOneof in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder setRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, int index, Object value)
setRepeatedField in interface com.google.protobuf.Message.BuildersetRepeatedField in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder addRepeatedField(com.google.protobuf.Descriptors.FieldDescriptor field, Object value)
addRepeatedField in interface com.google.protobuf.Message.BuilderaddRepeatedField in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder mergeFrom(com.google.protobuf.Message other)
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder mergeFrom(DistributionAggregation other)
public final boolean isInitialized()
isInitialized in interface com.google.protobuf.MessageLiteOrBuilderisInitialized in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public DistributionAggregation.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException
mergeFrom in interface com.google.protobuf.Message.BuildermergeFrom in interface com.google.protobuf.MessageLite.BuildermergeFrom in class com.google.protobuf.AbstractMessage.Builder<DistributionAggregation.Builder>IOExceptionpublic List<Double> getBucketBoundsList()
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;getBucketBoundsList in interface DistributionAggregationOrBuilderpublic int getBucketBoundsCount()
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;getBucketBoundsCount in interface DistributionAggregationOrBuilderpublic double getBucketBounds(int index)
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;getBucketBounds in interface DistributionAggregationOrBuilderpublic DistributionAggregation.Builder setBucketBounds(int index, double value)
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;public DistributionAggregation.Builder addBucketBounds(double value)
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;public DistributionAggregation.Builder addAllBucketBounds(Iterable<? extends Double> values)
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;public DistributionAggregation.Builder clearBucketBounds()
A Distribution may optionally contain a histogram of the values in the population. The bucket boundaries for that histogram are described by `bucket_bounds`. This defines `size(bucket_bounds) + 1` (= N) buckets. The boundaries for bucket index i are: (-infinity, bucket_bounds[i]) for i == 0 [bucket_bounds[i-1], bucket_bounds[i]) for 0 < i < N-2 [bucket_bounds[i-1], +infinity) for i == N-1 i.e. an underflow bucket (number 0), zero or more finite buckets (1 through N - 2, and an overflow bucket (N - 1), with inclusive lower bounds and exclusive upper bounds. If `bucket_bounds` has no elements (zero size), then there is no histogram associated with the Distribution. If `bucket_bounds` has only one element, there are no finite buckets, and that single element is the common boundary of the overflow and underflow buckets. The values must be monotonically increasing.
repeated double bucket_bounds = 1;public final DistributionAggregation.Builder setUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
setUnknownFields in interface com.google.protobuf.Message.BuildersetUnknownFields in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>public final DistributionAggregation.Builder mergeUnknownFields(com.google.protobuf.UnknownFieldSet unknownFields)
mergeUnknownFields in interface com.google.protobuf.Message.BuildermergeUnknownFields in class com.google.protobuf.GeneratedMessageV3.Builder<DistributionAggregation.Builder>