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

[ algorithms, bsd3, library ] [ Propose Tags ]

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.

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 [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 Wed Jan 26 18:20:48 UTC 2011
Distributions NixOS:4.1.0
Downloads 10384 total (51 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 9 reports]
Hackage Matrix CI

Modules

  • Data
    • Data.TrieMap
      • Data.TrieMap.Class
      • Data.TrieMap.Modifiers
      • Data.TrieMap.Representation
    • Data.TrieSet

Downloads

Maintainer's Corner

For package maintainers and hackage trustees