| Name : ghc-array-memoize
| |
| Version : 0.6.0
| Vendor : openSUSE
|
| Release : bp150.2.6
| Date : 2018-07-30 20:22:16
|
| Group : Development/Libraries/Haskell
| Source RPM : ghc-array-memoize-0.6.0-bp150.2.6.src.rpm
|
| Size : 0.13 MB
| |
| Packager : https://bugs_opensuse_org
| |
| Summary : Memoization combinators using arrays for finite sub-domains of functions
|
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 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.
Example:
\' 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\' \'.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/openSUSE:/Backports:/SLE-15/standard/x86_64 |
