Struct stats::Unsorted

pub struct Unsorted<T> { /* fields omitted */ }

A commutative data structure for lazily sorted sequences of data.

The sort does not occur until statistics need to be computed.

Note that this works on types that do not define a total ordering like f32 and f64. When an ordering is not defined, an arbitrary order is returned.

Methods

impl<T: PartialOrd> Unsorted<T>

pub fn new() -> Unsorted<T>

Create initial empty state.

pub fn add(&mut self, v: T)

Add a new element to the set.

pub fn len(&self) -> usize

Return the number of data points.

impl<T: PartialOrd + Eq + Clone> Unsorted<T>

pub fn cardinality(&mut self) -> usize

impl<T: PartialOrd + Clone> Unsorted<T>

pub fn mode(&mut self) -> Option<T>

Returns the mode of the data.

pub fn modes(&mut self) -> Vec<T>

Returns the modes of the data.

impl<T: PartialOrd + ToPrimitive> Unsorted<T>

pub fn median(&mut self) -> Option<f64>

Returns the median of the data.

Trait Implementations

impl<T: Clone> Clone for Unsorted<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: PartialOrd> Commute for Unsorted<T>

fn merge(&mut self, v: Unsorted<T>)

Merges the value other into self.

fn consume<I: Iterator<Item = Self>>(&mut self, other: I)

Merges the values in the iterator into self.

impl<T: PartialOrd> Default for Unsorted<T>

fn default() -> Unsorted<T>

Returns the "default value" for a type.

impl<T: PartialOrd> Extend<T> for Unsorted<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, it: I)

Extends a collection with the contents of an iterator.

impl<T: PartialOrd> FromIterator<T> for Unsorted<T>

fn from_iter<I: IntoIterator<Item = T>>(it: I) -> Unsorted<T>

Creates a value from an iterator.