| CARVIEW |
Select Language
HTTP/1.1 200 OK
Connection: keep-alive
Server: nginx/1.24.0 (Ubuntu)
Content-Type: text/html; charset=utf-8
Cache-Control: public, max-age=300
Content-Encoding: gzip
Via: 1.1 varnish, 1.1 varnish
Accept-Ranges: bytes
Age: 0
Date: Sat, 17 Jan 2026 11:48:44 GMT
X-Served-By: cache-dfw-kdfw8210144-DFW, cache-bom-vanm7210055-BOM
X-Cache: MISS, MISS
X-Cache-Hits: 0, 0
X-Timer: S1768650523.100223,VS0,VE908
Vary: Accept, Accept-Encoding
transfer-encoding: chunked
tries: Various trie implementations in Haskell
tries: Various trie implementations in Haskell
Modules
[Index] [Quick Jump]
Downloads
- tries-0.0.6.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No 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 |
| Uploaded | by athanclark at 2020-03-07T22:46:20Z |
| 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 |
| Distributions | |
| Reverse Dependencies | 2 direct, 2 indirect [details] |
| Downloads | 4928 total (22 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] |
Readme for tries-0.0.6.1
[back to package description]tries
This is a collection and comparison of some basic, pure trie implementations.
So far, there is:
- a Map trie, using
Data.Mapfrom containers - a List trie, using
Data.Treefrom containers - a HashMap trie, using
Data.HashMapfrom unordered-containers - a Knuth trie, using
Data.Tree.Knuthfrom 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" tries:bench:tries-bench-lookup