dual-tree: Rose trees with cached and accumulating monoidal annotations

[ bsd3, data, library ] [ Propose Tags ]

Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. This is used as the core data structure underlying the diagrams framework (http://projects.haskell.org/diagrams), but potentially has other applications as well.

Abstractly, a DUALTree is a rose (n-ary) tree with data (of type l) at leaves, data (of type a) at internal nodes, and two types of monoidal annotations, one (of type u) travelling "up" the tree and one (of type d) traveling "down".

See Data.Tree.DUAL for full documentation. Data.Tree.DUAL provides a public API which should suffice for most purposes. Data.Tree.DUAL.Internal exports more of the internal implementation---use it at your own risk.

Versions [faq],,,,,, 0.2,,,,,,,,,, 0.2.1,, 0.2.2,
Change log CHANGES
Dependencies base (>=4.3 && <4.9), monoid-extras (>=0.2 && <0.5), newtype (==0.2.*), semigroups (>=0.8 && <0.19) [details]
License BSD-3-Clause
Author Brent Yorgey
Maintainer diagrams-discuss@googlegroups.com
Category Data
Bug tracker https://github.com/diagrams/dual-tree/issues
Source repo head: git clone https://github.com/diagrams/dual-tree.git
Uploaded by bergey at 2015-11-11T00:56:55Z
Distributions Debian:0.2.2, LTSHaskell:0.2.2, NixOS:, Stackage:0.2.2
Downloads 41122 total (127 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs not available [build log]
All reported builds failed as of 2016-11-30 [all 3 reports]


  • Data
    • Tree
      • Data.Tree.DUAL
        • Data.Tree.DUAL.Internal


Maintainer's Corner

For package maintainers and hackage trustees