lattices 1.7.1 → 1.7.1.1
raw patch · 3 files changed
+17/−10 lines, 3 filesdep ~QuickCheckdep ~basedep ~base-compatPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: QuickCheck, base, base-compat, containers, hashable, semigroupoids, semigroups, tasty, universe-base, universe-instances-base, universe-reverse-instances
API changes (from Hackage documentation)
- Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice a => Algebra.Lattice.BoundedJoinSemiLattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.BoundedLattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.BoundedLattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.BoundedLattice a => Algebra.Lattice.BoundedLattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice a => Algebra.Lattice.BoundedMeetSemiLattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice a => Algebra.Lattice.JoinSemiLattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice a => Data.Semigroup.Semigroup (Algebra.Lattice.Join a)
- Algebra.Lattice: instance Algebra.Lattice.Lattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.Lattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.Lattice a => Algebra.Lattice.Lattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice Data.Monoid.All
- Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice Data.Monoid.Any
- Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice a => Algebra.Lattice.MeetSemiLattice (Data.Monoid.Endo a)
- Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice a => Data.Semigroup.Semigroup (Algebra.Lattice.Meet a)
- Algebra.Lattice.Lexicographic: instance (Data.Data.Data v, Data.Data.Data k) => Data.Data.Data (Algebra.Lattice.Lexicographic.Lexicographic k v)
- Algebra.Lattice.Lexicographic: instance (GHC.Classes.Eq v, GHC.Classes.Eq k) => GHC.Classes.Eq (Algebra.Lattice.Lexicographic.Lexicographic k v)
- Algebra.Lattice.Lexicographic: instance (GHC.Classes.Ord v, GHC.Classes.Ord k) => GHC.Classes.Ord (Algebra.Lattice.Lexicographic.Lexicographic k v)
- Algebra.Lattice.Lexicographic: instance (GHC.Read.Read v, GHC.Read.Read k) => GHC.Read.Read (Algebra.Lattice.Lexicographic.Lexicographic k v)
- Algebra.Lattice.Lexicographic: instance (GHC.Show.Show v, GHC.Show.Show k) => GHC.Show.Show (Algebra.Lattice.Lexicographic.Lexicographic k v)
+ Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.BoundedJoinSemiLattice a => Algebra.Lattice.BoundedJoinSemiLattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.BoundedLattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.BoundedLattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.BoundedLattice a => Algebra.Lattice.BoundedLattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.BoundedMeetSemiLattice a => Algebra.Lattice.BoundedMeetSemiLattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice a => Algebra.Lattice.JoinSemiLattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.JoinSemiLattice a => GHC.Base.Semigroup (Algebra.Lattice.Join a)
+ Algebra.Lattice: instance Algebra.Lattice.Lattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.Lattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.Lattice a => Algebra.Lattice.Lattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice Data.Semigroup.Internal.All
+ Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice Data.Semigroup.Internal.Any
+ Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice a => Algebra.Lattice.MeetSemiLattice (Data.Semigroup.Internal.Endo a)
+ Algebra.Lattice: instance Algebra.Lattice.MeetSemiLattice a => GHC.Base.Semigroup (Algebra.Lattice.Meet a)
+ Algebra.Lattice.Lexicographic: instance (Data.Data.Data k, Data.Data.Data v) => Data.Data.Data (Algebra.Lattice.Lexicographic.Lexicographic k v)
+ Algebra.Lattice.Lexicographic: instance (GHC.Classes.Eq k, GHC.Classes.Eq v) => GHC.Classes.Eq (Algebra.Lattice.Lexicographic.Lexicographic k v)
+ Algebra.Lattice.Lexicographic: instance (GHC.Classes.Ord k, GHC.Classes.Ord v) => GHC.Classes.Ord (Algebra.Lattice.Lexicographic.Lexicographic k v)
+ Algebra.Lattice.Lexicographic: instance (GHC.Read.Read k, GHC.Read.Read v) => GHC.Read.Read (Algebra.Lattice.Lexicographic.Lexicographic k v)
+ Algebra.Lattice.Lexicographic: instance (GHC.Show.Show k, GHC.Show.Show v) => GHC.Show.Show (Algebra.Lattice.Lexicographic.Lexicographic k v)
Files
- CHANGELOG.md +4/−0
- lattices.cabal +12/−9
- test/Tests.hs +1/−1
CHANGELOG.md view
@@ -1,3 +1,7 @@+# 1.7.1.1 (2019-07-05)++- Allow newer dependencies, update cabal file+ # 1.7.1 (2018-01-29) - Correct *Safe Haskell* annotations. See https://github.com/ekmett/semigroupoids/issues/69
lattices.cabal view
@@ -1,5 +1,5 @@ name: lattices-version: 1.7.1+version: 1.7.1.1 cabal-version: >= 1.10 category: Math license: BSD3@@ -11,7 +11,7 @@ copyright: (C) 2010-2015 Maximilian Bolingbroke build-type: Simple extra-source-files: README.md CHANGELOG.md-tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.1+tested-with: GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.3, GHC==8.0.2, GHC==8.2.2, GHC==8.4.3 synopsis: Fine-grained library for constructing and manipulating lattices description: In mathematics, a lattice is a partially ordered set in which every two@@ -39,14 +39,14 @@ Algebra.PartialOrd, Algebra.PartialOrd.Instances - build-depends: base >= 4.5 && < 4.11,- base-compat >= 0.9.3 && < 0.10,+ build-depends: base >= 4.5 && < 4.12,+ base-compat >= 0.9.3 && < 0.11, containers >= 0.4.2.1 && < 0.6, deepseq >= 1.3.0.0 && < 1.5, hashable >= 1.2.6.1 && < 1.3, tagged >= 0.8.5 && < 0.9, unordered-containers >= 0.2.6.0 && < 0.3,- semigroupoids >= 5.2.2 && < 5.3,+ semigroupoids >= 5.2.2 && < 5.4, universe-base >= 1.0 && < 1.1, universe-reverse-instances >= 1.0 && < 1.1 hs-source-dirs: src@@ -70,13 +70,16 @@ ghc-options: -Wall default-language: Haskell2010 build-depends: base,- base-compat >= 0.9.3 && <0.10,- tasty >= 0.10 && < 0.12,- tasty-quickcheck >= 0.8 && < 0.10,- QuickCheck >= 2.10 && <2.11,+ base-compat,+ tasty >= 0.10 && < 1.2,+ tasty-quickcheck >= 0.8 && < 0.11,+ QuickCheck >= 2.10 && <2.12, quickcheck-instances >=0.3.16 && <0.4, universe-instances-base >= 1.0 && <1.1, lattices, containers, transformers, unordered-containers++ if !impl(ghc >= 8.0)+ build-depends: semigroups >= 0.18.3 && < 0.19
test/Tests.hs view
@@ -9,7 +9,7 @@ import Prelude.Compat import Data.Maybe (listToMaybe, isJust)-import Data.Monoid ((<>))+import Data.Semigroup ((<>)) import Control.Monad (ap, guard) import Test.QuickCheck.Function import Test.Tasty