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.
Since version 2, unit tests and benchmarks have been taken much more seriously, and major optimizations
have been made.
Compared to Data.Map and Data.Set, on e.g.
ByteStrings, TrieMaps support 6-12x faster
difference operations, 2x faster
lookup, but 2x slower
toList, and 4x slower
Other operations are closely tied. TrieMaps tend to use somewhat more memory, and frequently perform better
with increased heap space and allocation area.
|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 (<22.214.171.124), bytestring, containers, primitive, template-haskell, th-expand-syns, vector [details]|
|Source repo||head: git clone firstname.lastname@example.org:lowasser/TrieMap.git|
|Uploaded||by LouisWasserman at Fri Feb 4 16:02:20 UTC 2011|
|Downloads||10384 total (78 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees