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

Versions0.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
Dependenciesbase (>=3 && <4.3), binary (==0.5.*), containers (==0.3.*), dlist (>=0.4 && <0.6)
LicenseBSD3
AuthorMatti Niemenmaa
MaintainerMatti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>
Stabilityprovisional
CategoryData, Data Structures
Home pagehttp://iki.fi/matti.niemenmaa/list-tries/
Upload dateSat Sep 11 14:49:30 UTC 2010
Uploaded byMattiNiemenmaa
DistributionsNixOS:0.5.2
Downloads1010 total (74 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees