dual-tree

Rose trees with cached and accumulating monoidal annotations

Version on this page:	0.2.0.9
LTS Haskell 22.40:	0.2.3.1@rev:3
Stackage Nightly 2024-11-04:	0.2.3.1@rev:3
Latest on Hackage:	0.2.3.1@rev:3

See all snapshots dual-tree appears in

BSD-3-Clause licensed by Brent Yorgey

Maintained by [email protected]

This version can be pinned in stack with:dual-tree-0.2.0.9@sha256:d3609de8c10c9738d4cd72456a6ba102181196931f6be3c0b4f9a01bf4e73f6c,2340

Module documentation for 0.2.0.9

Data
- Data.Tree
  - Data.Tree.DUAL
    - Data.Tree.DUAL.Internal

Depends on 4 packages(full list with versions):

base, monoid-extras, newtype, semigroups

Used by 2 packages in lts-6.10(full list with versions):

diagrams-core, diagrams-lib

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.