Class Distribution.ExplicitBuckets.Builder

    • Method Detail

      • getDescriptor

        public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
      • internalGetFieldAccessorTable

        protected com.google.protobuf.GeneratedMessageV3.FieldAccessorTable internalGetFieldAccessorTable()
        Specified by:
        internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessageV3.Builder<Distribution.ExplicitBuckets.Builder>
      • getDescriptorForType

        public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
        Specified by:
        getDescriptorForType in interface com.google.protobuf.Message.Builder
        Specified by:
        getDescriptorForType in interface com.google.protobuf.MessageOrBuilder
        Overrides:
        getDescriptorForType in class com.google.protobuf.GeneratedMessageV3.Builder<Distribution.ExplicitBuckets.Builder>
      • getDefaultInstanceForType

        public Distribution.ExplicitBuckets getDefaultInstanceForType()
        Specified by:
        getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuilder
        Specified by:
        getDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilder
      • build

        public Distribution.ExplicitBuckets build()
        Specified by:
        build in interface com.google.protobuf.Message.Builder
        Specified by:
        build in interface com.google.protobuf.MessageLite.Builder
      • buildPartial

        public Distribution.ExplicitBuckets buildPartial()
        Specified by:
        buildPartial in interface com.google.protobuf.Message.Builder
        Specified by:
        buildPartial in interface com.google.protobuf.MessageLite.Builder
      • isInitialized

        public final boolean isInitialized()
        Specified by:
        isInitialized in interface com.google.protobuf.MessageLiteOrBuilder
        Overrides:
        isInitialized in class com.google.protobuf.GeneratedMessageV3.Builder<Distribution.ExplicitBuckets.Builder>
      • mergeFrom

        public Distribution.ExplicitBuckets.Builder mergeFrom​(com.google.protobuf.CodedInputStream input,
                                                              com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                                                       throws IOException
        Specified by:
        mergeFrom in interface com.google.protobuf.Message.Builder
        Specified by:
        mergeFrom in interface com.google.protobuf.MessageLite.Builder
        Overrides:
        mergeFrom in class com.google.protobuf.AbstractMessage.Builder<Distribution.ExplicitBuckets.Builder>
        Throws:
        IOException
      • getBoundsList

        public 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;
        Specified by:
        getBoundsList in interface Distribution.ExplicitBucketsOrBuilder
        Returns:
        A list containing the bounds.
      • getBoundsCount

        public 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;
        Specified by:
        getBoundsCount in interface Distribution.ExplicitBucketsOrBuilder
        Returns:
        The count of bounds.
      • getBounds

        public 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;
        Specified by:
        getBounds in interface Distribution.ExplicitBucketsOrBuilder
        Parameters:
        index - The index of the element to return.
        Returns:
        The bounds at the given index.
      • setBounds

        public Distribution.ExplicitBuckets.Builder setBounds​(int index,
                                                              double value)
         '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 to set the value at.
        value - The bounds to set.
        Returns:
        This builder for chaining.
      • addBounds

        public Distribution.ExplicitBuckets.Builder addBounds​(double value)
         '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:
        value - The bounds to add.
        Returns:
        This builder for chaining.
      • addAllBounds

        public Distribution.ExplicitBuckets.Builder addAllBounds​(Iterable<? extends Double> values)
         '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:
        values - The bounds to add.
        Returns:
        This builder for chaining.
      • clearBounds

        public Distribution.ExplicitBuckets.Builder clearBounds()
         '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:
        This builder for chaining.