dual-tree: Rose trees with cached and accumulating monoidal annotations
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.
Downloads
- dual-tree-0.1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5, 0.2, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4, 0.2.0.5, 0.2.0.6, 0.2.0.7, 0.2.0.8, 0.2.0.9, 0.2.1, 0.2.1.1, 0.2.2, 0.2.2.1, 0.2.3.0, 0.2.3.1 |
---|---|
Change log | CHANGES |
Dependencies | base (>=4.3 && <4.7), monoid-extras (>=0.2 && <0.3), newtype (>=0.2 && <0.3), semigroups (>=0.8 && <0.10) [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 BrentYorgey at 2013-01-07T21:22:50Z |
Distributions | Debian:0.2.2.1, LTSHaskell:0.2.3.1, NixOS:0.2.3.1, Stackage:0.2.3.1 |
Reverse Dependencies | 5 direct, 105 indirect [details] |
Downloads | 53591 total (213 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |