t

io.opencensus.proto.stats.v1

DistributionAggregationOrBuilder

trait DistributionAggregationOrBuilder extends MessageOrBuilder

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DistributionAggregationOrBuilder
  2. MessageOrBuilder
  3. MessageLiteOrBuilder
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def findInitializationErrors(): List[String]
    Definition Classes
    MessageOrBuilder
  2. abstract def getAllFields(): Map[FieldDescriptor, AnyRef]
    Definition Classes
    MessageOrBuilder
  3. abstract def getBucketBounds(index: Int): Double

    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.


    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;

    index

    The index of the element to return.

    returns

    The bucketBounds at the given index.

  4. abstract def getBucketBoundsCount(): Int

    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.


    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.

  5. abstract def getBucketBoundsList(): List[Double]

    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.


    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.

  6. abstract def getDefaultInstanceForType(): Message
    Definition Classes
    MessageOrBuilder → MessageLiteOrBuilder
  7. abstract def getDescriptorForType(): Descriptor
    Definition Classes
    MessageOrBuilder
  8. abstract def getField(arg0: FieldDescriptor): AnyRef
    Definition Classes
    MessageOrBuilder
  9. abstract def getInitializationErrorString(): String
    Definition Classes
    MessageOrBuilder
  10. abstract def getOneofFieldDescriptor(arg0: OneofDescriptor): FieldDescriptor
    Definition Classes
    MessageOrBuilder
  11. abstract def getRepeatedField(arg0: FieldDescriptor, arg1: Int): AnyRef
    Definition Classes
    MessageOrBuilder
  12. abstract def getRepeatedFieldCount(arg0: FieldDescriptor): Int
    Definition Classes
    MessageOrBuilder
  13. abstract def getUnknownFields(): UnknownFieldSet
    Definition Classes
    MessageOrBuilder
  14. abstract def hasField(arg0: FieldDescriptor): Boolean
    Definition Classes
    MessageOrBuilder
  15. abstract def hasOneof(arg0: OneofDescriptor): Boolean
    Definition Classes
    MessageOrBuilder
  16. abstract def isInitialized(): Boolean
    Definition Classes
    MessageLiteOrBuilder

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  9. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  18. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  19. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from MessageOrBuilder

Inherited from MessageLiteOrBuilder

Inherited from AnyRef

Inherited from Any

Ungrouped