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]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,
Change log
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]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2015-2023
Author Christian Hoener zu Siederdissen 2015-2023, Sarah Berkemer, 2015-2017
Category Formal Languages, Bioinformatics
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by ChristianHoener at 2023-06-14T19:49:44Z
Distributions LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 5 direct, 23 indirect [details]
Downloads 3298 total (17 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]

Readme for ForestStructures-

[back to package description]

github action: master

ForestStructures: Dynamic and static tree and forest structures

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


Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany