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

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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 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
Change log CHANGELOG.txt
Dependencies base (>=4.3 && <4.12), binary (>=0.5 && <0.10), containers (>=0.4 && <0.6), dlist (>=0.4 && <0.9), semigroups (==0.18.*) [details]
License BSD-3-Clause
Author Matti Niemenmaa
Maintainer Matti Niemenmaa <matti.niemenmaa+list-tries@iki.fi>
Category Data, Data Structures
Home page http://iki.fi/matti.niemenmaa/list-tries/
Source repo head: git clone https://github.com/Deewiant/list-tries
Uploaded by MattiNiemenmaa at Tue Mar 20 18:12:51 UTC 2018
Distributions NixOS:0.6.5
Downloads 6461 total (110 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-03-20 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees