array-memoize alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view array-memoize alternatives based on common mentions on social networks and blogs.
-
-
-
-
-
-
-
-
-
-
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison. -
-
justified-containers
Standard containers, with keys that carry type-level proofs of their own presence. -
-
-
-
-
-
-
InfluxDB - Purpose built for real-time analytics at any scale.
Do you think we are missing an alternative of array-memoize or a related project?
README
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