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

module PGIP.GraphQL.Result.ReasonerOutput where

import Data.Data

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