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.

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>, usize, u32)

Returns the modes of the data.

pub fn antimodes(&mut self) -> (Vec<T>, usize, u32)

Returns the antimodes of the data.

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

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

Returns the median of the data.

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

pub fn mad(&mut self, existing_median: Option<f64>) -> Option<f64>

Returns the MAD of the data.

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

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

Returns the quartiles 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: Debug> Debug for Unsorted<T>

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

Formats the value using the given formatter.

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

fn default() -> Unsorted<T>

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for Unsorted<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: 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.

impl<T: PartialEq> PartialEq<Unsorted<T>> for Unsorted<T>

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<T> Serialize for Unsorted<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: Eq> Eq for Unsorted<T>

impl<T> StructuralEq for Unsorted<T>

impl<T> StructuralPartialEq for Unsorted<T>