TrieMap: An implementation of generalized tries with sophisticated map type inference.

[ algorithms, bsd3, library ] [ Propose Tags ]

Generalized trie implementation that automatically infers map types. Keys must implement the class TrieMap.Algebraic.Algebraic, which declares that they are isomorphic to an algebraic type, defined recursively as follows:

  • () and Int are algebraic types.

  • If Ord a, then Ordered a is an algebraic type.

  • If a,b are algebraic types, then so are (a, b) and Either a b.

  • If a is algebraic, so is [a].

This package exports almost the entire collection of methods available in Data.Map, and several new methods as well. In addition, each method will automatically infer the correct map type.

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 (>=4 && <=5), containers [details]
License BSD-3-Clause
Author
Maintainer wasserman.louis@gmail.com
Category Data Structures
Uploaded by LouisWasserman at 2009-08-15T22:55:31Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 21295 total (60 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]