{-# LANGUAGE CPP, TypeFamilies, DeriveDataTypeable #-}

module PGIP.GraphQL.Result.Logic where

import Data.Data

data Logic = Logic { Logic -> String
id :: String
                   , Logic -> String
name :: String
                   } deriving (Int -> Logic -> ShowS
[Logic] -> ShowS
Logic -> String
(Int -> Logic -> ShowS)
-> (Logic -> String) -> ([Logic] -> ShowS) -> Show Logic
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Logic] -> ShowS
$cshowList :: [Logic] -> ShowS
show :: Logic -> String
$cshow :: Logic -> String
showsPrec :: Int -> Logic -> ShowS
$cshowsPrec :: Int -> Logic -> ShowS
Show, Typeable, Typeable Logic
Constr
DataType
Typeable Logic =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> Logic -> c Logic)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Logic)
-> (Logic -> Constr)
-> (Logic -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Logic))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Logic))
-> ((forall b. Data b => b -> b) -> Logic -> Logic)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r)
-> (forall u. (forall d. Data d => d -> u) -> Logic -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Logic -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Logic -> m Logic)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Logic -> m Logic)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Logic -> m Logic)
-> Data Logic
Logic -> Constr
Logic -> DataType
(forall b. Data b => b -> b) -> Logic -> Logic
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Logic -> c Logic
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Logic
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) -> Logic -> u
forall u. (forall d. Data d => d -> u) -> Logic -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Logic -> m Logic
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Logic -> m Logic
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Logic
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Logic -> c Logic
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Logic)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Logic)
$cLogic :: Constr
$tLogic :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Logic -> m Logic
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Logic -> m Logic
gmapMp :: (forall d. Data d => d -> m d) -> Logic -> m Logic
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Logic -> m Logic
gmapM :: (forall d. Data d => d -> m d) -> Logic -> m Logic
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Logic -> m Logic
gmapQi :: Int -> (forall d. Data d => d -> u) -> Logic -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Logic -> u
gmapQ :: (forall d. Data d => d -> u) -> Logic -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Logic -> [u]
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Logic -> r
gmapT :: (forall b. Data b => b -> b) -> Logic -> Logic
$cgmapT :: (forall b. Data b => b -> b) -> Logic -> Logic
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Logic)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Logic)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Logic)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Logic)
dataTypeOf :: Logic -> DataType
$cdataTypeOf :: Logic -> DataType
toConstr :: Logic -> Constr
$ctoConstr :: Logic -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Logic
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Logic
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Logic -> c Logic
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Logic -> c Logic
$cp1Data :: Typeable Logic
Data)