The TrieMap package
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.
|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 (>=4 && <=5), bytestring, containers (==0.2.0.1) [details]|
|Uploaded||Mon Sep 7 20:59:52 UTC 2009 by LouisWasserman|
|Downloads||6451 total (40 in the last 30 days)|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees