Package maintainers and Hackage trustees are allowed to edit certain bits
of package metadata after a release, without uploading a new tarball.
Note that the tarball itself is never changed, just the metadata that is
stored separately. For more information about metadata revisions, please
refer to the
Hackage Metadata Revisions FAQ.
| No. |
Time |
User |
SHA256 |
| -r2 (PathTree-0.1.0.0-r2) |
2016-07-15T20:31:14Z |
pjrt |
90fef179293f34a08739166e11dd230012b039ed2fb4e2c66077e625fb927cf6
|
|
Changed description
from 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>
to 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>
|
| -r1 (PathTree-0.1.0.0-r1) |
2016-07-15T20:15:42Z |
pjrt |
e9051f74d285189cb55b57a758f96d20bf5db1488b562e1da13dda5c5ba5dd6e
|
|
|
| -r0 (PathTree-0.1.0.0-r0) |
2016-07-15T20:12:38Z |
pjrt |
5a8750fac70195c7a988c6f8ead2a6412ffbf72e472ec3fc99e04e165faca5fd
|
|
|