1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
Source: haskell-dual-tree
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders:
Joachim Breitner <nomeata@debian.org>,
Priority: extra
Section: haskell
Build-Depends:
cdbs,
debhelper (>= 9),
ghc (>= 8),
ghc-prof,
haskell-devscripts (>= 0.13),
libghc-monoid-extras-dev (<< 0.5),
libghc-monoid-extras-dev (>= 0.2),
libghc-monoid-extras-prof,
libghc-newtype-dev (<< 0.3),
libghc-newtype-dev (>= 0.2),
libghc-newtype-prof,
libghc-semigroups-dev (<< 0.19),
libghc-semigroups-dev (>= 0.8),
libghc-semigroups-prof,
Build-Depends-Indep:
ghc-doc,
libghc-monoid-extras-doc,
libghc-newtype-doc,
libghc-semigroups-doc,
Standards-Version: 3.9.8
Homepage: http://hackage.haskell.org/package/dual-tree
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-haskell/DHG_packages.git/tree/p/haskell-dual-tree
Vcs-Git: https://anonscm.debian.org/git/pkg-haskell/DHG_packages.git
Package: libghc-dual-tree-dev
Architecture: any
Depends:
${haskell:Depends},
${misc:Depends},
${shlibs:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Provides:
${haskell:Provides},
Description: Rose trees with cached and accumulating monoidal annotations${haskell:ShortBlurb}
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
(i.e. accumulating) monoidal annotations.
.
Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
internal nodes, and two types of monoidal annotations, one travelling "up" the
tree and one traveling "down".
.
${haskell:Blurb}
Package: libghc-dual-tree-prof
Architecture: any
Depends:
${haskell:Depends},
${misc:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Provides:
${haskell:Provides},
Description: Rose trees with cached and accumulating monoidal annotations${haskell:ShortBlurb}
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
(i.e. accumulating) monoidal annotations.
.
Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
internal nodes, and two types of monoidal annotations, one travelling "up" the
tree and one traveling "down".
.
${haskell:Blurb}
Package: libghc-dual-tree-doc
Architecture: all
Section: doc
Depends:
${haskell:Depends},
${misc:Depends},
Recommends:
${haskell:Recommends},
Suggests:
${haskell:Suggests},
Description: Rose trees with cached and accumulating monoidal annotations${haskell:ShortBlurb}
Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling
(i.e. accumulating) monoidal annotations.
.
Abstractly, a DUALTree is a rose (n-ary) tree with data at leaves, data at
internal nodes, and two types of monoidal annotations, one travelling "up" the
tree and one traveling "down".
.
${haskell:Blurb}
|
