Struct average::Min

pub struct Min { /* fields omitted */ }

Estimate the minimum of a sequence of numbers ("population").

Example

use average::Min;

let a: Min = (1..6).map(f64::from).collect();
println!("The minimum is {}.", a.min());

Methods

impl Min

pub fn from_value(x: f64) -> Min

Create a new minium estimator from a given value.

pub fn new() -> Min

Create a new minimum estimator.

pub fn min(&self) -> f64

Estimate the minium of the population.

Trait Implementations

impl Debug for Min

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

Formats the value using the given formatter.

impl Clone for Min

fn clone(&self) -> Min

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Default for Min

fn default() -> Min

Returns the "default value" for a type.

impl FromIterator<f64> for Min

fn from_iter<T>(iter: T) -> Min where     T: IntoIterator<Item = f64>,

Creates a value from an iterator.

impl<'a> FromIterator<&'a f64> for Min

fn from_iter<T>(iter: T) -> Min where     T: IntoIterator<Item = &'a f64>,

Creates a value from an iterator.

impl Estimate for Min

fn add(&mut self, x: f64)

Add an observation sampled from the population.

fn estimate(&self) -> f64

Estimate the statistic of the population.

impl Merge for Min

fn merge(&mut self, other: &Min)

Merge another sample into this one.

Example

use average::{Min, Merge};

let sequence: &[f64] = &[1., 2., 3., 4., 5., 6., 7., 8., 9.];
let (left, right) = sequence.split_at(3);
let min_total: Min = sequence.iter().collect();
let mut min_left: Min = left.iter().collect();
let min_right: Min = right.iter().collect();
min_left.merge(&min_right);
assert_eq!(min_total.min(), min_left.min());