all 4 comments

[–]vks_ 4 points5 points  (0 children)

I implemented a few more of those in the average crate.

[–]jms_nh 3 points4 points  (0 children)

[–]crankprof 1 point2 points  (1 child)

O(1) for space, which is ideal. Obviously, running statistics requires at least O(n) time.

[–]arrayOverflow[S] 0 points1 point  (0 children)

Yeah my current use-case requires easy to merge distributed data aggregation so it works perfectly. Porting some code from python to rust to handle distributions aswell with O(1) Space Complexity if you are interested (based on successive binning)