Remove redundant constraints GHC 8 will complain about

also tested this still works with the older QuickCheck 2.6
haskell · Nov 28, 2015 · b1146d9 · b1146d9
1 parent fee7325
commit b1146d9
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/src/Data/Ranged/RangedSet.hs b/src/Data/Ranged/RangedSet.hs
@@ -249,7 +249,7 @@ rSetUnfold bound upperFunc succFunc = RSet $ normalise $ ranges1 bound
 
 -- QuickCheck Generators
 
-instance (Arbitrary v, DiscreteOrdered v, Show v) =>
+instance (Arbitrary v, DiscreteOrdered v) =>
       Arbitrary (RSet v)
    where
    arbitrary = frequency [
@@ -266,7 +266,7 @@ instance (Arbitrary v, DiscreteOrdered v, Show v) =>
          rangeList (b1:b2:bs) = Range b1 b2 : rangeList bs
          rangeList _ = []
 
-instance (CoArbitrary v, DiscreteOrdered v, Show v) =>
+instance (CoArbitrary v, DiscreteOrdered v) =>
       CoArbitrary (RSet v)
    where
    coarbitrary (RSet ls) = variant (0 :: Int) . coarbitrary ls

diff --git a/src/Data/Ranged/Ranges.hs b/src/Data/Ranged/Ranges.hs
@@ -215,7 +215,7 @@ rangeDifference r1@(Range lower1 upper1) (Range lower2 upper2) =
 
 -- QuickCheck generators
 
-instance (Arbitrary v,  DiscreteOrdered v, Show v) =>
+instance (Arbitrary v,  DiscreteOrdered v) =>
    Arbitrary (Range v) where
 
    arbitrary = frequency [
@@ -234,7 +234,7 @@ instance (Arbitrary v,  DiscreteOrdered v, Show v) =>
       (1, return fullRange)
       ]
 
-instance (CoArbitrary v, DiscreteOrdered v, Show v) =>
+instance (CoArbitrary v, DiscreteOrdered v) =>
    CoArbitrary (Range v) where
 
    coarbitrary (Range lower upper) =