The ForestStructures package

[ Tags: benchmark, 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]


Change log
Dependencies base (>=4.7 && <5.0), containers (>=0.5), fgl (>=5.5), QuickCheck (>=2.0), unordered-containers (>=0.2), vector (>=0.10), vector-th-unbox (>=0.2) [details]
License BSD3
Copyright Christian Hoener zu Siederdissen, 2015-2017
Author Christian Hoener zu Siederdissen, Sarah Berkemer, 2015-2017
Category Formal Languages, Bioinformatics
Home page
Bug tracker
Source repo head: git clone git://
Uploaded Fri Jul 7 11:32:45 UTC 2017 by ChristianHoener
Distributions LTSHaskell:, NixOS:, Stackage:, openSUSE:
Downloads 509 total (25 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 2017-07-07 [all 1 reports]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for ForestStructures-

[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.


Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany