#accumulator #statistics #online-algorithms

simple_accumulator

A simple accumulator for incremental statistical computations

9 releases (breaking)

0.7.0 Feb 12, 2024
0.6.0 Dec 21, 2023
0.5.1 Dec 19, 2023
0.4.2 Jun 16, 2023
0.3.2 Jul 29, 2022

#271 in Algorithms

Download history 475/week @ 2024-01-24 431/week @ 2024-01-31 359/week @ 2024-02-07 296/week @ 2024-02-14 290/week @ 2024-02-21 511/week @ 2024-02-28 561/week @ 2024-03-06 461/week @ 2024-03-13 203/week @ 2024-03-20 47/week @ 2024-03-27 129/week @ 2024-04-03 303/week @ 2024-04-10 338/week @ 2024-04-17 201/week @ 2024-04-24 369/week @ 2024-05-01 338/week @ 2024-05-08

1,272 downloads per month
Used in coordinates_outliers

MIT license

15KB
169 lines

SimpleAccumulator

Crates.io docs.rs Crates.io

This crate is inspired by Boost::Accumulator which supports incremental statistical computation (online algorithms). This is a work in progress but usable. Please write integration tests before using it in production.

Read Documentation

Notes

  • 2023-12-20: Version 0.6 is a major rewrite that fix many embarassing bugs. In 0.6+, we are relying on watermill crate for underlying algorithms.

Usage:

use simple_accumulator::SimpleAccumulator;

fn main() {
    let k = [1, 2, 3, 4];

    // If second argument is `None` then accumulator stores all the data. 
    let mut x = SimpleAccumulator::new(&k, Some(10));

    println!("{:?}", x);
    
    x.push(5);
    println!("{:?}", x);

    print!("{}", x.mean());
    print!("{}", x.median());
    print!("{}", x.variance());
    print!("{}", x.sum());
    print!("{}", x.kurtosis());
    ...
}

Dependencies

~1.8–2.8MB
~57K SLoC