The dual-tree package

[Tags:bsd3, library]

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 (, 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,,,,,, 0.2,,,,,,,,,
Change log CHANGES
Dependencies base (>=4.3 && <4.8), monoid-extras (>=0.2 && <0.4), newtype (==0.2.*), semigroups (>=0.8 && <0.16) [details]
License BSD3
Author Brent Yorgey
Category Data
Bug tracker
Source repository head: git clone
Uploaded Mon Jun 2 17:46:45 UTC 2014 by jeffreyrosenbluth
Distributions Debian:, LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 23598 total (305 in the last 30 days)
0 []
Status Docs available [build log]
Successful builds reported [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees