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

module PGIP.GraphQL.Result.Conjecture where

import PGIP.GraphQL.Result.Action
import PGIP.GraphQL.Result.FileRange
import PGIP.GraphQL.Result.ReasoningAttempt
import PGIP.GraphQL.Result.Symbol

import Data.Data

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