use std::default::Default;
use std::fmt;
use Commute;
#[deriving(Clone)]
pub struct MinMax<T> {
len: u64,
min: Option<T>,
max: Option<T>,
}
impl<T: PartialOrd + Clone> MinMax<T> {
pub fn new() -> MinMax<T> {
Default::default()
}
pub fn add(&mut self, sample: T) {
self.len += 1;
if self.min.as_ref().map(|v| &sample < v).unwrap_or(true) {
self.min = Some(sample.clone());
}
if self.max.as_ref().map(|v| &sample > v).unwrap_or(true) {
self.max = Some(sample);
}
}
pub fn min(&self) -> Option<&T> {
self.min.as_ref()
}
pub fn max(&self) -> Option<&T> {
self.max.as_ref()
}
pub fn len(&self) -> uint {
self.len as uint
}
}
impl<T: PartialOrd> Commute for MinMax<T> {
fn merge(&mut self, v: MinMax<T>) {
self.len += v.len;
if v.min < self.min { self.min = v.min; }
if v.max > self.max { self.max = v.max; }
}
}
impl<T: PartialOrd> Default for MinMax<T> {
fn default() -> MinMax<T> {
MinMax {
len: 0,
min: None,
max: None,
}
}
}
impl<T: fmt::Show> fmt::Show for MinMax<T> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match (&self.min, &self.max) {
(&Some(ref min), &Some(ref max)) => {
write!(f, "[{}, {}]", min, max)
}
(&None, &None) => write!(f, "N/A"),
_ => unreachable!(),
}
}
}
impl<T: PartialOrd + Clone> FromIterator<T> for MinMax<T> {
fn from_iter<I: Iterator<T>>(it: I) -> MinMax<T> {
let mut v = MinMax::new();
v.extend(it);
v
}
}
impl<T: PartialOrd + Clone> Extend<T> for MinMax<T> {
fn extend<I: Iterator<T>>(&mut self, mut it: I) {
for sample in it {
self.add(sample);
}
}
}
#[cfg(test)]
mod test {
use super::MinMax;
#[test]
fn minmax() {
let minmax: MinMax<uint> = vec![1u, 4, 2, 3, 10].into_iter().collect();
assert_eq!(minmax.min(), Some(&1u));
assert_eq!(minmax.max(), Some(&10u));
}
}