The latest version of array-memoize is 0.6.0-0.
array-memoize
Version 0.5.0 revision 0 uploaded by DominicOrchard.
Package meta
- Synopsis
- Memoization combinators for finite subsets of function domains using arrays
- Description
Memoization combinators are great for providing high-performance Haskell programs, but they can be even faster if memoization is performed on a finite, discrete domain as an array can then be used.
This package provides various combinators for doing just this, including also combinators for quanitzing and discretizing Float/Double-valued functions.
Example:
fibA :: Int -> Int fibA 0 = 1 fibA 1 = 1 fibA n = fibB (n - 1) + fibB (n - 2) fibB = arrayMemo (0, 1000) fibA- Author
- Dominic Orchard
- Bug reports
- n/a
- Category
- Syntax,
- Copyright
- Dominic Orchard, 2014
- Homepage
- n/a
- Maintainer
- Dominic Orchard
- Package URL
- n/a
- Stability
- experimental