ForestStructures: Tree- and forest structures
This library provides both static and dynamic tree and forest
structures. Once a tree structure is static, it can be mappend
onto a linearized representation, which is beneficial for
algorithms that do not modify the internal tree structure, but
need fast O(1)
access to individual nodes, children, and
siblings.
[Skip to Readme]
Downloads
- ForestStructures-0.0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.0.0.1, 0.0.0.2, 0.0.1.0, 0.0.1.1 |
---|---|
Change log | changelog.md |
Dependencies | aeson (>=1.0), base (>=4.7 && <5.0), bifunctors (>=5.0), containers (>=0.5), deepseq (>=1.0), fgl (>=5.5), lens (>=4.0), QuickCheck (>=2.0), unordered-containers (>=0.2), vector (>=0.10), vector-th-unbox (>=0.2) [details] |
Tested with | ghc ==8.8 |
License | BSD-3-Clause |
Copyright | Christian Hoener zu Siederdissen, 2015-2023 |
Author | Christian Hoener zu Siederdissen 2015-2023, Sarah Berkemer, 2015-2017 |
Maintainer | choener@bioinf.uni-leipzig.de |
Category | Formal Languages, Bioinformatics |
Home page | https://github.com/choener/ForestStructures |
Bug tracker | https://github.com/choener/ForestStructures/issues |
Source repo | head: git clone git://github.com/choener/ForestStructures |
Uploaded | by ChristianHoener at 2023-06-14T19:49:44Z |
Distributions | LTSHaskell:0.0.1.1, NixOS:0.0.1.1, Stackage:0.0.1.1 |
Reverse Dependencies | 5 direct, 23 indirect [details] |
Downloads | 3389 total (16 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2023-06-14 [all 1 reports] |