Struct stats::Unsorted

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

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.

Implementations

impl<T: PartialOrd> Unsorted<T>

pub fn new() -> Unsorted<T>

Create initial empty state.

Examples found in repository

src/unsorted.rs (line 361)

    fn from_iter<I: IntoIterator<Item = T>>(it: I) -> Unsorted<T> {
        let mut v = Unsorted::new();
        v.extend(it);
        v
    }

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.

pub fn is_empty(&self) -> bool

Return true if empty.

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.

Examples found in repository

src/unsorted.rs (line 39)

pub fn mode<T, I>(it: I) -> Option<T>
where
    T: PartialOrd + Clone,
    I: Iterator<Item = T>,
{
    it.collect::<Unsorted<T>>().mode()
}

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

Returns the modes of the data.

Examples found in repository

src/unsorted.rs (line 64)

pub fn modes<T, I>(it: I) -> Vec<T>
where
    T: PartialOrd + Clone,
    I: Iterator<Item = T>,
{
    it.collect::<Unsorted<T>>().modes()
}

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

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

Returns the median of the data.

Examples found in repository

src/unsorted.rs (line 15)

pub fn median<I>(it: I) -> Option<f64>
where
    I: Iterator,
    <I as Iterator>::Item: PartialOrd + ToPrimitive,
{
    it.collect::<Unsorted<_>>().median()
}

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

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

Returns the quartiles of the data.

Examples found in repository

src/unsorted.rs (line 26)

pub fn quartiles<I>(it: I) -> Option<(f64, f64, f64)>
where
    I: Iterator,
    <I as Iterator>::Item: PartialOrd + ToPrimitive,
{
    it.collect::<Unsorted<_>>().quartiles()
}

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.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

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.