{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeApplications #-}
module Internal.Test.QuickCheck.Quid.Combinators.Prefix
where
import Control.Applicative
( many )
import Control.DeepSeq
( NFData )
import Control.Monad
( void )
import Data.Data
( Data )
import Data.Hashable
( Hashable (..) )
import Data.Proxy
( Proxy (..) )
import GHC.Generics
( Generic )
import GHC.TypeLits
( KnownSymbol, Symbol, symbolVal )
import Internal.Text.Read
( skipChar, skipString )
import Text.Read
( Read (..) )
newtype Prefix (prefix :: Symbol) a = Prefix { forall (prefix :: Symbol) a. Prefix prefix a -> a
unPrefix :: a }
deriving (Typeable (Prefix prefix a)
Typeable (Prefix prefix a) =>
(forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Prefix prefix a -> c (Prefix prefix a))
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Prefix prefix a))
-> (Prefix prefix a -> Constr)
-> (Prefix prefix a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Prefix prefix a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Prefix prefix a)))
-> ((forall b. Data b => b -> b)
-> Prefix prefix a -> Prefix prefix a)
-> (forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r)
-> (forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r)
-> (forall u.
(forall d. Data d => d -> u) -> Prefix prefix a -> [u])
-> (forall u.
Int -> (forall d. Data d => d -> u) -> Prefix prefix a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a))
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a))
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a))
-> Data (Prefix prefix a)
Prefix prefix a -> Constr
Prefix prefix a -> DataType
(forall b. Data b => b -> b) -> Prefix prefix a -> Prefix prefix 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) -> Prefix prefix a -> u
forall u. (forall d. Data d => d -> u) -> Prefix prefix a -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
Typeable (Prefix prefix a)
forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
Prefix prefix a -> Constr
forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
Prefix prefix a -> DataType
forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
(forall b. Data b => b -> b) -> Prefix prefix a -> Prefix prefix a
forall (prefix :: Symbol) a u.
(KnownSymbol prefix, Data a) =>
Int -> (forall d. Data d => d -> u) -> Prefix prefix a -> u
forall (prefix :: Symbol) a u.
(KnownSymbol prefix, Data a) =>
(forall d. Data d => d -> u) -> Prefix prefix a -> [u]
forall (prefix :: Symbol) a r r'.
(KnownSymbol prefix, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
forall (prefix :: Symbol) a r r'.
(KnownSymbol prefix, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
forall (prefix :: Symbol) a (m :: * -> *).
(KnownSymbol prefix, Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
forall (prefix :: Symbol) a (m :: * -> *).
(KnownSymbol prefix, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
forall (prefix :: Symbol) a (c :: * -> *).
(KnownSymbol prefix, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Prefix prefix a)
forall (prefix :: Symbol) a (c :: * -> *).
(KnownSymbol prefix, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Prefix prefix a -> c (Prefix prefix a)
forall (prefix :: Symbol) a (t :: * -> *) (c :: * -> *).
(KnownSymbol prefix, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Prefix prefix a))
forall (prefix :: Symbol) a (t :: * -> * -> *) (c :: * -> *).
(KnownSymbol prefix, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Prefix prefix a))
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Prefix prefix a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Prefix prefix a -> c (Prefix prefix a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Prefix prefix a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Prefix prefix a))
$cgfoldl :: forall (prefix :: Symbol) a (c :: * -> *).
(KnownSymbol prefix, Data a) =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Prefix prefix a -> c (Prefix prefix a)
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Prefix prefix a -> c (Prefix prefix a)
$cgunfold :: forall (prefix :: Symbol) a (c :: * -> *).
(KnownSymbol prefix, Data a) =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Prefix prefix a)
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Prefix prefix a)
$ctoConstr :: forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
Prefix prefix a -> Constr
toConstr :: Prefix prefix a -> Constr
$cdataTypeOf :: forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
Prefix prefix a -> DataType
dataTypeOf :: Prefix prefix a -> DataType
$cdataCast1 :: forall (prefix :: Symbol) a (t :: * -> *) (c :: * -> *).
(KnownSymbol prefix, Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Prefix prefix a))
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Prefix prefix a))
$cdataCast2 :: forall (prefix :: Symbol) a (t :: * -> * -> *) (c :: * -> *).
(KnownSymbol prefix, Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Prefix prefix a))
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Prefix prefix a))
$cgmapT :: forall (prefix :: Symbol) a.
(KnownSymbol prefix, Data a) =>
(forall b. Data b => b -> b) -> Prefix prefix a -> Prefix prefix a
gmapT :: (forall b. Data b => b -> b) -> Prefix prefix a -> Prefix prefix a
$cgmapQl :: forall (prefix :: Symbol) a r r'.
(KnownSymbol prefix, Data a) =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
$cgmapQr :: forall (prefix :: Symbol) a r r'.
(KnownSymbol prefix, Data a) =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Prefix prefix a -> r
$cgmapQ :: forall (prefix :: Symbol) a u.
(KnownSymbol prefix, Data a) =>
(forall d. Data d => d -> u) -> Prefix prefix a -> [u]
gmapQ :: forall u. (forall d. Data d => d -> u) -> Prefix prefix a -> [u]
$cgmapQi :: forall (prefix :: Symbol) a u.
(KnownSymbol prefix, Data a) =>
Int -> (forall d. Data d => d -> u) -> Prefix prefix a -> u
gmapQi :: forall u.
Int -> (forall d. Data d => d -> u) -> Prefix prefix a -> u
$cgmapM :: forall (prefix :: Symbol) a (m :: * -> *).
(KnownSymbol prefix, Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
$cgmapMp :: forall (prefix :: Symbol) a (m :: * -> *).
(KnownSymbol prefix, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
$cgmapMo :: forall (prefix :: Symbol) a (m :: * -> *).
(KnownSymbol prefix, Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Prefix prefix a -> m (Prefix prefix a)
Data, Prefix prefix a -> Prefix prefix a -> Bool
(Prefix prefix a -> Prefix prefix a -> Bool)
-> (Prefix prefix a -> Prefix prefix a -> Bool)
-> Eq (Prefix prefix a)
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall (prefix :: Symbol) a.
Eq a =>
Prefix prefix a -> Prefix prefix a -> Bool
$c== :: forall (prefix :: Symbol) a.
Eq a =>
Prefix prefix a -> Prefix prefix a -> Bool
== :: Prefix prefix a -> Prefix prefix a -> Bool
$c/= :: forall (prefix :: Symbol) a.
Eq a =>
Prefix prefix a -> Prefix prefix a -> Bool
/= :: Prefix prefix a -> Prefix prefix a -> Bool
Eq, (forall x. Prefix prefix a -> Rep (Prefix prefix a) x)
-> (forall x. Rep (Prefix prefix a) x -> Prefix prefix a)
-> Generic (Prefix prefix a)
forall x. Rep (Prefix prefix a) x -> Prefix prefix a
forall x. Prefix prefix a -> Rep (Prefix prefix a) x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall (prefix :: Symbol) a x.
Rep (Prefix prefix a) x -> Prefix prefix a
forall (prefix :: Symbol) a x.
Prefix prefix a -> Rep (Prefix prefix a) x
$cfrom :: forall (prefix :: Symbol) a x.
Prefix prefix a -> Rep (Prefix prefix a) x
from :: forall x. Prefix prefix a -> Rep (Prefix prefix a) x
$cto :: forall (prefix :: Symbol) a x.
Rep (Prefix prefix a) x -> Prefix prefix a
to :: forall x. Rep (Prefix prefix a) x -> Prefix prefix a
Generic, Eq (Prefix prefix a)
Eq (Prefix prefix a) =>
(Int -> Prefix prefix a -> Int)
-> (Prefix prefix a -> Int) -> Hashable (Prefix prefix a)
Int -> Prefix prefix a -> Int
Prefix prefix a -> Int
forall a. Eq a => (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall (prefix :: Symbol) a. Hashable a => Eq (Prefix prefix a)
forall (prefix :: Symbol) a.
Hashable a =>
Int -> Prefix prefix a -> Int
forall (prefix :: Symbol) a. Hashable a => Prefix prefix a -> Int
$chashWithSalt :: forall (prefix :: Symbol) a.
Hashable a =>
Int -> Prefix prefix a -> Int
hashWithSalt :: Int -> Prefix prefix a -> Int
$chash :: forall (prefix :: Symbol) a. Hashable a => Prefix prefix a -> Int
hash :: Prefix prefix a -> Int
Hashable, Prefix prefix a -> ()
(Prefix prefix a -> ()) -> NFData (Prefix prefix a)
forall a. (a -> ()) -> NFData a
forall (prefix :: Symbol) a. NFData a => Prefix prefix a -> ()
$crnf :: forall (prefix :: Symbol) a. NFData a => Prefix prefix a -> ()
rnf :: Prefix prefix a -> ()
NFData, Eq (Prefix prefix a)
Eq (Prefix prefix a) =>
(Prefix prefix a -> Prefix prefix a -> Ordering)
-> (Prefix prefix a -> Prefix prefix a -> Bool)
-> (Prefix prefix a -> Prefix prefix a -> Bool)
-> (Prefix prefix a -> Prefix prefix a -> Bool)
-> (Prefix prefix a -> Prefix prefix a -> Bool)
-> (Prefix prefix a -> Prefix prefix a -> Prefix prefix a)
-> (Prefix prefix a -> Prefix prefix a -> Prefix prefix a)
-> Ord (Prefix prefix a)
Prefix prefix a -> Prefix prefix a -> Bool
Prefix prefix a -> Prefix prefix a -> Ordering
Prefix prefix a -> Prefix prefix a -> Prefix prefix 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 (prefix :: Symbol) a. Ord a => Eq (Prefix prefix a)
forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Bool
forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Ordering
forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Prefix prefix a
$ccompare :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Ordering
compare :: Prefix prefix a -> Prefix prefix a -> Ordering
$c< :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Bool
< :: Prefix prefix a -> Prefix prefix a -> Bool
$c<= :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Bool
<= :: Prefix prefix a -> Prefix prefix a -> Bool
$c> :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Bool
> :: Prefix prefix a -> Prefix prefix a -> Bool
$c>= :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Bool
>= :: Prefix prefix a -> Prefix prefix a -> Bool
$cmax :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Prefix prefix a
max :: Prefix prefix a -> Prefix prefix a -> Prefix prefix a
$cmin :: forall (prefix :: Symbol) a.
Ord a =>
Prefix prefix a -> Prefix prefix a -> Prefix prefix a
min :: Prefix prefix a -> Prefix prefix a -> Prefix prefix a
Ord)
instance (KnownSymbol prefix, Read a) => Read (Prefix prefix a) where
readPrec :: ReadPrec (Prefix prefix a)
readPrec = do
ReadPrec [()] -> ReadPrec ()
forall (f :: * -> *) a. Functor f => f a -> f ()
void (ReadPrec [()] -> ReadPrec ()) -> ReadPrec [()] -> ReadPrec ()
forall a b. (a -> b) -> a -> b
$ ReadPrec () -> ReadPrec [()]
forall a. ReadPrec a -> ReadPrec [a]
forall (f :: * -> *) a. Alternative f => f a -> f [a]
many (ReadPrec () -> ReadPrec [()]) -> ReadPrec () -> ReadPrec [()]
forall a b. (a -> b) -> a -> b
$ Char -> ReadPrec ()
skipChar Char
' '
String -> ReadPrec ()
skipString (String -> ReadPrec ()) -> String -> ReadPrec ()
forall a b. (a -> b) -> a -> b
$ Proxy prefix -> String
forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal (Proxy prefix -> String) -> Proxy prefix -> String
forall a b. (a -> b) -> a -> b
$ forall {k} (t :: k). Proxy t
forall (t :: Symbol). Proxy t
Proxy @prefix
a -> Prefix prefix a
forall (prefix :: Symbol) a. a -> Prefix prefix a
Prefix (a -> Prefix prefix a) -> ReadPrec a -> ReadPrec (Prefix prefix a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall a. Read a => ReadPrec a
readPrec @a
instance (KnownSymbol prefix, Show a) => Show (Prefix prefix a) where
show :: Prefix prefix a -> String
show (Prefix a
a) = Proxy prefix -> String
forall (n :: Symbol) (proxy :: Symbol -> *).
KnownSymbol n =>
proxy n -> String
symbolVal (forall {k} (t :: k). Proxy t
forall (t :: Symbol). Proxy t
Proxy @prefix) String -> ShowS
forall a. Semigroup a => a -> a -> a
<> a -> String
forall a. Show a => a -> String
show a
a