Package io.opencensus.proto.stats.v1

Interface DistributionAggregationOrBuilder

  • All Superinterfaces:
    com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder
    All Known Implementing Classes:
    DistributionAggregation, DistributionAggregation.Builder
    public interface DistributionAggregationOrBuilder
extends com.google.protobuf.MessageOrBuilder

    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      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.

      • Methods inherited from interface com.google.protobuf.MessageLiteOrBuilder

        isInitialized

      • Methods inherited from interface com.google.protobuf.MessageOrBuilder

        findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

    • Method Detail

      • getBucketBoundsList

        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;
        Returns:
        A list containing the bucketBounds.

      • getBucketBoundsCount

        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;
        Returns:
        The count of bucketBounds.

      • getBucketBounds

        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;
        Parameters:
        index - The index of the element to return.
        Returns:
        The bucketBounds at the given index.