Safe Haskell  None 

Language  Haskell2010 
This module provides simple command line argument processing.
The main function of interest is cmdArgs
.
A simple example is:
data Sample = Sample {hello :: String} deriving (Show, Data, Typeable)
sample = Sample{hello =def
&=
help
"World argument"&=
opt
"world"}&=
summary
"Sample v1"
main = print =<< cmdArgs
sample
Attributes are used to control a number of behaviours:
 The help message:
help
,typ
,details
,summary
,program
,groupname
 Flag behaviour:
opt
,enum
,verbosity
,ignore
 Flag name assignment:
name
,explicit
 Controlling nonflag arguments:
args
,argPos
 multimode programs:
modes
,auto
Supported Types: Each field in the record must be one of the supported
atomic types (String
, Int
, Integer
, Float
, Double
, Bool
, an
enumeration, a tuple of atomic types) or a list ([]
) or Maybe
wrapping
at atomic type.
Missing Fields: If a field is shared by multiple modes, it may be omitted in subsequent modes, and will default to the previous value.
Purity: Values created with annotations are not pure  the first time they are computed they will include the annotations, but subsequently they will not. If you wish to run the above example in a more robust way:
sample = cmdArgsMode
$ Sample{hello = ...  as before
main = print =<< cmdArgsRun
sample
Even using this scheme, sometimes GHC's optimisations may share values who
have the same annotation. To disable sharing you may need to specify
{# OPTIONS_GHC fnocse #}
in the module you define the flags.
Pure annotations: Alternatively, you may use pure annotations, which are referentially transparent, but less type safe and more verbose. The initial example may be written as:
sample =
record
Sample{} [hello := def
+=
help
"World argument" +=
opt
"world"]
+=
summary
"Sample v1"
main = print =<< (cmdArgs_ sample :: IO Sample)
All the examples are written using impure annotations. To convert to pure annotations follow the rules:
Ctor {field1 = value1 &= ann1, field2 = value2} &= ann2 ==> record Ctor{} [field1 := value1 += ann1, field2 := value2] += ann2 Ctor (value1 &= ann1) value2 &= ann2 ==> record Ctor{} [atom value1 += ann1, atom value2] += ann2 modes [Ctor1{...}, Ctor2{...}] ==> modes_ [record Ctor1{} [...], record Ctor2{} [...]] Ctor {field1 = enum [X &= ann, Y]} ==> record Ctor{} [enum_ field1 [atom X += ann, atom Y]]
If you are willing to use TemplateHaskell, you can write in the impure syntax, but have your code automatically translated to the pure style. For more details see System.Console.CmdArgs.Quote.
Synopsis
 cmdArgs :: Data a => a > IO a
 cmdArgsMode :: Data a => a > Mode (CmdArgs a)
 cmdArgsRun :: Mode (CmdArgs a) > IO a
 cmdArgs_ :: Data a => Annotate Ann > IO a
 cmdArgsMode_ :: Data a => Annotate Ann > Mode (CmdArgs a)
 cmdArgsApply :: CmdArgs a > IO a
 data CmdArgs a = CmdArgs {
 cmdArgsValue :: a
 cmdArgsHelp :: Maybe String
 cmdArgsVersion :: Maybe String
 cmdArgsVerbosity :: Maybe Verbosity
 cmdArgsPrivate :: CmdArgsPrivate
 opt :: (Show a, Typeable a) => a > Ann
 typ :: String > Ann
 typFile :: Ann
 typDir :: Ann
 help :: String > Ann
 name :: String > Ann
 args :: Ann
 argPos :: Int > Ann
 groupname :: String > Ann
 details :: [String] > Ann
 summary :: String > Ann
 auto :: Ann
 program :: String > Ann
 explicit :: Ann
 ignore :: Ann
 verbosity :: Ann
 helpArg :: [Ann] > Ann
 versionArg :: [Ann] > Ann
 verbosityArgs :: [Ann] > [Ann] > Ann
 noAtExpand :: Ann
 (&=) :: Data val => val > Ann > val
 modes :: Data val => [val] > val
 enum :: Data val => [val] > val
 (+=) :: Annotate ann > ann > Annotate ann
 record :: Data a => a > [Annotate ann] > Annotate ann
 atom :: Data val => val > Annotate ann
 data Annotate ann = (Data c, Data f) => (c > f) := f
 enum_ :: (Data c, Data f) => (c > f) > [Annotate Ann] > Annotate Ann
 modes_ :: [Annotate Ann] > Annotate Ann
 module System.Console.CmdArgs.Verbosity
 module System.Console.CmdArgs.Default
 data Ann
 data Mode a
 class Typeable a => Data a
 class Typeable (a :: k)
Running command lines
cmdArgs :: Data a => a > IO a #
Take impurely annotated records and run the corresponding command line.
Shortcut for
.cmdArgsRun
. cmdArgsMode
To use cmdArgs
with custom command line arguments see
withArgs
.
cmdArgsMode :: Data a => a > Mode (CmdArgs a) #
Take impurely annotated records and turn them in to a Mode
value, that can
make use of the System.Console.CmdArgs.Explicit functions (i.e. process
).
Annotated records are impure, and will only contain annotations on their first use. The result of this function is pure, and can be reused.
cmdArgsRun :: Mode (CmdArgs a) > IO a #
Run a Mode structure. This function reads the command line arguments and then performs as follows:
 If invalid arguments are given, it will display the error message and exit.
 If
help
is given, it will display the help message and exit.  If
version
is given, it will display the version and exit.  In all other circumstances the program will return a value.
 Additionally, if either
quiet
orverbose
is given (seeverbosity
) it will set the verbosity (seesetVerbosity
).
cmdArgs_ :: Data a => Annotate Ann > IO a #
Take purely annotated records and run the corresponding command line.
Shortcut for
.cmdArgsRun
. cmdArgsMode_
To use cmdArgs_
with custom command line arguments see
withArgs
.
cmdArgsMode_ :: Data a => Annotate Ann > Mode (CmdArgs a) #
Take purely annotated records and turn them in to a Mode
value, that can
make use of the System.Console.CmdArgs.Explicit functions (i.e. process
).
cmdArgsApply :: CmdArgs a > IO a #
Perform the necessary actions dictated by a CmdArgs
structure.
 If
cmdArgsHelp
isJust
, it will display the help message and exit.  If
cmdArgsVersion
isJust
, it will display the version and exit.  In all other circumstances it will return a value.
 Additionally, if
cmdArgsVerbosity
isJust
(seeverbosity
) it will set the verbosity (seesetVerbosity
).
A structure to store the additional data relating to help
,
version
, quiet
and verbose
.
CmdArgs  

Instances
Functor CmdArgs #  
Eq a => Eq (CmdArgs a) #  
Data a => Data (CmdArgs a) #  
Defined in System.Console.CmdArgs.Implicit.Type gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > CmdArgs a > c (CmdArgs a) # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c (CmdArgs a) # toConstr :: CmdArgs a > Constr # dataTypeOf :: CmdArgs a > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c (CmdArgs a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c (CmdArgs a)) # gmapT :: (forall b. Data b => b > b) > CmdArgs a > CmdArgs a # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > CmdArgs a > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > CmdArgs a > r # gmapQ :: (forall d. Data d => d > u) > CmdArgs a > [u] # gmapQi :: Int > (forall d. Data d => d > u) > CmdArgs a > u # gmapM :: Monad m => (forall d. Data d => d > m d) > CmdArgs a > m (CmdArgs a) # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > CmdArgs a > m (CmdArgs a) # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > CmdArgs a > m (CmdArgs a) #  
Ord a => Ord (CmdArgs a) #  
Defined in System.Console.CmdArgs.Implicit.Type  
Show a => Show (CmdArgs a) #  
Constructing command lines
Attributes can work on a flag (inside a field), on a mode (outside the record),
or on all modes (outside the modes
call).
opt :: (Show a, Typeable a) => a > Ann #
Flag: "I want users to be able to omit the value associated with this flag."
Make the value of a flag optional. If flag
is given, it will
be treated as flag=this_argument
.
{hello = def &= opt "foo"} h hello[=VALUE] (default=foo)
Note that all flags in CmdArgs are optional, and if omitted will use their default value.
Those annotated with opt
also allow the flag to be present without an associated value.
As an example:
{hello = "DEFAULT" &= opt "OPTIONAL"}
$ main {hello = "DEFAULT"} $ main hello {hello = "OPTIONAL"} $ main hello=VALUE {hello = "VALUE"}
Flag/Mode: "The help message is ..."
Descriptive text used in the help output.
{hello = def &= help "Help message"} h hello=VALUE Help message
Flag: "Use this flag name for this field."
Add flags which trigger this option.
{hello = def &= name "foo"} h hello foo=VALUE
Flag: "Put the nth nonflag argument here."
This field should be used to store a particular argument position (0based).
{hello = def &= argPos 0}
Flag/Mode: "Give these flags/modes a group name in the help output."
This mode will be used for all following modes/flags, until the
next groupname
.
{hello = def &= groupname "Welcomes"} Welcomes h hello=VALUE
Mode: "A longer description of this mode is ..."
Suffix to be added to the help message.
Sample{..} &= details ["More details on the website www.example.org"]
Modes: "My program name/version/copyright is ..."
One line summary of the entire program, the first line of
help
and the only line of version
. If the string contains a
version number component will also provide numericversion
.
Sample{..} &= summary "CmdArgs v0.0, (C) Neil Mitchell 1981"
Mode: "If the user doesn't give a mode, use this one."
This mode is the default. If no mode is specified and a mode has this attribute then that mode is selected, otherwise an error is raised.
modes [Mode1{..}, Mode2{..} &= auto, Mode3{..}]
Modes: "My program executable is named ..."
This is the name of the program executable. Only used in the help message. Defaults to the type of the mode.
Sample{..} &= program "sample"
Flag: "Don't guess any names for this field."
A field should not have any flag names guessed for it.
All flag names must be specified by flag
.
{hello = def &= explicit &= name "foo"} foo=VALUE
Flag/Mode: "Ignore this field, don't let the user set it."
A mode or field is not dealt with by CmdArgs.
{hello = def, extra = def &= ignore} hello=VALUE
versionArg :: [Ann] > Ann #
verbosityArgs :: [Ann] > [Ann] > Ann #
noAtExpand :: Ann #
Program: "Turn off @ expansion."
Usually arguments starting with @ are treated as a file containing a set of arguments. This annotation turns off that behaviour.
Sample{..} &= noAtExpand
Impure
(&=) :: Data val => val > Ann > val #
Add an annotation to a value. Note that if the value is evaluated more than once the annotation will only be available the first time.
modes :: Data val => [val] > val #
Modes: "I want a program with multiple modes, like darcs or cabal."
Takes a list of modes, and creates a mode which includes them all.
If you want one of the modes to be chosen by default, see auto
.
data Modes = Mode1  Mode2  Mode3 deriving Data cmdArgs $ modes [Mode1,Mode2,Mode3]
enum :: Data val => [val] > val #
Flag: "I want several different flags to set this one field to different values."
This annotation takes a type which is an enumeration, and provides multiple separate flags to set the field to each value. The first element in the list is used as the value of the field.
data State = On  Off deriving Data data Mode = Mode {state :: State} cmdArgs $ Mode {state = enum [On &= help "Turn on",Off &= help "Turn off"]} on Turn on off Turn off
This annotation can be used to allow multiple flags within a field:
data Mode = Mode {state :: [State]} cmdArgs $ Mode {state = enum [[] &= ignore, [On] &= help "Turn on", [Off] &= help "Turn off"]}
Now on off
would produce Mode [On,Off]
.
Pure
record :: Data a => a > [Annotate ann] > Annotate ann #
Create a constructor/record. The first argument should be
the type of field, the second should be a list of fields constructed
originally defined by :=
or :=+
.
This operation is not type safe, and may raise an exception at runtime if any field has the wrong type or label.
This type represents an annotated value. The type of the underlying value is not specified.
enum_ :: (Data c, Data f) => (c > f) > [Annotate Ann] > Annotate Ann #
Like enum
, but using the pure annotations.
Reexported for convenience
Provides a few opaque types (for writing type signatures),
verbosity control, default values with def
and the
Data
/Typeable
type classes.
The general type of annotations that can be associated with a value.
Instances
Eq Ann #  
Data Ann #  
Defined in System.Console.CmdArgs.Implicit.Ann gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Ann > c Ann # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Ann # dataTypeOf :: Ann > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Ann) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Ann) # gmapT :: (forall b. Data b => b > b) > Ann > Ann # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Ann > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Ann > r # gmapQ :: (forall d. Data d => d > u) > Ann > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Ann > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Ann > m Ann # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Ann > m Ann # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Ann > m Ann #  
Ord Ann #  
Show Ann #  
A mode. Do not use the Mode
constructor directly, instead
use mode
to construct the Mode
and then record updates.
Each mode has three main features:
 A list of submodes (
modeGroupModes
)  A list of flags (
modeGroupFlags
)  Optionally an unnamed argument (
modeArgs
)
To produce the help information for a mode, either use helpText
or show
.
The Data
class comprehends a fundamental primitive gfoldl
for
folding over constructor applications, say terms. This primitive can
be instantiated in several ways to map over the immediate subterms
of a term; see the gmap
combinators later in this class. Indeed, a
generic programmer does not necessarily need to use the ingenious gfoldl
primitive but rather the intuitive gmap
combinators. The gfoldl
primitive is completed by means to query toplevel constructors, to
turn constructor representations into proper terms, and to list all
possible datatype constructors. This completion allows us to serve
generic programming scenarios like read, show, equality, term generation.
The combinators gmapT
, gmapQ
, gmapM
, etc are all provided with
default definitions in terms of gfoldl
, leaving open the opportunity
to provide datatypespecific definitions.
(The inclusion of the gmap
combinators as members of class Data
allows the programmer or the compiler to derive specialised, and maybe
more efficient code per datatype. Note: gfoldl
is more higherorder
than the gmap
combinators. This is subject to ongoing benchmarking
experiments. It might turn out that the gmap
combinators will be
moved out of the class Data
.)
Conceptually, the definition of the gmap
combinators in terms of the
primitive gfoldl
requires the identification of the gfoldl
function
arguments. Technically, we also need to identify the type constructor
c
for the construction of the result type from the folded term type.
In the definition of gmapQ
x combinators, we use phantom type
constructors for the c
in the type of gfoldl
because the result type
of a query does not involve the (polymorphic) type of the term argument.
In the definition of gmapQl
we simply use the plain constant type
constructor because gfoldl
is leftassociative anyway and so it is
readily suited to fold a leftassociative binary operation over the
immediate subterms. In the definition of gmapQr, extra effort is
needed. We use a higherorder accumulation trick to mediate between
leftassociative constructor application vs. rightassociative binary
operation (e.g., (:)
). When the query is meant to compute a value
of type r
, then the result type withing generic folding is r > r
.
So the result of folding is a function to which we finally pass the
right unit.
With the XDeriveDataTypeable
option, GHC can generate instances of the
Data
class automatically. For example, given the declaration
data T a b = C1 a b  C2 deriving (Typeable, Data)
GHC will generate an instance that is equivalent to
instance (Data a, Data b) => Data (T a b) where gfoldl k z (C1 a b) = z C1 `k` a `k` b gfoldl k z C2 = z C2 gunfold k z c = case constrIndex c of 1 > k (k (z C1)) 2 > z C2 toConstr (C1 _ _) = con_C1 toConstr C2 = con_C2 dataTypeOf _ = ty_T con_C1 = mkConstr ty_T "C1" [] Prefix con_C2 = mkConstr ty_T "C2" [] Prefix ty_T = mkDataType "Module.T" [con_C1, con_C2]
This is suitable for datatypes that are exported transparently.
Instances
Data Bool  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Bool > c Bool # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Bool # dataTypeOf :: Bool > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Bool) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Bool) # gmapT :: (forall b. Data b => b > b) > Bool > Bool # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Bool > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Bool > r # gmapQ :: (forall d. Data d => d > u) > Bool > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Bool > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Bool > m Bool # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Bool > m Bool # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Bool > m Bool #  
Data Char  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Char > c Char # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Char # dataTypeOf :: Char > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Char) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Char) # gmapT :: (forall b. Data b => b > b) > Char > Char # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Char > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Char > r # gmapQ :: (forall d. Data d => d > u) > Char > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Char > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Char > m Char # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Char > m Char # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Char > m Char #  
Data Double  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Double > c Double # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Double # toConstr :: Double > Constr # dataTypeOf :: Double > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Double) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Double) # gmapT :: (forall b. Data b => b > b) > Double > Double # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Double > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Double > r # gmapQ :: (forall d. Data d => d > u) > Double > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Double > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Double > m Double # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Double > m Double # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Double > m Double #  
Data Float  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Float > c Float # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Float # dataTypeOf :: Float > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Float) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Float) # gmapT :: (forall b. Data b => b > b) > Float > Float # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Float > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Float > r # gmapQ :: (forall d. Data d => d > u) > Float > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Float > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Float > m Float # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Float > m Float # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Float > m Float #  
Data Int  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Int > c Int # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Int # dataTypeOf :: Int > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Int) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Int) # gmapT :: (forall b. Data b => b > b) > Int > Int # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Int > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Int > r # gmapQ :: (forall d. Data d => d > u) > Int > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Int > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Int > m Int # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Int > m Int # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Int > m Int #  
Data Int8  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Int8 > c Int8 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Int8 # dataTypeOf :: Int8 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Int8) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Int8) # gmapT :: (forall b. Data b => b > b) > Int8 > Int8 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Int8 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Int8 > r # gmapQ :: (forall d. Data d => d > u) > Int8 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Int8 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Int8 > m Int8 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Int8 > m Int8 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Int8 > m Int8 #  
Data Int16  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Int16 > c Int16 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Int16 # dataTypeOf :: Int16 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Int16) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Int16) # gmapT :: (forall b. Data b => b > b) > Int16 > Int16 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Int16 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Int16 > r # gmapQ :: (forall d. Data d => d > u) > Int16 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Int16 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Int16 > m Int16 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Int16 > m Int16 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Int16 > m Int16 #  
Data Int32  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Int32 > c Int32 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Int32 # dataTypeOf :: Int32 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Int32) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Int32) # gmapT :: (forall b. Data b => b > b) > Int32 > Int32 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Int32 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Int32 > r # gmapQ :: (forall d. Data d => d > u) > Int32 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Int32 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Int32 > m Int32 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Int32 > m Int32 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Int32 > m Int32 #  
Data Int64  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Int64 > c Int64 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Int64 # dataTypeOf :: Int64 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Int64) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Int64) # gmapT :: (forall b. Data b => b > b) > Int64 > Int64 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Int64 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Int64 > r # gmapQ :: (forall d. Data d => d > u) > Int64 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Int64 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Int64 > m Int64 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Int64 > m Int64 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Int64 > m Int64 #  
Data Integer  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Integer > c Integer # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Integer # toConstr :: Integer > Constr # dataTypeOf :: Integer > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Integer) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Integer) # gmapT :: (forall b. Data b => b > b) > Integer > Integer # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Integer > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Integer > r # gmapQ :: (forall d. Data d => d > u) > Integer > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Integer > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Integer > m Integer # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Integer > m Integer # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Integer > m Integer #  
Data Natural  Since: base4.8.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Natural > c Natural # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Natural # toConstr :: Natural > Constr # dataTypeOf :: Natural > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Natural) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Natural) # gmapT :: (forall b. Data b => b > b) > Natural > Natural # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Natural > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Natural > r # gmapQ :: (forall d. Data d => d > u) > Natural > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Natural > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Natural > m Natural # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Natural > m Natural # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Natural > m Natural #  
Data Ordering  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Ordering > c Ordering # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Ordering # toConstr :: Ordering > Constr # dataTypeOf :: Ordering > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Ordering) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Ordering) # gmapT :: (forall b. Data b => b > b) > Ordering > Ordering # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Ordering > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Ordering > r # gmapQ :: (forall d. Data d => d > u) > Ordering > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Ordering > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Ordering > m Ordering # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Ordering > m Ordering # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Ordering > m Ordering #  
Data Word  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Word > c Word # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Word # dataTypeOf :: Word > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Word) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Word) # gmapT :: (forall b. Data b => b > b) > Word > Word # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Word > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Word > r # gmapQ :: (forall d. Data d => d > u) > Word > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Word > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Word > m Word # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Word > m Word # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Word > m Word #  
Data Word8  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Word8 > c Word8 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Word8 # dataTypeOf :: Word8 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Word8) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Word8) # gmapT :: (forall b. Data b => b > b) > Word8 > Word8 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Word8 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Word8 > r # gmapQ :: (forall d. Data d => d > u) > Word8 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Word8 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Word8 > m Word8 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Word8 > m Word8 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Word8 > m Word8 #  
Data Word16  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Word16 > c Word16 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Word16 # toConstr :: Word16 > Constr # dataTypeOf :: Word16 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Word16) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Word16) # gmapT :: (forall b. Data b => b > b) > Word16 > Word16 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Word16 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Word16 > r # gmapQ :: (forall d. Data d => d > u) > Word16 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Word16 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Word16 > m Word16 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Word16 > m Word16 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Word16 > m Word16 #  
Data Word32  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Word32 > c Word32 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Word32 # toConstr :: Word32 > Constr # dataTypeOf :: Word32 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Word32) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Word32) # gmapT :: (forall b. Data b => b > b) > Word32 > Word32 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Word32 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Word32 > r # gmapQ :: (forall d. Data d => d > u) > Word32 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Word32 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Word32 > m Word32 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Word32 > m Word32 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Word32 > m Word32 #  
Data Word64  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Word64 > c Word64 # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Word64 # toConstr :: Word64 > Constr # dataTypeOf :: Word64 > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Word64) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Word64) # gmapT :: (forall b. Data b => b > b) > Word64 > Word64 # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Word64 > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Word64 > r # gmapQ :: (forall d. Data d => d > u) > Word64 > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Word64 > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Word64 > m Word64 # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Word64 > m Word64 # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Word64 > m Word64 #  
Data Exp  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Exp > c Exp # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Exp # dataTypeOf :: Exp > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Exp) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Exp) # gmapT :: (forall b. Data b => b > b) > Exp > Exp # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Exp > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Exp > r # gmapQ :: (forall d. Data d => d > u) > Exp > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Exp > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Exp > m Exp # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Exp > m Exp # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Exp > m Exp #  
Data Match  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Match > c Match # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Match # dataTypeOf :: Match > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Match) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Match) # gmapT :: (forall b. Data b => b > b) > Match > Match # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Match > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Match > r # gmapQ :: (forall d. Data d => d > u) > Match > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Match > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Match > m Match # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Match > m Match # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Match > m Match #  
Data Clause  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Clause > c Clause # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Clause # toConstr :: Clause > Constr # dataTypeOf :: Clause > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Clause) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Clause) # gmapT :: (forall b. Data b => b > b) > Clause > Clause # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Clause > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Clause > r # gmapQ :: (forall d. Data d => d > u) > Clause > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Clause > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Clause > m Clause # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Clause > m Clause # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Clause > m Clause #  
Data Pat  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Pat > c Pat # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Pat # dataTypeOf :: Pat > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Pat) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Pat) # gmapT :: (forall b. Data b => b > b) > Pat > Pat # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Pat > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Pat > r # gmapQ :: (forall d. Data d => d > u) > Pat > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Pat > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Pat > m Pat # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Pat > m Pat # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Pat > m Pat #  
Data Type  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Type > c Type # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Type # dataTypeOf :: Type > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Type) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Type) # gmapT :: (forall b. Data b => b > b) > Type > Type # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Type > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Type > r # gmapQ :: (forall d. Data d => d > u) > Type > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Type > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Type > m Type # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Type > m Type # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Type > m Type #  
Data Dec  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Dec > c Dec # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Dec # dataTypeOf :: Dec > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Dec) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Dec) # gmapT :: (forall b. Data b => b > b) > Dec > Dec # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Dec > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Dec > r # gmapQ :: (forall d. Data d => d > u) > Dec > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Dec > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Dec > m Dec # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Dec > m Dec # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Dec > m Dec #  
Data Name  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Name > c Name # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Name # dataTypeOf :: Name > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Name) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Name) # gmapT :: (forall b. Data b => b > b) > Name > Name # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Name > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Name > r # gmapQ :: (forall d. Data d => d > u) > Name > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Name > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Name > m Name # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Name > m Name # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Name > m Name #  
Data FunDep  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > FunDep > c FunDep # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c FunDep # toConstr :: FunDep > Constr # dataTypeOf :: FunDep > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c FunDep) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c FunDep) # gmapT :: (forall b. Data b => b > b) > FunDep > FunDep # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > FunDep > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > FunDep > r # gmapQ :: (forall d. Data d => d > u) > FunDep > [u] # gmapQi :: Int > (forall d. Data d => d > u) > FunDep > u # gmapM :: Monad m => (forall d. Data d => d > m d) > FunDep > m FunDep # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > FunDep > m FunDep # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > FunDep > m FunDep #  
Data InjectivityAnn  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > InjectivityAnn > c InjectivityAnn # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c InjectivityAnn # toConstr :: InjectivityAnn > Constr # dataTypeOf :: InjectivityAnn > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c InjectivityAnn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c InjectivityAnn) # gmapT :: (forall b. Data b => b > b) > InjectivityAnn > InjectivityAnn # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > InjectivityAnn > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > InjectivityAnn > r # gmapQ :: (forall d. Data d => d > u) > InjectivityAnn > [u] # gmapQi :: Int > (forall d. Data d => d > u) > InjectivityAnn > u # gmapM :: Monad m => (forall d. Data d => d > m d) > InjectivityAnn > m InjectivityAnn # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > InjectivityAnn > m InjectivityAnn # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > InjectivityAnn > m InjectivityAnn #  
Data Overlap  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Overlap > c Overlap # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Overlap # toConstr :: Overlap > Constr # dataTypeOf :: Overlap > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Overlap) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Overlap) # gmapT :: (forall b. Data b => b > b) > Overlap > Overlap # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Overlap > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Overlap > r # gmapQ :: (forall d. Data d => d > u) > Overlap > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Overlap > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Overlap > m Overlap # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Overlap > m Overlap # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Overlap > m Overlap #  
Data ()  Since: base4.0.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > () > c () # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c () # dataTypeOf :: () > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c ()) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c ()) # gmapT :: (forall b. Data b => b > b) > () > () # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > () > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > () > r # gmapQ :: (forall d. Data d => d > u) > () > [u] # gmapQi :: Int > (forall d. Data d => d > u) > () > u # gmapM :: Monad m => (forall d. Data d => d > m d) > () > m () # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > () > m () # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > () > m () #  
Data Version  Since: base4.7.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Version > c Version # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Version # toConstr :: Version > Constr # dataTypeOf :: Version > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Version) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Version) # gmapT :: (forall b. Data b => b > b) > Version > Version # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Version > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Version > r # gmapQ :: (forall d. Data d => d > u) > Version > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Version > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Version > m Version # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Version > m Version # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Version > m Version #  
Data All  Since: base4.8.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > All > c All # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c All # dataTypeOf :: All > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c All) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c All) # gmapT :: (forall b. Data b => b > b) > All > All # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > All > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > All > r # gmapQ :: (forall d. Data d => d > u) > All > [u] # gmapQi :: Int > (forall d. Data d => d > u) > All > u # gmapM :: Monad m => (forall d. Data d => d > m d) > All > m All # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > All > m All # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > All > m All #  
Data Any  Since: base4.8.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Any > c Any # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Any # dataTypeOf :: Any > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Any) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Any) # gmapT :: (forall b. Data b => b > b) > Any > Any # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Any > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Any > r # gmapQ :: (forall d. Data d => d > u) > Any > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Any > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Any > m Any # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Any > m Any # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Any > m Any #  
Data Fixity  Since: base4.9.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Fixity > c Fixity # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Fixity # toConstr :: Fixity > Constr # dataTypeOf :: Fixity > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Fixity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Fixity) # gmapT :: (forall b. Data b => b > b) > Fixity > Fixity # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Fixity > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Fixity > r # gmapQ :: (forall d. Data d => d > u) > Fixity > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Fixity > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Fixity > m Fixity # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Fixity > m Fixity # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Fixity > m Fixity #  
Data Associativity  Since: base4.9.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Associativity > c Associativity # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Associativity # toConstr :: Associativity > Constr # dataTypeOf :: Associativity > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Associativity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Associativity) # gmapT :: (forall b. Data b => b > b) > Associativity > Associativity # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Associativity > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Associativity > r # gmapQ :: (forall d. Data d => d > u) > Associativity > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Associativity > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Associativity > m Associativity # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Associativity > m Associativity # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Associativity > m Associativity #  
Data SourceUnpackedness  Since: base4.9.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > SourceUnpackedness > c SourceUnpackedness # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c SourceUnpackedness # toConstr :: SourceUnpackedness > Constr # dataTypeOf :: SourceUnpackedness > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c SourceUnpackedness) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c SourceUnpackedness) # gmapT :: (forall b. Data b => b > b) > SourceUnpackedness > SourceUnpackedness # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > SourceUnpackedness > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > SourceUnpackedness > r # gmapQ :: (forall d. Data d => d > u) > SourceUnpackedness > [u] # gmapQi :: Int > (forall d. Data d => d > u) > SourceUnpackedness > u # gmapM :: Monad m => (forall d. Data d => d > m d) > SourceUnpackedness > m SourceUnpackedness # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > SourceUnpackedness > m SourceUnpackedness # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > SourceUnpackedness > m SourceUnpackedness #  
Data SourceStrictness  Since: base4.9.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > SourceStrictness > c SourceStrictness # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c SourceStrictness # toConstr :: SourceStrictness > Constr # dataTypeOf :: SourceStrictness > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c SourceStrictness) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c SourceStrictness) # gmapT :: (forall b. Data b => b > b) > SourceStrictness > SourceStrictness # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > SourceStrictness > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > SourceStrictness > r # gmapQ :: (forall d. Data d => d > u) > SourceStrictness > [u] # gmapQi :: Int > (forall d. Data d => d > u) > SourceStrictness > u # gmapM :: Monad m => (forall d. Data d => d > m d) > SourceStrictness > m SourceStrictness # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > SourceStrictness > m SourceStrictness # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > SourceStrictness > m SourceStrictness #  
Data DecidedStrictness  Since: base4.9.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > DecidedStrictness > c DecidedStrictness # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c DecidedStrictness # toConstr :: DecidedStrictness > Constr # dataTypeOf :: DecidedStrictness > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c DecidedStrictness) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c DecidedStrictness) # gmapT :: (forall b. Data b => b > b) > DecidedStrictness > DecidedStrictness # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > DecidedStrictness > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > DecidedStrictness > r # gmapQ :: (forall d. Data d => d > u) > DecidedStrictness > [u] # gmapQi :: Int > (forall d. Data d => d > u) > DecidedStrictness > u # gmapM :: Monad m => (forall d. Data d => d > m d) > DecidedStrictness > m DecidedStrictness # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > DecidedStrictness > m DecidedStrictness # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > DecidedStrictness > m DecidedStrictness #  
Data WordPtr  Since: base4.11.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > WordPtr > c WordPtr # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c WordPtr # toConstr :: WordPtr > Constr # dataTypeOf :: WordPtr > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c WordPtr) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c WordPtr) # gmapT :: (forall b. Data b => b > b) > WordPtr > WordPtr # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > WordPtr > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > WordPtr > r # gmapQ :: (forall d. Data d => d > u) > WordPtr > [u] # gmapQi :: Int > (forall d. Data d => d > u) > WordPtr > u # gmapM :: Monad m => (forall d. Data d => d > m d) > WordPtr > m WordPtr # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > WordPtr > m WordPtr # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > WordPtr > m WordPtr #  
Data IntPtr  Since: base4.11.0.0 
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > IntPtr > c IntPtr # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c IntPtr # toConstr :: IntPtr > Constr # dataTypeOf :: IntPtr > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c IntPtr) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c IntPtr) # gmapT :: (forall b. Data b => b > b) > IntPtr > IntPtr # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > IntPtr > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > IntPtr > r # gmapQ :: (forall d. Data d => d > u) > IntPtr > [u] # gmapQi :: Int > (forall d. Data d => d > u) > IntPtr > u # gmapM :: Monad m => (forall d. Data d => d > m d) > IntPtr > m IntPtr # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > IntPtr > m IntPtr # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > IntPtr > m IntPtr #  
Data ModName  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > ModName > c ModName # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c ModName # toConstr :: ModName > Constr # dataTypeOf :: ModName > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c ModName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c ModName) # gmapT :: (forall b. Data b => b > b) > ModName > ModName # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > ModName > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > ModName > r # gmapQ :: (forall d. Data d => d > u) > ModName > [u] # gmapQi :: Int > (forall d. Data d => d > u) > ModName > u # gmapM :: Monad m => (forall d. Data d => d > m d) > ModName > m ModName # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > ModName > m ModName # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > ModName > m ModName #  
Data PkgName  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > PkgName > c PkgName # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c PkgName # toConstr :: PkgName > Constr # dataTypeOf :: PkgName > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c PkgName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c PkgName) # gmapT :: (forall b. Data b => b > b) > PkgName > PkgName # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > PkgName > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > PkgName > r # gmapQ :: (forall d. Data d => d > u) > PkgName > [u] # gmapQi :: Int > (forall d. Data d => d > u) > PkgName > u # gmapM :: Monad m => (forall d. Data d => d > m d) > PkgName > m PkgName # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > PkgName > m PkgName # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > PkgName > m PkgName #  
Data Module  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Module > c Module # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Module # toConstr :: Module > Constr # dataTypeOf :: Module > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Module) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Module) # gmapT :: (forall b. Data b => b > b) > Module > Module # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Module > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Module > r # gmapQ :: (forall d. Data d => d > u) > Module > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Module > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Module > m Module # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Module > m Module # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Module > m Module #  
Data OccName  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > OccName > c OccName # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c OccName # toConstr :: OccName > Constr # dataTypeOf :: OccName > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c OccName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c OccName) # gmapT :: (forall b. Data b => b > b) > OccName > OccName # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > OccName > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > OccName > r # gmapQ :: (forall d. Data d => d > u) > OccName > [u] # gmapQi :: Int > (forall d. Data d => d > u) > OccName > u # gmapM :: Monad m => (forall d. Data d => d > m d) > OccName > m OccName # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > OccName > m OccName # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > OccName > m OccName #  
Data NameFlavour  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > NameFlavour > c NameFlavour # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c NameFlavour # toConstr :: NameFlavour > Constr # dataTypeOf :: NameFlavour > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c NameFlavour) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c NameFlavour) # gmapT :: (forall b. Data b => b > b) > NameFlavour > NameFlavour # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > NameFlavour > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > NameFlavour > r # gmapQ :: (forall d. Data d => d > u) > NameFlavour > [u] # gmapQi :: Int > (forall d. Data d => d > u) > NameFlavour > u # gmapM :: Monad m => (forall d. Data d => d > m d) > NameFlavour > m NameFlavour # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > NameFlavour > m NameFlavour # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > NameFlavour > m NameFlavour #  
Data NameSpace  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > NameSpace > c NameSpace # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c NameSpace # toConstr :: NameSpace > Constr # dataTypeOf :: NameSpace > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c NameSpace) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c NameSpace) # gmapT :: (forall b. Data b => b > b) > NameSpace > NameSpace # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > NameSpace > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > NameSpace > r # gmapQ :: (forall d. Data d => d > u) > NameSpace > [u] # gmapQi :: Int > (forall d. Data d => d > u) > NameSpace > u # gmapM :: Monad m => (forall d. Data d => d > m d) > NameSpace > m NameSpace # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > NameSpace > m NameSpace # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > NameSpace > m NameSpace #  
Data Loc  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Loc > c Loc # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Loc # dataTypeOf :: Loc > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Loc) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Loc) # gmapT :: (forall b. Data b => b > b) > Loc > Loc # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Loc > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Loc > r # gmapQ :: (forall d. Data d => d > u) > Loc > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Loc > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Loc > m Loc # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Loc > m Loc # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Loc > m Loc #  
Data Info  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Info > c Info # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Info # dataTypeOf :: Info > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Info) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Info) # gmapT :: (forall b. Data b => b > b) > Info > Info # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Info > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Info > r # gmapQ :: (forall d. Data d => d > u) > Info > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Info > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Info > m Info # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Info > m Info # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Info > m Info #  
Data ModuleInfo  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > ModuleInfo > c ModuleInfo # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c ModuleInfo # toConstr :: ModuleInfo > Constr # dataTypeOf :: ModuleInfo > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c ModuleInfo) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c ModuleInfo) # gmapT :: (forall b. Data b => b > b) > ModuleInfo > ModuleInfo # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > ModuleInfo > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > ModuleInfo > r # gmapQ :: (forall d. Data d => d > u) > ModuleInfo > [u] # gmapQi :: Int > (forall d. Data d => d > u) > ModuleInfo > u # gmapM :: Monad m => (forall d. Data d => d > m d) > ModuleInfo > m ModuleInfo # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > ModuleInfo > m ModuleInfo # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > ModuleInfo > m ModuleInfo #  
Data Fixity  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Fixity > c Fixity # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Fixity # toConstr :: Fixity > Constr # dataTypeOf :: Fixity > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Fixity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Fixity) # gmapT :: (forall b. Data b => b > b) > Fixity > Fixity # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Fixity > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Fixity > r # gmapQ :: (forall d. Data d => d > u) > Fixity > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Fixity > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Fixity > m Fixity # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Fixity > m Fixity # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Fixity > m Fixity #  
Data FixityDirection  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > FixityDirection > c FixityDirection # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c FixityDirection # toConstr :: FixityDirection > Constr # dataTypeOf :: FixityDirection > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c FixityDirection) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c FixityDirection) # gmapT :: (forall b. Data b => b > b) > FixityDirection > FixityDirection # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > FixityDirection > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > FixityDirection > r # gmapQ :: (forall d. Data d => d > u) > FixityDirection > [u] # gmapQi :: Int > (forall d. Data d => d > u) > FixityDirection > u # gmapM :: Monad m => (forall d. Data d => d > m d) > FixityDirection > m FixityDirection # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > FixityDirection > m FixityDirection # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > FixityDirection > m FixityDirection #  
Data Lit  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Lit > c Lit # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Lit # dataTypeOf :: Lit > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Lit) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Lit) # gmapT :: (forall b. Data b => b > b) > Lit > Lit # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Lit > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Lit > r # gmapQ :: (forall d. Data d => d > u) > Lit > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Lit > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Lit > m Lit # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Lit > m Lit # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Lit > m Lit #  
Data Body  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Body > c Body # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Body # dataTypeOf :: Body > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Body) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Body) # gmapT :: (forall b. Data b => b > b) > Body > Body # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Body > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Body > r # gmapQ :: (forall d. Data d => d > u) > Body > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Body > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Body > m Body # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Body > m Body # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Body > m Body #  
Data Guard  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Guard > c Guard # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Guard # dataTypeOf :: Guard > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Guard) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Guard) # gmapT :: (forall b. Data b => b > b) > Guard > Guard # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Guard > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Guard > r # gmapQ :: (forall d. Data d => d > u) > Guard > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Guard > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Guard > m Guard # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Guard > m Guard # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Guard > m Guard #  
Data Stmt  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Stmt > c Stmt # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Stmt # dataTypeOf :: Stmt > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Stmt) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Stmt) # gmapT :: (forall b. Data b => b > b) > Stmt > Stmt # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Stmt > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Stmt > r # gmapQ :: (forall d. Data d => d > u) > Stmt > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Stmt > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Stmt > m Stmt # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Stmt > m Stmt # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Stmt > m Stmt #  
Data Range  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Range > c Range # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Range # dataTypeOf :: Range > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Range) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Range) # gmapT :: (forall b. Data b => b > b) > Range > Range # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Range > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Range > r # gmapQ :: (forall d. Data d => d > u) > Range > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Range > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Range > m Range # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Range > m Range # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Range > m Range #  
Data DerivClause  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > DerivClause > c DerivClause # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c DerivClause # toConstr :: DerivClause > Constr # dataTypeOf :: DerivClause > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c DerivClause) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c DerivClause) # gmapT :: (forall b. Data b => b > b) > DerivClause > DerivClause # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > DerivClause > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > DerivClause > r # gmapQ :: (forall d. Data d => d > u) > DerivClause > [u] # gmapQi :: Int > (forall d. Data d => d > u) > DerivClause > u # gmapM :: Monad m => (forall d. Data d => d > m d) > DerivClause > m DerivClause # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > DerivClause > m DerivClause # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > DerivClause > m DerivClause #  
Data DerivStrategy  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > DerivStrategy > c DerivStrategy # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c DerivStrategy # toConstr :: DerivStrategy > Constr # dataTypeOf :: DerivStrategy > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c DerivStrategy) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c DerivStrategy) # gmapT :: (forall b. Data b => b > b) > DerivStrategy > DerivStrategy # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > DerivStrategy > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > DerivStrategy > r # gmapQ :: (forall d. Data d => d > u) > DerivStrategy > [u] # gmapQi :: Int > (forall d. Data d => d > u) > DerivStrategy > u # gmapM :: Monad m => (forall d. Data d => d > m d) > DerivStrategy > m DerivStrategy # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > DerivStrategy > m DerivStrategy # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > DerivStrategy > m DerivStrategy #  
Data TypeFamilyHead  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > TypeFamilyHead > c TypeFamilyHead # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c TypeFamilyHead # toConstr :: TypeFamilyHead > Constr # dataTypeOf :: TypeFamilyHead > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c TypeFamilyHead) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c TypeFamilyHead) # gmapT :: (forall b. Data b => b > b) > TypeFamilyHead > TypeFamilyHead # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > TypeFamilyHead > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > TypeFamilyHead > r # gmapQ :: (forall d. Data d => d > u) > TypeFamilyHead > [u] # gmapQi :: Int > (forall d. Data d => d > u) > TypeFamilyHead > u # gmapM :: Monad m => (forall d. Data d => d > m d) > TypeFamilyHead > m TypeFamilyHead # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > TypeFamilyHead > m TypeFamilyHead # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > TypeFamilyHead > m TypeFamilyHead #  
Data TySynEqn  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > TySynEqn > c TySynEqn # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c TySynEqn # toConstr :: TySynEqn > Constr # dataTypeOf :: TySynEqn > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c TySynEqn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c TySynEqn) # gmapT :: (forall b. Data b => b > b) > TySynEqn > TySynEqn # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > TySynEqn > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > TySynEqn > r # gmapQ :: (forall d. Data d => d > u) > TySynEqn > [u] # gmapQi :: Int > (forall d. Data d => d > u) > TySynEqn > u # gmapM :: Monad m => (forall d. Data d => d > m d) > TySynEqn > m TySynEqn # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > TySynEqn > m TySynEqn # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > TySynEqn > m TySynEqn #  
Data Foreign  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Foreign > c Foreign # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Foreign # toConstr :: Foreign > Constr # dataTypeOf :: Foreign > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Foreign) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Foreign) # gmapT :: (forall b. Data b => b > b) > Foreign > Foreign # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Foreign > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Foreign > r # gmapQ :: (forall d. Data d => d > u) > Foreign > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Foreign > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Foreign > m Foreign # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Foreign > m Foreign # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Foreign > m Foreign #  
Data Callconv  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Callconv > c Callconv # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Callconv # toConstr :: Callconv > Constr # dataTypeOf :: Callconv > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Callconv) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Callconv) # gmapT :: (forall b. Data b => b > b) > Callconv > Callconv # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Callconv > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Callconv > r # gmapQ :: (forall d. Data d => d > u) > Callconv > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Callconv > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Callconv > m Callconv # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Callconv > m Callconv # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Callconv > m Callconv #  
Data Safety  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Safety > c Safety # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Safety # toConstr :: Safety > Constr # dataTypeOf :: Safety > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Safety) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Safety) # gmapT :: (forall b. Data b => b > b) > Safety > Safety # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Safety > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Safety > r # gmapQ :: (forall d. Data d => d > u) > Safety > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Safety > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Safety > m Safety # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Safety > m Safety # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Safety > m Safety #  
Data Pragma  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Pragma > c Pragma # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Pragma # toConstr :: Pragma > Constr # dataTypeOf :: Pragma > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Pragma) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Pragma) # gmapT :: (forall b. Data b => b > b) > Pragma > Pragma # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Pragma > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Pragma > r # gmapQ :: (forall d. Data d => d > u) > Pragma > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Pragma > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Pragma > m Pragma # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Pragma > m Pragma # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Pragma > m Pragma #  
Data Inline  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Inline > c Inline # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Inline # toConstr :: Inline > Constr # dataTypeOf :: Inline > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Inline) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Inline) # gmapT :: (forall b. Data b => b > b) > Inline > Inline # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Inline > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Inline > r # gmapQ :: (forall d. Data d => d > u) > Inline > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Inline > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Inline > m Inline # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > Inline > m Inline # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > Inline > m Inline #  
Data RuleMatch  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > RuleMatch > c RuleMatch # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c RuleMatch # toConstr :: RuleMatch > Constr # dataTypeOf :: RuleMatch > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c RuleMatch) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c RuleMatch) # gmapT :: (forall b. Data b => b > b) > RuleMatch > RuleMatch # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > RuleMatch > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > RuleMatch > r # gmapQ :: (forall d. Data d => d > u) > RuleMatch > [u] # gmapQi :: Int > (forall d. Data d => d > u) > RuleMatch > u # gmapM :: Monad m => (forall d. Data d => d > m d) > RuleMatch > m RuleMatch # gmapMp :: MonadPlus m => (forall d. Data d => d > m d) > RuleMatch > m RuleMatch # gmapMo :: MonadPlus m => (forall d. Data d => d > m d) > RuleMatch > m RuleMatch #  
Data Phases  
Defined in Language.Haskell.TH.Syntax gfoldl :: (forall d b. Data d => c (d > b) > d > c b) > (forall g. g > c g) > Phases > c Phases # gunfold :: (forall b r. Data b => c (b > r) > c r) > (forall r. r > c r) > Constr > c Phases # toConstr :: Phases > Constr # dataTypeOf :: Phases > DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) > Maybe (c Phases) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) > Maybe (c Phases) # gmapT :: (forall b. Data b => b > b) > Phases > Phases # gmapQl :: (r > r' > r) > r > (forall d. Data d => d > r') > Phases > r # gmapQr :: (r' > r > r) > r > (forall d. Data d => d > r') > Phases > r # gmapQ :: (forall d. Data d => d > u) > Phases > [u] # gmapQi :: Int > (forall d. Data d => d > u) > Phases > u # gmapM :: Monad m => (forall d. Data d => d > m d) > Phases > m Phases # 