tries

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

So far, there is:

• a Map trie, using Data.Map from containers
• a List trie, using Data.Tree from containers
• a HashMap trie, using Data.HashMap from unordered-containers
• a Knuth trie, using Data.Tree.Knuth from rose-trees

Running the Tests

stack test

and

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