The list-tries package

[Tags:bsd3, library]

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.

Properties

Versions 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
Change log CHANGELOG.txt
Dependencies base (>=3 && <4.3), binary (==0.5.*), containers (==0.3.*), dlist (>=0.4 && <0.6) [details]
License BSD3
Author Matti Niemenmaa
Maintainer Matti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>
Stability provisional
Category Data, Data Structures
Home page http://iki.fi/matti.niemenmaa/list-tries/
Uploaded Thu Sep 9 14:54:31 UTC 2010 by MattiNiemenmaa
Distributions NixOS:0.6.3
Downloads 2971 total (57 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees