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
|
Index: b/dual-tree.cabal
===================================================================
--- a/dual-tree.cabal
+++ b/dual-tree.cabal
@@ -1,5 +1,6 @@
name: dual-tree
version: 0.2.3.1
+x-revision: 3
synopsis: Rose trees with cached and accumulating monoidal annotations
description: Rose (n-ary) trees with both upwards- (/i.e./
cached) and downwards-traveling (/i.e./
@@ -31,7 +32,7 @@ category: Data
build-type: Simple
cabal-version: >=1.10
bug-reports: https://github.com/diagrams/dual-tree/issues
-tested-with: GHC ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.4 || ==9.4.1
+tested-with: GHC ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.5 || ==9.8.2 || ==9.10.1
source-repository head
type: git
location: https://github.com/diagrams/dual-tree.git
@@ -40,7 +41,7 @@ library
default-language: Haskell2010
exposed-modules: Data.Tree.DUAL
Data.Tree.DUAL.Internal
- build-depends: base >= 4.3 && < 4.18,
+ build-depends: base >= 4.3 && < 4.21,
semigroups >= 0.8 && < 0.21,
monoid-extras >= 0.6 && < 0.7
hs-source-dirs: src
|
