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

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

import Control.DeepSeq
    ( NFData )
import Data.Data
    ( Data )
import Data.Hashable
    ( Hashable (..) )
import Data.List.Extra
    ( chunksOf )
import Data.Proxy
    ( Proxy (..) )
import GHC.Generics
    ( Generic )
import GHC.TypeLits
    ( KnownNat, KnownSymbol, Nat, Symbol, natVal, symbolVal )

import qualified Data.List as L

--------------------------------------------------------------------------------
-- Chunk combinator
--------------------------------------------------------------------------------

newtype Chunk (n :: Nat) (s :: Symbol) a = Chunk { forall (n :: Nat) (s :: Symbol) a. Chunk n s a -> a
unChunk :: a }
    deriving (Chunk n s a -> DataType
Chunk n s a -> Constr
forall {n :: Nat} {s :: Symbol} {a}.
(KnownNat n, KnownSymbol s, Data a) =>
Typeable (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
Chunk n s a -> DataType
forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
Chunk n s a -> Constr
forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
(forall b. Data b => b -> b) -> Chunk n s a -> Chunk n s a
forall (n :: Nat) (s :: Symbol) a u.
(KnownNat n, KnownSymbol s, Data a) =>
Int -> (forall d. Data d => d -> u) -> Chunk n s a -> u
forall (n :: Nat) (s :: Symbol) a u.
(KnownNat n, KnownSymbol s, Data a) =>
(forall d. Data d => d -> u) -> Chunk n s a -> [u]
forall (n :: Nat) (s :: Symbol) a r r'.
(KnownNat n, KnownSymbol s, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
forall (n :: Nat) (s :: Symbol) a r r'.
(KnownNat n, KnownSymbol s, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
forall (n :: Nat) (s :: Symbol) a (m :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a (m :: * -> *).
(KnownNat n, KnownSymbol s, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Chunk n s a -> c (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a (t :: * -> *) (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Chunk n s a))
forall (n :: Nat) (s :: Symbol) a (t :: * -> * -> *) (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Chunk n s 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 (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Chunk n s a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Chunk n s a -> c (Chunk n s a)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
$cgmapMo :: forall (n :: Nat) (s :: Symbol) a (m :: * -> *).
(KnownNat n, KnownSymbol s, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
$cgmapMp :: forall (n :: Nat) (s :: Symbol) a (m :: * -> *).
(KnownNat n, KnownSymbol s, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
$cgmapM :: forall (n :: Nat) (s :: Symbol) a (m :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Chunk n s a -> m (Chunk n s a)
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Chunk n s a -> u
$cgmapQi :: forall (n :: Nat) (s :: Symbol) a u.
(KnownNat n, KnownSymbol s, Data a) =>
Int -> (forall d. Data d => d -> u) -> Chunk n s a -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Chunk n s a -> [u]
$cgmapQ :: forall (n :: Nat) (s :: Symbol) a u.
(KnownNat n, KnownSymbol s, Data a) =>
(forall d. Data d => d -> u) -> Chunk n s a -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
$cgmapQr :: forall (n :: Nat) (s :: Symbol) a r r'.
(KnownNat n, KnownSymbol s, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
$cgmapQl :: forall (n :: Nat) (s :: Symbol) a r r'.
(KnownNat n, KnownSymbol s, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Chunk n s a -> r
gmapT :: (forall b. Data b => b -> b) -> Chunk n s a -> Chunk n s a
$cgmapT :: forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
(forall b. Data b => b -> b) -> Chunk n s a -> Chunk n s a
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Chunk n s a))
$cdataCast2 :: forall (n :: Nat) (s :: Symbol) a (t :: * -> * -> *) (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Chunk n s a))
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Chunk n s a))
$cdataCast1 :: forall (n :: Nat) (s :: Symbol) a (t :: * -> *) (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Chunk n s a))
dataTypeOf :: Chunk n s a -> DataType
$cdataTypeOf :: forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
Chunk n s a -> DataType
toConstr :: Chunk n s a -> Constr
$ctoConstr :: forall (n :: Nat) (s :: Symbol) a.
(KnownNat n, KnownSymbol s, Data a) =>
Chunk n s a -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Chunk n s a)
$cgunfold :: forall (n :: Nat) (s :: Symbol) a (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Chunk n s a)
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Chunk n s a -> c (Chunk n s a)
$cgfoldl :: forall (n :: Nat) (s :: Symbol) a (c :: * -> *).
(KnownNat n, KnownSymbol s, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Chunk n s a -> c (Chunk n s a)
Data, Chunk n s a -> Chunk n s a -> Bool
forall (n :: Nat) (s :: Symbol) a.
Eq a =>
Chunk n s a -> Chunk n s a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Chunk n s a -> Chunk n s a -> Bool
$c/= :: forall (n :: Nat) (s :: Symbol) a.
Eq a =>
Chunk n s a -> Chunk n s a -> Bool
== :: Chunk n s a -> Chunk n s a -> Bool
$c== :: forall (n :: Nat) (s :: Symbol) a.
Eq a =>
Chunk n s a -> Chunk n s a -> Bool
Eq, forall (n :: Nat) (s :: Symbol) a x.
Rep (Chunk n s a) x -> Chunk n s a
forall (n :: Nat) (s :: Symbol) a x.
Chunk n s a -> Rep (Chunk n s a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall (n :: Nat) (s :: Symbol) a x.
Rep (Chunk n s a) x -> Chunk n s a
$cfrom :: forall (n :: Nat) (s :: Symbol) a x.
Chunk n s a -> Rep (Chunk n s a) x
Generic, Int -> Chunk n s a -> Int
Chunk n s a -> Int
forall {n :: Nat} {s :: Symbol} {a}. Hashable a => Eq (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a.
Hashable a =>
Int -> Chunk n s a -> Int
forall (n :: Nat) (s :: Symbol) a. Hashable a => Chunk n s a -> Int
forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
hash :: Chunk n s a -> Int
$chash :: forall (n :: Nat) (s :: Symbol) a. Hashable a => Chunk n s a -> Int
hashWithSalt :: Int -> Chunk n s a -> Int
$chashWithSalt :: forall (n :: Nat) (s :: Symbol) a.
Hashable a =>
Int -> Chunk n s a -> Int
Hashable, Chunk n s a -> ()
forall (n :: Nat) (s :: Symbol) a. NFData a => Chunk n s a -> ()
forall a. (a -> ()) -> NFData a
rnf :: Chunk n s a -> ()
$crnf :: forall (n :: Nat) (s :: Symbol) a. NFData a => Chunk n s a -> ()
NFData, Chunk n s a -> Chunk n s a -> Bool
Chunk n s a -> Chunk n s a -> Ordering
Chunk n s a -> Chunk n s a -> Chunk n s a
forall {n :: Nat} {s :: Symbol} {a}. Ord a => Eq (Chunk n s a)
forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Bool
forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Ordering
forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Chunk n s 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
min :: Chunk n s a -> Chunk n s a -> Chunk n s a
$cmin :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Chunk n s a
max :: Chunk n s a -> Chunk n s a -> Chunk n s a
$cmax :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Chunk n s a
>= :: Chunk n s a -> Chunk n s a -> Bool
$c>= :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Bool
> :: Chunk n s a -> Chunk n s a -> Bool
$c> :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Bool
<= :: Chunk n s a -> Chunk n s a -> Bool
$c<= :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Bool
< :: Chunk n s a -> Chunk n s a -> Bool
$c< :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Bool
compare :: Chunk n s a -> Chunk n s a -> Ordering
$ccompare :: forall (n :: Nat) (s :: Symbol) a.
Ord a =>
Chunk n s a -> Chunk n s a -> Ordering
Ord)

instance (KnownNat n, KnownSymbol s, Show a) => Show (Chunk n s a) where
    show :: Chunk n s a -> String
show (Chunk a
a)
        = forall a. [a] -> [[a]] -> [a]
L.intercalate (forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal (forall {k} (t :: k). Proxy t
Proxy @s))
        forall a b. (a -> b) -> a -> b
$ forall a. Partial => Int -> [a] -> [[a]]
chunksOf (forall a b. (Integral a, Num b) => a -> b
fromIntegral forall a b. (a -> b) -> a -> b
$ forall (n :: Nat) (proxy :: Nat -> *).
KnownNat n =>
proxy n -> Integer
natVal forall a b. (a -> b) -> a -> b
$ forall {k} (t :: k). Proxy t
Proxy @n)
        forall a b. (a -> b) -> a -> b
$ forall a. Show a => a -> String
show a
a