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