TrieMap: Automatic type inference of generalized tries with Template Haskell.

[ algorithms, bsd3, library ] [ Propose Tags ]
Versions,,, 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 (<, bytestring (>=, containers, primitive (>=0.3), template‑haskell (>=, th‑expand‑syns, transformers (>=, unpack‑funcs (>=0.1.2), vector (>=0.6) [details]
License BSD-3-Clause
Author Louis Wasserman
Category Algorithms
Source repo head: git clone
Uploaded by LouisWasserman at Tue Mar 1 01:26:13 UTC 2011
Distributions NixOS:4.1.0
Downloads 10306 total (82 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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, and can be used anywhere Data.Map can be used.

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. For best performance, use cabal install -fllvm -O2.





Compile with LLVM, because you mean srs bzns


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees