The TrieMap package
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.
Properties
| Versions | 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 |
| License | BSD3 |
| Author | Louis Wasserman |
| Maintainer | wasserman.louis@gmail.com |
| Category | Algorithms |
| Source repository | git clone git@github.com:lowasser/TrieMap.git |
| Upload date | Wed Jan 26 19:17:29 UTC 2011 |
| Uploaded by | LouisWasserman |
| Built on | ghc-7.0 |
Modules
Downloads
- TrieMap-2.0.3.tar.gz (Cabal source package)
- package description (included in the package)