rose-trees: 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,,,,, (info)
Dependencies base (>=4.11 && <5.0), containers, deepseq, hashable, mtl, QuickCheck (>=2.9.2), quickcheck-instances, semigroupoids, semigroups, sets (>=0.0.5), unordered-containers, witherable (>=0.2) [details]
License BSD-3-Clause
Copyright 2015, 2016, 2017, 2018, 2019, 2020 Athan Clark
Author Athan Clark
Category Data, Tree
Home page
Bug tracker
Source repo head: git clone
Uploaded by athanclark at 2020-03-07T22:11:33Z
Distributions NixOS:
Downloads 5939 total (3 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2020-03-07 [all 1 reports]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees

Readme for rose-trees-

[back to package description]

Stories in Ready


A simple class for making the construction of rose trees look prettier. I've also made an implementation of a left-child right-sibling binary tree-based rose tree, and one that uses Data.Set internally as a forest.