foldlstatistics alternatives and similar packages
Based on the "Math" category.
Alternatively, view foldlstatistics alternatives based on common mentions on social networks and blogs.

subhask
Type safe interface for working in subcategories of Hask 
vector
An efficient implementation of Intindexed arrays (both mutable and immutable), with a powerful loop optimisation framework . 
statistics
A fast, high quality library for computing with statistics in Haskell. 
HerbiePlugin
GHC plugin that improves Haskell code's numerical stability 
what4
Symbolic formula representation and solver interaction library 
hgeometry
HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees. 
dimensional
Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+). 
computationalalgebra
GeneralPurpose Computer Algebra System as an EDSL in Haskell 
hermit
Haskell Equational Reasoning ModeltoImplementation Tunnel 
mwcrandom
A very fast Haskell library for generating high quality pseudorandom numbers. 
numhask
A haskell numeric prelude, providing a clean structure for numbers and operations that combine them. 
lambdacalculator
An introduction to the Lambda Calculus 
matrix
A Haskell native implementation of matrices and their operations. 
vectorspace
Vector & affine spaces, linear maps, and derivatives 
poly
Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent) 
bayesstack
Framework for Gibbs sampling of probabilistic models 
cf
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct) 
optimization
Some numerical optimization methods implemented in Haskell 
rampart
:european_castle: Determine how intervals relate to each other. 
equationalreasoning
Agdastyle equational reasoning in Haskell 
safedecimal
Safe and very efficient arithmetic operations on fixed decimal point numbers 
simplesmt
A simple way to interact with an SMT solver process. 
bedandbreakfast
Matrix operations in 100% pure Haskell 
sbvPlugin
Formally prove properties of Haskell programs using SBV/SMT. 
montecarlo
A Monte Carlo monad and transformer for Haskell. 
monoidsubclasses
Subclasses of Monoid with a solid theoretical foundation and practical purposes 
polynomial
Haskell library for manipulating and evaluating polynomials 
eigen
Haskel binding for Eigen library. Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. 
modulararithmetic
A useful type for working with integers modulo some constant.
WorkOS  The modern identity platform for B2B SaaS
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of foldlstatistics or a related project?
README
foldlstatistics
A reimplementation of the Statistics.Sample
module using the foldl package.
The intention of this package is to allow these algorithms to be used on a much broader set of data input types,
including lists and streaming libraries such as conduit
and pipes
, and any other type which is Foldable
.
All statistics in this package can be computed with no more than two passes over the data  once to compute the mean and once to compute
any statistics which require the mean. this is achieved because foldl Fold
s are Applicative
, which means that to compute, for example, the first 4 central moments as well as the count, the following could be used:
import Control.Foldl as F
...
dataseries :: [Double]
dataseries = ...
...
let m = F.fold mean dataseries
(c2,c3,c4,c5,n) = flip F.fold dataseries $
(\(c2,c3) (c4,c5) n > (c2,c3,c4,c5,n))
<$> centralMoment 2 3 m
<*> centralMoment 4 5 m
<*> F.length
which traverses the data twice, once to compute the mean m
, and once to compute all the central moments and the count concurrently. This brings along with it for free the ability to compute streaming statistics, such as the mean of all data seen so far, using the foldl
's scan
function.
Where possible, care has been taken to ensure the numerical stability of the computation of statistics.
Several algorithms require the mean of the data to be known before computing the statistic, such as skewness
, kurtosis
and other centralMoment
s.
There are 'fast' implementations for calculating the variance, unbiased variance and standard deviation, which can be computed without knowing the mean
a priori, but which may produce less accurate results.
Performance & Correctness
Benchmarks are included comparing performance to the statistics package. In nearly all cases, the implementations in this package perform better than those in statistics
on the same inputs, and in several cases, performing two passes (to compute the mean and another statistic) is faster than the equivalent statistics
implementation.
This speed has not come at the cost of correctness; all Fold
s are tested against their statistics
counterparts to ensure the results are identical.
These results can be confirmed by running
stack build test bench benchmarkarguments "output bench.html"
which will print out the results of the tests against statistics
and then run the benchmark (this may take several minutes and is best run on a "quiet" machine which is doing very little other than running the benchmark). The results of the benchmarking are then available in the file bench.html
.