quickcheck-combinators 0.0.2 → 0.0.3
raw patch · 2 files changed
+19/−19 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeLits.KnownNat n) => Data.Data.Data (Test.QuickCheck.Combinators.AtLeast n t a)
- Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeLits.KnownNat n) => Data.Data.Data (Test.QuickCheck.Combinators.AtMost n t a)
- Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeLits.KnownNat n, GHC.TypeLits.KnownNat m) => Data.Data.Data (Test.QuickCheck.Combinators.Between n m t a)
- Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeLits.KnownNat m, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtMost m t a)
- Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeLits.KnownNat n, GHC.TypeLits.KnownNat m, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.Between n m t a)
- Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeLits.KnownNat n, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtLeast n t a)
- Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeLits.KnownNat n) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtLeast n Test.QuickCheck.Modifiers.OrderedList a)
- Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeLits.KnownNat n) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtMost n Test.QuickCheck.Modifiers.OrderedList a)
- Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, GHC.TypeLits.KnownNat n, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeLits.KnownNat m) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.Between n m Test.QuickCheck.Modifiers.OrderedList a)
+ Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeNats.KnownNat m, GHC.TypeNats.KnownNat n) => Data.Data.Data (Test.QuickCheck.Combinators.Between n m t a)
+ Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeNats.KnownNat n) => Data.Data.Data (Test.QuickCheck.Combinators.AtLeast n t a)
+ Test.QuickCheck.Combinators: instance (Data.Data.Data (t a), Data.Typeable.Internal.Typeable a, Data.Typeable.Internal.Typeable t, GHC.TypeNats.KnownNat n) => Data.Data.Data (Test.QuickCheck.Combinators.AtMost n t a)
+ Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeNats.KnownNat m, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtMost m t a)
+ Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeNats.KnownNat n, GHC.TypeNats.KnownNat m, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.Between n m t a)
+ Test.QuickCheck.Combinators: instance (Data.Unfoldable.Restricted.UnfoldableR p t, GHC.Base.Monoid (t a), Test.QuickCheck.Arbitrary.Arbitrary a, GHC.TypeNats.KnownNat n, p a) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtLeast n t a)
+ Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeNats.KnownNat n) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtLeast n Test.QuickCheck.Modifiers.OrderedList a)
+ Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeNats.KnownNat n) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.AtMost n Test.QuickCheck.Modifiers.OrderedList a)
+ Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, GHC.TypeNats.KnownNat n, Data.Unfoldable.Restricted.UnfoldableR p [], p a, GHC.TypeNats.KnownNat m) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.Between n m Test.QuickCheck.Modifiers.OrderedList a)
Files
quickcheck-combinators.cabal view
@@ -1,5 +1,5 @@ Name: quickcheck-combinators-Version: 0.0.2+Version: 0.0.3 Author: Athan Clark <athan.clark@gmail.com> Maintainer: Athan Clark <athan.clark@gmail.com> License: BSD3
src/Test/QuickCheck/Combinators.hs view
@@ -45,9 +45,9 @@ , KnownNat n , p a ) => Arbitrary (AtLeast (n :: Nat) t a) where- arbitrary = sized $ \m' -> do- let n' = fromIntegral $ natVal (Proxy :: Proxy n)- k <- choose (min n' m', max n' m')+ arbitrary = sized $ \s -> do+ let n' = fromIntegral (natVal (Proxy :: Proxy n))+ k <- choose (n', s) ts <- fromMaybe mempty . fromList <$> replicateM k arbitrary return . AtLeast $ ts @@ -57,10 +57,10 @@ , UnfoldableR p [] , p a , KnownNat n) => Arbitrary (AtLeast (n :: Nat) OrderedList a) where- arbitrary = sized $ \m -> do- let n' = fromIntegral $ natVal (Proxy :: Proxy n)+ arbitrary = sized $ \s -> do+ let n' = fromIntegral (natVal (Proxy :: Proxy n)) mkOrd = Ordered . L.sort . fromMaybe mempty . fromList- k <- choose (min n' m, max n' m)+ k <- choose (n', s) ts <- mkOrd <$> replicateM k arbitrary return . AtLeast $ ts @@ -76,9 +76,9 @@ , KnownNat m , p a ) => Arbitrary (AtMost (m :: Nat) t a) where- arbitrary = sized $ \m'' -> do- let m' = fromIntegral $ natVal (Proxy :: Proxy m)- k <- choose (0, min m' m'')+ arbitrary = sized $ \s -> do+ let m' = fromIntegral (natVal (Proxy :: Proxy m))+ k <- choose (0, min m' s) ts <- fromMaybe mempty . fromList <$> replicateM k arbitrary return . AtMost $ ts @@ -88,10 +88,10 @@ , UnfoldableR p [] , p a , KnownNat n) => Arbitrary (AtMost (n :: Nat) OrderedList a) where- arbitrary = sized $ \m -> do- let n' = fromIntegral $ natVal (Proxy :: Proxy n)+ arbitrary = sized $ \s -> do+ let m' = fromIntegral $ natVal (Proxy :: Proxy n) mkOrd = Ordered . L.sort . fromMaybe mempty . fromList- k <- choose (0, min n' m)+ k <- choose (0, min m' s) ts <- mkOrd <$> replicateM k arbitrary return . AtMost $ ts @@ -108,10 +108,10 @@ , KnownNat m , p a ) => Arbitrary (Between (n :: Nat) (m :: Nat) t a) where- arbitrary = sized $ \m'' -> do- let n' = fromIntegral $ natVal (Proxy :: Proxy n)- m' = fromIntegral $ natVal (Proxy :: Proxy m)- k <- choose (n', min m' m'')+ arbitrary = sized $ \s -> do+ let n' = fromIntegral (natVal (Proxy :: Proxy n))+ m' = fromIntegral (natVal (Proxy :: Proxy m))+ k <- choose (n', min m' s) ts <- fromMaybe mempty . fromList <$> replicateM k arbitrary return . Between $ ts @@ -123,8 +123,8 @@ , p a , KnownNat m) => Arbitrary (Between (n :: Nat) (m :: Nat) OrderedList a) where arbitrary = sized $ \s -> do- let n' = fromIntegral $ natVal (Proxy :: Proxy n)- m' = fromIntegral $ natVal (Proxy :: Proxy m)+ let n' = fromIntegral (natVal (Proxy :: Proxy n))+ m' = fromIntegral (natVal (Proxy :: Proxy m)) mkOrd = Ordered . L.sort . fromMaybe mempty . fromList k <- choose (n', min m' s) ts <- mkOrd <$> replicateM k arbitrary