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 (dual-tree-0.2.3.0-r2) |
2021-12-11T14:30:02Z |
BrentYorgey |
be4b8ecb2ecef798f88ee569d043f3f19c32f6dd083329cd7cfcb482f0bc6233
|
|
Changed tested-with
from ghc ==8.4.4: ghc ==8.6.5: ghc ==8.8.4: ghc ==8.10.4: ghc ==9.0.1
to ghc ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.4 || ==9.0.1 || ==9.2.1 Changed the library component's library dependency on 'base'
from >=4.3 && <4.16
to >=4.3 && <4.17 Changed the library component's library dependency on 'semigroups'
from >=0.8 && <0.20
to >=0.8 && <0.21
|
| -r1 (dual-tree-0.2.3.0-r1) |
2021-08-17T18:07:20Z |
BrentYorgey |
bba5476c1cefc3802708a72ab22b5eab9e182cc065507f4a1f673ebdfc694bad
|
|
Changed description
from 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.
to 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
(<https://diagrams.github.io>), 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.
|
| -r0 (dual-tree-0.2.3.0-r0) |
2021-05-11T18:50:01Z |
BrentYorgey |
5c4a64fb3ff5d46d05080db696c8f59ebdefedf10a2aeb8109957f7dc9afd0b6
|
|
|