Struct google_api_proto::google::api::Distribution
source · pub struct Distribution {
pub count: i64,
pub mean: f64,
pub sum_of_squared_deviation: f64,
pub range: Option<Range>,
pub bucket_options: Option<BucketOptions>,
pub bucket_counts: Vec<i64>,
pub exemplars: Vec<Exemplar>,
}
Expand description
Distribution
contains summary statistics for a population of values. It
optionally contains a histogram representing the distribution of those values
across a set of buckets.
The summary statistics are the count, mean, sum of the squared deviation from the mean, the minimum, and the maximum of the set of population of values. The histogram is based on a sequence of buckets and gives a count of values that fall into each bucket. The boundaries of the buckets are given either explicitly or by formulas for buckets of fixed or exponentially increasing widths.
Although it is not forbidden, it is generally a bad idea to include
non-finite values (infinities or NaNs) in the population of values, as this
will render the mean
and sum_of_squared_deviation
fields meaningless.
Fields§
§count: i64
The number of values in the population. Must be non-negative. This value
must equal the sum of the values in bucket_counts
if a histogram is
provided.
mean: f64
The arithmetic mean of the values in the population. If count
is zero
then this field must be zero.
sum_of_squared_deviation: f64
The sum of squared deviations from the mean of the values in the population. For values x_i this is:
Sum[i=1..n]((x_i - mean)^2)
Knuth, “The Art of Computer Programming”, Vol. 2, page 232, 3rd edition describes Welford’s method for accumulating this sum in one pass.
If count
is zero then this field must be zero.
range: Option<Range>
If specified, contains the range of the population values. The field
must not be present if the count
is zero.
bucket_options: Option<BucketOptions>
Defines the histogram bucket boundaries. If the distribution does not contain a histogram, then omit this field.
bucket_counts: Vec<i64>
The number of values in each bucket of the histogram, as described in
bucket_options
. If the distribution does not have a histogram, then omit
this field. If there is a histogram, then the sum of the values in
bucket_counts
must equal the value in the count
field of the
distribution.
If present, bucket_counts
should contain N values, where N is the number
of buckets specified in bucket_options
. If you supply fewer than N
values, the remaining values are assumed to be 0.
The order of the values in bucket_counts
follows the bucket numbering
schemes described for the three bucket types. The first value must be the
count for the underflow bucket (number 0). The next N-2 values are the
counts for the finite buckets (number 1 through N-2). The N’th value in
bucket_counts
is the count for the overflow bucket (number N-1).
exemplars: Vec<Exemplar>
Must be in increasing order of value
field.
Trait Implementations§
source§impl Clone for Distribution
impl Clone for Distribution
source§fn clone(&self) -> Distribution
fn clone(&self) -> Distribution
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl Debug for Distribution
impl Debug for Distribution
source§impl Default for Distribution
impl Default for Distribution
source§impl Message for Distribution
impl Message for Distribution
source§fn encoded_len(&self) -> usize
fn encoded_len(&self) -> usize
source§fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>where
Self: Sized,
fn encode(&self, buf: &mut impl BufMut) -> Result<(), EncodeError>where
Self: Sized,
source§fn encode_to_vec(&self) -> Vec<u8>where
Self: Sized,
fn encode_to_vec(&self) -> Vec<u8>where
Self: Sized,
source§fn encode_length_delimited(
&self,
buf: &mut impl BufMut,
) -> Result<(), EncodeError>where
Self: Sized,
fn encode_length_delimited(
&self,
buf: &mut impl BufMut,
) -> Result<(), EncodeError>where
Self: Sized,
source§fn encode_length_delimited_to_vec(&self) -> Vec<u8>where
Self: Sized,
fn encode_length_delimited_to_vec(&self) -> Vec<u8>where
Self: Sized,
source§fn decode(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
fn decode(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
source§fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
fn decode_length_delimited(buf: impl Buf) -> Result<Self, DecodeError>where
Self: Default,
source§fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
fn merge(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
self
. Read moresource§fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
fn merge_length_delimited(&mut self, buf: impl Buf) -> Result<(), DecodeError>where
Self: Sized,
self
.source§impl PartialEq for Distribution
impl PartialEq for Distribution
source§fn eq(&self, other: &Distribution) -> bool
fn eq(&self, other: &Distribution) -> bool
self
and other
values to be equal, and is used
by ==
.impl StructuralPartialEq for Distribution
Auto Trait Implementations§
impl Freeze for Distribution
impl RefUnwindSafe for Distribution
impl Send for Distribution
impl Sync for Distribution
impl Unpin for Distribution
impl UnwindSafe for Distribution
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
source§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
T
in a tonic::Request