Copyright | (c) Niklas Broberg 2004-2009 (c) The GHC Team 1997-2000 |
---|---|
License | BSD-style (see the file LICENSE.txt) |
Maintainer | Niklas Broberg, d00nibro@chalmers.se |
Stability | stable |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell98 |
Language.Haskell.Exts.Syntax
Description
A suite of datatypes describing the (semi-concrete) abstract syntax of Haskell 98 http://www.haskell.org/onlinereport/ plus registered extensions, including:
- multi-parameter type classes with functional dependencies (MultiParamTypeClasses, FunctionalDependencies)
- parameters of type class assertions are unrestricted (FlexibleContexts)
forall
types as universal and existential quantification (RankNTypes, ExistentialQuantification, etc)- pattern guards (PatternGuards)
- implicit parameters (ImplicitParameters)
- generalised algebraic data types (GADTs)
- template haskell (TemplateHaskell)
- empty data type declarations (EmptyDataDecls)
- unboxed tuples (UnboxedTuples)
- regular patterns (RegularPatterns)
- HSP-style XML expressions and patterns (XmlSyntax)
All nodes in the syntax tree are annotated with something of a user-definable data type. When parsing, this annotation will contain information about the source location that the particular node comes from.
Synopsis
- data Module l
- = Module l (Maybe (ModuleHead l)) [ModulePragma l] [ImportDecl l] [Decl l]
- | XmlPage l (ModuleName l) [ModulePragma l] (XName l) [XAttr l] (Maybe (Exp l)) [Exp l]
- | XmlHybrid l (Maybe (ModuleHead l)) [ModulePragma l] [ImportDecl l] [Decl l] (XName l) [XAttr l] (Maybe (Exp l)) [Exp l]
- data ModuleHead l = ModuleHead l (ModuleName l) (Maybe (WarningText l)) (Maybe (ExportSpecList l))
- data WarningText l
- data ExportSpecList l = ExportSpecList l [ExportSpec l]
- data ExportSpec l
- = EVar l (QName l)
- | EAbs l (Namespace l) (QName l)
- | EThingWith l (EWildcard l) (QName l) [CName l]
- | EModuleContents l (ModuleName l)
- data EWildcard l
- = NoWildcard l
- | EWildcard l Int
- data ImportDecl l = ImportDecl {
- importAnn :: l
- importModule :: ModuleName l
- importQualified :: Bool
- importSrc :: Bool
- importSafe :: Bool
- importPkg :: Maybe String
- importAs :: Maybe (ModuleName l)
- importSpecs :: Maybe (ImportSpecList l)
- data ImportSpecList l = ImportSpecList l Bool [ImportSpec l]
- data ImportSpec l
- data Assoc l
- = AssocNone l
- | AssocLeft l
- | AssocRight l
- data Namespace l
- = NoNamespace l
- | TypeNamespace l
- | PatternNamespace l
- data Decl l
- = TypeDecl l (DeclHead l) (Type l)
- | TypeFamDecl l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l))
- | ClosedTypeFamDecl l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l)) [TypeEqn l]
- | DataDecl l (DataOrNew l) (Maybe (Context l)) (DeclHead l) [QualConDecl l] [Deriving l]
- | GDataDecl l (DataOrNew l) (Maybe (Context l)) (DeclHead l) (Maybe (Kind l)) [GadtDecl l] [Deriving l]
- | DataFamDecl l (Maybe (Context l)) (DeclHead l) (Maybe (ResultSig l))
- | TypeInsDecl l (Type l) (Type l)
- | DataInsDecl l (DataOrNew l) (Type l) [QualConDecl l] [Deriving l]
- | GDataInsDecl l (DataOrNew l) (Type l) (Maybe (Kind l)) [GadtDecl l] [Deriving l]
- | ClassDecl l (Maybe (Context l)) (DeclHead l) [FunDep l] (Maybe [ClassDecl l])
- | InstDecl l (Maybe (Overlap l)) (InstRule l) (Maybe [InstDecl l])
- | DerivDecl l (Maybe (DerivStrategy l)) (Maybe (Overlap l)) (InstRule l)
- | InfixDecl l (Assoc l) (Maybe Int) [Op l]
- | DefaultDecl l [Type l]
- | SpliceDecl l (Exp l)
- | TSpliceDecl l (Exp l)
- | TypeSig l [Name l] (Type l)
- | PatSynSig l [Name l] (Maybe [TyVarBind l]) (Maybe (Context l)) (Maybe [TyVarBind l]) (Maybe (Context l)) (Type l)
- | FunBind l [Match l]
- | PatBind l (Pat l) (Rhs l) (Maybe (Binds l))
- | PatSyn l (Pat l) (Pat l) (PatternSynDirection l)
- | ForImp l (CallConv l) (Maybe (Safety l)) (Maybe String) (Name l) (Type l)
- | ForExp l (CallConv l) (Maybe String) (Name l) (Type l)
- | RulePragmaDecl l [Rule l]
- | DeprPragmaDecl l [([Name l], String)]
- | WarnPragmaDecl l [([Name l], String)]
- | InlineSig l Bool (Maybe (Activation l)) (QName l)
- | InlineConlikeSig l (Maybe (Activation l)) (QName l)
- | SpecSig l (Maybe (Activation l)) (QName l) [Type l]
- | SpecInlineSig l Bool (Maybe (Activation l)) (QName l) [Type l]
- | InstSig l (InstRule l)
- | AnnPragma l (Annotation l)
- | MinimalPragma l (Maybe (BooleanFormula l))
- | RoleAnnotDecl l (QName l) [Role l]
- | CompletePragma l [Name l] (Maybe (QName l))
- data DeclHead l
- data InstRule l
- data InstHead l
- data Binds l
- data IPBind l = IPBind l (IPName l) (Exp l)
- data PatternSynDirection l
- data InjectivityInfo l = InjectivityInfo l (Name l) [Name l]
- data ResultSig l
- data ClassDecl l
- data InstDecl l
- data Deriving l = Deriving l (Maybe (DerivStrategy l)) [InstRule l]
- data DerivStrategy l
- = DerivStock l
- | DerivAnyclass l
- | DerivNewtype l
- | DerivVia l (Type l)
- data DataOrNew l
- data ConDecl l
- data FieldDecl l = FieldDecl l [Name l] (Type l)
- data QualConDecl l = QualConDecl l (Maybe [TyVarBind l]) (Maybe (Context l)) (ConDecl l)
- data GadtDecl l = GadtDecl l (Name l) (Maybe [TyVarBind l]) (Maybe (Context l)) (Maybe [FieldDecl l]) (Type l)
- data BangType l
- = BangedTy l
- | LazyTy l
- | NoStrictAnnot l
- data Unpackedness l
- = Unpack l
- | NoUnpack l
- | NoUnpackPragma l
- data Match l
- data Rhs l
- = UnGuardedRhs l (Exp l)
- | GuardedRhss l [GuardedRhs l]
- data GuardedRhs l = GuardedRhs l [Stmt l] (Exp l)
- data Context l
- data FunDep l = FunDep l [Name l] [Name l]
- data Asst l
- data Type l
- = TyForall l (Maybe [TyVarBind l]) (Maybe (Context l)) (Type l)
- | TyStar l
- | TyFun l (Type l) (Type l)
- | TyTuple l Boxed [Type l]
- | TyUnboxedSum l [Type l]
- | TyList l (Type l)
- | TyParArray l (Type l)
- | TyApp l (Type l) (Type l)
- | TyVar l (Name l)
- | TyCon l (QName l)
- | TyParen l (Type l)
- | TyInfix l (Type l) (MaybePromotedName l) (Type l)
- | TyKind l (Type l) (Kind l)
- | TyPromoted l (Promoted l)
- | TyEquals l (Type l) (Type l)
- | TySplice l (Splice l)
- | TyBang l (BangType l) (Unpackedness l) (Type l)
- | TyWildCard l (Maybe (Name l))
- | TyQuasiQuote l String String
- data Boxed
- type Kind = Type
- data TyVarBind l
- = KindedVar l (Name l) (Kind l)
- | UnkindedVar l (Name l)
- data Promoted l
- = PromotedInteger l Integer String
- | PromotedString l String String
- | PromotedCon l Bool (QName l)
- | PromotedList l Bool [Type l]
- | PromotedTuple l [Type l]
- | PromotedUnit l
- data TypeEqn l = TypeEqn l (Type l) (Type l)
- data Exp l
- = Var l (QName l)
- | OverloadedLabel l String
- | IPVar l (IPName l)
- | Con l (QName l)
- | Lit l (Literal l)
- | InfixApp l (Exp l) (QOp l) (Exp l)
- | App l (Exp l) (Exp l)
- | NegApp l (Exp l)
- | Lambda l [Pat l] (Exp l)
- | Let l (Binds l) (Exp l)
- | If l (Exp l) (Exp l) (Exp l)
- | MultiIf l [GuardedRhs l]
- | Case l (Exp l) [Alt l]
- | Do l [Stmt l]
- | MDo l [Stmt l]
- | Tuple l Boxed [Exp l]
- | UnboxedSum l Int Int (Exp l)
- | TupleSection l Boxed [Maybe (Exp l)]
- | List l [Exp l]
- | ParArray l [Exp l]
- | Paren l (Exp l)
- | LeftSection l (Exp l) (QOp l)
- | RightSection l (QOp l) (Exp l)
- | RecConstr l (QName l) [FieldUpdate l]
- | RecUpdate l (Exp l) [FieldUpdate l]
- | EnumFrom l (Exp l)
- | EnumFromTo l (Exp l) (Exp l)
- | EnumFromThen l (Exp l) (Exp l)
- | EnumFromThenTo l (Exp l) (Exp l) (Exp l)
- | ParArrayFromTo l (Exp l) (Exp l)
- | ParArrayFromThenTo l (Exp l) (Exp l) (Exp l)
- | ListComp l (Exp l) [QualStmt l]
- | ParComp l (Exp l) [[QualStmt l]]
- | ParArrayComp l (Exp l) [[QualStmt l]]
- | ExpTypeSig l (Exp l) (Type l)
- | VarQuote l (QName l)
- | TypQuote l (QName l)
- | BracketExp l (Bracket l)
- | SpliceExp l (Splice l)
- | QuasiQuote l String String
- | TypeApp l (Type l)
- | XTag l (XName l) [XAttr l] (Maybe (Exp l)) [Exp l]
- | XETag l (XName l) [XAttr l] (Maybe (Exp l))
- | XPcdata l String
- | XExpTag l (Exp l)
- | XChildTag l [Exp l]
- | CorePragma l String (Exp l)
- | SCCPragma l String (Exp l)
- | GenPragma l String (Int, Int) (Int, Int) (Exp l)
- | Proc l (Pat l) (Exp l)
- | LeftArrApp l (Exp l) (Exp l)
- | RightArrApp l (Exp l) (Exp l)
- | LeftArrHighApp l (Exp l) (Exp l)
- | RightArrHighApp l (Exp l) (Exp l)
- | ArrOp l (Exp l)
- | LCase l [Alt l]
- data Stmt l
- data QualStmt l
- data FieldUpdate l
- = FieldUpdate l (QName l) (Exp l)
- | FieldPun l (QName l)
- | FieldWildcard l
- data Alt l = Alt l (Pat l) (Rhs l) (Maybe (Binds l))
- data XAttr l = XAttr l (XName l) (Exp l)
- data Pat l
- = PVar l (Name l)
- | PLit l (Sign l) (Literal l)
- | PNPlusK l (Name l) Integer
- | PInfixApp l (Pat l) (QName l) (Pat l)
- | PApp l (QName l) [Pat l]
- | PTuple l Boxed [Pat l]
- | PUnboxedSum l Int Int (Pat l)
- | PList l [Pat l]
- | PParen l (Pat l)
- | PRec l (QName l) [PatField l]
- | PAsPat l (Name l) (Pat l)
- | PWildCard l
- | PIrrPat l (Pat l)
- | PatTypeSig l (Pat l) (Type l)
- | PViewPat l (Exp l) (Pat l)
- | PRPat l [RPat l]
- | PXTag l (XName l) [PXAttr l] (Maybe (Pat l)) [Pat l]
- | PXETag l (XName l) [PXAttr l] (Maybe (Pat l))
- | PXPcdata l String
- | PXPatTag l (Pat l)
- | PXRPats l [RPat l]
- | PSplice l (Splice l)
- | PQuasiQuote l String String
- | PBangPat l (Pat l)
- data PatField l
- data PXAttr l = PXAttr l (XName l) (Pat l)
- data RPat l
- data RPatOp l
- data Literal l
- = Char l Char String
- | String l String String
- | Int l Integer String
- | Frac l Rational String
- | PrimInt l Integer String
- | PrimWord l Integer String
- | PrimFloat l Rational String
- | PrimDouble l Rational String
- | PrimChar l Char String
- | PrimString l String String
- data Sign l
- data ModuleName l = ModuleName l String
- data QName l
- = Qual l (ModuleName l) (Name l)
- | UnQual l (Name l)
- | Special l (SpecialCon l)
- data Name l
- data QOp l
- data Op l
- data SpecialCon l
- data CName l
- data IPName l
- data XName l
- data Role l
- = Nominal l
- | Representational l
- | Phantom l
- | RoleWildcard l
- data MaybePromotedName l
- = PromotedName l (QName l)
- | UnpromotedName l (QName l)
- data Bracket l
- = ExpBracket l (Exp l)
- | TExpBracket l (Exp l)
- | PatBracket l (Pat l)
- | TypeBracket l (Type l)
- | DeclBracket l [Decl l]
- data Splice l
- = IdSplice l String
- | TIdSplice l String
- | ParenSplice l (Exp l)
- | TParenSplice l (Exp l)
- data Safety l
- = PlayRisky l
- | PlaySafe l Bool
- | PlayInterruptible l
- data CallConv l
- data ModulePragma l
- = LanguagePragma l [Name l]
- | OptionsPragma l (Maybe Tool) String
- | AnnModulePragma l (Annotation l)
- data Tool
- data Overlap l
- = NoOverlap l
- | Overlap l
- | Overlapping l
- | Overlaps l
- | Overlappable l
- | Incoherent l
- data Rule l = Rule l String (Maybe (Activation l)) (Maybe [RuleVar l]) (Exp l) (Exp l)
- data RuleVar l
- = RuleVar l (Name l)
- | TypedRuleVar l (Name l) (Type l)
- data Activation l
- = ActiveFrom l Int
- | ActiveUntil l Int
- data Annotation l
- data BooleanFormula l
- = VarFormula l (Name l)
- | AndFormula l [BooleanFormula l]
- | OrFormula l [BooleanFormula l]
- | ParenFormula l (BooleanFormula l)
- prelude_mod :: l -> ModuleName l
- main_mod :: l -> ModuleName l
- main_name :: l -> Name l
- unit_con_name :: l -> QName l
- tuple_con_name :: l -> Boxed -> Int -> QName l
- list_con_name :: l -> QName l
- list_cons_name :: l -> QName l
- unboxed_singleton_con_name :: l -> QName l
- unit_con :: l -> Exp l
- tuple_con :: l -> Boxed -> Int -> Exp l
- unboxed_singleton_con :: l -> Exp l
- as_name :: l -> Name l
- qualified_name :: l -> Name l
- hiding_name :: l -> Name l
- minus_name :: l -> Name l
- bang_name :: l -> Name l
- dot_name :: l -> Name l
- star_name :: l -> Name l
- export_name :: l -> Name l
- safe_name :: l -> Name l
- unsafe_name :: l -> Name l
- interruptible_name :: l -> Name l
- threadsafe_name :: l -> Name l
- stdcall_name :: l -> Name l
- ccall_name :: l -> Name l
- cplusplus_name :: l -> Name l
- dotnet_name :: l -> Name l
- jvm_name :: l -> Name l
- js_name :: l -> Name l
- javascript_name :: l -> Name l
- capi_name :: l -> Name l
- forall_name :: l -> Name l
- family_name :: l -> Name l
- role_name :: l -> Name l
- hole_name :: l -> QName l
- stock_name :: l -> Name l
- anyclass_name :: l -> Name l
- via_name :: l -> Name l
- unit_tycon_name :: l -> QName l
- fun_tycon_name :: l -> QName l
- list_tycon_name :: l -> QName l
- tuple_tycon_name :: l -> Boxed -> Int -> QName l
- unboxed_singleton_tycon_name :: l -> QName l
- unit_tycon :: l -> Type l
- fun_tycon :: l -> Type l
- list_tycon :: l -> Type l
- tuple_tycon :: l -> Boxed -> Int -> Type l
- unboxed_singleton_tycon :: l -> Type l
- class Functor ast => Annotated ast where
- (=~=) :: (Annotated a, Eq (a ())) => a l1 -> a l2 -> Bool
Modules
A complete Haskell source module.
Constructors
Module l (Maybe (ModuleHead l)) [ModulePragma l] [ImportDecl l] [Decl l] | an ordinary Haskell module |
XmlPage l (ModuleName l) [ModulePragma l] (XName l) [XAttr l] (Maybe (Exp l)) [Exp l] | a module consisting of a single XML document. The ModuleName never appears in the source but is needed for semantic purposes, it will be the same as the file name. |
XmlHybrid l (Maybe (ModuleHead l)) [ModulePragma l] [ImportDecl l] [Decl l] (XName l) [XAttr l] (Maybe (Exp l)) [Exp l] | a hybrid module combining an XML document with an ordinary module |
Instances
Foldable Module # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Module m -> m foldMap :: Monoid m => (a -> m) -> Module a -> m foldMap' :: Monoid m => (a -> m) -> Module a -> m foldr :: (a -> b -> b) -> b -> Module a -> b foldr' :: (a -> b -> b) -> b -> Module a -> b foldl :: (b -> a -> b) -> b -> Module a -> b foldl' :: (b -> a -> b) -> b -> Module a -> b foldr1 :: (a -> a -> a) -> Module a -> a foldl1 :: (a -> a -> a) -> Module a -> a elem :: Eq a => a -> Module a -> Bool maximum :: Ord a => Module a -> a | |
Traversable Module # | |
Functor Module # | |
ExactP Module # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Module SrcSpanInfo -> EP () | |
AppFixity Module # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Module SrcSpanInfo -> m (Module SrcSpanInfo) # | |
Annotated Module # | |
Data l => Data (Module l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Module l -> c (Module l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Module l) toConstr :: Module l -> Constr dataTypeOf :: Module l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Module l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Module l)) gmapT :: (forall b. Data b => b -> b) -> Module l -> Module l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module l -> r gmapQ :: (forall d. Data d => d -> u) -> Module l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Module l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) | |
Generic (Module l) # | |
Show l => Show (Module l) # | |
Eq l => Eq (Module l) # | |
Ord l => Ord (Module l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Parseable (Module SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Module SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Module SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Module SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Module SrcSpanInfo) | |
Pretty (Module pos) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Module l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Module l) = D1 ('MetaData "Module" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Module" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ModuleHead l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ModulePragma l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Decl l])))) :+: (C1 ('MetaCons "XmlPage" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ModuleName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ModulePragma l]))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [XAttr l])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Exp l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l])))) :+: C1 ('MetaCons "XmlHybrid" 'PrefixI 'False) (((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ModuleHead l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ModulePragma l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportDecl l]))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Decl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [XAttr l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Exp l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l]))))))) |
data ModuleHead l #
The head of a module, including the name and export specification.
Constructors
ModuleHead l (ModuleName l) (Maybe (WarningText l)) (Maybe (ExportSpecList l)) |
Instances
Foldable ModuleHead # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleHead m -> m foldMap :: Monoid m => (a -> m) -> ModuleHead a -> m foldMap' :: Monoid m => (a -> m) -> ModuleHead a -> m foldr :: (a -> b -> b) -> b -> ModuleHead a -> b foldr' :: (a -> b -> b) -> b -> ModuleHead a -> b foldl :: (b -> a -> b) -> b -> ModuleHead a -> b foldl' :: (b -> a -> b) -> b -> ModuleHead a -> b foldr1 :: (a -> a -> a) -> ModuleHead a -> a foldl1 :: (a -> a -> a) -> ModuleHead a -> a toList :: ModuleHead a -> [a] null :: ModuleHead a -> Bool length :: ModuleHead a -> Int elem :: Eq a => a -> ModuleHead a -> Bool maximum :: Ord a => ModuleHead a -> a minimum :: Ord a => ModuleHead a -> a sum :: Num a => ModuleHead a -> a product :: Num a => ModuleHead a -> a | |
Traversable ModuleHead # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModuleHead a -> f (ModuleHead b) sequenceA :: Applicative f => ModuleHead (f a) -> f (ModuleHead a) mapM :: Monad m => (a -> m b) -> ModuleHead a -> m (ModuleHead b) sequence :: Monad m => ModuleHead (m a) -> m (ModuleHead a) | |
Functor ModuleHead # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP ModuleHead # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModuleHead SrcSpanInfo -> EP () | |
Annotated ModuleHead # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleHead l -> c (ModuleHead l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModuleHead l) toConstr :: ModuleHead l -> Constr dataTypeOf :: ModuleHead l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModuleHead l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModuleHead l)) gmapT :: (forall b. Data b => b -> b) -> ModuleHead l -> ModuleHead l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleHead l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleHead l -> r gmapQ :: (forall d. Data d => d -> u) -> ModuleHead l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleHead l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) | |
Generic (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ModuleHead l) :: Type -> Type | |
Show l => Show (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModuleHead l -> ShowS show :: ModuleHead l -> String showList :: [ModuleHead l] -> ShowS | |
Eq l => Eq (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ModuleHead l -> ModuleHead l -> Ordering (<) :: ModuleHead l -> ModuleHead l -> Bool (<=) :: ModuleHead l -> ModuleHead l -> Bool (>) :: ModuleHead l -> ModuleHead l -> Bool (>=) :: ModuleHead l -> ModuleHead l -> Bool max :: ModuleHead l -> ModuleHead l -> ModuleHead l min :: ModuleHead l -> ModuleHead l -> ModuleHead l | |
Pretty (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ModuleHead l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ModuleHead l) = D1 ('MetaData "ModuleHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ModuleHead" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ModuleName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (WarningText l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ExportSpecList l)))))) |
data WarningText l #
Warning text to optionally use in the module header of e.g. a deprecated module.
Instances
Foldable WarningText # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => WarningText m -> m foldMap :: Monoid m => (a -> m) -> WarningText a -> m foldMap' :: Monoid m => (a -> m) -> WarningText a -> m foldr :: (a -> b -> b) -> b -> WarningText a -> b foldr' :: (a -> b -> b) -> b -> WarningText a -> b foldl :: (b -> a -> b) -> b -> WarningText a -> b foldl' :: (b -> a -> b) -> b -> WarningText a -> b foldr1 :: (a -> a -> a) -> WarningText a -> a foldl1 :: (a -> a -> a) -> WarningText a -> a toList :: WarningText a -> [a] null :: WarningText a -> Bool length :: WarningText a -> Int elem :: Eq a => a -> WarningText a -> Bool maximum :: Ord a => WarningText a -> a minimum :: Ord a => WarningText a -> a sum :: Num a => WarningText a -> a product :: Num a => WarningText a -> a | |
Traversable WarningText # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> WarningText a -> f (WarningText b) sequenceA :: Applicative f => WarningText (f a) -> f (WarningText a) mapM :: Monad m => (a -> m b) -> WarningText a -> m (WarningText b) sequence :: Monad m => WarningText (m a) -> m (WarningText a) | |
Functor WarningText # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> WarningText a -> WarningText b (<$) :: a -> WarningText b -> WarningText a | |
ExactP WarningText # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: WarningText SrcSpanInfo -> EP () | |
Annotated WarningText # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WarningText l -> c (WarningText l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WarningText l) toConstr :: WarningText l -> Constr dataTypeOf :: WarningText l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WarningText l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WarningText l)) gmapT :: (forall b. Data b => b -> b) -> WarningText l -> WarningText l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WarningText l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WarningText l -> r gmapQ :: (forall d. Data d => d -> u) -> WarningText l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> WarningText l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) | |
Generic (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (WarningText l) :: Type -> Type | |
Show l => Show (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> WarningText l -> ShowS show :: WarningText l -> String showList :: [WarningText l] -> ShowS | |
Eq l => Eq (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: WarningText l -> WarningText l -> Ordering (<) :: WarningText l -> WarningText l -> Bool (<=) :: WarningText l -> WarningText l -> Bool (>) :: WarningText l -> WarningText l -> Bool (>=) :: WarningText l -> WarningText l -> Bool max :: WarningText l -> WarningText l -> WarningText l min :: WarningText l -> WarningText l -> WarningText l | |
type Rep (WarningText l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (WarningText l) = D1 ('MetaData "WarningText" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "DeprText" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "WarnText" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
data ExportSpecList l #
An explicit export specification.
Constructors
ExportSpecList l [ExportSpec l] |
Instances
Foldable ExportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpecList m -> m foldMap :: Monoid m => (a -> m) -> ExportSpecList a -> m foldMap' :: Monoid m => (a -> m) -> ExportSpecList a -> m foldr :: (a -> b -> b) -> b -> ExportSpecList a -> b foldr' :: (a -> b -> b) -> b -> ExportSpecList a -> b foldl :: (b -> a -> b) -> b -> ExportSpecList a -> b foldl' :: (b -> a -> b) -> b -> ExportSpecList a -> b foldr1 :: (a -> a -> a) -> ExportSpecList a -> a foldl1 :: (a -> a -> a) -> ExportSpecList a -> a toList :: ExportSpecList a -> [a] null :: ExportSpecList a -> Bool length :: ExportSpecList a -> Int elem :: Eq a => a -> ExportSpecList a -> Bool maximum :: Ord a => ExportSpecList a -> a minimum :: Ord a => ExportSpecList a -> a sum :: Num a => ExportSpecList a -> a product :: Num a => ExportSpecList a -> a | |
Traversable ExportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ExportSpecList a -> f (ExportSpecList b) sequenceA :: Applicative f => ExportSpecList (f a) -> f (ExportSpecList a) mapM :: Monad m => (a -> m b) -> ExportSpecList a -> m (ExportSpecList b) sequence :: Monad m => ExportSpecList (m a) -> m (ExportSpecList a) | |
Functor ExportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ExportSpecList a -> ExportSpecList b (<$) :: a -> ExportSpecList b -> ExportSpecList a | |
ExactP ExportSpecList # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ExportSpecList SrcSpanInfo -> EP () | |
Annotated ExportSpecList # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExportSpecList l -> c (ExportSpecList l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ExportSpecList l) toConstr :: ExportSpecList l -> Constr dataTypeOf :: ExportSpecList l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ExportSpecList l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ExportSpecList l)) gmapT :: (forall b. Data b => b -> b) -> ExportSpecList l -> ExportSpecList l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpecList l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpecList l -> r gmapQ :: (forall d. Data d => d -> u) -> ExportSpecList l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ExportSpecList l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) | |
Generic (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ExportSpecList l) :: Type -> Type Methods from :: ExportSpecList l -> Rep (ExportSpecList l) x to :: Rep (ExportSpecList l) x -> ExportSpecList l | |
Show l => Show (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ExportSpecList l -> ShowS show :: ExportSpecList l -> String showList :: [ExportSpecList l] -> ShowS | |
Eq l => Eq (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: ExportSpecList l -> ExportSpecList l -> Bool (/=) :: ExportSpecList l -> ExportSpecList l -> Bool | |
Ord l => Ord (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ExportSpecList l -> ExportSpecList l -> Ordering (<) :: ExportSpecList l -> ExportSpecList l -> Bool (<=) :: ExportSpecList l -> ExportSpecList l -> Bool (>) :: ExportSpecList l -> ExportSpecList l -> Bool (>=) :: ExportSpecList l -> ExportSpecList l -> Bool max :: ExportSpecList l -> ExportSpecList l -> ExportSpecList l min :: ExportSpecList l -> ExportSpecList l -> ExportSpecList l | |
Pretty (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ExportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ExportSpecList l) = D1 ('MetaData "ExportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ExportSpecList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ExportSpec l]))) |
data ExportSpec l #
An item in a module's export specification.
Constructors
EVar l (QName l) | variable. |
EAbs l (Namespace l) (QName l) |
|
EThingWith l (EWildcard l) (QName l) [CName l] |
|
EModuleContents l (ModuleName l) |
|
Instances
Foldable ExportSpec # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpec m -> m foldMap :: Monoid m => (a -> m) -> ExportSpec a -> m foldMap' :: Monoid m => (a -> m) -> ExportSpec a -> m foldr :: (a -> b -> b) -> b -> ExportSpec a -> b foldr' :: (a -> b -> b) -> b -> ExportSpec a -> b foldl :: (b -> a -> b) -> b -> ExportSpec a -> b foldl' :: (b -> a -> b) -> b -> ExportSpec a -> b foldr1 :: (a -> a -> a) -> ExportSpec a -> a foldl1 :: (a -> a -> a) -> ExportSpec a -> a toList :: ExportSpec a -> [a] null :: ExportSpec a -> Bool length :: ExportSpec a -> Int elem :: Eq a => a -> ExportSpec a -> Bool maximum :: Ord a => ExportSpec a -> a minimum :: Ord a => ExportSpec a -> a sum :: Num a => ExportSpec a -> a product :: Num a => ExportSpec a -> a | |
Traversable ExportSpec # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ExportSpec a -> f (ExportSpec b) sequenceA :: Applicative f => ExportSpec (f a) -> f (ExportSpec a) mapM :: Monad m => (a -> m b) -> ExportSpec a -> m (ExportSpec b) sequence :: Monad m => ExportSpec (m a) -> m (ExportSpec a) | |
Functor ExportSpec # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP ExportSpec # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ExportSpec SrcSpanInfo -> EP () | |
Annotated ExportSpec # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ExportSpec l -> c (ExportSpec l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ExportSpec l) toConstr :: ExportSpec l -> Constr dataTypeOf :: ExportSpec l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ExportSpec l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ExportSpec l)) gmapT :: (forall b. Data b => b -> b) -> ExportSpec l -> ExportSpec l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpec l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpec l -> r gmapQ :: (forall d. Data d => d -> u) -> ExportSpec l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ExportSpec l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) | |
Generic (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ExportSpec l) :: Type -> Type | |
Show l => Show (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ExportSpec l -> ShowS show :: ExportSpec l -> String showList :: [ExportSpec l] -> ShowS | |
Eq l => Eq (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ExportSpec l -> ExportSpec l -> Ordering (<) :: ExportSpec l -> ExportSpec l -> Bool (<=) :: ExportSpec l -> ExportSpec l -> Bool (>) :: ExportSpec l -> ExportSpec l -> Bool (>=) :: ExportSpec l -> ExportSpec l -> Bool max :: ExportSpec l -> ExportSpec l -> ExportSpec l min :: ExportSpec l -> ExportSpec l -> ExportSpec l | |
Pretty (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ExportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ExportSpec l) = D1 ('MetaData "ExportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "EVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "EAbs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Namespace l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))))) :+: (C1 ('MetaCons "EThingWith" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (EWildcard l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [CName l]))) :+: C1 ('MetaCons "EModuleContents" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ModuleName l))))) |
Indicates the position of the wildcard in an export list
Constructors
NoWildcard l | |
EWildcard l Int |
Instances
Foldable EWildcard # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => EWildcard m -> m foldMap :: Monoid m => (a -> m) -> EWildcard a -> m foldMap' :: Monoid m => (a -> m) -> EWildcard a -> m foldr :: (a -> b -> b) -> b -> EWildcard a -> b foldr' :: (a -> b -> b) -> b -> EWildcard a -> b foldl :: (b -> a -> b) -> b -> EWildcard a -> b foldl' :: (b -> a -> b) -> b -> EWildcard a -> b foldr1 :: (a -> a -> a) -> EWildcard a -> a foldl1 :: (a -> a -> a) -> EWildcard a -> a elem :: Eq a => a -> EWildcard a -> Bool maximum :: Ord a => EWildcard a -> a minimum :: Ord a => EWildcard a -> a | |
Traversable EWildcard # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor EWildcard # | |
Annotated EWildcard # | |
Data l => Data (EWildcard l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EWildcard l -> c (EWildcard l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (EWildcard l) toConstr :: EWildcard l -> Constr dataTypeOf :: EWildcard l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (EWildcard l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (EWildcard l)) gmapT :: (forall b. Data b => b -> b) -> EWildcard l -> EWildcard l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EWildcard l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EWildcard l -> r gmapQ :: (forall d. Data d => d -> u) -> EWildcard l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> EWildcard l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) | |
Generic (EWildcard l) # | |
Show l => Show (EWildcard l) # | |
Eq l => Eq (EWildcard l) # | |
Ord l => Ord (EWildcard l) # | |
Defined in Language.Haskell.Exts.Syntax | |
type Rep (EWildcard l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (EWildcard l) = D1 ('MetaData "EWildcard" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "NoWildcard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "EWildcard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) |
data ImportDecl l #
An import declaration.
Constructors
ImportDecl | |
Fields
|
Instances
Foldable ImportDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportDecl m -> m foldMap :: Monoid m => (a -> m) -> ImportDecl a -> m foldMap' :: Monoid m => (a -> m) -> ImportDecl a -> m foldr :: (a -> b -> b) -> b -> ImportDecl a -> b foldr' :: (a -> b -> b) -> b -> ImportDecl a -> b foldl :: (b -> a -> b) -> b -> ImportDecl a -> b foldl' :: (b -> a -> b) -> b -> ImportDecl a -> b foldr1 :: (a -> a -> a) -> ImportDecl a -> a foldl1 :: (a -> a -> a) -> ImportDecl a -> a toList :: ImportDecl a -> [a] null :: ImportDecl a -> Bool length :: ImportDecl a -> Int elem :: Eq a => a -> ImportDecl a -> Bool maximum :: Ord a => ImportDecl a -> a minimum :: Ord a => ImportDecl a -> a sum :: Num a => ImportDecl a -> a product :: Num a => ImportDecl a -> a | |
Traversable ImportDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ImportDecl a -> f (ImportDecl b) sequenceA :: Applicative f => ImportDecl (f a) -> f (ImportDecl a) mapM :: Monad m => (a -> m b) -> ImportDecl a -> m (ImportDecl b) sequence :: Monad m => ImportDecl (m a) -> m (ImportDecl a) | |
Functor ImportDecl # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP ImportDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportDecl SrcSpanInfo -> EP () | |
Annotated ImportDecl # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportDecl l -> c (ImportDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportDecl l) toConstr :: ImportDecl l -> Constr dataTypeOf :: ImportDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportDecl l)) gmapT :: (forall b. Data b => b -> b) -> ImportDecl l -> ImportDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> ImportDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) | |
Generic (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ImportDecl l) :: Type -> Type | |
Show l => Show (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportDecl l -> ShowS show :: ImportDecl l -> String showList :: [ImportDecl l] -> ShowS | |
Eq l => Eq (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ImportDecl l -> ImportDecl l -> Ordering (<) :: ImportDecl l -> ImportDecl l -> Bool (<=) :: ImportDecl l -> ImportDecl l -> Bool (>) :: ImportDecl l -> ImportDecl l -> Bool (>=) :: ImportDecl l -> ImportDecl l -> Bool max :: ImportDecl l -> ImportDecl l -> ImportDecl l min :: ImportDecl l -> ImportDecl l -> ImportDecl l | |
Parseable (ImportDecl SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (ImportDecl SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (ImportDecl SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (ImportDecl SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (ImportDecl SrcSpanInfo) | |
Pretty (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ImportDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ImportDecl l) = D1 ('MetaData "ImportDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ImportDecl" 'PrefixI 'True) (((S1 ('MetaSel ('Just "importAnn") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Just "importModule") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ModuleName l))) :*: (S1 ('MetaSel ('Just "importQualified") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "importSrc") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :*: ((S1 ('MetaSel ('Just "importSafe") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Just "importPkg") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe String))) :*: (S1 ('MetaSel ('Just "importAs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ModuleName l))) :*: S1 ('MetaSel ('Just "importSpecs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ImportSpecList l))))))) |
data ImportSpecList l #
An explicit import specification list.
Constructors
ImportSpecList l Bool [ImportSpec l] | A list of import specifications.
The |
Instances
Foldable ImportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpecList m -> m foldMap :: Monoid m => (a -> m) -> ImportSpecList a -> m foldMap' :: Monoid m => (a -> m) -> ImportSpecList a -> m foldr :: (a -> b -> b) -> b -> ImportSpecList a -> b foldr' :: (a -> b -> b) -> b -> ImportSpecList a -> b foldl :: (b -> a -> b) -> b -> ImportSpecList a -> b foldl' :: (b -> a -> b) -> b -> ImportSpecList a -> b foldr1 :: (a -> a -> a) -> ImportSpecList a -> a foldl1 :: (a -> a -> a) -> ImportSpecList a -> a toList :: ImportSpecList a -> [a] null :: ImportSpecList a -> Bool length :: ImportSpecList a -> Int elem :: Eq a => a -> ImportSpecList a -> Bool maximum :: Ord a => ImportSpecList a -> a minimum :: Ord a => ImportSpecList a -> a sum :: Num a => ImportSpecList a -> a product :: Num a => ImportSpecList a -> a | |
Traversable ImportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ImportSpecList a -> f (ImportSpecList b) sequenceA :: Applicative f => ImportSpecList (f a) -> f (ImportSpecList a) mapM :: Monad m => (a -> m b) -> ImportSpecList a -> m (ImportSpecList b) sequence :: Monad m => ImportSpecList (m a) -> m (ImportSpecList a) | |
Functor ImportSpecList # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ImportSpecList a -> ImportSpecList b (<$) :: a -> ImportSpecList b -> ImportSpecList a | |
ExactP ImportSpecList # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportSpecList SrcSpanInfo -> EP () | |
Annotated ImportSpecList # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpecList l -> c (ImportSpecList l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportSpecList l) toConstr :: ImportSpecList l -> Constr dataTypeOf :: ImportSpecList l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportSpecList l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportSpecList l)) gmapT :: (forall b. Data b => b -> b) -> ImportSpecList l -> ImportSpecList l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpecList l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpecList l -> r gmapQ :: (forall d. Data d => d -> u) -> ImportSpecList l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpecList l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) | |
Generic (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ImportSpecList l) :: Type -> Type Methods from :: ImportSpecList l -> Rep (ImportSpecList l) x to :: Rep (ImportSpecList l) x -> ImportSpecList l | |
Show l => Show (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportSpecList l -> ShowS show :: ImportSpecList l -> String showList :: [ImportSpecList l] -> ShowS | |
Eq l => Eq (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: ImportSpecList l -> ImportSpecList l -> Bool (/=) :: ImportSpecList l -> ImportSpecList l -> Bool | |
Ord l => Ord (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ImportSpecList l -> ImportSpecList l -> Ordering (<) :: ImportSpecList l -> ImportSpecList l -> Bool (<=) :: ImportSpecList l -> ImportSpecList l -> Bool (>) :: ImportSpecList l -> ImportSpecList l -> Bool (>=) :: ImportSpecList l -> ImportSpecList l -> Bool max :: ImportSpecList l -> ImportSpecList l -> ImportSpecList l min :: ImportSpecList l -> ImportSpecList l -> ImportSpecList l | |
Pretty (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ImportSpecList l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ImportSpecList l) = D1 ('MetaData "ImportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ImportSpecList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportSpec l])))) |
data ImportSpec l #
An import specification, representing a single explicit item imported (or hidden) from a module.
Constructors
IVar l (Name l) | variable |
IAbs l (Namespace l) (Name l) |
|
IThingAll l (Name l) |
|
IThingWith l (Name l) [CName l] |
|
Instances
Foldable ImportSpec # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpec m -> m foldMap :: Monoid m => (a -> m) -> ImportSpec a -> m foldMap' :: Monoid m => (a -> m) -> ImportSpec a -> m foldr :: (a -> b -> b) -> b -> ImportSpec a -> b foldr' :: (a -> b -> b) -> b -> ImportSpec a -> b foldl :: (b -> a -> b) -> b -> ImportSpec a -> b foldl' :: (b -> a -> b) -> b -> ImportSpec a -> b foldr1 :: (a -> a -> a) -> ImportSpec a -> a foldl1 :: (a -> a -> a) -> ImportSpec a -> a toList :: ImportSpec a -> [a] null :: ImportSpec a -> Bool length :: ImportSpec a -> Int elem :: Eq a => a -> ImportSpec a -> Bool maximum :: Ord a => ImportSpec a -> a minimum :: Ord a => ImportSpec a -> a sum :: Num a => ImportSpec a -> a product :: Num a => ImportSpec a -> a | |
Traversable ImportSpec # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ImportSpec a -> f (ImportSpec b) sequenceA :: Applicative f => ImportSpec (f a) -> f (ImportSpec a) mapM :: Monad m => (a -> m b) -> ImportSpec a -> m (ImportSpec b) sequence :: Monad m => ImportSpec (m a) -> m (ImportSpec a) | |
Functor ImportSpec # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP ImportSpec # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportSpec SrcSpanInfo -> EP () | |
Annotated ImportSpec # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpec l -> c (ImportSpec l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportSpec l) toConstr :: ImportSpec l -> Constr dataTypeOf :: ImportSpec l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportSpec l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportSpec l)) gmapT :: (forall b. Data b => b -> b) -> ImportSpec l -> ImportSpec l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec l -> r gmapQ :: (forall d. Data d => d -> u) -> ImportSpec l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) | |
Generic (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ImportSpec l) :: Type -> Type | |
Show l => Show (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportSpec l -> ShowS show :: ImportSpec l -> String showList :: [ImportSpec l] -> ShowS | |
Eq l => Eq (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ImportSpec l -> ImportSpec l -> Ordering (<) :: ImportSpec l -> ImportSpec l -> Bool (<=) :: ImportSpec l -> ImportSpec l -> Bool (>) :: ImportSpec l -> ImportSpec l -> Bool (>=) :: ImportSpec l -> ImportSpec l -> Bool max :: ImportSpec l -> ImportSpec l -> ImportSpec l min :: ImportSpec l -> ImportSpec l -> ImportSpec l | |
Pretty (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ImportSpec l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ImportSpec l) = D1 ('MetaData "ImportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "IVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "IAbs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Namespace l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))))) :+: (C1 ('MetaCons "IThingAll" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "IThingWith" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [CName l]))))) |
Associativity of an operator.
Constructors
AssocNone l | non-associative operator (declared with |
AssocLeft l | left-associative operator (declared with |
AssocRight l | right-associative operator (declared with |
Instances
Foldable Assoc # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Assoc m -> m foldMap :: Monoid m => (a -> m) -> Assoc a -> m foldMap' :: Monoid m => (a -> m) -> Assoc a -> m foldr :: (a -> b -> b) -> b -> Assoc a -> b foldr' :: (a -> b -> b) -> b -> Assoc a -> b foldl :: (b -> a -> b) -> b -> Assoc a -> b foldl' :: (b -> a -> b) -> b -> Assoc a -> b foldr1 :: (a -> a -> a) -> Assoc a -> a foldl1 :: (a -> a -> a) -> Assoc a -> a elem :: Eq a => a -> Assoc a -> Bool maximum :: Ord a => Assoc a -> a | |
Traversable Assoc # | |
Functor Assoc # | |
ExactP Assoc # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Assoc SrcSpanInfo -> EP () | |
Annotated Assoc # | |
Data l => Data (Assoc l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Assoc l -> c (Assoc l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Assoc l) dataTypeOf :: Assoc l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Assoc l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Assoc l)) gmapT :: (forall b. Data b => b -> b) -> Assoc l -> Assoc l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Assoc l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Assoc l -> r gmapQ :: (forall d. Data d => d -> u) -> Assoc l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Assoc l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) | |
Generic (Assoc l) # | |
Show l => Show (Assoc l) # | |
Eq l => Eq (Assoc l) # | |
Ord l => Ord (Assoc l) # | |
Pretty (Assoc l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Assoc l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Assoc l) = D1 ('MetaData "Assoc" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "AssocNone" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "AssocLeft" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "AssocRight" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
Namespaces for imports/exports.
Constructors
NoNamespace l | |
TypeNamespace l | |
PatternNamespace l |
Instances
Foldable Namespace # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Namespace m -> m foldMap :: Monoid m => (a -> m) -> Namespace a -> m foldMap' :: Monoid m => (a -> m) -> Namespace a -> m foldr :: (a -> b -> b) -> b -> Namespace a -> b foldr' :: (a -> b -> b) -> b -> Namespace a -> b foldl :: (b -> a -> b) -> b -> Namespace a -> b foldl' :: (b -> a -> b) -> b -> Namespace a -> b foldr1 :: (a -> a -> a) -> Namespace a -> a foldl1 :: (a -> a -> a) -> Namespace a -> a elem :: Eq a => a -> Namespace a -> Bool maximum :: Ord a => Namespace a -> a minimum :: Ord a => Namespace a -> a | |
Traversable Namespace # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor Namespace # | |
ExactP Namespace # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Namespace SrcSpanInfo -> EP () | |
Annotated Namespace # | |
Data l => Data (Namespace l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Namespace l -> c (Namespace l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Namespace l) toConstr :: Namespace l -> Constr dataTypeOf :: Namespace l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Namespace l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Namespace l)) gmapT :: (forall b. Data b => b -> b) -> Namespace l -> Namespace l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Namespace l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Namespace l -> r gmapQ :: (forall d. Data d => d -> u) -> Namespace l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Namespace l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) | |
Generic (Namespace l) # | |
Show l => Show (Namespace l) # | |
Eq l => Eq (Namespace l) # | |
Ord l => Ord (Namespace l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Namespace l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Namespace l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Namespace l) = D1 ('MetaData "Namespace" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "NoNamespace" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "TypeNamespace" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "PatternNamespace" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
Declarations
A top-level declaration.
Constructors
TypeDecl l (DeclHead l) (Type l) | A type declaration |
TypeFamDecl l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l)) | A type family declaration |
ClosedTypeFamDecl l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l)) [TypeEqn l] | A closed type family declaration |
DataDecl l (DataOrNew l) (Maybe (Context l)) (DeclHead l) [QualConDecl l] [Deriving l] | A data OR newtype declaration |
GDataDecl l (DataOrNew l) (Maybe (Context l)) (DeclHead l) (Maybe (Kind l)) [GadtDecl l] [Deriving l] | A data OR newtype declaration, GADT style |
DataFamDecl l (Maybe (Context l)) (DeclHead l) (Maybe (ResultSig l)) | A data family declaration |
TypeInsDecl l (Type l) (Type l) | A type family instance declaration |
DataInsDecl l (DataOrNew l) (Type l) [QualConDecl l] [Deriving l] | A data family instance declaration |
GDataInsDecl l (DataOrNew l) (Type l) (Maybe (Kind l)) [GadtDecl l] [Deriving l] | A data family instance declaration, GADT style |
ClassDecl l (Maybe (Context l)) (DeclHead l) [FunDep l] (Maybe [ClassDecl l]) | A declaration of a type class |
InstDecl l (Maybe (Overlap l)) (InstRule l) (Maybe [InstDecl l]) | An declaration of a type class instance |
DerivDecl l (Maybe (DerivStrategy l)) (Maybe (Overlap l)) (InstRule l) | A standalone deriving declaration |
InfixDecl l (Assoc l) (Maybe Int) [Op l] | A declaration of operator fixity |
DefaultDecl l [Type l] | A declaration of default types |
SpliceDecl l (Exp l) | A Template Haskell splicing declaration |
TSpliceDecl l (Exp l) | A typed Template Haskell splicing declaration |
TypeSig l [Name l] (Type l) | A type signature declaration |
PatSynSig l [Name l] (Maybe [TyVarBind l]) (Maybe (Context l)) (Maybe [TyVarBind l]) (Maybe (Context l)) (Type l) | A pattern synonym signature declation |
FunBind l [Match l] | A set of function binding clauses |
PatBind l (Pat l) (Rhs l) (Maybe (Binds l)) | A pattern binding |
PatSyn l (Pat l) (Pat l) (PatternSynDirection l) | A pattern synonym binding |
ForImp l (CallConv l) (Maybe (Safety l)) (Maybe String) (Name l) (Type l) | A foreign import declaration |
ForExp l (CallConv l) (Maybe String) (Name l) (Type l) | A foreign export declaration |
RulePragmaDecl l [Rule l] | A RULES pragma |
DeprPragmaDecl l [([Name l], String)] | A DEPRECATED pragma |
WarnPragmaDecl l [([Name l], String)] | A WARNING pragma |
InlineSig l Bool (Maybe (Activation l)) (QName l) | An INLINE pragma |
InlineConlikeSig l (Maybe (Activation l)) (QName l) | An INLINE CONLIKE pragma |
SpecSig l (Maybe (Activation l)) (QName l) [Type l] | A SPECIALISE pragma |
SpecInlineSig l Bool (Maybe (Activation l)) (QName l) [Type l] | A SPECIALISE INLINE pragma |
InstSig l (InstRule l) | A SPECIALISE instance pragma |
AnnPragma l (Annotation l) | An ANN pragma |
MinimalPragma l (Maybe (BooleanFormula l)) | A MINIMAL pragma |
RoleAnnotDecl l (QName l) [Role l] | A role annotation |
CompletePragma l [Name l] (Maybe (QName l)) | A COMPLETE pragma |
Instances
Foldable Decl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Decl m -> m foldMap :: Monoid m => (a -> m) -> Decl a -> m foldMap' :: Monoid m => (a -> m) -> Decl a -> m foldr :: (a -> b -> b) -> b -> Decl a -> b foldr' :: (a -> b -> b) -> b -> Decl a -> b foldl :: (b -> a -> b) -> b -> Decl a -> b foldl' :: (b -> a -> b) -> b -> Decl a -> b foldr1 :: (a -> a -> a) -> Decl a -> a foldl1 :: (a -> a -> a) -> Decl a -> a elem :: Eq a => a -> Decl a -> Bool maximum :: Ord a => Decl a -> a | |
Traversable Decl # | |
Functor Decl # | |
ExactP Decl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Decl SrcSpanInfo -> EP () | |
AppFixity Decl # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Decl SrcSpanInfo -> m (Decl SrcSpanInfo) # | |
Annotated Decl # | |
Data l => Data (Decl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Decl l -> c (Decl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Decl l) dataTypeOf :: Decl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Decl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Decl l)) gmapT :: (forall b. Data b => b -> b) -> Decl l -> Decl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Decl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Decl l -> r gmapQ :: (forall d. Data d => d -> u) -> Decl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Decl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) | |
Generic (Decl l) # | |
Show l => Show (Decl l) # | |
Eq l => Eq (Decl l) # | |
Ord l => Ord (Decl l) # | |
Parseable (Decl SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Decl SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Decl SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Decl SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Decl SrcSpanInfo) | |
Pretty (Decl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Decl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Decl l) = D1 ('MetaData "Decl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (((((C1 ('MetaCons "TypeDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "TypeFamDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ResultSig l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (InjectivityInfo l)))))) :+: (C1 ('MetaCons "ClosedTypeFamDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ResultSig l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (InjectivityInfo l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [TypeEqn l])))) :+: C1 ('MetaCons "DataDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QualConDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l])))))) :+: ((C1 ('MetaCons "GDataDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Kind l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GadtDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l])))) :+: C1 ('MetaCons "DataFamDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ResultSig l)))))) :+: (C1 ('MetaCons "TypeInsDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "DataInsDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QualConDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l]))))))) :+: (((C1 ('MetaCons "GDataInsDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Kind l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GadtDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l])))) :+: C1 ('MetaCons "ClassDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FunDep l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [ClassDecl l])))))) :+: (C1 ('MetaCons "InstDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Overlap l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstRule l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [InstDecl l])))) :+: C1 ('MetaCons "DerivDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (DerivStrategy l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Overlap l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstRule l)))))) :+: ((C1 ('MetaCons "InfixDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Assoc l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Int)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Op l]))) :+: C1 ('MetaCons "DefaultDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l]))) :+: (C1 ('MetaCons "SpliceDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: (C1 ('MetaCons "TSpliceDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "TypeSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))))))) :+: ((((C1 ('MetaCons "PatSynSig" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l])))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) :+: C1 ('MetaCons "FunBind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Match l]))) :+: (C1 ('MetaCons "PatBind" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Rhs l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Binds l))))) :+: C1 ('MetaCons "PatSyn" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (PatternSynDirection l)))))) :+: ((C1 ('MetaCons "ForImp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CallConv l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Safety l))))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe String)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) :+: C1 ('MetaCons "ForExp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CallConv l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe String)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))))) :+: (C1 ('MetaCons "RulePragmaDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Rule l])) :+: (C1 ('MetaCons "DeprPragmaDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [([Name l], String)])) :+: C1 ('MetaCons "WarnPragmaDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [([Name l], String)])))))) :+: (((C1 ('MetaCons "InlineSig" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Activation l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)))) :+: C1 ('MetaCons "InlineConlikeSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Activation l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))))) :+: (C1 ('MetaCons "SpecSig" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Activation l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l]))) :+: C1 ('MetaCons "SpecInlineSig" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Activation l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l])))))) :+: ((C1 ('MetaCons "InstSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstRule l))) :+: C1 ('MetaCons "AnnPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Annotation l)))) :+: (C1 ('MetaCons "MinimalPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (BooleanFormula l)))) :+: (C1 ('MetaCons "RoleAnnotDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Role l]))) :+: C1 ('MetaCons "CompletePragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (QName l))))))))))) |
The head of a type or class declaration, which consists of the type or class name applied to some type variables
class C a b
is represented as
DHApp () (DHApp () (DHead () (Ident () "C")) (UnkindedVar () (Ident () "a"))) (UnkindedVar () (Ident () "b"))
(where the annotation type l
is instantiated with ()
)
class (a :< b) c
is represented as
DHApp () (DHParen () (DHApp () (DHInfix () (UnkindedVar () (Ident () "a")) (Symbol () ":<")) (UnkindedVar () (Ident () "b")))) (UnkindedVar () (Ident () "c"))
Constructors
DHead l (Name l) | type or class name |
DHInfix l (TyVarBind l) (Name l) | infix application of the type/class name to the left operand |
DHParen l (DeclHead l) | parenthesized declaration head |
DHApp l (DeclHead l) (TyVarBind l) | application to one more type variable |
Instances
Foldable DeclHead # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DeclHead m -> m foldMap :: Monoid m => (a -> m) -> DeclHead a -> m foldMap' :: Monoid m => (a -> m) -> DeclHead a -> m foldr :: (a -> b -> b) -> b -> DeclHead a -> b foldr' :: (a -> b -> b) -> b -> DeclHead a -> b foldl :: (b -> a -> b) -> b -> DeclHead a -> b foldl' :: (b -> a -> b) -> b -> DeclHead a -> b foldr1 :: (a -> a -> a) -> DeclHead a -> a foldl1 :: (a -> a -> a) -> DeclHead a -> a elem :: Eq a => a -> DeclHead a -> Bool maximum :: Ord a => DeclHead a -> a minimum :: Ord a => DeclHead a -> a | |
Traversable DeclHead # | |
Functor DeclHead # | |
ExactP DeclHead # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DeclHead SrcSpanInfo -> EP () | |
Annotated DeclHead # | |
Data l => Data (DeclHead l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DeclHead l -> c (DeclHead l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DeclHead l) toConstr :: DeclHead l -> Constr dataTypeOf :: DeclHead l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DeclHead l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DeclHead l)) gmapT :: (forall b. Data b => b -> b) -> DeclHead l -> DeclHead l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DeclHead l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DeclHead l -> r gmapQ :: (forall d. Data d => d -> u) -> DeclHead l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DeclHead l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) | |
Generic (DeclHead l) # | |
Show l => Show (DeclHead l) # | |
Eq l => Eq (DeclHead l) # | |
Ord l => Ord (DeclHead l) # | |
Pretty (DeclHead l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (DeclHead l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (DeclHead l) = D1 ('MetaData "DeclHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "DHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "DHInfix" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TyVarBind l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))))) :+: (C1 ('MetaCons "DHParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l))) :+: C1 ('MetaCons "DHApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TyVarBind l)))))) |
The instance declaration rule, which is, roughly, the part of the instance declaration before the where
keyword.
Example: instance Ord a => Ord (Maybe a)
is represented as
IRule () Nothing (Just (CxSingle () (ClassA () (UnQual () (Ident () "Ord")) [ TyVar () (Ident () "a") ]))) (IHApp () (IHCon () (UnQual () (Ident () "Ord"))) (TyParen () (TyApp () (TyCon () (UnQual () (Ident () "Maybe"))) (TyVar () (Ident () "a")))))
An optional explicit forall after instance
is supported:
instance forall a . Ord a => Ord (Maybe a) where
becomes
IRule () (Just [ UnkindedVar () (Ident () "a") ]) ...
Instances
Foldable InstRule # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstRule m -> m foldMap :: Monoid m => (a -> m) -> InstRule a -> m foldMap' :: Monoid m => (a -> m) -> InstRule a -> m foldr :: (a -> b -> b) -> b -> InstRule a -> b foldr' :: (a -> b -> b) -> b -> InstRule a -> b foldl :: (b -> a -> b) -> b -> InstRule a -> b foldl' :: (b -> a -> b) -> b -> InstRule a -> b foldr1 :: (a -> a -> a) -> InstRule a -> a foldl1 :: (a -> a -> a) -> InstRule a -> a elem :: Eq a => a -> InstRule a -> Bool maximum :: Ord a => InstRule a -> a minimum :: Ord a => InstRule a -> a | |
Traversable InstRule # | |
Functor InstRule # | |
ExactP InstRule # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstRule SrcSpanInfo -> EP () | |
Annotated InstRule # | |
Data l => Data (InstRule l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InstRule l -> c (InstRule l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstRule l) toConstr :: InstRule l -> Constr dataTypeOf :: InstRule l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstRule l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstRule l)) gmapT :: (forall b. Data b => b -> b) -> InstRule l -> InstRule l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstRule l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstRule l -> r gmapQ :: (forall d. Data d => d -> u) -> InstRule l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> InstRule l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) | |
Generic (InstRule l) # | |
Show l => Show (InstRule l) # | |
Eq l => Eq (InstRule l) # | |
Ord l => Ord (InstRule l) # | |
Pretty (InstRule l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (InstRule l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (InstRule l) = D1 ('MetaData "InstRule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "IRule" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstHead l)))) :+: C1 ('MetaCons "IParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstRule l)))) |
The instance head. The split between rule/head allow us to represent
instance (Bounded a => Bounded [a]) where
faithfully.
The structure of InstHead
follows one of DeclHead
.
For example, instance C (Maybe a) Int where
is represented as
IHApp () (IHApp () (IHCon () (UnQual () (Ident () "C"))) (TyParen () (TyApp () (TyCon () (UnQual () (Ident () "Maybe"))) (TyVar () (Ident () "a"))))) (TyCon () (UnQual () (Ident () "Int")))))
Constructors
IHCon l (QName l) | type or class name |
IHInfix l (Type l) (QName l) | infix application of the type/class name to the left operand |
IHParen l (InstHead l) | parenthesized instance head |
IHApp l (InstHead l) (Type l) | application to one more type |
Instances
Foldable InstHead # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstHead m -> m foldMap :: Monoid m => (a -> m) -> InstHead a -> m foldMap' :: Monoid m => (a -> m) -> InstHead a -> m foldr :: (a -> b -> b) -> b -> InstHead a -> b foldr' :: (a -> b -> b) -> b -> InstHead a -> b foldl :: (b -> a -> b) -> b -> InstHead a -> b foldl' :: (b -> a -> b) -> b -> InstHead a -> b foldr1 :: (a -> a -> a) -> InstHead a -> a foldl1 :: (a -> a -> a) -> InstHead a -> a elem :: Eq a => a -> InstHead a -> Bool maximum :: Ord a => InstHead a -> a minimum :: Ord a => InstHead a -> a | |
Traversable InstHead # | |
Functor InstHead # | |
ExactP InstHead # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstHead SrcSpanInfo -> EP () | |
Annotated InstHead # | |
Data l => Data (InstHead l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InstHead l -> c (InstHead l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstHead l) toConstr :: InstHead l -> Constr dataTypeOf :: InstHead l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstHead l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstHead l)) gmapT :: (forall b. Data b => b -> b) -> InstHead l -> InstHead l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstHead l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstHead l -> r gmapQ :: (forall d. Data d => d -> u) -> InstHead l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> InstHead l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) | |
Generic (InstHead l) # | |
Show l => Show (InstHead l) # | |
Eq l => Eq (InstHead l) # | |
Ord l => Ord (InstHead l) # | |
Pretty (InstHead l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (InstHead l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (InstHead l) = D1 ('MetaData "InstHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "IHCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "IHInfix" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))))) :+: (C1 ('MetaCons "IHParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstHead l))) :+: C1 ('MetaCons "IHApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (InstHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))))) |
A binding group inside a let
or where
clause.
Constructors
BDecls l [Decl l] | An ordinary binding group |
IPBinds l [IPBind l] | A binding group for implicit parameters |
Instances
Foldable Binds # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Binds m -> m foldMap :: Monoid m => (a -> m) -> Binds a -> m foldMap' :: Monoid m => (a -> m) -> Binds a -> m foldr :: (a -> b -> b) -> b -> Binds a -> b foldr' :: (a -> b -> b) -> b -> Binds a -> b foldl :: (b -> a -> b) -> b -> Binds a -> b foldl' :: (b -> a -> b) -> b -> Binds a -> b foldr1 :: (a -> a -> a) -> Binds a -> a foldl1 :: (a -> a -> a) -> Binds a -> a elem :: Eq a => a -> Binds a -> Bool maximum :: Ord a => Binds a -> a | |
Traversable Binds # | |
Functor Binds # | |
ExactP Binds # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Binds SrcSpanInfo -> EP () | |
AppFixity Binds # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Binds SrcSpanInfo -> m (Binds SrcSpanInfo) # | |
Annotated Binds # | |
Data l => Data (Binds l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Binds l -> c (Binds l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Binds l) dataTypeOf :: Binds l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Binds l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Binds l)) gmapT :: (forall b. Data b => b -> b) -> Binds l -> Binds l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Binds l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Binds l -> r gmapQ :: (forall d. Data d => d -> u) -> Binds l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Binds l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) | |
Generic (Binds l) # | |
Show l => Show (Binds l) # | |
Eq l => Eq (Binds l) # | |
Ord l => Ord (Binds l) # | |
type Rep (Binds l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Binds l) = D1 ('MetaData "Binds" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "BDecls" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Decl l])) :+: C1 ('MetaCons "IPBinds" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [IPBind l]))) |
A binding of an implicit parameter.
Instances
Foldable IPBind # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPBind m -> m foldMap :: Monoid m => (a -> m) -> IPBind a -> m foldMap' :: Monoid m => (a -> m) -> IPBind a -> m foldr :: (a -> b -> b) -> b -> IPBind a -> b foldr' :: (a -> b -> b) -> b -> IPBind a -> b foldl :: (b -> a -> b) -> b -> IPBind a -> b foldl' :: (b -> a -> b) -> b -> IPBind a -> b foldr1 :: (a -> a -> a) -> IPBind a -> a foldl1 :: (a -> a -> a) -> IPBind a -> a elem :: Eq a => a -> IPBind a -> Bool maximum :: Ord a => IPBind a -> a | |
Traversable IPBind # | |
Functor IPBind # | |
ExactP IPBind # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: IPBind SrcSpanInfo -> EP () | |
AppFixity IPBind # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> IPBind SrcSpanInfo -> m (IPBind SrcSpanInfo) # | |
Annotated IPBind # | |
Data l => Data (IPBind l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IPBind l -> c (IPBind l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IPBind l) toConstr :: IPBind l -> Constr dataTypeOf :: IPBind l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IPBind l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IPBind l)) gmapT :: (forall b. Data b => b -> b) -> IPBind l -> IPBind l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IPBind l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IPBind l -> r gmapQ :: (forall d. Data d => d -> u) -> IPBind l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IPBind l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) | |
Generic (IPBind l) # | |
Show l => Show (IPBind l) # | |
Eq l => Eq (IPBind l) # | |
Ord l => Ord (IPBind l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (IPBind l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (IPBind l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (IPBind l) = D1 ('MetaData "IPBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "IPBind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IPName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) |
data PatternSynDirection l #
Constructors
Unidirectional | A unidirectional pattern synonym with "<-" |
ImplicitBidirectional | A bidirectional pattern synonym with "=" |
ExplicitBidirectional l [Decl l] | A birectional pattern synonym with the construction specified. |
Instances
Foldable PatternSynDirection # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatternSynDirection m -> m foldMap :: Monoid m => (a -> m) -> PatternSynDirection a -> m foldMap' :: Monoid m => (a -> m) -> PatternSynDirection a -> m foldr :: (a -> b -> b) -> b -> PatternSynDirection a -> b foldr' :: (a -> b -> b) -> b -> PatternSynDirection a -> b foldl :: (b -> a -> b) -> b -> PatternSynDirection a -> b foldl' :: (b -> a -> b) -> b -> PatternSynDirection a -> b foldr1 :: (a -> a -> a) -> PatternSynDirection a -> a foldl1 :: (a -> a -> a) -> PatternSynDirection a -> a toList :: PatternSynDirection a -> [a] null :: PatternSynDirection a -> Bool length :: PatternSynDirection a -> Int elem :: Eq a => a -> PatternSynDirection a -> Bool maximum :: Ord a => PatternSynDirection a -> a minimum :: Ord a => PatternSynDirection a -> a sum :: Num a => PatternSynDirection a -> a product :: Num a => PatternSynDirection a -> a | |
Traversable PatternSynDirection # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> PatternSynDirection a -> f (PatternSynDirection b) sequenceA :: Applicative f => PatternSynDirection (f a) -> f (PatternSynDirection a) mapM :: Monad m => (a -> m b) -> PatternSynDirection a -> m (PatternSynDirection b) sequence :: Monad m => PatternSynDirection (m a) -> m (PatternSynDirection a) | |
Functor PatternSynDirection # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> PatternSynDirection a -> PatternSynDirection b (<$) :: a -> PatternSynDirection b -> PatternSynDirection a | |
AppFixity PatternSynDirection # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PatternSynDirection SrcSpanInfo -> m (PatternSynDirection SrcSpanInfo) # | |
Data l => Data (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PatternSynDirection l -> c (PatternSynDirection l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PatternSynDirection l) toConstr :: PatternSynDirection l -> Constr dataTypeOf :: PatternSynDirection l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PatternSynDirection l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PatternSynDirection l)) gmapT :: (forall b. Data b => b -> b) -> PatternSynDirection l -> PatternSynDirection l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatternSynDirection l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatternSynDirection l -> r gmapQ :: (forall d. Data d => d -> u) -> PatternSynDirection l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> PatternSynDirection l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) | |
Generic (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (PatternSynDirection l) :: Type -> Type Methods from :: PatternSynDirection l -> Rep (PatternSynDirection l) x to :: Rep (PatternSynDirection l) x -> PatternSynDirection l | |
Show l => Show (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> PatternSynDirection l -> ShowS show :: PatternSynDirection l -> String showList :: [PatternSynDirection l] -> ShowS | |
Eq l => Eq (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: PatternSynDirection l -> PatternSynDirection l -> Bool (/=) :: PatternSynDirection l -> PatternSynDirection l -> Bool | |
Ord l => Ord (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: PatternSynDirection l -> PatternSynDirection l -> Ordering (<) :: PatternSynDirection l -> PatternSynDirection l -> Bool (<=) :: PatternSynDirection l -> PatternSynDirection l -> Bool (>) :: PatternSynDirection l -> PatternSynDirection l -> Bool (>=) :: PatternSynDirection l -> PatternSynDirection l -> Bool max :: PatternSynDirection l -> PatternSynDirection l -> PatternSynDirection l min :: PatternSynDirection l -> PatternSynDirection l -> PatternSynDirection l | |
type Rep (PatternSynDirection l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (PatternSynDirection l) = D1 ('MetaData "PatternSynDirection" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Unidirectional" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "ImplicitBidirectional" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplicitBidirectional" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Decl l])))) |
data InjectivityInfo l #
Injectivity info for injective type families
Constructors
InjectivityInfo l (Name l) [Name l] |
Instances
Foldable InjectivityInfo # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InjectivityInfo m -> m foldMap :: Monoid m => (a -> m) -> InjectivityInfo a -> m foldMap' :: Monoid m => (a -> m) -> InjectivityInfo a -> m foldr :: (a -> b -> b) -> b -> InjectivityInfo a -> b foldr' :: (a -> b -> b) -> b -> InjectivityInfo a -> b foldl :: (b -> a -> b) -> b -> InjectivityInfo a -> b foldl' :: (b -> a -> b) -> b -> InjectivityInfo a -> b foldr1 :: (a -> a -> a) -> InjectivityInfo a -> a foldl1 :: (a -> a -> a) -> InjectivityInfo a -> a toList :: InjectivityInfo a -> [a] null :: InjectivityInfo a -> Bool length :: InjectivityInfo a -> Int elem :: Eq a => a -> InjectivityInfo a -> Bool maximum :: Ord a => InjectivityInfo a -> a minimum :: Ord a => InjectivityInfo a -> a sum :: Num a => InjectivityInfo a -> a product :: Num a => InjectivityInfo a -> a | |
Traversable InjectivityInfo # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> InjectivityInfo a -> f (InjectivityInfo b) sequenceA :: Applicative f => InjectivityInfo (f a) -> f (InjectivityInfo a) mapM :: Monad m => (a -> m b) -> InjectivityInfo a -> m (InjectivityInfo b) sequence :: Monad m => InjectivityInfo (m a) -> m (InjectivityInfo a) | |
Functor InjectivityInfo # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> InjectivityInfo a -> InjectivityInfo b (<$) :: a -> InjectivityInfo b -> InjectivityInfo a | |
ExactP InjectivityInfo # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InjectivityInfo SrcSpanInfo -> EP () | |
Annotated InjectivityInfo # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InjectivityInfo l -> c (InjectivityInfo l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InjectivityInfo l) toConstr :: InjectivityInfo l -> Constr dataTypeOf :: InjectivityInfo l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InjectivityInfo l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InjectivityInfo l)) gmapT :: (forall b. Data b => b -> b) -> InjectivityInfo l -> InjectivityInfo l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityInfo l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityInfo l -> r gmapQ :: (forall d. Data d => d -> u) -> InjectivityInfo l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> InjectivityInfo l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) | |
Generic (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (InjectivityInfo l) :: Type -> Type Methods from :: InjectivityInfo l -> Rep (InjectivityInfo l) x to :: Rep (InjectivityInfo l) x -> InjectivityInfo l | |
Show l => Show (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> InjectivityInfo l -> ShowS show :: InjectivityInfo l -> String showList :: [InjectivityInfo l] -> ShowS | |
Eq l => Eq (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: InjectivityInfo l -> InjectivityInfo l -> Bool (/=) :: InjectivityInfo l -> InjectivityInfo l -> Bool | |
Ord l => Ord (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: InjectivityInfo l -> InjectivityInfo l -> Ordering (<) :: InjectivityInfo l -> InjectivityInfo l -> Bool (<=) :: InjectivityInfo l -> InjectivityInfo l -> Bool (>) :: InjectivityInfo l -> InjectivityInfo l -> Bool (>=) :: InjectivityInfo l -> InjectivityInfo l -> Bool max :: InjectivityInfo l -> InjectivityInfo l -> InjectivityInfo l min :: InjectivityInfo l -> InjectivityInfo l -> InjectivityInfo l | |
Pretty (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (InjectivityInfo l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (InjectivityInfo l) = D1 ('MetaData "InjectivityInfo" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "InjectivityInfo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l])))) |
Instances
Foldable ResultSig # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ResultSig m -> m foldMap :: Monoid m => (a -> m) -> ResultSig a -> m foldMap' :: Monoid m => (a -> m) -> ResultSig a -> m foldr :: (a -> b -> b) -> b -> ResultSig a -> b foldr' :: (a -> b -> b) -> b -> ResultSig a -> b foldl :: (b -> a -> b) -> b -> ResultSig a -> b foldl' :: (b -> a -> b) -> b -> ResultSig a -> b foldr1 :: (a -> a -> a) -> ResultSig a -> a foldl1 :: (a -> a -> a) -> ResultSig a -> a elem :: Eq a => a -> ResultSig a -> Bool maximum :: Ord a => ResultSig a -> a minimum :: Ord a => ResultSig a -> a | |
Traversable ResultSig # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor ResultSig # | |
ExactP ResultSig # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ResultSig SrcSpanInfo -> EP () | |
Annotated ResultSig # | |
Data l => Data (ResultSig l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ResultSig l -> c (ResultSig l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ResultSig l) toConstr :: ResultSig l -> Constr dataTypeOf :: ResultSig l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ResultSig l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ResultSig l)) gmapT :: (forall b. Data b => b -> b) -> ResultSig l -> ResultSig l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ResultSig l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ResultSig l -> r gmapQ :: (forall d. Data d => d -> u) -> ResultSig l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ResultSig l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) | |
Generic (ResultSig l) # | |
Show l => Show (ResultSig l) # | |
Eq l => Eq (ResultSig l) # | |
Ord l => Ord (ResultSig l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (ResultSig l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ResultSig l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ResultSig l) = D1 ('MetaData "ResultSig" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "KindSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Kind l))) :+: C1 ('MetaCons "TyVarSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TyVarBind l)))) |
Type classes and instances
Declarations inside a class declaration.
Constructors
ClsDecl l (Decl l) | ordinary declaration |
ClsDataFam l (Maybe (Context l)) (DeclHead l) (Maybe (ResultSig l)) | declaration of an associated data type |
ClsTyFam l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l)) | declaration of an associated type synonym |
ClsTyDef l (TypeEqn l) | default choice for an associated type synonym |
ClsDefSig l (Name l) (Type l) | default signature |
Instances
Foldable ClassDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ClassDecl m -> m foldMap :: Monoid m => (a -> m) -> ClassDecl a -> m foldMap' :: Monoid m => (a -> m) -> ClassDecl a -> m foldr :: (a -> b -> b) -> b -> ClassDecl a -> b foldr' :: (a -> b -> b) -> b -> ClassDecl a -> b foldl :: (b -> a -> b) -> b -> ClassDecl a -> b foldl' :: (b -> a -> b) -> b -> ClassDecl a -> b foldr1 :: (a -> a -> a) -> ClassDecl a -> a foldl1 :: (a -> a -> a) -> ClassDecl a -> a elem :: Eq a => a -> ClassDecl a -> Bool maximum :: Ord a => ClassDecl a -> a minimum :: Ord a => ClassDecl a -> a | |
Traversable ClassDecl # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor ClassDecl # | |
ExactP ClassDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ClassDecl SrcSpanInfo -> EP () | |
AppFixity ClassDecl # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> ClassDecl SrcSpanInfo -> m (ClassDecl SrcSpanInfo) # | |
Annotated ClassDecl # | |
Data l => Data (ClassDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ClassDecl l -> c (ClassDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ClassDecl l) toConstr :: ClassDecl l -> Constr dataTypeOf :: ClassDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ClassDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ClassDecl l)) gmapT :: (forall b. Data b => b -> b) -> ClassDecl l -> ClassDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ClassDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ClassDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> ClassDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ClassDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) | |
Generic (ClassDecl l) # | |
Show l => Show (ClassDecl l) # | |
Eq l => Eq (ClassDecl l) # | |
Ord l => Ord (ClassDecl l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (ClassDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ClassDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ClassDecl l) = D1 ('MetaData "ClassDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "ClsDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Decl l))) :+: C1 ('MetaCons "ClsDataFam" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ResultSig l)))))) :+: (C1 ('MetaCons "ClsTyFam" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DeclHead l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (ResultSig l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (InjectivityInfo l))))) :+: (C1 ('MetaCons "ClsTyDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (TypeEqn l))) :+: C1 ('MetaCons "ClsDefSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))))) |
Declarations inside an instance declaration.
Constructors
InsDecl l (Decl l) | ordinary declaration |
InsType l (Type l) (Type l) | an associated type definition |
InsData l (DataOrNew l) (Type l) [QualConDecl l] [Deriving l] | an associated data type implementation |
InsGData l (DataOrNew l) (Type l) (Maybe (Kind l)) [GadtDecl l] [Deriving l] | an associated data type implemented using GADT style |
Instances
Foldable InstDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstDecl m -> m foldMap :: Monoid m => (a -> m) -> InstDecl a -> m foldMap' :: Monoid m => (a -> m) -> InstDecl a -> m foldr :: (a -> b -> b) -> b -> InstDecl a -> b foldr' :: (a -> b -> b) -> b -> InstDecl a -> b foldl :: (b -> a -> b) -> b -> InstDecl a -> b foldl' :: (b -> a -> b) -> b -> InstDecl a -> b foldr1 :: (a -> a -> a) -> InstDecl a -> a foldl1 :: (a -> a -> a) -> InstDecl a -> a elem :: Eq a => a -> InstDecl a -> Bool maximum :: Ord a => InstDecl a -> a minimum :: Ord a => InstDecl a -> a | |
Traversable InstDecl # | |
Functor InstDecl # | |
ExactP InstDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstDecl SrcSpanInfo -> EP () | |
AppFixity InstDecl # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> InstDecl SrcSpanInfo -> m (InstDecl SrcSpanInfo) # | |
Annotated InstDecl # | |
Data l => Data (InstDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InstDecl l -> c (InstDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstDecl l) toConstr :: InstDecl l -> Constr dataTypeOf :: InstDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstDecl l)) gmapT :: (forall b. Data b => b -> b) -> InstDecl l -> InstDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> InstDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> InstDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) | |
Generic (InstDecl l) # | |
Show l => Show (InstDecl l) # | |
Eq l => Eq (InstDecl l) # | |
Ord l => Ord (InstDecl l) # | |
Pretty (InstDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (InstDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (InstDecl l) = D1 ('MetaData "InstDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "InsDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Decl l))) :+: C1 ('MetaCons "InsType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) :+: (C1 ('MetaCons "InsData" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QualConDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l])))) :+: C1 ('MetaCons "InsGData" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (DataOrNew l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Kind l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GadtDecl l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Deriving l])))))) |
A deriving clause following a data type declaration.
Constructors
Deriving l (Maybe (DerivStrategy l)) [InstRule l] |
Instances
Foldable Deriving # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Deriving m -> m foldMap :: Monoid m => (a -> m) -> Deriving a -> m foldMap' :: Monoid m => (a -> m) -> Deriving a -> m foldr :: (a -> b -> b) -> b -> Deriving a -> b foldr' :: (a -> b -> b) -> b -> Deriving a -> b foldl :: (b -> a -> b) -> b -> Deriving a -> b foldl' :: (b -> a -> b) -> b -> Deriving a -> b foldr1 :: (a -> a -> a) -> Deriving a -> a foldl1 :: (a -> a -> a) -> Deriving a -> a elem :: Eq a => a -> Deriving a -> Bool maximum :: Ord a => Deriving a -> a minimum :: Ord a => Deriving a -> a | |
Traversable Deriving # | |
Functor Deriving # | |
ExactP Deriving # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Deriving SrcSpanInfo -> EP () | |
Annotated Deriving # | |
Data l => Data (Deriving l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Deriving l -> c (Deriving l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Deriving l) toConstr :: Deriving l -> Constr dataTypeOf :: Deriving l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Deriving l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Deriving l)) gmapT :: (forall b. Data b => b -> b) -> Deriving l -> Deriving l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Deriving l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Deriving l -> r gmapQ :: (forall d. Data d => d -> u) -> Deriving l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Deriving l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) | |
Generic (Deriving l) # | |
Show l => Show (Deriving l) # | |
Eq l => Eq (Deriving l) # | |
Ord l => Ord (Deriving l) # | |
Pretty (Deriving l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Deriving l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Deriving l) = D1 ('MetaData "Deriving" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Deriving" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (DerivStrategy l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [InstRule l])))) |
data DerivStrategy l #
Which technique the user explicitly requested when deriving an instance.
Constructors
DerivStock l | GHC's "standard" strategy, which is to implement a
custom instance for the data type. This only works for
certain types that GHC knows about (e.g., |
DerivAnyclass l | -XDeriveAnyClass |
DerivNewtype l | -XGeneralizedNewtypeDeriving |
DerivVia l (Type l) | -XDerivingVia |
Instances
Foldable DerivStrategy # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DerivStrategy m -> m foldMap :: Monoid m => (a -> m) -> DerivStrategy a -> m foldMap' :: Monoid m => (a -> m) -> DerivStrategy a -> m foldr :: (a -> b -> b) -> b -> DerivStrategy a -> b foldr' :: (a -> b -> b) -> b -> DerivStrategy a -> b foldl :: (b -> a -> b) -> b -> DerivStrategy a -> b foldl' :: (b -> a -> b) -> b -> DerivStrategy a -> b foldr1 :: (a -> a -> a) -> DerivStrategy a -> a foldl1 :: (a -> a -> a) -> DerivStrategy a -> a toList :: DerivStrategy a -> [a] null :: DerivStrategy a -> Bool length :: DerivStrategy a -> Int elem :: Eq a => a -> DerivStrategy a -> Bool maximum :: Ord a => DerivStrategy a -> a minimum :: Ord a => DerivStrategy a -> a sum :: Num a => DerivStrategy a -> a product :: Num a => DerivStrategy a -> a | |
Traversable DerivStrategy # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> DerivStrategy a -> f (DerivStrategy b) sequenceA :: Applicative f => DerivStrategy (f a) -> f (DerivStrategy a) mapM :: Monad m => (a -> m b) -> DerivStrategy a -> m (DerivStrategy b) sequence :: Monad m => DerivStrategy (m a) -> m (DerivStrategy a) | |
Functor DerivStrategy # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> DerivStrategy a -> DerivStrategy b (<$) :: a -> DerivStrategy b -> DerivStrategy a | |
ExactP DerivStrategy # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DerivStrategy SrcSpanInfo -> EP () | |
Annotated DerivStrategy # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DerivStrategy l -> c (DerivStrategy l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DerivStrategy l) toConstr :: DerivStrategy l -> Constr dataTypeOf :: DerivStrategy l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DerivStrategy l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DerivStrategy l)) gmapT :: (forall b. Data b => b -> b) -> DerivStrategy l -> DerivStrategy l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy l -> r gmapQ :: (forall d. Data d => d -> u) -> DerivStrategy l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DerivStrategy l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) | |
Generic (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (DerivStrategy l) :: Type -> Type Methods from :: DerivStrategy l -> Rep (DerivStrategy l) x to :: Rep (DerivStrategy l) x -> DerivStrategy l | |
Show l => Show (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> DerivStrategy l -> ShowS show :: DerivStrategy l -> String showList :: [DerivStrategy l] -> ShowS | |
Eq l => Eq (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: DerivStrategy l -> DerivStrategy l -> Bool (/=) :: DerivStrategy l -> DerivStrategy l -> Bool | |
Ord l => Ord (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: DerivStrategy l -> DerivStrategy l -> Ordering (<) :: DerivStrategy l -> DerivStrategy l -> Bool (<=) :: DerivStrategy l -> DerivStrategy l -> Bool (>) :: DerivStrategy l -> DerivStrategy l -> Bool (>=) :: DerivStrategy l -> DerivStrategy l -> Bool max :: DerivStrategy l -> DerivStrategy l -> DerivStrategy l min :: DerivStrategy l -> DerivStrategy l -> DerivStrategy l | |
Pretty (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (DerivStrategy l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (DerivStrategy l) = D1 ('MetaData "DerivStrategy" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "DerivStock" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "DerivAnyclass" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "DerivNewtype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "DerivVia" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) |
Data type declarations
A flag stating whether a declaration is a data or newtype declaration.
Instances
Foldable DataOrNew # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DataOrNew m -> m foldMap :: Monoid m => (a -> m) -> DataOrNew a -> m foldMap' :: Monoid m => (a -> m) -> DataOrNew a -> m foldr :: (a -> b -> b) -> b -> DataOrNew a -> b foldr' :: (a -> b -> b) -> b -> DataOrNew a -> b foldl :: (b -> a -> b) -> b -> DataOrNew a -> b foldl' :: (b -> a -> b) -> b -> DataOrNew a -> b foldr1 :: (a -> a -> a) -> DataOrNew a -> a foldl1 :: (a -> a -> a) -> DataOrNew a -> a elem :: Eq a => a -> DataOrNew a -> Bool maximum :: Ord a => DataOrNew a -> a minimum :: Ord a => DataOrNew a -> a | |
Traversable DataOrNew # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor DataOrNew # | |
ExactP DataOrNew # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DataOrNew SrcSpanInfo -> EP () | |
Annotated DataOrNew # | |
Data l => Data (DataOrNew l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataOrNew l -> c (DataOrNew l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DataOrNew l) toConstr :: DataOrNew l -> Constr dataTypeOf :: DataOrNew l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DataOrNew l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DataOrNew l)) gmapT :: (forall b. Data b => b -> b) -> DataOrNew l -> DataOrNew l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataOrNew l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataOrNew l -> r gmapQ :: (forall d. Data d => d -> u) -> DataOrNew l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> DataOrNew l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) | |
Generic (DataOrNew l) # | |
Show l => Show (DataOrNew l) # | |
Eq l => Eq (DataOrNew l) # | |
Ord l => Ord (DataOrNew l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (DataOrNew l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (DataOrNew l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (DataOrNew l) = D1 ('MetaData "DataOrNew" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "DataType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "NewType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) |
Declaration of an ordinary data constructor.
Constructors
ConDecl l (Name l) [Type l] | ordinary data constructor |
InfixConDecl l (Type l) (Name l) (Type l) | infix data constructor |
RecDecl l (Name l) [FieldDecl l] | record constructor |
Instances
Foldable ConDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ConDecl m -> m foldMap :: Monoid m => (a -> m) -> ConDecl a -> m foldMap' :: Monoid m => (a -> m) -> ConDecl a -> m foldr :: (a -> b -> b) -> b -> ConDecl a -> b foldr' :: (a -> b -> b) -> b -> ConDecl a -> b foldl :: (b -> a -> b) -> b -> ConDecl a -> b foldl' :: (b -> a -> b) -> b -> ConDecl a -> b foldr1 :: (a -> a -> a) -> ConDecl a -> a foldl1 :: (a -> a -> a) -> ConDecl a -> a elem :: Eq a => a -> ConDecl a -> Bool maximum :: Ord a => ConDecl a -> a minimum :: Ord a => ConDecl a -> a | |
Traversable ConDecl # | |
Functor ConDecl # | |
ExactP ConDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ConDecl SrcSpanInfo -> EP () | |
Annotated ConDecl # | |
Data l => Data (ConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ConDecl l -> c (ConDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ConDecl l) toConstr :: ConDecl l -> Constr dataTypeOf :: ConDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ConDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ConDecl l)) gmapT :: (forall b. Data b => b -> b) -> ConDecl l -> ConDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> ConDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ConDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) | |
Generic (ConDecl l) # | |
Show l => Show (ConDecl l) # | |
Eq l => Eq (ConDecl l) # | |
Ord l => Ord (ConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (ConDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ConDecl l) = D1 ('MetaData "ConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ConDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l]))) :+: (C1 ('MetaCons "InfixConDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "RecDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldDecl l]))))) |
Declaration of a (list of) named field(s).
Instances
Foldable FieldDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldDecl m -> m foldMap :: Monoid m => (a -> m) -> FieldDecl a -> m foldMap' :: Monoid m => (a -> m) -> FieldDecl a -> m foldr :: (a -> b -> b) -> b -> FieldDecl a -> b foldr' :: (a -> b -> b) -> b -> FieldDecl a -> b foldl :: (b -> a -> b) -> b -> FieldDecl a -> b foldl' :: (b -> a -> b) -> b -> FieldDecl a -> b foldr1 :: (a -> a -> a) -> FieldDecl a -> a foldl1 :: (a -> a -> a) -> FieldDecl a -> a elem :: Eq a => a -> FieldDecl a -> Bool maximum :: Ord a => FieldDecl a -> a minimum :: Ord a => FieldDecl a -> a | |
Traversable FieldDecl # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor FieldDecl # | |
ExactP FieldDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FieldDecl SrcSpanInfo -> EP () | |
Annotated FieldDecl # | |
Data l => Data (FieldDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldDecl l -> c (FieldDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FieldDecl l) toConstr :: FieldDecl l -> Constr dataTypeOf :: FieldDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FieldDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FieldDecl l)) gmapT :: (forall b. Data b => b -> b) -> FieldDecl l -> FieldDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> FieldDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) | |
Generic (FieldDecl l) # | |
Show l => Show (FieldDecl l) # | |
Eq l => Eq (FieldDecl l) # | |
Ord l => Ord (FieldDecl l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (FieldDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (FieldDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (FieldDecl l) = D1 ('MetaData "FieldDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "FieldDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) |
data QualConDecl l #
A single constructor declaration within a data type declaration, which may have an existential quantification binding.
Constructors
QualConDecl l (Maybe [TyVarBind l]) (Maybe (Context l)) (ConDecl l) |
Instances
Foldable QualConDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualConDecl m -> m foldMap :: Monoid m => (a -> m) -> QualConDecl a -> m foldMap' :: Monoid m => (a -> m) -> QualConDecl a -> m foldr :: (a -> b -> b) -> b -> QualConDecl a -> b foldr' :: (a -> b -> b) -> b -> QualConDecl a -> b foldl :: (b -> a -> b) -> b -> QualConDecl a -> b foldl' :: (b -> a -> b) -> b -> QualConDecl a -> b foldr1 :: (a -> a -> a) -> QualConDecl a -> a foldl1 :: (a -> a -> a) -> QualConDecl a -> a toList :: QualConDecl a -> [a] null :: QualConDecl a -> Bool length :: QualConDecl a -> Int elem :: Eq a => a -> QualConDecl a -> Bool maximum :: Ord a => QualConDecl a -> a minimum :: Ord a => QualConDecl a -> a sum :: Num a => QualConDecl a -> a product :: Num a => QualConDecl a -> a | |
Traversable QualConDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> QualConDecl a -> f (QualConDecl b) sequenceA :: Applicative f => QualConDecl (f a) -> f (QualConDecl a) mapM :: Monad m => (a -> m b) -> QualConDecl a -> m (QualConDecl b) sequence :: Monad m => QualConDecl (m a) -> m (QualConDecl a) | |
Functor QualConDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> QualConDecl a -> QualConDecl b (<$) :: a -> QualConDecl b -> QualConDecl a | |
ExactP QualConDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QualConDecl SrcSpanInfo -> EP () | |
Annotated QualConDecl # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QualConDecl l -> c (QualConDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QualConDecl l) toConstr :: QualConDecl l -> Constr dataTypeOf :: QualConDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QualConDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QualConDecl l)) gmapT :: (forall b. Data b => b -> b) -> QualConDecl l -> QualConDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QualConDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QualConDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> QualConDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> QualConDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) | |
Generic (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (QualConDecl l) :: Type -> Type | |
Show l => Show (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> QualConDecl l -> ShowS show :: QualConDecl l -> String showList :: [QualConDecl l] -> ShowS | |
Eq l => Eq (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: QualConDecl l -> QualConDecl l -> Ordering (<) :: QualConDecl l -> QualConDecl l -> Bool (<=) :: QualConDecl l -> QualConDecl l -> Bool (>) :: QualConDecl l -> QualConDecl l -> Bool (>=) :: QualConDecl l -> QualConDecl l -> Bool max :: QualConDecl l -> QualConDecl l -> QualConDecl l min :: QualConDecl l -> QualConDecl l -> QualConDecl l | |
Pretty (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (QualConDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (QualConDecl l) = D1 ('MetaData "QualConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "QualConDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ConDecl l))))) |
A single constructor declaration in a GADT data type declaration.
If the GADT is declared using the record syntax, e.g.
data Ty where TCon :: { field1 :: Int, field2 :: Bool } -> Ty
then the fields are stored as a list of FieldDecl
s, and the final type
(Ty
in the above example) is stored in the last Type
field.
If the GADT is declared using the ordinary syntax, e.g.
data Ty where TCon :: Int -> Bool -> Ty
then
is Maybe
[FieldDecl
l]Nothing
, and the whole constructor's
type (such as Int -> Bool -> Ty
) is stored in the last Type
field.
Constructors
GadtDecl l (Name l) (Maybe [TyVarBind l]) (Maybe (Context l)) (Maybe [FieldDecl l]) (Type l) |
Instances
Foldable GadtDecl # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GadtDecl m -> m foldMap :: Monoid m => (a -> m) -> GadtDecl a -> m foldMap' :: Monoid m => (a -> m) -> GadtDecl a -> m foldr :: (a -> b -> b) -> b -> GadtDecl a -> b foldr' :: (a -> b -> b) -> b -> GadtDecl a -> b foldl :: (b -> a -> b) -> b -> GadtDecl a -> b foldl' :: (b -> a -> b) -> b -> GadtDecl a -> b foldr1 :: (a -> a -> a) -> GadtDecl a -> a foldl1 :: (a -> a -> a) -> GadtDecl a -> a elem :: Eq a => a -> GadtDecl a -> Bool maximum :: Ord a => GadtDecl a -> a minimum :: Ord a => GadtDecl a -> a | |
Traversable GadtDecl # | |
Functor GadtDecl # | |
ExactP GadtDecl # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: GadtDecl SrcSpanInfo -> EP () | |
Annotated GadtDecl # | |
Data l => Data (GadtDecl l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GadtDecl l -> c (GadtDecl l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GadtDecl l) toConstr :: GadtDecl l -> Constr dataTypeOf :: GadtDecl l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GadtDecl l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GadtDecl l)) gmapT :: (forall b. Data b => b -> b) -> GadtDecl l -> GadtDecl l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GadtDecl l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GadtDecl l -> r gmapQ :: (forall d. Data d => d -> u) -> GadtDecl l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> GadtDecl l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) | |
Generic (GadtDecl l) # | |
Show l => Show (GadtDecl l) # | |
Eq l => Eq (GadtDecl l) # | |
Ord l => Ord (GadtDecl l) # | |
Pretty (GadtDecl l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (GadtDecl l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (GadtDecl l) = D1 ('MetaData "GadtDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "GadtDecl" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l])))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [FieldDecl l])) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))))) |
The type of a constructor argument or field, optionally including a strictness annotation.
Constructors
BangedTy l | strict component, marked with " |
LazyTy l | lazy component, marked with " |
NoStrictAnnot l | No strictness information |
Instances
Foldable BangType # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BangType m -> m foldMap :: Monoid m => (a -> m) -> BangType a -> m foldMap' :: Monoid m => (a -> m) -> BangType a -> m foldr :: (a -> b -> b) -> b -> BangType a -> b foldr' :: (a -> b -> b) -> b -> BangType a -> b foldl :: (b -> a -> b) -> b -> BangType a -> b foldl' :: (b -> a -> b) -> b -> BangType a -> b foldr1 :: (a -> a -> a) -> BangType a -> a foldl1 :: (a -> a -> a) -> BangType a -> a elem :: Eq a => a -> BangType a -> Bool maximum :: Ord a => BangType a -> a minimum :: Ord a => BangType a -> a | |
Traversable BangType # | |
Functor BangType # | |
ExactP BangType # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: BangType SrcSpanInfo -> EP () | |
Annotated BangType # | |
Data l => Data (BangType l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BangType l -> c (BangType l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BangType l) toConstr :: BangType l -> Constr dataTypeOf :: BangType l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BangType l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BangType l)) gmapT :: (forall b. Data b => b -> b) -> BangType l -> BangType l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BangType l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BangType l -> r gmapQ :: (forall d. Data d => d -> u) -> BangType l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> BangType l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) | |
Generic (BangType l) # | |
Show l => Show (BangType l) # | |
Eq l => Eq (BangType l) # | |
Ord l => Ord (BangType l) # | |
Pretty (BangType l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (BangType l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (BangType l) = D1 ('MetaData "BangType" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "BangedTy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "LazyTy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "NoStrictAnnot" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
data Unpackedness l #
Constructors
Unpack l | " |
NoUnpack l | " |
NoUnpackPragma l | No unpack pragma |
Instances
Foldable Unpackedness # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Unpackedness m -> m foldMap :: Monoid m => (a -> m) -> Unpackedness a -> m foldMap' :: Monoid m => (a -> m) -> Unpackedness a -> m foldr :: (a -> b -> b) -> b -> Unpackedness a -> b foldr' :: (a -> b -> b) -> b -> Unpackedness a -> b foldl :: (b -> a -> b) -> b -> Unpackedness a -> b foldl' :: (b -> a -> b) -> b -> Unpackedness a -> b foldr1 :: (a -> a -> a) -> Unpackedness a -> a foldl1 :: (a -> a -> a) -> Unpackedness a -> a toList :: Unpackedness a -> [a] null :: Unpackedness a -> Bool length :: Unpackedness a -> Int elem :: Eq a => a -> Unpackedness a -> Bool maximum :: Ord a => Unpackedness a -> a minimum :: Ord a => Unpackedness a -> a sum :: Num a => Unpackedness a -> a product :: Num a => Unpackedness a -> a | |
Traversable Unpackedness # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Unpackedness a -> f (Unpackedness b) sequenceA :: Applicative f => Unpackedness (f a) -> f (Unpackedness a) mapM :: Monad m => (a -> m b) -> Unpackedness a -> m (Unpackedness b) sequence :: Monad m => Unpackedness (m a) -> m (Unpackedness a) | |
Functor Unpackedness # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Unpackedness a -> Unpackedness b (<$) :: a -> Unpackedness b -> Unpackedness a | |
ExactP Unpackedness # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Unpackedness SrcSpanInfo -> EP () | |
Annotated Unpackedness # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unpackedness l -> c (Unpackedness l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unpackedness l) toConstr :: Unpackedness l -> Constr dataTypeOf :: Unpackedness l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unpackedness l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unpackedness l)) gmapT :: (forall b. Data b => b -> b) -> Unpackedness l -> Unpackedness l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unpackedness l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unpackedness l -> r gmapQ :: (forall d. Data d => d -> u) -> Unpackedness l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Unpackedness l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) | |
Generic (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (Unpackedness l) :: Type -> Type Methods from :: Unpackedness l -> Rep (Unpackedness l) x to :: Rep (Unpackedness l) x -> Unpackedness l | |
Show l => Show (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Unpackedness l -> ShowS show :: Unpackedness l -> String showList :: [Unpackedness l] -> ShowS | |
Eq l => Eq (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: Unpackedness l -> Unpackedness l -> Bool (/=) :: Unpackedness l -> Unpackedness l -> Bool | |
Ord l => Ord (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: Unpackedness l -> Unpackedness l -> Ordering (<) :: Unpackedness l -> Unpackedness l -> Bool (<=) :: Unpackedness l -> Unpackedness l -> Bool (>) :: Unpackedness l -> Unpackedness l -> Bool (>=) :: Unpackedness l -> Unpackedness l -> Bool max :: Unpackedness l -> Unpackedness l -> Unpackedness l min :: Unpackedness l -> Unpackedness l -> Unpackedness l | |
Pretty (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Unpackedness l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Unpackedness l) = D1 ('MetaData "Unpackedness" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Unpack" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "NoUnpack" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "NoUnpackPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
Function bindings
Clauses of a function binding.
Constructors
Match l (Name l) [Pat l] (Rhs l) (Maybe (Binds l)) | A clause defined with prefix notation, i.e. the function name followed by its argument patterns, the right-hand side and an optional where clause. |
InfixMatch l (Pat l) (Name l) [Pat l] (Rhs l) (Maybe (Binds l)) | A clause defined with infix notation, i.e. first its first argument pattern, then the function name, then its following argument(s), the right-hand side and an optional where clause. Note that there can be more than two arguments to a function declared infix, hence the list of pattern arguments. |
Instances
Foldable Match # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Match m -> m foldMap :: Monoid m => (a -> m) -> Match a -> m foldMap' :: Monoid m => (a -> m) -> Match a -> m foldr :: (a -> b -> b) -> b -> Match a -> b foldr' :: (a -> b -> b) -> b -> Match a -> b foldl :: (b -> a -> b) -> b -> Match a -> b foldl' :: (b -> a -> b) -> b -> Match a -> b foldr1 :: (a -> a -> a) -> Match a -> a foldl1 :: (a -> a -> a) -> Match a -> a elem :: Eq a => a -> Match a -> Bool maximum :: Ord a => Match a -> a | |
Traversable Match # | |
Functor Match # | |
ExactP Match # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Match SrcSpanInfo -> EP () | |
AppFixity Match # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Match SrcSpanInfo -> m (Match SrcSpanInfo) # | |
Annotated Match # | |
Data l => Data (Match l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Match l -> c (Match l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Match l) dataTypeOf :: Match l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Match l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Match l)) gmapT :: (forall b. Data b => b -> b) -> Match l -> Match l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Match l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Match l -> r gmapQ :: (forall d. Data d => d -> u) -> Match l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Match l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) | |
Generic (Match l) # | |
Show l => Show (Match l) # | |
Eq l => Eq (Match l) # | |
Ord l => Ord (Match l) # | |
Pretty (Match l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Match l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Match l) = D1 ('MetaData "Match" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Match" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Rhs l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Binds l)))))) :+: C1 ('MetaCons "InfixMatch" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Rhs l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Binds l))))))) |
The right hand side of a function binding, pattern binding, or a case alternative.
Constructors
UnGuardedRhs l (Exp l) | unguarded right hand side (exp) |
GuardedRhss l [GuardedRhs l] | guarded right hand side (gdrhs) |
Instances
Foldable Rhs # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rhs m -> m foldMap :: Monoid m => (a -> m) -> Rhs a -> m foldMap' :: Monoid m => (a -> m) -> Rhs a -> m foldr :: (a -> b -> b) -> b -> Rhs a -> b foldr' :: (a -> b -> b) -> b -> Rhs a -> b foldl :: (b -> a -> b) -> b -> Rhs a -> b foldl' :: (b -> a -> b) -> b -> Rhs a -> b foldr1 :: (a -> a -> a) -> Rhs a -> a foldl1 :: (a -> a -> a) -> Rhs a -> a elem :: Eq a => a -> Rhs a -> Bool maximum :: Ord a => Rhs a -> a | |
Traversable Rhs # | |
Functor Rhs # | |
ExactP Rhs # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Rhs SrcSpanInfo -> EP () | |
AppFixity Rhs # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Rhs SrcSpanInfo -> m (Rhs SrcSpanInfo) # | |
Annotated Rhs # | |
Data l => Data (Rhs l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Rhs l -> c (Rhs l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Rhs l) dataTypeOf :: Rhs l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Rhs l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Rhs l)) gmapT :: (forall b. Data b => b -> b) -> Rhs l -> Rhs l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rhs l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rhs l -> r gmapQ :: (forall d. Data d => d -> u) -> Rhs l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Rhs l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) | |
Generic (Rhs l) # | |
Show l => Show (Rhs l) # | |
Eq l => Eq (Rhs l) # | |
Ord l => Ord (Rhs l) # | |
Pretty (Rhs l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Rhs l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Rhs l) = D1 ('MetaData "Rhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "UnGuardedRhs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "GuardedRhss" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GuardedRhs l]))) |
data GuardedRhs l #
A guarded right hand side |
stmts =
exp, or |
stmts ->
exp
for case alternatives.
The guard is a series of statements when using pattern guards,
otherwise it will be a single qualifier expression.
Constructors
GuardedRhs l [Stmt l] (Exp l) |
Instances
Foldable GuardedRhs # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GuardedRhs m -> m foldMap :: Monoid m => (a -> m) -> GuardedRhs a -> m foldMap' :: Monoid m => (a -> m) -> GuardedRhs a -> m foldr :: (a -> b -> b) -> b -> GuardedRhs a -> b foldr' :: (a -> b -> b) -> b -> GuardedRhs a -> b foldl :: (b -> a -> b) -> b -> GuardedRhs a -> b foldl' :: (b -> a -> b) -> b -> GuardedRhs a -> b foldr1 :: (a -> a -> a) -> GuardedRhs a -> a foldl1 :: (a -> a -> a) -> GuardedRhs a -> a toList :: GuardedRhs a -> [a] null :: GuardedRhs a -> Bool length :: GuardedRhs a -> Int elem :: Eq a => a -> GuardedRhs a -> Bool maximum :: Ord a => GuardedRhs a -> a minimum :: Ord a => GuardedRhs a -> a sum :: Num a => GuardedRhs a -> a product :: Num a => GuardedRhs a -> a | |
Traversable GuardedRhs # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> GuardedRhs a -> f (GuardedRhs b) sequenceA :: Applicative f => GuardedRhs (f a) -> f (GuardedRhs a) mapM :: Monad m => (a -> m b) -> GuardedRhs a -> m (GuardedRhs b) sequence :: Monad m => GuardedRhs (m a) -> m (GuardedRhs a) | |
Functor GuardedRhs # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP GuardedRhs # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: GuardedRhs SrcSpanInfo -> EP () | |
AppFixity GuardedRhs # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> GuardedRhs SrcSpanInfo -> m (GuardedRhs SrcSpanInfo) # | |
Annotated GuardedRhs # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GuardedRhs l -> c (GuardedRhs l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GuardedRhs l) toConstr :: GuardedRhs l -> Constr dataTypeOf :: GuardedRhs l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GuardedRhs l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GuardedRhs l)) gmapT :: (forall b. Data b => b -> b) -> GuardedRhs l -> GuardedRhs l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GuardedRhs l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GuardedRhs l -> r gmapQ :: (forall d. Data d => d -> u) -> GuardedRhs l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> GuardedRhs l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) | |
Generic (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (GuardedRhs l) :: Type -> Type | |
Show l => Show (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> GuardedRhs l -> ShowS show :: GuardedRhs l -> String showList :: [GuardedRhs l] -> ShowS | |
Eq l => Eq (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: GuardedRhs l -> GuardedRhs l -> Ordering (<) :: GuardedRhs l -> GuardedRhs l -> Bool (<=) :: GuardedRhs l -> GuardedRhs l -> Bool (>) :: GuardedRhs l -> GuardedRhs l -> Bool (>=) :: GuardedRhs l -> GuardedRhs l -> Bool max :: GuardedRhs l -> GuardedRhs l -> GuardedRhs l min :: GuardedRhs l -> GuardedRhs l -> GuardedRhs l | |
Pretty (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (GuardedRhs l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (GuardedRhs l) = D1 ('MetaData "GuardedRhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "GuardedRhs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) |
Class Assertions and Contexts
A context is a set of assertions
Instances
Foldable Context # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Context m -> m foldMap :: Monoid m => (a -> m) -> Context a -> m foldMap' :: Monoid m => (a -> m) -> Context a -> m foldr :: (a -> b -> b) -> b -> Context a -> b foldr' :: (a -> b -> b) -> b -> Context a -> b foldl :: (b -> a -> b) -> b -> Context a -> b foldl' :: (b -> a -> b) -> b -> Context a -> b foldr1 :: (a -> a -> a) -> Context a -> a foldl1 :: (a -> a -> a) -> Context a -> a elem :: Eq a => a -> Context a -> Bool maximum :: Ord a => Context a -> a minimum :: Ord a => Context a -> a | |
Traversable Context # | |
Functor Context # | |
ExactP Context # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Context SrcSpanInfo -> EP () | |
Annotated Context # | |
Data l => Data (Context l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Context l -> c (Context l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Context l) toConstr :: Context l -> Constr dataTypeOf :: Context l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Context l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Context l)) gmapT :: (forall b. Data b => b -> b) -> Context l -> Context l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Context l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Context l -> r gmapQ :: (forall d. Data d => d -> u) -> Context l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Context l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) | |
Generic (Context l) # | |
Show l => Show (Context l) # | |
Eq l => Eq (Context l) # | |
Ord l => Ord (Context l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Context l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Context l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Context l) = D1 ('MetaData "Context" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "CxSingle" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Asst l))) :+: (C1 ('MetaCons "CxTuple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Asst l])) :+: C1 ('MetaCons "CxEmpty" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
A functional dependency, given on the form l1 l2 ... ln -> r2 r3 .. rn
Instances
Foldable FunDep # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FunDep m -> m foldMap :: Monoid m => (a -> m) -> FunDep a -> m foldMap' :: Monoid m => (a -> m) -> FunDep a -> m foldr :: (a -> b -> b) -> b -> FunDep a -> b foldr' :: (a -> b -> b) -> b -> FunDep a -> b foldl :: (b -> a -> b) -> b -> FunDep a -> b foldl' :: (b -> a -> b) -> b -> FunDep a -> b foldr1 :: (a -> a -> a) -> FunDep a -> a foldl1 :: (a -> a -> a) -> FunDep a -> a elem :: Eq a => a -> FunDep a -> Bool maximum :: Ord a => FunDep a -> a | |
Traversable FunDep # | |
Functor FunDep # | |
ExactP FunDep # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FunDep SrcSpanInfo -> EP () | |
Annotated FunDep # | |
Data l => Data (FunDep l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunDep l -> c (FunDep l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FunDep l) toConstr :: FunDep l -> Constr dataTypeOf :: FunDep l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FunDep l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FunDep l)) gmapT :: (forall b. Data b => b -> b) -> FunDep l -> FunDep l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunDep l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunDep l -> r gmapQ :: (forall d. Data d => d -> u) -> FunDep l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> FunDep l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) | |
Generic (FunDep l) # | |
Show l => Show (FunDep l) # | |
Eq l => Eq (FunDep l) # | |
Ord l => Ord (FunDep l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (FunDep l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (FunDep l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (FunDep l) = D1 ('MetaData "FunDep" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "FunDep" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l])))) |
Class assertions.
Constructors
TypeA l (Type l) | type assertion |
IParam l (IPName l) (Type l) | implicit parameter assertion |
ParenA l (Asst l) | parenthesised class assertion |
Instances
Foldable Asst # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Asst m -> m foldMap :: Monoid m => (a -> m) -> Asst a -> m foldMap' :: Monoid m => (a -> m) -> Asst a -> m foldr :: (a -> b -> b) -> b -> Asst a -> b foldr' :: (a -> b -> b) -> b -> Asst a -> b foldl :: (b -> a -> b) -> b -> Asst a -> b foldl' :: (b -> a -> b) -> b -> Asst a -> b foldr1 :: (a -> a -> a) -> Asst a -> a foldl1 :: (a -> a -> a) -> Asst a -> a elem :: Eq a => a -> Asst a -> Bool maximum :: Ord a => Asst a -> a | |
Traversable Asst # | |
Functor Asst # | |
ExactP Asst # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Asst SrcSpanInfo -> EP () | |
Annotated Asst # | |
Data l => Data (Asst l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Asst l -> c (Asst l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Asst l) dataTypeOf :: Asst l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Asst l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Asst l)) gmapT :: (forall b. Data b => b -> b) -> Asst l -> Asst l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Asst l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Asst l -> r gmapQ :: (forall d. Data d => d -> u) -> Asst l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Asst l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) | |
Generic (Asst l) # | |
Show l => Show (Asst l) # | |
Eq l => Eq (Asst l) # | |
Ord l => Ord (Asst l) # | |
Pretty (Asst l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Asst l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Asst l) = D1 ('MetaData "Asst" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "TypeA" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :+: (C1 ('MetaCons "IParam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IPName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "ParenA" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Asst l))))) |
Types
A type qualified with a context. An unqualified type has an empty context.
Constructors
TyForall l (Maybe [TyVarBind l]) (Maybe (Context l)) (Type l) | qualified type |
TyStar l |
|
TyFun l (Type l) (Type l) | function type |
TyTuple l Boxed [Type l] | tuple type, possibly boxed |
TyUnboxedSum l [Type l] | unboxed tuple type |
TyList l (Type l) | list syntax, e.g. [a], as opposed to [] a |
TyParArray l (Type l) | parallel array syntax, e.g. [:a:] |
TyApp l (Type l) (Type l) | application of a type constructor |
TyVar l (Name l) | type variable |
TyCon l (QName l) | named type or type constructor |
TyParen l (Type l) | type surrounded by parentheses |
TyInfix l (Type l) (MaybePromotedName l) (Type l) | infix type constructor |
TyKind l (Type l) (Kind l) | type with explicit kind signature |
TyPromoted l (Promoted l) |
|
TyEquals l (Type l) (Type l) | type equality predicate enabled by ConstraintKinds |
TySplice l (Splice l) | template haskell splice type |
TyBang l (BangType l) (Unpackedness l) (Type l) | Strict type marked with " |
TyWildCard l (Maybe (Name l)) | Either an anonymous of named type wildcard |
TyQuasiQuote l String String | [$name| string |] |
Instances
Foldable Type # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Type m -> m foldMap :: Monoid m => (a -> m) -> Type a -> m foldMap' :: Monoid m => (a -> m) -> Type a -> m foldr :: (a -> b -> b) -> b -> Type a -> b foldr' :: (a -> b -> b) -> b -> Type a -> b foldl :: (b -> a -> b) -> b -> Type a -> b foldl' :: (b -> a -> b) -> b -> Type a -> b foldr1 :: (a -> a -> a) -> Type a -> a foldl1 :: (a -> a -> a) -> Type a -> a elem :: Eq a => a -> Type a -> Bool maximum :: Ord a => Type a -> a | |
Traversable Type # | |
Functor Type # | |
ExactP Type # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Type SrcSpanInfo -> EP () | |
Annotated Type # | |
Data l => Data (Type l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type l -> c (Type l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Type l) dataTypeOf :: Type l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Type l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Type l)) gmapT :: (forall b. Data b => b -> b) -> Type l -> Type l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type l -> r gmapQ :: (forall d. Data d => d -> u) -> Type l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Type l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) | |
Generic (Type l) # | |
Show l => Show (Type l) # | |
Eq l => Eq (Type l) # | |
Ord l => Ord (Type l) # | |
Parseable (Type SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Type SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Type SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Type SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Type SrcSpanInfo) | |
Pretty (Type l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Type l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Type l) = D1 ('MetaData "Type" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((((C1 ('MetaCons "TyForall" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [TyVarBind l]))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Context l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "TyStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "TyFun" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "TyTuple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Boxed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l]))))) :+: ((C1 ('MetaCons "TyUnboxedSum" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l])) :+: C1 ('MetaCons "TyList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: (C1 ('MetaCons "TyParArray" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :+: (C1 ('MetaCons "TyApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "TyVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))))))) :+: (((C1 ('MetaCons "TyCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "TyParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: (C1 ('MetaCons "TyInfix" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (MaybePromotedName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: (C1 ('MetaCons "TyKind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Kind l)))) :+: C1 ('MetaCons "TyPromoted" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Promoted l)))))) :+: ((C1 ('MetaCons "TyEquals" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "TySplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Splice l)))) :+: (C1 ('MetaCons "TyBang" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (BangType l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Unpackedness l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: (C1 ('MetaCons "TyWildCard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Name l)))) :+: C1 ('MetaCons "TyQuasiQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))))))) |
Flag denoting whether a tuple is boxed or unboxed.
Instances
Data Boxed # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Boxed -> c Boxed gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Boxed dataTypeOf :: Boxed -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Boxed) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boxed) gmapT :: (forall b. Data b => b -> b) -> Boxed -> Boxed gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boxed -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boxed -> r gmapQ :: (forall d. Data d => d -> u) -> Boxed -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Boxed -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed | |
Generic Boxed # | |
Show Boxed # | |
Eq Boxed # | |
Ord Boxed # | |
type Rep Boxed # | |
Defined in Language.Haskell.Exts.Syntax type Rep Boxed = D1 ('MetaData "Boxed" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Boxed" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Unboxed" 'PrefixI 'False) (U1 :: Type -> Type)) |
A type variable declaration, optionally with an explicit kind annotation.
Constructors
KindedVar l (Name l) (Kind l) | variable binding with kind annotation |
UnkindedVar l (Name l) | ordinary variable binding |
Instances
Foldable TyVarBind # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TyVarBind m -> m foldMap :: Monoid m => (a -> m) -> TyVarBind a -> m foldMap' :: Monoid m => (a -> m) -> TyVarBind a -> m foldr :: (a -> b -> b) -> b -> TyVarBind a -> b foldr' :: (a -> b -> b) -> b -> TyVarBind a -> b foldl :: (b -> a -> b) -> b -> TyVarBind a -> b foldl' :: (b -> a -> b) -> b -> TyVarBind a -> b foldr1 :: (a -> a -> a) -> TyVarBind a -> a foldl1 :: (a -> a -> a) -> TyVarBind a -> a elem :: Eq a => a -> TyVarBind a -> Bool maximum :: Ord a => TyVarBind a -> a minimum :: Ord a => TyVarBind a -> a | |
Traversable TyVarBind # | |
Defined in Language.Haskell.Exts.Syntax | |
Functor TyVarBind # | |
ExactP TyVarBind # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: TyVarBind SrcSpanInfo -> EP () | |
Annotated TyVarBind # | |
Data l => Data (TyVarBind l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyVarBind l -> c (TyVarBind l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TyVarBind l) toConstr :: TyVarBind l -> Constr dataTypeOf :: TyVarBind l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TyVarBind l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TyVarBind l)) gmapT :: (forall b. Data b => b -> b) -> TyVarBind l -> TyVarBind l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBind l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBind l -> r gmapQ :: (forall d. Data d => d -> u) -> TyVarBind l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> TyVarBind l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) | |
Generic (TyVarBind l) # | |
Show l => Show (TyVarBind l) # | |
Eq l => Eq (TyVarBind l) # | |
Ord l => Ord (TyVarBind l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (TyVarBind l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (TyVarBind l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (TyVarBind l) = D1 ('MetaData "TyVarBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "KindedVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Kind l)))) :+: C1 ('MetaCons "UnkindedVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)))) |
Bools here are True if there was a leading quote which may be
left out. For example '[k1,k2]
means the same thing as [k1,k2]
.
Constructors
PromotedInteger l Integer String | parsed value and raw string |
PromotedString l String String | parsed value and raw string |
PromotedCon l Bool (QName l) | |
PromotedList l Bool [Type l] | |
PromotedTuple l [Type l] | |
PromotedUnit l |
Instances
Foldable Promoted # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Promoted m -> m foldMap :: Monoid m => (a -> m) -> Promoted a -> m foldMap' :: Monoid m => (a -> m) -> Promoted a -> m foldr :: (a -> b -> b) -> b -> Promoted a -> b foldr' :: (a -> b -> b) -> b -> Promoted a -> b foldl :: (b -> a -> b) -> b -> Promoted a -> b foldl' :: (b -> a -> b) -> b -> Promoted a -> b foldr1 :: (a -> a -> a) -> Promoted a -> a foldl1 :: (a -> a -> a) -> Promoted a -> a elem :: Eq a => a -> Promoted a -> Bool maximum :: Ord a => Promoted a -> a minimum :: Ord a => Promoted a -> a | |
Traversable Promoted # | |
Functor Promoted # | |
ExactP Promoted # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Promoted SrcSpanInfo -> EP () | |
Annotated Promoted # | |
Data l => Data (Promoted l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Promoted l -> c (Promoted l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Promoted l) toConstr :: Promoted l -> Constr dataTypeOf :: Promoted l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Promoted l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Promoted l)) gmapT :: (forall b. Data b => b -> b) -> Promoted l -> Promoted l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Promoted l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Promoted l -> r gmapQ :: (forall d. Data d => d -> u) -> Promoted l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Promoted l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) | |
Generic (Promoted l) # | |
Show l => Show (Promoted l) # | |
Eq l => Eq (Promoted l) # | |
Ord l => Ord (Promoted l) # | |
Pretty (Promoted l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Promoted l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Promoted l) = D1 ('MetaData "Promoted" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "PromotedInteger" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "PromotedString" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "PromotedCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)))))) :+: (C1 ('MetaCons "PromotedList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l]))) :+: (C1 ('MetaCons "PromotedTuple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type l])) :+: C1 ('MetaCons "PromotedUnit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))))) |
A type equation as found in closed type families.
Instances
Foldable TypeEqn # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TypeEqn m -> m foldMap :: Monoid m => (a -> m) -> TypeEqn a -> m foldMap' :: Monoid m => (a -> m) -> TypeEqn a -> m foldr :: (a -> b -> b) -> b -> TypeEqn a -> b foldr' :: (a -> b -> b) -> b -> TypeEqn a -> b foldl :: (b -> a -> b) -> b -> TypeEqn a -> b foldl' :: (b -> a -> b) -> b -> TypeEqn a -> b foldr1 :: (a -> a -> a) -> TypeEqn a -> a foldl1 :: (a -> a -> a) -> TypeEqn a -> a elem :: Eq a => a -> TypeEqn a -> Bool maximum :: Ord a => TypeEqn a -> a minimum :: Ord a => TypeEqn a -> a | |
Traversable TypeEqn # | |
Functor TypeEqn # | |
ExactP TypeEqn # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: TypeEqn SrcSpanInfo -> EP () | |
Annotated TypeEqn # | |
Data l => Data (TypeEqn l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeEqn l -> c (TypeEqn l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TypeEqn l) toConstr :: TypeEqn l -> Constr dataTypeOf :: TypeEqn l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TypeEqn l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TypeEqn l)) gmapT :: (forall b. Data b => b -> b) -> TypeEqn l -> TypeEqn l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeEqn l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeEqn l -> r gmapQ :: (forall d. Data d => d -> u) -> TypeEqn l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeEqn l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) | |
Generic (TypeEqn l) # | |
Show l => Show (TypeEqn l) # | |
Eq l => Eq (TypeEqn l) # | |
Ord l => Ord (TypeEqn l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (TypeEqn l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (TypeEqn l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (TypeEqn l) = D1 ('MetaData "TypeEqn" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "TypeEqn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) |
Expressions
Haskell expressions.
Constructors
Var l (QName l) | variable |
OverloadedLabel l String | Overloaded label #foo |
IPVar l (IPName l) | implicit parameter variable |
Con l (QName l) | data constructor |
Lit l (Literal l) | literal constant |
InfixApp l (Exp l) (QOp l) (Exp l) | infix application |
App l (Exp l) (Exp l) | ordinary application |
NegApp l (Exp l) | negation expression |
Lambda l [Pat l] (Exp l) | lambda expression |
Let l (Binds l) (Exp l) | local declarations with |
If l (Exp l) (Exp l) (Exp l) |
|
MultiIf l [GuardedRhs l] |
|
Case l (Exp l) [Alt l] |
|
Do l [Stmt l] |
|
MDo l [Stmt l] |
|
Tuple l Boxed [Exp l] | tuple expression |
UnboxedSum l Int Int (Exp l) | unboxed sum |
TupleSection l Boxed [Maybe (Exp l)] | tuple section expression, e.g. |
List l [Exp l] | list expression |
ParArray l [Exp l] | parallel array expression |
Paren l (Exp l) | parenthesised expression |
LeftSection l (Exp l) (QOp l) | left section |
RightSection l (QOp l) (Exp l) | right section |
RecConstr l (QName l) [FieldUpdate l] | record construction expression |
RecUpdate l (Exp l) [FieldUpdate l] | record update expression |
EnumFrom l (Exp l) | unbounded arithmetic sequence,
incrementing by 1: |
EnumFromTo l (Exp l) (Exp l) | bounded arithmetic sequence,
incrementing by 1 |
EnumFromThen l (Exp l) (Exp l) | unbounded arithmetic sequence,
with first two elements given |
EnumFromThenTo l (Exp l) (Exp l) (Exp l) | bounded arithmetic sequence,
with first two elements given |
ParArrayFromTo l (Exp l) (Exp l) | Parallel array bounded arithmetic sequence,
incrementing by 1 |
ParArrayFromThenTo l (Exp l) (Exp l) (Exp l) | bounded arithmetic sequence,
with first two elements given |
ListComp l (Exp l) [QualStmt l] | ordinary list comprehension |
ParComp l (Exp l) [[QualStmt l]] | parallel list comprehension |
ParArrayComp l (Exp l) [[QualStmt l]] | parallel array comprehension |
ExpTypeSig l (Exp l) (Type l) | expression with explicit type signature |
VarQuote l (QName l) |
|
TypQuote l (QName l) |
|
BracketExp l (Bracket l) | template haskell bracket expression |
SpliceExp l (Splice l) | template haskell splice expression |
QuasiQuote l String String | quasi-quotaion: |
TypeApp l (Type l) | Visible type application |
XTag l (XName l) [XAttr l] (Maybe (Exp l)) [Exp l] | xml element, with attributes and children |
XETag l (XName l) [XAttr l] (Maybe (Exp l)) | empty xml element, with attributes |
XPcdata l String | PCDATA child element |
XExpTag l (Exp l) | escaped haskell expression inside xml |
XChildTag l [Exp l] | children of an xml element |
CorePragma l String (Exp l) | CORE pragma |
SCCPragma l String (Exp l) | SCC pragma |
GenPragma l String (Int, Int) (Int, Int) (Exp l) | GENERATED pragma |
Proc l (Pat l) (Exp l) | arrows proc: |
LeftArrApp l (Exp l) (Exp l) | arrow application (from left): exp |
RightArrApp l (Exp l) (Exp l) | arrow application (from right): exp |
LeftArrHighApp l (Exp l) (Exp l) | higher-order arrow application (from left): exp |
RightArrHighApp l (Exp l) (Exp l) | higher-order arrow application (from right): exp |
ArrOp l (Exp l) | arrow control operators: |
LCase l [Alt l] |
|
Instances
Foldable Exp # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Exp m -> m foldMap :: Monoid m => (a -> m) -> Exp a -> m foldMap' :: Monoid m => (a -> m) -> Exp a -> m foldr :: (a -> b -> b) -> b -> Exp a -> b foldr' :: (a -> b -> b) -> b -> Exp a -> b foldl :: (b -> a -> b) -> b -> Exp a -> b foldl' :: (b -> a -> b) -> b -> Exp a -> b foldr1 :: (a -> a -> a) -> Exp a -> a foldl1 :: (a -> a -> a) -> Exp a -> a elem :: Eq a => a -> Exp a -> Bool maximum :: Ord a => Exp a -> a | |
Traversable Exp # | |
Functor Exp # | |
ExactP Exp # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Exp SrcSpanInfo -> EP () | |
AppFixity Exp # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Exp SrcSpanInfo -> m (Exp SrcSpanInfo) # | |
Annotated Exp # | |
Data l => Data (Exp l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Exp l -> c (Exp l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Exp l) dataTypeOf :: Exp l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Exp l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Exp l)) gmapT :: (forall b. Data b => b -> b) -> Exp l -> Exp l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Exp l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Exp l -> r gmapQ :: (forall d. Data d => d -> u) -> Exp l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Exp l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) | |
Generic (Exp l) # | |
Show l => Show (Exp l) # | |
Eq l => Eq (Exp l) # | |
Ord l => Ord (Exp l) # | |
Parseable (Exp SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Exp SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Exp SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Exp SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Exp SrcSpanInfo) | |
Pretty (Exp l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Exp l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Exp l) = D1 ('MetaData "Exp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (((((C1 ('MetaCons "Var" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: (C1 ('MetaCons "OverloadedLabel" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "IPVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IPName l))))) :+: ((C1 ('MetaCons "Con" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "Lit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Literal l)))) :+: (C1 ('MetaCons "InfixApp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QOp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "App" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))))) :+: ((C1 ('MetaCons "NegApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: (C1 ('MetaCons "Lambda" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "Let" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Binds l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: ((C1 ('MetaCons "If" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "MultiIf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GuardedRhs l]))) :+: (C1 ('MetaCons "Case" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Alt l]))) :+: C1 ('MetaCons "Do" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt l])))))) :+: (((C1 ('MetaCons "MDo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt l])) :+: (C1 ('MetaCons "Tuple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Boxed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l]))) :+: C1 ('MetaCons "UnboxedSum" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: ((C1 ('MetaCons "TupleSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Boxed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Maybe (Exp l)]))) :+: C1 ('MetaCons "List" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l]))) :+: (C1 ('MetaCons "ParArray" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l])) :+: C1 ('MetaCons "Paren" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: ((C1 ('MetaCons "LeftSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QOp l)))) :+: (C1 ('MetaCons "RightSection" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QOp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "RecConstr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldUpdate l]))))) :+: ((C1 ('MetaCons "RecUpdate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldUpdate l]))) :+: C1 ('MetaCons "EnumFrom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "EnumFromTo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "EnumFromThen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))))))) :+: ((((C1 ('MetaCons "EnumFromThenTo" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "ParArrayFromTo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "ParArrayFromThenTo" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: ((C1 ('MetaCons "ListComp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [QualStmt l]))) :+: C1 ('MetaCons "ParComp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [[QualStmt l]])))) :+: (C1 ('MetaCons "ParArrayComp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [[QualStmt l]]))) :+: C1 ('MetaCons "ExpTypeSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))))) :+: ((C1 ('MetaCons "VarQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: (C1 ('MetaCons "TypQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "BracketExp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Bracket l))))) :+: ((C1 ('MetaCons "SpliceExp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Splice l))) :+: C1 ('MetaCons "QuasiQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: (C1 ('MetaCons "TypeApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :+: C1 ('MetaCons "XTag" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [XAttr l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Exp l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l])))))))) :+: (((C1 ('MetaCons "XETag" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [XAttr l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Exp l))))) :+: (C1 ('MetaCons "XPcdata" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "XExpTag" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) :+: ((C1 ('MetaCons "XChildTag" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Exp l])) :+: C1 ('MetaCons "CorePragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) :+: (C1 ('MetaCons "SCCPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "GenPragma" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Int, Int)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Int, Int)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))))) :+: ((C1 ('MetaCons "Proc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "LeftArrApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "RightArrApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: ((C1 ('MetaCons "LeftArrHighApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "RightArrHighApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) :+: (C1 ('MetaCons "ArrOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "LCase" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Alt l])))))))) |
A statement, representing both a stmt in a do
-expression,
an ordinary qual in a list comprehension, as well as a stmt
in a pattern guard.
Constructors
Generator l (Pat l) (Exp l) | a generator: pat |
Qualifier l (Exp l) | an exp by itself: in a |
LetStmt l (Binds l) | local bindings |
RecStmt l [Stmt l] | a recursive binding group for arrows |
Instances
Foldable Stmt # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Stmt m -> m foldMap :: Monoid m => (a -> m) -> Stmt a -> m foldMap' :: Monoid m => (a -> m) -> Stmt a -> m foldr :: (a -> b -> b) -> b -> Stmt a -> b foldr' :: (a -> b -> b) -> b -> Stmt a -> b foldl :: (b -> a -> b) -> b -> Stmt a -> b foldl' :: (b -> a -> b) -> b -> Stmt a -> b foldr1 :: (a -> a -> a) -> Stmt a -> a foldl1 :: (a -> a -> a) -> Stmt a -> a elem :: Eq a => a -> Stmt a -> Bool maximum :: Ord a => Stmt a -> a | |
Traversable Stmt # | |
Functor Stmt # | |
ExactP Stmt # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Stmt SrcSpanInfo -> EP () | |
AppFixity Stmt # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Stmt SrcSpanInfo -> m (Stmt SrcSpanInfo) # | |
Annotated Stmt # | |
Data l => Data (Stmt l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Stmt l -> c (Stmt l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Stmt l) dataTypeOf :: Stmt l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Stmt l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Stmt l)) gmapT :: (forall b. Data b => b -> b) -> Stmt l -> Stmt l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Stmt l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Stmt l -> r gmapQ :: (forall d. Data d => d -> u) -> Stmt l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Stmt l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) | |
Generic (Stmt l) # | |
Show l => Show (Stmt l) # | |
Eq l => Eq (Stmt l) # | |
Ord l => Ord (Stmt l) # | |
Parseable (Stmt SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Stmt SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Stmt SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Stmt SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Stmt SrcSpanInfo) | |
Pretty (Stmt l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Stmt l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Stmt l) = D1 ('MetaData "Stmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "Generator" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "Qualifier" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "LetStmt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Binds l))) :+: C1 ('MetaCons "RecStmt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt l])))) |
A general transqual in a list comprehension, which could potentially be a transform of the kind enabled by TransformListComp.
Constructors
QualStmt l (Stmt l) | an ordinary statement |
ThenTrans l (Exp l) |
|
ThenBy l (Exp l) (Exp l) |
|
GroupBy l (Exp l) |
|
GroupUsing l (Exp l) |
|
GroupByUsing l (Exp l) (Exp l) |
|
Instances
Foldable QualStmt # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualStmt m -> m foldMap :: Monoid m => (a -> m) -> QualStmt a -> m foldMap' :: Monoid m => (a -> m) -> QualStmt a -> m foldr :: (a -> b -> b) -> b -> QualStmt a -> b foldr' :: (a -> b -> b) -> b -> QualStmt a -> b foldl :: (b -> a -> b) -> b -> QualStmt a -> b foldl' :: (b -> a -> b) -> b -> QualStmt a -> b foldr1 :: (a -> a -> a) -> QualStmt a -> a foldl1 :: (a -> a -> a) -> QualStmt a -> a elem :: Eq a => a -> QualStmt a -> Bool maximum :: Ord a => QualStmt a -> a minimum :: Ord a => QualStmt a -> a | |
Traversable QualStmt # | |
Functor QualStmt # | |
ExactP QualStmt # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QualStmt SrcSpanInfo -> EP () | |
AppFixity QualStmt # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> QualStmt SrcSpanInfo -> m (QualStmt SrcSpanInfo) # | |
Annotated QualStmt # | |
Data l => Data (QualStmt l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QualStmt l -> c (QualStmt l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QualStmt l) toConstr :: QualStmt l -> Constr dataTypeOf :: QualStmt l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QualStmt l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QualStmt l)) gmapT :: (forall b. Data b => b -> b) -> QualStmt l -> QualStmt l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QualStmt l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QualStmt l -> r gmapQ :: (forall d. Data d => d -> u) -> QualStmt l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> QualStmt l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) | |
Generic (QualStmt l) # | |
Show l => Show (QualStmt l) # | |
Eq l => Eq (QualStmt l) # | |
Ord l => Ord (QualStmt l) # | |
Pretty (QualStmt l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (QualStmt l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (QualStmt l) = D1 ('MetaData "QualStmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "QualStmt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Stmt l))) :+: (C1 ('MetaCons "ThenTrans" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "ThenBy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) :+: (C1 ('MetaCons "GroupBy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: (C1 ('MetaCons "GroupUsing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "GroupByUsing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))))) |
data FieldUpdate l #
An fbind in a labeled construction or update expression.
Constructors
FieldUpdate l (QName l) (Exp l) | ordinary label-expresion pair |
FieldPun l (QName l) | record field pun |
FieldWildcard l | record field wildcard |
Instances
Foldable FieldUpdate # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldUpdate m -> m foldMap :: Monoid m => (a -> m) -> FieldUpdate a -> m foldMap' :: Monoid m => (a -> m) -> FieldUpdate a -> m foldr :: (a -> b -> b) -> b -> FieldUpdate a -> b foldr' :: (a -> b -> b) -> b -> FieldUpdate a -> b foldl :: (b -> a -> b) -> b -> FieldUpdate a -> b foldl' :: (b -> a -> b) -> b -> FieldUpdate a -> b foldr1 :: (a -> a -> a) -> FieldUpdate a -> a foldl1 :: (a -> a -> a) -> FieldUpdate a -> a toList :: FieldUpdate a -> [a] null :: FieldUpdate a -> Bool length :: FieldUpdate a -> Int elem :: Eq a => a -> FieldUpdate a -> Bool maximum :: Ord a => FieldUpdate a -> a minimum :: Ord a => FieldUpdate a -> a sum :: Num a => FieldUpdate a -> a product :: Num a => FieldUpdate a -> a | |
Traversable FieldUpdate # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> FieldUpdate a -> f (FieldUpdate b) sequenceA :: Applicative f => FieldUpdate (f a) -> f (FieldUpdate a) mapM :: Monad m => (a -> m b) -> FieldUpdate a -> m (FieldUpdate b) sequence :: Monad m => FieldUpdate (m a) -> m (FieldUpdate a) | |
Functor FieldUpdate # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> FieldUpdate a -> FieldUpdate b (<$) :: a -> FieldUpdate b -> FieldUpdate a | |
ExactP FieldUpdate # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FieldUpdate SrcSpanInfo -> EP () | |
AppFixity FieldUpdate # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> FieldUpdate SrcSpanInfo -> m (FieldUpdate SrcSpanInfo) # | |
Annotated FieldUpdate # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldUpdate l -> c (FieldUpdate l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FieldUpdate l) toConstr :: FieldUpdate l -> Constr dataTypeOf :: FieldUpdate l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FieldUpdate l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FieldUpdate l)) gmapT :: (forall b. Data b => b -> b) -> FieldUpdate l -> FieldUpdate l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldUpdate l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldUpdate l -> r gmapQ :: (forall d. Data d => d -> u) -> FieldUpdate l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldUpdate l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) | |
Generic (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (FieldUpdate l) :: Type -> Type | |
Show l => Show (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> FieldUpdate l -> ShowS show :: FieldUpdate l -> String showList :: [FieldUpdate l] -> ShowS | |
Eq l => Eq (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: FieldUpdate l -> FieldUpdate l -> Ordering (<) :: FieldUpdate l -> FieldUpdate l -> Bool (<=) :: FieldUpdate l -> FieldUpdate l -> Bool (>) :: FieldUpdate l -> FieldUpdate l -> Bool (>=) :: FieldUpdate l -> FieldUpdate l -> Bool max :: FieldUpdate l -> FieldUpdate l -> FieldUpdate l min :: FieldUpdate l -> FieldUpdate l -> FieldUpdate l | |
Pretty (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (FieldUpdate l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (FieldUpdate l) = D1 ('MetaData "FieldUpdate" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "FieldUpdate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "FieldPun" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "FieldWildcard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
An alt alternative in a case
expression.
Instances
Foldable Alt # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Alt m -> m foldMap :: Monoid m => (a -> m) -> Alt a -> m foldMap' :: Monoid m => (a -> m) -> Alt a -> m foldr :: (a -> b -> b) -> b -> Alt a -> b foldr' :: (a -> b -> b) -> b -> Alt a -> b foldl :: (b -> a -> b) -> b -> Alt a -> b foldl' :: (b -> a -> b) -> b -> Alt a -> b foldr1 :: (a -> a -> a) -> Alt a -> a foldl1 :: (a -> a -> a) -> Alt a -> a elem :: Eq a => a -> Alt a -> Bool maximum :: Ord a => Alt a -> a | |
Traversable Alt # | |
Functor Alt # | |
ExactP Alt # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Alt SrcSpanInfo -> EP () | |
AppFixity Alt # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Alt SrcSpanInfo -> m (Alt SrcSpanInfo) # | |
Annotated Alt # | |
Data l => Data (Alt l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Alt l -> c (Alt l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Alt l) dataTypeOf :: Alt l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Alt l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Alt l)) gmapT :: (forall b. Data b => b -> b) -> Alt l -> Alt l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Alt l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Alt l -> r gmapQ :: (forall d. Data d => d -> u) -> Alt l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Alt l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) | |
Generic (Alt l) # | |
Show l => Show (Alt l) # | |
Eq l => Eq (Alt l) # | |
Ord l => Ord (Alt l) # | |
Pretty (Alt l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Alt l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Alt l) = D1 ('MetaData "Alt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Alt" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Rhs l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Binds l)))))) |
An xml attribute, which is a name-expression pair.
Instances
Foldable XAttr # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XAttr m -> m foldMap :: Monoid m => (a -> m) -> XAttr a -> m foldMap' :: Monoid m => (a -> m) -> XAttr a -> m foldr :: (a -> b -> b) -> b -> XAttr a -> b foldr' :: (a -> b -> b) -> b -> XAttr a -> b foldl :: (b -> a -> b) -> b -> XAttr a -> b foldl' :: (b -> a -> b) -> b -> XAttr a -> b foldr1 :: (a -> a -> a) -> XAttr a -> a foldl1 :: (a -> a -> a) -> XAttr a -> a elem :: Eq a => a -> XAttr a -> Bool maximum :: Ord a => XAttr a -> a | |
Traversable XAttr # | |
Functor XAttr # | |
ExactP XAttr # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: XAttr SrcSpanInfo -> EP () | |
AppFixity XAttr # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> XAttr SrcSpanInfo -> m (XAttr SrcSpanInfo) # | |
Annotated XAttr # | |
Data l => Data (XAttr l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XAttr l -> c (XAttr l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (XAttr l) dataTypeOf :: XAttr l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (XAttr l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (XAttr l)) gmapT :: (forall b. Data b => b -> b) -> XAttr l -> XAttr l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XAttr l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XAttr l -> r gmapQ :: (forall d. Data d => d -> u) -> XAttr l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> XAttr l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) | |
Generic (XAttr l) # | |
Show l => Show (XAttr l) # | |
Eq l => Eq (XAttr l) # | |
Ord l => Ord (XAttr l) # | |
Pretty (XAttr l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (XAttr l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (XAttr l) = D1 ('MetaData "XAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "XAttr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) |
Patterns
A pattern, to be matched against a value.
Constructors
PVar l (Name l) | variable |
PLit l (Sign l) (Literal l) | literal constant |
PNPlusK l (Name l) Integer | n+k pattern |
PInfixApp l (Pat l) (QName l) (Pat l) | pattern with an infix data constructor |
PApp l (QName l) [Pat l] | data constructor and argument patterns |
PTuple l Boxed [Pat l] | tuple pattern |
PUnboxedSum l Int Int (Pat l) | unboxed sum |
PList l [Pat l] | list pattern |
PParen l (Pat l) | parenthesized pattern |
PRec l (QName l) [PatField l] | labelled pattern, record style |
PAsPat l (Name l) (Pat l) |
|
PWildCard l | wildcard pattern: |
PIrrPat l (Pat l) | irrefutable pattern: |
PatTypeSig l (Pat l) (Type l) | pattern with type signature |
PViewPat l (Exp l) (Pat l) | view patterns of the form |
PRPat l [RPat l] | regular list pattern |
PXTag l (XName l) [PXAttr l] (Maybe (Pat l)) [Pat l] | XML element pattern |
PXETag l (XName l) [PXAttr l] (Maybe (Pat l)) | XML singleton element pattern |
PXPcdata l String | XML PCDATA pattern |
PXPatTag l (Pat l) | XML embedded pattern |
PXRPats l [RPat l] | XML regular list pattern |
PSplice l (Splice l) | template haskell splice pattern |
PQuasiQuote l String String | quasi quote pattern: |
PBangPat l (Pat l) | strict (bang) pattern: |
Instances
Foldable Pat # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Pat m -> m foldMap :: Monoid m => (a -> m) -> Pat a -> m foldMap' :: Monoid m => (a -> m) -> Pat a -> m foldr :: (a -> b -> b) -> b -> Pat a -> b foldr' :: (a -> b -> b) -> b -> Pat a -> b foldl :: (b -> a -> b) -> b -> Pat a -> b foldl' :: (b -> a -> b) -> b -> Pat a -> b foldr1 :: (a -> a -> a) -> Pat a -> a foldl1 :: (a -> a -> a) -> Pat a -> a elem :: Eq a => a -> Pat a -> Bool maximum :: Ord a => Pat a -> a | |
Traversable Pat # | |
Functor Pat # | |
ExactP Pat # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Pat SrcSpanInfo -> EP () | |
AppFixity Pat # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Pat SrcSpanInfo -> m (Pat SrcSpanInfo) # | |
Annotated Pat # | |
Data l => Data (Pat l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pat l -> c (Pat l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pat l) dataTypeOf :: Pat l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Pat l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pat l)) gmapT :: (forall b. Data b => b -> b) -> Pat l -> Pat l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pat l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pat l -> r gmapQ :: (forall d. Data d => d -> u) -> Pat l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Pat l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) | |
Generic (Pat l) # | |
Show l => Show (Pat l) # | |
Eq l => Eq (Pat l) # | |
Ord l => Ord (Pat l) # | |
Parseable (Pat SrcSpanInfo) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Pat SrcSpanInfo) # parseWithMode :: ParseMode -> String -> ParseResult (Pat SrcSpanInfo) # parseWithComments :: ParseMode -> String -> ParseResult (Pat SrcSpanInfo, [Comment]) # parser :: Maybe [Fixity] -> P (Pat SrcSpanInfo) | |
Pretty (Pat l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Pat l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Pat l) = D1 ('MetaData "Pat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((((C1 ('MetaCons "PVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: (C1 ('MetaCons "PLit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Sign l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Literal l)))) :+: C1 ('MetaCons "PNPlusK" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer))))) :+: (C1 ('MetaCons "PInfixApp" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))) :+: (C1 ('MetaCons "PApp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l]))) :+: C1 ('MetaCons "PTuple" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Boxed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l])))))) :+: ((C1 ('MetaCons "PUnboxedSum" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))) :+: (C1 ('MetaCons "PList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l])) :+: C1 ('MetaCons "PParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))))) :+: (C1 ('MetaCons "PRec" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [PatField l]))) :+: (C1 ('MetaCons "PAsPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))) :+: C1 ('MetaCons "PWildCard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))))) :+: (((C1 ('MetaCons "PIrrPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :+: (C1 ('MetaCons "PatTypeSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l)))) :+: C1 ('MetaCons "PViewPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))))) :+: (C1 ('MetaCons "PRPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [RPat l])) :+: (C1 ('MetaCons "PXTag" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [PXAttr l]) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Pat l))) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Pat l])))) :+: C1 ('MetaCons "PXETag" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [PXAttr l]) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Pat l)))))))) :+: ((C1 ('MetaCons "PXPcdata" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: (C1 ('MetaCons "PXPatTag" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :+: C1 ('MetaCons "PXRPats" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [RPat l])))) :+: (C1 ('MetaCons "PSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Splice l))) :+: (C1 ('MetaCons "PQuasiQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "PBangPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))))))) |
An fpat in a labeled record pattern.
Constructors
PFieldPat l (QName l) (Pat l) | ordinary label-pattern pair |
PFieldPun l (QName l) | record field pun |
PFieldWildcard l | record field wildcard |
Instances
Foldable PatField # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatField m -> m foldMap :: Monoid m => (a -> m) -> PatField a -> m foldMap' :: Monoid m => (a -> m) -> PatField a -> m foldr :: (a -> b -> b) -> b -> PatField a -> b foldr' :: (a -> b -> b) -> b -> PatField a -> b foldl :: (b -> a -> b) -> b -> PatField a -> b foldl' :: (b -> a -> b) -> b -> PatField a -> b foldr1 :: (a -> a -> a) -> PatField a -> a foldl1 :: (a -> a -> a) -> PatField a -> a elem :: Eq a => a -> PatField a -> Bool maximum :: Ord a => PatField a -> a minimum :: Ord a => PatField a -> a | |
Traversable PatField # | |
Functor PatField # | |
ExactP PatField # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: PatField SrcSpanInfo -> EP () | |
AppFixity PatField # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PatField SrcSpanInfo -> m (PatField SrcSpanInfo) # | |
Annotated PatField # | |
Data l => Data (PatField l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PatField l -> c (PatField l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PatField l) toConstr :: PatField l -> Constr dataTypeOf :: PatField l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PatField l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PatField l)) gmapT :: (forall b. Data b => b -> b) -> PatField l -> PatField l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatField l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatField l -> r gmapQ :: (forall d. Data d => d -> u) -> PatField l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> PatField l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) | |
Generic (PatField l) # | |
Show l => Show (PatField l) # | |
Eq l => Eq (PatField l) # | |
Ord l => Ord (PatField l) # | |
Pretty (PatField l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (PatField l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (PatField l) = D1 ('MetaData "PatField" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "PFieldPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))) :+: (C1 ('MetaCons "PFieldPun" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "PFieldWildcard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
An XML attribute in a pattern.
Instances
Foldable PXAttr # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PXAttr m -> m foldMap :: Monoid m => (a -> m) -> PXAttr a -> m foldMap' :: Monoid m => (a -> m) -> PXAttr a -> m foldr :: (a -> b -> b) -> b -> PXAttr a -> b foldr' :: (a -> b -> b) -> b -> PXAttr a -> b foldl :: (b -> a -> b) -> b -> PXAttr a -> b foldl' :: (b -> a -> b) -> b -> PXAttr a -> b foldr1 :: (a -> a -> a) -> PXAttr a -> a foldl1 :: (a -> a -> a) -> PXAttr a -> a elem :: Eq a => a -> PXAttr a -> Bool maximum :: Ord a => PXAttr a -> a | |
Traversable PXAttr # | |
Functor PXAttr # | |
ExactP PXAttr # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: PXAttr SrcSpanInfo -> EP () | |
AppFixity PXAttr # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PXAttr SrcSpanInfo -> m (PXAttr SrcSpanInfo) # | |
Annotated PXAttr # | |
Data l => Data (PXAttr l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PXAttr l -> c (PXAttr l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PXAttr l) toConstr :: PXAttr l -> Constr dataTypeOf :: PXAttr l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PXAttr l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PXAttr l)) gmapT :: (forall b. Data b => b -> b) -> PXAttr l -> PXAttr l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PXAttr l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PXAttr l -> r gmapQ :: (forall d. Data d => d -> u) -> PXAttr l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> PXAttr l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) | |
Generic (PXAttr l) # | |
Show l => Show (PXAttr l) # | |
Eq l => Eq (PXAttr l) # | |
Ord l => Ord (PXAttr l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (PXAttr l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (PXAttr l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (PXAttr l) = D1 ('MetaData "PXAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "PXAttr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (XName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))))) |
An entity in a regular pattern.
Constructors
RPOp l (RPat l) (RPatOp l) | operator pattern, e.g. pat* |
RPEither l (RPat l) (RPat l) | choice pattern, e.g. (1 | 2) |
RPSeq l [RPat l] | sequence pattern, e.g. (| 1, 2, 3 |) |
RPGuard l (Pat l) [Stmt l] | guarded pattern, e.g. (| p | p < 3 |) |
RPCAs l (Name l) (RPat l) | non-linear variable binding, e.g. (foo@:(1 | 2))* |
RPAs l (Name l) (RPat l) | linear variable binding, e.g. foo@(1 | 2) |
RPParen l (RPat l) | parenthesised pattern, e.g. (2*) |
RPPat l (Pat l) | an ordinary pattern |
Instances
Foldable RPat # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPat m -> m foldMap :: Monoid m => (a -> m) -> RPat a -> m foldMap' :: Monoid m => (a -> m) -> RPat a -> m foldr :: (a -> b -> b) -> b -> RPat a -> b foldr' :: (a -> b -> b) -> b -> RPat a -> b foldl :: (b -> a -> b) -> b -> RPat a -> b foldl' :: (b -> a -> b) -> b -> RPat a -> b foldr1 :: (a -> a -> a) -> RPat a -> a foldl1 :: (a -> a -> a) -> RPat a -> a elem :: Eq a => a -> RPat a -> Bool maximum :: Ord a => RPat a -> a | |
Traversable RPat # | |
Functor RPat # | |
ExactP RPat # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RPat SrcSpanInfo -> EP () | |
AppFixity RPat # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> RPat SrcSpanInfo -> m (RPat SrcSpanInfo) # | |
Annotated RPat # | |
Data l => Data (RPat l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RPat l -> c (RPat l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RPat l) dataTypeOf :: RPat l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RPat l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RPat l)) gmapT :: (forall b. Data b => b -> b) -> RPat l -> RPat l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RPat l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RPat l -> r gmapQ :: (forall d. Data d => d -> u) -> RPat l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> RPat l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) | |
Generic (RPat l) # | |
Show l => Show (RPat l) # | |
Eq l => Eq (RPat l) # | |
Ord l => Ord (RPat l) # | |
Pretty (RPat l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (RPat l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (RPat l) = D1 ('MetaData "RPat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (((C1 ('MetaCons "RPOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPatOp l)))) :+: C1 ('MetaCons "RPEither" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l))))) :+: (C1 ('MetaCons "RPSeq" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [RPat l])) :+: C1 ('MetaCons "RPGuard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Stmt l]))))) :+: ((C1 ('MetaCons "RPCAs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l)))) :+: C1 ('MetaCons "RPAs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l))))) :+: (C1 ('MetaCons "RPParen" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (RPat l))) :+: C1 ('MetaCons "RPPat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l)))))) |
A regular pattern operator.
Constructors
RPStar l |
|
RPStarG l |
|
RPPlus l |
|
RPPlusG l |
|
RPOpt l |
|
RPOptG l |
|
Instances
Foldable RPatOp # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPatOp m -> m foldMap :: Monoid m => (a -> m) -> RPatOp a -> m foldMap' :: Monoid m => (a -> m) -> RPatOp a -> m foldr :: (a -> b -> b) -> b -> RPatOp a -> b foldr' :: (a -> b -> b) -> b -> RPatOp a -> b foldl :: (b -> a -> b) -> b -> RPatOp a -> b foldl' :: (b -> a -> b) -> b -> RPatOp a -> b foldr1 :: (a -> a -> a) -> RPatOp a -> a foldl1 :: (a -> a -> a) -> RPatOp a -> a elem :: Eq a => a -> RPatOp a -> Bool maximum :: Ord a => RPatOp a -> a | |
Traversable RPatOp # | |
Functor RPatOp # | |
ExactP RPatOp # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RPatOp SrcSpanInfo -> EP () | |
Annotated RPatOp # | |
Data l => Data (RPatOp l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RPatOp l -> c (RPatOp l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RPatOp l) toConstr :: RPatOp l -> Constr dataTypeOf :: RPatOp l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RPatOp l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RPatOp l)) gmapT :: (forall b. Data b => b -> b) -> RPatOp l -> RPatOp l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RPatOp l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RPatOp l -> r gmapQ :: (forall d. Data d => d -> u) -> RPatOp l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> RPatOp l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) | |
Generic (RPatOp l) # | |
Show l => Show (RPatOp l) # | |
Eq l => Eq (RPatOp l) # | |
Ord l => Ord (RPatOp l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (RPatOp l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (RPatOp l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (RPatOp l) = D1 ('MetaData "RPatOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "RPStar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "RPStarG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "RPPlus" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) :+: (C1 ('MetaCons "RPPlusG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "RPOpt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "RPOptG" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))))) |
Literals
literal
Values of this type hold the abstract value of the literal, along with the
precise string representation used. For example, 10
, 0o12
and 0xa
have the same value representation, but each carry a different string representation.
Constructors
Char l Char String | character literal |
String l String String | string literal |
Int l Integer String | integer literal |
Frac l Rational String | floating point literal |
PrimInt l Integer String | unboxed integer literal |
PrimWord l Integer String | unboxed word literal |
PrimFloat l Rational String | unboxed float literal |
PrimDouble l Rational String | unboxed double literal |
PrimChar l Char String | unboxed character literal |
PrimString l String String | unboxed string literal |
Instances
Foldable Literal # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Literal m -> m foldMap :: Monoid m => (a -> m) -> Literal a -> m foldMap' :: Monoid m => (a -> m) -> Literal a -> m foldr :: (a -> b -> b) -> b -> Literal a -> b foldr' :: (a -> b -> b) -> b -> Literal a -> b foldl :: (b -> a -> b) -> b -> Literal a -> b foldl' :: (b -> a -> b) -> b -> Literal a -> b foldr1 :: (a -> a -> a) -> Literal a -> a foldl1 :: (a -> a -> a) -> Literal a -> a elem :: Eq a => a -> Literal a -> Bool maximum :: Ord a => Literal a -> a minimum :: Ord a => Literal a -> a | |
Traversable Literal # | |
Functor Literal # | |
ExactP Literal # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Literal SrcSpanInfo -> EP () | |
Annotated Literal # | |
Data l => Data (Literal l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Literal l -> c (Literal l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Literal l) toConstr :: Literal l -> Constr dataTypeOf :: Literal l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Literal l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Literal l)) gmapT :: (forall b. Data b => b -> b) -> Literal l -> Literal l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Literal l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Literal l -> r gmapQ :: (forall d. Data d => d -> u) -> Literal l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Literal l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) | |
Generic (Literal l) # | |
Show l => Show (Literal l) # | |
Eq l => Eq (Literal l) # | |
Ord l => Ord (Literal l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Literal l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Literal l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Literal l) = D1 ('MetaData "Literal" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (((C1 ('MetaCons "Char" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Char) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "String" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: (C1 ('MetaCons "Int" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "Frac" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "PrimInt" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))))) :+: ((C1 ('MetaCons "PrimWord" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Integer) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "PrimFloat" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) :+: (C1 ('MetaCons "PrimDouble" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Rational) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "PrimChar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Char) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "PrimString" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))))))) |
An indication whether a literal pattern has been negated or not.
Instances
Foldable Sign # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Sign m -> m foldMap :: Monoid m => (a -> m) -> Sign a -> m foldMap' :: Monoid m => (a -> m) -> Sign a -> m foldr :: (a -> b -> b) -> b -> Sign a -> b foldr' :: (a -> b -> b) -> b -> Sign a -> b foldl :: (b -> a -> b) -> b -> Sign a -> b foldl' :: (b -> a -> b) -> b -> Sign a -> b foldr1 :: (a -> a -> a) -> Sign a -> a foldl1 :: (a -> a -> a) -> Sign a -> a elem :: Eq a => a -> Sign a -> Bool maximum :: Ord a => Sign a -> a | |
Traversable Sign # | |
Functor Sign # | |
ExactP Sign # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Sign SrcSpanInfo -> EP () | |
Annotated Sign # | |
Data l => Data (Sign l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Sign l -> c (Sign l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Sign l) dataTypeOf :: Sign l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Sign l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Sign l)) gmapT :: (forall b. Data b => b -> b) -> Sign l -> Sign l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign l -> r gmapQ :: (forall d. Data d => d -> u) -> Sign l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Sign l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) | |
Generic (Sign l) # | |
Show l => Show (Sign l) # | |
Eq l => Eq (Sign l) # | |
Ord l => Ord (Sign l) # | |
type Rep (Sign l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Sign l) = D1 ('MetaData "Sign" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Signless" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "Negative" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) |
Variables, Constructors and Operators
data ModuleName l #
The name of a Haskell module.
Constructors
ModuleName l String |
Instances
Foldable ModuleName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleName m -> m foldMap :: Monoid m => (a -> m) -> ModuleName a -> m foldMap' :: Monoid m => (a -> m) -> ModuleName a -> m foldr :: (a -> b -> b) -> b -> ModuleName a -> b foldr' :: (a -> b -> b) -> b -> ModuleName a -> b foldl :: (b -> a -> b) -> b -> ModuleName a -> b foldl' :: (b -> a -> b) -> b -> ModuleName a -> b foldr1 :: (a -> a -> a) -> ModuleName a -> a foldl1 :: (a -> a -> a) -> ModuleName a -> a toList :: ModuleName a -> [a] null :: ModuleName a -> Bool length :: ModuleName a -> Int elem :: Eq a => a -> ModuleName a -> Bool maximum :: Ord a => ModuleName a -> a minimum :: Ord a => ModuleName a -> a sum :: Num a => ModuleName a -> a product :: Num a => ModuleName a -> a | |
Traversable ModuleName # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModuleName a -> f (ModuleName b) sequenceA :: Applicative f => ModuleName (f a) -> f (ModuleName a) mapM :: Monad m => (a -> m b) -> ModuleName a -> m (ModuleName b) sequence :: Monad m => ModuleName (m a) -> m (ModuleName a) | |
Functor ModuleName # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP ModuleName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModuleName SrcSpanInfo -> EP () | |
Annotated ModuleName # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleName l -> c (ModuleName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModuleName l) toConstr :: ModuleName l -> Constr dataTypeOf :: ModuleName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModuleName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModuleName l)) gmapT :: (forall b. Data b => b -> b) -> ModuleName l -> ModuleName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName l -> r gmapQ :: (forall d. Data d => d -> u) -> ModuleName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) | |
Generic (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ModuleName l) :: Type -> Type | |
Show l => Show (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModuleName l -> ShowS show :: ModuleName l -> String showList :: [ModuleName l] -> ShowS | |
Eq l => Eq (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ModuleName l -> ModuleName l -> Ordering (<) :: ModuleName l -> ModuleName l -> Bool (<=) :: ModuleName l -> ModuleName l -> Bool (>) :: ModuleName l -> ModuleName l -> Bool (>=) :: ModuleName l -> ModuleName l -> Bool max :: ModuleName l -> ModuleName l -> ModuleName l min :: ModuleName l -> ModuleName l -> ModuleName l | |
Pretty (ModuleName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ModuleName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ModuleName l) = D1 ('MetaData "ModuleName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ModuleName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
This type is used to represent qualified variables, and also qualified constructors.
Constructors
Qual l (ModuleName l) (Name l) | name qualified with a module name |
UnQual l (Name l) | unqualified local name |
Special l (SpecialCon l) | built-in constructor with special syntax |
Instances
Foldable QName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QName m -> m foldMap :: Monoid m => (a -> m) -> QName a -> m foldMap' :: Monoid m => (a -> m) -> QName a -> m foldr :: (a -> b -> b) -> b -> QName a -> b foldr' :: (a -> b -> b) -> b -> QName a -> b foldl :: (b -> a -> b) -> b -> QName a -> b foldl' :: (b -> a -> b) -> b -> QName a -> b foldr1 :: (a -> a -> a) -> QName a -> a foldl1 :: (a -> a -> a) -> QName a -> a elem :: Eq a => a -> QName a -> Bool maximum :: Ord a => QName a -> a | |
Traversable QName # | |
Functor QName # | |
ExactP QName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QName SrcSpanInfo -> EP () | |
Annotated QName # | |
Data l => Data (QName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QName l -> c (QName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QName l) dataTypeOf :: QName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QName l)) gmapT :: (forall b. Data b => b -> b) -> QName l -> QName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QName l -> r gmapQ :: (forall d. Data d => d -> u) -> QName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> QName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) | |
Generic (QName l) # | |
Show l => Show (QName l) # | |
Eq l => Eq (QName l) # | |
Ord l => Ord (QName l) # | |
Pretty (QName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (QName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (QName l) = D1 ('MetaData "QName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Qual" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ModuleName l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)))) :+: (C1 ('MetaCons "UnQual" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "Special" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SpecialCon l))))) |
This type is used to represent variables, and also constructors.
Instances
Foldable Name # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Name m -> m foldMap :: Monoid m => (a -> m) -> Name a -> m foldMap' :: Monoid m => (a -> m) -> Name a -> m foldr :: (a -> b -> b) -> b -> Name a -> b foldr' :: (a -> b -> b) -> b -> Name a -> b foldl :: (b -> a -> b) -> b -> Name a -> b foldl' :: (b -> a -> b) -> b -> Name a -> b foldr1 :: (a -> a -> a) -> Name a -> a foldl1 :: (a -> a -> a) -> Name a -> a elem :: Eq a => a -> Name a -> Bool maximum :: Ord a => Name a -> a | |
Traversable Name # | |
Functor Name # | |
ExactP Name # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Name SrcSpanInfo -> EP () | |
Annotated Name # | |
Data l => Data (Name l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name l -> c (Name l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Name l) dataTypeOf :: Name l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Name l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Name l)) gmapT :: (forall b. Data b => b -> b) -> Name l -> Name l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name l -> r gmapQ :: (forall d. Data d => d -> u) -> Name l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Name l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) | |
Generic (Name l) # | |
Show l => Show (Name l) # | |
Eq l => Eq (Name l) # | |
Ord l => Ord (Name l) # | |
Pretty (Name l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Name l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Name l) = D1 ('MetaData "Name" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Ident" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "Symbol" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
Possibly qualified infix operators (qop), appearing in expressions.
Constructors
QVarOp l (QName l) | variable operator (qvarop) |
QConOp l (QName l) | constructor operator (qconop) |
Instances
Foldable QOp # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QOp m -> m foldMap :: Monoid m => (a -> m) -> QOp a -> m foldMap' :: Monoid m => (a -> m) -> QOp a -> m foldr :: (a -> b -> b) -> b -> QOp a -> b foldr' :: (a -> b -> b) -> b -> QOp a -> b foldl :: (b -> a -> b) -> b -> QOp a -> b foldl' :: (b -> a -> b) -> b -> QOp a -> b foldr1 :: (a -> a -> a) -> QOp a -> a foldl1 :: (a -> a -> a) -> QOp a -> a elem :: Eq a => a -> QOp a -> Bool maximum :: Ord a => QOp a -> a | |
Traversable QOp # | |
Functor QOp # | |
ExactP QOp # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QOp SrcSpanInfo -> EP () | |
Annotated QOp # | |
Data l => Data (QOp l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QOp l -> c (QOp l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QOp l) dataTypeOf :: QOp l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QOp l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QOp l)) gmapT :: (forall b. Data b => b -> b) -> QOp l -> QOp l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QOp l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QOp l -> r gmapQ :: (forall d. Data d => d -> u) -> QOp l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> QOp l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) | |
Generic (QOp l) # | |
Show l => Show (QOp l) # | |
Eq l => Eq (QOp l) # | |
Ord l => Ord (QOp l) # | |
Pretty (QOp l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (QOp l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (QOp l) = D1 ('MetaData "QOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "QVarOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "QConOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)))) |
Operators appearing in infix
declarations are never qualified.
Instances
Foldable Op # | |
Defined in Language.Haskell.Exts.Syntax Methods foldMap :: Monoid m => (a -> m) -> Op a -> m foldMap' :: Monoid m => (a -> m) -> Op a -> m foldr :: (a -> b -> b) -> b -> Op a -> b foldr' :: (a -> b -> b) -> b -> Op a -> b foldl :: (b -> a -> b) -> b -> Op a -> b foldl' :: (b -> a -> b) -> b -> Op a -> b foldr1 :: (a -> a -> a) -> Op a -> a foldl1 :: (a -> a -> a) -> Op a -> a | |
Traversable Op # | |
Functor Op # | |
ExactP Op # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Op SrcSpanInfo -> EP () | |
Annotated Op # | |
Data l => Data (Op l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Op l -> c (Op l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Op l) dataTypeOf :: Op l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Op l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Op l)) gmapT :: (forall b. Data b => b -> b) -> Op l -> Op l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Op l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Op l -> r gmapQ :: (forall d. Data d => d -> u) -> Op l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Op l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) | |
Generic (Op l) # | |
Show l => Show (Op l) # | |
Eq l => Eq (Op l) # | |
Ord l => Ord (Op l) # | |
Pretty (Op l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Op l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Op l) = D1 ('MetaData "Op" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "VarOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "ConOp" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)))) |
data SpecialCon l #
Constructors with special syntax. These names are never qualified, and always refer to builtin type or data constructors.
Constructors
UnitCon l | unit type and data constructor |
ListCon l | list type and data constructor |
FunCon l | function type constructor |
TupleCon l Boxed Int | n-ary tuple type and data
constructors |
Cons l | list data constructor |
UnboxedSingleCon l | unboxed singleton tuple constructor |
ExprHole l | An expression hole _ |
Instances
Foldable SpecialCon # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => SpecialCon m -> m foldMap :: Monoid m => (a -> m) -> SpecialCon a -> m foldMap' :: Monoid m => (a -> m) -> SpecialCon a -> m foldr :: (a -> b -> b) -> b -> SpecialCon a -> b foldr' :: (a -> b -> b) -> b -> SpecialCon a -> b foldl :: (b -> a -> b) -> b -> SpecialCon a -> b foldl' :: (b -> a -> b) -> b -> SpecialCon a -> b foldr1 :: (a -> a -> a) -> SpecialCon a -> a foldl1 :: (a -> a -> a) -> SpecialCon a -> a toList :: SpecialCon a -> [a] null :: SpecialCon a -> Bool length :: SpecialCon a -> Int elem :: Eq a => a -> SpecialCon a -> Bool maximum :: Ord a => SpecialCon a -> a minimum :: Ord a => SpecialCon a -> a sum :: Num a => SpecialCon a -> a product :: Num a => SpecialCon a -> a | |
Traversable SpecialCon # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> SpecialCon a -> f (SpecialCon b) sequenceA :: Applicative f => SpecialCon (f a) -> f (SpecialCon a) mapM :: Monad m => (a -> m b) -> SpecialCon a -> m (SpecialCon b) sequence :: Monad m => SpecialCon (m a) -> m (SpecialCon a) | |
Functor SpecialCon # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP SpecialCon # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: SpecialCon SrcSpanInfo -> EP () | |
Annotated SpecialCon # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpecialCon l -> c (SpecialCon l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SpecialCon l) toConstr :: SpecialCon l -> Constr dataTypeOf :: SpecialCon l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SpecialCon l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SpecialCon l)) gmapT :: (forall b. Data b => b -> b) -> SpecialCon l -> SpecialCon l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpecialCon l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpecialCon l -> r gmapQ :: (forall d. Data d => d -> u) -> SpecialCon l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> SpecialCon l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) | |
Generic (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (SpecialCon l) :: Type -> Type | |
Show l => Show (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> SpecialCon l -> ShowS show :: SpecialCon l -> String showList :: [SpecialCon l] -> ShowS | |
Eq l => Eq (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: SpecialCon l -> SpecialCon l -> Ordering (<) :: SpecialCon l -> SpecialCon l -> Bool (<=) :: SpecialCon l -> SpecialCon l -> Bool (>) :: SpecialCon l -> SpecialCon l -> Bool (>=) :: SpecialCon l -> SpecialCon l -> Bool max :: SpecialCon l -> SpecialCon l -> SpecialCon l min :: SpecialCon l -> SpecialCon l -> SpecialCon l | |
Pretty (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (SpecialCon l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (SpecialCon l) = D1 ('MetaData "SpecialCon" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "UnitCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "ListCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "FunCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) :+: ((C1 ('MetaCons "TupleCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Boxed) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) :+: C1 ('MetaCons "Cons" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "UnboxedSingleCon" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "ExprHole" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))))) |
A name (cname) of a component of a class or data type in an import
or export specification.
Instances
Foldable CName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CName m -> m foldMap :: Monoid m => (a -> m) -> CName a -> m foldMap' :: Monoid m => (a -> m) -> CName a -> m foldr :: (a -> b -> b) -> b -> CName a -> b foldr' :: (a -> b -> b) -> b -> CName a -> b foldl :: (b -> a -> b) -> b -> CName a -> b foldl' :: (b -> a -> b) -> b -> CName a -> b foldr1 :: (a -> a -> a) -> CName a -> a foldl1 :: (a -> a -> a) -> CName a -> a elem :: Eq a => a -> CName a -> Bool maximum :: Ord a => CName a -> a | |
Traversable CName # | |
Functor CName # | |
ExactP CName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: CName SrcSpanInfo -> EP () | |
Annotated CName # | |
Data l => Data (CName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CName l -> c (CName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CName l) dataTypeOf :: CName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CName l)) gmapT :: (forall b. Data b => b -> b) -> CName l -> CName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CName l -> r gmapQ :: (forall d. Data d => d -> u) -> CName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> CName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) | |
Generic (CName l) # | |
Show l => Show (CName l) # | |
Eq l => Eq (CName l) # | |
Ord l => Ord (CName l) # | |
Pretty (CName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (CName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (CName l) = D1 ('MetaData "CName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "VarName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "ConName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)))) |
An implicit parameter name.
Constructors
IPDup l String | ?ident, non-linear implicit parameter |
IPLin l String | %ident, linear implicit parameter |
Instances
Foldable IPName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPName m -> m foldMap :: Monoid m => (a -> m) -> IPName a -> m foldMap' :: Monoid m => (a -> m) -> IPName a -> m foldr :: (a -> b -> b) -> b -> IPName a -> b foldr' :: (a -> b -> b) -> b -> IPName a -> b foldl :: (b -> a -> b) -> b -> IPName a -> b foldl' :: (b -> a -> b) -> b -> IPName a -> b foldr1 :: (a -> a -> a) -> IPName a -> a foldl1 :: (a -> a -> a) -> IPName a -> a elem :: Eq a => a -> IPName a -> Bool maximum :: Ord a => IPName a -> a | |
Traversable IPName # | |
Functor IPName # | |
ExactP IPName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: IPName SrcSpanInfo -> EP () | |
Annotated IPName # | |
Data l => Data (IPName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IPName l -> c (IPName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IPName l) toConstr :: IPName l -> Constr dataTypeOf :: IPName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IPName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IPName l)) gmapT :: (forall b. Data b => b -> b) -> IPName l -> IPName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IPName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IPName l -> r gmapQ :: (forall d. Data d => d -> u) -> IPName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> IPName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) | |
Generic (IPName l) # | |
Show l => Show (IPName l) # | |
Eq l => Eq (IPName l) # | |
Ord l => Ord (IPName l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (IPName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (IPName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (IPName l) = D1 ('MetaData "IPName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "IPDup" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "IPLin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) |
The name of an xml element or attribute, possibly qualified with a namespace.
Instances
Foldable XName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XName m -> m foldMap :: Monoid m => (a -> m) -> XName a -> m foldMap' :: Monoid m => (a -> m) -> XName a -> m foldr :: (a -> b -> b) -> b -> XName a -> b foldr' :: (a -> b -> b) -> b -> XName a -> b foldl :: (b -> a -> b) -> b -> XName a -> b foldl' :: (b -> a -> b) -> b -> XName a -> b foldr1 :: (a -> a -> a) -> XName a -> a foldl1 :: (a -> a -> a) -> XName a -> a elem :: Eq a => a -> XName a -> Bool maximum :: Ord a => XName a -> a | |
Traversable XName # | |
Functor XName # | |
ExactP XName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: XName SrcSpanInfo -> EP () | |
Annotated XName # | |
Data l => Data (XName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XName l -> c (XName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (XName l) dataTypeOf :: XName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (XName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (XName l)) gmapT :: (forall b. Data b => b -> b) -> XName l -> XName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XName l -> r gmapQ :: (forall d. Data d => d -> u) -> XName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> XName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) | |
Generic (XName l) # | |
Show l => Show (XName l) # | |
Eq l => Eq (XName l) # | |
Ord l => Ord (XName l) # | |
Pretty (XName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (XName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (XName l) = D1 ('MetaData "XName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "XName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "XDomName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)))) |
Constructors
Nominal l | |
Representational l | |
Phantom l | |
RoleWildcard l |
Instances
Foldable Role # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Role m -> m foldMap :: Monoid m => (a -> m) -> Role a -> m foldMap' :: Monoid m => (a -> m) -> Role a -> m foldr :: (a -> b -> b) -> b -> Role a -> b foldr' :: (a -> b -> b) -> b -> Role a -> b foldl :: (b -> a -> b) -> b -> Role a -> b foldl' :: (b -> a -> b) -> b -> Role a -> b foldr1 :: (a -> a -> a) -> Role a -> a foldl1 :: (a -> a -> a) -> Role a -> a elem :: Eq a => a -> Role a -> Bool maximum :: Ord a => Role a -> a | |
Traversable Role # | |
Functor Role # | |
ExactP Role # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Role SrcSpanInfo -> EP () | |
Annotated Role # | |
Data l => Data (Role l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role l -> c (Role l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Role l) dataTypeOf :: Role l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Role l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Role l)) gmapT :: (forall b. Data b => b -> b) -> Role l -> Role l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role l -> r gmapQ :: (forall d. Data d => d -> u) -> Role l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Role l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) | |
Generic (Role l) # | |
Show l => Show (Role l) # | |
Eq l => Eq (Role l) # | |
Ord l => Ord (Role l) # | |
Pretty (Role l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Role l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Role l) = D1 ('MetaData "Role" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "Nominal" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "Representational" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "Phantom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "RoleWildcard" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
data MaybePromotedName l #
Constructors
PromotedName l (QName l) | |
UnpromotedName l (QName l) |
Instances
Foldable MaybePromotedName # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => MaybePromotedName m -> m foldMap :: Monoid m => (a -> m) -> MaybePromotedName a -> m foldMap' :: Monoid m => (a -> m) -> MaybePromotedName a -> m foldr :: (a -> b -> b) -> b -> MaybePromotedName a -> b foldr' :: (a -> b -> b) -> b -> MaybePromotedName a -> b foldl :: (b -> a -> b) -> b -> MaybePromotedName a -> b foldl' :: (b -> a -> b) -> b -> MaybePromotedName a -> b foldr1 :: (a -> a -> a) -> MaybePromotedName a -> a foldl1 :: (a -> a -> a) -> MaybePromotedName a -> a toList :: MaybePromotedName a -> [a] null :: MaybePromotedName a -> Bool length :: MaybePromotedName a -> Int elem :: Eq a => a -> MaybePromotedName a -> Bool maximum :: Ord a => MaybePromotedName a -> a minimum :: Ord a => MaybePromotedName a -> a sum :: Num a => MaybePromotedName a -> a product :: Num a => MaybePromotedName a -> a | |
Traversable MaybePromotedName # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> MaybePromotedName a -> f (MaybePromotedName b) sequenceA :: Applicative f => MaybePromotedName (f a) -> f (MaybePromotedName a) mapM :: Monad m => (a -> m b) -> MaybePromotedName a -> m (MaybePromotedName b) sequence :: Monad m => MaybePromotedName (m a) -> m (MaybePromotedName a) | |
Functor MaybePromotedName # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> MaybePromotedName a -> MaybePromotedName b (<$) :: a -> MaybePromotedName b -> MaybePromotedName a | |
ExactP MaybePromotedName # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: MaybePromotedName SrcSpanInfo -> EP () | |
Annotated MaybePromotedName # | |
Defined in Language.Haskell.Exts.Syntax Methods ann :: MaybePromotedName l -> l # amap :: (l -> l) -> MaybePromotedName l -> MaybePromotedName l # | |
Data l => Data (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MaybePromotedName l -> c (MaybePromotedName l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MaybePromotedName l) toConstr :: MaybePromotedName l -> Constr dataTypeOf :: MaybePromotedName l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (MaybePromotedName l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MaybePromotedName l)) gmapT :: (forall b. Data b => b -> b) -> MaybePromotedName l -> MaybePromotedName l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MaybePromotedName l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MaybePromotedName l -> r gmapQ :: (forall d. Data d => d -> u) -> MaybePromotedName l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> MaybePromotedName l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) | |
Generic (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (MaybePromotedName l) :: Type -> Type Methods from :: MaybePromotedName l -> Rep (MaybePromotedName l) x to :: Rep (MaybePromotedName l) x -> MaybePromotedName l | |
Show l => Show (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> MaybePromotedName l -> ShowS show :: MaybePromotedName l -> String showList :: [MaybePromotedName l] -> ShowS | |
Eq l => Eq (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: MaybePromotedName l -> MaybePromotedName l -> Bool (/=) :: MaybePromotedName l -> MaybePromotedName l -> Bool | |
Ord l => Ord (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: MaybePromotedName l -> MaybePromotedName l -> Ordering (<) :: MaybePromotedName l -> MaybePromotedName l -> Bool (<=) :: MaybePromotedName l -> MaybePromotedName l -> Bool (>) :: MaybePromotedName l -> MaybePromotedName l -> Bool (>=) :: MaybePromotedName l -> MaybePromotedName l -> Bool max :: MaybePromotedName l -> MaybePromotedName l -> MaybePromotedName l min :: MaybePromotedName l -> MaybePromotedName l -> MaybePromotedName l | |
Pretty (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (MaybePromotedName l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (MaybePromotedName l) = D1 ('MetaData "MaybePromotedName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "PromotedName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l))) :+: C1 ('MetaCons "UnpromotedName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (QName l)))) |
Template Haskell
A template haskell bracket expression.
Constructors
ExpBracket l (Exp l) | expression bracket: |
TExpBracket l (Exp l) | typed expression bracket: |
PatBracket l (Pat l) | pattern bracket: |
TypeBracket l (Type l) | type bracket: |
DeclBracket l [Decl l] | declaration bracket: |
Instances
Foldable Bracket # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Bracket m -> m foldMap :: Monoid m => (a -> m) -> Bracket a -> m foldMap' :: Monoid m => (a -> m) -> Bracket a -> m foldr :: (a -> b -> b) -> b -> Bracket a -> b foldr' :: (a -> b -> b) -> b -> Bracket a -> b foldl :: (b -> a -> b) -> b -> Bracket a -> b foldl' :: (b -> a -> b) -> b -> Bracket a -> b foldr1 :: (a -> a -> a) -> Bracket a -> a foldl1 :: (a -> a -> a) -> Bracket a -> a elem :: Eq a => a -> Bracket a -> Bool maximum :: Ord a => Bracket a -> a minimum :: Ord a => Bracket a -> a | |
Traversable Bracket # | |
Functor Bracket # | |
ExactP Bracket # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Bracket SrcSpanInfo -> EP () | |
AppFixity Bracket # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Bracket SrcSpanInfo -> m (Bracket SrcSpanInfo) # | |
Annotated Bracket # | |
Data l => Data (Bracket l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bracket l -> c (Bracket l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bracket l) toConstr :: Bracket l -> Constr dataTypeOf :: Bracket l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bracket l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bracket l)) gmapT :: (forall b. Data b => b -> b) -> Bracket l -> Bracket l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bracket l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bracket l -> r gmapQ :: (forall d. Data d => d -> u) -> Bracket l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Bracket l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) | |
Generic (Bracket l) # | |
Show l => Show (Bracket l) # | |
Eq l => Eq (Bracket l) # | |
Ord l => Ord (Bracket l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Bracket l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Bracket l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Bracket l) = D1 ('MetaData "Bracket" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "ExpBracket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "TExpBracket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "PatBracket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Pat l))) :+: (C1 ('MetaCons "TypeBracket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))) :+: C1 ('MetaCons "DeclBracket" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Decl l]))))) |
A template haskell splice expression
Constructors
IdSplice l String | variable splice: |
TIdSplice l String | typed variable splice: |
ParenSplice l (Exp l) | parenthesised expression splice: |
TParenSplice l (Exp l) | parenthesised typed expression splice: |
Instances
Foldable Splice # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Splice m -> m foldMap :: Monoid m => (a -> m) -> Splice a -> m foldMap' :: Monoid m => (a -> m) -> Splice a -> m foldr :: (a -> b -> b) -> b -> Splice a -> b foldr' :: (a -> b -> b) -> b -> Splice a -> b foldl :: (b -> a -> b) -> b -> Splice a -> b foldl' :: (b -> a -> b) -> b -> Splice a -> b foldr1 :: (a -> a -> a) -> Splice a -> a foldl1 :: (a -> a -> a) -> Splice a -> a elem :: Eq a => a -> Splice a -> Bool maximum :: Ord a => Splice a -> a | |
Traversable Splice # | |
Functor Splice # | |
ExactP Splice # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Splice SrcSpanInfo -> EP () | |
AppFixity Splice # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Splice SrcSpanInfo -> m (Splice SrcSpanInfo) # | |
Annotated Splice # | |
Data l => Data (Splice l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Splice l -> c (Splice l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Splice l) toConstr :: Splice l -> Constr dataTypeOf :: Splice l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Splice l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Splice l)) gmapT :: (forall b. Data b => b -> b) -> Splice l -> Splice l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Splice l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Splice l -> r gmapQ :: (forall d. Data d => d -> u) -> Splice l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Splice l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) | |
Generic (Splice l) # | |
Show l => Show (Splice l) # | |
Eq l => Eq (Splice l) # | |
Ord l => Ord (Splice l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Splice l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Splice l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Splice l) = D1 ('MetaData "Splice" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "IdSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String)) :+: C1 ('MetaCons "TIdSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: (C1 ('MetaCons "ParenSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))) :+: C1 ('MetaCons "TParenSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) |
FFI
The safety of a foreign function call.
Constructors
PlayRisky l | unsafe |
PlaySafe l Bool | safe ( |
PlayInterruptible l | interruptible |
Instances
Foldable Safety # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Safety m -> m foldMap :: Monoid m => (a -> m) -> Safety a -> m foldMap' :: Monoid m => (a -> m) -> Safety a -> m foldr :: (a -> b -> b) -> b -> Safety a -> b foldr' :: (a -> b -> b) -> b -> Safety a -> b foldl :: (b -> a -> b) -> b -> Safety a -> b foldl' :: (b -> a -> b) -> b -> Safety a -> b foldr1 :: (a -> a -> a) -> Safety a -> a foldl1 :: (a -> a -> a) -> Safety a -> a elem :: Eq a => a -> Safety a -> Bool maximum :: Ord a => Safety a -> a | |
Traversable Safety # | |
Functor Safety # | |
ExactP Safety # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Safety SrcSpanInfo -> EP () | |
Annotated Safety # | |
Data l => Data (Safety l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Safety l -> c (Safety l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Safety l) toConstr :: Safety l -> Constr dataTypeOf :: Safety l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Safety l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Safety l)) gmapT :: (forall b. Data b => b -> b) -> Safety l -> Safety l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Safety l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Safety l -> r gmapQ :: (forall d. Data d => d -> u) -> Safety l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Safety l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) | |
Generic (Safety l) # | |
Show l => Show (Safety l) # | |
Eq l => Eq (Safety l) # | |
Ord l => Ord (Safety l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Safety l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Safety l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Safety l) = D1 ('MetaData "Safety" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "PlayRisky" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "PlaySafe" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :+: C1 ('MetaCons "PlayInterruptible" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) |
The calling convention of a foreign function call.
Instances
Foldable CallConv # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CallConv m -> m foldMap :: Monoid m => (a -> m) -> CallConv a -> m foldMap' :: Monoid m => (a -> m) -> CallConv a -> m foldr :: (a -> b -> b) -> b -> CallConv a -> b foldr' :: (a -> b -> b) -> b -> CallConv a -> b foldl :: (b -> a -> b) -> b -> CallConv a -> b foldl' :: (b -> a -> b) -> b -> CallConv a -> b foldr1 :: (a -> a -> a) -> CallConv a -> a foldl1 :: (a -> a -> a) -> CallConv a -> a elem :: Eq a => a -> CallConv a -> Bool maximum :: Ord a => CallConv a -> a minimum :: Ord a => CallConv a -> a | |
Traversable CallConv # | |
Functor CallConv # | |
ExactP CallConv # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: CallConv SrcSpanInfo -> EP () | |
Annotated CallConv # | |
Data l => Data (CallConv l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CallConv l -> c (CallConv l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CallConv l) toConstr :: CallConv l -> Constr dataTypeOf :: CallConv l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CallConv l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CallConv l)) gmapT :: (forall b. Data b => b -> b) -> CallConv l -> CallConv l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CallConv l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CallConv l -> r gmapQ :: (forall d. Data d => d -> u) -> CallConv l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> CallConv l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) | |
Generic (CallConv l) # | |
Show l => Show (CallConv l) # | |
Eq l => Eq (CallConv l) # | |
Ord l => Ord (CallConv l) # | |
Pretty (CallConv l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (CallConv l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (CallConv l) = D1 ('MetaData "CallConv" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (((C1 ('MetaCons "StdCall" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "CCall" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "CPlusPlus" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "DotNet" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) :+: ((C1 ('MetaCons "Jvm" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "Js" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))) :+: (C1 ('MetaCons "JavaScript" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "CApi" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))))) |
Pragmas
data ModulePragma l #
A top level options pragma, preceding the module header.
Constructors
LanguagePragma l [Name l] | LANGUAGE pragma |
OptionsPragma l (Maybe Tool) String | OPTIONS pragma, possibly qualified with a tool, e.g. OPTIONS_GHC |
AnnModulePragma l (Annotation l) | ANN pragma with module scope |
Instances
Foldable ModulePragma # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModulePragma m -> m foldMap :: Monoid m => (a -> m) -> ModulePragma a -> m foldMap' :: Monoid m => (a -> m) -> ModulePragma a -> m foldr :: (a -> b -> b) -> b -> ModulePragma a -> b foldr' :: (a -> b -> b) -> b -> ModulePragma a -> b foldl :: (b -> a -> b) -> b -> ModulePragma a -> b foldl' :: (b -> a -> b) -> b -> ModulePragma a -> b foldr1 :: (a -> a -> a) -> ModulePragma a -> a foldl1 :: (a -> a -> a) -> ModulePragma a -> a toList :: ModulePragma a -> [a] null :: ModulePragma a -> Bool length :: ModulePragma a -> Int elem :: Eq a => a -> ModulePragma a -> Bool maximum :: Ord a => ModulePragma a -> a minimum :: Ord a => ModulePragma a -> a sum :: Num a => ModulePragma a -> a product :: Num a => ModulePragma a -> a | |
Traversable ModulePragma # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModulePragma a -> f (ModulePragma b) sequenceA :: Applicative f => ModulePragma (f a) -> f (ModulePragma a) mapM :: Monad m => (a -> m b) -> ModulePragma a -> m (ModulePragma b) sequence :: Monad m => ModulePragma (m a) -> m (ModulePragma a) | |
Functor ModulePragma # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ModulePragma a -> ModulePragma b (<$) :: a -> ModulePragma b -> ModulePragma a | |
ExactP ModulePragma # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModulePragma SrcSpanInfo -> EP () | |
Annotated ModulePragma # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModulePragma l -> c (ModulePragma l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModulePragma l) toConstr :: ModulePragma l -> Constr dataTypeOf :: ModulePragma l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModulePragma l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModulePragma l)) gmapT :: (forall b. Data b => b -> b) -> ModulePragma l -> ModulePragma l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModulePragma l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModulePragma l -> r gmapQ :: (forall d. Data d => d -> u) -> ModulePragma l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> ModulePragma l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) | |
Generic (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (ModulePragma l) :: Type -> Type Methods from :: ModulePragma l -> Rep (ModulePragma l) x to :: Rep (ModulePragma l) x -> ModulePragma l | |
Show l => Show (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModulePragma l -> ShowS show :: ModulePragma l -> String showList :: [ModulePragma l] -> ShowS | |
Eq l => Eq (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: ModulePragma l -> ModulePragma l -> Bool (/=) :: ModulePragma l -> ModulePragma l -> Bool | |
Ord l => Ord (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: ModulePragma l -> ModulePragma l -> Ordering (<) :: ModulePragma l -> ModulePragma l -> Bool (<=) :: ModulePragma l -> ModulePragma l -> Bool (>) :: ModulePragma l -> ModulePragma l -> Bool (>=) :: ModulePragma l -> ModulePragma l -> Bool max :: ModulePragma l -> ModulePragma l -> ModulePragma l min :: ModulePragma l -> ModulePragma l -> ModulePragma l | |
Parseable (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) # | |
Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) # parseWithMode :: ParseMode -> String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) # parseWithComments :: ParseMode -> String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo)), [Comment]) # parser :: Maybe [Fixity] -> P (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) | |
Pretty (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (ModulePragma l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (ModulePragma l) = D1 ('MetaData "ModulePragma" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "LanguagePragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name l])) :+: (C1 ('MetaCons "OptionsPragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Tool)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))) :+: C1 ('MetaCons "AnnModulePragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Annotation l))))) |
Recognised tools for OPTIONS pragmas.
Instances
Data Tool # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Tool -> c Tool gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Tool dataTypeOf :: Tool -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Tool) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Tool) gmapT :: (forall b. Data b => b -> b) -> Tool -> Tool gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tool -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tool -> r gmapQ :: (forall d. Data d => d -> u) -> Tool -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Tool -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tool -> m Tool gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tool -> m Tool gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tool -> m Tool | |
Generic Tool # | |
Show Tool # | |
Eq Tool # | |
Ord Tool # | |
Pretty Tool # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep Tool # | |
Defined in Language.Haskell.Exts.Syntax type Rep Tool = D1 ('MetaData "Tool" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "GHC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "HUGS" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NHC98" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "YHC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "HADDOCK" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnknownTool" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String))))) |
Recognised overlaps for overlap pragmas.
Constructors
NoOverlap l | NO_OVERLAP pragma |
Overlap l | OVERLAP pragma |
Overlapping l | |
Overlaps l | |
Overlappable l | |
Incoherent l | INCOHERENT pragma |
Instances
Foldable Overlap # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Overlap m -> m foldMap :: Monoid m => (a -> m) -> Overlap a -> m foldMap' :: Monoid m => (a -> m) -> Overlap a -> m foldr :: (a -> b -> b) -> b -> Overlap a -> b foldr' :: (a -> b -> b) -> b -> Overlap a -> b foldl :: (b -> a -> b) -> b -> Overlap a -> b foldl' :: (b -> a -> b) -> b -> Overlap a -> b foldr1 :: (a -> a -> a) -> Overlap a -> a foldl1 :: (a -> a -> a) -> Overlap a -> a elem :: Eq a => a -> Overlap a -> Bool maximum :: Ord a => Overlap a -> a minimum :: Ord a => Overlap a -> a | |
Traversable Overlap # | |
Functor Overlap # | |
ExactP Overlap # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Overlap SrcSpanInfo -> EP () | |
Annotated Overlap # | |
Data l => Data (Overlap l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Overlap l -> c (Overlap l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Overlap l) toConstr :: Overlap l -> Constr dataTypeOf :: Overlap l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Overlap l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Overlap l)) gmapT :: (forall b. Data b => b -> b) -> Overlap l -> Overlap l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Overlap l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Overlap l -> r gmapQ :: (forall d. Data d => d -> u) -> Overlap l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Overlap l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) | |
Generic (Overlap l) # | |
Show l => Show (Overlap l) # | |
Eq l => Eq (Overlap l) # | |
Ord l => Ord (Overlap l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (Overlap l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Overlap l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Overlap l) = D1 ('MetaData "Overlap" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "NoOverlap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "Overlap" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "Overlapping" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)))) :+: (C1 ('MetaCons "Overlaps" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: (C1 ('MetaCons "Overlappable" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l)) :+: C1 ('MetaCons "Incoherent" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l))))) |
The body of a RULES pragma.
Constructors
Rule l String (Maybe (Activation l)) (Maybe [RuleVar l]) (Exp l) (Exp l) |
Instances
Foldable Rule # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rule m -> m foldMap :: Monoid m => (a -> m) -> Rule a -> m foldMap' :: Monoid m => (a -> m) -> Rule a -> m foldr :: (a -> b -> b) -> b -> Rule a -> b foldr' :: (a -> b -> b) -> b -> Rule a -> b foldl :: (b -> a -> b) -> b -> Rule a -> b foldl' :: (b -> a -> b) -> b -> Rule a -> b foldr1 :: (a -> a -> a) -> Rule a -> a foldl1 :: (a -> a -> a) -> Rule a -> a elem :: Eq a => a -> Rule a -> Bool maximum :: Ord a => Rule a -> a | |
Traversable Rule # | |
Functor Rule # | |
ExactP Rule # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Rule SrcSpanInfo -> EP () | |
Annotated Rule # | |
Data l => Data (Rule l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Rule l -> c (Rule l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Rule l) dataTypeOf :: Rule l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Rule l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Rule l)) gmapT :: (forall b. Data b => b -> b) -> Rule l -> Rule l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rule l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rule l -> r gmapQ :: (forall d. Data d => d -> u) -> Rule l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Rule l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) | |
Generic (Rule l) # | |
Show l => Show (Rule l) # | |
Eq l => Eq (Rule l) # | |
Ord l => Ord (Rule l) # | |
Pretty (Rule l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Rule l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Rule l) = D1 ('MetaData "Rule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Rule" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 String) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe (Activation l))))) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe [RuleVar l])) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))))) |
Variables used in a RULES pragma, optionally annotated with types
Constructors
RuleVar l (Name l) | |
TypedRuleVar l (Name l) (Type l) |
Instances
Foldable RuleVar # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RuleVar m -> m foldMap :: Monoid m => (a -> m) -> RuleVar a -> m foldMap' :: Monoid m => (a -> m) -> RuleVar a -> m foldr :: (a -> b -> b) -> b -> RuleVar a -> b foldr' :: (a -> b -> b) -> b -> RuleVar a -> b foldl :: (b -> a -> b) -> b -> RuleVar a -> b foldl' :: (b -> a -> b) -> b -> RuleVar a -> b foldr1 :: (a -> a -> a) -> RuleVar a -> a foldl1 :: (a -> a -> a) -> RuleVar a -> a elem :: Eq a => a -> RuleVar a -> Bool maximum :: Ord a => RuleVar a -> a minimum :: Ord a => RuleVar a -> a | |
Traversable RuleVar # | |
Functor RuleVar # | |
ExactP RuleVar # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RuleVar SrcSpanInfo -> EP () | |
Annotated RuleVar # | |
Data l => Data (RuleVar l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RuleVar l -> c (RuleVar l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RuleVar l) toConstr :: RuleVar l -> Constr dataTypeOf :: RuleVar l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RuleVar l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RuleVar l)) gmapT :: (forall b. Data b => b -> b) -> RuleVar l -> RuleVar l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RuleVar l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RuleVar l -> r gmapQ :: (forall d. Data d => d -> u) -> RuleVar l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> RuleVar l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) | |
Generic (RuleVar l) # | |
Show l => Show (RuleVar l) # | |
Eq l => Eq (RuleVar l) # | |
Ord l => Ord (RuleVar l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Pretty (RuleVar l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (RuleVar l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (RuleVar l) = D1 ('MetaData "RuleVar" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "RuleVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "TypedRuleVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Type l))))) |
data Activation l #
Activation clause of a RULES pragma.
Constructors
ActiveFrom l Int | |
ActiveUntil l Int |
Instances
Foldable Activation # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Activation m -> m foldMap :: Monoid m => (a -> m) -> Activation a -> m foldMap' :: Monoid m => (a -> m) -> Activation a -> m foldr :: (a -> b -> b) -> b -> Activation a -> b foldr' :: (a -> b -> b) -> b -> Activation a -> b foldl :: (b -> a -> b) -> b -> Activation a -> b foldl' :: (b -> a -> b) -> b -> Activation a -> b foldr1 :: (a -> a -> a) -> Activation a -> a foldl1 :: (a -> a -> a) -> Activation a -> a toList :: Activation a -> [a] null :: Activation a -> Bool length :: Activation a -> Int elem :: Eq a => a -> Activation a -> Bool maximum :: Ord a => Activation a -> a minimum :: Ord a => Activation a -> a sum :: Num a => Activation a -> a product :: Num a => Activation a -> a | |
Traversable Activation # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Activation a -> f (Activation b) sequenceA :: Applicative f => Activation (f a) -> f (Activation a) mapM :: Monad m => (a -> m b) -> Activation a -> m (Activation b) sequence :: Monad m => Activation (m a) -> m (Activation a) | |
Functor Activation # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP Activation # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Activation SrcSpanInfo -> EP () | |
Annotated Activation # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Activation l -> c (Activation l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Activation l) toConstr :: Activation l -> Constr dataTypeOf :: Activation l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Activation l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Activation l)) gmapT :: (forall b. Data b => b -> b) -> Activation l -> Activation l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Activation l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Activation l -> r gmapQ :: (forall d. Data d => d -> u) -> Activation l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Activation l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) | |
Generic (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (Activation l) :: Type -> Type | |
Show l => Show (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Activation l -> ShowS show :: Activation l -> String showList :: [Activation l] -> ShowS | |
Eq l => Eq (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: Activation l -> Activation l -> Ordering (<) :: Activation l -> Activation l -> Bool (<=) :: Activation l -> Activation l -> Bool (>) :: Activation l -> Activation l -> Bool (>=) :: Activation l -> Activation l -> Bool max :: Activation l -> Activation l -> Activation l min :: Activation l -> Activation l -> Activation l | |
Pretty (Activation l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Activation l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Activation l) = D1 ('MetaData "Activation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "ActiveFrom" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)) :+: C1 ('MetaCons "ActiveUntil" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int))) |
data Annotation l #
An annotation through an ANN pragma.
Constructors
Ann l (Name l) (Exp l) | An annotation for a declared name. |
TypeAnn l (Name l) (Exp l) | An annotation for a declared type. |
ModuleAnn l (Exp l) | An annotation for the defining module. |
Instances
Foldable Annotation # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Annotation m -> m foldMap :: Monoid m => (a -> m) -> Annotation a -> m foldMap' :: Monoid m => (a -> m) -> Annotation a -> m foldr :: (a -> b -> b) -> b -> Annotation a -> b foldr' :: (a -> b -> b) -> b -> Annotation a -> b foldl :: (b -> a -> b) -> b -> Annotation a -> b foldl' :: (b -> a -> b) -> b -> Annotation a -> b foldr1 :: (a -> a -> a) -> Annotation a -> a foldl1 :: (a -> a -> a) -> Annotation a -> a toList :: Annotation a -> [a] null :: Annotation a -> Bool length :: Annotation a -> Int elem :: Eq a => a -> Annotation a -> Bool maximum :: Ord a => Annotation a -> a minimum :: Ord a => Annotation a -> a sum :: Num a => Annotation a -> a product :: Num a => Annotation a -> a | |
Traversable Annotation # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Annotation a -> f (Annotation b) sequenceA :: Applicative f => Annotation (f a) -> f (Annotation a) mapM :: Monad m => (a -> m b) -> Annotation a -> m (Annotation b) sequence :: Monad m => Annotation (m a) -> m (Annotation a) | |
Functor Annotation # | |
Defined in Language.Haskell.Exts.Syntax | |
ExactP Annotation # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Annotation SrcSpanInfo -> EP () | |
AppFixity Annotation # | |
Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Annotation SrcSpanInfo -> m (Annotation SrcSpanInfo) # | |
Annotated Annotation # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Annotation l -> c (Annotation l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Annotation l) toConstr :: Annotation l -> Constr dataTypeOf :: Annotation l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Annotation l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Annotation l)) gmapT :: (forall b. Data b => b -> b) -> Annotation l -> Annotation l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Annotation l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Annotation l -> r gmapQ :: (forall d. Data d => d -> u) -> Annotation l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Annotation l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) | |
Generic (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (Annotation l) :: Type -> Type | |
Show l => Show (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Annotation l -> ShowS show :: Annotation l -> String showList :: [Annotation l] -> ShowS | |
Eq l => Eq (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax | |
Ord l => Ord (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: Annotation l -> Annotation l -> Ordering (<) :: Annotation l -> Annotation l -> Bool (<=) :: Annotation l -> Annotation l -> Bool (>) :: Annotation l -> Annotation l -> Bool (>=) :: Annotation l -> Annotation l -> Bool max :: Annotation l -> Annotation l -> Annotation l min :: Annotation l -> Annotation l -> Annotation l | |
Pretty (Annotation l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (Annotation l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (Annotation l) = D1 ('MetaData "Annotation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) (C1 ('MetaCons "Ann" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: (C1 ('MetaCons "TypeAnn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l)))) :+: C1 ('MetaCons "ModuleAnn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Exp l))))) |
data BooleanFormula l #
A boolean formula for MINIMAL pragmas.
Constructors
VarFormula l (Name l) | A variable. |
AndFormula l [BooleanFormula l] | And boolean formulas. |
OrFormula l [BooleanFormula l] | Or boolean formulas. |
ParenFormula l (BooleanFormula l) | Parenthesized boolean formulas. |
Instances
Foldable BooleanFormula # | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BooleanFormula m -> m foldMap :: Monoid m => (a -> m) -> BooleanFormula a -> m foldMap' :: Monoid m => (a -> m) -> BooleanFormula a -> m foldr :: (a -> b -> b) -> b -> BooleanFormula a -> b foldr' :: (a -> b -> b) -> b -> BooleanFormula a -> b foldl :: (b -> a -> b) -> b -> BooleanFormula a -> b foldl' :: (b -> a -> b) -> b -> BooleanFormula a -> b foldr1 :: (a -> a -> a) -> BooleanFormula a -> a foldl1 :: (a -> a -> a) -> BooleanFormula a -> a toList :: BooleanFormula a -> [a] null :: BooleanFormula a -> Bool length :: BooleanFormula a -> Int elem :: Eq a => a -> BooleanFormula a -> Bool maximum :: Ord a => BooleanFormula a -> a minimum :: Ord a => BooleanFormula a -> a sum :: Num a => BooleanFormula a -> a product :: Num a => BooleanFormula a -> a | |
Traversable BooleanFormula # | |
Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> BooleanFormula a -> f (BooleanFormula b) sequenceA :: Applicative f => BooleanFormula (f a) -> f (BooleanFormula a) mapM :: Monad m => (a -> m b) -> BooleanFormula a -> m (BooleanFormula b) sequence :: Monad m => BooleanFormula (m a) -> m (BooleanFormula a) | |
Functor BooleanFormula # | |
Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> BooleanFormula a -> BooleanFormula b (<$) :: a -> BooleanFormula b -> BooleanFormula a | |
ExactP BooleanFormula # | |
Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: BooleanFormula SrcSpanInfo -> EP () | |
Annotated BooleanFormula # | |
Defined in Language.Haskell.Exts.Syntax | |
Data l => Data (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BooleanFormula l -> c (BooleanFormula l) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BooleanFormula l) toConstr :: BooleanFormula l -> Constr dataTypeOf :: BooleanFormula l -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BooleanFormula l)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BooleanFormula l)) gmapT :: (forall b. Data b => b -> b) -> BooleanFormula l -> BooleanFormula l gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BooleanFormula l -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BooleanFormula l -> r gmapQ :: (forall d. Data d => d -> u) -> BooleanFormula l -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> BooleanFormula l -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) | |
Generic (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax Associated Types type Rep (BooleanFormula l) :: Type -> Type Methods from :: BooleanFormula l -> Rep (BooleanFormula l) x to :: Rep (BooleanFormula l) x -> BooleanFormula l | |
Show l => Show (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> BooleanFormula l -> ShowS show :: BooleanFormula l -> String showList :: [BooleanFormula l] -> ShowS | |
Eq l => Eq (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax Methods (==) :: BooleanFormula l -> BooleanFormula l -> Bool (/=) :: BooleanFormula l -> BooleanFormula l -> Bool | |
Ord l => Ord (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax Methods compare :: BooleanFormula l -> BooleanFormula l -> Ordering (<) :: BooleanFormula l -> BooleanFormula l -> Bool (<=) :: BooleanFormula l -> BooleanFormula l -> Bool (>) :: BooleanFormula l -> BooleanFormula l -> Bool (>=) :: BooleanFormula l -> BooleanFormula l -> Bool max :: BooleanFormula l -> BooleanFormula l -> BooleanFormula l min :: BooleanFormula l -> BooleanFormula l -> BooleanFormula l | |
Pretty (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Pretty | |
type Rep (BooleanFormula l) # | |
Defined in Language.Haskell.Exts.Syntax type Rep (BooleanFormula l) = D1 ('MetaData "BooleanFormula" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-6bq8L1rOeseFIOXsg52Nca" 'False) ((C1 ('MetaCons "VarFormula" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Name l))) :+: C1 ('MetaCons "AndFormula" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [BooleanFormula l]))) :+: (C1 ('MetaCons "OrFormula" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [BooleanFormula l])) :+: C1 ('MetaCons "ParenFormula" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 l) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (BooleanFormula l))))) |
Builtin names
Modules
prelude_mod :: l -> ModuleName l #
main_mod :: l -> ModuleName l #
Main function of a program
Constructors
unit_con_name :: l -> QName l #
tuple_con_name :: l -> Boxed -> Int -> QName l #
list_con_name :: l -> QName l #
list_cons_name :: l -> QName l #
unboxed_singleton_con_name :: l -> QName l #
unboxed_singleton_con :: l -> Exp l #
Special identifiers
qualified_name :: l -> Name l #
hiding_name :: l -> Name l #
minus_name :: l -> Name l #
export_name :: l -> Name l #
unsafe_name :: l -> Name l #
interruptible_name :: l -> Name l #
threadsafe_name :: l -> Name l #
stdcall_name :: l -> Name l #
ccall_name :: l -> Name l #
cplusplus_name :: l -> Name l #
dotnet_name :: l -> Name l #
javascript_name :: l -> Name l #
forall_name :: l -> Name l #
family_name :: l -> Name l #
stock_name :: l -> Name l #
anyclass_name :: l -> Name l #
Type constructors
unit_tycon_name :: l -> QName l #
fun_tycon_name :: l -> QName l #
list_tycon_name :: l -> QName l #
tuple_tycon_name :: l -> Boxed -> Int -> QName l #
unboxed_singleton_tycon_name :: l -> QName l #
unit_tycon :: l -> Type l #
list_tycon :: l -> Type l #
tuple_tycon :: l -> Boxed -> Int -> Type l #
unboxed_singleton_tycon :: l -> Type l #
Source coordinates
Annotated trees
class Functor ast => Annotated ast where #
AST nodes are annotated, and this class allows manipulation of the annotations.
Methods
Retrieve the annotation of an AST node.
amap :: (l -> l) -> ast l -> ast l #
Change the annotation of an AST node. Note that only the annotation of
the node itself is affected, and not the annotations of any child nodes.
if all nodes in the AST tree are to be affected, use fmap
.