quickcheck-combinators 0.0.5 → 0.0.6

raw patch · 3 files changed

+24/−32 lines, 3 filesdep +unit-constraintPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies added: unit-constraint

API changes (from Hackage documentation)

- 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, 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)

+ Test.QuickCheck.Combinators: instance (Test.QuickCheck.Arbitrary.Arbitrary a, GHC.Classes.Ord a, Data.Unfoldable.Restricted.UnfoldableR Data.Constraint.Unit.Unit [], Data.Constraint.Unit.Unit 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, GHC.TypeNats.KnownNat n, Data.Unfoldable.Restricted.UnfoldableR Data.Constraint.Unit.Unit [], Data.Constraint.Unit.Unit a, GHC.TypeNats.KnownNat m) => Test.QuickCheck.Arbitrary.Arbitrary (Test.QuickCheck.Combinators.Between n m Test.QuickCheck.Modifiers.OrderedList a)

- Test.QuickCheck.Combinators: AtLeast :: t a -> AtLeast t a

+ Test.QuickCheck.Combinators: AtLeast :: t a -> AtLeast (n :: Nat) t a

- Test.QuickCheck.Combinators: AtMost :: t a -> AtMost t a

+ Test.QuickCheck.Combinators: AtMost :: t a -> AtMost (n :: Nat) t a

- Test.QuickCheck.Combinators: Between :: t a -> Between t a

+ Test.QuickCheck.Combinators: Between :: t a -> Between (n :: Nat) (m :: Nat) t a

- Test.QuickCheck.Combinators: [getAtLeast] :: AtLeast t a -> t a

+ Test.QuickCheck.Combinators: [getAtLeast] :: AtLeast (n :: Nat) t a -> t a

- Test.QuickCheck.Combinators: [getAtMost] :: AtMost t a -> t a

+ Test.QuickCheck.Combinators: [getAtMost] :: AtMost (n :: Nat) t a -> t a

- Test.QuickCheck.Combinators: [getBetween] :: Between t a -> t a

+ Test.QuickCheck.Combinators: [getBetween] :: Between (n :: Nat) (m :: Nat) t a -> t a

Files

ChangeLog.md +0/−12
quickcheck-combinators.cabal +11/−9
src/Test/QuickCheck/Combinators.hs +13/−11

− ChangeLog.md

@@ -1,12 +0,0 @@-# Revision history for dnf--## 0.0.0 -- 2016-04-08--* First version. Released on an unsuspecting world.--## 0.0.1  -- 2016-06-18--* Added changelog (which you are now reading).-* Added instances of ``AtLeast``, ``AtMost``, and ``Between`` for-  ``OrderedList``.-* Removed some redundant constraints.

quickcheck-combinators.cabal view

@@ -1,24 +1,25 @@--- This file has been generated from package.yaml by hpack version 0.21.2.+cabal-version: 1.12++-- This file has been generated from package.yaml by hpack version 0.35.2. -- -- see: https://github.com/sol/hpack ----- hash: 95aa2f2c9903df88bd3133ecbf961b597fef510715549892576747518c4c658a+-- hash: f6c98d5e33c7c9574797cce4ab20950ef1060b636f413e3d47c1685a063e99cb  name:           quickcheck-combinators-version:        0.0.5-description:    Please see the README on GitHub at <https://github.com/githubuser/template-dictionary#readme>+version:        0.0.6+synopsis:       Simple type-level combinators for augmenting QuickCheck instances.+description:    Please see the README on GitHub at <https://github.com/athanclark/quickcheck-combinators#README>+category:       Test homepage:       https://github.com/athanclark/quickcheck-combinators#readme bug-reports:    https://github.com/athanclark/quickcheck-combinators/issues author:         Athan Clark-maintainer:     athan.clark@localcooking.com-copyright:      2018 (c) Local Cooking Inc.+maintainer:     athan.clark@gmail.com+copyright:      2023 (c) Athan Clark license:        BSD3 license-file:   LICENSE build-type:     Simple-cabal-version:  >= 1.10- extra-source-files:-    ChangeLog.md     README.md  source-repository head@@ -37,4 +38,5 @@       QuickCheck     , base >=4.11 && <5     , unfoldable-restricted >=0.0.1+    , unit-constraint   default-language: Haskell2010

src/Test/QuickCheck/Combinators.hs view

@@ -12,23 +12,25 @@   , DeriveFunctor   , DeriveFoldable   , DeriveTraversable+  , MonoLocalBinds   #-}  module Test.QuickCheck.Combinators where -import GHC.TypeLits-import Data.Proxy+import GHC.TypeLits (Nat, KnownNat, natVal)+import Data.Proxy (Proxy (..))  import Data.Maybe (fromMaybe) import Data.Unfoldable.Restricted (UnfoldableR, fromList)+import Data.Constraint.Unit (Unit) import Control.Monad (replicateM) -import Test.QuickCheck+import Test.QuickCheck (OrderedList (..), Arbitrary (..), choose, sized)  import qualified Data.List as L (sort) -import Data.Data-import GHC.Generics+import Data.Data (Data, Typeable)+import GHC.Generics (Generic)   @@ -54,8 +56,8 @@ instance {-# OVERLAPPING #-}          ( Arbitrary a          , Ord a-         , UnfoldableR p []-         , p a+         , UnfoldableR Unit []+         , Unit a          , KnownNat n) => Arbitrary (AtLeast (n :: Nat) OrderedList a) where   arbitrary = sized $ \s -> do     let n' = fromIntegral (natVal (Proxy :: Proxy n))@@ -85,8 +87,8 @@ instance {-# OVERLAPPING #-}          ( Arbitrary a          , Ord a-         , UnfoldableR p []-         , p a+         , UnfoldableR Unit []+         , Unit a          , KnownNat n) => Arbitrary (AtMost (n :: Nat) OrderedList a) where   arbitrary = sized $ \s -> do     let m' = fromIntegral $ natVal (Proxy :: Proxy n)@@ -119,8 +121,8 @@          ( Arbitrary a          , Ord a          , KnownNat n-         , UnfoldableR p []-         , p a+         , UnfoldableR Unit []+         , Unit a          , KnownNat m) => Arbitrary (Between (n :: Nat) (m :: Nat) OrderedList a) where   arbitrary = sized $ \s -> do     let n' = fromIntegral (natVal (Proxy :: Proxy n))