{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}

module Internal.Test.QuickCheck.Quid.Combinators.Size
    where

import Control.DeepSeq
    ( NFData )
import Data.Data
    ( Data )
import Data.Hashable
    ( Hashable (..) )
import Data.Proxy
    ( Proxy (..) )
import GHC.Generics
    ( Generic )
import GHC.TypeLits
    ( KnownNat, Nat, natVal )
import Test.QuickCheck
    ( Arbitrary (..), resize, shrinkMapBy )

--------------------------------------------------------------------------------
-- Sizes
--------------------------------------------------------------------------------

newtype Size (n :: Nat) a = Size { Size n a -> a
unSize :: a }
    deriving (Typeable (Size n a)
DataType
Constr
Typeable (Size n a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Size n a -> c (Size n a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (Size n a))
-> (Size n a -> Constr)
-> (Size n a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (Size n a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c (Size n a)))
-> ((forall b. Data b => b -> b) -> Size n a -> Size n a)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Size n a -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Size n a -> r)
-> (forall u. (forall d. Data d => d -> u) -> Size n a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Size n a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Size n a -> m (Size n a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Size n a -> m (Size n a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Size n a -> m (Size n a))
-> Data (Size n a)
Size n a -> DataType
Size n a -> Constr
(forall b. Data b => b -> b) -> Size n a -> Size n a
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Size n a -> c (Size n a)
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Size n a)
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Size n a -> u
forall u. (forall d. Data d => d -> u) -> Size n a -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
forall (n :: Nat) a. (KnownNat n, Data a) => Typeable (Size n a)
forall (n :: Nat) a. (KnownNat n, Data a) => Size n a -> DataType
forall (n :: Nat) a. (KnownNat n, Data a) => Size n a -> Constr
forall (n :: Nat) a.
(KnownNat n, Data a) =>
(forall b. Data b => b -> b) -> Size n a -> Size n a
forall (n :: Nat) a u.
(KnownNat n, Data a) =>
Int -> (forall d. Data d => d -> u) -> Size n a -> u
forall (n :: Nat) a u.
(KnownNat n, Data a) =>
(forall d. Data d => d -> u) -> Size n a -> [u]
forall (n :: Nat) a r r'.
(KnownNat n, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
forall (n :: Nat) a r r'.
(KnownNat n, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
forall (n :: Nat) a (m :: * -> *).
(KnownNat n, Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
forall (n :: Nat) a (m :: * -> *).
(KnownNat n, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
forall (n :: Nat) a (c :: * -> *).
(KnownNat n, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Size n a)
forall (n :: Nat) a (c :: * -> *).
(KnownNat n, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Size n a -> c (Size n a)
forall (n :: Nat) a (t :: * -> *) (c :: * -> *).
(KnownNat n, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Size n a))
forall (n :: Nat) a (t :: * -> * -> *) (c :: * -> *).
(KnownNat n, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Size n a))
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Size n a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Size n a -> c (Size n a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Size n a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Size n a))
$cSize :: Constr
$tSize :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
$cgmapMo :: forall (n :: Nat) a (m :: * -> *).
(KnownNat n, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
gmapMp :: (forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
$cgmapMp :: forall (n :: Nat) a (m :: * -> *).
(KnownNat n, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
gmapM :: (forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
$cgmapM :: forall (n :: Nat) a (m :: * -> *).
(KnownNat n, Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Size n a -> m (Size n a)
gmapQi :: Int -> (forall d. Data d => d -> u) -> Size n a -> u
$cgmapQi :: forall (n :: Nat) a u.
(KnownNat n, Data a) =>
Int -> (forall d. Data d => d -> u) -> Size n a -> u
gmapQ :: (forall d. Data d => d -> u) -> Size n a -> [u]
$cgmapQ :: forall (n :: Nat) a u.
(KnownNat n, Data a) =>
(forall d. Data d => d -> u) -> Size n a -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
$cgmapQr :: forall (n :: Nat) a r r'.
(KnownNat n, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
$cgmapQl :: forall (n :: Nat) a r r'.
(KnownNat n, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Size n a -> r
gmapT :: (forall b. Data b => b -> b) -> Size n a -> Size n a
$cgmapT :: forall (n :: Nat) a.
(KnownNat n, Data a) =>
(forall b. Data b => b -> b) -> Size n a -> Size n a
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Size n a))
$cdataCast2 :: forall (n :: Nat) a (t :: * -> * -> *) (c :: * -> *).
(KnownNat n, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Size n a))
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c (Size n a))
$cdataCast1 :: forall (n :: Nat) a (t :: * -> *) (c :: * -> *).
(KnownNat n, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Size n a))
dataTypeOf :: Size n a -> DataType
$cdataTypeOf :: forall (n :: Nat) a. (KnownNat n, Data a) => Size n a -> DataType
toConstr :: Size n a -> Constr
$ctoConstr :: forall (n :: Nat) a. (KnownNat n, Data a) => Size n a -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Size n a)
$cgunfold :: forall (n :: Nat) a (c :: * -> *).
(KnownNat n, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Size n a)
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Size n a -> c (Size n a)
$cgfoldl :: forall (n :: Nat) a (c :: * -> *).
(KnownNat n, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Size n a -> c (Size n a)
$cp1Data :: forall (n :: Nat) a. (KnownNat n, Data a) => Typeable (Size n a)
Data, Size n a -> Size n a -> Bool
(Size n a -> Size n a -> Bool)
-> (Size n a -> Size n a -> Bool) -> Eq (Size n a)
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall (n :: Nat) a. Eq a => Size n a -> Size n a -> Bool
/= :: Size n a -> Size n a -> Bool
$c/= :: forall (n :: Nat) a. Eq a => Size n a -> Size n a -> Bool
== :: Size n a -> Size n a -> Bool
$c== :: forall (n :: Nat) a. Eq a => Size n a -> Size n a -> Bool
Eq, (forall x. Size n a -> Rep (Size n a) x)
-> (forall x. Rep (Size n a) x -> Size n a) -> Generic (Size n a)
forall x. Rep (Size n a) x -> Size n a
forall x. Size n a -> Rep (Size n a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall (n :: Nat) a x. Rep (Size n a) x -> Size n a
forall (n :: Nat) a x. Size n a -> Rep (Size n a) x
$cto :: forall (n :: Nat) a x. Rep (Size n a) x -> Size n a
$cfrom :: forall (n :: Nat) a x. Size n a -> Rep (Size n a) x
Generic, Eq (Size n a)
Eq (Size n a)
-> (Int -> Size n a -> Int)
-> (Size n a -> Int)
-> Hashable (Size n a)
Int -> Size n a -> Int
Size n a -> Int
forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall (n :: Nat) a. Hashable a => Eq (Size n a)
forall (n :: Nat) a. Hashable a => Int -> Size n a -> Int
forall (n :: Nat) a. Hashable a => Size n a -> Int
hash :: Size n a -> Int
$chash :: forall (n :: Nat) a. Hashable a => Size n a -> Int
hashWithSalt :: Int -> Size n a -> Int
$chashWithSalt :: forall (n :: Nat) a. Hashable a => Int -> Size n a -> Int
$cp1Hashable :: forall (n :: Nat) a. Hashable a => Eq (Size n a)
Hashable, Size n a -> ()
(Size n a -> ()) -> NFData (Size n a)
forall a. (a -> ()) -> NFData a
forall (n :: Nat) a. NFData a => Size n a -> ()
rnf :: Size n a -> ()
$crnf :: forall (n :: Nat) a. NFData a => Size n a -> ()
NFData, Eq (Size n a)
Eq (Size n a)
-> (Size n a -> Size n a -> Ordering)
-> (Size n a -> Size n a -> Bool)
-> (Size n a -> Size n a -> Bool)
-> (Size n a -> Size n a -> Bool)
-> (Size n a -> Size n a -> Bool)
-> (Size n a -> Size n a -> Size n a)
-> (Size n a -> Size n a -> Size n a)
-> Ord (Size n a)
Size n a -> Size n a -> Bool
Size n a -> Size n a -> Ordering
Size n a -> Size n a -> Size n a
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall (n :: Nat) a. Ord a => Eq (Size n a)
forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Bool
forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Ordering
forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Size n a
min :: Size n a -> Size n a -> Size n a
$cmin :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Size n a
max :: Size n a -> Size n a -> Size n a
$cmax :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Size n a
>= :: Size n a -> Size n a -> Bool
$c>= :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Bool
> :: Size n a -> Size n a -> Bool
$c> :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Bool
<= :: Size n a -> Size n a -> Bool
$c<= :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Bool
< :: Size n a -> Size n a -> Bool
$c< :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Bool
compare :: Size n a -> Size n a -> Ordering
$ccompare :: forall (n :: Nat) a. Ord a => Size n a -> Size n a -> Ordering
$cp1Ord :: forall (n :: Nat) a. Ord a => Eq (Size n a)
Ord)
    deriving (ReadPrec [Size n a]
ReadPrec (Size n a)
Int -> ReadS (Size n a)
ReadS [Size n a]
(Int -> ReadS (Size n a))
-> ReadS [Size n a]
-> ReadPrec (Size n a)
-> ReadPrec [Size n a]
-> Read (Size n a)
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
forall (n :: Nat) a. Read a => ReadPrec [Size n a]
forall (n :: Nat) a. Read a => ReadPrec (Size n a)
forall (n :: Nat) a. Read a => Int -> ReadS (Size n a)
forall (n :: Nat) a. Read a => ReadS [Size n a]
readListPrec :: ReadPrec [Size n a]
$creadListPrec :: forall (n :: Nat) a. Read a => ReadPrec [Size n a]
readPrec :: ReadPrec (Size n a)
$creadPrec :: forall (n :: Nat) a. Read a => ReadPrec (Size n a)
readList :: ReadS [Size n a]
$creadList :: forall (n :: Nat) a. Read a => ReadS [Size n a]
readsPrec :: Int -> ReadS (Size n a)
$creadsPrec :: forall (n :: Nat) a. Read a => Int -> ReadS (Size n a)
Read, Int -> Size n a -> ShowS
[Size n a] -> ShowS
Size n a -> String
(Int -> Size n a -> ShowS)
-> (Size n a -> String) -> ([Size n a] -> ShowS) -> Show (Size n a)
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall (n :: Nat) a. Show a => Int -> Size n a -> ShowS
forall (n :: Nat) a. Show a => [Size n a] -> ShowS
forall (n :: Nat) a. Show a => Size n a -> String
showList :: [Size n a] -> ShowS
$cshowList :: forall (n :: Nat) a. Show a => [Size n a] -> ShowS
show :: Size n a -> String
$cshow :: forall (n :: Nat) a. Show a => Size n a -> String
showsPrec :: Int -> Size n a -> ShowS
$cshowsPrec :: forall (n :: Nat) a. Show a => Int -> Size n a -> ShowS
Show) via a

instance (Arbitrary a, KnownNat n) => Arbitrary (Size n a) where
    arbitrary :: Gen (Size n a)
arbitrary = a -> Size n a
forall (n :: Nat) a. a -> Size n a
Size (a -> Size n a) -> Gen a -> Gen (Size n a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Int -> Gen a -> Gen a
forall a. Int -> Gen a -> Gen a
resize (Integer -> Int
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Integer -> Int) -> Integer -> Int
forall a b. (a -> b) -> a -> b
$ Proxy n -> Integer
forall (n :: Nat) (proxy :: Nat -> *).
KnownNat n =>
proxy n -> Integer
natVal (Proxy n -> Integer) -> Proxy n -> Integer
forall a b. (a -> b) -> a -> b
$ Proxy n
forall k (t :: k). Proxy t
Proxy @n) Gen a
forall a. Arbitrary a => Gen a
arbitrary
    shrink :: Size n a -> [Size n a]
shrink = (a -> Size n a)
-> (Size n a -> a) -> (a -> [a]) -> Size n a -> [Size n a]
forall a b. (a -> b) -> (b -> a) -> (a -> [a]) -> b -> [b]
shrinkMapBy a -> Size n a
forall (n :: Nat) a. a -> Size n a
Size Size n a -> a
forall (n :: Nat) a. Size n a -> a
unSize a -> [a]
forall a. Arbitrary a => a -> [a]
shrink