The TrieMap package

[Tags: bsd3, library]

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

Versions0.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
Change logNone available
Dependenciesbase (<5.0.0.0), bytestring, containers, primitive, template-haskell, th-expand-syns, vector [details]
LicenseBSD3
AuthorLouis Wasserman
Maintainerwasserman.louis@gmail.com
CategoryAlgorithms
Source repositoryhead: git clone git@github.com:lowasser/TrieMap.git
UploadedWed Jan 26 18:20:48 UTC 2011 by LouisWasserman
DistributionsNixOS:4.1.0
Downloads4373 total (162 in last 30 days)
Votes
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-05-22 [all 3 reports]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees