dual-tree 0.2.2 → 0.2.2.1

raw patch · 2 files changed

+10/−5 lines, 2 filesdep ~basePVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: base

API changes (from Hackage documentation)

- Data.Tree.DUAL.Internal: instance (Data.Monoid.Action.Action d u, Data.Semigroup.Semigroup u) => Data.Semigroup.Semigroup (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

- Data.Tree.DUAL.Internal: instance (Data.Monoid.Action.Action d u, Data.Semigroup.Semigroup u) => Data.Semigroup.Semigroup (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

- Data.Tree.DUAL.Internal: instance (Data.Semigroup.Semigroup d, Data.Semigroup.Semigroup u, Data.Monoid.Action.Action d u) => Data.Monoid.Action.Action (Data.Tree.DUAL.Internal.DAct d) (Data.Tree.DUAL.Internal.DUALTree d u a l)

- Data.Tree.DUAL.Internal: instance (Data.Semigroup.Semigroup u, Data.Monoid.Action.Action d u) => Data.Semigroup.Semigroup (Data.Tree.DUAL.Internal.DUALTree d u a l)

- Data.Tree.DUAL.Internal: instance (Data.Semigroup.Semigroup u, Data.Monoid.Action.Action d u) => GHC.Base.Monoid (Data.Tree.DUAL.Internal.DUALTree d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq a, GHC.Classes.Eq d, GHC.Classes.Eq l, GHC.Classes.Eq u) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq l, GHC.Classes.Eq d, GHC.Classes.Eq a, GHC.Classes.Eq u) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq u, GHC.Classes.Eq a, GHC.Classes.Eq d, GHC.Classes.Eq l) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTree d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Show.Show a, GHC.Show.Show d, GHC.Show.Show l, GHC.Show.Show u) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Show.Show l, GHC.Show.Show d, GHC.Show.Show a, GHC.Show.Show u) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

- Data.Tree.DUAL.Internal: instance (GHC.Show.Show u, GHC.Show.Show a, GHC.Show.Show d, GHC.Show.Show l) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (Data.Monoid.Action.Action d u, GHC.Base.Semigroup u) => GHC.Base.Semigroup (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Base.Semigroup d, GHC.Base.Semigroup u, Data.Monoid.Action.Action d u) => Data.Monoid.Action.Action (Data.Tree.DUAL.Internal.DAct d) (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Base.Semigroup u, Data.Monoid.Action.Action d u) => GHC.Base.Monoid (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Base.Semigroup u, Data.Monoid.Action.Action d u) => GHC.Base.Semigroup (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Base.Semigroup u, Data.Monoid.Action.Action d u) => GHC.Base.Semigroup (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq u, GHC.Classes.Eq l, GHC.Classes.Eq d, GHC.Classes.Eq a) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq u, GHC.Classes.Eq l, GHC.Classes.Eq d, GHC.Classes.Eq a) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Classes.Eq u, GHC.Classes.Eq l, GHC.Classes.Eq d, GHC.Classes.Eq a) => GHC.Classes.Eq (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Show.Show u, GHC.Show.Show l, GHC.Show.Show d, GHC.Show.Show a) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTree d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Show.Show u, GHC.Show.Show l, GHC.Show.Show d, GHC.Show.Show a) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTreeNE d u a l)

+ Data.Tree.DUAL.Internal: instance (GHC.Show.Show u, GHC.Show.Show l, GHC.Show.Show d, GHC.Show.Show a) => GHC.Show.Show (Data.Tree.DUAL.Internal.DUALTreeU d u a l)

- Data.Tree.DUAL.Internal: Act :: d -> (DUALTreeU d u a l) -> DUALTreeNE d u a l

+ Data.Tree.DUAL.Internal: Act :: d -> DUALTreeU d u a l -> DUALTreeNE d u a l

- Data.Tree.DUAL.Internal: Annot :: a -> (DUALTreeU d u a l) -> DUALTreeNE d u a l

+ Data.Tree.DUAL.Internal: Annot :: a -> DUALTreeU d u a l -> DUALTreeNE d u a l

- Data.Tree.DUAL.Internal: Concat :: (NonEmpty (DUALTreeU d u a l)) -> DUALTreeNE d u a l

+ Data.Tree.DUAL.Internal: Concat :: NonEmpty (DUALTreeU d u a l) -> DUALTreeNE d u a l

Files

CHANGES +5/−0
dual-tree.cabal +5/−5

CHANGES view

@@ -1,3 +1,8 @@+* 0.2.2.1: 19 October 2019++- Allow semigroups-0.19+- Allow base-4.13 and test with GHC 8.8+ * 0.2.2: 16 May 2018  - allow monoid-extras-0.5

dual-tree.cabal view

@@ -1,5 +1,5 @@ name:                dual-tree-version:             0.2.2+version:             0.2.2.1 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 +31,7 @@ build-type:          Simple cabal-version:       >=1.10 bug-reports:         https://github.com/diagrams/dual-tree/issues-tested-with:         GHC == 7.8.4, GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.2+tested-with:         GHC == 7.10.3, GHC == 8.0.2, GHC == 8.2.2, GHC == 8.4.2, GHC == 8.6.1, GHC == 8.8.1 source-repository head   type: git   location: https://github.com/diagrams/dual-tree.git@@ -40,9 +40,9 @@   default-language:  Haskell2010   exposed-modules:   Data.Tree.DUAL                      Data.Tree.DUAL.Internal-  build-depends:     base >= 4.3 && < 4.12,-                     semigroups >= 0.8 && < 0.19,-                     newtype-generics >= 0.5 && < 0.6,+  build-depends:     base >= 4.3 && < 4.14,+                     semigroups >= 0.8 && < 0.20,+                     newtype-generics >= 0.5.3 && < 0.6,                      monoid-extras >= 0.2 && < 0.6   hs-source-dirs:    src   other-extensions:  GeneralizedNewtypeDeriving,