tries: Various trie implementations in Haskell

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

Please see the README on Github at

[Skip to Readme]
Versions [faq] 0.0.1, 0.0.2, 0.0.3, 0.0.4,,, 0.0.5, 0.0.6, (info)
Dependencies base (>=4.11 && <5.0), bytestring, composition, containers, deepseq, hashable, keys, QuickCheck (>=2.9.2), quickcheck-instances, rose-trees (>=, semigroups, sets (>=0.0.6), 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 2018-11-20T23:14:06Z
Distributions NixOS:
Downloads 3835 total (26 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2018-11-20 [all 3 reports]


  • Data
    • Trie
      • Data.Trie.Class
      • Data.Trie.HashMap
      • Data.Trie.Knuth
      • Data.Trie.List
      • Data.Trie.Map
      • Data.Trie.Pseudo


Maintainer's Corner

For package maintainers and hackage trustees

Readme for tries-0.0.6

[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