array-memoize: Memoization combinators using arrays for finite sub-domains of functions
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 since an array can then be used to store results.
This package provides various combinators for doing just this, including also combinators for quanitzing and discretizing Float/Double-valued functions.
fib' :: (Int -> Int) -> Int -> Int fib' _ 0 = 1 fib' _ 1 = 1 fib' rec n = rec (n - 1) + rec (n - 2) fib :: Int -> Int fib = arrayMemoFix (0, 1000) fib'
|Versions [RSS] [faq]||0.5.0, 0.6.0|
|Dependencies||array (>=0.4), base (<5) [details]|
|Copyright||Dominic Orchard, 2014|
|Source repo||head: git clone https://github.com/dorchard/array-memoize|
|Uploaded||by DominicOrchard at 2014-04-04T15:58:23Z|
|Distributions||LTSHaskell:0.6.0, NixOS:0.6.0, Stackage:0.6.0|
|Downloads||2499 total (15 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Successful builds reported [all 1 reports]