Package com.google.api.servicecontrol.v1

Interface Distribution.ExplicitBucketsOrBuilder

    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      double getBounds​(int index)
      'bound' is a list of strictly increasing boundaries between buckets.
      int getBoundsCount()
      'bound' is a list of strictly increasing boundaries between buckets.
      List<Double> getBoundsList()
      'bound' is a list of strictly increasing boundaries between buckets.

      • 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

      • getBoundsList

        List<Double> getBoundsList()
         '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;
        Returns:
        A list containing the bounds.

      • getBoundsCount

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

      • getBounds

        double getBounds​(int 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;
        Parameters:
        index - The index of the element to return.
        Returns:
        The bounds at the given index.