Difference between revisions of "MemoTrie"
Jump to navigation
Jump to search
m |
m (find out about) |
||
| Line 6: | Line 6: | ||
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: |
||
| − | * |
+ | * Visit the [http://hackage.haskell.org/cgi-bin/hackage-scripts/package/MemoTrie Hackage page] for library documentation and to download & install. |
| − | * |
+ | * Or install with <tt>cabal install MemoTrie</tt>. |
| − | * |
+ | * Get the code repository: <tt>darcs get http://code.haskell.org/MemoTrie</tt>. |
| − | * See the [[MemoTrie/Versions| version history]]. |
+ | <!-- * See the [[MemoTrie/Versions| version history]]. --> |
Please leave comments at the [[Talk:MemoTrie|Talk page]]. |
Please leave comments at the [[Talk:MemoTrie|Talk page]]. |
||
Revision as of 19:03, 11 November 2008
Abstract
MemoTrie is functional library for creating efficient memo functions, using tries. It's based on some code from Spencer Janssen 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.