ForestStructures: Tree- and forest structures

[ bioinformatics, bsd3, formal-languages, library ] [ Propose Tags ]

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]
Versions 0.0.0.1, 0.0.0.2, 0.0.1.0
Change log changelog.md
Dependencies base (>=4.7 && <5.0), bifunctors (>=5.0), containers (>=0.5), fgl (>=5.5), lens (>=4.0), QuickCheck (>=2.0), unordered-containers (>=0.2), vector (>=0.10), vector-th-unbox (>=0.2) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2015-2018
Author Christian Hoener zu Siederdissen 2015-2018, 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 Tue Dec 11 23:25:10 UTC 2018
Distributions LTSHaskell:0.0.0.2, NixOS:0.0.1.0
Downloads 718 total (42 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-12-11 [all 1 reports]
Hackage Matrix CI

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for ForestStructures-0.0.1.0

[back to package description]

Build Status

ForestStructures: Dynamic and static tree and forest structures

The static tree structure(s) shall be designed with an emphasis on performance.

Contact

Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
choener@bioinf.uni-leipzig.de
http://www.bioinf.uni-leipzig.de/~choener/