Class: Google::Cloud::ServiceControl::V1::Distribution

Inherits:
Object
  • Object
show all
Extended by:
Protobuf::MessageExts::ClassMethods
Includes:
Protobuf::MessageExts
Defined in:
proto_docs/google/api/servicecontrol/v1/distribution.rb

Overview

Distribution represents a frequency distribution of double-valued sample points. It contains the size of the population of sample points plus additional optional information:

  • the arithmetic mean of the samples
  • the minimum and maximum of the samples
  • the sum-squared-deviation of the samples, used to compute variance
  • a histogram of the values of the sample points

Defined Under Namespace

Classes: ExplicitBuckets, ExponentialBuckets, LinearBuckets

Instance Attribute Summary collapse

Instance Attribute Details

#bucket_counts ⇒ ::Array<::Integer>

Returns The number of samples in each histogram bucket. bucket_counts are optional. If present, they must sum to the count value.

The buckets are defined below in bucket_option. There are N buckets. bucket_counts[0] is the number of samples in the underflow bucket. bucket_counts[1] to bucket_counts[N-1] are the numbers of samples in each of the finite buckets. And bucket_counts[N] is the number of samples in the overflow bucket. See the comments ofbucket_option` below for more details.

Any suffix of trailing zeros may be omitted.

Returns:

  • (::Array<::Integer>) —

    The number of samples in each histogram bucket. bucket_counts are optional. If present, they must sum to the count value.

    The buckets are defined below in bucket_option. There are N buckets. bucket_counts[0] is the number of samples in the underflow bucket. bucket_counts[1] to bucket_counts[N-1] are the numbers of samples in each of the finite buckets. And bucket_counts[N] is the number of samples in the overflow bucket. See the comments ofbucket_option` below for more details.

    Any suffix of trailing zeros may be omitted.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#count ⇒ ::Integer

Returns The total number of samples in the distribution. Must be >= 0.

Returns:

  • (::Integer) —

    The total number of samples in the distribution. Must be >= 0.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#exemplars ⇒ ::Array<::Google::Api::Distribution::Exemplar>

Returns Example points. Must be in increasing order of value field.

Returns:



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#explicit_buckets ⇒ ::Google::Cloud::ServiceControl::V1::Distribution::ExplicitBuckets

Returns Buckets with arbitrary user-provided width.

Returns:



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#exponential_buckets ⇒ ::Google::Cloud::ServiceControl::V1::Distribution::ExponentialBuckets

Returns Buckets with exponentially growing width.

Returns:



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#linear_buckets ⇒ ::Google::Cloud::ServiceControl::V1::Distribution::LinearBuckets

Returns Buckets with constant width.

Returns:



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#maximum ⇒ ::Float

Returns The maximum of the population of values. Ignored if count is zero.

Returns:

  • (::Float) —

    The maximum of the population of values. Ignored if count is zero.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#mean ⇒ ::Float

Returns The arithmetic mean of the samples in the distribution. If count is zero then this field must be zero.

Returns:

  • (::Float) —

    The arithmetic mean of the samples in the distribution. If count is zero then this field must be zero.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#minimum ⇒ ::Float

Returns The minimum of the population of values. Ignored if count is zero.

Returns:

  • (::Float) —

    The minimum of the population of values. Ignored if count is zero.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end

#sum_of_squared_deviation ⇒ ::Float

Returns The sum of squared deviations from the mean: Sumi=1..count where each x_i is a sample values. If count is zero then this field must be zero, otherwise validation of the request fails.

Returns:

  • (::Float) —

    The sum of squared deviations from the mean: Sumi=1..count where each x_i is a sample values. If count is zero then this field must be zero, otherwise validation of the request fails.



76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'proto_docs/google/api/servicecontrol/v1/distribution.rb', line 76

class Distribution
  include ::Google::Protobuf::MessageExts
  extend ::Google::Protobuf::MessageExts::ClassMethods

  # Describing buckets with constant width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] width
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  #     Must be strictly positive.
  # @!attribute [rw] offset
  #   @return [::Float]
  #     The i'th linear bucket covers the interval
  #       [offset + (i-1) * width, offset + i * width)
  #     where i ranges from 1 to num_finite_buckets, inclusive.
  class LinearBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with exponentially growing width.
  # @!attribute [rw] num_finite_buckets
  #   @return [::Integer]
  #     The number of finite buckets. With the underflow and overflow buckets,
  #     the total number of buckets is `num_finite_buckets` + 2.
  #     See comments on `bucket_options` for details.
  # @!attribute [rw] growth_factor
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be larger than 1.0.
  # @!attribute [rw] scale
  #   @return [::Float]
  #     The i'th exponential bucket covers the interval
  #       [scale * growth_factor^(i-1), scale * growth_factor^i)
  #     where i ranges from 1 to num_finite_buckets inclusive.
  #     Must be > 0.
  class ExponentialBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end

  # Describing buckets with arbitrary user-provided width.
  # @!attribute [rw] bounds
  #   @return [::Array<::Float>]
  #     '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
  class ExplicitBuckets
    include ::Google::Protobuf::MessageExts
    extend ::Google::Protobuf::MessageExts::ClassMethods
  end
end