MemoTrie: Trie-based memo functions

[ bsd3, data, library ] [ Propose Tags ]

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. Generic support thanks to Sam Boosalis.

Project wiki page: http://haskell.org/haskellwiki/MemoTrie

Ç 2008-2019 by Conal Elliott; BSD3 license.

Flags

Manual Flags

NameDescriptionDefault
examples

"examples"

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
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, 0.6.11
Dependencies base (<5), MemoTrie, newtype-generics (>=0.5.3), void [details]
License BSD-3-Clause
Copyright (c) 2008-2019 by Conal Elliott
Author Conal Elliott
Maintainer conal@conal.net
Category Data
Home page https://github.com/conal/MemoTrie
Source repo head: git clone git://github.com/conal/MemoTrie.git
Uploaded by ConalElliott at 2023-07-15T17:45:01Z
Distributions Arch:0.6.11, Debian:0.6.10, Fedora:0.6.11, FreeBSD:0.6.2, LTSHaskell:0.6.11, NixOS:0.6.11, Stackage:0.6.11
Reverse Dependencies 29 direct, 8298 indirect [details]
Executables generic
Downloads 70424 total (253 in the last 30 days)
Rating 2.25 (votes: 2) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-07-15 [all 1 reports]