PathTree: A tree used to merge and fold paths
This package contains two modules: Data.LCRSTree and Data.PathTree.
A PathTree
is a tree used to build unified paths from some node. This
means being able to merge multiple paths, that may overlap at the root, in
a sensible way. The module comes with a set of functions to add paths.
A Left-Children-Right-Siblings tree (LCRSTree
) is a tree that represents
a multi-way tree (aka, a Rose Tree) in a binary-tree format. It is the
underlying implementation of PathTree
.
https://en.wikipedia.org/wiki/Left-child_right-sibling_binary_tree
Downloads
- PathTree-0.1.0.0.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'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1.0.0, 0.1.1.0 |
---|---|
Dependencies | base (>=4.7 && <5), containers (>=0.5.6.2 && <0.6) [details] |
License | BSD-3-Clause |
Copyright | 2016 Pedro Rodriguez Tavarez |
Author | Pedro Rodriguez Tavarez |
Maintainer | pedro@pjrt.co |
Revised | Revision 2 made by pjrt at 2016-07-15T20:31:14Z |
Category | Data |
Home page | https://github.com/pjrt/PathTree#readme |
Source repo | head: git clone https://github.com/pjrt/PathTree |
Uploaded | by pjrt at 2016-07-15T20:12:38Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 1858 total (2 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2016-11-22 [all 1 reports] |