#accumulator #incremental-computation #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

#698 in Math

Download history 557/week @ 2024-10-05 163/week @ 2024-10-12 375/week @ 2024-10-19 310/week @ 2024-10-26 328/week @ 2024-11-02 74/week @ 2024-11-09 57/week @ 2024-11-16 121/week @ 2024-11-23 142/week @ 2024-11-30 248/week @ 2024-12-07 207/week @ 2024-12-14 129/week @ 2024-12-21 144/week @ 2024-12-28 100/week @ 2025-01-04 44/week @ 2025-01-11 51/week @ 2025-01-18

349 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–3MB
~58K SLoC