TrieMap: Automatic type inference of generalized tries with Template Haskell.
Provides a efficient and compact implementation of generalized tries, and Template Haskell tools to generate the necessary translation code. This is meant as a drop-in replacement for Data.Map. The most recent release combines zipper-based ideas from recently proposed changes to Data.Map, as well as heavily optimized ByteString and Vector instances based on the vector package.
Modules
[Index]
Downloads
- TrieMap-2.0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.0.1.0, 0.0.1.1, 0.0.1.2, 0.5.0, 0.5.1, 0.5.2, 0.5.3, 0.5.4, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.7.0, 0.7.1, 0.7.2, 1.0.0, 1.5.0, 2.0.0, 2.0.1, 2.0.2, 2.0.3, 3.0.0, 3.0.1, 4.0.0, 4.0.1, 4.1.0 |
|---|---|
| Dependencies | base (<5.0.0.0), bytestring, containers, primitive, template-haskell, th-expand-syns, vector [details] |
| License | BSD-3-Clause |
| Author | Louis Wasserman |
| Maintainer | wasserman.louis@gmail.com |
| Category | Algorithms |
| Source repo | head: git clone git@github.com:lowasser/TrieMap.git |
| Uploaded | by LouisWasserman at 2011-01-26T19:17:29Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 21295 total (60 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |