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

module PGIP.GraphQL.Result.DGraph where

import PGIP.GraphQL.Result.Library
import PGIP.GraphQL.Result.NativeDocument

import Data.Data

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