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

module PGIP.GraphQL.Result.ConservativityStatus where

import Data.Data

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