Struct ExponentialHistogram

pub struct ExponentialHistogram<T> {
    pub size: usize,
    pub floor: T,
    pub initial_step: T,
    pub step_multiplier: T,
    pub counts: Vec<T>,
    pub indexes: Option<Vec<usize>>,
}

An exponential histogram property.

Fields

size: usize

The number of buckets. If indexes is None this should equal counts.len().

floor: T

The floor of the lowest bucket (not counting the negative-infinity bucket).

initial_step: T

The increment for the second floor.

step_multiplier: T

The multiplier for each successive floor.

counts: Vec<T>

The number of items in each bucket.

indexes: Option<Vec<usize>>

If Some<_>, the indexes of nonzero counts.

Trait Implementations

impl<T: Clone> Clone for ExponentialHistogram<T>

fn clone(&self) -> ExponentialHistogram<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for ExponentialHistogram<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for ExponentialHistogram<T>

where T: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: PartialEq> PartialEq for ExponentialHistogram<T>

fn eq(&self, other: &ExponentialHistogram<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Serialize for ExponentialHistogram<T>

where T: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> StructuralPartialEq for ExponentialHistogram<T>