haskell-src-exts-1.23.1: Manipulating Haskell source: abstract syntax, lexer, parser, and pretty-printer

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

Contents

- Modules
- Declarations
  - Type classes and instances
  - Data type declarations
  - Function bindings
- Class Assertions and Contexts
- Types
- Expressions
- Patterns
- Literals
- Variables, Constructors and Operators
- Template Haskell
- FFI
- Pragmas
- Builtin names
  - Modules
  - Main function of a program
  - Constructors
  - Special identifiers
  - Type constructors
- Source coordinates
- Annotated trees

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
  - = DeprText l String
  - | WarnText l String
- 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
  - = IVar l (Name l)
  - | IAbs l (Namespace l) (Name l)
  - | IThingAll l (Name l)
  - | IThingWith l (Name l) [CName 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
  - = DHead l (Name l)
  - | DHInfix l (TyVarBind l) (Name l)
  - | DHParen l (DeclHead l)
  - | DHApp l (DeclHead l) (TyVarBind l)
- data InstRule l
  - = IRule l (Maybe [TyVarBind l]) (Maybe (Context l)) (InstHead l)
  - | IParen l (InstRule l)
- data InstHead l
  - = IHCon l (QName l)
  - | IHInfix l (Type l) (QName l)
  - | IHParen l (InstHead l)
  - | IHApp l (InstHead l) (Type l)
- data Binds l
  - = BDecls l [Decl l]
  - | IPBinds l [IPBind l]
- data IPBind l = IPBind l (IPName l) (Exp l)
- data PatternSynDirection l
  - = Unidirectional
  - | ImplicitBidirectional
  - | ExplicitBidirectional l [Decl l]
- data InjectivityInfo l = InjectivityInfo l (Name l) [Name l]
- data ResultSig l
  - = KindSig l (Kind l)
  - | TyVarSig l (TyVarBind l)
- data ClassDecl l
  - = ClsDecl l (Decl l)
  - | ClsDataFam l (Maybe (Context l)) (DeclHead l) (Maybe (ResultSig l))
  - | ClsTyFam l (DeclHead l) (Maybe (ResultSig l)) (Maybe (InjectivityInfo l))
  - | ClsTyDef l (TypeEqn l)
  - | ClsDefSig l (Name l) (Type l)
- data InstDecl l
  - = InsDecl l (Decl l)
  - | InsType l (Type l) (Type l)
  - | InsData l (DataOrNew l) (Type l) [QualConDecl l] [Deriving l]
  - | InsGData l (DataOrNew l) (Type l) (Maybe (Kind l)) [GadtDecl l] [Deriving 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
  - = DataType l
  - | NewType l
- data ConDecl l
  - = ConDecl l (Name l) [Type l]
  - | InfixConDecl l (Type l) (Name l) (Type l)
  - | RecDecl l (Name l) [FieldDecl 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
  - = Match l (Name l) [Pat l] (Rhs l) (Maybe (Binds l))
  - | InfixMatch l (Pat l) (Name l) [Pat l] (Rhs l) (Maybe (Binds l))
- data Rhs l
  - = UnGuardedRhs l (Exp l)
  - | GuardedRhss l [GuardedRhs l]
- data GuardedRhs l = GuardedRhs l [Stmt l] (Exp l)
- data Context l
  - = CxSingle l (Asst l)
  - | CxTuple l [Asst l]
  - | CxEmpty l
- data FunDep l = FunDep l [Name l] [Name l]
- data Asst l
  - = TypeA l (Type l)
  - | IParam l (IPName l) (Type l)
  - | ParenA l (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
  - = Boxed
  - | Unboxed
- 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
  - = Generator l (Pat l) (Exp l)
  - | Qualifier l (Exp l)
  - | LetStmt l (Binds l)
  - | RecStmt l [Stmt l]
- data QualStmt l
  - = QualStmt l (Stmt l)
  - | ThenTrans l (Exp l)
  - | ThenBy l (Exp l) (Exp l)
  - | GroupBy l (Exp l)
  - | GroupUsing l (Exp l)
  - | GroupByUsing l (Exp l) (Exp 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
  - = PFieldPat l (QName l) (Pat l)
  - | PFieldPun l (QName l)
  - | PFieldWildcard l
- data PXAttr l = PXAttr l (XName l) (Pat l)
- data RPat l
  - = RPOp l (RPat l) (RPatOp l)
  - | RPEither l (RPat l) (RPat l)
  - | RPSeq l [RPat l]
  - | RPGuard l (Pat l) [Stmt l]
  - | RPCAs l (Name l) (RPat l)
  - | RPAs l (Name l) (RPat l)
  - | RPParen l (RPat l)
  - | RPPat l (Pat l)
- data RPatOp l
  - = RPStar l
  - | RPStarG l
  - | RPPlus l
  - | RPPlusG l
  - | RPOpt l
  - | RPOptG 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
  - = Signless l
  - | Negative 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
  - = Ident l String
  - | Symbol l String
- data QOp l
  - = QVarOp l (QName l)
  - | QConOp l (QName l)
- data Op l
  - = VarOp l (Name l)
  - | ConOp l (Name l)
- data SpecialCon l
  - = UnitCon l
  - | ListCon l
  - | FunCon l
  - | TupleCon l Boxed Int
  - | Cons l
  - | UnboxedSingleCon l
  - | ExprHole l
- data CName l
  - = VarName l (Name l)
  - | ConName l (Name l)
- data IPName l
  - = IPDup l String
  - | IPLin l String
- data XName l
  - = XName l String
  - | XDomName l String String
- 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
  - = StdCall l
  - | CCall l
  - | CPlusPlus l
  - | DotNet l
  - | Jvm l
  - | Js l
  - | JavaScript l
  - | CApi l
- data ModulePragma l
  - = LanguagePragma l [Name l]
  - | OptionsPragma l (Maybe Tool) String
  - | AnnModulePragma l (Annotation l)
- data Tool
  - = GHC
  - | HUGS
  - | NHC98
  - | YHC
  - | HADDOCK
  - | UnknownTool String
- 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
  - = Ann l (Name l) (Exp l)
  - | TypeAnn l (Name l) (Exp l)
  - | ModuleAnn l (Exp 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 :: Type -> Type) where
  - ann :: ast l -> l
  - amap :: (l -> l) -> ast l -> ast l
- (=~=) :: (Annotated a, Eq (a ())) => a l1 -> a l2 -> Bool

# Modules

data Module l Source #

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

Instances details

Functor Module Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Module a -> Module b Source # (<$) :: a -> Module b -> Module a Source #
Foldable Module Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Module m -> m Source #

foldMap :: Monoid m => (a -> m) -> Module a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Module a -> m Source #

foldr :: (a -> b -> b) -> b -> Module a -> b Source #

foldr' :: (a -> b -> b) -> b -> Module a -> b Source #

foldl :: (b -> a -> b) -> b -> Module a -> b Source #

foldl' :: (b -> a -> b) -> b -> Module a -> b Source #

foldr1 :: (a -> a -> a) -> Module a -> a Source #

foldl1 :: (a -> a -> a) -> Module a -> a Source #

toList :: Module a -> [a] Source #

null :: Module a -> Bool Source #

length :: Module a -> Int Source #

elem :: Eq a => a -> Module a -> Bool Source #

maximum :: Ord a => Module a -> a Source #

minimum :: Ord a => Module a -> a Source #

sum :: Num a => Module a -> a Source #

product :: Num a => Module a -> a Source #

Traversable Module Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Module a -> f (Module b) Source # sequenceA :: Applicative f => Module (f a) -> f (Module a) Source # mapM :: Monad m => (a -> m b) -> Module a -> m (Module b) Source # sequence :: Monad m => Module (m a) -> m (Module a) Source #
ExactP Module Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Module SrcSpanInfo -> EP ()
AppFixity Module Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Module SrcSpanInfo -> m (Module SrcSpanInfo) Source #
Annotated Module Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Module l -> l Source # amap :: (l -> l) -> Module l -> Module l Source #
Data l => Data (Module l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Module l) Source #

toConstr :: Module l -> Constr Source #

dataTypeOf :: Module l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Module l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Module l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Module l -> Module l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Module l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Module l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Module l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Module l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Module l -> m (Module l) Source #

Generic (Module l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Module l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Module l) = D1 ('MetaData "Module" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))))

Methods

from :: Module l -> Rep (Module l) x Source #

to :: Rep (Module l) x -> Module l Source #

Show l => Show (Module l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Module l -> ShowS Source # show :: Module l -> String Source # showList :: [Module l] -> ShowS Source #
Eq l => Eq (Module l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Module l -> Module l -> Bool Source # (/=) :: Module l -> Module l -> Bool Source #
Ord l => Ord (Module l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Module l -> Module l -> Ordering Source # (<) :: Module l -> Module l -> Bool Source # (<=) :: Module l -> Module l -> Bool Source # (>) :: Module l -> Module l -> Bool Source # (>=) :: Module l -> Module l -> Bool Source # max :: Module l -> Module l -> Module l Source # min :: Module l -> Module l -> Module l Source #
Parseable (Module SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Module SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Module SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Module SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Module SrcSpanInfo)
Pretty (Module pos) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Module pos -> Doc prettyPrec :: Int -> Module pos -> Doc
type Rep (Module l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Module l) = D1 ('MetaData "Module" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

The head of a module, including the name and export specification.

Constructors

ModuleHead l (ModuleName l) (Maybe (WarningText l)) (Maybe (ExportSpecList l)) |

#### Instances

Instances details

Functor ModuleHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ModuleHead a -> ModuleHead b Source # (<$) :: a -> ModuleHead b -> ModuleHead a Source #
Foldable ModuleHead Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ModuleHead m -> m Source #

foldMap :: Monoid m => (a -> m) -> ModuleHead a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ModuleHead a -> m Source #

foldr :: (a -> b -> b) -> b -> ModuleHead a -> b Source #

foldr' :: (a -> b -> b) -> b -> ModuleHead a -> b Source #

foldl :: (b -> a -> b) -> b -> ModuleHead a -> b Source #

foldl' :: (b -> a -> b) -> b -> ModuleHead a -> b Source #

foldr1 :: (a -> a -> a) -> ModuleHead a -> a Source #

foldl1 :: (a -> a -> a) -> ModuleHead a -> a Source #

toList :: ModuleHead a -> [a] Source #

null :: ModuleHead a -> Bool Source #

length :: ModuleHead a -> Int Source #

elem :: Eq a => a -> ModuleHead a -> Bool Source #

maximum :: Ord a => ModuleHead a -> a Source #

minimum :: Ord a => ModuleHead a -> a Source #

sum :: Num a => ModuleHead a -> a Source #

product :: Num a => ModuleHead a -> a Source #

Traversable ModuleHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModuleHead a -> f (ModuleHead b) Source # sequenceA :: Applicative f => ModuleHead (f a) -> f (ModuleHead a) Source # mapM :: Monad m => (a -> m b) -> ModuleHead a -> m (ModuleHead b) Source # sequence :: Monad m => ModuleHead (m a) -> m (ModuleHead a) Source #
ExactP ModuleHead Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModuleHead SrcSpanInfo -> EP ()
Annotated ModuleHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModuleHead l -> l Source # amap :: (l -> l) -> ModuleHead l -> ModuleHead l Source #
Data l => Data (ModuleHead l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModuleHead l) Source #

toConstr :: ModuleHead l -> Constr Source #

dataTypeOf :: ModuleHead l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModuleHead l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModuleHead l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ModuleHead l -> ModuleHead l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleHead l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleHead l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ModuleHead l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleHead l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleHead l -> m (ModuleHead l) Source #

Generic (ModuleHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ModuleHead l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModuleHead l) = D1 ('MetaData "ModuleHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: ModuleHead l -> Rep (ModuleHead l) x Source #

to :: Rep (ModuleHead l) x -> ModuleHead l Source #

Show l => Show (ModuleHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModuleHead l -> ShowS Source # show :: ModuleHead l -> String Source # showList :: [ModuleHead l] -> ShowS Source #
Eq l => Eq (ModuleHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ModuleHead l -> ModuleHead l -> Bool Source # (/=) :: ModuleHead l -> ModuleHead l -> Bool Source #
Ord l => Ord (ModuleHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ModuleHead l -> ModuleHead l -> Ordering Source #

(<) :: ModuleHead l -> ModuleHead l -> Bool Source #

(<=) :: ModuleHead l -> ModuleHead l -> Bool Source #

(>) :: ModuleHead l -> ModuleHead l -> Bool Source #

(>=) :: ModuleHead l -> ModuleHead l -> Bool Source #

max :: ModuleHead l -> ModuleHead l -> ModuleHead l Source #

min :: ModuleHead l -> ModuleHead l -> ModuleHead l Source #

Pretty (ModuleHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ModuleHead l -> Doc prettyPrec :: Int -> ModuleHead l -> Doc
type Rep (ModuleHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModuleHead l) = D1 ('MetaData "ModuleHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

Warning text to optionally use in the module header of e.g. a deprecated module.

Constructors

DeprText l String |
WarnText l String |

#### Instances

Instances details

Functor WarningText Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> WarningText a -> WarningText b Source # (<$) :: a -> WarningText b -> WarningText a Source #
Foldable WarningText Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => WarningText m -> m Source #

foldMap :: Monoid m => (a -> m) -> WarningText a -> m Source #

foldMap' :: Monoid m => (a -> m) -> WarningText a -> m Source #

foldr :: (a -> b -> b) -> b -> WarningText a -> b Source #

foldr' :: (a -> b -> b) -> b -> WarningText a -> b Source #

foldl :: (b -> a -> b) -> b -> WarningText a -> b Source #

foldl' :: (b -> a -> b) -> b -> WarningText a -> b Source #

foldr1 :: (a -> a -> a) -> WarningText a -> a Source #

foldl1 :: (a -> a -> a) -> WarningText a -> a Source #

toList :: WarningText a -> [a] Source #

null :: WarningText a -> Bool Source #

length :: WarningText a -> Int Source #

elem :: Eq a => a -> WarningText a -> Bool Source #

maximum :: Ord a => WarningText a -> a Source #

minimum :: Ord a => WarningText a -> a Source #

sum :: Num a => WarningText a -> a Source #

product :: Num a => WarningText a -> a Source #

Traversable WarningText Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> WarningText a -> f (WarningText b) Source # sequenceA :: Applicative f => WarningText (f a) -> f (WarningText a) Source # mapM :: Monad m => (a -> m b) -> WarningText a -> m (WarningText b) Source # sequence :: Monad m => WarningText (m a) -> m (WarningText a) Source #
ExactP WarningText Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: WarningText SrcSpanInfo -> EP ()
Annotated WarningText Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: WarningText l -> l Source # amap :: (l -> l) -> WarningText l -> WarningText l Source #
Data l => Data (WarningText l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WarningText l) Source #

toConstr :: WarningText l -> Constr Source #

dataTypeOf :: WarningText l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WarningText l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WarningText l)) Source #

gmapT :: (forall b. Data b => b -> b) -> WarningText l -> WarningText l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WarningText l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WarningText l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> WarningText l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> WarningText l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> WarningText l -> m (WarningText l) Source #

Generic (WarningText l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (WarningText l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (WarningText l) = D1 ('MetaData "WarningText" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: WarningText l -> Rep (WarningText l) x Source #

to :: Rep (WarningText l) x -> WarningText l Source #

Show l => Show (WarningText l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> WarningText l -> ShowS Source # show :: WarningText l -> String Source # showList :: [WarningText l] -> ShowS Source #
Eq l => Eq (WarningText l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: WarningText l -> WarningText l -> Bool Source # (/=) :: WarningText l -> WarningText l -> Bool Source #
Ord l => Ord (WarningText l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: WarningText l -> WarningText l -> Ordering Source #

(<) :: WarningText l -> WarningText l -> Bool Source #

(<=) :: WarningText l -> WarningText l -> Bool Source #

(>) :: WarningText l -> WarningText l -> Bool Source #

(>=) :: WarningText l -> WarningText l -> Bool Source #

max :: WarningText l -> WarningText l -> WarningText l Source #

min :: WarningText l -> WarningText l -> WarningText l Source #

type Rep (WarningText l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (WarningText l) = D1 ('MetaData "WarningText" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

An explicit export specification.

Constructors

ExportSpecList l [ExportSpec l] |

#### Instances

Instances details

Functor ExportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ExportSpecList a -> ExportSpecList b Source # (<$) :: a -> ExportSpecList b -> ExportSpecList a Source #
Foldable ExportSpecList Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ExportSpecList m -> m Source #

foldMap :: Monoid m => (a -> m) -> ExportSpecList a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ExportSpecList a -> m Source #

foldr :: (a -> b -> b) -> b -> ExportSpecList a -> b Source #

foldr' :: (a -> b -> b) -> b -> ExportSpecList a -> b Source #

foldl :: (b -> a -> b) -> b -> ExportSpecList a -> b Source #

foldl' :: (b -> a -> b) -> b -> ExportSpecList a -> b Source #

foldr1 :: (a -> a -> a) -> ExportSpecList a -> a Source #

foldl1 :: (a -> a -> a) -> ExportSpecList a -> a Source #

toList :: ExportSpecList a -> [a] Source #

null :: ExportSpecList a -> Bool Source #

length :: ExportSpecList a -> Int Source #

elem :: Eq a => a -> ExportSpecList a -> Bool Source #

maximum :: Ord a => ExportSpecList a -> a Source #

minimum :: Ord a => ExportSpecList a -> a Source #

sum :: Num a => ExportSpecList a -> a Source #

product :: Num a => ExportSpecList a -> a Source #

Traversable ExportSpecList Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> ExportSpecList a -> f (ExportSpecList b) Source #

sequenceA :: Applicative f => ExportSpecList (f a) -> f (ExportSpecList a) Source #

mapM :: Monad m => (a -> m b) -> ExportSpecList a -> m (ExportSpecList b) Source #

sequence :: Monad m => ExportSpecList (m a) -> m (ExportSpecList a) Source #

ExactP ExportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ExportSpecList SrcSpanInfo -> EP ()
Annotated ExportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ExportSpecList l -> l Source # amap :: (l -> l) -> ExportSpecList l -> ExportSpecList l Source #
Data l => Data (ExportSpecList l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ExportSpecList l) Source #

toConstr :: ExportSpecList l -> Constr Source #

dataTypeOf :: ExportSpecList l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ExportSpecList l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ExportSpecList l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ExportSpecList l -> ExportSpecList l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpecList l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpecList l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ExportSpecList l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ExportSpecList l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpecList l -> m (ExportSpecList l) Source #

Generic (ExportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ExportSpecList l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ExportSpecList l) = D1 ('MetaData "ExportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))

Methods

from :: ExportSpecList l -> Rep (ExportSpecList l) x Source #

to :: Rep (ExportSpecList l) x -> ExportSpecList l Source #

Show l => Show (ExportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ExportSpecList l -> ShowS Source # show :: ExportSpecList l -> String Source # showList :: [ExportSpecList l] -> ShowS Source #
Eq l => Eq (ExportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ExportSpecList l -> ExportSpecList l -> Bool Source # (/=) :: ExportSpecList l -> ExportSpecList l -> Bool Source #
Ord l => Ord (ExportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ExportSpecList l -> ExportSpecList l -> Ordering Source #

(<) :: ExportSpecList l -> ExportSpecList l -> Bool Source #

(<=) :: ExportSpecList l -> ExportSpecList l -> Bool Source #

(>) :: ExportSpecList l -> ExportSpecList l -> Bool Source #

(>=) :: ExportSpecList l -> ExportSpecList l -> Bool Source #

max :: ExportSpecList l -> ExportSpecList l -> ExportSpecList l Source #

min :: ExportSpecList l -> ExportSpecList l -> ExportSpecList l Source #

Pretty (ExportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ExportSpecList l -> Doc prettyPrec :: Int -> ExportSpecList l -> Doc
type Rep (ExportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ExportSpecList l) = D1 ('MetaData "ExportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

An item in a module's export specification.

Constructors

EVar l (QName l) | variable.
EAbs l (Namespace l) (QName l) | `T`: a class or datatype exported abstractly, or a type synonym.
EThingWith l (EWildcard l) (QName l) [CName l] | `T(C_1,...,C_n)`: a class exported with some of its methods, or a datatype exported with some of its constructors.
EModuleContents l (ModuleName l) | `module M`: re-export a module.

#### Instances

Instances details

Functor ExportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ExportSpec a -> ExportSpec b Source # (<$) :: a -> ExportSpec b -> ExportSpec a Source #
Foldable ExportSpec Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ExportSpec m -> m Source #

foldMap :: Monoid m => (a -> m) -> ExportSpec a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ExportSpec a -> m Source #

foldr :: (a -> b -> b) -> b -> ExportSpec a -> b Source #

foldr' :: (a -> b -> b) -> b -> ExportSpec a -> b Source #

foldl :: (b -> a -> b) -> b -> ExportSpec a -> b Source #

foldl' :: (b -> a -> b) -> b -> ExportSpec a -> b Source #

foldr1 :: (a -> a -> a) -> ExportSpec a -> a Source #

foldl1 :: (a -> a -> a) -> ExportSpec a -> a Source #

toList :: ExportSpec a -> [a] Source #

null :: ExportSpec a -> Bool Source #

length :: ExportSpec a -> Int Source #

elem :: Eq a => a -> ExportSpec a -> Bool Source #

maximum :: Ord a => ExportSpec a -> a Source #

minimum :: Ord a => ExportSpec a -> a Source #

sum :: Num a => ExportSpec a -> a Source #

product :: Num a => ExportSpec a -> a Source #

Traversable ExportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ExportSpec a -> f (ExportSpec b) Source # sequenceA :: Applicative f => ExportSpec (f a) -> f (ExportSpec a) Source # mapM :: Monad m => (a -> m b) -> ExportSpec a -> m (ExportSpec b) Source # sequence :: Monad m => ExportSpec (m a) -> m (ExportSpec a) Source #
ExactP ExportSpec Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ExportSpec SrcSpanInfo -> EP ()
Annotated ExportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ExportSpec l -> l Source # amap :: (l -> l) -> ExportSpec l -> ExportSpec l Source #
Data l => Data (ExportSpec l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ExportSpec l) Source #

toConstr :: ExportSpec l -> Constr Source #

dataTypeOf :: ExportSpec l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ExportSpec l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ExportSpec l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ExportSpec l -> ExportSpec l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpec l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ExportSpec l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ExportSpec l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ExportSpec l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ExportSpec l -> m (ExportSpec l) Source #

Generic (ExportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ExportSpec l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ExportSpec l) = D1 ('MetaData "ExportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: ExportSpec l -> Rep (ExportSpec l) x Source #

to :: Rep (ExportSpec l) x -> ExportSpec l Source #

Show l => Show (ExportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ExportSpec l -> ShowS Source # show :: ExportSpec l -> String Source # showList :: [ExportSpec l] -> ShowS Source #
Eq l => Eq (ExportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ExportSpec l -> ExportSpec l -> Bool Source # (/=) :: ExportSpec l -> ExportSpec l -> Bool Source #
Ord l => Ord (ExportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ExportSpec l -> ExportSpec l -> Ordering Source #

(<) :: ExportSpec l -> ExportSpec l -> Bool Source #

(<=) :: ExportSpec l -> ExportSpec l -> Bool Source #

(>) :: ExportSpec l -> ExportSpec l -> Bool Source #

(>=) :: ExportSpec l -> ExportSpec l -> Bool Source #

max :: ExportSpec l -> ExportSpec l -> ExportSpec l Source #

min :: ExportSpec l -> ExportSpec l -> ExportSpec l Source #

Pretty (ExportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ExportSpec l -> Doc prettyPrec :: Int -> ExportSpec l -> Doc
type Rep (ExportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ExportSpec l) = D1 ('MetaData "ExportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data EWildcard l Source #

Indicates the position of the wildcard in an export list

Constructors

NoWildcard l |
EWildcard l Int |

#### Instances

Instances details

Functor EWildcard Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> EWildcard a -> EWildcard b Source # (<$) :: a -> EWildcard b -> EWildcard a Source #
Foldable EWildcard Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => EWildcard m -> m Source #

foldMap :: Monoid m => (a -> m) -> EWildcard a -> m Source #

foldMap' :: Monoid m => (a -> m) -> EWildcard a -> m Source #

foldr :: (a -> b -> b) -> b -> EWildcard a -> b Source #

foldr' :: (a -> b -> b) -> b -> EWildcard a -> b Source #

foldl :: (b -> a -> b) -> b -> EWildcard a -> b Source #

foldl' :: (b -> a -> b) -> b -> EWildcard a -> b Source #

foldr1 :: (a -> a -> a) -> EWildcard a -> a Source #

foldl1 :: (a -> a -> a) -> EWildcard a -> a Source #

toList :: EWildcard a -> [a] Source #

null :: EWildcard a -> Bool Source #

length :: EWildcard a -> Int Source #

elem :: Eq a => a -> EWildcard a -> Bool Source #

maximum :: Ord a => EWildcard a -> a Source #

minimum :: Ord a => EWildcard a -> a Source #

sum :: Num a => EWildcard a -> a Source #

product :: Num a => EWildcard a -> a Source #

Traversable EWildcard Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> EWildcard a -> f (EWildcard b) Source # sequenceA :: Applicative f => EWildcard (f a) -> f (EWildcard a) Source # mapM :: Monad m => (a -> m b) -> EWildcard a -> m (EWildcard b) Source # sequence :: Monad m => EWildcard (m a) -> m (EWildcard a) Source #
Annotated EWildcard Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: EWildcard l -> l Source # amap :: (l -> l) -> EWildcard l -> EWildcard l Source #
Data l => Data (EWildcard l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (EWildcard l) Source #

toConstr :: EWildcard l -> Constr Source #

dataTypeOf :: EWildcard l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (EWildcard l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (EWildcard l)) Source #

gmapT :: (forall b. Data b => b -> b) -> EWildcard l -> EWildcard l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EWildcard l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EWildcard l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> EWildcard l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EWildcard l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EWildcard l -> m (EWildcard l) Source #

Generic (EWildcard l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (EWildcard l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (EWildcard l) = D1 ('MetaData "EWildcard" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: EWildcard l -> Rep (EWildcard l) x Source #

to :: Rep (EWildcard l) x -> EWildcard l Source #

Show l => Show (EWildcard l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> EWildcard l -> ShowS Source # show :: EWildcard l -> String Source # showList :: [EWildcard l] -> ShowS Source #
Eq l => Eq (EWildcard l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: EWildcard l -> EWildcard l -> Bool Source # (/=) :: EWildcard l -> EWildcard l -> Bool Source #
Ord l => Ord (EWildcard l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: EWildcard l -> EWildcard l -> Ordering Source #

(<) :: EWildcard l -> EWildcard l -> Bool Source #

(<=) :: EWildcard l -> EWildcard l -> Bool Source #

(>) :: EWildcard l -> EWildcard l -> Bool Source #

(>=) :: EWildcard l -> EWildcard l -> Bool Source #

max :: EWildcard l -> EWildcard l -> EWildcard l Source #

min :: EWildcard l -> EWildcard l -> EWildcard l Source #

type Rep (EWildcard l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (EWildcard l) = D1 ('MetaData "EWildcard" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

An import declaration.

Constructors

ImportDecl |

Fields

- importAnn :: l

  annotation, used by parser for position of the `import` keyword.

- importModule :: ModuleName l

  name of the module imported.

- importQualified :: Bool

  imported `qualified`?

- importSrc :: Bool

  imported with `{-# SOURCE #-}`?

- importSafe :: Bool

  Import `safe`?

- importPkg :: Maybe String

  imported with explicit package name

- importAs :: Maybe (ModuleName l)

  optional alias name in an `as` clause.

- importSpecs :: Maybe (ImportSpecList l)

  optional list of import specifications.

#### Instances

Instances details

Functor ImportDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ImportDecl a -> ImportDecl b Source # (<$) :: a -> ImportDecl b -> ImportDecl a Source #
Foldable ImportDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ImportDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> ImportDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ImportDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> ImportDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> ImportDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> ImportDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> ImportDecl a -> b Source #

foldr1 :: (a -> a -> a) -> ImportDecl a -> a Source #

foldl1 :: (a -> a -> a) -> ImportDecl a -> a Source #

toList :: ImportDecl a -> [a] Source #

null :: ImportDecl a -> Bool Source #

length :: ImportDecl a -> Int Source #

elem :: Eq a => a -> ImportDecl a -> Bool Source #

maximum :: Ord a => ImportDecl a -> a Source #

minimum :: Ord a => ImportDecl a -> a Source #

sum :: Num a => ImportDecl a -> a Source #

product :: Num a => ImportDecl a -> a Source #

Traversable ImportDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ImportDecl a -> f (ImportDecl b) Source # sequenceA :: Applicative f => ImportDecl (f a) -> f (ImportDecl a) Source # mapM :: Monad m => (a -> m b) -> ImportDecl a -> m (ImportDecl b) Source # sequence :: Monad m => ImportDecl (m a) -> m (ImportDecl a) Source #
ExactP ImportDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportDecl SrcSpanInfo -> EP ()
Annotated ImportDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportDecl l -> l Source # amap :: (l -> l) -> ImportDecl l -> ImportDecl l Source #
Data l => Data (ImportDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportDecl l) Source #

toConstr :: ImportDecl l -> Constr Source #

dataTypeOf :: ImportDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ImportDecl l -> ImportDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ImportDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDecl l -> m (ImportDecl l) Source #

Generic (ImportDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ImportDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportDecl l) = D1 ('MetaData "ImportDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

Methods

from :: ImportDecl l -> Rep (ImportDecl l) x Source #

to :: Rep (ImportDecl l) x -> ImportDecl l Source #

Show l => Show (ImportDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportDecl l -> ShowS Source # show :: ImportDecl l -> String Source # showList :: [ImportDecl l] -> ShowS Source #
Eq l => Eq (ImportDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ImportDecl l -> ImportDecl l -> Bool Source # (/=) :: ImportDecl l -> ImportDecl l -> Bool Source #
Ord l => Ord (ImportDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ImportDecl l -> ImportDecl l -> Ordering Source #

(<) :: ImportDecl l -> ImportDecl l -> Bool Source #

(<=) :: ImportDecl l -> ImportDecl l -> Bool Source #

(>) :: ImportDecl l -> ImportDecl l -> Bool Source #

(>=) :: ImportDecl l -> ImportDecl l -> Bool Source #

max :: ImportDecl l -> ImportDecl l -> ImportDecl l Source #

min :: ImportDecl l -> ImportDecl l -> ImportDecl l Source #

Parseable (ImportDecl SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (ImportDecl SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (ImportDecl SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (ImportDecl SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (ImportDecl SrcSpanInfo)
Pretty (ImportDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ImportDecl l -> Doc prettyPrec :: Int -> ImportDecl l -> Doc
type Rep (ImportDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportDecl l) = D1 ('MetaData "ImportDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

An explicit import specification list.

Constructors

ImportSpecList l Bool [ImportSpec l] | A list of import specifications. The `Bool` is `True` if the names are excluded by `hiding`.

#### Instances

Instances details

Functor ImportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ImportSpecList a -> ImportSpecList b Source # (<$) :: a -> ImportSpecList b -> ImportSpecList a Source #
Foldable ImportSpecList Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ImportSpecList m -> m Source #

foldMap :: Monoid m => (a -> m) -> ImportSpecList a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ImportSpecList a -> m Source #

foldr :: (a -> b -> b) -> b -> ImportSpecList a -> b Source #

foldr' :: (a -> b -> b) -> b -> ImportSpecList a -> b Source #

foldl :: (b -> a -> b) -> b -> ImportSpecList a -> b Source #

foldl' :: (b -> a -> b) -> b -> ImportSpecList a -> b Source #

foldr1 :: (a -> a -> a) -> ImportSpecList a -> a Source #

foldl1 :: (a -> a -> a) -> ImportSpecList a -> a Source #

toList :: ImportSpecList a -> [a] Source #

null :: ImportSpecList a -> Bool Source #

length :: ImportSpecList a -> Int Source #

elem :: Eq a => a -> ImportSpecList a -> Bool Source #

maximum :: Ord a => ImportSpecList a -> a Source #

minimum :: Ord a => ImportSpecList a -> a Source #

sum :: Num a => ImportSpecList a -> a Source #

product :: Num a => ImportSpecList a -> a Source #

Traversable ImportSpecList Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> ImportSpecList a -> f (ImportSpecList b) Source #

sequenceA :: Applicative f => ImportSpecList (f a) -> f (ImportSpecList a) Source #

mapM :: Monad m => (a -> m b) -> ImportSpecList a -> m (ImportSpecList b) Source #

sequence :: Monad m => ImportSpecList (m a) -> m (ImportSpecList a) Source #

ExactP ImportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportSpecList SrcSpanInfo -> EP ()
Annotated ImportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportSpecList l -> l Source # amap :: (l -> l) -> ImportSpecList l -> ImportSpecList l Source #
Data l => Data (ImportSpecList l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportSpecList l) Source #

toConstr :: ImportSpecList l -> Constr Source #

dataTypeOf :: ImportSpecList l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportSpecList l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportSpecList l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ImportSpecList l -> ImportSpecList l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpecList l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpecList l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ImportSpecList l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpecList l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpecList l -> m (ImportSpecList l) Source #

Generic (ImportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ImportSpecList l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportSpecList l) = D1 ('MetaData "ImportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: ImportSpecList l -> Rep (ImportSpecList l) x Source #

to :: Rep (ImportSpecList l) x -> ImportSpecList l Source #

Show l => Show (ImportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportSpecList l -> ShowS Source # show :: ImportSpecList l -> String Source # showList :: [ImportSpecList l] -> ShowS Source #
Eq l => Eq (ImportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ImportSpecList l -> ImportSpecList l -> Bool Source # (/=) :: ImportSpecList l -> ImportSpecList l -> Bool Source #
Ord l => Ord (ImportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ImportSpecList l -> ImportSpecList l -> Ordering Source #

(<) :: ImportSpecList l -> ImportSpecList l -> Bool Source #

(<=) :: ImportSpecList l -> ImportSpecList l -> Bool Source #

(>) :: ImportSpecList l -> ImportSpecList l -> Bool Source #

(>=) :: ImportSpecList l -> ImportSpecList l -> Bool Source #

max :: ImportSpecList l -> ImportSpecList l -> ImportSpecList l Source #

min :: ImportSpecList l -> ImportSpecList l -> ImportSpecList l Source #

Pretty (ImportSpecList l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ImportSpecList l -> Doc prettyPrec :: Int -> ImportSpecList l -> Doc
type Rep (ImportSpecList l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportSpecList l) = D1 ('MetaData "ImportSpecList" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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) | `T`: the name of a class, datatype or type synonym.
IThingAll l (Name l) | `T(..)`: a class imported with all of its methods, or a datatype imported with all of its constructors.
IThingWith l (Name l) [CName l] | `T(C_1,...,C_n)`: a class imported with some of its methods, or a datatype imported with some of its constructors.

#### Instances

Instances details

Functor ImportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ImportSpec a -> ImportSpec b Source # (<$) :: a -> ImportSpec b -> ImportSpec a Source #
Foldable ImportSpec Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ImportSpec m -> m Source #

foldMap :: Monoid m => (a -> m) -> ImportSpec a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ImportSpec a -> m Source #

foldr :: (a -> b -> b) -> b -> ImportSpec a -> b Source #

foldr' :: (a -> b -> b) -> b -> ImportSpec a -> b Source #

foldl :: (b -> a -> b) -> b -> ImportSpec a -> b Source #

foldl' :: (b -> a -> b) -> b -> ImportSpec a -> b Source #

foldr1 :: (a -> a -> a) -> ImportSpec a -> a Source #

foldl1 :: (a -> a -> a) -> ImportSpec a -> a Source #

toList :: ImportSpec a -> [a] Source #

null :: ImportSpec a -> Bool Source #

length :: ImportSpec a -> Int Source #

elem :: Eq a => a -> ImportSpec a -> Bool Source #

maximum :: Ord a => ImportSpec a -> a Source #

minimum :: Ord a => ImportSpec a -> a Source #

sum :: Num a => ImportSpec a -> a Source #

product :: Num a => ImportSpec a -> a Source #

Traversable ImportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ImportSpec a -> f (ImportSpec b) Source # sequenceA :: Applicative f => ImportSpec (f a) -> f (ImportSpec a) Source # mapM :: Monad m => (a -> m b) -> ImportSpec a -> m (ImportSpec b) Source # sequence :: Monad m => ImportSpec (m a) -> m (ImportSpec a) Source #
ExactP ImportSpec Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ImportSpec SrcSpanInfo -> EP ()
Annotated ImportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportSpec l -> l Source # amap :: (l -> l) -> ImportSpec l -> ImportSpec l Source #
Data l => Data (ImportSpec l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ImportSpec l) Source #

toConstr :: ImportSpec l -> Constr Source #

dataTypeOf :: ImportSpec l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ImportSpec l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ImportSpec l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ImportSpec l -> ImportSpec l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ImportSpec l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec l -> m (ImportSpec l) Source #

Generic (ImportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ImportSpec l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportSpec l) = D1 ('MetaData "ImportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

Methods

from :: ImportSpec l -> Rep (ImportSpec l) x Source #

to :: Rep (ImportSpec l) x -> ImportSpec l Source #

Show l => Show (ImportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ImportSpec l -> ShowS Source # show :: ImportSpec l -> String Source # showList :: [ImportSpec l] -> ShowS Source #
Eq l => Eq (ImportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ImportSpec l -> ImportSpec l -> Bool Source # (/=) :: ImportSpec l -> ImportSpec l -> Bool Source #
Ord l => Ord (ImportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ImportSpec l -> ImportSpec l -> Ordering Source #

(<) :: ImportSpec l -> ImportSpec l -> Bool Source #

(<=) :: ImportSpec l -> ImportSpec l -> Bool Source #

(>) :: ImportSpec l -> ImportSpec l -> Bool Source #

(>=) :: ImportSpec l -> ImportSpec l -> Bool Source #

max :: ImportSpec l -> ImportSpec l -> ImportSpec l Source #

min :: ImportSpec l -> ImportSpec l -> ImportSpec l Source #

Pretty (ImportSpec l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ImportSpec l -> Doc prettyPrec :: Int -> ImportSpec l -> Doc
type Rep (ImportSpec l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ImportSpec l) = D1 ('MetaData "ImportSpec" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

data Assoc l Source #

Associativity of an operator.

Constructors

AssocNone l | non-associative operator (declared with `infix`)
AssocLeft l | left-associative operator (declared with `infixl`).
AssocRight l | right-associative operator (declared with `infixr`)

#### Instances

Instances details

Functor Assoc Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Assoc a -> Assoc b Source # (<$) :: a -> Assoc b -> Assoc a Source #
Foldable Assoc Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Assoc m -> m Source #

foldMap :: Monoid m => (a -> m) -> Assoc a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Assoc a -> m Source #

foldr :: (a -> b -> b) -> b -> Assoc a -> b Source #

foldr' :: (a -> b -> b) -> b -> Assoc a -> b Source #

foldl :: (b -> a -> b) -> b -> Assoc a -> b Source #

foldl' :: (b -> a -> b) -> b -> Assoc a -> b Source #

foldr1 :: (a -> a -> a) -> Assoc a -> a Source #

foldl1 :: (a -> a -> a) -> Assoc a -> a Source #

toList :: Assoc a -> [a] Source #

null :: Assoc a -> Bool Source #

length :: Assoc a -> Int Source #

elem :: Eq a => a -> Assoc a -> Bool Source #

maximum :: Ord a => Assoc a -> a Source #

minimum :: Ord a => Assoc a -> a Source #

sum :: Num a => Assoc a -> a Source #

product :: Num a => Assoc a -> a Source #

Traversable Assoc Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Assoc a -> f (Assoc b) Source # sequenceA :: Applicative f => Assoc (f a) -> f (Assoc a) Source # mapM :: Monad m => (a -> m b) -> Assoc a -> m (Assoc b) Source # sequence :: Monad m => Assoc (m a) -> m (Assoc a) Source #
ExactP Assoc Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Assoc SrcSpanInfo -> EP ()
Annotated Assoc Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Assoc l -> l Source # amap :: (l -> l) -> Assoc l -> Assoc l Source #
Data l => Data (Assoc l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Assoc l) Source #

toConstr :: Assoc l -> Constr Source #

dataTypeOf :: Assoc l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Assoc l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Assoc l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Assoc l -> Assoc l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Assoc l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Assoc l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Assoc l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Assoc l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Assoc l -> m (Assoc l) Source #

Generic (Assoc l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Assoc l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Assoc l) = D1 ('MetaData "Assoc" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Assoc l -> Rep (Assoc l) x Source #

to :: Rep (Assoc l) x -> Assoc l Source #

Show l => Show (Assoc l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Assoc l -> ShowS Source # show :: Assoc l -> String Source # showList :: [Assoc l] -> ShowS Source #
Eq l => Eq (Assoc l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Assoc l -> Assoc l -> Bool Source # (/=) :: Assoc l -> Assoc l -> Bool Source #
Ord l => Ord (Assoc l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Assoc l -> Assoc l -> Ordering Source # (<) :: Assoc l -> Assoc l -> Bool Source # (<=) :: Assoc l -> Assoc l -> Bool Source # (>) :: Assoc l -> Assoc l -> Bool Source # (>=) :: Assoc l -> Assoc l -> Bool Source # max :: Assoc l -> Assoc l -> Assoc l Source # min :: Assoc l -> Assoc l -> Assoc l Source #
Pretty (Assoc l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Assoc l -> Doc prettyPrec :: Int -> Assoc l -> Doc
type Rep (Assoc l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Assoc l) = D1 ('MetaData "Assoc" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data Namespace l Source #

Namespaces for imports/exports.

Constructors

NoNamespace l |
TypeNamespace l |
PatternNamespace l |

#### Instances

Instances details

Functor Namespace Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Namespace a -> Namespace b Source # (<$) :: a -> Namespace b -> Namespace a Source #
Foldable Namespace Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Namespace m -> m Source #

foldMap :: Monoid m => (a -> m) -> Namespace a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Namespace a -> m Source #

foldr :: (a -> b -> b) -> b -> Namespace a -> b Source #

foldr' :: (a -> b -> b) -> b -> Namespace a -> b Source #

foldl :: (b -> a -> b) -> b -> Namespace a -> b Source #

foldl' :: (b -> a -> b) -> b -> Namespace a -> b Source #

foldr1 :: (a -> a -> a) -> Namespace a -> a Source #

foldl1 :: (a -> a -> a) -> Namespace a -> a Source #

toList :: Namespace a -> [a] Source #

null :: Namespace a -> Bool Source #

length :: Namespace a -> Int Source #

elem :: Eq a => a -> Namespace a -> Bool Source #

maximum :: Ord a => Namespace a -> a Source #

minimum :: Ord a => Namespace a -> a Source #

sum :: Num a => Namespace a -> a Source #

product :: Num a => Namespace a -> a Source #

Traversable Namespace Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Namespace a -> f (Namespace b) Source # sequenceA :: Applicative f => Namespace (f a) -> f (Namespace a) Source # mapM :: Monad m => (a -> m b) -> Namespace a -> m (Namespace b) Source # sequence :: Monad m => Namespace (m a) -> m (Namespace a) Source #
ExactP Namespace Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Namespace SrcSpanInfo -> EP ()
Annotated Namespace Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Namespace l -> l Source # amap :: (l -> l) -> Namespace l -> Namespace l Source #
Data l => Data (Namespace l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Namespace l) Source #

toConstr :: Namespace l -> Constr Source #

dataTypeOf :: Namespace l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Namespace l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Namespace l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Namespace l -> Namespace l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Namespace l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Namespace l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Namespace l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Namespace l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Namespace l -> m (Namespace l) Source #

Generic (Namespace l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Namespace l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Namespace l) = D1 ('MetaData "Namespace" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Namespace l -> Rep (Namespace l) x Source #

to :: Rep (Namespace l) x -> Namespace l Source #

Show l => Show (Namespace l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Namespace l -> ShowS Source # show :: Namespace l -> String Source # showList :: [Namespace l] -> ShowS Source #
Eq l => Eq (Namespace l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Namespace l -> Namespace l -> Bool Source # (/=) :: Namespace l -> Namespace l -> Bool Source #
Ord l => Ord (Namespace l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Namespace l -> Namespace l -> Ordering Source #

(<) :: Namespace l -> Namespace l -> Bool Source #

(<=) :: Namespace l -> Namespace l -> Bool Source #

(>) :: Namespace l -> Namespace l -> Bool Source #

(>=) :: Namespace l -> Namespace l -> Bool Source #

max :: Namespace l -> Namespace l -> Namespace l Source #

min :: Namespace l -> Namespace l -> Namespace l Source #

Pretty (Namespace l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Namespace l -> Doc prettyPrec :: Int -> Namespace l -> Doc
type Rep (Namespace l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Namespace l) = D1 ('MetaData "Namespace" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Decl l Source #

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

Instances details

Functor Decl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Decl a -> Decl b Source # (<$) :: a -> Decl b -> Decl a Source #
Foldable Decl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Decl m -> m Source #

foldMap :: Monoid m => (a -> m) -> Decl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Decl a -> m Source #

foldr :: (a -> b -> b) -> b -> Decl a -> b Source #

foldr' :: (a -> b -> b) -> b -> Decl a -> b Source #

foldl :: (b -> a -> b) -> b -> Decl a -> b Source #

foldl' :: (b -> a -> b) -> b -> Decl a -> b Source #

foldr1 :: (a -> a -> a) -> Decl a -> a Source #

foldl1 :: (a -> a -> a) -> Decl a -> a Source #

toList :: Decl a -> [a] Source #

null :: Decl a -> Bool Source #

length :: Decl a -> Int Source #

elem :: Eq a => a -> Decl a -> Bool Source #

maximum :: Ord a => Decl a -> a Source #

minimum :: Ord a => Decl a -> a Source #

sum :: Num a => Decl a -> a Source #

product :: Num a => Decl a -> a Source #

Traversable Decl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Decl a -> f (Decl b) Source # sequenceA :: Applicative f => Decl (f a) -> f (Decl a) Source # mapM :: Monad m => (a -> m b) -> Decl a -> m (Decl b) Source # sequence :: Monad m => Decl (m a) -> m (Decl a) Source #
ExactP Decl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Decl SrcSpanInfo -> EP ()
AppFixity Decl Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Decl SrcSpanInfo -> m (Decl SrcSpanInfo) Source #
Annotated Decl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Decl l -> l Source # amap :: (l -> l) -> Decl l -> Decl l Source #
Data l => Data (Decl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Decl l) Source #

toConstr :: Decl l -> Constr Source #

dataTypeOf :: Decl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Decl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Decl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Decl l -> Decl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Decl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Decl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Decl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Decl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Decl l -> m (Decl l) Source #

Generic (Decl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Decl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Decl l) = D1 ('MetaData "Decl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))))))

Methods

from :: Decl l -> Rep (Decl l) x Source #

to :: Rep (Decl l) x -> Decl l Source #

Show l => Show (Decl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Decl l -> ShowS Source # show :: Decl l -> String Source # showList :: [Decl l] -> ShowS Source #
Eq l => Eq (Decl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Decl l -> Decl l -> Bool Source # (/=) :: Decl l -> Decl l -> Bool Source #
Ord l => Ord (Decl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Decl l -> Decl l -> Ordering Source # (<) :: Decl l -> Decl l -> Bool Source # (<=) :: Decl l -> Decl l -> Bool Source # (>) :: Decl l -> Decl l -> Bool Source # (>=) :: Decl l -> Decl l -> Bool Source # max :: Decl l -> Decl l -> Decl l Source # min :: Decl l -> Decl l -> Decl l Source #
Parseable (Decl SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Decl SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Decl SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Decl SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Decl SrcSpanInfo)
Pretty (Decl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Decl l -> Doc prettyPrec :: Int -> Decl l -> Doc
type Rep (Decl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Decl l) = D1 ('MetaData "Decl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))))))

data DeclHead l Source #

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

Instances details

Functor DeclHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> DeclHead a -> DeclHead b Source # (<$) :: a -> DeclHead b -> DeclHead a Source #
Foldable DeclHead Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => DeclHead m -> m Source #

foldMap :: Monoid m => (a -> m) -> DeclHead a -> m Source #

foldMap' :: Monoid m => (a -> m) -> DeclHead a -> m Source #

foldr :: (a -> b -> b) -> b -> DeclHead a -> b Source #

foldr' :: (a -> b -> b) -> b -> DeclHead a -> b Source #

foldl :: (b -> a -> b) -> b -> DeclHead a -> b Source #

foldl' :: (b -> a -> b) -> b -> DeclHead a -> b Source #

foldr1 :: (a -> a -> a) -> DeclHead a -> a Source #

foldl1 :: (a -> a -> a) -> DeclHead a -> a Source #

toList :: DeclHead a -> [a] Source #

null :: DeclHead a -> Bool Source #

length :: DeclHead a -> Int Source #

elem :: Eq a => a -> DeclHead a -> Bool Source #

maximum :: Ord a => DeclHead a -> a Source #

minimum :: Ord a => DeclHead a -> a Source #

sum :: Num a => DeclHead a -> a Source #

product :: Num a => DeclHead a -> a Source #

Traversable DeclHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> DeclHead a -> f (DeclHead b) Source # sequenceA :: Applicative f => DeclHead (f a) -> f (DeclHead a) Source # mapM :: Monad m => (a -> m b) -> DeclHead a -> m (DeclHead b) Source # sequence :: Monad m => DeclHead (m a) -> m (DeclHead a) Source #
ExactP DeclHead Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DeclHead SrcSpanInfo -> EP ()
Annotated DeclHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DeclHead l -> l Source # amap :: (l -> l) -> DeclHead l -> DeclHead l Source #
Data l => Data (DeclHead l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DeclHead l) Source #

toConstr :: DeclHead l -> Constr Source #

dataTypeOf :: DeclHead l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DeclHead l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DeclHead l)) Source #

gmapT :: (forall b. Data b => b -> b) -> DeclHead l -> DeclHead l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DeclHead l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DeclHead l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> DeclHead l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DeclHead l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DeclHead l -> m (DeclHead l) Source #

Generic (DeclHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (DeclHead l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DeclHead l) = D1 ('MetaData "DeclHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: DeclHead l -> Rep (DeclHead l) x Source #

to :: Rep (DeclHead l) x -> DeclHead l Source #

Show l => Show (DeclHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> DeclHead l -> ShowS Source # show :: DeclHead l -> String Source # showList :: [DeclHead l] -> ShowS Source #
Eq l => Eq (DeclHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: DeclHead l -> DeclHead l -> Bool Source # (/=) :: DeclHead l -> DeclHead l -> Bool Source #
Ord l => Ord (DeclHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: DeclHead l -> DeclHead l -> Ordering Source #

(<) :: DeclHead l -> DeclHead l -> Bool Source #

(<=) :: DeclHead l -> DeclHead l -> Bool Source #

(>) :: DeclHead l -> DeclHead l -> Bool Source #

(>=) :: DeclHead l -> DeclHead l -> Bool Source #

max :: DeclHead l -> DeclHead l -> DeclHead l Source #

min :: DeclHead l -> DeclHead l -> DeclHead l Source #

Pretty (DeclHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: DeclHead l -> Doc prettyPrec :: Int -> DeclHead l -> Doc
type Rep (DeclHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DeclHead l) = D1 ('MetaData "DeclHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data InstRule l Source #

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") ])
       ...

Constructors

IRule l (Maybe [TyVarBind l]) (Maybe (Context l)) (InstHead l) |
IParen l (InstRule l) |

#### Instances

Instances details

Functor InstRule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> InstRule a -> InstRule b Source # (<$) :: a -> InstRule b -> InstRule a Source #
Foldable InstRule Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => InstRule m -> m Source #

foldMap :: Monoid m => (a -> m) -> InstRule a -> m Source #

foldMap' :: Monoid m => (a -> m) -> InstRule a -> m Source #

foldr :: (a -> b -> b) -> b -> InstRule a -> b Source #

foldr' :: (a -> b -> b) -> b -> InstRule a -> b Source #

foldl :: (b -> a -> b) -> b -> InstRule a -> b Source #

foldl' :: (b -> a -> b) -> b -> InstRule a -> b Source #

foldr1 :: (a -> a -> a) -> InstRule a -> a Source #

foldl1 :: (a -> a -> a) -> InstRule a -> a Source #

toList :: InstRule a -> [a] Source #

null :: InstRule a -> Bool Source #

length :: InstRule a -> Int Source #

elem :: Eq a => a -> InstRule a -> Bool Source #

maximum :: Ord a => InstRule a -> a Source #

minimum :: Ord a => InstRule a -> a Source #

sum :: Num a => InstRule a -> a Source #

product :: Num a => InstRule a -> a Source #

Traversable InstRule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> InstRule a -> f (InstRule b) Source # sequenceA :: Applicative f => InstRule (f a) -> f (InstRule a) Source # mapM :: Monad m => (a -> m b) -> InstRule a -> m (InstRule b) Source # sequence :: Monad m => InstRule (m a) -> m (InstRule a) Source #
ExactP InstRule Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstRule SrcSpanInfo -> EP ()
Annotated InstRule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstRule l -> l Source # amap :: (l -> l) -> InstRule l -> InstRule l Source #
Data l => Data (InstRule l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstRule l) Source #

toConstr :: InstRule l -> Constr Source #

dataTypeOf :: InstRule l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstRule l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstRule l)) Source #

gmapT :: (forall b. Data b => b -> b) -> InstRule l -> InstRule l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstRule l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstRule l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> InstRule l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InstRule l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstRule l -> m (InstRule l) Source #

Generic (InstRule l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (InstRule l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstRule l) = D1 ('MetaData "InstRule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: InstRule l -> Rep (InstRule l) x Source #

to :: Rep (InstRule l) x -> InstRule l Source #

Show l => Show (InstRule l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> InstRule l -> ShowS Source # show :: InstRule l -> String Source # showList :: [InstRule l] -> ShowS Source #
Eq l => Eq (InstRule l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: InstRule l -> InstRule l -> Bool Source # (/=) :: InstRule l -> InstRule l -> Bool Source #
Ord l => Ord (InstRule l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: InstRule l -> InstRule l -> Ordering Source #

(<) :: InstRule l -> InstRule l -> Bool Source #

(<=) :: InstRule l -> InstRule l -> Bool Source #

(>) :: InstRule l -> InstRule l -> Bool Source #

(>=) :: InstRule l -> InstRule l -> Bool Source #

max :: InstRule l -> InstRule l -> InstRule l Source #

min :: InstRule l -> InstRule l -> InstRule l Source #

Pretty (InstRule l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: InstRule l -> Doc prettyPrec :: Int -> InstRule l -> Doc
type Rep (InstRule l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstRule l) = D1 ('MetaData "InstRule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data InstHead l Source #

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

Instances details

Functor InstHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> InstHead a -> InstHead b Source # (<$) :: a -> InstHead b -> InstHead a Source #
Foldable InstHead Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => InstHead m -> m Source #

foldMap :: Monoid m => (a -> m) -> InstHead a -> m Source #

foldMap' :: Monoid m => (a -> m) -> InstHead a -> m Source #

foldr :: (a -> b -> b) -> b -> InstHead a -> b Source #

foldr' :: (a -> b -> b) -> b -> InstHead a -> b Source #

foldl :: (b -> a -> b) -> b -> InstHead a -> b Source #

foldl' :: (b -> a -> b) -> b -> InstHead a -> b Source #

foldr1 :: (a -> a -> a) -> InstHead a -> a Source #

foldl1 :: (a -> a -> a) -> InstHead a -> a Source #

toList :: InstHead a -> [a] Source #

null :: InstHead a -> Bool Source #

length :: InstHead a -> Int Source #

elem :: Eq a => a -> InstHead a -> Bool Source #

maximum :: Ord a => InstHead a -> a Source #

minimum :: Ord a => InstHead a -> a Source #

sum :: Num a => InstHead a -> a Source #

product :: Num a => InstHead a -> a Source #

Traversable InstHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> InstHead a -> f (InstHead b) Source # sequenceA :: Applicative f => InstHead (f a) -> f (InstHead a) Source # mapM :: Monad m => (a -> m b) -> InstHead a -> m (InstHead b) Source # sequence :: Monad m => InstHead (m a) -> m (InstHead a) Source #
ExactP InstHead Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstHead SrcSpanInfo -> EP ()
Annotated InstHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstHead l -> l Source # amap :: (l -> l) -> InstHead l -> InstHead l Source #
Data l => Data (InstHead l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstHead l) Source #

toConstr :: InstHead l -> Constr Source #

dataTypeOf :: InstHead l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstHead l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstHead l)) Source #

gmapT :: (forall b. Data b => b -> b) -> InstHead l -> InstHead l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstHead l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstHead l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> InstHead l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InstHead l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstHead l -> m (InstHead l) Source #

Generic (InstHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (InstHead l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstHead l) = D1 ('MetaData "InstHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: InstHead l -> Rep (InstHead l) x Source #

to :: Rep (InstHead l) x -> InstHead l Source #

Show l => Show (InstHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> InstHead l -> ShowS Source # show :: InstHead l -> String Source # showList :: [InstHead l] -> ShowS Source #
Eq l => Eq (InstHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: InstHead l -> InstHead l -> Bool Source # (/=) :: InstHead l -> InstHead l -> Bool Source #
Ord l => Ord (InstHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: InstHead l -> InstHead l -> Ordering Source #

(<) :: InstHead l -> InstHead l -> Bool Source #

(<=) :: InstHead l -> InstHead l -> Bool Source #

(>) :: InstHead l -> InstHead l -> Bool Source #

(>=) :: InstHead l -> InstHead l -> Bool Source #

max :: InstHead l -> InstHead l -> InstHead l Source #

min :: InstHead l -> InstHead l -> InstHead l Source #

Pretty (InstHead l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: InstHead l -> Doc prettyPrec :: Int -> InstHead l -> Doc
type Rep (InstHead l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstHead l) = D1 ('MetaData "InstHead" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data Binds l Source #

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

Instances details

Functor Binds Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Binds a -> Binds b Source # (<$) :: a -> Binds b -> Binds a Source #
Foldable Binds Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Binds m -> m Source #

foldMap :: Monoid m => (a -> m) -> Binds a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Binds a -> m Source #

foldr :: (a -> b -> b) -> b -> Binds a -> b Source #

foldr' :: (a -> b -> b) -> b -> Binds a -> b Source #

foldl :: (b -> a -> b) -> b -> Binds a -> b Source #

foldl' :: (b -> a -> b) -> b -> Binds a -> b Source #

foldr1 :: (a -> a -> a) -> Binds a -> a Source #

foldl1 :: (a -> a -> a) -> Binds a -> a Source #

toList :: Binds a -> [a] Source #

null :: Binds a -> Bool Source #

length :: Binds a -> Int Source #

elem :: Eq a => a -> Binds a -> Bool Source #

maximum :: Ord a => Binds a -> a Source #

minimum :: Ord a => Binds a -> a Source #

sum :: Num a => Binds a -> a Source #

product :: Num a => Binds a -> a Source #

Traversable Binds Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Binds a -> f (Binds b) Source # sequenceA :: Applicative f => Binds (f a) -> f (Binds a) Source # mapM :: Monad m => (a -> m b) -> Binds a -> m (Binds b) Source # sequence :: Monad m => Binds (m a) -> m (Binds a) Source #
ExactP Binds Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Binds SrcSpanInfo -> EP ()
AppFixity Binds Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Binds SrcSpanInfo -> m (Binds SrcSpanInfo) Source #
Annotated Binds Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Binds l -> l Source # amap :: (l -> l) -> Binds l -> Binds l Source #
Data l => Data (Binds l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Binds l) Source #

toConstr :: Binds l -> Constr Source #

dataTypeOf :: Binds l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Binds l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Binds l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Binds l -> Binds l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Binds l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Binds l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Binds l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Binds l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Binds l -> m (Binds l) Source #

Generic (Binds l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Binds l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Binds l) = D1 ('MetaData "Binds" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))

Methods

from :: Binds l -> Rep (Binds l) x Source #

to :: Rep (Binds l) x -> Binds l Source #

Show l => Show (Binds l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Binds l -> ShowS Source # show :: Binds l -> String Source # showList :: [Binds l] -> ShowS Source #
Eq l => Eq (Binds l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Binds l -> Binds l -> Bool Source # (/=) :: Binds l -> Binds l -> Bool Source #
Ord l => Ord (Binds l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Binds l -> Binds l -> Ordering Source # (<) :: Binds l -> Binds l -> Bool Source # (<=) :: Binds l -> Binds l -> Bool Source # (>) :: Binds l -> Binds l -> Bool Source # (>=) :: Binds l -> Binds l -> Bool Source # max :: Binds l -> Binds l -> Binds l Source # min :: Binds l -> Binds l -> Binds l Source #
type Rep (Binds l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Binds l) = D1 ('MetaData "Binds" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))

data IPBind l Source #

A binding of an implicit parameter.

Constructors

IPBind l (IPName l) (Exp l) |

#### Instances

Instances details

Functor IPBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> IPBind a -> IPBind b Source # (<$) :: a -> IPBind b -> IPBind a Source #
Foldable IPBind Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => IPBind m -> m Source #

foldMap :: Monoid m => (a -> m) -> IPBind a -> m Source #

foldMap' :: Monoid m => (a -> m) -> IPBind a -> m Source #

foldr :: (a -> b -> b) -> b -> IPBind a -> b Source #

foldr' :: (a -> b -> b) -> b -> IPBind a -> b Source #

foldl :: (b -> a -> b) -> b -> IPBind a -> b Source #

foldl' :: (b -> a -> b) -> b -> IPBind a -> b Source #

foldr1 :: (a -> a -> a) -> IPBind a -> a Source #

foldl1 :: (a -> a -> a) -> IPBind a -> a Source #

toList :: IPBind a -> [a] Source #

null :: IPBind a -> Bool Source #

length :: IPBind a -> Int Source #

elem :: Eq a => a -> IPBind a -> Bool Source #

maximum :: Ord a => IPBind a -> a Source #

minimum :: Ord a => IPBind a -> a Source #

sum :: Num a => IPBind a -> a Source #

product :: Num a => IPBind a -> a Source #

Traversable IPBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> IPBind a -> f (IPBind b) Source # sequenceA :: Applicative f => IPBind (f a) -> f (IPBind a) Source # mapM :: Monad m => (a -> m b) -> IPBind a -> m (IPBind b) Source # sequence :: Monad m => IPBind (m a) -> m (IPBind a) Source #
ExactP IPBind Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: IPBind SrcSpanInfo -> EP ()
AppFixity IPBind Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> IPBind SrcSpanInfo -> m (IPBind SrcSpanInfo) Source #
Annotated IPBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: IPBind l -> l Source # amap :: (l -> l) -> IPBind l -> IPBind l Source #
Data l => Data (IPBind l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IPBind l) Source #

toConstr :: IPBind l -> Constr Source #

dataTypeOf :: IPBind l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IPBind l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IPBind l)) Source #

gmapT :: (forall b. Data b => b -> b) -> IPBind l -> IPBind l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IPBind l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IPBind l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> IPBind l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> IPBind l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IPBind l -> m (IPBind l) Source #

Generic (IPBind l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (IPBind l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (IPBind l) = D1 ('MetaData "IPBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: IPBind l -> Rep (IPBind l) x Source #

to :: Rep (IPBind l) x -> IPBind l Source #

Show l => Show (IPBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> IPBind l -> ShowS Source # show :: IPBind l -> String Source # showList :: [IPBind l] -> ShowS Source #
Eq l => Eq (IPBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: IPBind l -> IPBind l -> Bool Source # (/=) :: IPBind l -> IPBind l -> Bool Source #
Ord l => Ord (IPBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: IPBind l -> IPBind l -> Ordering Source # (<) :: IPBind l -> IPBind l -> Bool Source # (<=) :: IPBind l -> IPBind l -> Bool Source # (>) :: IPBind l -> IPBind l -> Bool Source # (>=) :: IPBind l -> IPBind l -> Bool Source # max :: IPBind l -> IPBind l -> IPBind l Source # min :: IPBind l -> IPBind l -> IPBind l Source #
Pretty (IPBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: IPBind l -> Doc prettyPrec :: Int -> IPBind l -> Doc
type Rep (IPBind l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (IPBind l) = D1 ('MetaData "IPBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor PatternSynDirection Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> PatternSynDirection a -> PatternSynDirection b Source # (<$) :: a -> PatternSynDirection b -> PatternSynDirection a Source #
Foldable PatternSynDirection Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => PatternSynDirection m -> m Source #

foldMap :: Monoid m => (a -> m) -> PatternSynDirection a -> m Source #

foldMap' :: Monoid m => (a -> m) -> PatternSynDirection a -> m Source #

foldr :: (a -> b -> b) -> b -> PatternSynDirection a -> b Source #

foldr' :: (a -> b -> b) -> b -> PatternSynDirection a -> b Source #

foldl :: (b -> a -> b) -> b -> PatternSynDirection a -> b Source #

foldl' :: (b -> a -> b) -> b -> PatternSynDirection a -> b Source #

foldr1 :: (a -> a -> a) -> PatternSynDirection a -> a Source #

foldl1 :: (a -> a -> a) -> PatternSynDirection a -> a Source #

toList :: PatternSynDirection a -> [a] Source #

null :: PatternSynDirection a -> Bool Source #

length :: PatternSynDirection a -> Int Source #

elem :: Eq a => a -> PatternSynDirection a -> Bool Source #

maximum :: Ord a => PatternSynDirection a -> a Source #

minimum :: Ord a => PatternSynDirection a -> a Source #

sum :: Num a => PatternSynDirection a -> a Source #

product :: Num a => PatternSynDirection a -> a Source #

Traversable PatternSynDirection Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> PatternSynDirection a -> f (PatternSynDirection b) Source #

sequenceA :: Applicative f => PatternSynDirection (f a) -> f (PatternSynDirection a) Source #

mapM :: Monad m => (a -> m b) -> PatternSynDirection a -> m (PatternSynDirection b) Source #

sequence :: Monad m => PatternSynDirection (m a) -> m (PatternSynDirection a) Source #

AppFixity PatternSynDirection Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PatternSynDirection SrcSpanInfo -> m (PatternSynDirection SrcSpanInfo) Source #
Data l => Data (PatternSynDirection l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PatternSynDirection l) Source #

toConstr :: PatternSynDirection l -> Constr Source #

dataTypeOf :: PatternSynDirection l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PatternSynDirection l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PatternSynDirection l)) Source #

gmapT :: (forall b. Data b => b -> b) -> PatternSynDirection l -> PatternSynDirection l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatternSynDirection l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatternSynDirection l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> PatternSynDirection l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> PatternSynDirection l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatternSynDirection l -> m (PatternSynDirection l) Source #

Generic (PatternSynDirection l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (PatternSynDirection l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PatternSynDirection l) = D1 ('MetaData "PatternSynDirection" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: PatternSynDirection l -> Rep (PatternSynDirection l) x Source #

to :: Rep (PatternSynDirection l) x -> PatternSynDirection l Source #

Show l => Show (PatternSynDirection l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> PatternSynDirection l -> ShowS Source # show :: PatternSynDirection l -> String Source # showList :: [PatternSynDirection l] -> ShowS Source #
Eq l => Eq (PatternSynDirection l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source # (/=) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source #
Ord l => Ord (PatternSynDirection l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: PatternSynDirection l -> PatternSynDirection l -> Ordering Source #

(<) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source #

(<=) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source #

(>) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source #

(>=) :: PatternSynDirection l -> PatternSynDirection l -> Bool Source #

max :: PatternSynDirection l -> PatternSynDirection l -> PatternSynDirection l Source #

min :: PatternSynDirection l -> PatternSynDirection l -> PatternSynDirection l Source #

type Rep (PatternSynDirection l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PatternSynDirection l) = D1 ('MetaData "PatternSynDirection" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

Injectivity info for injective type families

Constructors

InjectivityInfo l (Name l) [Name l] |

#### Instances

Instances details

Functor InjectivityInfo Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> InjectivityInfo a -> InjectivityInfo b Source # (<$) :: a -> InjectivityInfo b -> InjectivityInfo a Source #
Foldable InjectivityInfo Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => InjectivityInfo m -> m Source #

foldMap :: Monoid m => (a -> m) -> InjectivityInfo a -> m Source #

foldMap' :: Monoid m => (a -> m) -> InjectivityInfo a -> m Source #

foldr :: (a -> b -> b) -> b -> InjectivityInfo a -> b Source #

foldr' :: (a -> b -> b) -> b -> InjectivityInfo a -> b Source #

foldl :: (b -> a -> b) -> b -> InjectivityInfo a -> b Source #

foldl' :: (b -> a -> b) -> b -> InjectivityInfo a -> b Source #

foldr1 :: (a -> a -> a) -> InjectivityInfo a -> a Source #

foldl1 :: (a -> a -> a) -> InjectivityInfo a -> a Source #

toList :: InjectivityInfo a -> [a] Source #

null :: InjectivityInfo a -> Bool Source #

length :: InjectivityInfo a -> Int Source #

elem :: Eq a => a -> InjectivityInfo a -> Bool Source #

maximum :: Ord a => InjectivityInfo a -> a Source #

minimum :: Ord a => InjectivityInfo a -> a Source #

sum :: Num a => InjectivityInfo a -> a Source #

product :: Num a => InjectivityInfo a -> a Source #

Traversable InjectivityInfo Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> InjectivityInfo a -> f (InjectivityInfo b) Source #

sequenceA :: Applicative f => InjectivityInfo (f a) -> f (InjectivityInfo a) Source #

mapM :: Monad m => (a -> m b) -> InjectivityInfo a -> m (InjectivityInfo b) Source #

sequence :: Monad m => InjectivityInfo (m a) -> m (InjectivityInfo a) Source #

ExactP InjectivityInfo Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InjectivityInfo SrcSpanInfo -> EP ()
Annotated InjectivityInfo Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InjectivityInfo l -> l Source # amap :: (l -> l) -> InjectivityInfo l -> InjectivityInfo l Source #
Data l => Data (InjectivityInfo l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InjectivityInfo l) Source #

toConstr :: InjectivityInfo l -> Constr Source #

dataTypeOf :: InjectivityInfo l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InjectivityInfo l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InjectivityInfo l)) Source #

gmapT :: (forall b. Data b => b -> b) -> InjectivityInfo l -> InjectivityInfo l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityInfo l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InjectivityInfo l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> InjectivityInfo l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InjectivityInfo l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InjectivityInfo l -> m (InjectivityInfo l) Source #

Generic (InjectivityInfo l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (InjectivityInfo l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InjectivityInfo l) = D1 ('MetaData "InjectivityInfo" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: InjectivityInfo l -> Rep (InjectivityInfo l) x Source #

to :: Rep (InjectivityInfo l) x -> InjectivityInfo l Source #

Show l => Show (InjectivityInfo l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> InjectivityInfo l -> ShowS Source # show :: InjectivityInfo l -> String Source # showList :: [InjectivityInfo l] -> ShowS Source #
Eq l => Eq (InjectivityInfo l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source # (/=) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source #
Ord l => Ord (InjectivityInfo l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: InjectivityInfo l -> InjectivityInfo l -> Ordering Source #

(<) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source #

(<=) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source #

(>) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source #

(>=) :: InjectivityInfo l -> InjectivityInfo l -> Bool Source #

max :: InjectivityInfo l -> InjectivityInfo l -> InjectivityInfo l Source #

min :: InjectivityInfo l -> InjectivityInfo l -> InjectivityInfo l Source #

Pretty (InjectivityInfo l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: InjectivityInfo l -> Doc prettyPrec :: Int -> InjectivityInfo l -> Doc
type Rep (InjectivityInfo l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InjectivityInfo l) = D1 ('MetaData "InjectivityInfo" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

data ResultSig l Source #

Constructors

KindSig l (Kind l) |
TyVarSig l (TyVarBind l) |

#### Instances

Instances details

Functor ResultSig Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ResultSig a -> ResultSig b Source # (<$) :: a -> ResultSig b -> ResultSig a Source #
Foldable ResultSig Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ResultSig m -> m Source #

foldMap :: Monoid m => (a -> m) -> ResultSig a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ResultSig a -> m Source #

foldr :: (a -> b -> b) -> b -> ResultSig a -> b Source #

foldr' :: (a -> b -> b) -> b -> ResultSig a -> b Source #

foldl :: (b -> a -> b) -> b -> ResultSig a -> b Source #

foldl' :: (b -> a -> b) -> b -> ResultSig a -> b Source #

foldr1 :: (a -> a -> a) -> ResultSig a -> a Source #

foldl1 :: (a -> a -> a) -> ResultSig a -> a Source #

toList :: ResultSig a -> [a] Source #

null :: ResultSig a -> Bool Source #

length :: ResultSig a -> Int Source #

elem :: Eq a => a -> ResultSig a -> Bool Source #

maximum :: Ord a => ResultSig a -> a Source #

minimum :: Ord a => ResultSig a -> a Source #

sum :: Num a => ResultSig a -> a Source #

product :: Num a => ResultSig a -> a Source #

Traversable ResultSig Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ResultSig a -> f (ResultSig b) Source # sequenceA :: Applicative f => ResultSig (f a) -> f (ResultSig a) Source # mapM :: Monad m => (a -> m b) -> ResultSig a -> m (ResultSig b) Source # sequence :: Monad m => ResultSig (m a) -> m (ResultSig a) Source #
ExactP ResultSig Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ResultSig SrcSpanInfo -> EP ()
Annotated ResultSig Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ResultSig l -> l Source # amap :: (l -> l) -> ResultSig l -> ResultSig l Source #
Data l => Data (ResultSig l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ResultSig l) Source #

toConstr :: ResultSig l -> Constr Source #

dataTypeOf :: ResultSig l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ResultSig l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ResultSig l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ResultSig l -> ResultSig l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ResultSig l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ResultSig l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ResultSig l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ResultSig l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ResultSig l -> m (ResultSig l) Source #

Generic (ResultSig l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ResultSig l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ResultSig l) = D1 ('MetaData "ResultSig" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: ResultSig l -> Rep (ResultSig l) x Source #

to :: Rep (ResultSig l) x -> ResultSig l Source #

Show l => Show (ResultSig l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ResultSig l -> ShowS Source # show :: ResultSig l -> String Source # showList :: [ResultSig l] -> ShowS Source #
Eq l => Eq (ResultSig l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ResultSig l -> ResultSig l -> Bool Source # (/=) :: ResultSig l -> ResultSig l -> Bool Source #
Ord l => Ord (ResultSig l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ResultSig l -> ResultSig l -> Ordering Source #

(<) :: ResultSig l -> ResultSig l -> Bool Source #

(<=) :: ResultSig l -> ResultSig l -> Bool Source #

(>) :: ResultSig l -> ResultSig l -> Bool Source #

(>=) :: ResultSig l -> ResultSig l -> Bool Source #

max :: ResultSig l -> ResultSig l -> ResultSig l Source #

min :: ResultSig l -> ResultSig l -> ResultSig l Source #

Pretty (ResultSig l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ResultSig l -> Doc prettyPrec :: Int -> ResultSig l -> Doc
type Rep (ResultSig l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ResultSig l) = D1 ('MetaData "ResultSig" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data ClassDecl l Source #

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

Instances details

Functor ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ClassDecl a -> ClassDecl b Source # (<$) :: a -> ClassDecl b -> ClassDecl a Source #
Foldable ClassDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ClassDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> ClassDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ClassDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> ClassDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> ClassDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> ClassDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> ClassDecl a -> b Source #

foldr1 :: (a -> a -> a) -> ClassDecl a -> a Source #

foldl1 :: (a -> a -> a) -> ClassDecl a -> a Source #

toList :: ClassDecl a -> [a] Source #

null :: ClassDecl a -> Bool Source #

length :: ClassDecl a -> Int Source #

elem :: Eq a => a -> ClassDecl a -> Bool Source #

maximum :: Ord a => ClassDecl a -> a Source #

minimum :: Ord a => ClassDecl a -> a Source #

sum :: Num a => ClassDecl a -> a Source #

product :: Num a => ClassDecl a -> a Source #

Traversable ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ClassDecl a -> f (ClassDecl b) Source # sequenceA :: Applicative f => ClassDecl (f a) -> f (ClassDecl a) Source # mapM :: Monad m => (a -> m b) -> ClassDecl a -> m (ClassDecl b) Source # sequence :: Monad m => ClassDecl (m a) -> m (ClassDecl a) Source #
ExactP ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ClassDecl SrcSpanInfo -> EP ()
AppFixity ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> ClassDecl SrcSpanInfo -> m (ClassDecl SrcSpanInfo) Source #
Annotated ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ClassDecl l -> l Source # amap :: (l -> l) -> ClassDecl l -> ClassDecl l Source #
Data l => Data (ClassDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ClassDecl l) Source #

toConstr :: ClassDecl l -> Constr Source #

dataTypeOf :: ClassDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ClassDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ClassDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ClassDecl l -> ClassDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ClassDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ClassDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ClassDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ClassDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ClassDecl l -> m (ClassDecl l) Source #

Generic (ClassDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ClassDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ClassDecl l) = D1 ('MetaData "ClassDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

Methods

from :: ClassDecl l -> Rep (ClassDecl l) x Source #

to :: Rep (ClassDecl l) x -> ClassDecl l Source #

Show l => Show (ClassDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ClassDecl l -> ShowS Source # show :: ClassDecl l -> String Source # showList :: [ClassDecl l] -> ShowS Source #
Eq l => Eq (ClassDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ClassDecl l -> ClassDecl l -> Bool Source # (/=) :: ClassDecl l -> ClassDecl l -> Bool Source #
Ord l => Ord (ClassDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ClassDecl l -> ClassDecl l -> Ordering Source #

(<) :: ClassDecl l -> ClassDecl l -> Bool Source #

(<=) :: ClassDecl l -> ClassDecl l -> Bool Source #

(>) :: ClassDecl l -> ClassDecl l -> Bool Source #

(>=) :: ClassDecl l -> ClassDecl l -> Bool Source #

max :: ClassDecl l -> ClassDecl l -> ClassDecl l Source #

min :: ClassDecl l -> ClassDecl l -> ClassDecl l Source #

Pretty (ClassDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ClassDecl l -> Doc prettyPrec :: Int -> ClassDecl l -> Doc
type Rep (ClassDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ClassDecl l) = D1 ('MetaData "ClassDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

data InstDecl l Source #

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

Instances details

Functor InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> InstDecl a -> InstDecl b Source # (<$) :: a -> InstDecl b -> InstDecl a Source #
Foldable InstDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => InstDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> InstDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> InstDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> InstDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> InstDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> InstDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> InstDecl a -> b Source #

foldr1 :: (a -> a -> a) -> InstDecl a -> a Source #

foldl1 :: (a -> a -> a) -> InstDecl a -> a Source #

toList :: InstDecl a -> [a] Source #

null :: InstDecl a -> Bool Source #

length :: InstDecl a -> Int Source #

elem :: Eq a => a -> InstDecl a -> Bool Source #

maximum :: Ord a => InstDecl a -> a Source #

minimum :: Ord a => InstDecl a -> a Source #

sum :: Num a => InstDecl a -> a Source #

product :: Num a => InstDecl a -> a Source #

Traversable InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> InstDecl a -> f (InstDecl b) Source # sequenceA :: Applicative f => InstDecl (f a) -> f (InstDecl a) Source # mapM :: Monad m => (a -> m b) -> InstDecl a -> m (InstDecl b) Source # sequence :: Monad m => InstDecl (m a) -> m (InstDecl a) Source #
ExactP InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: InstDecl SrcSpanInfo -> EP ()
AppFixity InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> InstDecl SrcSpanInfo -> m (InstDecl SrcSpanInfo) Source #
Annotated InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstDecl l -> l Source # amap :: (l -> l) -> InstDecl l -> InstDecl l Source #
Data l => Data (InstDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (InstDecl l) Source #

toConstr :: InstDecl l -> Constr Source #

dataTypeOf :: InstDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (InstDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (InstDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> InstDecl l -> InstDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InstDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InstDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> InstDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> InstDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InstDecl l -> m (InstDecl l) Source #

Generic (InstDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (InstDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstDecl l) = D1 ('MetaData "InstDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))))

Methods

from :: InstDecl l -> Rep (InstDecl l) x Source #

to :: Rep (InstDecl l) x -> InstDecl l Source #

Show l => Show (InstDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> InstDecl l -> ShowS Source # show :: InstDecl l -> String Source # showList :: [InstDecl l] -> ShowS Source #
Eq l => Eq (InstDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: InstDecl l -> InstDecl l -> Bool Source # (/=) :: InstDecl l -> InstDecl l -> Bool Source #
Ord l => Ord (InstDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: InstDecl l -> InstDecl l -> Ordering Source #

(<) :: InstDecl l -> InstDecl l -> Bool Source #

(<=) :: InstDecl l -> InstDecl l -> Bool Source #

(>) :: InstDecl l -> InstDecl l -> Bool Source #

(>=) :: InstDecl l -> InstDecl l -> Bool Source #

max :: InstDecl l -> InstDecl l -> InstDecl l Source #

min :: InstDecl l -> InstDecl l -> InstDecl l Source #

Pretty (InstDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: InstDecl l -> Doc prettyPrec :: Int -> InstDecl l -> Doc
type Rep (InstDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (InstDecl l) = D1 ('MetaData "InstDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))))

data Deriving l Source #

A deriving clause following a data type declaration.

Constructors

Deriving l (Maybe (DerivStrategy l)) [InstRule l] |

#### Instances

Instances details

Functor Deriving Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Deriving a -> Deriving b Source # (<$) :: a -> Deriving b -> Deriving a Source #
Foldable Deriving Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Deriving m -> m Source #

foldMap :: Monoid m => (a -> m) -> Deriving a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Deriving a -> m Source #

foldr :: (a -> b -> b) -> b -> Deriving a -> b Source #

foldr' :: (a -> b -> b) -> b -> Deriving a -> b Source #

foldl :: (b -> a -> b) -> b -> Deriving a -> b Source #

foldl' :: (b -> a -> b) -> b -> Deriving a -> b Source #

foldr1 :: (a -> a -> a) -> Deriving a -> a Source #

foldl1 :: (a -> a -> a) -> Deriving a -> a Source #

toList :: Deriving a -> [a] Source #

null :: Deriving a -> Bool Source #

length :: Deriving a -> Int Source #

elem :: Eq a => a -> Deriving a -> Bool Source #

maximum :: Ord a => Deriving a -> a Source #

minimum :: Ord a => Deriving a -> a Source #

sum :: Num a => Deriving a -> a Source #

product :: Num a => Deriving a -> a Source #

Traversable Deriving Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Deriving a -> f (Deriving b) Source # sequenceA :: Applicative f => Deriving (f a) -> f (Deriving a) Source # mapM :: Monad m => (a -> m b) -> Deriving a -> m (Deriving b) Source # sequence :: Monad m => Deriving (m a) -> m (Deriving a) Source #
ExactP Deriving Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Deriving SrcSpanInfo -> EP ()
Annotated Deriving Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Deriving l -> l Source # amap :: (l -> l) -> Deriving l -> Deriving l Source #
Data l => Data (Deriving l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Deriving l) Source #

toConstr :: Deriving l -> Constr Source #

dataTypeOf :: Deriving l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Deriving l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Deriving l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Deriving l -> Deriving l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Deriving l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Deriving l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Deriving l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Deriving l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Deriving l -> m (Deriving l) Source #

Generic (Deriving l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Deriving l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Deriving l) = D1 ('MetaData "Deriving" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: Deriving l -> Rep (Deriving l) x Source #

to :: Rep (Deriving l) x -> Deriving l Source #

Show l => Show (Deriving l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Deriving l -> ShowS Source # show :: Deriving l -> String Source # showList :: [Deriving l] -> ShowS Source #
Eq l => Eq (Deriving l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Deriving l -> Deriving l -> Bool Source # (/=) :: Deriving l -> Deriving l -> Bool Source #
Ord l => Ord (Deriving l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Deriving l -> Deriving l -> Ordering Source #

(<) :: Deriving l -> Deriving l -> Bool Source #

(<=) :: Deriving l -> Deriving l -> Bool Source #

(>) :: Deriving l -> Deriving l -> Bool Source #

(>=) :: Deriving l -> Deriving l -> Bool Source #

max :: Deriving l -> Deriving l -> Deriving l Source #

min :: Deriving l -> Deriving l -> Deriving l Source #

Pretty (Deriving l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Deriving l -> Doc prettyPrec :: Int -> Deriving l -> Doc
type Rep (Deriving l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Deriving l) = D1 ('MetaData "Deriving" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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., `Eq`, `Show`, `Functor` when `-XDeriveFunctor` is enabled, etc.)

DerivAnyclass l

    -XDeriveAnyClass

DerivNewtype l

    -XGeneralizedNewtypeDeriving

DerivVia l (Type l)

    -XDerivingVia

#### Instances

Instances details

Functor DerivStrategy Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> DerivStrategy a -> DerivStrategy b Source # (<$) :: a -> DerivStrategy b -> DerivStrategy a Source #
Foldable DerivStrategy Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => DerivStrategy m -> m Source #

foldMap :: Monoid m => (a -> m) -> DerivStrategy a -> m Source #

foldMap' :: Monoid m => (a -> m) -> DerivStrategy a -> m Source #

foldr :: (a -> b -> b) -> b -> DerivStrategy a -> b Source #

foldr' :: (a -> b -> b) -> b -> DerivStrategy a -> b Source #

foldl :: (b -> a -> b) -> b -> DerivStrategy a -> b Source #

foldl' :: (b -> a -> b) -> b -> DerivStrategy a -> b Source #

foldr1 :: (a -> a -> a) -> DerivStrategy a -> a Source #

foldl1 :: (a -> a -> a) -> DerivStrategy a -> a Source #

toList :: DerivStrategy a -> [a] Source #

null :: DerivStrategy a -> Bool Source #

length :: DerivStrategy a -> Int Source #

elem :: Eq a => a -> DerivStrategy a -> Bool Source #

maximum :: Ord a => DerivStrategy a -> a Source #

minimum :: Ord a => DerivStrategy a -> a Source #

sum :: Num a => DerivStrategy a -> a Source #

product :: Num a => DerivStrategy a -> a Source #

Traversable DerivStrategy Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> DerivStrategy a -> f (DerivStrategy b) Source # sequenceA :: Applicative f => DerivStrategy (f a) -> f (DerivStrategy a) Source # mapM :: Monad m => (a -> m b) -> DerivStrategy a -> m (DerivStrategy b) Source # sequence :: Monad m => DerivStrategy (m a) -> m (DerivStrategy a) Source #
ExactP DerivStrategy Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DerivStrategy SrcSpanInfo -> EP ()
Annotated DerivStrategy Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DerivStrategy l -> l Source # amap :: (l -> l) -> DerivStrategy l -> DerivStrategy l Source #
Data l => Data (DerivStrategy l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DerivStrategy l) Source #

toConstr :: DerivStrategy l -> Constr Source #

dataTypeOf :: DerivStrategy l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DerivStrategy l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DerivStrategy l)) Source #

gmapT :: (forall b. Data b => b -> b) -> DerivStrategy l -> DerivStrategy l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DerivStrategy l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> DerivStrategy l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DerivStrategy l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DerivStrategy l -> m (DerivStrategy l) Source #

Generic (DerivStrategy l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (DerivStrategy l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DerivStrategy l) = D1 ('MetaData "DerivStrategy" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: DerivStrategy l -> Rep (DerivStrategy l) x Source #

to :: Rep (DerivStrategy l) x -> DerivStrategy l Source #

Show l => Show (DerivStrategy l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> DerivStrategy l -> ShowS Source # show :: DerivStrategy l -> String Source # showList :: [DerivStrategy l] -> ShowS Source #
Eq l => Eq (DerivStrategy l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: DerivStrategy l -> DerivStrategy l -> Bool Source # (/=) :: DerivStrategy l -> DerivStrategy l -> Bool Source #
Ord l => Ord (DerivStrategy l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: DerivStrategy l -> DerivStrategy l -> Ordering Source #

(<) :: DerivStrategy l -> DerivStrategy l -> Bool Source #

(<=) :: DerivStrategy l -> DerivStrategy l -> Bool Source #

(>) :: DerivStrategy l -> DerivStrategy l -> Bool Source #

(>=) :: DerivStrategy l -> DerivStrategy l -> Bool Source #

max :: DerivStrategy l -> DerivStrategy l -> DerivStrategy l Source #

min :: DerivStrategy l -> DerivStrategy l -> DerivStrategy l Source #

Pretty (DerivStrategy l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: DerivStrategy l -> Doc prettyPrec :: Int -> DerivStrategy l -> Doc
type Rep (DerivStrategy l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DerivStrategy l) = D1 ('MetaData "DerivStrategy" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data DataOrNew l Source #

A flag stating whether a declaration is a data or newtype declaration.

Constructors

DataType l |
NewType l |

#### Instances

Instances details

Functor DataOrNew Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> DataOrNew a -> DataOrNew b Source # (<$) :: a -> DataOrNew b -> DataOrNew a Source #
Foldable DataOrNew Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => DataOrNew m -> m Source #

foldMap :: Monoid m => (a -> m) -> DataOrNew a -> m Source #

foldMap' :: Monoid m => (a -> m) -> DataOrNew a -> m Source #

foldr :: (a -> b -> b) -> b -> DataOrNew a -> b Source #

foldr' :: (a -> b -> b) -> b -> DataOrNew a -> b Source #

foldl :: (b -> a -> b) -> b -> DataOrNew a -> b Source #

foldl' :: (b -> a -> b) -> b -> DataOrNew a -> b Source #

foldr1 :: (a -> a -> a) -> DataOrNew a -> a Source #

foldl1 :: (a -> a -> a) -> DataOrNew a -> a Source #

toList :: DataOrNew a -> [a] Source #

null :: DataOrNew a -> Bool Source #

length :: DataOrNew a -> Int Source #

elem :: Eq a => a -> DataOrNew a -> Bool Source #

maximum :: Ord a => DataOrNew a -> a Source #

minimum :: Ord a => DataOrNew a -> a Source #

sum :: Num a => DataOrNew a -> a Source #

product :: Num a => DataOrNew a -> a Source #

Traversable DataOrNew Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> DataOrNew a -> f (DataOrNew b) Source # sequenceA :: Applicative f => DataOrNew (f a) -> f (DataOrNew a) Source # mapM :: Monad m => (a -> m b) -> DataOrNew a -> m (DataOrNew b) Source # sequence :: Monad m => DataOrNew (m a) -> m (DataOrNew a) Source #
ExactP DataOrNew Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: DataOrNew SrcSpanInfo -> EP ()
Annotated DataOrNew Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DataOrNew l -> l Source # amap :: (l -> l) -> DataOrNew l -> DataOrNew l Source #
Data l => Data (DataOrNew l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DataOrNew l) Source #

toConstr :: DataOrNew l -> Constr Source #

dataTypeOf :: DataOrNew l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DataOrNew l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DataOrNew l)) Source #

gmapT :: (forall b. Data b => b -> b) -> DataOrNew l -> DataOrNew l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataOrNew l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataOrNew l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> DataOrNew l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataOrNew l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataOrNew l -> m (DataOrNew l) Source #

Generic (DataOrNew l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (DataOrNew l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DataOrNew l) = D1 ('MetaData "DataOrNew" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: DataOrNew l -> Rep (DataOrNew l) x Source #

to :: Rep (DataOrNew l) x -> DataOrNew l Source #

Show l => Show (DataOrNew l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> DataOrNew l -> ShowS Source # show :: DataOrNew l -> String Source # showList :: [DataOrNew l] -> ShowS Source #
Eq l => Eq (DataOrNew l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: DataOrNew l -> DataOrNew l -> Bool Source # (/=) :: DataOrNew l -> DataOrNew l -> Bool Source #
Ord l => Ord (DataOrNew l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: DataOrNew l -> DataOrNew l -> Ordering Source #

(<) :: DataOrNew l -> DataOrNew l -> Bool Source #

(<=) :: DataOrNew l -> DataOrNew l -> Bool Source #

(>) :: DataOrNew l -> DataOrNew l -> Bool Source #

(>=) :: DataOrNew l -> DataOrNew l -> Bool Source #

max :: DataOrNew l -> DataOrNew l -> DataOrNew l Source #

min :: DataOrNew l -> DataOrNew l -> DataOrNew l Source #

Pretty (DataOrNew l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: DataOrNew l -> Doc prettyPrec :: Int -> DataOrNew l -> Doc
type Rep (DataOrNew l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (DataOrNew l) = D1 ('MetaData "DataOrNew" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

data ConDecl l Source #

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

Instances details

Functor ConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ConDecl a -> ConDecl b Source # (<$) :: a -> ConDecl b -> ConDecl a Source #
Foldable ConDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ConDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> ConDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ConDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> ConDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> ConDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> ConDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> ConDecl a -> b Source #

foldr1 :: (a -> a -> a) -> ConDecl a -> a Source #

foldl1 :: (a -> a -> a) -> ConDecl a -> a Source #

toList :: ConDecl a -> [a] Source #

null :: ConDecl a -> Bool Source #

length :: ConDecl a -> Int Source #

elem :: Eq a => a -> ConDecl a -> Bool Source #

maximum :: Ord a => ConDecl a -> a Source #

minimum :: Ord a => ConDecl a -> a Source #

sum :: Num a => ConDecl a -> a Source #

product :: Num a => ConDecl a -> a Source #

Traversable ConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ConDecl a -> f (ConDecl b) Source # sequenceA :: Applicative f => ConDecl (f a) -> f (ConDecl a) Source # mapM :: Monad m => (a -> m b) -> ConDecl a -> m (ConDecl b) Source # sequence :: Monad m => ConDecl (m a) -> m (ConDecl a) Source #
ExactP ConDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ConDecl SrcSpanInfo -> EP ()
Annotated ConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ConDecl l -> l Source # amap :: (l -> l) -> ConDecl l -> ConDecl l Source #
Data l => Data (ConDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ConDecl l) Source #

toConstr :: ConDecl l -> Constr Source #

dataTypeOf :: ConDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ConDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ConDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ConDecl l -> ConDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ConDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ConDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConDecl l -> m (ConDecl l) Source #

Generic (ConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ConDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ConDecl l) = D1 ('MetaData "ConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

Methods

from :: ConDecl l -> Rep (ConDecl l) x Source #

to :: Rep (ConDecl l) x -> ConDecl l Source #

Show l => Show (ConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ConDecl l -> ShowS Source # show :: ConDecl l -> String Source # showList :: [ConDecl l] -> ShowS Source #
Eq l => Eq (ConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ConDecl l -> ConDecl l -> Bool Source # (/=) :: ConDecl l -> ConDecl l -> Bool Source #
Ord l => Ord (ConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ConDecl l -> ConDecl l -> Ordering Source #

(<) :: ConDecl l -> ConDecl l -> Bool Source #

(<=) :: ConDecl l -> ConDecl l -> Bool Source #

(>) :: ConDecl l -> ConDecl l -> Bool Source #

(>=) :: ConDecl l -> ConDecl l -> Bool Source #

max :: ConDecl l -> ConDecl l -> ConDecl l Source #

min :: ConDecl l -> ConDecl l -> ConDecl l Source #

Pretty (ConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ConDecl l -> Doc prettyPrec :: Int -> ConDecl l -> Doc
type Rep (ConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ConDecl l) = D1 ('MetaData "ConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

data FieldDecl l Source #

Declaration of a (list of) named field(s).

Constructors

FieldDecl l [Name l] (Type l) |

#### Instances

Instances details

Functor FieldDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> FieldDecl a -> FieldDecl b Source # (<$) :: a -> FieldDecl b -> FieldDecl a Source #
Foldable FieldDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => FieldDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> FieldDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> FieldDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> FieldDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> FieldDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> FieldDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> FieldDecl a -> b Source #

foldr1 :: (a -> a -> a) -> FieldDecl a -> a Source #

foldl1 :: (a -> a -> a) -> FieldDecl a -> a Source #

toList :: FieldDecl a -> [a] Source #

null :: FieldDecl a -> Bool Source #

length :: FieldDecl a -> Int Source #

elem :: Eq a => a -> FieldDecl a -> Bool Source #

maximum :: Ord a => FieldDecl a -> a Source #

minimum :: Ord a => FieldDecl a -> a Source #

sum :: Num a => FieldDecl a -> a Source #

product :: Num a => FieldDecl a -> a Source #

Traversable FieldDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> FieldDecl a -> f (FieldDecl b) Source # sequenceA :: Applicative f => FieldDecl (f a) -> f (FieldDecl a) Source # mapM :: Monad m => (a -> m b) -> FieldDecl a -> m (FieldDecl b) Source # sequence :: Monad m => FieldDecl (m a) -> m (FieldDecl a) Source #
ExactP FieldDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FieldDecl SrcSpanInfo -> EP ()
Annotated FieldDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FieldDecl l -> l Source # amap :: (l -> l) -> FieldDecl l -> FieldDecl l Source #
Data l => Data (FieldDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FieldDecl l) Source #

toConstr :: FieldDecl l -> Constr Source #

dataTypeOf :: FieldDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FieldDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FieldDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> FieldDecl l -> FieldDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> FieldDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldDecl l -> m (FieldDecl l) Source #

Generic (FieldDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (FieldDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FieldDecl l) = D1 ('MetaData "FieldDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: FieldDecl l -> Rep (FieldDecl l) x Source #

to :: Rep (FieldDecl l) x -> FieldDecl l Source #

Show l => Show (FieldDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> FieldDecl l -> ShowS Source # show :: FieldDecl l -> String Source # showList :: [FieldDecl l] -> ShowS Source #
Eq l => Eq (FieldDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: FieldDecl l -> FieldDecl l -> Bool Source # (/=) :: FieldDecl l -> FieldDecl l -> Bool Source #
Ord l => Ord (FieldDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: FieldDecl l -> FieldDecl l -> Ordering Source #

(<) :: FieldDecl l -> FieldDecl l -> Bool Source #

(<=) :: FieldDecl l -> FieldDecl l -> Bool Source #

(>) :: FieldDecl l -> FieldDecl l -> Bool Source #

(>=) :: FieldDecl l -> FieldDecl l -> Bool Source #

max :: FieldDecl l -> FieldDecl l -> FieldDecl l Source #

min :: FieldDecl l -> FieldDecl l -> FieldDecl l Source #

Pretty (FieldDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: FieldDecl l -> Doc prettyPrec :: Int -> FieldDecl l -> Doc
type Rep (FieldDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FieldDecl l) = D1 ('MetaData "FieldDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor QualConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> QualConDecl a -> QualConDecl b Source # (<$) :: a -> QualConDecl b -> QualConDecl a Source #
Foldable QualConDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => QualConDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> QualConDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> QualConDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> QualConDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> QualConDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> QualConDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> QualConDecl a -> b Source #

foldr1 :: (a -> a -> a) -> QualConDecl a -> a Source #

foldl1 :: (a -> a -> a) -> QualConDecl a -> a Source #

toList :: QualConDecl a -> [a] Source #

null :: QualConDecl a -> Bool Source #

length :: QualConDecl a -> Int Source #

elem :: Eq a => a -> QualConDecl a -> Bool Source #

maximum :: Ord a => QualConDecl a -> a Source #

minimum :: Ord a => QualConDecl a -> a Source #

sum :: Num a => QualConDecl a -> a Source #

product :: Num a => QualConDecl a -> a Source #

Traversable QualConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> QualConDecl a -> f (QualConDecl b) Source # sequenceA :: Applicative f => QualConDecl (f a) -> f (QualConDecl a) Source # mapM :: Monad m => (a -> m b) -> QualConDecl a -> m (QualConDecl b) Source # sequence :: Monad m => QualConDecl (m a) -> m (QualConDecl a) Source #
ExactP QualConDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QualConDecl SrcSpanInfo -> EP ()
Annotated QualConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QualConDecl l -> l Source # amap :: (l -> l) -> QualConDecl l -> QualConDecl l Source #
Data l => Data (QualConDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QualConDecl l) Source #

toConstr :: QualConDecl l -> Constr Source #

dataTypeOf :: QualConDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QualConDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QualConDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> QualConDecl l -> QualConDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QualConDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QualConDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> QualConDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> QualConDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QualConDecl l -> m (QualConDecl l) Source #

Generic (QualConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (QualConDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QualConDecl l) = D1 ('MetaData "QualConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: QualConDecl l -> Rep (QualConDecl l) x Source #

to :: Rep (QualConDecl l) x -> QualConDecl l Source #

Show l => Show (QualConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> QualConDecl l -> ShowS Source # show :: QualConDecl l -> String Source # showList :: [QualConDecl l] -> ShowS Source #
Eq l => Eq (QualConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: QualConDecl l -> QualConDecl l -> Bool Source # (/=) :: QualConDecl l -> QualConDecl l -> Bool Source #
Ord l => Ord (QualConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: QualConDecl l -> QualConDecl l -> Ordering Source #

(<) :: QualConDecl l -> QualConDecl l -> Bool Source #

(<=) :: QualConDecl l -> QualConDecl l -> Bool Source #

(>) :: QualConDecl l -> QualConDecl l -> Bool Source #

(>=) :: QualConDecl l -> QualConDecl l -> Bool Source #

max :: QualConDecl l -> QualConDecl l -> QualConDecl l Source #

min :: QualConDecl l -> QualConDecl l -> QualConDecl l Source #

Pretty (QualConDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: QualConDecl l -> Doc prettyPrec :: Int -> QualConDecl l -> Doc
type Rep (QualConDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QualConDecl l) = D1 ('MetaData "QualConDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data GadtDecl l Source #

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 ``Maybe` [`FieldDecl` l]` is `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

Instances details

Functor GadtDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> GadtDecl a -> GadtDecl b Source # (<$) :: a -> GadtDecl b -> GadtDecl a Source #
Foldable GadtDecl Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => GadtDecl m -> m Source #

foldMap :: Monoid m => (a -> m) -> GadtDecl a -> m Source #

foldMap' :: Monoid m => (a -> m) -> GadtDecl a -> m Source #

foldr :: (a -> b -> b) -> b -> GadtDecl a -> b Source #

foldr' :: (a -> b -> b) -> b -> GadtDecl a -> b Source #

foldl :: (b -> a -> b) -> b -> GadtDecl a -> b Source #

foldl' :: (b -> a -> b) -> b -> GadtDecl a -> b Source #

foldr1 :: (a -> a -> a) -> GadtDecl a -> a Source #

foldl1 :: (a -> a -> a) -> GadtDecl a -> a Source #

toList :: GadtDecl a -> [a] Source #

null :: GadtDecl a -> Bool Source #

length :: GadtDecl a -> Int Source #

elem :: Eq a => a -> GadtDecl a -> Bool Source #

maximum :: Ord a => GadtDecl a -> a Source #

minimum :: Ord a => GadtDecl a -> a Source #

sum :: Num a => GadtDecl a -> a Source #

product :: Num a => GadtDecl a -> a Source #

Traversable GadtDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> GadtDecl a -> f (GadtDecl b) Source # sequenceA :: Applicative f => GadtDecl (f a) -> f (GadtDecl a) Source # mapM :: Monad m => (a -> m b) -> GadtDecl a -> m (GadtDecl b) Source # sequence :: Monad m => GadtDecl (m a) -> m (GadtDecl a) Source #
ExactP GadtDecl Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: GadtDecl SrcSpanInfo -> EP ()
Annotated GadtDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: GadtDecl l -> l Source # amap :: (l -> l) -> GadtDecl l -> GadtDecl l Source #
Data l => Data (GadtDecl l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GadtDecl l) Source #

toConstr :: GadtDecl l -> Constr Source #

dataTypeOf :: GadtDecl l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GadtDecl l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GadtDecl l)) Source #

gmapT :: (forall b. Data b => b -> b) -> GadtDecl l -> GadtDecl l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GadtDecl l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GadtDecl l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> GadtDecl l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> GadtDecl l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GadtDecl l -> m (GadtDecl l) Source #

Generic (GadtDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (GadtDecl l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (GadtDecl l) = D1 ('MetaData "GadtDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: GadtDecl l -> Rep (GadtDecl l) x Source #

to :: Rep (GadtDecl l) x -> GadtDecl l Source #

Show l => Show (GadtDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> GadtDecl l -> ShowS Source # show :: GadtDecl l -> String Source # showList :: [GadtDecl l] -> ShowS Source #
Eq l => Eq (GadtDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: GadtDecl l -> GadtDecl l -> Bool Source # (/=) :: GadtDecl l -> GadtDecl l -> Bool Source #
Ord l => Ord (GadtDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: GadtDecl l -> GadtDecl l -> Ordering Source #

(<) :: GadtDecl l -> GadtDecl l -> Bool Source #

(<=) :: GadtDecl l -> GadtDecl l -> Bool Source #

(>) :: GadtDecl l -> GadtDecl l -> Bool Source #

(>=) :: GadtDecl l -> GadtDecl l -> Bool Source #

max :: GadtDecl l -> GadtDecl l -> GadtDecl l Source #

min :: GadtDecl l -> GadtDecl l -> GadtDecl l Source #

Pretty (GadtDecl l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: GadtDecl l -> Doc prettyPrec :: Int -> GadtDecl l -> Doc
type Rep (GadtDecl l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (GadtDecl l) = D1 ('MetaData "GadtDecl" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data BangType l Source #

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

Instances details

Functor BangType Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> BangType a -> BangType b Source # (<$) :: a -> BangType b -> BangType a Source #
Foldable BangType Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => BangType m -> m Source #

foldMap :: Monoid m => (a -> m) -> BangType a -> m Source #

foldMap' :: Monoid m => (a -> m) -> BangType a -> m Source #

foldr :: (a -> b -> b) -> b -> BangType a -> b Source #

foldr' :: (a -> b -> b) -> b -> BangType a -> b Source #

foldl :: (b -> a -> b) -> b -> BangType a -> b Source #

foldl' :: (b -> a -> b) -> b -> BangType a -> b Source #

foldr1 :: (a -> a -> a) -> BangType a -> a Source #

foldl1 :: (a -> a -> a) -> BangType a -> a Source #

toList :: BangType a -> [a] Source #

null :: BangType a -> Bool Source #

length :: BangType a -> Int Source #

elem :: Eq a => a -> BangType a -> Bool Source #

maximum :: Ord a => BangType a -> a Source #

minimum :: Ord a => BangType a -> a Source #

sum :: Num a => BangType a -> a Source #

product :: Num a => BangType a -> a Source #

Traversable BangType Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> BangType a -> f (BangType b) Source # sequenceA :: Applicative f => BangType (f a) -> f (BangType a) Source # mapM :: Monad m => (a -> m b) -> BangType a -> m (BangType b) Source # sequence :: Monad m => BangType (m a) -> m (BangType a) Source #
ExactP BangType Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: BangType SrcSpanInfo -> EP ()
Annotated BangType Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: BangType l -> l Source # amap :: (l -> l) -> BangType l -> BangType l Source #
Data l => Data (BangType l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BangType l) Source #

toConstr :: BangType l -> Constr Source #

dataTypeOf :: BangType l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BangType l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BangType l)) Source #

gmapT :: (forall b. Data b => b -> b) -> BangType l -> BangType l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BangType l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BangType l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> BangType l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> BangType l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BangType l -> m (BangType l) Source #

Generic (BangType l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (BangType l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (BangType l) = D1 ('MetaData "BangType" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: BangType l -> Rep (BangType l) x Source #

to :: Rep (BangType l) x -> BangType l Source #

Show l => Show (BangType l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> BangType l -> ShowS Source # show :: BangType l -> String Source # showList :: [BangType l] -> ShowS Source #
Eq l => Eq (BangType l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: BangType l -> BangType l -> Bool Source # (/=) :: BangType l -> BangType l -> Bool Source #
Ord l => Ord (BangType l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: BangType l -> BangType l -> Ordering Source #

(<) :: BangType l -> BangType l -> Bool Source #

(<=) :: BangType l -> BangType l -> Bool Source #

(>) :: BangType l -> BangType l -> Bool Source #

(>=) :: BangType l -> BangType l -> Bool Source #

max :: BangType l -> BangType l -> BangType l Source #

min :: BangType l -> BangType l -> BangType l Source #

Pretty (BangType l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: BangType l -> Doc prettyPrec :: Int -> BangType l -> Doc
type Rep (BangType l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (BangType l) = D1 ('MetaData "BangType" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

Constructors

Unpack l | "`{-# UNPACK #-}`"
NoUnpack l | "`{-# NOUNPACK #-}`"
NoUnpackPragma l | No unpack pragma

#### Instances

Instances details

Functor Unpackedness Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Unpackedness a -> Unpackedness b Source # (<$) :: a -> Unpackedness b -> Unpackedness a Source #
Foldable Unpackedness Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Unpackedness m -> m Source #

foldMap :: Monoid m => (a -> m) -> Unpackedness a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Unpackedness a -> m Source #

foldr :: (a -> b -> b) -> b -> Unpackedness a -> b Source #

foldr' :: (a -> b -> b) -> b -> Unpackedness a -> b Source #

foldl :: (b -> a -> b) -> b -> Unpackedness a -> b Source #

foldl' :: (b -> a -> b) -> b -> Unpackedness a -> b Source #

foldr1 :: (a -> a -> a) -> Unpackedness a -> a Source #

foldl1 :: (a -> a -> a) -> Unpackedness a -> a Source #

toList :: Unpackedness a -> [a] Source #

null :: Unpackedness a -> Bool Source #

length :: Unpackedness a -> Int Source #

elem :: Eq a => a -> Unpackedness a -> Bool Source #

maximum :: Ord a => Unpackedness a -> a Source #

minimum :: Ord a => Unpackedness a -> a Source #

sum :: Num a => Unpackedness a -> a Source #

product :: Num a => Unpackedness a -> a Source #

Traversable Unpackedness Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Unpackedness a -> f (Unpackedness b) Source # sequenceA :: Applicative f => Unpackedness (f a) -> f (Unpackedness a) Source # mapM :: Monad m => (a -> m b) -> Unpackedness a -> m (Unpackedness b) Source # sequence :: Monad m => Unpackedness (m a) -> m (Unpackedness a) Source #
ExactP Unpackedness Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Unpackedness SrcSpanInfo -> EP ()
Annotated Unpackedness Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Unpackedness l -> l Source # amap :: (l -> l) -> Unpackedness l -> Unpackedness l Source #
Data l => Data (Unpackedness l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Unpackedness l) Source #

toConstr :: Unpackedness l -> Constr Source #

dataTypeOf :: Unpackedness l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Unpackedness l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Unpackedness l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Unpackedness l -> Unpackedness l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unpackedness l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unpackedness l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Unpackedness l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unpackedness l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unpackedness l -> m (Unpackedness l) Source #

Generic (Unpackedness l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Unpackedness l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Unpackedness l) = D1 ('MetaData "Unpackedness" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Unpackedness l -> Rep (Unpackedness l) x Source #

to :: Rep (Unpackedness l) x -> Unpackedness l Source #

Show l => Show (Unpackedness l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Unpackedness l -> ShowS Source # show :: Unpackedness l -> String Source # showList :: [Unpackedness l] -> ShowS Source #
Eq l => Eq (Unpackedness l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Unpackedness l -> Unpackedness l -> Bool Source # (/=) :: Unpackedness l -> Unpackedness l -> Bool Source #
Ord l => Ord (Unpackedness l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Unpackedness l -> Unpackedness l -> Ordering Source #

(<) :: Unpackedness l -> Unpackedness l -> Bool Source #

(<=) :: Unpackedness l -> Unpackedness l -> Bool Source #

(>) :: Unpackedness l -> Unpackedness l -> Bool Source #

(>=) :: Unpackedness l -> Unpackedness l -> Bool Source #

max :: Unpackedness l -> Unpackedness l -> Unpackedness l Source #

min :: Unpackedness l -> Unpackedness l -> Unpackedness l Source #

Pretty (Unpackedness l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Unpackedness l -> Doc prettyPrec :: Int -> Unpackedness l -> Doc
type Rep (Unpackedness l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Unpackedness l) = D1 ('MetaData "Unpackedness" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Match l Source #

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

Instances details

Functor Match Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Match a -> Match b Source # (<$) :: a -> Match b -> Match a Source #
Foldable Match Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Match m -> m Source #

foldMap :: Monoid m => (a -> m) -> Match a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Match a -> m Source #

foldr :: (a -> b -> b) -> b -> Match a -> b Source #

foldr' :: (a -> b -> b) -> b -> Match a -> b Source #

foldl :: (b -> a -> b) -> b -> Match a -> b Source #

foldl' :: (b -> a -> b) -> b -> Match a -> b Source #

foldr1 :: (a -> a -> a) -> Match a -> a Source #

foldl1 :: (a -> a -> a) -> Match a -> a Source #

toList :: Match a -> [a] Source #

null :: Match a -> Bool Source #

length :: Match a -> Int Source #

elem :: Eq a => a -> Match a -> Bool Source #

maximum :: Ord a => Match a -> a Source #

minimum :: Ord a => Match a -> a Source #

sum :: Num a => Match a -> a Source #

product :: Num a => Match a -> a Source #

Traversable Match Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Match a -> f (Match b) Source # sequenceA :: Applicative f => Match (f a) -> f (Match a) Source # mapM :: Monad m => (a -> m b) -> Match a -> m (Match b) Source # sequence :: Monad m => Match (m a) -> m (Match a) Source #
ExactP Match Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Match SrcSpanInfo -> EP ()
AppFixity Match Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Match SrcSpanInfo -> m (Match SrcSpanInfo) Source #
Annotated Match Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Match l -> l Source # amap :: (l -> l) -> Match l -> Match l Source #
Data l => Data (Match l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Match l) Source #

toConstr :: Match l -> Constr Source #

dataTypeOf :: Match l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Match l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Match l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Match l -> Match l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Match l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Match l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Match l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Match l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Match l -> m (Match l) Source #

Generic (Match l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Match l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Match l) = D1 ('MetaData "Match" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

Methods

from :: Match l -> Rep (Match l) x Source #

to :: Rep (Match l) x -> Match l Source #

Show l => Show (Match l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Match l -> ShowS Source # show :: Match l -> String Source # showList :: [Match l] -> ShowS Source #
Eq l => Eq (Match l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Match l -> Match l -> Bool Source # (/=) :: Match l -> Match l -> Bool Source #
Ord l => Ord (Match l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Match l -> Match l -> Ordering Source # (<) :: Match l -> Match l -> Bool Source # (<=) :: Match l -> Match l -> Bool Source # (>) :: Match l -> Match l -> Bool Source # (>=) :: Match l -> Match l -> Bool Source # max :: Match l -> Match l -> Match l Source # min :: Match l -> Match l -> Match l Source #
Pretty (Match l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Match l -> Doc prettyPrec :: Int -> Match l -> Doc
type Rep (Match l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Match l) = D1 ('MetaData "Match" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

data Rhs l Source #

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

Instances details

Functor Rhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Rhs a -> Rhs b Source # (<$) :: a -> Rhs b -> Rhs a Source #
Foldable Rhs Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Rhs m -> m Source #

foldMap :: Monoid m => (a -> m) -> Rhs a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Rhs a -> m Source #

foldr :: (a -> b -> b) -> b -> Rhs a -> b Source #

foldr' :: (a -> b -> b) -> b -> Rhs a -> b Source #

foldl :: (b -> a -> b) -> b -> Rhs a -> b Source #

foldl' :: (b -> a -> b) -> b -> Rhs a -> b Source #

foldr1 :: (a -> a -> a) -> Rhs a -> a Source #

foldl1 :: (a -> a -> a) -> Rhs a -> a Source #

toList :: Rhs a -> [a] Source #

null :: Rhs a -> Bool Source #

length :: Rhs a -> Int Source #

elem :: Eq a => a -> Rhs a -> Bool Source #

maximum :: Ord a => Rhs a -> a Source #

minimum :: Ord a => Rhs a -> a Source #

sum :: Num a => Rhs a -> a Source #

product :: Num a => Rhs a -> a Source #

Traversable Rhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Rhs a -> f (Rhs b) Source # sequenceA :: Applicative f => Rhs (f a) -> f (Rhs a) Source # mapM :: Monad m => (a -> m b) -> Rhs a -> m (Rhs b) Source # sequence :: Monad m => Rhs (m a) -> m (Rhs a) Source #
ExactP Rhs Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Rhs SrcSpanInfo -> EP ()
AppFixity Rhs Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Rhs SrcSpanInfo -> m (Rhs SrcSpanInfo) Source #
Annotated Rhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Rhs l -> l Source # amap :: (l -> l) -> Rhs l -> Rhs l Source #
Data l => Data (Rhs l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Rhs l) Source #

toConstr :: Rhs l -> Constr Source #

dataTypeOf :: Rhs l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Rhs l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Rhs l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Rhs l -> Rhs l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rhs l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rhs l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Rhs l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Rhs l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rhs l -> m (Rhs l) Source #

Generic (Rhs l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Rhs l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Rhs l) = D1 ('MetaData "Rhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))

Methods

from :: Rhs l -> Rep (Rhs l) x Source #

to :: Rep (Rhs l) x -> Rhs l Source #

Show l => Show (Rhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Rhs l -> ShowS Source # show :: Rhs l -> String Source # showList :: [Rhs l] -> ShowS Source #
Eq l => Eq (Rhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Rhs l -> Rhs l -> Bool Source # (/=) :: Rhs l -> Rhs l -> Bool Source #
Ord l => Ord (Rhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Rhs l -> Rhs l -> Ordering Source # (<) :: Rhs l -> Rhs l -> Bool Source # (<=) :: Rhs l -> Rhs l -> Bool Source # (>) :: Rhs l -> Rhs l -> Bool Source # (>=) :: Rhs l -> Rhs l -> Bool Source # max :: Rhs l -> Rhs l -> Rhs l Source # min :: Rhs l -> Rhs l -> Rhs l Source #
Pretty (Rhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Rhs l -> Doc prettyPrec :: Int -> Rhs l -> Doc
type Rep (Rhs l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Rhs l) = D1 ('MetaData "Rhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> GuardedRhs a -> GuardedRhs b Source # (<$) :: a -> GuardedRhs b -> GuardedRhs a Source #
Foldable GuardedRhs Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => GuardedRhs m -> m Source #

foldMap :: Monoid m => (a -> m) -> GuardedRhs a -> m Source #

foldMap' :: Monoid m => (a -> m) -> GuardedRhs a -> m Source #

foldr :: (a -> b -> b) -> b -> GuardedRhs a -> b Source #

foldr' :: (a -> b -> b) -> b -> GuardedRhs a -> b Source #

foldl :: (b -> a -> b) -> b -> GuardedRhs a -> b Source #

foldl' :: (b -> a -> b) -> b -> GuardedRhs a -> b Source #

foldr1 :: (a -> a -> a) -> GuardedRhs a -> a Source #

foldl1 :: (a -> a -> a) -> GuardedRhs a -> a Source #

toList :: GuardedRhs a -> [a] Source #

null :: GuardedRhs a -> Bool Source #

length :: GuardedRhs a -> Int Source #

elem :: Eq a => a -> GuardedRhs a -> Bool Source #

maximum :: Ord a => GuardedRhs a -> a Source #

minimum :: Ord a => GuardedRhs a -> a Source #

sum :: Num a => GuardedRhs a -> a Source #

product :: Num a => GuardedRhs a -> a Source #

Traversable GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> GuardedRhs a -> f (GuardedRhs b) Source # sequenceA :: Applicative f => GuardedRhs (f a) -> f (GuardedRhs a) Source # mapM :: Monad m => (a -> m b) -> GuardedRhs a -> m (GuardedRhs b) Source # sequence :: Monad m => GuardedRhs (m a) -> m (GuardedRhs a) Source #
ExactP GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: GuardedRhs SrcSpanInfo -> EP ()
AppFixity GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> GuardedRhs SrcSpanInfo -> m (GuardedRhs SrcSpanInfo) Source #
Annotated GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: GuardedRhs l -> l Source # amap :: (l -> l) -> GuardedRhs l -> GuardedRhs l Source #
Data l => Data (GuardedRhs l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GuardedRhs l) Source #

toConstr :: GuardedRhs l -> Constr Source #

dataTypeOf :: GuardedRhs l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GuardedRhs l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GuardedRhs l)) Source #

gmapT :: (forall b. Data b => b -> b) -> GuardedRhs l -> GuardedRhs l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GuardedRhs l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GuardedRhs l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> GuardedRhs l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> GuardedRhs l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GuardedRhs l -> m (GuardedRhs l) Source #

Generic (GuardedRhs l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (GuardedRhs l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (GuardedRhs l) = D1 ('MetaData "GuardedRhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: GuardedRhs l -> Rep (GuardedRhs l) x Source #

to :: Rep (GuardedRhs l) x -> GuardedRhs l Source #

Show l => Show (GuardedRhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> GuardedRhs l -> ShowS Source # show :: GuardedRhs l -> String Source # showList :: [GuardedRhs l] -> ShowS Source #
Eq l => Eq (GuardedRhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: GuardedRhs l -> GuardedRhs l -> Bool Source # (/=) :: GuardedRhs l -> GuardedRhs l -> Bool Source #
Ord l => Ord (GuardedRhs l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: GuardedRhs l -> GuardedRhs l -> Ordering Source #

(<) :: GuardedRhs l -> GuardedRhs l -> Bool Source #

(<=) :: GuardedRhs l -> GuardedRhs l -> Bool Source #

(>) :: GuardedRhs l -> GuardedRhs l -> Bool Source #

(>=) :: GuardedRhs l -> GuardedRhs l -> Bool Source #

max :: GuardedRhs l -> GuardedRhs l -> GuardedRhs l Source #

min :: GuardedRhs l -> GuardedRhs l -> GuardedRhs l Source #

Pretty (GuardedRhs l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: GuardedRhs l -> Doc prettyPrec :: Int -> GuardedRhs l -> Doc
type Rep (GuardedRhs l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (GuardedRhs l) = D1 ('MetaData "GuardedRhs" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Context l Source #

A context is a set of assertions

Constructors

CxSingle l (Asst l) |
CxTuple l [Asst l] |
CxEmpty l |

#### Instances

Instances details

Functor Context Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Context a -> Context b Source # (<$) :: a -> Context b -> Context a Source #
Foldable Context Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Context m -> m Source #

foldMap :: Monoid m => (a -> m) -> Context a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Context a -> m Source #

foldr :: (a -> b -> b) -> b -> Context a -> b Source #

foldr' :: (a -> b -> b) -> b -> Context a -> b Source #

foldl :: (b -> a -> b) -> b -> Context a -> b Source #

foldl' :: (b -> a -> b) -> b -> Context a -> b Source #

foldr1 :: (a -> a -> a) -> Context a -> a Source #

foldl1 :: (a -> a -> a) -> Context a -> a Source #

toList :: Context a -> [a] Source #

null :: Context a -> Bool Source #

length :: Context a -> Int Source #

elem :: Eq a => a -> Context a -> Bool Source #

maximum :: Ord a => Context a -> a Source #

minimum :: Ord a => Context a -> a Source #

sum :: Num a => Context a -> a Source #

product :: Num a => Context a -> a Source #

Traversable Context Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Context a -> f (Context b) Source # sequenceA :: Applicative f => Context (f a) -> f (Context a) Source # mapM :: Monad m => (a -> m b) -> Context a -> m (Context b) Source # sequence :: Monad m => Context (m a) -> m (Context a) Source #
ExactP Context Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Context SrcSpanInfo -> EP ()
Annotated Context Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Context l -> l Source # amap :: (l -> l) -> Context l -> Context l Source #
Data l => Data (Context l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Context l) Source #

toConstr :: Context l -> Constr Source #

dataTypeOf :: Context l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Context l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Context l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Context l -> Context l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Context l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Context l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Context l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Context l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Context l -> m (Context l) Source #

Generic (Context l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Context l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Context l) = D1 ('MetaData "Context" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Context l -> Rep (Context l) x Source #

to :: Rep (Context l) x -> Context l Source #

Show l => Show (Context l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Context l -> ShowS Source # show :: Context l -> String Source # showList :: [Context l] -> ShowS Source #
Eq l => Eq (Context l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Context l -> Context l -> Bool Source # (/=) :: Context l -> Context l -> Bool Source #
Ord l => Ord (Context l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Context l -> Context l -> Ordering Source #

(<) :: Context l -> Context l -> Bool Source #

(<=) :: Context l -> Context l -> Bool Source #

(>) :: Context l -> Context l -> Bool Source #

(>=) :: Context l -> Context l -> Bool Source #

max :: Context l -> Context l -> Context l Source #

min :: Context l -> Context l -> Context l Source #

Pretty (Context l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Context l -> Doc prettyPrec :: Int -> Context l -> Doc
type Rep (Context l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Context l) = D1 ('MetaData "Context" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data FunDep l Source #

A functional dependency, given on the form l1 l2 ... ln -> r2 r3 .. rn

Constructors

FunDep l [Name l] [Name l] |

#### Instances

Instances details

Functor FunDep Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> FunDep a -> FunDep b Source # (<$) :: a -> FunDep b -> FunDep a Source #
Foldable FunDep Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => FunDep m -> m Source #

foldMap :: Monoid m => (a -> m) -> FunDep a -> m Source #

foldMap' :: Monoid m => (a -> m) -> FunDep a -> m Source #

foldr :: (a -> b -> b) -> b -> FunDep a -> b Source #

foldr' :: (a -> b -> b) -> b -> FunDep a -> b Source #

foldl :: (b -> a -> b) -> b -> FunDep a -> b Source #

foldl' :: (b -> a -> b) -> b -> FunDep a -> b Source #

foldr1 :: (a -> a -> a) -> FunDep a -> a Source #

foldl1 :: (a -> a -> a) -> FunDep a -> a Source #

toList :: FunDep a -> [a] Source #

null :: FunDep a -> Bool Source #

length :: FunDep a -> Int Source #

elem :: Eq a => a -> FunDep a -> Bool Source #

maximum :: Ord a => FunDep a -> a Source #

minimum :: Ord a => FunDep a -> a Source #

sum :: Num a => FunDep a -> a Source #

product :: Num a => FunDep a -> a Source #

Traversable FunDep Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> FunDep a -> f (FunDep b) Source # sequenceA :: Applicative f => FunDep (f a) -> f (FunDep a) Source # mapM :: Monad m => (a -> m b) -> FunDep a -> m (FunDep b) Source # sequence :: Monad m => FunDep (m a) -> m (FunDep a) Source #
ExactP FunDep Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FunDep SrcSpanInfo -> EP ()
Annotated FunDep Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FunDep l -> l Source # amap :: (l -> l) -> FunDep l -> FunDep l Source #
Data l => Data (FunDep l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FunDep l) Source #

toConstr :: FunDep l -> Constr Source #

dataTypeOf :: FunDep l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FunDep l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FunDep l)) Source #

gmapT :: (forall b. Data b => b -> b) -> FunDep l -> FunDep l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunDep l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunDep l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> FunDep l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> FunDep l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunDep l -> m (FunDep l) Source #

Generic (FunDep l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (FunDep l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FunDep l) = D1 ('MetaData "FunDep" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: FunDep l -> Rep (FunDep l) x Source #

to :: Rep (FunDep l) x -> FunDep l Source #

Show l => Show (FunDep l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> FunDep l -> ShowS Source # show :: FunDep l -> String Source # showList :: [FunDep l] -> ShowS Source #
Eq l => Eq (FunDep l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: FunDep l -> FunDep l -> Bool Source # (/=) :: FunDep l -> FunDep l -> Bool Source #
Ord l => Ord (FunDep l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: FunDep l -> FunDep l -> Ordering Source # (<) :: FunDep l -> FunDep l -> Bool Source # (<=) :: FunDep l -> FunDep l -> Bool Source # (>) :: FunDep l -> FunDep l -> Bool Source # (>=) :: FunDep l -> FunDep l -> Bool Source # max :: FunDep l -> FunDep l -> FunDep l Source # min :: FunDep l -> FunDep l -> FunDep l Source #
Pretty (FunDep l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: FunDep l -> Doc prettyPrec :: Int -> FunDep l -> Doc
type Rep (FunDep l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FunDep l) = D1 ('MetaData "FunDep" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

data Asst l Source #

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

Instances details

Functor Asst Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Asst a -> Asst b Source # (<$) :: a -> Asst b -> Asst a Source #
Foldable Asst Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Asst m -> m Source #

foldMap :: Monoid m => (a -> m) -> Asst a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Asst a -> m Source #

foldr :: (a -> b -> b) -> b -> Asst a -> b Source #

foldr' :: (a -> b -> b) -> b -> Asst a -> b Source #

foldl :: (b -> a -> b) -> b -> Asst a -> b Source #

foldl' :: (b -> a -> b) -> b -> Asst a -> b Source #

foldr1 :: (a -> a -> a) -> Asst a -> a Source #

foldl1 :: (a -> a -> a) -> Asst a -> a Source #

toList :: Asst a -> [a] Source #

null :: Asst a -> Bool Source #

length :: Asst a -> Int Source #

elem :: Eq a => a -> Asst a -> Bool Source #

maximum :: Ord a => Asst a -> a Source #

minimum :: Ord a => Asst a -> a Source #

sum :: Num a => Asst a -> a Source #

product :: Num a => Asst a -> a Source #

Traversable Asst Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Asst a -> f (Asst b) Source # sequenceA :: Applicative f => Asst (f a) -> f (Asst a) Source # mapM :: Monad m => (a -> m b) -> Asst a -> m (Asst b) Source # sequence :: Monad m => Asst (m a) -> m (Asst a) Source #
ExactP Asst Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Asst SrcSpanInfo -> EP ()
Annotated Asst Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Asst l -> l Source # amap :: (l -> l) -> Asst l -> Asst l Source #
Data l => Data (Asst l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Asst l) Source #

toConstr :: Asst l -> Constr Source #

dataTypeOf :: Asst l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Asst l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Asst l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Asst l -> Asst l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Asst l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Asst l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Asst l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Asst l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Asst l -> m (Asst l) Source #

Generic (Asst l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Asst l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Asst l) = D1 ('MetaData "Asst" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Asst l -> Rep (Asst l) x Source #

to :: Rep (Asst l) x -> Asst l Source #

Show l => Show (Asst l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Asst l -> ShowS Source # show :: Asst l -> String Source # showList :: [Asst l] -> ShowS Source #
Eq l => Eq (Asst l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Asst l -> Asst l -> Bool Source # (/=) :: Asst l -> Asst l -> Bool Source #
Ord l => Ord (Asst l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Asst l -> Asst l -> Ordering Source # (<) :: Asst l -> Asst l -> Bool Source # (<=) :: Asst l -> Asst l -> Bool Source # (>) :: Asst l -> Asst l -> Bool Source # (>=) :: Asst l -> Asst l -> Bool Source # max :: Asst l -> Asst l -> Asst l Source # min :: Asst l -> Asst l -> Asst l Source #
Pretty (Asst l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Asst l -> Doc prettyPrec :: Int -> Asst l -> Doc
type Rep (Asst l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Asst l) = D1 ('MetaData "Asst" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Type l Source #

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 | `*`, the type of types
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) | `'K`, a promoted data type (-XDataKinds).
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 "`!`" or type marked with UNPACK pragma.
TyWildCard l (Maybe (Name l)) | Either an anonymous of named type wildcard

TyQuasiQuote l String String

    [$name| string |]

#### Instances

Instances details

Functor Type Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Type a -> Type b Source # (<$) :: a -> Type b -> Type a Source #
Foldable Type Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Type m -> m Source #

foldMap :: Monoid m => (a -> m) -> Type a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Type a -> m Source #

foldr :: (a -> b -> b) -> b -> Type a -> b Source #

foldr' :: (a -> b -> b) -> b -> Type a -> b Source #

foldl :: (b -> a -> b) -> b -> Type a -> b Source #

foldl' :: (b -> a -> b) -> b -> Type a -> b Source #

foldr1 :: (a -> a -> a) -> Type a -> a Source #

foldl1 :: (a -> a -> a) -> Type a -> a Source #

toList :: Type a -> [a] Source #

null :: Type a -> Bool Source #

length :: Type a -> Int Source #

elem :: Eq a => a -> Type a -> Bool Source #

maximum :: Ord a => Type a -> a Source #

minimum :: Ord a => Type a -> a Source #

sum :: Num a => Type a -> a Source #

product :: Num a => Type a -> a Source #

Traversable Type Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Type a -> f (Type b) Source # sequenceA :: Applicative f => Type (f a) -> f (Type a) Source # mapM :: Monad m => (a -> m b) -> Type a -> m (Type b) Source # sequence :: Monad m => Type (m a) -> m (Type a) Source #
ExactP Type Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Type SrcSpanInfo -> EP ()
Annotated Type Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Type l -> l Source # amap :: (l -> l) -> Type l -> Type l Source #
Data l => Data (Type l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Type l) Source #

toConstr :: Type l -> Constr Source #

dataTypeOf :: Type l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Type l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Type l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Type l -> Type l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Type l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Type l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type l -> m (Type l) Source #

Generic (Type l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Type l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Type l) = D1 ('MetaData "Type" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))))

Methods

from :: Type l -> Rep (Type l) x Source #

to :: Rep (Type l) x -> Type l Source #

Show l => Show (Type l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Type l -> ShowS Source # show :: Type l -> String Source # showList :: [Type l] -> ShowS Source #
Eq l => Eq (Type l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Type l -> Type l -> Bool Source # (/=) :: Type l -> Type l -> Bool Source #
Ord l => Ord (Type l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Type l -> Type l -> Ordering Source # (<) :: Type l -> Type l -> Bool Source # (<=) :: Type l -> Type l -> Bool Source # (>) :: Type l -> Type l -> Bool Source # (>=) :: Type l -> Type l -> Bool Source # max :: Type l -> Type l -> Type l Source # min :: Type l -> Type l -> Type l Source #
Parseable (Type SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Type SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Type SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Type SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Type SrcSpanInfo)
Pretty (Type l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Type l -> Doc prettyPrec :: Int -> Type l -> Doc
type Rep (Type l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Type l) = D1 ('MetaData "Type" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))))

data Boxed Source #

Flag denoting whether a tuple is boxed or unboxed.

Constructors

Boxed |
Unboxed |

#### Instances

Instances details

Data Boxed Source # |

Instance details

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 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Boxed Source #

toConstr :: Boxed -> Constr Source #

dataTypeOf :: Boxed -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Boxed) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boxed) Source #

gmapT :: (forall b. Data b => b -> b) -> Boxed -> Boxed Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boxed -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boxed -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Boxed -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Boxed -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxed -> m Boxed Source #

Generic Boxed Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep Boxed |
Instance details Defined in Language.Haskell.Exts.Syntax type Rep Boxed = D1 ('MetaData "Boxed" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" 'False) (C1 ('MetaCons "Boxed" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Unboxed" 'PrefixI 'False) (U1 :: Type -> Type))

Methods

from :: Boxed -> Rep Boxed x Source #

to :: Rep Boxed x -> Boxed Source #

Show Boxed Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Boxed -> ShowS Source # show :: Boxed -> String Source # showList :: [Boxed] -> ShowS Source #
Eq Boxed Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Boxed -> Boxed -> Bool Source # (/=) :: Boxed -> Boxed -> Bool Source #
Ord Boxed Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Boxed -> Boxed -> Ordering Source # (<) :: Boxed -> Boxed -> Bool Source # (<=) :: Boxed -> Boxed -> Bool Source # (>) :: Boxed -> Boxed -> Bool Source # (>=) :: Boxed -> Boxed -> Bool Source # max :: Boxed -> Boxed -> Boxed Source # min :: Boxed -> Boxed -> Boxed Source #
type Rep Boxed Source # |
Instance details Defined in Language.Haskell.Exts.Syntax type Rep Boxed = D1 ('MetaData "Boxed" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" 'False) (C1 ('MetaCons "Boxed" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Unboxed" 'PrefixI 'False) (U1 :: Type -> Type))

type Kind = Type Source #

An explicit kind annotation.

data TyVarBind l Source #

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

Instances details

Functor TyVarBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> TyVarBind a -> TyVarBind b Source # (<$) :: a -> TyVarBind b -> TyVarBind a Source #
Foldable TyVarBind Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => TyVarBind m -> m Source #

foldMap :: Monoid m => (a -> m) -> TyVarBind a -> m Source #

foldMap' :: Monoid m => (a -> m) -> TyVarBind a -> m Source #

foldr :: (a -> b -> b) -> b -> TyVarBind a -> b Source #

foldr' :: (a -> b -> b) -> b -> TyVarBind a -> b Source #

foldl :: (b -> a -> b) -> b -> TyVarBind a -> b Source #

foldl' :: (b -> a -> b) -> b -> TyVarBind a -> b Source #

foldr1 :: (a -> a -> a) -> TyVarBind a -> a Source #

foldl1 :: (a -> a -> a) -> TyVarBind a -> a Source #

toList :: TyVarBind a -> [a] Source #

null :: TyVarBind a -> Bool Source #

length :: TyVarBind a -> Int Source #

elem :: Eq a => a -> TyVarBind a -> Bool Source #

maximum :: Ord a => TyVarBind a -> a Source #

minimum :: Ord a => TyVarBind a -> a Source #

sum :: Num a => TyVarBind a -> a Source #

product :: Num a => TyVarBind a -> a Source #

Traversable TyVarBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> TyVarBind a -> f (TyVarBind b) Source # sequenceA :: Applicative f => TyVarBind (f a) -> f (TyVarBind a) Source # mapM :: Monad m => (a -> m b) -> TyVarBind a -> m (TyVarBind b) Source # sequence :: Monad m => TyVarBind (m a) -> m (TyVarBind a) Source #
ExactP TyVarBind Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: TyVarBind SrcSpanInfo -> EP ()
Annotated TyVarBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: TyVarBind l -> l Source # amap :: (l -> l) -> TyVarBind l -> TyVarBind l Source #
Data l => Data (TyVarBind l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TyVarBind l) Source #

toConstr :: TyVarBind l -> Constr Source #

dataTypeOf :: TyVarBind l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TyVarBind l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TyVarBind l)) Source #

gmapT :: (forall b. Data b => b -> b) -> TyVarBind l -> TyVarBind l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBind l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyVarBind l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> TyVarBind l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> TyVarBind l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyVarBind l -> m (TyVarBind l) Source #

Generic (TyVarBind l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (TyVarBind l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (TyVarBind l) = D1 ('MetaData "TyVarBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: TyVarBind l -> Rep (TyVarBind l) x Source #

to :: Rep (TyVarBind l) x -> TyVarBind l Source #

Show l => Show (TyVarBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> TyVarBind l -> ShowS Source # show :: TyVarBind l -> String Source # showList :: [TyVarBind l] -> ShowS Source #
Eq l => Eq (TyVarBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: TyVarBind l -> TyVarBind l -> Bool Source # (/=) :: TyVarBind l -> TyVarBind l -> Bool Source #
Ord l => Ord (TyVarBind l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: TyVarBind l -> TyVarBind l -> Ordering Source #

(<) :: TyVarBind l -> TyVarBind l -> Bool Source #

(<=) :: TyVarBind l -> TyVarBind l -> Bool Source #

(>) :: TyVarBind l -> TyVarBind l -> Bool Source #

(>=) :: TyVarBind l -> TyVarBind l -> Bool Source #

max :: TyVarBind l -> TyVarBind l -> TyVarBind l Source #

min :: TyVarBind l -> TyVarBind l -> TyVarBind l Source #

Pretty (TyVarBind l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: TyVarBind l -> Doc prettyPrec :: Int -> TyVarBind l -> Doc
type Rep (TyVarBind l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (TyVarBind l) = D1 ('MetaData "TyVarBind" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data Promoted l Source #

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

Instances details

Functor Promoted Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Promoted a -> Promoted b Source # (<$) :: a -> Promoted b -> Promoted a Source #
Foldable Promoted Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Promoted m -> m Source #

foldMap :: Monoid m => (a -> m) -> Promoted a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Promoted a -> m Source #

foldr :: (a -> b -> b) -> b -> Promoted a -> b Source #

foldr' :: (a -> b -> b) -> b -> Promoted a -> b Source #

foldl :: (b -> a -> b) -> b -> Promoted a -> b Source #

foldl' :: (b -> a -> b) -> b -> Promoted a -> b Source #

foldr1 :: (a -> a -> a) -> Promoted a -> a Source #

foldl1 :: (a -> a -> a) -> Promoted a -> a Source #

toList :: Promoted a -> [a] Source #

null :: Promoted a -> Bool Source #

length :: Promoted a -> Int Source #

elem :: Eq a => a -> Promoted a -> Bool Source #

maximum :: Ord a => Promoted a -> a Source #

minimum :: Ord a => Promoted a -> a Source #

sum :: Num a => Promoted a -> a Source #

product :: Num a => Promoted a -> a Source #

Traversable Promoted Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Promoted a -> f (Promoted b) Source # sequenceA :: Applicative f => Promoted (f a) -> f (Promoted a) Source # mapM :: Monad m => (a -> m b) -> Promoted a -> m (Promoted b) Source # sequence :: Monad m => Promoted (m a) -> m (Promoted a) Source #
ExactP Promoted Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Promoted SrcSpanInfo -> EP ()
Annotated Promoted Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Promoted l -> l Source # amap :: (l -> l) -> Promoted l -> Promoted l Source #
Data l => Data (Promoted l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Promoted l) Source #

toConstr :: Promoted l -> Constr Source #

dataTypeOf :: Promoted l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Promoted l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Promoted l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Promoted l -> Promoted l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Promoted l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Promoted l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Promoted l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Promoted l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Promoted l -> m (Promoted l) Source #

Generic (Promoted l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Promoted l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Promoted l) = D1 ('MetaData "Promoted" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Promoted l -> Rep (Promoted l) x Source #

to :: Rep (Promoted l) x -> Promoted l Source #

Show l => Show (Promoted l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Promoted l -> ShowS Source # show :: Promoted l -> String Source # showList :: [Promoted l] -> ShowS Source #
Eq l => Eq (Promoted l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Promoted l -> Promoted l -> Bool Source # (/=) :: Promoted l -> Promoted l -> Bool Source #
Ord l => Ord (Promoted l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Promoted l -> Promoted l -> Ordering Source #

(<) :: Promoted l -> Promoted l -> Bool Source #

(<=) :: Promoted l -> Promoted l -> Bool Source #

(>) :: Promoted l -> Promoted l -> Bool Source #

(>=) :: Promoted l -> Promoted l -> Bool Source #

max :: Promoted l -> Promoted l -> Promoted l Source #

min :: Promoted l -> Promoted l -> Promoted l Source #

Pretty (Promoted l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Promoted l -> Doc prettyPrec :: Int -> Promoted l -> Doc
type Rep (Promoted l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Promoted l) = D1 ('MetaData "Promoted" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data TypeEqn l Source #

A type equation as found in closed type families.

Constructors

TypeEqn l (Type l) (Type l) |

#### Instances

Instances details

Functor TypeEqn Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> TypeEqn a -> TypeEqn b Source # (<$) :: a -> TypeEqn b -> TypeEqn a Source #
Foldable TypeEqn Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => TypeEqn m -> m Source #

foldMap :: Monoid m => (a -> m) -> TypeEqn a -> m Source #

foldMap' :: Monoid m => (a -> m) -> TypeEqn a -> m Source #

foldr :: (a -> b -> b) -> b -> TypeEqn a -> b Source #

foldr' :: (a -> b -> b) -> b -> TypeEqn a -> b Source #

foldl :: (b -> a -> b) -> b -> TypeEqn a -> b Source #

foldl' :: (b -> a -> b) -> b -> TypeEqn a -> b Source #

foldr1 :: (a -> a -> a) -> TypeEqn a -> a Source #

foldl1 :: (a -> a -> a) -> TypeEqn a -> a Source #

toList :: TypeEqn a -> [a] Source #

null :: TypeEqn a -> Bool Source #

length :: TypeEqn a -> Int Source #

elem :: Eq a => a -> TypeEqn a -> Bool Source #

maximum :: Ord a => TypeEqn a -> a Source #

minimum :: Ord a => TypeEqn a -> a Source #

sum :: Num a => TypeEqn a -> a Source #

product :: Num a => TypeEqn a -> a Source #

Traversable TypeEqn Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> TypeEqn a -> f (TypeEqn b) Source # sequenceA :: Applicative f => TypeEqn (f a) -> f (TypeEqn a) Source # mapM :: Monad m => (a -> m b) -> TypeEqn a -> m (TypeEqn b) Source # sequence :: Monad m => TypeEqn (m a) -> m (TypeEqn a) Source #
ExactP TypeEqn Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: TypeEqn SrcSpanInfo -> EP ()
Annotated TypeEqn Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: TypeEqn l -> l Source # amap :: (l -> l) -> TypeEqn l -> TypeEqn l Source #
Data l => Data (TypeEqn l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TypeEqn l) Source #

toConstr :: TypeEqn l -> Constr Source #

dataTypeOf :: TypeEqn l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TypeEqn l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TypeEqn l)) Source #

gmapT :: (forall b. Data b => b -> b) -> TypeEqn l -> TypeEqn l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeEqn l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeEqn l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> TypeEqn l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeEqn l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeEqn l -> m (TypeEqn l) Source #

Generic (TypeEqn l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (TypeEqn l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (TypeEqn l) = D1 ('MetaData "TypeEqn" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: TypeEqn l -> Rep (TypeEqn l) x Source #

to :: Rep (TypeEqn l) x -> TypeEqn l Source #

Show l => Show (TypeEqn l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> TypeEqn l -> ShowS Source # show :: TypeEqn l -> String Source # showList :: [TypeEqn l] -> ShowS Source #
Eq l => Eq (TypeEqn l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: TypeEqn l -> TypeEqn l -> Bool Source # (/=) :: TypeEqn l -> TypeEqn l -> Bool Source #
Ord l => Ord (TypeEqn l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: TypeEqn l -> TypeEqn l -> Ordering Source #

(<) :: TypeEqn l -> TypeEqn l -> Bool Source #

(<=) :: TypeEqn l -> TypeEqn l -> Bool Source #

(>) :: TypeEqn l -> TypeEqn l -> Bool Source #

(>=) :: TypeEqn l -> TypeEqn l -> Bool Source #

max :: TypeEqn l -> TypeEqn l -> TypeEqn l Source #

min :: TypeEqn l -> TypeEqn l -> TypeEqn l Source #

Pretty (TypeEqn l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: TypeEqn l -> Doc prettyPrec :: Int -> TypeEqn l -> Doc
type Rep (TypeEqn l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (TypeEqn l) = D1 ('MetaData "TypeEqn" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Exp l Source #

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 `-exp` (unary minus)
Lambda l [Pat l] (Exp l) | lambda expression
Let l (Binds l) (Exp l) | local declarations with `let` ... `in` ...
If l (Exp l) (Exp l) (Exp l) | `if` exp `then` exp `else` exp
MultiIf l [GuardedRhs l] | `if` `|` stmts `->` exp ...
Case l (Exp l) [Alt l] | `case` exp `of` alts
Do l [Stmt l] | `do`-expression: the last statement in the list should be an expression.
MDo l [Stmt l] | `mdo`-expression
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. `(,,3)`
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 `(`exp qop`)`
RightSection l (QOp l) (Exp l) | right section `(`qop exp`)`
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: `[from ..]`
EnumFromTo l (Exp l) (Exp l) | bounded arithmetic sequence, incrementing by 1 `[from .. to]`
EnumFromThen l (Exp l) (Exp l) | unbounded arithmetic sequence, with first two elements given `[from, then ..]`
EnumFromThenTo l (Exp l) (Exp l) (Exp l) | bounded arithmetic sequence, with first two elements given `[from, then .. to]`
ParArrayFromTo l (Exp l) (Exp l) | Parallel array bounded arithmetic sequence, incrementing by 1 `[:from .. to:]`
ParArrayFromThenTo l (Exp l) (Exp l) (Exp l) | bounded arithmetic sequence, with first two elements given `[:from, then .. to:]`
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) | `'x` for template haskell reifying of expressions
TypQuote l (QName l) | `''T` for template haskell reifying of types
BracketExp l (Bracket l) | template haskell bracket expression
SpliceExp l (Splice l) | template haskell splice expression
QuasiQuote l String String | quasi-quotaion: `[$name| string |]`
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: `proc` pat `->` exp
LeftArrApp l (Exp l) (Exp l) | arrow application (from left): exp `-<` exp
RightArrApp l (Exp l) (Exp l) | arrow application (from right): exp `>-` exp
LeftArrHighApp l (Exp l) (Exp l) | higher-order arrow application (from left): exp `-<<` exp
RightArrHighApp l (Exp l) (Exp l) | higher-order arrow application (from right): exp `>>-` exp
ArrOp l (Exp l) | arrow control operators: `(| exp |)`
LCase l [Alt l] | `case` alts

#### Instances

Instances details

Functor Exp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Exp a -> Exp b Source # (<$) :: a -> Exp b -> Exp a Source #
Foldable Exp Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Exp m -> m Source #

foldMap :: Monoid m => (a -> m) -> Exp a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Exp a -> m Source #

foldr :: (a -> b -> b) -> b -> Exp a -> b Source #

foldr' :: (a -> b -> b) -> b -> Exp a -> b Source #

foldl :: (b -> a -> b) -> b -> Exp a -> b Source #

foldl' :: (b -> a -> b) -> b -> Exp a -> b Source #

foldr1 :: (a -> a -> a) -> Exp a -> a Source #

foldl1 :: (a -> a -> a) -> Exp a -> a Source #

toList :: Exp a -> [a] Source #

null :: Exp a -> Bool Source #

length :: Exp a -> Int Source #

elem :: Eq a => a -> Exp a -> Bool Source #

maximum :: Ord a => Exp a -> a Source #

minimum :: Ord a => Exp a -> a Source #

sum :: Num a => Exp a -> a Source #

product :: Num a => Exp a -> a Source #

Traversable Exp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Exp a -> f (Exp b) Source # sequenceA :: Applicative f => Exp (f a) -> f (Exp a) Source # mapM :: Monad m => (a -> m b) -> Exp a -> m (Exp b) Source # sequence :: Monad m => Exp (m a) -> m (Exp a) Source #
ExactP Exp Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Exp SrcSpanInfo -> EP ()
AppFixity Exp Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Exp SrcSpanInfo -> m (Exp SrcSpanInfo) Source #
Annotated Exp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Exp l -> l Source # amap :: (l -> l) -> Exp l -> Exp l Source #
Data l => Data (Exp l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Exp l) Source #

toConstr :: Exp l -> Constr Source #

dataTypeOf :: Exp l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Exp l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Exp l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Exp l -> Exp l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Exp l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Exp l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Exp l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Exp l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Exp l -> m (Exp l) Source #

Generic (Exp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Exp l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Exp l) = D1 ('MetaData "Exp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))))))

Methods

from :: Exp l -> Rep (Exp l) x Source #

to :: Rep (Exp l) x -> Exp l Source #

Show l => Show (Exp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Exp l -> ShowS Source # show :: Exp l -> String Source # showList :: [Exp l] -> ShowS Source #
Eq l => Eq (Exp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Exp l -> Exp l -> Bool Source # (/=) :: Exp l -> Exp l -> Bool Source #
Ord l => Ord (Exp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Exp l -> Exp l -> Ordering Source # (<) :: Exp l -> Exp l -> Bool Source # (<=) :: Exp l -> Exp l -> Bool Source # (>) :: Exp l -> Exp l -> Bool Source # (>=) :: Exp l -> Exp l -> Bool Source # max :: Exp l -> Exp l -> Exp l Source # min :: Exp l -> Exp l -> Exp l Source #
Parseable (Exp SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Exp SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Exp SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Exp SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Exp SrcSpanInfo)
Pretty (Exp l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Exp l -> Doc prettyPrec :: Int -> Exp l -> Doc
type Rep (Exp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Exp l) = D1 ('MetaData "Exp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))))))

data Stmt l Source #

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 `<-` exp
Qualifier l (Exp l) | an exp by itself: in a `do`-expression, an action whose result is discarded; in a list comprehension and pattern guard, a guard expression
LetStmt l (Binds l) | local bindings
RecStmt l [Stmt l] | a recursive binding group for arrows

#### Instances

Instances details

Functor Stmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Stmt a -> Stmt b Source # (<$) :: a -> Stmt b -> Stmt a Source #
Foldable Stmt Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Stmt m -> m Source #

foldMap :: Monoid m => (a -> m) -> Stmt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Stmt a -> m Source #

foldr :: (a -> b -> b) -> b -> Stmt a -> b Source #

foldr' :: (a -> b -> b) -> b -> Stmt a -> b Source #

foldl :: (b -> a -> b) -> b -> Stmt a -> b Source #

foldl' :: (b -> a -> b) -> b -> Stmt a -> b Source #

foldr1 :: (a -> a -> a) -> Stmt a -> a Source #

foldl1 :: (a -> a -> a) -> Stmt a -> a Source #

toList :: Stmt a -> [a] Source #

null :: Stmt a -> Bool Source #

length :: Stmt a -> Int Source #

elem :: Eq a => a -> Stmt a -> Bool Source #

maximum :: Ord a => Stmt a -> a Source #

minimum :: Ord a => Stmt a -> a Source #

sum :: Num a => Stmt a -> a Source #

product :: Num a => Stmt a -> a Source #

Traversable Stmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Stmt a -> f (Stmt b) Source # sequenceA :: Applicative f => Stmt (f a) -> f (Stmt a) Source # mapM :: Monad m => (a -> m b) -> Stmt a -> m (Stmt b) Source # sequence :: Monad m => Stmt (m a) -> m (Stmt a) Source #
ExactP Stmt Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Stmt SrcSpanInfo -> EP ()
AppFixity Stmt Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Stmt SrcSpanInfo -> m (Stmt SrcSpanInfo) Source #
Annotated Stmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Stmt l -> l Source # amap :: (l -> l) -> Stmt l -> Stmt l Source #
Data l => Data (Stmt l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Stmt l) Source #

toConstr :: Stmt l -> Constr Source #

dataTypeOf :: Stmt l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Stmt l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Stmt l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Stmt l -> Stmt l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Stmt l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Stmt l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Stmt l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Stmt l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Stmt l -> m (Stmt l) Source #

Generic (Stmt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Stmt l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Stmt l) = D1 ('MetaData "Stmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

Methods

from :: Stmt l -> Rep (Stmt l) x Source #

to :: Rep (Stmt l) x -> Stmt l Source #

Show l => Show (Stmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Stmt l -> ShowS Source # show :: Stmt l -> String Source # showList :: [Stmt l] -> ShowS Source #
Eq l => Eq (Stmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Stmt l -> Stmt l -> Bool Source # (/=) :: Stmt l -> Stmt l -> Bool Source #
Ord l => Ord (Stmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Stmt l -> Stmt l -> Ordering Source # (<) :: Stmt l -> Stmt l -> Bool Source # (<=) :: Stmt l -> Stmt l -> Bool Source # (>) :: Stmt l -> Stmt l -> Bool Source # (>=) :: Stmt l -> Stmt l -> Bool Source # max :: Stmt l -> Stmt l -> Stmt l Source # min :: Stmt l -> Stmt l -> Stmt l Source #
Parseable (Stmt SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Stmt SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Stmt SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Stmt SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Stmt SrcSpanInfo)
Pretty (Stmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Stmt l -> Doc prettyPrec :: Int -> Stmt l -> Doc
type Rep (Stmt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Stmt l) = D1 ('MetaData "Stmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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]))))

data QualStmt l Source #

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) | `then` exp
ThenBy l (Exp l) (Exp l) | `then` exp `by` exp
GroupBy l (Exp l) | `then` `group` `by` exp
GroupUsing l (Exp l) | `then` `group` `using` exp
GroupByUsing l (Exp l) (Exp l) | `then` `group` `by` exp `using` exp

#### Instances

Instances details

Functor QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> QualStmt a -> QualStmt b Source # (<$) :: a -> QualStmt b -> QualStmt a Source #
Foldable QualStmt Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => QualStmt m -> m Source #

foldMap :: Monoid m => (a -> m) -> QualStmt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> QualStmt a -> m Source #

foldr :: (a -> b -> b) -> b -> QualStmt a -> b Source #

foldr' :: (a -> b -> b) -> b -> QualStmt a -> b Source #

foldl :: (b -> a -> b) -> b -> QualStmt a -> b Source #

foldl' :: (b -> a -> b) -> b -> QualStmt a -> b Source #

foldr1 :: (a -> a -> a) -> QualStmt a -> a Source #

foldl1 :: (a -> a -> a) -> QualStmt a -> a Source #

toList :: QualStmt a -> [a] Source #

null :: QualStmt a -> Bool Source #

length :: QualStmt a -> Int Source #

elem :: Eq a => a -> QualStmt a -> Bool Source #

maximum :: Ord a => QualStmt a -> a Source #

minimum :: Ord a => QualStmt a -> a Source #

sum :: Num a => QualStmt a -> a Source #

product :: Num a => QualStmt a -> a Source #

Traversable QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> QualStmt a -> f (QualStmt b) Source # sequenceA :: Applicative f => QualStmt (f a) -> f (QualStmt a) Source # mapM :: Monad m => (a -> m b) -> QualStmt a -> m (QualStmt b) Source # sequence :: Monad m => QualStmt (m a) -> m (QualStmt a) Source #
ExactP QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QualStmt SrcSpanInfo -> EP ()
AppFixity QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> QualStmt SrcSpanInfo -> m (QualStmt SrcSpanInfo) Source #
Annotated QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QualStmt l -> l Source # amap :: (l -> l) -> QualStmt l -> QualStmt l Source #
Data l => Data (QualStmt l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QualStmt l) Source #

toConstr :: QualStmt l -> Constr Source #

dataTypeOf :: QualStmt l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QualStmt l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QualStmt l)) Source #

gmapT :: (forall b. Data b => b -> b) -> QualStmt l -> QualStmt l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QualStmt l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QualStmt l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> QualStmt l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> QualStmt l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QualStmt l -> m (QualStmt l) Source #

Generic (QualStmt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (QualStmt l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QualStmt l) = D1 ('MetaData "QualStmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

Methods

from :: QualStmt l -> Rep (QualStmt l) x Source #

to :: Rep (QualStmt l) x -> QualStmt l Source #

Show l => Show (QualStmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> QualStmt l -> ShowS Source # show :: QualStmt l -> String Source # showList :: [QualStmt l] -> ShowS Source #
Eq l => Eq (QualStmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: QualStmt l -> QualStmt l -> Bool Source # (/=) :: QualStmt l -> QualStmt l -> Bool Source #
Ord l => Ord (QualStmt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: QualStmt l -> QualStmt l -> Ordering Source #

(<) :: QualStmt l -> QualStmt l -> Bool Source #

(<=) :: QualStmt l -> QualStmt l -> Bool Source #

(>) :: QualStmt l -> QualStmt l -> Bool Source #

(>=) :: QualStmt l -> QualStmt l -> Bool Source #

max :: QualStmt l -> QualStmt l -> QualStmt l Source #

min :: QualStmt l -> QualStmt l -> QualStmt l Source #

Pretty (QualStmt l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: QualStmt l -> Doc prettyPrec :: Int -> QualStmt l -> Doc
type Rep (QualStmt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QualStmt l) = D1 ('MetaData "QualStmt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> FieldUpdate a -> FieldUpdate b Source # (<$) :: a -> FieldUpdate b -> FieldUpdate a Source #
Foldable FieldUpdate Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => FieldUpdate m -> m Source #

foldMap :: Monoid m => (a -> m) -> FieldUpdate a -> m Source #

foldMap' :: Monoid m => (a -> m) -> FieldUpdate a -> m Source #

foldr :: (a -> b -> b) -> b -> FieldUpdate a -> b Source #

foldr' :: (a -> b -> b) -> b -> FieldUpdate a -> b Source #

foldl :: (b -> a -> b) -> b -> FieldUpdate a -> b Source #

foldl' :: (b -> a -> b) -> b -> FieldUpdate a -> b Source #

foldr1 :: (a -> a -> a) -> FieldUpdate a -> a Source #

foldl1 :: (a -> a -> a) -> FieldUpdate a -> a Source #

toList :: FieldUpdate a -> [a] Source #

null :: FieldUpdate a -> Bool Source #

length :: FieldUpdate a -> Int Source #

elem :: Eq a => a -> FieldUpdate a -> Bool Source #

maximum :: Ord a => FieldUpdate a -> a Source #

minimum :: Ord a => FieldUpdate a -> a Source #

sum :: Num a => FieldUpdate a -> a Source #

product :: Num a => FieldUpdate a -> a Source #

Traversable FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> FieldUpdate a -> f (FieldUpdate b) Source # sequenceA :: Applicative f => FieldUpdate (f a) -> f (FieldUpdate a) Source # mapM :: Monad m => (a -> m b) -> FieldUpdate a -> m (FieldUpdate b) Source # sequence :: Monad m => FieldUpdate (m a) -> m (FieldUpdate a) Source #
ExactP FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: FieldUpdate SrcSpanInfo -> EP ()
AppFixity FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> FieldUpdate SrcSpanInfo -> m (FieldUpdate SrcSpanInfo) Source #
Annotated FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FieldUpdate l -> l Source # amap :: (l -> l) -> FieldUpdate l -> FieldUpdate l Source #
Data l => Data (FieldUpdate l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (FieldUpdate l) Source #

toConstr :: FieldUpdate l -> Constr Source #

dataTypeOf :: FieldUpdate l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (FieldUpdate l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (FieldUpdate l)) Source #

gmapT :: (forall b. Data b => b -> b) -> FieldUpdate l -> FieldUpdate l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldUpdate l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldUpdate l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> FieldUpdate l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldUpdate l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldUpdate l -> m (FieldUpdate l) Source #

Generic (FieldUpdate l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (FieldUpdate l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FieldUpdate l) = D1 ('MetaData "FieldUpdate" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: FieldUpdate l -> Rep (FieldUpdate l) x Source #

to :: Rep (FieldUpdate l) x -> FieldUpdate l Source #

Show l => Show (FieldUpdate l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> FieldUpdate l -> ShowS Source # show :: FieldUpdate l -> String Source # showList :: [FieldUpdate l] -> ShowS Source #
Eq l => Eq (FieldUpdate l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: FieldUpdate l -> FieldUpdate l -> Bool Source # (/=) :: FieldUpdate l -> FieldUpdate l -> Bool Source #
Ord l => Ord (FieldUpdate l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: FieldUpdate l -> FieldUpdate l -> Ordering Source #

(<) :: FieldUpdate l -> FieldUpdate l -> Bool Source #

(<=) :: FieldUpdate l -> FieldUpdate l -> Bool Source #

(>) :: FieldUpdate l -> FieldUpdate l -> Bool Source #

(>=) :: FieldUpdate l -> FieldUpdate l -> Bool Source #

max :: FieldUpdate l -> FieldUpdate l -> FieldUpdate l Source #

min :: FieldUpdate l -> FieldUpdate l -> FieldUpdate l Source #

Pretty (FieldUpdate l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: FieldUpdate l -> Doc prettyPrec :: Int -> FieldUpdate l -> Doc
type Rep (FieldUpdate l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (FieldUpdate l) = D1 ('MetaData "FieldUpdate" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data Alt l Source #

An alt alternative in a `case` expression.

Constructors

Alt l (Pat l) (Rhs l) (Maybe (Binds l)) |

#### Instances

Instances details

Functor Alt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Alt a -> Alt b Source # (<$) :: a -> Alt b -> Alt a Source #
Foldable Alt Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Alt m -> m Source #

foldMap :: Monoid m => (a -> m) -> Alt a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Alt a -> m Source #

foldr :: (a -> b -> b) -> b -> Alt a -> b Source #

foldr' :: (a -> b -> b) -> b -> Alt a -> b Source #

foldl :: (b -> a -> b) -> b -> Alt a -> b Source #

foldl' :: (b -> a -> b) -> b -> Alt a -> b Source #

foldr1 :: (a -> a -> a) -> Alt a -> a Source #

foldl1 :: (a -> a -> a) -> Alt a -> a Source #

toList :: Alt a -> [a] Source #

null :: Alt a -> Bool Source #

length :: Alt a -> Int Source #

elem :: Eq a => a -> Alt a -> Bool Source #

maximum :: Ord a => Alt a -> a Source #

minimum :: Ord a => Alt a -> a Source #

sum :: Num a => Alt a -> a Source #

product :: Num a => Alt a -> a Source #

Traversable Alt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Alt a -> f (Alt b) Source # sequenceA :: Applicative f => Alt (f a) -> f (Alt a) Source # mapM :: Monad m => (a -> m b) -> Alt a -> m (Alt b) Source # sequence :: Monad m => Alt (m a) -> m (Alt a) Source #
ExactP Alt Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Alt SrcSpanInfo -> EP ()
AppFixity Alt Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Alt SrcSpanInfo -> m (Alt SrcSpanInfo) Source #
Annotated Alt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Alt l -> l Source # amap :: (l -> l) -> Alt l -> Alt l Source #
Data l => Data (Alt l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Alt l) Source #

toConstr :: Alt l -> Constr Source #

dataTypeOf :: Alt l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Alt l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Alt l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Alt l -> Alt l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Alt l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Alt l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Alt l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Alt l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt l -> m (Alt l) Source #

Generic (Alt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Alt l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Alt l) = D1 ('MetaData "Alt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: Alt l -> Rep (Alt l) x Source #

to :: Rep (Alt l) x -> Alt l Source #

Show l => Show (Alt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Alt l -> ShowS Source # show :: Alt l -> String Source # showList :: [Alt l] -> ShowS Source #
Eq l => Eq (Alt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Alt l -> Alt l -> Bool Source # (/=) :: Alt l -> Alt l -> Bool Source #
Ord l => Ord (Alt l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Alt l -> Alt l -> Ordering Source # (<) :: Alt l -> Alt l -> Bool Source # (<=) :: Alt l -> Alt l -> Bool Source # (>) :: Alt l -> Alt l -> Bool Source # (>=) :: Alt l -> Alt l -> Bool Source # max :: Alt l -> Alt l -> Alt l Source # min :: Alt l -> Alt l -> Alt l Source #
Pretty (Alt l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Alt l -> Doc prettyPrec :: Int -> Alt l -> Doc
type Rep (Alt l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Alt l) = D1 ('MetaData "Alt" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data XAttr l Source #

An xml attribute, which is a name-expression pair.

Constructors

XAttr l (XName l) (Exp l) |

#### Instances

Instances details

Functor XAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> XAttr a -> XAttr b Source # (<$) :: a -> XAttr b -> XAttr a Source #
Foldable XAttr Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => XAttr m -> m Source #

foldMap :: Monoid m => (a -> m) -> XAttr a -> m Source #

foldMap' :: Monoid m => (a -> m) -> XAttr a -> m Source #

foldr :: (a -> b -> b) -> b -> XAttr a -> b Source #

foldr' :: (a -> b -> b) -> b -> XAttr a -> b Source #

foldl :: (b -> a -> b) -> b -> XAttr a -> b Source #

foldl' :: (b -> a -> b) -> b -> XAttr a -> b Source #

foldr1 :: (a -> a -> a) -> XAttr a -> a Source #

foldl1 :: (a -> a -> a) -> XAttr a -> a Source #

toList :: XAttr a -> [a] Source #

null :: XAttr a -> Bool Source #

length :: XAttr a -> Int Source #

elem :: Eq a => a -> XAttr a -> Bool Source #

maximum :: Ord a => XAttr a -> a Source #

minimum :: Ord a => XAttr a -> a Source #

sum :: Num a => XAttr a -> a Source #

product :: Num a => XAttr a -> a Source #

Traversable XAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> XAttr a -> f (XAttr b) Source # sequenceA :: Applicative f => XAttr (f a) -> f (XAttr a) Source # mapM :: Monad m => (a -> m b) -> XAttr a -> m (XAttr b) Source # sequence :: Monad m => XAttr (m a) -> m (XAttr a) Source #
ExactP XAttr Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: XAttr SrcSpanInfo -> EP ()
AppFixity XAttr Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> XAttr SrcSpanInfo -> m (XAttr SrcSpanInfo) Source #
Annotated XAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: XAttr l -> l Source # amap :: (l -> l) -> XAttr l -> XAttr l Source #
Data l => Data (XAttr l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (XAttr l) Source #

toConstr :: XAttr l -> Constr Source #

dataTypeOf :: XAttr l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (XAttr l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (XAttr l)) Source #

gmapT :: (forall b. Data b => b -> b) -> XAttr l -> XAttr l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XAttr l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XAttr l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> XAttr l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> XAttr l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XAttr l -> m (XAttr l) Source #

Generic (XAttr l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (XAttr l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (XAttr l) = D1 ('MetaData "XAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: XAttr l -> Rep (XAttr l) x Source #

to :: Rep (XAttr l) x -> XAttr l Source #

Show l => Show (XAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> XAttr l -> ShowS Source # show :: XAttr l -> String Source # showList :: [XAttr l] -> ShowS Source #
Eq l => Eq (XAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: XAttr l -> XAttr l -> Bool Source # (/=) :: XAttr l -> XAttr l -> Bool Source #
Ord l => Ord (XAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: XAttr l -> XAttr l -> Ordering Source # (<) :: XAttr l -> XAttr l -> Bool Source # (<=) :: XAttr l -> XAttr l -> Bool Source # (>) :: XAttr l -> XAttr l -> Bool Source # (>=) :: XAttr l -> XAttr l -> Bool Source # max :: XAttr l -> XAttr l -> XAttr l Source # min :: XAttr l -> XAttr l -> XAttr l Source #
Pretty (XAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: XAttr l -> Doc prettyPrec :: Int -> XAttr l -> Doc
type Rep (XAttr l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (XAttr l) = D1 ('MetaData "XAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Pat l Source #

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) | `@`-pattern
PWildCard l | wildcard pattern: `_`
PIrrPat l (Pat l) | irrefutable pattern: `~pat`
PatTypeSig l (Pat l) (Type l) | pattern with type signature
PViewPat l (Exp l) (Pat l) | view patterns of the form `(exp -> pat)`
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: `[$name| string |]`
PBangPat l (Pat l) | strict (bang) pattern: `f !x = ...`

#### Instances

Instances details

Functor Pat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Pat a -> Pat b Source # (<$) :: a -> Pat b -> Pat a Source #
Foldable Pat Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Pat m -> m Source #

foldMap :: Monoid m => (a -> m) -> Pat a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Pat a -> m Source #

foldr :: (a -> b -> b) -> b -> Pat a -> b Source #

foldr' :: (a -> b -> b) -> b -> Pat a -> b Source #

foldl :: (b -> a -> b) -> b -> Pat a -> b Source #

foldl' :: (b -> a -> b) -> b -> Pat a -> b Source #

foldr1 :: (a -> a -> a) -> Pat a -> a Source #

foldl1 :: (a -> a -> a) -> Pat a -> a Source #

toList :: Pat a -> [a] Source #

null :: Pat a -> Bool Source #

length :: Pat a -> Int Source #

elem :: Eq a => a -> Pat a -> Bool Source #

maximum :: Ord a => Pat a -> a Source #

minimum :: Ord a => Pat a -> a Source #

sum :: Num a => Pat a -> a Source #

product :: Num a => Pat a -> a Source #

Traversable Pat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Pat a -> f (Pat b) Source # sequenceA :: Applicative f => Pat (f a) -> f (Pat a) Source # mapM :: Monad m => (a -> m b) -> Pat a -> m (Pat b) Source # sequence :: Monad m => Pat (m a) -> m (Pat a) Source #
ExactP Pat Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Pat SrcSpanInfo -> EP ()
AppFixity Pat Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Pat SrcSpanInfo -> m (Pat SrcSpanInfo) Source #
Annotated Pat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Pat l -> l Source # amap :: (l -> l) -> Pat l -> Pat l Source #
Data l => Data (Pat l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Pat l) Source #

toConstr :: Pat l -> Constr Source #

dataTypeOf :: Pat l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Pat l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Pat l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Pat l -> Pat l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pat l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pat l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Pat l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Pat l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pat l -> m (Pat l) Source #

Generic (Pat l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Pat l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Pat l) = D1 ('MetaData "Pat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))))

Methods

from :: Pat l -> Rep (Pat l) x Source #

to :: Rep (Pat l) x -> Pat l Source #

Show l => Show (Pat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Pat l -> ShowS Source # show :: Pat l -> String Source # showList :: [Pat l] -> ShowS Source #
Eq l => Eq (Pat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Pat l -> Pat l -> Bool Source # (/=) :: Pat l -> Pat l -> Bool Source #
Ord l => Ord (Pat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Pat l -> Pat l -> Ordering Source # (<) :: Pat l -> Pat l -> Bool Source # (<=) :: Pat l -> Pat l -> Bool Source # (>) :: Pat l -> Pat l -> Bool Source # (>=) :: Pat l -> Pat l -> Bool Source # max :: Pat l -> Pat l -> Pat l Source # min :: Pat l -> Pat l -> Pat l Source #
Parseable (Pat SrcSpanInfo) Source # |
Instance details Defined in Language.Haskell.Exts.Parser Methods parse :: String -> ParseResult (Pat SrcSpanInfo) Source # parseWithMode :: ParseMode -> String -> ParseResult (Pat SrcSpanInfo) Source # parseWithComments :: ParseMode -> String -> ParseResult (Pat SrcSpanInfo, [Comment]) Source # parser :: Maybe [Fixity] -> P (Pat SrcSpanInfo)
Pretty (Pat l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Pat l -> Doc prettyPrec :: Int -> Pat l -> Doc
type Rep (Pat l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Pat l) = D1 ('MetaData "Pat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))))

data PatField l Source #

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

Instances details

Functor PatField Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> PatField a -> PatField b Source # (<$) :: a -> PatField b -> PatField a Source #
Foldable PatField Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => PatField m -> m Source #

foldMap :: Monoid m => (a -> m) -> PatField a -> m Source #

foldMap' :: Monoid m => (a -> m) -> PatField a -> m Source #

foldr :: (a -> b -> b) -> b -> PatField a -> b Source #

foldr' :: (a -> b -> b) -> b -> PatField a -> b Source #

foldl :: (b -> a -> b) -> b -> PatField a -> b Source #

foldl' :: (b -> a -> b) -> b -> PatField a -> b Source #

foldr1 :: (a -> a -> a) -> PatField a -> a Source #

foldl1 :: (a -> a -> a) -> PatField a -> a Source #

toList :: PatField a -> [a] Source #

null :: PatField a -> Bool Source #

length :: PatField a -> Int Source #

elem :: Eq a => a -> PatField a -> Bool Source #

maximum :: Ord a => PatField a -> a Source #

minimum :: Ord a => PatField a -> a Source #

sum :: Num a => PatField a -> a Source #

product :: Num a => PatField a -> a Source #

Traversable PatField Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> PatField a -> f (PatField b) Source # sequenceA :: Applicative f => PatField (f a) -> f (PatField a) Source # mapM :: Monad m => (a -> m b) -> PatField a -> m (PatField b) Source # sequence :: Monad m => PatField (m a) -> m (PatField a) Source #
ExactP PatField Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: PatField SrcSpanInfo -> EP ()
AppFixity PatField Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PatField SrcSpanInfo -> m (PatField SrcSpanInfo) Source #
Annotated PatField Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: PatField l -> l Source # amap :: (l -> l) -> PatField l -> PatField l Source #
Data l => Data (PatField l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PatField l) Source #

toConstr :: PatField l -> Constr Source #

dataTypeOf :: PatField l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PatField l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PatField l)) Source #

gmapT :: (forall b. Data b => b -> b) -> PatField l -> PatField l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatField l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatField l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> PatField l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> PatField l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatField l -> m (PatField l) Source #

Generic (PatField l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (PatField l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PatField l) = D1 ('MetaData "PatField" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: PatField l -> Rep (PatField l) x Source #

to :: Rep (PatField l) x -> PatField l Source #

Show l => Show (PatField l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> PatField l -> ShowS Source # show :: PatField l -> String Source # showList :: [PatField l] -> ShowS Source #
Eq l => Eq (PatField l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: PatField l -> PatField l -> Bool Source # (/=) :: PatField l -> PatField l -> Bool Source #
Ord l => Ord (PatField l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: PatField l -> PatField l -> Ordering Source #

(<) :: PatField l -> PatField l -> Bool Source #

(<=) :: PatField l -> PatField l -> Bool Source #

(>) :: PatField l -> PatField l -> Bool Source #

(>=) :: PatField l -> PatField l -> Bool Source #

max :: PatField l -> PatField l -> PatField l Source #

min :: PatField l -> PatField l -> PatField l Source #

Pretty (PatField l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: PatField l -> Doc prettyPrec :: Int -> PatField l -> Doc
type Rep (PatField l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PatField l) = D1 ('MetaData "PatField" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data PXAttr l Source #

An XML attribute in a pattern.

Constructors

PXAttr l (XName l) (Pat l) |

#### Instances

Instances details

Functor PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> PXAttr a -> PXAttr b Source # (<$) :: a -> PXAttr b -> PXAttr a Source #
Foldable PXAttr Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => PXAttr m -> m Source #

foldMap :: Monoid m => (a -> m) -> PXAttr a -> m Source #

foldMap' :: Monoid m => (a -> m) -> PXAttr a -> m Source #

foldr :: (a -> b -> b) -> b -> PXAttr a -> b Source #

foldr' :: (a -> b -> b) -> b -> PXAttr a -> b Source #

foldl :: (b -> a -> b) -> b -> PXAttr a -> b Source #

foldl' :: (b -> a -> b) -> b -> PXAttr a -> b Source #

foldr1 :: (a -> a -> a) -> PXAttr a -> a Source #

foldl1 :: (a -> a -> a) -> PXAttr a -> a Source #

toList :: PXAttr a -> [a] Source #

null :: PXAttr a -> Bool Source #

length :: PXAttr a -> Int Source #

elem :: Eq a => a -> PXAttr a -> Bool Source #

maximum :: Ord a => PXAttr a -> a Source #

minimum :: Ord a => PXAttr a -> a Source #

sum :: Num a => PXAttr a -> a Source #

product :: Num a => PXAttr a -> a Source #

Traversable PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> PXAttr a -> f (PXAttr b) Source # sequenceA :: Applicative f => PXAttr (f a) -> f (PXAttr a) Source # mapM :: Monad m => (a -> m b) -> PXAttr a -> m (PXAttr b) Source # sequence :: Monad m => PXAttr (m a) -> m (PXAttr a) Source #
ExactP PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: PXAttr SrcSpanInfo -> EP ()
AppFixity PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> PXAttr SrcSpanInfo -> m (PXAttr SrcSpanInfo) Source #
Annotated PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: PXAttr l -> l Source # amap :: (l -> l) -> PXAttr l -> PXAttr l Source #
Data l => Data (PXAttr l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (PXAttr l) Source #

toConstr :: PXAttr l -> Constr Source #

dataTypeOf :: PXAttr l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (PXAttr l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (PXAttr l)) Source #

gmapT :: (forall b. Data b => b -> b) -> PXAttr l -> PXAttr l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PXAttr l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PXAttr l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> PXAttr l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> PXAttr l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PXAttr l -> m (PXAttr l) Source #

Generic (PXAttr l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (PXAttr l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PXAttr l) = D1 ('MetaData "PXAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: PXAttr l -> Rep (PXAttr l) x Source #

to :: Rep (PXAttr l) x -> PXAttr l Source #

Show l => Show (PXAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> PXAttr l -> ShowS Source # show :: PXAttr l -> String Source # showList :: [PXAttr l] -> ShowS Source #
Eq l => Eq (PXAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: PXAttr l -> PXAttr l -> Bool Source # (/=) :: PXAttr l -> PXAttr l -> Bool Source #
Ord l => Ord (PXAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: PXAttr l -> PXAttr l -> Ordering Source # (<) :: PXAttr l -> PXAttr l -> Bool Source # (<=) :: PXAttr l -> PXAttr l -> Bool Source # (>) :: PXAttr l -> PXAttr l -> Bool Source # (>=) :: PXAttr l -> PXAttr l -> Bool Source # max :: PXAttr l -> PXAttr l -> PXAttr l Source # min :: PXAttr l -> PXAttr l -> PXAttr l Source #
Pretty (PXAttr l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: PXAttr l -> Doc prettyPrec :: Int -> PXAttr l -> Doc
type Rep (PXAttr l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (PXAttr l) = D1 ('MetaData "PXAttr" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data RPat l Source #

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

Instances details

Functor RPat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> RPat a -> RPat b Source # (<$) :: a -> RPat b -> RPat a Source #
Foldable RPat Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => RPat m -> m Source #

foldMap :: Monoid m => (a -> m) -> RPat a -> m Source #

foldMap' :: Monoid m => (a -> m) -> RPat a -> m Source #

foldr :: (a -> b -> b) -> b -> RPat a -> b Source #

foldr' :: (a -> b -> b) -> b -> RPat a -> b Source #

foldl :: (b -> a -> b) -> b -> RPat a -> b Source #

foldl' :: (b -> a -> b) -> b -> RPat a -> b Source #

foldr1 :: (a -> a -> a) -> RPat a -> a Source #

foldl1 :: (a -> a -> a) -> RPat a -> a Source #

toList :: RPat a -> [a] Source #

null :: RPat a -> Bool Source #

length :: RPat a -> Int Source #

elem :: Eq a => a -> RPat a -> Bool Source #

maximum :: Ord a => RPat a -> a Source #

minimum :: Ord a => RPat a -> a Source #

sum :: Num a => RPat a -> a Source #

product :: Num a => RPat a -> a Source #

Traversable RPat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> RPat a -> f (RPat b) Source # sequenceA :: Applicative f => RPat (f a) -> f (RPat a) Source # mapM :: Monad m => (a -> m b) -> RPat a -> m (RPat b) Source # sequence :: Monad m => RPat (m a) -> m (RPat a) Source #
ExactP RPat Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RPat SrcSpanInfo -> EP ()
AppFixity RPat Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> RPat SrcSpanInfo -> m (RPat SrcSpanInfo) Source #
Annotated RPat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RPat l -> l Source # amap :: (l -> l) -> RPat l -> RPat l Source #
Data l => Data (RPat l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RPat l) Source #

toConstr :: RPat l -> Constr Source #

dataTypeOf :: RPat l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RPat l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RPat l)) Source #

gmapT :: (forall b. Data b => b -> b) -> RPat l -> RPat l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RPat l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RPat l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> RPat l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> RPat l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RPat l -> m (RPat l) Source #

Generic (RPat l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (RPat l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RPat l) = D1 ('MetaData "RPat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: RPat l -> Rep (RPat l) x Source #

to :: Rep (RPat l) x -> RPat l Source #

Show l => Show (RPat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> RPat l -> ShowS Source # show :: RPat l -> String Source # showList :: [RPat l] -> ShowS Source #
Eq l => Eq (RPat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: RPat l -> RPat l -> Bool Source # (/=) :: RPat l -> RPat l -> Bool Source #
Ord l => Ord (RPat l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: RPat l -> RPat l -> Ordering Source # (<) :: RPat l -> RPat l -> Bool Source # (<=) :: RPat l -> RPat l -> Bool Source # (>) :: RPat l -> RPat l -> Bool Source # (>=) :: RPat l -> RPat l -> Bool Source # max :: RPat l -> RPat l -> RPat l Source # min :: RPat l -> RPat l -> RPat l Source #
Pretty (RPat l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: RPat l -> Doc prettyPrec :: Int -> RPat l -> Doc
type Rep (RPat l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RPat l) = D1 ('MetaData "RPat" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data RPatOp l Source #

A regular pattern operator.

Constructors

RPStar l | `*` = 0 or more
RPStarG l | `*!` = 0 or more, greedy
RPPlus l | `+` = 1 or more
RPPlusG l | `+!` = 1 or more, greedy
RPOpt l | `?` = 0 or 1
RPOptG l | `?!` = 0 or 1, greedy

#### Instances

Instances details

Functor RPatOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> RPatOp a -> RPatOp b Source # (<$) :: a -> RPatOp b -> RPatOp a Source #
Foldable RPatOp Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => RPatOp m -> m Source #

foldMap :: Monoid m => (a -> m) -> RPatOp a -> m Source #

foldMap' :: Monoid m => (a -> m) -> RPatOp a -> m Source #

foldr :: (a -> b -> b) -> b -> RPatOp a -> b Source #

foldr' :: (a -> b -> b) -> b -> RPatOp a -> b Source #

foldl :: (b -> a -> b) -> b -> RPatOp a -> b Source #

foldl' :: (b -> a -> b) -> b -> RPatOp a -> b Source #

foldr1 :: (a -> a -> a) -> RPatOp a -> a Source #

foldl1 :: (a -> a -> a) -> RPatOp a -> a Source #

toList :: RPatOp a -> [a] Source #

null :: RPatOp a -> Bool Source #

length :: RPatOp a -> Int Source #

elem :: Eq a => a -> RPatOp a -> Bool Source #

maximum :: Ord a => RPatOp a -> a Source #

minimum :: Ord a => RPatOp a -> a Source #

sum :: Num a => RPatOp a -> a Source #

product :: Num a => RPatOp a -> a Source #

Traversable RPatOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> RPatOp a -> f (RPatOp b) Source # sequenceA :: Applicative f => RPatOp (f a) -> f (RPatOp a) Source # mapM :: Monad m => (a -> m b) -> RPatOp a -> m (RPatOp b) Source # sequence :: Monad m => RPatOp (m a) -> m (RPatOp a) Source #
ExactP RPatOp Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RPatOp SrcSpanInfo -> EP ()
Annotated RPatOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RPatOp l -> l Source # amap :: (l -> l) -> RPatOp l -> RPatOp l Source #
Data l => Data (RPatOp l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RPatOp l) Source #

toConstr :: RPatOp l -> Constr Source #

dataTypeOf :: RPatOp l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RPatOp l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RPatOp l)) Source #

gmapT :: (forall b. Data b => b -> b) -> RPatOp l -> RPatOp l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RPatOp l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RPatOp l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> RPatOp l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> RPatOp l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RPatOp l -> m (RPatOp l) Source #

Generic (RPatOp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (RPatOp l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RPatOp l) = D1 ('MetaData "RPatOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: RPatOp l -> Rep (RPatOp l) x Source #

to :: Rep (RPatOp l) x -> RPatOp l Source #

Show l => Show (RPatOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> RPatOp l -> ShowS Source # show :: RPatOp l -> String Source # showList :: [RPatOp l] -> ShowS Source #
Eq l => Eq (RPatOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: RPatOp l -> RPatOp l -> Bool Source # (/=) :: RPatOp l -> RPatOp l -> Bool Source #
Ord l => Ord (RPatOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: RPatOp l -> RPatOp l -> Ordering Source # (<) :: RPatOp l -> RPatOp l -> Bool Source # (<=) :: RPatOp l -> RPatOp l -> Bool Source # (>) :: RPatOp l -> RPatOp l -> Bool Source # (>=) :: RPatOp l -> RPatOp l -> Bool Source # max :: RPatOp l -> RPatOp l -> RPatOp l Source # min :: RPatOp l -> RPatOp l -> RPatOp l Source #
Pretty (RPatOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: RPatOp l -> Doc prettyPrec :: Int -> RPatOp l -> Doc
type Rep (RPatOp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RPatOp l) = D1 ('MetaData "RPatOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Literal l Source #

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

Instances details

Functor Literal Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Literal a -> Literal b Source # (<$) :: a -> Literal b -> Literal a Source #
Foldable Literal Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Literal m -> m Source #

foldMap :: Monoid m => (a -> m) -> Literal a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Literal a -> m Source #

foldr :: (a -> b -> b) -> b -> Literal a -> b Source #

foldr' :: (a -> b -> b) -> b -> Literal a -> b Source #

foldl :: (b -> a -> b) -> b -> Literal a -> b Source #

foldl' :: (b -> a -> b) -> b -> Literal a -> b Source #

foldr1 :: (a -> a -> a) -> Literal a -> a Source #

foldl1 :: (a -> a -> a) -> Literal a -> a Source #

toList :: Literal a -> [a] Source #

null :: Literal a -> Bool Source #

length :: Literal a -> Int Source #

elem :: Eq a => a -> Literal a -> Bool Source #

maximum :: Ord a => Literal a -> a Source #

minimum :: Ord a => Literal a -> a Source #

sum :: Num a => Literal a -> a Source #

product :: Num a => Literal a -> a Source #

Traversable Literal Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Literal a -> f (Literal b) Source # sequenceA :: Applicative f => Literal (f a) -> f (Literal a) Source # mapM :: Monad m => (a -> m b) -> Literal a -> m (Literal b) Source # sequence :: Monad m => Literal (m a) -> m (Literal a) Source #
ExactP Literal Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Literal SrcSpanInfo -> EP ()
Annotated Literal Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Literal l -> l Source # amap :: (l -> l) -> Literal l -> Literal l Source #
Data l => Data (Literal l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Literal l) Source #

toConstr :: Literal l -> Constr Source #

dataTypeOf :: Literal l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Literal l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Literal l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Literal l -> Literal l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Literal l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Literal l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Literal l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Literal l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Literal l -> m (Literal l) Source #

Generic (Literal l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Literal l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Literal l) = D1 ('MetaData "Literal" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

Methods

from :: Literal l -> Rep (Literal l) x Source #

to :: Rep (Literal l) x -> Literal l Source #

Show l => Show (Literal l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Literal l -> ShowS Source # show :: Literal l -> String Source # showList :: [Literal l] -> ShowS Source #
Eq l => Eq (Literal l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Literal l -> Literal l -> Bool Source # (/=) :: Literal l -> Literal l -> Bool Source #
Ord l => Ord (Literal l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Literal l -> Literal l -> Ordering Source #

(<) :: Literal l -> Literal l -> Bool Source #

(<=) :: Literal l -> Literal l -> Bool Source #

(>) :: Literal l -> Literal l -> Bool Source #

(>=) :: Literal l -> Literal l -> Bool Source #

max :: Literal l -> Literal l -> Literal l Source #

min :: Literal l -> Literal l -> Literal l Source #

Pretty (Literal l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Literal l -> Doc prettyPrec :: Int -> Literal l -> Doc
type Rep (Literal l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Literal l) = D1 ('MetaData "Literal" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))))

data Sign l Source #

An indication whether a literal pattern has been negated or not.

Constructors

Signless l |
Negative l |

#### Instances

Instances details

Functor Sign Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Sign a -> Sign b Source # (<$) :: a -> Sign b -> Sign a Source #
Foldable Sign Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Sign m -> m Source #

foldMap :: Monoid m => (a -> m) -> Sign a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Sign a -> m Source #

foldr :: (a -> b -> b) -> b -> Sign a -> b Source #

foldr' :: (a -> b -> b) -> b -> Sign a -> b Source #

foldl :: (b -> a -> b) -> b -> Sign a -> b Source #

foldl' :: (b -> a -> b) -> b -> Sign a -> b Source #

foldr1 :: (a -> a -> a) -> Sign a -> a Source #

foldl1 :: (a -> a -> a) -> Sign a -> a Source #

toList :: Sign a -> [a] Source #

null :: Sign a -> Bool Source #

length :: Sign a -> Int Source #

elem :: Eq a => a -> Sign a -> Bool Source #

maximum :: Ord a => Sign a -> a Source #

minimum :: Ord a => Sign a -> a Source #

sum :: Num a => Sign a -> a Source #

product :: Num a => Sign a -> a Source #

Traversable Sign Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Sign a -> f (Sign b) Source # sequenceA :: Applicative f => Sign (f a) -> f (Sign a) Source # mapM :: Monad m => (a -> m b) -> Sign a -> m (Sign b) Source # sequence :: Monad m => Sign (m a) -> m (Sign a) Source #
ExactP Sign Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Sign SrcSpanInfo -> EP ()
Annotated Sign Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Sign l -> l Source # amap :: (l -> l) -> Sign l -> Sign l Source #
Data l => Data (Sign l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Sign l) Source #

toConstr :: Sign l -> Constr Source #

dataTypeOf :: Sign l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Sign l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Sign l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Sign l -> Sign l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sign l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sign l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Sign l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Sign l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sign l -> m (Sign l) Source #

Generic (Sign l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Sign l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Sign l) = D1 ('MetaData "Sign" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: Sign l -> Rep (Sign l) x Source #

to :: Rep (Sign l) x -> Sign l Source #

Show l => Show (Sign l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Sign l -> ShowS Source # show :: Sign l -> String Source # showList :: [Sign l] -> ShowS Source #
Eq l => Eq (Sign l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Sign l -> Sign l -> Bool Source # (/=) :: Sign l -> Sign l -> Bool Source #
Ord l => Ord (Sign l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Sign l -> Sign l -> Ordering Source # (<) :: Sign l -> Sign l -> Bool Source # (<=) :: Sign l -> Sign l -> Bool Source # (>) :: Sign l -> Sign l -> Bool Source # (>=) :: Sign l -> Sign l -> Bool Source # max :: Sign l -> Sign l -> Sign l Source # min :: Sign l -> Sign l -> Sign l Source #
type Rep (Sign l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Sign l) = D1 ('MetaData "Sign" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

The name of a Haskell module.

Constructors

ModuleName l String |

#### Instances

Instances details

Functor ModuleName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ModuleName a -> ModuleName b Source # (<$) :: a -> ModuleName b -> ModuleName a Source #
Foldable ModuleName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ModuleName m -> m Source #

foldMap :: Monoid m => (a -> m) -> ModuleName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ModuleName a -> m Source #

foldr :: (a -> b -> b) -> b -> ModuleName a -> b Source #

foldr' :: (a -> b -> b) -> b -> ModuleName a -> b Source #

foldl :: (b -> a -> b) -> b -> ModuleName a -> b Source #

foldl' :: (b -> a -> b) -> b -> ModuleName a -> b Source #

foldr1 :: (a -> a -> a) -> ModuleName a -> a Source #

foldl1 :: (a -> a -> a) -> ModuleName a -> a Source #

toList :: ModuleName a -> [a] Source #

null :: ModuleName a -> Bool Source #

length :: ModuleName a -> Int Source #

elem :: Eq a => a -> ModuleName a -> Bool Source #

maximum :: Ord a => ModuleName a -> a Source #

minimum :: Ord a => ModuleName a -> a Source #

sum :: Num a => ModuleName a -> a Source #

product :: Num a => ModuleName a -> a Source #

Traversable ModuleName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModuleName a -> f (ModuleName b) Source # sequenceA :: Applicative f => ModuleName (f a) -> f (ModuleName a) Source # mapM :: Monad m => (a -> m b) -> ModuleName a -> m (ModuleName b) Source # sequence :: Monad m => ModuleName (m a) -> m (ModuleName a) Source #
ExactP ModuleName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModuleName SrcSpanInfo -> EP ()
Annotated ModuleName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModuleName l -> l Source # amap :: (l -> l) -> ModuleName l -> ModuleName l Source #
Data l => Data (ModuleName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModuleName l) Source #

toConstr :: ModuleName l -> Constr Source #

dataTypeOf :: ModuleName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModuleName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModuleName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ModuleName l -> ModuleName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ModuleName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName l -> m (ModuleName l) Source #

Generic (ModuleName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ModuleName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModuleName l) = D1 ('MetaData "ModuleName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: ModuleName l -> Rep (ModuleName l) x Source #

to :: Rep (ModuleName l) x -> ModuleName l Source #

Show l => Show (ModuleName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModuleName l -> ShowS Source # show :: ModuleName l -> String Source # showList :: [ModuleName l] -> ShowS Source #
Eq l => Eq (ModuleName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ModuleName l -> ModuleName l -> Bool Source # (/=) :: ModuleName l -> ModuleName l -> Bool Source #
Ord l => Ord (ModuleName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ModuleName l -> ModuleName l -> Ordering Source #

(<) :: ModuleName l -> ModuleName l -> Bool Source #

(<=) :: ModuleName l -> ModuleName l -> Bool Source #

(>) :: ModuleName l -> ModuleName l -> Bool Source #

(>=) :: ModuleName l -> ModuleName l -> Bool Source #

max :: ModuleName l -> ModuleName l -> ModuleName l Source #

min :: ModuleName l -> ModuleName l -> ModuleName l Source #

Pretty (ModuleName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ModuleName l -> Doc prettyPrec :: Int -> ModuleName l -> Doc
type Rep (ModuleName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModuleName l) = D1 ('MetaData "ModuleName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

data QName l Source #

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

Instances details

Functor QName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> QName a -> QName b Source # (<$) :: a -> QName b -> QName a Source #
Foldable QName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => QName m -> m Source #

foldMap :: Monoid m => (a -> m) -> QName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> QName a -> m Source #

foldr :: (a -> b -> b) -> b -> QName a -> b Source #

foldr' :: (a -> b -> b) -> b -> QName a -> b Source #

foldl :: (b -> a -> b) -> b -> QName a -> b Source #

foldl' :: (b -> a -> b) -> b -> QName a -> b Source #

foldr1 :: (a -> a -> a) -> QName a -> a Source #

foldl1 :: (a -> a -> a) -> QName a -> a Source #

toList :: QName a -> [a] Source #

null :: QName a -> Bool Source #

length :: QName a -> Int Source #

elem :: Eq a => a -> QName a -> Bool Source #

maximum :: Ord a => QName a -> a Source #

minimum :: Ord a => QName a -> a Source #

sum :: Num a => QName a -> a Source #

product :: Num a => QName a -> a Source #

Traversable QName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> QName a -> f (QName b) Source # sequenceA :: Applicative f => QName (f a) -> f (QName a) Source # mapM :: Monad m => (a -> m b) -> QName a -> m (QName b) Source # sequence :: Monad m => QName (m a) -> m (QName a) Source #
ExactP QName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QName SrcSpanInfo -> EP ()
Annotated QName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QName l -> l Source # amap :: (l -> l) -> QName l -> QName l Source #
Data l => Data (QName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QName l) Source #

toConstr :: QName l -> Constr Source #

dataTypeOf :: QName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> QName l -> QName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> QName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> QName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QName l -> m (QName l) Source #

Generic (QName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (QName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QName l) = D1 ('MetaData "QName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: QName l -> Rep (QName l) x Source #

to :: Rep (QName l) x -> QName l Source #

Show l => Show (QName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> QName l -> ShowS Source # show :: QName l -> String Source # showList :: [QName l] -> ShowS Source #
Eq l => Eq (QName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: QName l -> QName l -> Bool Source # (/=) :: QName l -> QName l -> Bool Source #
Ord l => Ord (QName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: QName l -> QName l -> Ordering Source # (<) :: QName l -> QName l -> Bool Source # (<=) :: QName l -> QName l -> Bool Source # (>) :: QName l -> QName l -> Bool Source # (>=) :: QName l -> QName l -> Bool Source # max :: QName l -> QName l -> QName l Source # min :: QName l -> QName l -> QName l Source #
Pretty (QName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: QName l -> Doc prettyPrec :: Int -> QName l -> Doc
type Rep (QName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QName l) = D1 ('MetaData "QName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data Name l Source #

This type is used to represent variables, and also constructors.

Constructors

Ident l String | varid or conid.
Symbol l String | varsym or consym

#### Instances

Instances details

Functor Name Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Name a -> Name b Source # (<$) :: a -> Name b -> Name a Source #
Foldable Name Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Name m -> m Source #

foldMap :: Monoid m => (a -> m) -> Name a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Name a -> m Source #

foldr :: (a -> b -> b) -> b -> Name a -> b Source #

foldr' :: (a -> b -> b) -> b -> Name a -> b Source #

foldl :: (b -> a -> b) -> b -> Name a -> b Source #

foldl' :: (b -> a -> b) -> b -> Name a -> b Source #

foldr1 :: (a -> a -> a) -> Name a -> a Source #

foldl1 :: (a -> a -> a) -> Name a -> a Source #

toList :: Name a -> [a] Source #

null :: Name a -> Bool Source #

length :: Name a -> Int Source #

elem :: Eq a => a -> Name a -> Bool Source #

maximum :: Ord a => Name a -> a Source #

minimum :: Ord a => Name a -> a Source #

sum :: Num a => Name a -> a Source #

product :: Num a => Name a -> a Source #

Traversable Name Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Name a -> f (Name b) Source # sequenceA :: Applicative f => Name (f a) -> f (Name a) Source # mapM :: Monad m => (a -> m b) -> Name a -> m (Name b) Source # sequence :: Monad m => Name (m a) -> m (Name a) Source #
ExactP Name Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Name SrcSpanInfo -> EP ()
Annotated Name Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Name l -> l Source # amap :: (l -> l) -> Name l -> Name l Source #
Data l => Data (Name l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Name l) Source #

toConstr :: Name l -> Constr Source #

dataTypeOf :: Name l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Name l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Name l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Name l -> Name l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Name l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Name l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name l -> m (Name l) Source #

Generic (Name l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Name l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Name l) = D1 ('MetaData "Name" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: Name l -> Rep (Name l) x Source #

to :: Rep (Name l) x -> Name l Source #

Show l => Show (Name l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Name l -> ShowS Source # show :: Name l -> String Source # showList :: [Name l] -> ShowS Source #
Eq l => Eq (Name l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Name l -> Name l -> Bool Source # (/=) :: Name l -> Name l -> Bool Source #
Ord l => Ord (Name l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Name l -> Name l -> Ordering Source # (<) :: Name l -> Name l -> Bool Source # (<=) :: Name l -> Name l -> Bool Source # (>) :: Name l -> Name l -> Bool Source # (>=) :: Name l -> Name l -> Bool Source # max :: Name l -> Name l -> Name l Source # min :: Name l -> Name l -> Name l Source #
Pretty (Name l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Name l -> Doc prettyPrec :: Int -> Name l -> Doc
type Rep (Name l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Name l) = D1 ('MetaData "Name" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

data QOp l Source #

Possibly qualified infix operators (qop), appearing in expressions.

Constructors

QVarOp l (QName l) | variable operator (qvarop)
QConOp l (QName l) | constructor operator (qconop)

#### Instances

Instances details

Functor QOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> QOp a -> QOp b Source # (<$) :: a -> QOp b -> QOp a Source #
Foldable QOp Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => QOp m -> m Source #

foldMap :: Monoid m => (a -> m) -> QOp a -> m Source #

foldMap' :: Monoid m => (a -> m) -> QOp a -> m Source #

foldr :: (a -> b -> b) -> b -> QOp a -> b Source #

foldr' :: (a -> b -> b) -> b -> QOp a -> b Source #

foldl :: (b -> a -> b) -> b -> QOp a -> b Source #

foldl' :: (b -> a -> b) -> b -> QOp a -> b Source #

foldr1 :: (a -> a -> a) -> QOp a -> a Source #

foldl1 :: (a -> a -> a) -> QOp a -> a Source #

toList :: QOp a -> [a] Source #

null :: QOp a -> Bool Source #

length :: QOp a -> Int Source #

elem :: Eq a => a -> QOp a -> Bool Source #

maximum :: Ord a => QOp a -> a Source #

minimum :: Ord a => QOp a -> a Source #

sum :: Num a => QOp a -> a Source #

product :: Num a => QOp a -> a Source #

Traversable QOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> QOp a -> f (QOp b) Source # sequenceA :: Applicative f => QOp (f a) -> f (QOp a) Source # mapM :: Monad m => (a -> m b) -> QOp a -> m (QOp b) Source # sequence :: Monad m => QOp (m a) -> m (QOp a) Source #
ExactP QOp Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: QOp SrcSpanInfo -> EP ()
Annotated QOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QOp l -> l Source # amap :: (l -> l) -> QOp l -> QOp l Source #
Data l => Data (QOp l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (QOp l) Source #

toConstr :: QOp l -> Constr Source #

dataTypeOf :: QOp l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (QOp l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (QOp l)) Source #

gmapT :: (forall b. Data b => b -> b) -> QOp l -> QOp l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QOp l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QOp l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> QOp l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> QOp l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QOp l -> m (QOp l) Source #

Generic (QOp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (QOp l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QOp l) = D1 ('MetaData "QOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: QOp l -> Rep (QOp l) x Source #

to :: Rep (QOp l) x -> QOp l Source #

Show l => Show (QOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> QOp l -> ShowS Source # show :: QOp l -> String Source # showList :: [QOp l] -> ShowS Source #
Eq l => Eq (QOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: QOp l -> QOp l -> Bool Source # (/=) :: QOp l -> QOp l -> Bool Source #
Ord l => Ord (QOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: QOp l -> QOp l -> Ordering Source # (<) :: QOp l -> QOp l -> Bool Source # (<=) :: QOp l -> QOp l -> Bool Source # (>) :: QOp l -> QOp l -> Bool Source # (>=) :: QOp l -> QOp l -> Bool Source # max :: QOp l -> QOp l -> QOp l Source # min :: QOp l -> QOp l -> QOp l Source #
Pretty (QOp l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: QOp l -> Doc prettyPrec :: Int -> QOp l -> Doc
type Rep (QOp l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (QOp l) = D1 ('MetaData "QOp" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data Op l Source #

Operators appearing in `infix` declarations are never qualified.

Constructors

VarOp l (Name l) | variable operator (varop)
ConOp l (Name l) | constructor operator (conop)

#### Instances

Instances details

Functor Op Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Op a -> Op b Source # (<$) :: a -> Op b -> Op a Source #
Foldable Op Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Op m -> m Source #

foldMap :: Monoid m => (a -> m) -> Op a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Op a -> m Source #

foldr :: (a -> b -> b) -> b -> Op a -> b Source #

foldr' :: (a -> b -> b) -> b -> Op a -> b Source #

foldl :: (b -> a -> b) -> b -> Op a -> b Source #

foldl' :: (b -> a -> b) -> b -> Op a -> b Source #

foldr1 :: (a -> a -> a) -> Op a -> a Source #

foldl1 :: (a -> a -> a) -> Op a -> a Source #

toList :: Op a -> [a] Source #

null :: Op a -> Bool Source #

length :: Op a -> Int Source #

elem :: Eq a => a -> Op a -> Bool Source #

maximum :: Ord a => Op a -> a Source #

minimum :: Ord a => Op a -> a Source #

sum :: Num a => Op a -> a Source #

product :: Num a => Op a -> a Source #

Traversable Op Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Op a -> f (Op b) Source # sequenceA :: Applicative f => Op (f a) -> f (Op a) Source # mapM :: Monad m => (a -> m b) -> Op a -> m (Op b) Source # sequence :: Monad m => Op (m a) -> m (Op a) Source #
ExactP Op Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Op SrcSpanInfo -> EP ()
Annotated Op Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Op l -> l Source # amap :: (l -> l) -> Op l -> Op l Source #
Data l => Data (Op l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Op l) Source #

toConstr :: Op l -> Constr Source #

dataTypeOf :: Op l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Op l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Op l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Op l -> Op l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Op l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Op l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Op l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Op l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Op l -> m (Op l) Source #

Generic (Op l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Op l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Op l) = D1 ('MetaData "Op" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Op l -> Rep (Op l) x Source #

to :: Rep (Op l) x -> Op l Source #

Show l => Show (Op l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Op l -> ShowS Source # show :: Op l -> String Source # showList :: [Op l] -> ShowS Source #
Eq l => Eq (Op l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Op l -> Op l -> Bool Source # (/=) :: Op l -> Op l -> Bool Source #
Ord l => Ord (Op l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Op l -> Op l -> Ordering Source # (<) :: Op l -> Op l -> Bool Source # (<=) :: Op l -> Op l -> Bool Source # (>) :: Op l -> Op l -> Bool Source # (>=) :: Op l -> Op l -> Bool Source # max :: Op l -> Op l -> Op l Source # min :: Op l -> Op l -> Op l Source #
Pretty (Op l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Op l -> Doc prettyPrec :: Int -> Op l -> Doc
type Rep (Op l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Op l) = D1 ('MetaData "Op" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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 `(,)` etc, possibly boxed `(#,#)`
Cons l | list data constructor `(:)`
UnboxedSingleCon l | unboxed singleton tuple constructor `(# #)`
ExprHole l | An expression hole _

#### Instances

Instances details

Functor SpecialCon Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> SpecialCon a -> SpecialCon b Source # (<$) :: a -> SpecialCon b -> SpecialCon a Source #
Foldable SpecialCon Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => SpecialCon m -> m Source #

foldMap :: Monoid m => (a -> m) -> SpecialCon a -> m Source #

foldMap' :: Monoid m => (a -> m) -> SpecialCon a -> m Source #

foldr :: (a -> b -> b) -> b -> SpecialCon a -> b Source #

foldr' :: (a -> b -> b) -> b -> SpecialCon a -> b Source #

foldl :: (b -> a -> b) -> b -> SpecialCon a -> b Source #

foldl' :: (b -> a -> b) -> b -> SpecialCon a -> b Source #

foldr1 :: (a -> a -> a) -> SpecialCon a -> a Source #

foldl1 :: (a -> a -> a) -> SpecialCon a -> a Source #

toList :: SpecialCon a -> [a] Source #

null :: SpecialCon a -> Bool Source #

length :: SpecialCon a -> Int Source #

elem :: Eq a => a -> SpecialCon a -> Bool Source #

maximum :: Ord a => SpecialCon a -> a Source #

minimum :: Ord a => SpecialCon a -> a Source #

sum :: Num a => SpecialCon a -> a Source #

product :: Num a => SpecialCon a -> a Source #

Traversable SpecialCon Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> SpecialCon a -> f (SpecialCon b) Source # sequenceA :: Applicative f => SpecialCon (f a) -> f (SpecialCon a) Source # mapM :: Monad m => (a -> m b) -> SpecialCon a -> m (SpecialCon b) Source # sequence :: Monad m => SpecialCon (m a) -> m (SpecialCon a) Source #
ExactP SpecialCon Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: SpecialCon SrcSpanInfo -> EP ()
Annotated SpecialCon Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: SpecialCon l -> l Source # amap :: (l -> l) -> SpecialCon l -> SpecialCon l Source #
Data l => Data (SpecialCon l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SpecialCon l) Source #

toConstr :: SpecialCon l -> Constr Source #

dataTypeOf :: SpecialCon l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SpecialCon l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SpecialCon l)) Source #

gmapT :: (forall b. Data b => b -> b) -> SpecialCon l -> SpecialCon l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpecialCon l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpecialCon l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> SpecialCon l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> SpecialCon l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpecialCon l -> m (SpecialCon l) Source #

Generic (SpecialCon l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (SpecialCon l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (SpecialCon l) = D1 ('MetaData "SpecialCon" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: SpecialCon l -> Rep (SpecialCon l) x Source #

to :: Rep (SpecialCon l) x -> SpecialCon l Source #

Show l => Show (SpecialCon l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> SpecialCon l -> ShowS Source # show :: SpecialCon l -> String Source # showList :: [SpecialCon l] -> ShowS Source #
Eq l => Eq (SpecialCon l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: SpecialCon l -> SpecialCon l -> Bool Source # (/=) :: SpecialCon l -> SpecialCon l -> Bool Source #
Ord l => Ord (SpecialCon l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: SpecialCon l -> SpecialCon l -> Ordering Source #

(<) :: SpecialCon l -> SpecialCon l -> Bool Source #

(<=) :: SpecialCon l -> SpecialCon l -> Bool Source #

(>) :: SpecialCon l -> SpecialCon l -> Bool Source #

(>=) :: SpecialCon l -> SpecialCon l -> Bool Source #

max :: SpecialCon l -> SpecialCon l -> SpecialCon l Source #

min :: SpecialCon l -> SpecialCon l -> SpecialCon l Source #

Pretty (SpecialCon l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: SpecialCon l -> Doc prettyPrec :: Int -> SpecialCon l -> Doc
type Rep (SpecialCon l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (SpecialCon l) = D1 ('MetaData "SpecialCon" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data CName l Source #

A name (cname) of a component of a class or data type in an `import` or export specification.

Constructors

VarName l (Name l) | name of a method or field
ConName l (Name l) | name of a data constructor

#### Instances

Instances details

Functor CName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> CName a -> CName b Source # (<$) :: a -> CName b -> CName a Source #
Foldable CName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => CName m -> m Source #

foldMap :: Monoid m => (a -> m) -> CName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> CName a -> m Source #

foldr :: (a -> b -> b) -> b -> CName a -> b Source #

foldr' :: (a -> b -> b) -> b -> CName a -> b Source #

foldl :: (b -> a -> b) -> b -> CName a -> b Source #

foldl' :: (b -> a -> b) -> b -> CName a -> b Source #

foldr1 :: (a -> a -> a) -> CName a -> a Source #

foldl1 :: (a -> a -> a) -> CName a -> a Source #

toList :: CName a -> [a] Source #

null :: CName a -> Bool Source #

length :: CName a -> Int Source #

elem :: Eq a => a -> CName a -> Bool Source #

maximum :: Ord a => CName a -> a Source #

minimum :: Ord a => CName a -> a Source #

sum :: Num a => CName a -> a Source #

product :: Num a => CName a -> a Source #

Traversable CName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> CName a -> f (CName b) Source # sequenceA :: Applicative f => CName (f a) -> f (CName a) Source # mapM :: Monad m => (a -> m b) -> CName a -> m (CName b) Source # sequence :: Monad m => CName (m a) -> m (CName a) Source #
ExactP CName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: CName SrcSpanInfo -> EP ()
Annotated CName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: CName l -> l Source # amap :: (l -> l) -> CName l -> CName l Source #
Data l => Data (CName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CName l) Source #

toConstr :: CName l -> Constr Source #

dataTypeOf :: CName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> CName l -> CName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> CName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CName l -> m (CName l) Source #

Generic (CName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (CName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (CName l) = D1 ('MetaData "CName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: CName l -> Rep (CName l) x Source #

to :: Rep (CName l) x -> CName l Source #

Show l => Show (CName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> CName l -> ShowS Source # show :: CName l -> String Source # showList :: [CName l] -> ShowS Source #
Eq l => Eq (CName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: CName l -> CName l -> Bool Source # (/=) :: CName l -> CName l -> Bool Source #
Ord l => Ord (CName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: CName l -> CName l -> Ordering Source # (<) :: CName l -> CName l -> Bool Source # (<=) :: CName l -> CName l -> Bool Source # (>) :: CName l -> CName l -> Bool Source # (>=) :: CName l -> CName l -> Bool Source # max :: CName l -> CName l -> CName l Source # min :: CName l -> CName l -> CName l Source #
Pretty (CName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: CName l -> Doc prettyPrec :: Int -> CName l -> Doc
type Rep (CName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (CName l) = D1 ('MetaData "CName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data IPName l Source #

An implicit parameter name.

Constructors

IPDup l String | ?ident, non-linear implicit parameter
IPLin l String | %ident, linear implicit parameter

#### Instances

Instances details

Functor IPName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> IPName a -> IPName b Source # (<$) :: a -> IPName b -> IPName a Source #
Foldable IPName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => IPName m -> m Source #

foldMap :: Monoid m => (a -> m) -> IPName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> IPName a -> m Source #

foldr :: (a -> b -> b) -> b -> IPName a -> b Source #

foldr' :: (a -> b -> b) -> b -> IPName a -> b Source #

foldl :: (b -> a -> b) -> b -> IPName a -> b Source #

foldl' :: (b -> a -> b) -> b -> IPName a -> b Source #

foldr1 :: (a -> a -> a) -> IPName a -> a Source #

foldl1 :: (a -> a -> a) -> IPName a -> a Source #

toList :: IPName a -> [a] Source #

null :: IPName a -> Bool Source #

length :: IPName a -> Int Source #

elem :: Eq a => a -> IPName a -> Bool Source #

maximum :: Ord a => IPName a -> a Source #

minimum :: Ord a => IPName a -> a Source #

sum :: Num a => IPName a -> a Source #

product :: Num a => IPName a -> a Source #

Traversable IPName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> IPName a -> f (IPName b) Source # sequenceA :: Applicative f => IPName (f a) -> f (IPName a) Source # mapM :: Monad m => (a -> m b) -> IPName a -> m (IPName b) Source # sequence :: Monad m => IPName (m a) -> m (IPName a) Source #
ExactP IPName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: IPName SrcSpanInfo -> EP ()
Annotated IPName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: IPName l -> l Source # amap :: (l -> l) -> IPName l -> IPName l Source #
Data l => Data (IPName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IPName l) Source #

toConstr :: IPName l -> Constr Source #

dataTypeOf :: IPName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IPName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IPName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> IPName l -> IPName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IPName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IPName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> IPName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> IPName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IPName l -> m (IPName l) Source #

Generic (IPName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (IPName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (IPName l) = D1 ('MetaData "IPName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: IPName l -> Rep (IPName l) x Source #

to :: Rep (IPName l) x -> IPName l Source #

Show l => Show (IPName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> IPName l -> ShowS Source # show :: IPName l -> String Source # showList :: [IPName l] -> ShowS Source #
Eq l => Eq (IPName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: IPName l -> IPName l -> Bool Source # (/=) :: IPName l -> IPName l -> Bool Source #
Ord l => Ord (IPName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: IPName l -> IPName l -> Ordering Source # (<) :: IPName l -> IPName l -> Bool Source # (<=) :: IPName l -> IPName l -> Bool Source # (>) :: IPName l -> IPName l -> Bool Source # (>=) :: IPName l -> IPName l -> Bool Source # max :: IPName l -> IPName l -> IPName l Source # min :: IPName l -> IPName l -> IPName l Source #
Pretty (IPName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: IPName l -> Doc prettyPrec :: Int -> IPName l -> Doc
type Rep (IPName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (IPName l) = D1 ('MetaData "IPName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

data XName l Source #

The name of an xml element or attribute, possibly qualified with a namespace.

Constructors

XName l String |
XDomName l String String |

#### Instances

Instances details

Functor XName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> XName a -> XName b Source # (<$) :: a -> XName b -> XName a Source #
Foldable XName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => XName m -> m Source #

foldMap :: Monoid m => (a -> m) -> XName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> XName a -> m Source #

foldr :: (a -> b -> b) -> b -> XName a -> b Source #

foldr' :: (a -> b -> b) -> b -> XName a -> b Source #

foldl :: (b -> a -> b) -> b -> XName a -> b Source #

foldl' :: (b -> a -> b) -> b -> XName a -> b Source #

foldr1 :: (a -> a -> a) -> XName a -> a Source #

foldl1 :: (a -> a -> a) -> XName a -> a Source #

toList :: XName a -> [a] Source #

null :: XName a -> Bool Source #

length :: XName a -> Int Source #

elem :: Eq a => a -> XName a -> Bool Source #

maximum :: Ord a => XName a -> a Source #

minimum :: Ord a => XName a -> a Source #

sum :: Num a => XName a -> a Source #

product :: Num a => XName a -> a Source #

Traversable XName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> XName a -> f (XName b) Source # sequenceA :: Applicative f => XName (f a) -> f (XName a) Source # mapM :: Monad m => (a -> m b) -> XName a -> m (XName b) Source # sequence :: Monad m => XName (m a) -> m (XName a) Source #
ExactP XName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: XName SrcSpanInfo -> EP ()
Annotated XName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: XName l -> l Source # amap :: (l -> l) -> XName l -> XName l Source #
Data l => Data (XName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (XName l) Source #

toConstr :: XName l -> Constr Source #

dataTypeOf :: XName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (XName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (XName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> XName l -> XName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> XName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> XName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XName l -> m (XName l) Source #

Generic (XName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (XName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (XName l) = D1 ('MetaData "XName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: XName l -> Rep (XName l) x Source #

to :: Rep (XName l) x -> XName l Source #

Show l => Show (XName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> XName l -> ShowS Source # show :: XName l -> String Source # showList :: [XName l] -> ShowS Source #
Eq l => Eq (XName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: XName l -> XName l -> Bool Source # (/=) :: XName l -> XName l -> Bool Source #
Ord l => Ord (XName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: XName l -> XName l -> Ordering Source # (<) :: XName l -> XName l -> Bool Source # (<=) :: XName l -> XName l -> Bool Source # (>) :: XName l -> XName l -> Bool Source # (>=) :: XName l -> XName l -> Bool Source # max :: XName l -> XName l -> XName l Source # min :: XName l -> XName l -> XName l Source #
Pretty (XName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: XName l -> Doc prettyPrec :: Int -> XName l -> Doc
type Rep (XName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (XName l) = D1 ('MetaData "XName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data Role l Source #

Constructors

Nominal l |
Representational l |
Phantom l |
RoleWildcard l |

#### Instances

Instances details

Functor Role Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Role a -> Role b Source # (<$) :: a -> Role b -> Role a Source #
Foldable Role Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Role m -> m Source #

foldMap :: Monoid m => (a -> m) -> Role a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Role a -> m Source #

foldr :: (a -> b -> b) -> b -> Role a -> b Source #

foldr' :: (a -> b -> b) -> b -> Role a -> b Source #

foldl :: (b -> a -> b) -> b -> Role a -> b Source #

foldl' :: (b -> a -> b) -> b -> Role a -> b Source #

foldr1 :: (a -> a -> a) -> Role a -> a Source #

foldl1 :: (a -> a -> a) -> Role a -> a Source #

toList :: Role a -> [a] Source #

null :: Role a -> Bool Source #

length :: Role a -> Int Source #

elem :: Eq a => a -> Role a -> Bool Source #

maximum :: Ord a => Role a -> a Source #

minimum :: Ord a => Role a -> a Source #

sum :: Num a => Role a -> a Source #

product :: Num a => Role a -> a Source #

Traversable Role Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Role a -> f (Role b) Source # sequenceA :: Applicative f => Role (f a) -> f (Role a) Source # mapM :: Monad m => (a -> m b) -> Role a -> m (Role b) Source # sequence :: Monad m => Role (m a) -> m (Role a) Source #
ExactP Role Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Role SrcSpanInfo -> EP ()
Annotated Role Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Role l -> l Source # amap :: (l -> l) -> Role l -> Role l Source #
Data l => Data (Role l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Role l) Source #

toConstr :: Role l -> Constr Source #

dataTypeOf :: Role l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Role l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Role l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Role l -> Role l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Role l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Role l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role l -> m (Role l) Source #

Generic (Role l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Role l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Role l) = D1 ('MetaData "Role" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Role l -> Rep (Role l) x Source #

to :: Rep (Role l) x -> Role l Source #

Show l => Show (Role l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Role l -> ShowS Source # show :: Role l -> String Source # showList :: [Role l] -> ShowS Source #
Eq l => Eq (Role l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Role l -> Role l -> Bool Source # (/=) :: Role l -> Role l -> Bool Source #
Ord l => Ord (Role l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Role l -> Role l -> Ordering Source # (<) :: Role l -> Role l -> Bool Source # (<=) :: Role l -> Role l -> Bool Source # (>) :: Role l -> Role l -> Bool Source # (>=) :: Role l -> Role l -> Bool Source # max :: Role l -> Role l -> Role l Source # min :: Role l -> Role l -> Role l Source #
Pretty (Role l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Role l -> Doc prettyPrec :: Int -> Role l -> Doc
type Rep (Role l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Role l) = D1 ('MetaData "Role" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

Constructors

PromotedName l (QName l) |
UnpromotedName l (QName l) |

#### Instances

Instances details

Functor MaybePromotedName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> MaybePromotedName a -> MaybePromotedName b Source # (<$) :: a -> MaybePromotedName b -> MaybePromotedName a Source #
Foldable MaybePromotedName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => MaybePromotedName m -> m Source #

foldMap :: Monoid m => (a -> m) -> MaybePromotedName a -> m Source #

foldMap' :: Monoid m => (a -> m) -> MaybePromotedName a -> m Source #

foldr :: (a -> b -> b) -> b -> MaybePromotedName a -> b Source #

foldr' :: (a -> b -> b) -> b -> MaybePromotedName a -> b Source #

foldl :: (b -> a -> b) -> b -> MaybePromotedName a -> b Source #

foldl' :: (b -> a -> b) -> b -> MaybePromotedName a -> b Source #

foldr1 :: (a -> a -> a) -> MaybePromotedName a -> a Source #

foldl1 :: (a -> a -> a) -> MaybePromotedName a -> a Source #

toList :: MaybePromotedName a -> [a] Source #

null :: MaybePromotedName a -> Bool Source #

length :: MaybePromotedName a -> Int Source #

elem :: Eq a => a -> MaybePromotedName a -> Bool Source #

maximum :: Ord a => MaybePromotedName a -> a Source #

minimum :: Ord a => MaybePromotedName a -> a Source #

sum :: Num a => MaybePromotedName a -> a Source #

product :: Num a => MaybePromotedName a -> a Source #

Traversable MaybePromotedName Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> MaybePromotedName a -> f (MaybePromotedName b) Source #

sequenceA :: Applicative f => MaybePromotedName (f a) -> f (MaybePromotedName a) Source #

mapM :: Monad m => (a -> m b) -> MaybePromotedName a -> m (MaybePromotedName b) Source #

sequence :: Monad m => MaybePromotedName (m a) -> m (MaybePromotedName a) Source #

ExactP MaybePromotedName Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: MaybePromotedName SrcSpanInfo -> EP ()
Annotated MaybePromotedName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: MaybePromotedName l -> l Source # amap :: (l -> l) -> MaybePromotedName l -> MaybePromotedName l Source #
Data l => Data (MaybePromotedName l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (MaybePromotedName l) Source #

toConstr :: MaybePromotedName l -> Constr Source #

dataTypeOf :: MaybePromotedName l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (MaybePromotedName l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (MaybePromotedName l)) Source #

gmapT :: (forall b. Data b => b -> b) -> MaybePromotedName l -> MaybePromotedName l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MaybePromotedName l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MaybePromotedName l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> MaybePromotedName l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> MaybePromotedName l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MaybePromotedName l -> m (MaybePromotedName l) Source #

Generic (MaybePromotedName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (MaybePromotedName l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (MaybePromotedName l) = D1 ('MetaData "MaybePromotedName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: MaybePromotedName l -> Rep (MaybePromotedName l) x Source #

to :: Rep (MaybePromotedName l) x -> MaybePromotedName l Source #

Show l => Show (MaybePromotedName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> MaybePromotedName l -> ShowS Source # show :: MaybePromotedName l -> String Source # showList :: [MaybePromotedName l] -> ShowS Source #
Eq l => Eq (MaybePromotedName l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source # (/=) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source #
Ord l => Ord (MaybePromotedName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: MaybePromotedName l -> MaybePromotedName l -> Ordering Source #

(<) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source #

(<=) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source #

(>) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source #

(>=) :: MaybePromotedName l -> MaybePromotedName l -> Bool Source #

max :: MaybePromotedName l -> MaybePromotedName l -> MaybePromotedName l Source #

min :: MaybePromotedName l -> MaybePromotedName l -> MaybePromotedName l Source #

Pretty (MaybePromotedName l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: MaybePromotedName l -> Doc prettyPrec :: Int -> MaybePromotedName l -> Doc
type Rep (MaybePromotedName l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (MaybePromotedName l) = D1 ('MetaData "MaybePromotedName" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Bracket l Source #

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: `[p| ... |]`
TypeBracket l (Type l) | type bracket: `[t| ... |]`
DeclBracket l [Decl l] | declaration bracket: `[d| ... |]`

#### Instances

Instances details

Functor Bracket Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Bracket a -> Bracket b Source # (<$) :: a -> Bracket b -> Bracket a Source #
Foldable Bracket Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Bracket m -> m Source #

foldMap :: Monoid m => (a -> m) -> Bracket a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Bracket a -> m Source #

foldr :: (a -> b -> b) -> b -> Bracket a -> b Source #

foldr' :: (a -> b -> b) -> b -> Bracket a -> b Source #

foldl :: (b -> a -> b) -> b -> Bracket a -> b Source #

foldl' :: (b -> a -> b) -> b -> Bracket a -> b Source #

foldr1 :: (a -> a -> a) -> Bracket a -> a Source #

foldl1 :: (a -> a -> a) -> Bracket a -> a Source #

toList :: Bracket a -> [a] Source #

null :: Bracket a -> Bool Source #

length :: Bracket a -> Int Source #

elem :: Eq a => a -> Bracket a -> Bool Source #

maximum :: Ord a => Bracket a -> a Source #

minimum :: Ord a => Bracket a -> a Source #

sum :: Num a => Bracket a -> a Source #

product :: Num a => Bracket a -> a Source #

Traversable Bracket Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Bracket a -> f (Bracket b) Source # sequenceA :: Applicative f => Bracket (f a) -> f (Bracket a) Source # mapM :: Monad m => (a -> m b) -> Bracket a -> m (Bracket b) Source # sequence :: Monad m => Bracket (m a) -> m (Bracket a) Source #
ExactP Bracket Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Bracket SrcSpanInfo -> EP ()
AppFixity Bracket Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Bracket SrcSpanInfo -> m (Bracket SrcSpanInfo) Source #
Annotated Bracket Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Bracket l -> l Source # amap :: (l -> l) -> Bracket l -> Bracket l Source #
Data l => Data (Bracket l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bracket l) Source #

toConstr :: Bracket l -> Constr Source #

dataTypeOf :: Bracket l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bracket l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bracket l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Bracket l -> Bracket l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bracket l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bracket l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Bracket l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Bracket l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bracket l -> m (Bracket l) Source #

Generic (Bracket l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Bracket l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Bracket l) = D1 ('MetaData "Bracket" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

Methods

from :: Bracket l -> Rep (Bracket l) x Source #

to :: Rep (Bracket l) x -> Bracket l Source #

Show l => Show (Bracket l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Bracket l -> ShowS Source # show :: Bracket l -> String Source # showList :: [Bracket l] -> ShowS Source #
Eq l => Eq (Bracket l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Bracket l -> Bracket l -> Bool Source # (/=) :: Bracket l -> Bracket l -> Bool Source #
Ord l => Ord (Bracket l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Bracket l -> Bracket l -> Ordering Source #

(<) :: Bracket l -> Bracket l -> Bool Source #

(<=) :: Bracket l -> Bracket l -> Bool Source #

(>) :: Bracket l -> Bracket l -> Bool Source #

(>=) :: Bracket l -> Bracket l -> Bool Source #

max :: Bracket l -> Bracket l -> Bracket l Source #

min :: Bracket l -> Bracket l -> Bracket l Source #

Pretty (Bracket l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Bracket l -> Doc prettyPrec :: Int -> Bracket l -> Doc
type Rep (Bracket l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Bracket l) = D1 ('MetaData "Bracket" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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])))))

data Splice l Source #

A template haskell splice expression

Constructors

IdSplice l String | variable splice: `$var`
TIdSplice l String | typed variable splice: `$$var`
ParenSplice l (Exp l) | parenthesised expression splice: `$(exp)`
TParenSplice l (Exp l) | parenthesised typed expression splice: `$$(exp)`

#### Instances

Instances details

Functor Splice Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Splice a -> Splice b Source # (<$) :: a -> Splice b -> Splice a Source #
Foldable Splice Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Splice m -> m Source #

foldMap :: Monoid m => (a -> m) -> Splice a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Splice a -> m Source #

foldr :: (a -> b -> b) -> b -> Splice a -> b Source #

foldr' :: (a -> b -> b) -> b -> Splice a -> b Source #

foldl :: (b -> a -> b) -> b -> Splice a -> b Source #

foldl' :: (b -> a -> b) -> b -> Splice a -> b Source #

foldr1 :: (a -> a -> a) -> Splice a -> a Source #

foldl1 :: (a -> a -> a) -> Splice a -> a Source #

toList :: Splice a -> [a] Source #

null :: Splice a -> Bool Source #

length :: Splice a -> Int Source #

elem :: Eq a => a -> Splice a -> Bool Source #

maximum :: Ord a => Splice a -> a Source #

minimum :: Ord a => Splice a -> a Source #

sum :: Num a => Splice a -> a Source #

product :: Num a => Splice a -> a Source #

Traversable Splice Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Splice a -> f (Splice b) Source # sequenceA :: Applicative f => Splice (f a) -> f (Splice a) Source # mapM :: Monad m => (a -> m b) -> Splice a -> m (Splice b) Source # sequence :: Monad m => Splice (m a) -> m (Splice a) Source #
ExactP Splice Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Splice SrcSpanInfo -> EP ()
AppFixity Splice Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Splice SrcSpanInfo -> m (Splice SrcSpanInfo) Source #
Annotated Splice Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Splice l -> l Source # amap :: (l -> l) -> Splice l -> Splice l Source #
Data l => Data (Splice l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Splice l) Source #

toConstr :: Splice l -> Constr Source #

dataTypeOf :: Splice l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Splice l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Splice l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Splice l -> Splice l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Splice l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Splice l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Splice l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Splice l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Splice l -> m (Splice l) Source #

Generic (Splice l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Splice l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Splice l) = D1 ('MetaData "Splice" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Splice l -> Rep (Splice l) x Source #

to :: Rep (Splice l) x -> Splice l Source #

Show l => Show (Splice l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Splice l -> ShowS Source # show :: Splice l -> String Source # showList :: [Splice l] -> ShowS Source #
Eq l => Eq (Splice l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Splice l -> Splice l -> Bool Source # (/=) :: Splice l -> Splice l -> Bool Source #
Ord l => Ord (Splice l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Splice l -> Splice l -> Ordering Source # (<) :: Splice l -> Splice l -> Bool Source # (<=) :: Splice l -> Splice l -> Bool Source # (>) :: Splice l -> Splice l -> Bool Source # (>=) :: Splice l -> Splice l -> Bool Source # max :: Splice l -> Splice l -> Splice l Source # min :: Splice l -> Splice l -> Splice l Source #
Pretty (Splice l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Splice l -> Doc prettyPrec :: Int -> Splice l -> Doc
type Rep (Splice l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Splice l) = D1 ('MetaData "Splice" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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

data Safety l Source #

The safety of a foreign function call.

Constructors

PlayRisky l | unsafe
PlaySafe l Bool | safe (`False`) or threadsafe (`True`)
PlayInterruptible l | interruptible

#### Instances

Instances details

Functor Safety Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Safety a -> Safety b Source # (<$) :: a -> Safety b -> Safety a Source #
Foldable Safety Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Safety m -> m Source #

foldMap :: Monoid m => (a -> m) -> Safety a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Safety a -> m Source #

foldr :: (a -> b -> b) -> b -> Safety a -> b Source #

foldr' :: (a -> b -> b) -> b -> Safety a -> b Source #

foldl :: (b -> a -> b) -> b -> Safety a -> b Source #

foldl' :: (b -> a -> b) -> b -> Safety a -> b Source #

foldr1 :: (a -> a -> a) -> Safety a -> a Source #

foldl1 :: (a -> a -> a) -> Safety a -> a Source #

toList :: Safety a -> [a] Source #

null :: Safety a -> Bool Source #

length :: Safety a -> Int Source #

elem :: Eq a => a -> Safety a -> Bool Source #

maximum :: Ord a => Safety a -> a Source #

minimum :: Ord a => Safety a -> a Source #

sum :: Num a => Safety a -> a Source #

product :: Num a => Safety a -> a Source #

Traversable Safety Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Safety a -> f (Safety b) Source # sequenceA :: Applicative f => Safety (f a) -> f (Safety a) Source # mapM :: Monad m => (a -> m b) -> Safety a -> m (Safety b) Source # sequence :: Monad m => Safety (m a) -> m (Safety a) Source #
ExactP Safety Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Safety SrcSpanInfo -> EP ()
Annotated Safety Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Safety l -> l Source # amap :: (l -> l) -> Safety l -> Safety l Source #
Data l => Data (Safety l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Safety l) Source #

toConstr :: Safety l -> Constr Source #

dataTypeOf :: Safety l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Safety l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Safety l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Safety l -> Safety l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Safety l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Safety l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Safety l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Safety l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Safety l -> m (Safety l) Source #

Generic (Safety l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Safety l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Safety l) = D1 ('MetaData "Safety" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

Methods

from :: Safety l -> Rep (Safety l) x Source #

to :: Rep (Safety l) x -> Safety l Source #

Show l => Show (Safety l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Safety l -> ShowS Source # show :: Safety l -> String Source # showList :: [Safety l] -> ShowS Source #
Eq l => Eq (Safety l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Safety l -> Safety l -> Bool Source # (/=) :: Safety l -> Safety l -> Bool Source #
Ord l => Ord (Safety l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Safety l -> Safety l -> Ordering Source # (<) :: Safety l -> Safety l -> Bool Source # (<=) :: Safety l -> Safety l -> Bool Source # (>) :: Safety l -> Safety l -> Bool Source # (>=) :: Safety l -> Safety l -> Bool Source # max :: Safety l -> Safety l -> Safety l Source # min :: Safety l -> Safety l -> Safety l Source #
Pretty (Safety l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Safety l -> Doc prettyPrec :: Int -> Safety l -> Doc
type Rep (Safety l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Safety l) = D1 ('MetaData "Safety" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))

data CallConv l Source #

The calling convention of a foreign function call.

Constructors

StdCall l |
CCall l |
CPlusPlus l |
DotNet l |
Jvm l |
Js l |
JavaScript l |
CApi l |

#### Instances

Instances details

Functor CallConv Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> CallConv a -> CallConv b Source # (<$) :: a -> CallConv b -> CallConv a Source #
Foldable CallConv Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => CallConv m -> m Source #

foldMap :: Monoid m => (a -> m) -> CallConv a -> m Source #

foldMap' :: Monoid m => (a -> m) -> CallConv a -> m Source #

foldr :: (a -> b -> b) -> b -> CallConv a -> b Source #

foldr' :: (a -> b -> b) -> b -> CallConv a -> b Source #

foldl :: (b -> a -> b) -> b -> CallConv a -> b Source #

foldl' :: (b -> a -> b) -> b -> CallConv a -> b Source #

foldr1 :: (a -> a -> a) -> CallConv a -> a Source #

foldl1 :: (a -> a -> a) -> CallConv a -> a Source #

toList :: CallConv a -> [a] Source #

null :: CallConv a -> Bool Source #

length :: CallConv a -> Int Source #

elem :: Eq a => a -> CallConv a -> Bool Source #

maximum :: Ord a => CallConv a -> a Source #

minimum :: Ord a => CallConv a -> a Source #

sum :: Num a => CallConv a -> a Source #

product :: Num a => CallConv a -> a Source #

Traversable CallConv Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> CallConv a -> f (CallConv b) Source # sequenceA :: Applicative f => CallConv (f a) -> f (CallConv a) Source # mapM :: Monad m => (a -> m b) -> CallConv a -> m (CallConv b) Source # sequence :: Monad m => CallConv (m a) -> m (CallConv a) Source #
ExactP CallConv Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: CallConv SrcSpanInfo -> EP ()
Annotated CallConv Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: CallConv l -> l Source # amap :: (l -> l) -> CallConv l -> CallConv l Source #
Data l => Data (CallConv l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (CallConv l) Source #

toConstr :: CallConv l -> Constr Source #

dataTypeOf :: CallConv l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (CallConv l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (CallConv l)) Source #

gmapT :: (forall b. Data b => b -> b) -> CallConv l -> CallConv l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CallConv l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CallConv l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> CallConv l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CallConv l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CallConv l -> m (CallConv l) Source #

Generic (CallConv l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (CallConv l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (CallConv l) = D1 ('MetaData "CallConv" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: CallConv l -> Rep (CallConv l) x Source #

to :: Rep (CallConv l) x -> CallConv l Source #

Show l => Show (CallConv l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> CallConv l -> ShowS Source # show :: CallConv l -> String Source # showList :: [CallConv l] -> ShowS Source #
Eq l => Eq (CallConv l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: CallConv l -> CallConv l -> Bool Source # (/=) :: CallConv l -> CallConv l -> Bool Source #
Ord l => Ord (CallConv l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: CallConv l -> CallConv l -> Ordering Source #

(<) :: CallConv l -> CallConv l -> Bool Source #

(<=) :: CallConv l -> CallConv l -> Bool Source #

(>) :: CallConv l -> CallConv l -> Bool Source #

(>=) :: CallConv l -> CallConv l -> Bool Source #

max :: CallConv l -> CallConv l -> CallConv l Source #

min :: CallConv l -> CallConv l -> CallConv l Source #

Pretty (CallConv l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: CallConv l -> Doc prettyPrec :: Int -> CallConv l -> Doc
type Rep (CallConv l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (CallConv l) = D1 ('MetaData "CallConv" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor ModulePragma Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> ModulePragma a -> ModulePragma b Source # (<$) :: a -> ModulePragma b -> ModulePragma a Source #
Foldable ModulePragma Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => ModulePragma m -> m Source #

foldMap :: Monoid m => (a -> m) -> ModulePragma a -> m Source #

foldMap' :: Monoid m => (a -> m) -> ModulePragma a -> m Source #

foldr :: (a -> b -> b) -> b -> ModulePragma a -> b Source #

foldr' :: (a -> b -> b) -> b -> ModulePragma a -> b Source #

foldl :: (b -> a -> b) -> b -> ModulePragma a -> b Source #

foldl' :: (b -> a -> b) -> b -> ModulePragma a -> b Source #

foldr1 :: (a -> a -> a) -> ModulePragma a -> a Source #

foldl1 :: (a -> a -> a) -> ModulePragma a -> a Source #

toList :: ModulePragma a -> [a] Source #

null :: ModulePragma a -> Bool Source #

length :: ModulePragma a -> Int Source #

elem :: Eq a => a -> ModulePragma a -> Bool Source #

maximum :: Ord a => ModulePragma a -> a Source #

minimum :: Ord a => ModulePragma a -> a Source #

sum :: Num a => ModulePragma a -> a Source #

product :: Num a => ModulePragma a -> a Source #

Traversable ModulePragma Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> ModulePragma a -> f (ModulePragma b) Source # sequenceA :: Applicative f => ModulePragma (f a) -> f (ModulePragma a) Source # mapM :: Monad m => (a -> m b) -> ModulePragma a -> m (ModulePragma b) Source # sequence :: Monad m => ModulePragma (m a) -> m (ModulePragma a) Source #
ExactP ModulePragma Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: ModulePragma SrcSpanInfo -> EP ()
Annotated ModulePragma Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModulePragma l -> l Source # amap :: (l -> l) -> ModulePragma l -> ModulePragma l Source #
Data l => Data (ModulePragma l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (ModulePragma l) Source #

toConstr :: ModulePragma l -> Constr Source #

dataTypeOf :: ModulePragma l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (ModulePragma l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (ModulePragma l)) Source #

gmapT :: (forall b. Data b => b -> b) -> ModulePragma l -> ModulePragma l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModulePragma l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModulePragma l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> ModulePragma l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModulePragma l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModulePragma l -> m (ModulePragma l) Source #

Generic (ModulePragma l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (ModulePragma l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModulePragma l) = D1 ('MetaData "ModulePragma" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: ModulePragma l -> Rep (ModulePragma l) x Source #

to :: Rep (ModulePragma l) x -> ModulePragma l Source #

Show l => Show (ModulePragma l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> ModulePragma l -> ShowS Source # show :: ModulePragma l -> String Source # showList :: [ModulePragma l] -> ShowS Source #
Eq l => Eq (ModulePragma l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: ModulePragma l -> ModulePragma l -> Bool Source # (/=) :: ModulePragma l -> ModulePragma l -> Bool Source #
Ord l => Ord (ModulePragma l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: ModulePragma l -> ModulePragma l -> Ordering Source #

(<) :: ModulePragma l -> ModulePragma l -> Bool Source #

(<=) :: ModulePragma l -> ModulePragma l -> Bool Source #

(>) :: ModulePragma l -> ModulePragma l -> Bool Source #

(>=) :: ModulePragma l -> ModulePragma l -> Bool Source #

max :: ModulePragma l -> ModulePragma l -> ModulePragma l Source #

min :: ModulePragma l -> ModulePragma l -> ModulePragma l Source #

Parseable (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) Source # |

Instance details

Defined in Language.Haskell.Exts.Parser

Methods

parse :: String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) Source #

parseWithMode :: ParseMode -> String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo))) Source #

parseWithComments :: ParseMode -> String -> ParseResult (NonGreedy (ListOf (ModulePragma SrcSpanInfo)), [Comment]) Source #

parser :: Maybe [Fixity] -> P (NonGreedy (ListOf (ModulePragma SrcSpanInfo)))

Pretty (ModulePragma l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: ModulePragma l -> Doc prettyPrec :: Int -> ModulePragma l -> Doc
type Rep (ModulePragma l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (ModulePragma l) = D1 ('MetaData "ModulePragma" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data Tool Source #

Recognised tools for OPTIONS pragmas.

Constructors

GHC |
HUGS |
NHC98 |
YHC |
HADDOCK |
UnknownTool String |

#### Instances

Instances details

Data Tool Source # |

Instance details

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 Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Tool Source #

toConstr :: Tool -> Constr Source #

dataTypeOf :: Tool -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Tool) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Tool) Source #

gmapT :: (forall b. Data b => b -> b) -> Tool -> Tool Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Tool -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Tool -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Tool -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Tool -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Tool -> m Tool Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Tool -> m Tool Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Tool -> m Tool Source #

Generic Tool Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep Tool |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep Tool = D1 ('MetaData "Tool" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Tool -> Rep Tool x Source #

to :: Rep Tool x -> Tool Source #

Show Tool Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Tool -> ShowS Source # show :: Tool -> String Source # showList :: [Tool] -> ShowS Source #
Eq Tool Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Tool -> Tool -> Bool Source # (/=) :: Tool -> Tool -> Bool Source #
Ord Tool Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Tool -> Tool -> Ordering Source # (<) :: Tool -> Tool -> Bool Source # (<=) :: Tool -> Tool -> Bool Source # (>) :: Tool -> Tool -> Bool Source # (>=) :: Tool -> Tool -> Bool Source # max :: Tool -> Tool -> Tool Source # min :: Tool -> Tool -> Tool Source #
Pretty Tool Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Tool -> Doc prettyPrec :: Int -> Tool -> Doc
type Rep Tool Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep Tool = D1 ('MetaData "Tool" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data Overlap l Source #

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

Instances details

Functor Overlap Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Overlap a -> Overlap b Source # (<$) :: a -> Overlap b -> Overlap a Source #
Foldable Overlap Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Overlap m -> m Source #

foldMap :: Monoid m => (a -> m) -> Overlap a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Overlap a -> m Source #

foldr :: (a -> b -> b) -> b -> Overlap a -> b Source #

foldr' :: (a -> b -> b) -> b -> Overlap a -> b Source #

foldl :: (b -> a -> b) -> b -> Overlap a -> b Source #

foldl' :: (b -> a -> b) -> b -> Overlap a -> b Source #

foldr1 :: (a -> a -> a) -> Overlap a -> a Source #

foldl1 :: (a -> a -> a) -> Overlap a -> a Source #

toList :: Overlap a -> [a] Source #

null :: Overlap a -> Bool Source #

length :: Overlap a -> Int Source #

elem :: Eq a => a -> Overlap a -> Bool Source #

maximum :: Ord a => Overlap a -> a Source #

minimum :: Ord a => Overlap a -> a Source #

sum :: Num a => Overlap a -> a Source #

product :: Num a => Overlap a -> a Source #

Traversable Overlap Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Overlap a -> f (Overlap b) Source # sequenceA :: Applicative f => Overlap (f a) -> f (Overlap a) Source # mapM :: Monad m => (a -> m b) -> Overlap a -> m (Overlap b) Source # sequence :: Monad m => Overlap (m a) -> m (Overlap a) Source #
ExactP Overlap Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Overlap SrcSpanInfo -> EP ()
Annotated Overlap Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Overlap l -> l Source # amap :: (l -> l) -> Overlap l -> Overlap l Source #
Data l => Data (Overlap l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Overlap l) Source #

toConstr :: Overlap l -> Constr Source #

dataTypeOf :: Overlap l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Overlap l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Overlap l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Overlap l -> Overlap l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Overlap l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Overlap l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Overlap l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Overlap l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Overlap l -> m (Overlap l) Source #

Generic (Overlap l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Overlap l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Overlap l) = D1 ('MetaData "Overlap" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Overlap l -> Rep (Overlap l) x Source #

to :: Rep (Overlap l) x -> Overlap l Source #

Show l => Show (Overlap l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Overlap l -> ShowS Source # show :: Overlap l -> String Source # showList :: [Overlap l] -> ShowS Source #
Eq l => Eq (Overlap l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Overlap l -> Overlap l -> Bool Source # (/=) :: Overlap l -> Overlap l -> Bool Source #
Ord l => Ord (Overlap l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Overlap l -> Overlap l -> Ordering Source #

(<) :: Overlap l -> Overlap l -> Bool Source #

(<=) :: Overlap l -> Overlap l -> Bool Source #

(>) :: Overlap l -> Overlap l -> Bool Source #

(>=) :: Overlap l -> Overlap l -> Bool Source #

max :: Overlap l -> Overlap l -> Overlap l Source #

min :: Overlap l -> Overlap l -> Overlap l Source #

Pretty (Overlap l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Overlap l -> Doc prettyPrec :: Int -> Overlap l -> Doc
type Rep (Overlap l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Overlap l) = D1 ('MetaData "Overlap" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

data Rule l Source #

The body of a RULES pragma.

Constructors

Rule l String (Maybe (Activation l)) (Maybe [RuleVar l]) (Exp l) (Exp l) |

#### Instances

Instances details

Functor Rule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Rule a -> Rule b Source # (<$) :: a -> Rule b -> Rule a Source #
Foldable Rule Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Rule m -> m Source #

foldMap :: Monoid m => (a -> m) -> Rule a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Rule a -> m Source #

foldr :: (a -> b -> b) -> b -> Rule a -> b Source #

foldr' :: (a -> b -> b) -> b -> Rule a -> b Source #

foldl :: (b -> a -> b) -> b -> Rule a -> b Source #

foldl' :: (b -> a -> b) -> b -> Rule a -> b Source #

foldr1 :: (a -> a -> a) -> Rule a -> a Source #

foldl1 :: (a -> a -> a) -> Rule a -> a Source #

toList :: Rule a -> [a] Source #

null :: Rule a -> Bool Source #

length :: Rule a -> Int Source #

elem :: Eq a => a -> Rule a -> Bool Source #

maximum :: Ord a => Rule a -> a Source #

minimum :: Ord a => Rule a -> a Source #

sum :: Num a => Rule a -> a Source #

product :: Num a => Rule a -> a Source #

Traversable Rule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Rule a -> f (Rule b) Source # sequenceA :: Applicative f => Rule (f a) -> f (Rule a) Source # mapM :: Monad m => (a -> m b) -> Rule a -> m (Rule b) Source # sequence :: Monad m => Rule (m a) -> m (Rule a) Source #
ExactP Rule Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Rule SrcSpanInfo -> EP ()
Annotated Rule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Rule l -> l Source # amap :: (l -> l) -> Rule l -> Rule l Source #
Data l => Data (Rule l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Rule l) Source #

toConstr :: Rule l -> Constr Source #

dataTypeOf :: Rule l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Rule l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Rule l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Rule l -> Rule l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rule l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rule l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Rule l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Rule l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rule l -> m (Rule l) Source #

Generic (Rule l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Rule l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Rule l) = D1 ('MetaData "Rule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

Methods

from :: Rule l -> Rep (Rule l) x Source #

to :: Rep (Rule l) x -> Rule l Source #

Show l => Show (Rule l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Rule l -> ShowS Source # show :: Rule l -> String Source # showList :: [Rule l] -> ShowS Source #
Eq l => Eq (Rule l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Rule l -> Rule l -> Bool Source # (/=) :: Rule l -> Rule l -> Bool Source #
Ord l => Ord (Rule l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods compare :: Rule l -> Rule l -> Ordering Source # (<) :: Rule l -> Rule l -> Bool Source # (<=) :: Rule l -> Rule l -> Bool Source # (>) :: Rule l -> Rule l -> Bool Source # (>=) :: Rule l -> Rule l -> Bool Source # max :: Rule l -> Rule l -> Rule l Source # min :: Rule l -> Rule l -> Rule l Source #
Pretty (Rule l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Rule l -> Doc prettyPrec :: Int -> Rule l -> Doc
type Rep (Rule l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Rule l) = D1 ('MetaData "Rule" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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))))))

data RuleVar l Source #

Variables used in a RULES pragma, optionally annotated with types

Constructors

RuleVar l (Name l) |
TypedRuleVar l (Name l) (Type l) |

#### Instances

Instances details

Functor RuleVar Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> RuleVar a -> RuleVar b Source # (<$) :: a -> RuleVar b -> RuleVar a Source #
Foldable RuleVar Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => RuleVar m -> m Source #

foldMap :: Monoid m => (a -> m) -> RuleVar a -> m Source #

foldMap' :: Monoid m => (a -> m) -> RuleVar a -> m Source #

foldr :: (a -> b -> b) -> b -> RuleVar a -> b Source #

foldr' :: (a -> b -> b) -> b -> RuleVar a -> b Source #

foldl :: (b -> a -> b) -> b -> RuleVar a -> b Source #

foldl' :: (b -> a -> b) -> b -> RuleVar a -> b Source #

foldr1 :: (a -> a -> a) -> RuleVar a -> a Source #

foldl1 :: (a -> a -> a) -> RuleVar a -> a Source #

toList :: RuleVar a -> [a] Source #

null :: RuleVar a -> Bool Source #

length :: RuleVar a -> Int Source #

elem :: Eq a => a -> RuleVar a -> Bool Source #

maximum :: Ord a => RuleVar a -> a Source #

minimum :: Ord a => RuleVar a -> a Source #

sum :: Num a => RuleVar a -> a Source #

product :: Num a => RuleVar a -> a Source #

Traversable RuleVar Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> RuleVar a -> f (RuleVar b) Source # sequenceA :: Applicative f => RuleVar (f a) -> f (RuleVar a) Source # mapM :: Monad m => (a -> m b) -> RuleVar a -> m (RuleVar b) Source # sequence :: Monad m => RuleVar (m a) -> m (RuleVar a) Source #
ExactP RuleVar Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: RuleVar SrcSpanInfo -> EP ()
Annotated RuleVar Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RuleVar l -> l Source # amap :: (l -> l) -> RuleVar l -> RuleVar l Source #
Data l => Data (RuleVar l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (RuleVar l) Source #

toConstr :: RuleVar l -> Constr Source #

dataTypeOf :: RuleVar l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (RuleVar l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (RuleVar l)) Source #

gmapT :: (forall b. Data b => b -> b) -> RuleVar l -> RuleVar l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RuleVar l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RuleVar l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> RuleVar l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> RuleVar l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleVar l -> m (RuleVar l) Source #

Generic (RuleVar l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (RuleVar l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RuleVar l) = D1 ('MetaData "RuleVar" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: RuleVar l -> Rep (RuleVar l) x Source #

to :: Rep (RuleVar l) x -> RuleVar l Source #

Show l => Show (RuleVar l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> RuleVar l -> ShowS Source # show :: RuleVar l -> String Source # showList :: [RuleVar l] -> ShowS Source #
Eq l => Eq (RuleVar l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: RuleVar l -> RuleVar l -> Bool Source # (/=) :: RuleVar l -> RuleVar l -> Bool Source #
Ord l => Ord (RuleVar l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: RuleVar l -> RuleVar l -> Ordering Source #

(<) :: RuleVar l -> RuleVar l -> Bool Source #

(<=) :: RuleVar l -> RuleVar l -> Bool Source #

(>) :: RuleVar l -> RuleVar l -> Bool Source #

(>=) :: RuleVar l -> RuleVar l -> Bool Source #

max :: RuleVar l -> RuleVar l -> RuleVar l Source #

min :: RuleVar l -> RuleVar l -> RuleVar l Source #

Pretty (RuleVar l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: RuleVar l -> Doc prettyPrec :: Int -> RuleVar l -> Doc
type Rep (RuleVar l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (RuleVar l) = D1 ('MetaData "RuleVar" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

Activation clause of a RULES pragma.

Constructors

ActiveFrom l Int |
ActiveUntil l Int |

#### Instances

Instances details

Functor Activation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Activation a -> Activation b Source # (<$) :: a -> Activation b -> Activation a Source #
Foldable Activation Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Activation m -> m Source #

foldMap :: Monoid m => (a -> m) -> Activation a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Activation a -> m Source #

foldr :: (a -> b -> b) -> b -> Activation a -> b Source #

foldr' :: (a -> b -> b) -> b -> Activation a -> b Source #

foldl :: (b -> a -> b) -> b -> Activation a -> b Source #

foldl' :: (b -> a -> b) -> b -> Activation a -> b Source #

foldr1 :: (a -> a -> a) -> Activation a -> a Source #

foldl1 :: (a -> a -> a) -> Activation a -> a Source #

toList :: Activation a -> [a] Source #

null :: Activation a -> Bool Source #

length :: Activation a -> Int Source #

elem :: Eq a => a -> Activation a -> Bool Source #

maximum :: Ord a => Activation a -> a Source #

minimum :: Ord a => Activation a -> a Source #

sum :: Num a => Activation a -> a Source #

product :: Num a => Activation a -> a Source #

Traversable Activation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Activation a -> f (Activation b) Source # sequenceA :: Applicative f => Activation (f a) -> f (Activation a) Source # mapM :: Monad m => (a -> m b) -> Activation a -> m (Activation b) Source # sequence :: Monad m => Activation (m a) -> m (Activation a) Source #
ExactP Activation Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Activation SrcSpanInfo -> EP ()
Annotated Activation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Activation l -> l Source # amap :: (l -> l) -> Activation l -> Activation l Source #
Data l => Data (Activation l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Activation l) Source #

toConstr :: Activation l -> Constr Source #

dataTypeOf :: Activation l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Activation l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Activation l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Activation l -> Activation l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Activation l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Activation l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Activation l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Activation l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation l -> m (Activation l) Source #

Generic (Activation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Activation l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Activation l) = D1 ('MetaData "Activation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))

Methods

from :: Activation l -> Rep (Activation l) x Source #

to :: Rep (Activation l) x -> Activation l Source #

Show l => Show (Activation l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Activation l -> ShowS Source # show :: Activation l -> String Source # showList :: [Activation l] -> ShowS Source #
Eq l => Eq (Activation l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Activation l -> Activation l -> Bool Source # (/=) :: Activation l -> Activation l -> Bool Source #
Ord l => Ord (Activation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Activation l -> Activation l -> Ordering Source #

(<) :: Activation l -> Activation l -> Bool Source #

(<=) :: Activation l -> Activation l -> Bool Source #

(>) :: Activation l -> Activation l -> Bool Source #

(>=) :: Activation l -> Activation l -> Bool Source #

max :: Activation l -> Activation l -> Activation l Source #

min :: Activation l -> Activation l -> Activation l Source #

Pretty (Activation l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Activation l -> Doc prettyPrec :: Int -> Activation l -> Doc
type Rep (Activation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Activation l) = D1 ('MetaData "Activation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor Annotation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> Annotation a -> Annotation b Source # (<$) :: a -> Annotation b -> Annotation a Source #
Foldable Annotation Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => Annotation m -> m Source #

foldMap :: Monoid m => (a -> m) -> Annotation a -> m Source #

foldMap' :: Monoid m => (a -> m) -> Annotation a -> m Source #

foldr :: (a -> b -> b) -> b -> Annotation a -> b Source #

foldr' :: (a -> b -> b) -> b -> Annotation a -> b Source #

foldl :: (b -> a -> b) -> b -> Annotation a -> b Source #

foldl' :: (b -> a -> b) -> b -> Annotation a -> b Source #

foldr1 :: (a -> a -> a) -> Annotation a -> a Source #

foldl1 :: (a -> a -> a) -> Annotation a -> a Source #

toList :: Annotation a -> [a] Source #

null :: Annotation a -> Bool Source #

length :: Annotation a -> Int Source #

elem :: Eq a => a -> Annotation a -> Bool Source #

maximum :: Ord a => Annotation a -> a Source #

minimum :: Ord a => Annotation a -> a Source #

sum :: Num a => Annotation a -> a Source #

product :: Num a => Annotation a -> a Source #

Traversable Annotation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods traverse :: Applicative f => (a -> f b) -> Annotation a -> f (Annotation b) Source # sequenceA :: Applicative f => Annotation (f a) -> f (Annotation a) Source # mapM :: Monad m => (a -> m b) -> Annotation a -> m (Annotation b) Source # sequence :: Monad m => Annotation (m a) -> m (Annotation a) Source #
ExactP Annotation Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: Annotation SrcSpanInfo -> EP ()
AppFixity Annotation Source # |
Instance details Defined in Language.Haskell.Exts.Fixity Methods applyFixities :: MonadFail m => [Fixity] -> Annotation SrcSpanInfo -> m (Annotation SrcSpanInfo) Source #
Annotated Annotation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Annotation l -> l Source # amap :: (l -> l) -> Annotation l -> Annotation l Source #
Data l => Data (Annotation l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Annotation l) Source #

toConstr :: Annotation l -> Constr Source #

dataTypeOf :: Annotation l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Annotation l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Annotation l)) Source #

gmapT :: (forall b. Data b => b -> b) -> Annotation l -> Annotation l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Annotation l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Annotation l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> Annotation l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Annotation l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Annotation l -> m (Annotation l) Source #

Generic (Annotation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (Annotation l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Annotation l) = D1 ('MetaData "Annotation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: Annotation l -> Rep (Annotation l) x Source #

to :: Rep (Annotation l) x -> Annotation l Source #

Show l => Show (Annotation l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> Annotation l -> ShowS Source # show :: Annotation l -> String Source # showList :: [Annotation l] -> ShowS Source #
Eq l => Eq (Annotation l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: Annotation l -> Annotation l -> Bool Source # (/=) :: Annotation l -> Annotation l -> Bool Source #
Ord l => Ord (Annotation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: Annotation l -> Annotation l -> Ordering Source #

(<) :: Annotation l -> Annotation l -> Bool Source #

(<=) :: Annotation l -> Annotation l -> Bool Source #

(>) :: Annotation l -> Annotation l -> Bool Source #

(>=) :: Annotation l -> Annotation l -> Bool Source #

max :: Annotation l -> Annotation l -> Annotation l Source #

min :: Annotation l -> Annotation l -> Annotation l Source #

Pretty (Annotation l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: Annotation l -> Doc prettyPrec :: Int -> Annotation l -> Doc
type Rep (Annotation l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (Annotation l) = D1 ('MetaData "Annotation" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

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

Instances details

Functor BooleanFormula Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods fmap :: (a -> b) -> BooleanFormula a -> BooleanFormula b Source # (<$) :: a -> BooleanFormula b -> BooleanFormula a Source #
Foldable BooleanFormula Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

fold :: Monoid m => BooleanFormula m -> m Source #

foldMap :: Monoid m => (a -> m) -> BooleanFormula a -> m Source #

foldMap' :: Monoid m => (a -> m) -> BooleanFormula a -> m Source #

foldr :: (a -> b -> b) -> b -> BooleanFormula a -> b Source #

foldr' :: (a -> b -> b) -> b -> BooleanFormula a -> b Source #

foldl :: (b -> a -> b) -> b -> BooleanFormula a -> b Source #

foldl' :: (b -> a -> b) -> b -> BooleanFormula a -> b Source #

foldr1 :: (a -> a -> a) -> BooleanFormula a -> a Source #

foldl1 :: (a -> a -> a) -> BooleanFormula a -> a Source #

toList :: BooleanFormula a -> [a] Source #

null :: BooleanFormula a -> Bool Source #

length :: BooleanFormula a -> Int Source #

elem :: Eq a => a -> BooleanFormula a -> Bool Source #

maximum :: Ord a => BooleanFormula a -> a Source #

minimum :: Ord a => BooleanFormula a -> a Source #

sum :: Num a => BooleanFormula a -> a Source #

product :: Num a => BooleanFormula a -> a Source #

Traversable BooleanFormula Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

traverse :: Applicative f => (a -> f b) -> BooleanFormula a -> f (BooleanFormula b) Source #

sequenceA :: Applicative f => BooleanFormula (f a) -> f (BooleanFormula a) Source #

mapM :: Monad m => (a -> m b) -> BooleanFormula a -> m (BooleanFormula b) Source #

sequence :: Monad m => BooleanFormula (m a) -> m (BooleanFormula a) Source #

ExactP BooleanFormula Source # |
Instance details Defined in Language.Haskell.Exts.ExactPrint Methods exactP :: BooleanFormula SrcSpanInfo -> EP ()
Annotated BooleanFormula Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: BooleanFormula l -> l Source # amap :: (l -> l) -> BooleanFormula l -> BooleanFormula l Source #
Data l => Data (BooleanFormula l) Source # |

Instance details

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) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BooleanFormula l) Source #

toConstr :: BooleanFormula l -> Constr Source #

dataTypeOf :: BooleanFormula l -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BooleanFormula l)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BooleanFormula l)) Source #

gmapT :: (forall b. Data b => b -> b) -> BooleanFormula l -> BooleanFormula l Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BooleanFormula l -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BooleanFormula l -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> BooleanFormula l -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> BooleanFormula l -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BooleanFormula l -> m (BooleanFormula l) Source #

Generic (BooleanFormula l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Associated Types

type Rep (BooleanFormula l) |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (BooleanFormula l) = D1 ('MetaData "BooleanFormula" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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)))))

Methods

from :: BooleanFormula l -> Rep (BooleanFormula l) x Source #

to :: Rep (BooleanFormula l) x -> BooleanFormula l Source #

Show l => Show (BooleanFormula l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods showsPrec :: Int -> BooleanFormula l -> ShowS Source # show :: BooleanFormula l -> String Source # showList :: [BooleanFormula l] -> ShowS Source #
Eq l => Eq (BooleanFormula l) Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods (==) :: BooleanFormula l -> BooleanFormula l -> Bool Source # (/=) :: BooleanFormula l -> BooleanFormula l -> Bool Source #
Ord l => Ord (BooleanFormula l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

Methods

compare :: BooleanFormula l -> BooleanFormula l -> Ordering Source #

(<) :: BooleanFormula l -> BooleanFormula l -> Bool Source #

(<=) :: BooleanFormula l -> BooleanFormula l -> Bool Source #

(>) :: BooleanFormula l -> BooleanFormula l -> Bool Source #

(>=) :: BooleanFormula l -> BooleanFormula l -> Bool Source #

max :: BooleanFormula l -> BooleanFormula l -> BooleanFormula l Source #

min :: BooleanFormula l -> BooleanFormula l -> BooleanFormula l Source #

Pretty (BooleanFormula l) Source # |
Instance details Defined in Language.Haskell.Exts.Pretty Methods pretty :: BooleanFormula l -> Doc prettyPrec :: Int -> BooleanFormula l -> Doc
type Rep (BooleanFormula l) Source # |

Instance details

Defined in Language.Haskell.Exts.Syntax

type Rep (BooleanFormula l) = D1 ('MetaData "BooleanFormula" "Language.Haskell.Exts.Syntax" "haskell-src-exts-1.23.1-3xHB6MViBk95bvXB6vMLW9" '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 Source #

main_mod :: l -> ModuleName l Source #

## Main function of a program

main_name :: l -> Name l Source #

## Constructors

unit_con_name :: l -> QName l Source #

tuple_con_name :: l -> Boxed -> Int -> QName l Source #

list_con_name :: l -> QName l Source #

list_cons_name :: l -> QName l Source #

unboxed_singleton_con_name :: l -> QName l Source #

unit_con :: l -> Exp l Source #

tuple_con :: l -> Boxed -> Int -> Exp l Source #

unboxed_singleton_con :: l -> Exp l Source #

## Special identifiers

as_name :: l -> Name l Source #

qualified_name :: l -> Name l Source #

hiding_name :: l -> Name l Source #

minus_name :: l -> Name l Source #

bang_name :: l -> Name l Source #

dot_name :: l -> Name l Source #

star_name :: l -> Name l Source #

export_name :: l -> Name l Source #

safe_name :: l -> Name l Source #

unsafe_name :: l -> Name l Source #

interruptible_name :: l -> Name l Source #

threadsafe_name :: l -> Name l Source #

stdcall_name :: l -> Name l Source #

ccall_name :: l -> Name l Source #

cplusplus_name :: l -> Name l Source #

dotnet_name :: l -> Name l Source #

jvm_name :: l -> Name l Source #

js_name :: l -> Name l Source #

javascript_name :: l -> Name l Source #

capi_name :: l -> Name l Source #

forall_name :: l -> Name l Source #

family_name :: l -> Name l Source #

role_name :: l -> Name l Source #

hole_name :: l -> QName l Source #

stock_name :: l -> Name l Source #

anyclass_name :: l -> Name l Source #

via_name :: l -> Name l Source #

## Type constructors

unit_tycon_name :: l -> QName l Source #

fun_tycon_name :: l -> QName l Source #

list_tycon_name :: l -> QName l Source #

tuple_tycon_name :: l -> Boxed -> Int -> QName l Source #

unboxed_singleton_tycon_name :: l -> QName l Source #

unit_tycon :: l -> Type l Source #

fun_tycon :: l -> Type l Source #

list_tycon :: l -> Type l Source #

tuple_tycon :: l -> Boxed -> Int -> Type l Source #

unboxed_singleton_tycon :: l -> Type l Source #

# Source coordinates

# Annotated trees

class Functor ast => Annotated (ast :: Type -> Type) where Source #

AST nodes are annotated, and this class allows manipulation of the annotations.

Methods

ann :: ast l -> l Source #

Retrieve the annotation of an AST node.

amap :: (l -> l) -> ast l -> ast l Source #

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`.

#### Instances

Instances details

Annotated Activation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Activation l -> l Source # amap :: (l -> l) -> Activation l -> Activation l Source #
Annotated Alt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Alt l -> l Source # amap :: (l -> l) -> Alt l -> Alt l Source #
Annotated Annotation Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Annotation l -> l Source # amap :: (l -> l) -> Annotation l -> Annotation l Source #
Annotated Assoc Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Assoc l -> l Source # amap :: (l -> l) -> Assoc l -> Assoc l Source #
Annotated Asst Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Asst l -> l Source # amap :: (l -> l) -> Asst l -> Asst l Source #
Annotated BangType Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: BangType l -> l Source # amap :: (l -> l) -> BangType l -> BangType l Source #
Annotated Binds Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Binds l -> l Source # amap :: (l -> l) -> Binds l -> Binds l Source #
Annotated BooleanFormula Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: BooleanFormula l -> l Source # amap :: (l -> l) -> BooleanFormula l -> BooleanFormula l Source #
Annotated Bracket Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Bracket l -> l Source # amap :: (l -> l) -> Bracket l -> Bracket l Source #
Annotated CName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: CName l -> l Source # amap :: (l -> l) -> CName l -> CName l Source #
Annotated CallConv Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: CallConv l -> l Source # amap :: (l -> l) -> CallConv l -> CallConv l Source #
Annotated ClassDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ClassDecl l -> l Source # amap :: (l -> l) -> ClassDecl l -> ClassDecl l Source #
Annotated ConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ConDecl l -> l Source # amap :: (l -> l) -> ConDecl l -> ConDecl l Source #
Annotated Context Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Context l -> l Source # amap :: (l -> l) -> Context l -> Context l Source #
Annotated DataOrNew Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DataOrNew l -> l Source # amap :: (l -> l) -> DataOrNew l -> DataOrNew l Source #
Annotated Decl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Decl l -> l Source # amap :: (l -> l) -> Decl l -> Decl l Source #
Annotated DeclHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DeclHead l -> l Source # amap :: (l -> l) -> DeclHead l -> DeclHead l Source #
Annotated DerivStrategy Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: DerivStrategy l -> l Source # amap :: (l -> l) -> DerivStrategy l -> DerivStrategy l Source #
Annotated Deriving Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Deriving l -> l Source # amap :: (l -> l) -> Deriving l -> Deriving l Source #
Annotated EWildcard Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: EWildcard l -> l Source # amap :: (l -> l) -> EWildcard l -> EWildcard l Source #
Annotated Exp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Exp l -> l Source # amap :: (l -> l) -> Exp l -> Exp l Source #
Annotated ExportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ExportSpec l -> l Source # amap :: (l -> l) -> ExportSpec l -> ExportSpec l Source #
Annotated ExportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ExportSpecList l -> l Source # amap :: (l -> l) -> ExportSpecList l -> ExportSpecList l Source #
Annotated FieldDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FieldDecl l -> l Source # amap :: (l -> l) -> FieldDecl l -> FieldDecl l Source #
Annotated FieldUpdate Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FieldUpdate l -> l Source # amap :: (l -> l) -> FieldUpdate l -> FieldUpdate l Source #
Annotated FunDep Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: FunDep l -> l Source # amap :: (l -> l) -> FunDep l -> FunDep l Source #
Annotated GadtDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: GadtDecl l -> l Source # amap :: (l -> l) -> GadtDecl l -> GadtDecl l Source #
Annotated GuardedRhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: GuardedRhs l -> l Source # amap :: (l -> l) -> GuardedRhs l -> GuardedRhs l Source #
Annotated IPBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: IPBind l -> l Source # amap :: (l -> l) -> IPBind l -> IPBind l Source #
Annotated IPName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: IPName l -> l Source # amap :: (l -> l) -> IPName l -> IPName l Source #
Annotated ImportDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportDecl l -> l Source # amap :: (l -> l) -> ImportDecl l -> ImportDecl l Source #
Annotated ImportSpec Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportSpec l -> l Source # amap :: (l -> l) -> ImportSpec l -> ImportSpec l Source #
Annotated ImportSpecList Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ImportSpecList l -> l Source # amap :: (l -> l) -> ImportSpecList l -> ImportSpecList l Source #
Annotated InjectivityInfo Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InjectivityInfo l -> l Source # amap :: (l -> l) -> InjectivityInfo l -> InjectivityInfo l Source #
Annotated InstDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstDecl l -> l Source # amap :: (l -> l) -> InstDecl l -> InstDecl l Source #
Annotated InstHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstHead l -> l Source # amap :: (l -> l) -> InstHead l -> InstHead l Source #
Annotated InstRule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: InstRule l -> l Source # amap :: (l -> l) -> InstRule l -> InstRule l Source #
Annotated Literal Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Literal l -> l Source # amap :: (l -> l) -> Literal l -> Literal l Source #
Annotated Match Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Match l -> l Source # amap :: (l -> l) -> Match l -> Match l Source #
Annotated MaybePromotedName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: MaybePromotedName l -> l Source # amap :: (l -> l) -> MaybePromotedName l -> MaybePromotedName l Source #
Annotated Module Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Module l -> l Source # amap :: (l -> l) -> Module l -> Module l Source #
Annotated ModuleHead Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModuleHead l -> l Source # amap :: (l -> l) -> ModuleHead l -> ModuleHead l Source #
Annotated ModuleName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModuleName l -> l Source # amap :: (l -> l) -> ModuleName l -> ModuleName l Source #
Annotated ModulePragma Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ModulePragma l -> l Source # amap :: (l -> l) -> ModulePragma l -> ModulePragma l Source #
Annotated Name Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Name l -> l Source # amap :: (l -> l) -> Name l -> Name l Source #
Annotated Namespace Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Namespace l -> l Source # amap :: (l -> l) -> Namespace l -> Namespace l Source #
Annotated Op Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Op l -> l Source # amap :: (l -> l) -> Op l -> Op l Source #
Annotated Overlap Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Overlap l -> l Source # amap :: (l -> l) -> Overlap l -> Overlap l Source #
Annotated PXAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: PXAttr l -> l Source # amap :: (l -> l) -> PXAttr l -> PXAttr l Source #
Annotated Pat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Pat l -> l Source # amap :: (l -> l) -> Pat l -> Pat l Source #
Annotated PatField Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: PatField l -> l Source # amap :: (l -> l) -> PatField l -> PatField l Source #
Annotated Promoted Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Promoted l -> l Source # amap :: (l -> l) -> Promoted l -> Promoted l Source #
Annotated QName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QName l -> l Source # amap :: (l -> l) -> QName l -> QName l Source #
Annotated QOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QOp l -> l Source # amap :: (l -> l) -> QOp l -> QOp l Source #
Annotated QualConDecl Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QualConDecl l -> l Source # amap :: (l -> l) -> QualConDecl l -> QualConDecl l Source #
Annotated QualStmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: QualStmt l -> l Source # amap :: (l -> l) -> QualStmt l -> QualStmt l Source #
Annotated RPat Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RPat l -> l Source # amap :: (l -> l) -> RPat l -> RPat l Source #
Annotated RPatOp Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RPatOp l -> l Source # amap :: (l -> l) -> RPatOp l -> RPatOp l Source #
Annotated ResultSig Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: ResultSig l -> l Source # amap :: (l -> l) -> ResultSig l -> ResultSig l Source #
Annotated Rhs Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Rhs l -> l Source # amap :: (l -> l) -> Rhs l -> Rhs l Source #
Annotated Role Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Role l -> l Source # amap :: (l -> l) -> Role l -> Role l Source #
Annotated Rule Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Rule l -> l Source # amap :: (l -> l) -> Rule l -> Rule l Source #
Annotated RuleVar Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: RuleVar l -> l Source # amap :: (l -> l) -> RuleVar l -> RuleVar l Source #
Annotated Safety Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Safety l -> l Source # amap :: (l -> l) -> Safety l -> Safety l Source #
Annotated Sign Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Sign l -> l Source # amap :: (l -> l) -> Sign l -> Sign l Source #
Annotated SpecialCon Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: SpecialCon l -> l Source # amap :: (l -> l) -> SpecialCon l -> SpecialCon l Source #
Annotated Splice Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Splice l -> l Source # amap :: (l -> l) -> Splice l -> Splice l Source #
Annotated Stmt Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Stmt l -> l Source # amap :: (l -> l) -> Stmt l -> Stmt l Source #
Annotated TyVarBind Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: TyVarBind l -> l Source # amap :: (l -> l) -> TyVarBind l -> TyVarBind l Source #
Annotated Type Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Type l -> l Source # amap :: (l -> l) -> Type l -> Type l Source #
Annotated TypeEqn Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: TypeEqn l -> l Source # amap :: (l -> l) -> TypeEqn l -> TypeEqn l Source #
Annotated Unpackedness Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: Unpackedness l -> l Source # amap :: (l -> l) -> Unpackedness l -> Unpackedness l Source #
Annotated WarningText Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: WarningText l -> l Source # amap :: (l -> l) -> WarningText l -> WarningText l Source #
Annotated XAttr Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: XAttr l -> l Source # amap :: (l -> l) -> XAttr l -> XAttr l Source #
Annotated XName Source # |
Instance details Defined in Language.Haskell.Exts.Syntax Methods ann :: XName l -> l Source # amap :: (l -> l) -> XName l -> XName l Source #

(=~=) :: (Annotated a, Eq (a ())) => a l1 -> a l2 -> Bool Source #

Test if two AST elements are equal modulo annotations.