TrieMap: Automatic type inference of generalized tries.

[ algorithms, bsd3, library ] [ Propose Tags ] [ Report a vulnerability ]

Builds on the multirec library to create a system capable of automatic or simple generalized trie type inference. Uses Template Haskell to automatically derive a TKey instance for almost any datatype.

Modules

[Last Documentation]

Data
- Data.TrieMap
  - Data.TrieMap.Class
  - Data.TrieMap.Modifiers
  - Data.TrieMap.MultiRec
  - Data.TrieMap.Regular
  - Data.TrieMap.Representation
    - Data.TrieMap.Representation.TH
- Data.TrieSet

Downloads

TrieMap-0.7.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

LouisWasserman

For package maintainers and hackage trustees

edit package information

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	array, base (<5.0.0.0), bytestring, containers, multirec, template-haskell (>=2.5.0.0), th-expand-syns (>=0.1.1.0) [details]
Tested with	ghc >=0
License	BSD-3-Clause
Author	Louis Wasserman
Maintainer	wasserman.louis@gmail.com
Category	Algorithms
Uploaded	by LouisWasserman at 2011-01-06T21:41:04Z
Distributions
Reverse Dependencies	2 direct, 0 indirect [details]
Downloads	21807 total (26 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]