[STATISTICS-77] Implement Sum

• Type: Sub-task
• Status: Closed
• Priority: Minor
• Resolution: Implemented
• Fix Version/s: 1.1
• Component/s: descriptive
• Labels: gsoc gsoc2023

Language

Java

• difficulty-level: Medium
• Assignee: Unassigned
• Reporter: Anirudh Joshi
• Created: 17/Jul/23 17:53
• Updated: 20/Aug/24 11:07
• Resolved: 25/Jul/23 08:27

Description

This implementation uses commons-numbers Sum as the underlying implementation.

This may be further expanded to include various other Sum implementations like Kahan Sum, Neumaier Sum (Two sum method) etc. with the option for the users to choose an implementation. However, before beginning the implementation of various other algorithms it may be worthwhile to discuss and investigate the relative speed of the current Sum implementation compared to DoubleStream.sum through JMH benchmarks.
When we know the different speeds, it would be more clear if the user should have a choice for this statistic, e.g.

• When using DoubleStream.sum is too slow and it would be nice to have a simple sum variation.
• When the sum has a lot of cancellation and DoubleStream.sum suffers from random walk around zero.

Issue Links

• links to: GitHub Pull Request #50