list-tries: Tries and Patricia tries: finite sets and maps for list keys

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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, 0.6.0, 0.6.1, 0.6.2, 0.6.3, 0.6.4, 0.6.5, 0.6.5
Change logCHANGELOG.txt
Dependenciesbase (>=4.3 && <4.12), binary (>=0.5 && <0.10), containers (>=0.4 && <0.6), dlist (>=0.4 && <0.9), semigroups (==0.18.*) [details]
LicenseBSD-3-Clause
AuthorMatti Niemenmaa
MaintainerMatti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>
CategoryData, Data Structures
Home pagehttp://iki.fi/matti.niemenmaa/list-tries/
Source repositoryhead: git clone https://github.com/Deewiant/list-tries
UploadedTue Mar 20 18:12:34 UTC 2018 by MattiNiemenmaa

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees