MemoTrie: Trie-based memo functions
MemoTrie provides a basis for memoized functions over some domains, using tries. It's based on ideas from Ralf Hinze and code from Spencer Janssen.
Project wiki page: http://haskell.org/haskellwiki/MemoTrie
© 2008-2012 by Conal Elliott; BSD3 license.
Downloads
- MemoTrie-0.6.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Versions [RSS] | 0.0, 0.1, 0.2, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.4.5, 0.4.7, 0.4.8, 0.4.9, 0.4.10, 0.4.11, 0.4.12, 0.4.13, 0.5, 0.6.1, 0.6.2, 0.6.3, 0.6.4, 0.6.5, 0.6.6, 0.6.7, 0.6.8, 0.6.9, 0.6.10 |
---|---|
Dependencies | base (<4.11), void (>=0.4 && <0.8) [details] |
License | BSD-3-Clause |
Copyright | (c) 2008-2012 by Conal Elliott |
Author | Conal Elliott |
Maintainer | conal@conal.net |
Revised | Revision 2 made by HerbertValerioRiedel at 2018-08-29T22:24:36Z |
Category | Data |
Home page | http://haskell.org/haskellwiki/MemoTrie |
Source repo | head: git clone git://github.com/conal/MemoTrie.git |
Uploaded | by ConalElliott at 2012-11-29T17:22:09Z |
Distributions | Arch:0.6.10, Debian:0.6.10, Fedora:0.6.10, FreeBSD:0.6.2, LTSHaskell:0.6.10, NixOS:0.6.10, Stackage:0.6.10 |
Downloads | 64319 total (317 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |