TrieMap: Automatic type inference of generalized tries.

[ algorithms, bsd3, library ] [ Propose Tags ]

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. Just splice Data.TrieMap.Representation.TH.genRepr ''Foo to derive a Data.TrieMap.Class.TKey instance for Foo. (It works if Foo has type arguments, too!)

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 array, base (<5.0.0.0), bytestring, containers, multirec, template-haskell (>=2.5.0.0), th-expand-syns (>=0.1.1.0) [details]
License BSD-3-Clause
Author Louis Wasserman
Maintainer wasserman.louis@gmail.com
Category Algorithms
Uploaded by LouisWasserman at Thu Jan 6 21:46:22 UTC 2011
Distributions NixOS:4.1.0
Downloads 10432 total (48 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.MultiRec
      • Data.TrieMap.Regular
      • Data.TrieMap.Representation
        • Data.TrieMap.Representation.TH
    • Data.TrieSet

Downloads

Maintainer's Corner

For package maintainers and hackage trustees