rose-trees: Various trie implementations in Haskell
Modules
[Index] [Quick Jump]
Downloads
- rose-trees-0.0.4.5.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.1.1, 0.0.2, 0.0.2.1, 0.0.3, 0.0.4, 0.0.4.1, 0.0.4.2, 0.0.4.3, 0.0.4.4, 0.0.4.5 (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 |
| Maintainer | athan.clark@gmail.com |
| Category | Data, Tree |
| Home page | https://github.com/athanclark/rose-trees#readme |
| Bug tracker | https://github.com/athanclark/rose-trees/issues |
| Source repo | head: git clone https://github.com/athanclark/rose-trees |
| Uploaded | by athanclark at 2020-03-07T22:11:33Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 3 indirect [details] |
| Downloads | 6869 total (30 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-07 [all 1 reports] |
Readme for rose-trees-0.0.4.5
[back to package description]
rose-trees
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.