list-tries: Tries and Patricia tries: finite sets and maps for list keys
This library provides implementations of finite sets and maps for list keys using tries, both simple and of the Patricia kind. In most (or all? sorry, haven't benchmarked yet) cases, the Patricia tries will have better performance, so use them unless you have reasons not to.
The data types are parametrized over the map type they use internally to store the child nodes: this allows extending them to support different kinds of key types or increasing efficiency. Child maps are required to be instances of the Map class in Data.ListTrie.Base.Map. Some operations additionally require an OrdMap instance.
The Eq, Ord, and Enum modules contain ready structures for key types which are instances of those classes, using lists of pairs, Data.Map, and Data.IntMap respectively.
|Versions [faq]||0.0, 0.1, 0.2, 0.3, 0.4, 0.4.1, 0.4.2, 0.4.3, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.6.4, 0.6.5, 0.6.6, 0.6.7|
|Dependencies||base (>=3 && <4.3), binary (==0.5.*), containers (>=0.2 && <0.4), dlist (>=0.4 && <0.6) [details]|
|Maintainer||Matti Niemenmaa <firstname.lastname@example.org>|
|Category||Data, Data Structures|
|Uploaded||by MattiNiemenmaa at 2010-04-05T22:42:06Z|
|Downloads||13460 total (34 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
Assume that containers has a version number of at least 0.3. If
false, some functionality cannot be implemented and is changed
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
For package maintainers and hackage trustees