packages feed

EdisonCore 1.3 → 1.3.1

raw patch · 3 files changed

+3/−17 lines, 3 filesdep ~QuickCheckPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: QuickCheck

API changes (from Hackage documentation)

- Data.Edison.Assoc.StandardMap: instance (GHC.Classes.Ord k, Test.QuickCheck.Arbitrary.Arbitrary k, Test.QuickCheck.Arbitrary.Arbitrary a) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Edison.Assoc.StandardMap.FM k a)
- Data.Edison.Assoc.StandardMap: instance (GHC.Classes.Ord k, Test.QuickCheck.Arbitrary.CoArbitrary k, Test.QuickCheck.Arbitrary.CoArbitrary a) => Test.QuickCheck.Arbitrary.CoArbitrary (Data.Edison.Assoc.StandardMap.FM k a)
- Data.Edison.Coll.StandardSet: instance (GHC.Classes.Ord a, Test.QuickCheck.Arbitrary.Arbitrary a) => Test.QuickCheck.Arbitrary.Arbitrary (Data.Edison.Coll.StandardSet.Set a)
- Data.Edison.Coll.StandardSet: instance (GHC.Classes.Ord a, Test.QuickCheck.Arbitrary.CoArbitrary a) => Test.QuickCheck.Arbitrary.CoArbitrary (Data.Edison.Coll.StandardSet.Set a)

Files

EdisonCore.cabal view
@@ -1,7 +1,7 @@ Name:           EdisonCore-Cabal-Version:  >= 1.22+Cabal-Version:  >= 1.10 Build-Type:     Simple-Version:        1.3+Version:        1.3.1 License:        OtherLicense License-File:   COPYRIGHT Author:         Chris Okasaki@@ -54,7 +54,7 @@   Build-Depends:      base == 4.*,      mtl,-     QuickCheck >= 2.0 && < 3,+     QuickCheck >= 2.8.2 && < 3,      EdisonAPI,      containers,      array
src/Data/Edison/Assoc/StandardMap.hs view
@@ -359,10 +359,3 @@    intersectionWithKey = intersectionWithKey}  instance Ord k => A.OrdFiniteMap (FM k) k--instance (Ord k,Arbitrary k,Arbitrary a) => Arbitrary (FM k a) where-   arbitrary = do (xs::[(k,a)]) <- arbitrary-                  return (Prelude.foldr (uncurry insert) empty xs)--instance (Ord k,CoArbitrary k,CoArbitrary a) => CoArbitrary (FM k a) where-   coarbitrary mp = coarbitrary (A.toList mp)
src/Data/Edison/Coll/StandardSet.hs view
@@ -262,10 +262,3 @@ instance Ord a => C.OrdSetX (Set a) a  instance Ord a => C.OrdSet (Set a) a--instance (Ord a, Arbitrary a) => Arbitrary (Set a) where-  arbitrary = do (xs::[a]) <- arbitrary-                 return (Prelude.foldr insert empty xs)--instance (Ord a, CoArbitrary a) => CoArbitrary (Set a) where-  coarbitrary set = coarbitrary (C.toList set)