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
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
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.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|
|Dependencies||base (>=4.3 && <4.13), monoid-extras (>=0.2 && <0.6), newtype-generics (>=0.5.3 && <0.6), semigroups (>=0.8 && <0.19) [details]|
|Revised||Revision 2 made by BrentYorgey at Sun Oct 7 02:54:10 UTC 2018|
|Source repo||head: git clone https://github.com/diagrams/dual-tree.git|
|Uploaded||by BrentYorgey at Wed May 16 11:11:39 UTC 2018|
|Distributions||Debian:0.2.2, LTSHaskell:0.2.2, NixOS:0.2.2, Stackage:0.2.2|
|Downloads||32400 total (501 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs available [build log]
Last success reported on 2018-05-16 [all 1 reports]
- dual-tree-0.2.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees