Difference between revisions of "MemoTrie"
Jump to navigation
Jump to search
m (find out about) |
Hairy Dude (talk | contribs) (sjanssen's hpaste has now disappeared) |
||
Line 3: | Line 3: | ||
== Abstract == |
== Abstract == |
||
− | '''MemoTrie''' is functional library for creating efficient memo functions, using [http://en.wikipedia.org/wiki/Trie trie]s. It's based on |
+ | '''MemoTrie''' is functional library for creating efficient memo functions, using [http://en.wikipedia.org/wiki/Trie trie]s. It's based on some code from Spencer Janssen (originally put on hpaste.org, now expired) and uses type families. |
Besides this wiki page, here are more ways to find out about MemoTrie: |
Besides this wiki page, here are more ways to find out about MemoTrie: |
Revision as of 22:19, 29 September 2009
Abstract
MemoTrie is functional library for creating efficient memo functions, using tries. It's based on some code from Spencer Janssen (originally put on hpaste.org, now expired) and uses type families.
Besides this wiki page, here are more ways to find out about MemoTrie:
- Visit the Hackage page for library documentation and to download & install.
- Or install with cabal install MemoTrie.
- Get the code repository: darcs get http://code.haskell.org/MemoTrie.
Please leave comments at the Talk page.
See also
- An associated data type example
- Ralf Hinze's Generalizing Generalized Tries
- Related blog posts.
- Use of MemoTrie in vector-space.