Distribution(mapping=None, *, ignore_unknown_fields=False, **kwargs)Distribution represents a frequency distribution of double- alued 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
Attributes | |
|---|---|
| Name | Description |
count |
int
The total number of samples in the distribution. Must be >= 0. |
mean |
float
The arithmetic mean of the samples in the distribution. If count is zero then this field must be zero.
|
minimum |
float
The minimum of the population of values. Ignored if count is zero.
|
maximum |
float
The maximum of the population of values. Ignored if count is zero.
|
sum_of_squared_deviation |
float
The sum of squared deviations from the mean: Sum[i=1..count]((x_i - mean)^2) where each x_i is a sample values. If count is zero then this field must be zero,
otherwise validation of the request fails.
|
bucket_counts |
Sequence[int]
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 of\ bucket_option\`
below for more details.
Any suffix of trailing zeros may be omitted.
|
linear_buckets |
google.cloud.servicecontrol_v1.types.Distribution.LinearBuckets
Buckets with constant width. |
exponential_buckets |
google.cloud.servicecontrol_v1.types.Distribution.ExponentialBuckets
Buckets with exponentially growing width. |
explicit_buckets |
google.cloud.servicecontrol_v1.types.Distribution.ExplicitBuckets
Buckets with arbitrary user-provided width. |
Classes
ExplicitBuckets
ExplicitBuckets(mapping=None, *, ignore_unknown_fields=False, **kwargs)Describing buckets with arbitrary user-provided width. .. attribute:: bounds
'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
:type: Sequence[float]
ExponentialBuckets
ExponentialBuckets(mapping=None, *, ignore_unknown_fields=False, **kwargs)Describing buckets with exponentially growing width. .. attribute:: num_finite_buckets
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.
:type: int
LinearBuckets
LinearBuckets(mapping=None, *, ignore_unknown_fields=False, **kwargs)Describing buckets with constant width. .. attribute:: num_finite_buckets
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.
:type: int