tries: Various trie implementations in Haskell

[ bsd3, data, library, tree ] [ Propose Tags ]

Please see the README on Github at

[Skip to Readme]
Versions 0.0.1, 0.0.2, 0.0.3, 0.0.4,,, 0.0.5 (info)
Dependencies base (>=4.8 && <5.0), bytestring, bytestring-trie, composition, containers, deepseq, hashable, keys, QuickCheck (>=2.9.2), quickcheck-instances, rose-trees (>=, semigroups, sets (>=, unordered-containers [details]
License BSD-3-Clause
Copyright 2018 Athan Clark
Author Athan Clark
Category Data, Tree
Home page
Bug tracker
Source repo head: git clone
Uploaded by athanclark at Fri Mar 16 22:22:02 UTC 2018
Distributions NixOS:0.0.5
Downloads 1494 total (19 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-17 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for tries-0.0.5

[back to package description]


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

So far, there is:

Running the Tests

stack test


Running the Benchmarks

for insert / delete:

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

for lookups:

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