Skip to content

charles-cooper/hroll

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

hroll

Haskell implementations of rolling algorithms.

The basic data structure used is a FIFO queue with an accumulator parameter in the style of Okasaki. With that we can implement

  • rolling max / min
  • rolling sum
  • rolling covariance

About

Haskell implementations of rolling algorithms

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published