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

module PGIP.GraphQL.Result.Reasoner where

import Data.Data

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