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.

Modules

[Last Documentation]

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

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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
Uploaded by LouisWasserman at 2011-01-26T17:31:04Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 21234 total (69 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-12-28 [all 9 reports]