tries: Various trie implementations in Haskell

[Skip to Readme]

Modules

For package maintainers and hackage trustees

Candidates

Versions [RSS]	0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.4.1, 0.0.4.2, 0.0.5, 0.0.6, 0.0.6.1 (info)
Dependencies	base (>=4.11 && <5.0), bytestring, composition, containers, deepseq, hashable, keys, QuickCheck (>=2.9.2), quickcheck-instances, rose-trees (>=0.0.2.1), semigroups, sets (>=0.0.6), unordered-containers [details]
License	BSD-3-Clause
Copyright	2015, 2016, 2017, 2018, 2019, 2020 Athan Clark
Author	Athan Clark
Maintainer	athan.clark@gmail.com
Category	Data, Tree
Home page	https://github.com/athanclark/tries#readme
Bug tracker	https://github.com/athanclark/tries/issues
Source repo	head: git clone https://github.com/athanclark/tries
Uploaded	by athanclark at 2020-03-07T22:46:20Z
Distributions
Reverse Dependencies	2 direct, 2 indirect [details]
Downloads	4767 total (4 in the last 30 days)
Rating	(no votes yet) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs available [build log] Last success reported on 2020-03-08 [all 1 reports]

This is a collection and comparison of some basic, pure trie implementations.

So far, there is:

stack test

and

for insert / delete:

stack bench --benchmark-arguments="--output profile.html"

for lookups:

stack bench --benchmark-arguments="--output profile-lookup.html" tries:bench:tries-bench-lookup