This differs from Dependencies. A module X may be in the dep_mods of this module (via an import chain) but if we don't use anything from X it won't appear in our Usage

Constructors

UsagePackageModule	Module from another package
Fields usg_mod :: Module External package module depended on usg_mod_hash :: Fingerprint Cached module ABI fingerprint (corresponds to mi_mod_hash) usg_safe :: IsSafeImport Was this module imported as a safe import
UsageHomeModule	Module from the current package
Fields usg_mod_name :: ModuleName Name of the module usg_unit_id :: UnitId UnitId of the HomeUnit the module is from usg_mod_hash :: Fingerprint Cached module ABI fingerprint (corresponds to mi_mod_hash) usg_entities :: [(OccName, Fingerprint)] Entities we depend on, sorted by occurrence name and fingerprinted. NB: usages are for parent names only, e.g. type constructors but not the associated data constructors. usg_exports :: Maybe Fingerprint Fingerprint for the export list of this module, if we directly imported it (and hence we depend on its export list) usg_safe :: IsSafeImport Was this module imported as a safe import
UsageFile	A file upon which the module depends, e.g. a CPP #include, or using TH's `addDependentFile`
Fields usg_file_path :: FilePath External file dependency. From a CPP #include or TH addDependentFile. Should be absolute. usg_file_hash :: Fingerprint `Fingerprint` of the file contents. usg_file_label :: Maybe String An optional string which is used in recompilation messages if file in question has changed.
UsageHomeModuleInterface
Fields usg_mod_name :: ModuleName Name of the module usg_unit_id :: UnitId UnitId of the HomeUnit the module is from usg_iface_hash :: Fingerprint The interface hash of the module, not the ABI hash. This changes when anything about the interface (and hence the module) has changed.
UsageMergedRequirement	A requirement which was merged into this one.
Fields usg_mod :: Module External package module depended on usg_mod_hash :: Fingerprint Cached module ABI fingerprint (corresponds to mi_mod_hash)

Instances

Instances details

Binary Usage
Instance details Defined in GHC.Unit.Module.Deps Methods put_ :: BinHandle -> Usage -> IO () # put :: BinHandle -> Usage -> IO (Bin Usage) # get :: BinHandle -> IO Usage #
Eq Usage
Instance details Defined in GHC.Unit.Module.Deps Methods (==) :: Usage -> Usage -> Bool # (/=) :: Usage -> Usage -> Bool #

liftZonkM :: a -> a Source #

data FastStringCompat Source #

Instances

Instances details

IsString FastStringCompat Source #
Instance details Defined in Development.IDE.GHC.Compat Methods fromString :: String -> FastStringCompat #
Show FastStringCompat Source #
Instance details Defined in Development.IDE.GHC.Compat Methods showsPrec :: Int -> FastStringCompat -> ShowS # show :: FastStringCompat -> String # showList :: [FastStringCompat] -> ShowS #
Eq FastStringCompat Source #
Instance details Defined in Development.IDE.GHC.Compat Methods (==) :: FastStringCompat -> FastStringCompat -> Bool # (/=) :: FastStringCompat -> FastStringCompat -> Bool #
Ord FastStringCompat Source #
Instance details Defined in Development.IDE.GHC.Compat Methods compare :: FastStringCompat -> FastStringCompat -> Ordering # (<) :: FastStringCompat -> FastStringCompat -> Bool # (<=) :: FastStringCompat -> FastStringCompat -> Bool # (>) :: FastStringCompat -> FastStringCompat -> Bool # (>=) :: FastStringCompat -> FastStringCompat -> Bool # max :: FastStringCompat -> FastStringCompat -> FastStringCompat # min :: FastStringCompat -> FastStringCompat -> FastStringCompat #

bytesFS :: FastString -> ByteString #

Gives the Modified UTF-8 encoded bytes corresponding to a FastString

mkFastStringByteString :: ByteString -> FastString #

Create a FastString by copying an existing ByteString

nodeInfo' :: HieAST TypeIndex -> NodeInfo TypeIndex Source #

getNodeIds :: HieAST a -> Map Identifier (IdentifierDetails a) Source #

sourceNodeInfo :: HieAST a -> Maybe (NodeInfo a) Source #

generatedNodeInfo :: HieAST a -> Maybe (NodeInfo a) Source #

simpleNodeInfoCompat :: FastStringCompat -> FastStringCompat -> NodeInfo a Source #

isAnnotationInNodeInfo :: (FastStringCompat, FastStringCompat) -> NodeInfo a -> Bool Source #

nodeAnnotations :: NodeInfo a -> Set (FastStringCompat, FastStringCompat) Source #

mkAstNode :: NodeInfo a -> Span -> [HieAST a] -> HieAST a Source #

combineRealSrcSpans :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan #

Combines two SrcSpan into one that spans at least all the characters within both spans. Assumes the "file" part is the same in both inputs

nonDetFoldOccEnv :: (a -> b -> b) -> b -> OccEnv a -> b Source #

isQualifiedImport :: ImportDecl a -> Bool Source #

data GhcVersion Source #

Constructors

GHC810
GHC90
GHC92
GHC94
GHC96
GHC98

Instances

Instances details

Show GhcVersion Source #
Instance details Defined in Development.IDE.GHC.Compat Methods showsPrec :: Int -> GhcVersion -> ShowS # show :: GhcVersion -> String # showList :: [GhcVersion] -> ShowS #
Eq GhcVersion Source #
Instance details Defined in Development.IDE.GHC.Compat Methods (==) :: GhcVersion -> GhcVersion -> Bool # (/=) :: GhcVersion -> GhcVersion -> Bool #
Ord GhcVersion Source #
Instance details Defined in Development.IDE.GHC.Compat Methods compare :: GhcVersion -> GhcVersion -> Ordering # (<) :: GhcVersion -> GhcVersion -> Bool # (<=) :: GhcVersion -> GhcVersion -> Bool # (>) :: GhcVersion -> GhcVersion -> Bool # (>=) :: GhcVersion -> GhcVersion -> Bool # max :: GhcVersion -> GhcVersion -> GhcVersion # min :: GhcVersion -> GhcVersion -> GhcVersion #

ghcVersion :: GhcVersion Source #

ghcVersionStr :: String Source #

HIE Compat

data HieFileResult #

Constructors

HieFileResult
Fields hie_file_result_version :: Integer hie_file_result_ghc_version :: ByteString hie_file_result :: HieFile

data HieFile #

GHC builds up a wealth of information about Haskell source as it compiles it. .hie files are a way of persisting some of this information to disk so that external tools that need to work with haskell source don't need to parse, typecheck, and rename all over again. These files contain:

a simplified AST
- nodes are annotated with source positions and types
- identifiers are annotated with scope information
the raw bytes of the initial Haskell source

Besides saving compilation cycles, .hie files also offer a more stable interface than the GHC API.

Constructors

HieFile

Fields

hie_hs_file :: FilePath
Initial Haskell source file path
hie_module :: Module
The module this HIE file is for
hie_types :: Array TypeIndex HieTypeFlat
Types referenced in the hie_asts.
See Note [Efficient serialization of redundant type info]
hie_asts :: HieASTs TypeIndex
Type-annotated abstract syntax trees
hie_exports :: [AvailInfo]
The names that this module exports
hie_hs_src :: ByteString
Raw bytes of the initial Haskell source

Instances

Instances details

Show HieFile Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> HieFile -> ShowS # show :: HieFile -> String # showList :: [HieFile] -> ShowS #
NFData HieFile Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HieFile -> () #
Binary HieFile
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieFile -> IO () # put :: BinHandle -> HieFile -> IO (Bin HieFile) # get :: BinHandle -> IO HieFile #

hieExportNames :: HieFile -> [(SrcSpan, Name)] Source #

mkHieFile' :: ModSummary -> [AvailInfo] -> HieASTs Type -> ByteString -> Hsc HieFile Source #

enrichHie :: TypecheckedSource -> RenamedSource -> Bag EvBind -> [ClsInst] -> [TyCon] -> HieASTs Type #

writeHieFile :: FilePath -> HieFile -> IO () #

Write a HieFile to the given FilePath, with a proper header and symbol tables for Names and FastStrings

readHieFile :: NameCache -> FilePath -> IO HieFileResult #

Read a HieFile from a FilePath. Can use an existing NameCache.

setHieDir :: FilePath -> DynFlags -> DynFlags Source #

dontWriteHieFiles :: DynFlags -> DynFlags Source #

data IEType #

Types of imports and exports

Constructors

Import
ImportAs
ImportHiding
Export

Instances

Instances details

Enum IEType
Instance details Defined in GHC.Iface.Ext.Types Methods succ :: IEType -> IEType # pred :: IEType -> IEType # toEnum :: Int -> IEType # fromEnum :: IEType -> Int # enumFrom :: IEType -> [IEType] # enumFromThen :: IEType -> IEType -> [IEType] # enumFromTo :: IEType -> IEType -> [IEType] # enumFromThenTo :: IEType -> IEType -> IEType -> [IEType] #
Binary IEType
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> IEType -> IO () # put :: BinHandle -> IEType -> IO (Bin IEType) # get :: BinHandle -> IO IEType #
Outputable IEType
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: IEType -> SDoc #
Eq IEType
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: IEType -> IEType -> Bool # (/=) :: IEType -> IEType -> Bool #
Ord IEType
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: IEType -> IEType -> Ordering # (<) :: IEType -> IEType -> Bool # (<=) :: IEType -> IEType -> Bool # (>) :: IEType -> IEType -> Bool # (>=) :: IEType -> IEType -> Bool # max :: IEType -> IEType -> IEType # min :: IEType -> IEType -> IEType #

data HieName #

Name's get converted into HieName's before being written into .hie files. See toHieName and fromHieName for logic on how to convert between these two types.

Constructors

ExternalName !Module !OccName !SrcSpan
LocalName !OccName !SrcSpan
KnownKeyName !Unique

Instances

Instances details

Outputable HieName
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: HieName -> SDoc #
Eq HieName
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: HieName -> HieName -> Bool # (/=) :: HieName -> HieName -> Bool #
Ord HieName
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: HieName -> HieName -> Ordering # (<) :: HieName -> HieName -> Bool # (<=) :: HieName -> HieName -> Bool # (>) :: HieName -> HieName -> Bool # (>=) :: HieName -> HieName -> Bool # max :: HieName -> HieName -> HieName # min :: HieName -> HieName -> HieName #

data TyVarScope #

Scope of a type variable.

This warrants a data type apart from Scope because of complexities introduced by features like -XScopedTypeVariables and -XInstanceSigs. For example, consider:

foo, bar, baz :: forall a. a -> a

Here a is in scope in all the definitions of foo, bar, and baz, so we need a list of scopes to keep track of this. Furthermore, this list cannot be computed until we resolve the binding sites of foo, bar, and baz.

Consequently, a starts with an UnresolvedScope [foo, bar, baz] Nothing which later gets resolved into a ResolvedScopes.

Constructors

ResolvedScopes [Scope]
UnresolvedScope	Unresolved scopes should never show up in the final `.hie` file
Fields [Name] names of the definitions over which the scope spans (Maybe Span) the location of the instance/class declaration for the case where the type variable is declared in a method type signature

Instances

Instances details

Binary TyVarScope
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> TyVarScope -> IO () # put :: BinHandle -> TyVarScope -> IO (Bin TyVarScope) # get :: BinHandle -> IO TyVarScope #
Outputable TyVarScope
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: TyVarScope -> SDoc #
Eq TyVarScope
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: TyVarScope -> TyVarScope -> Bool # (/=) :: TyVarScope -> TyVarScope -> Bool #
Ord TyVarScope
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: TyVarScope -> TyVarScope -> Ordering # (<) :: TyVarScope -> TyVarScope -> Bool # (<=) :: TyVarScope -> TyVarScope -> Bool # (>) :: TyVarScope -> TyVarScope -> Bool # (>=) :: TyVarScope -> TyVarScope -> Bool # max :: TyVarScope -> TyVarScope -> TyVarScope # min :: TyVarScope -> TyVarScope -> TyVarScope #

data Scope #

Constructors

NoScope
LocalScope Span
ModuleScope

Instances

Instances details

Data Scope
Instance details Defined in GHC.Iface.Ext.Types Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Scope -> c Scope # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Scope # toConstr :: Scope -> Constr # dataTypeOf :: Scope -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Scope) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Scope) # gmapT :: (forall b. Data b => b -> b) -> Scope -> Scope # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Scope -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Scope -> r # gmapQ :: (forall d. Data d => d -> u) -> Scope -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Scope -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Scope -> m Scope # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Scope -> m Scope # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Scope -> m Scope #
Binary Scope
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> Scope -> IO () # put :: BinHandle -> Scope -> IO (Bin Scope) # get :: BinHandle -> IO Scope #
Outputable Scope
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: Scope -> SDoc #
Eq Scope
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: Scope -> Scope -> Bool # (/=) :: Scope -> Scope -> Bool #
Ord Scope
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: Scope -> Scope -> Ordering # (<) :: Scope -> Scope -> Bool # (<=) :: Scope -> Scope -> Bool # (>) :: Scope -> Scope -> Bool # (>=) :: Scope -> Scope -> Bool # max :: Scope -> Scope -> Scope # min :: Scope -> Scope -> Scope #

data DeclType #

Constructors

FamDec	type or data family
SynDec	type synonym
DataDec	data declaration
ConDec	constructor declaration
PatSynDec	pattern synonym
ClassDec	class declaration
InstDec	instance declaration

Instances

Instances details

Enum DeclType
Instance details Defined in GHC.Iface.Ext.Types Methods succ :: DeclType -> DeclType # pred :: DeclType -> DeclType # toEnum :: Int -> DeclType # fromEnum :: DeclType -> Int # enumFrom :: DeclType -> [DeclType] # enumFromThen :: DeclType -> DeclType -> [DeclType] # enumFromTo :: DeclType -> DeclType -> [DeclType] # enumFromThenTo :: DeclType -> DeclType -> DeclType -> [DeclType] #
Binary DeclType
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> DeclType -> IO () # put :: BinHandle -> DeclType -> IO (Bin DeclType) # get :: BinHandle -> IO DeclType #
Outputable DeclType
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: DeclType -> SDoc #
Eq DeclType
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: DeclType -> DeclType -> Bool # (/=) :: DeclType -> DeclType -> Bool #
Ord DeclType
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: DeclType -> DeclType -> Ordering # (<) :: DeclType -> DeclType -> Bool # (<=) :: DeclType -> DeclType -> Bool # (>) :: DeclType -> DeclType -> Bool # (>=) :: DeclType -> DeclType -> Bool # max :: DeclType -> DeclType -> DeclType # min :: DeclType -> DeclType -> DeclType #

data BindType #

Constructors

RegularBind
InstanceBind

Instances

Instances details

Enum BindType
Instance details Defined in GHC.Iface.Ext.Types Methods succ :: BindType -> BindType # pred :: BindType -> BindType # toEnum :: Int -> BindType # fromEnum :: BindType -> Int # enumFrom :: BindType -> [BindType] # enumFromThen :: BindType -> BindType -> [BindType] # enumFromTo :: BindType -> BindType -> [BindType] # enumFromThenTo :: BindType -> BindType -> BindType -> [BindType] #
Binary BindType
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> BindType -> IO () # put :: BinHandle -> BindType -> IO (Bin BindType) # get :: BinHandle -> IO BindType #
Outputable BindType
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: BindType -> SDoc #
Eq BindType
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: BindType -> BindType -> Bool # (/=) :: BindType -> BindType -> Bool #
Ord BindType
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: BindType -> BindType -> Ordering # (<) :: BindType -> BindType -> Bool # (<=) :: BindType -> BindType -> Bool # (>) :: BindType -> BindType -> Bool # (>=) :: BindType -> BindType -> Bool # max :: BindType -> BindType -> BindType # min :: BindType -> BindType -> BindType #

data RecFieldContext #

Constructors

RecFieldDecl
RecFieldAssign
RecFieldMatch
RecFieldOcc

Instances

Instances details

Enum RecFieldContext
Instance details Defined in GHC.Iface.Ext.Types Methods succ :: RecFieldContext -> RecFieldContext # pred :: RecFieldContext -> RecFieldContext # toEnum :: Int -> RecFieldContext # fromEnum :: RecFieldContext -> Int # enumFrom :: RecFieldContext -> [RecFieldContext] # enumFromThen :: RecFieldContext -> RecFieldContext -> [RecFieldContext] # enumFromTo :: RecFieldContext -> RecFieldContext -> [RecFieldContext] # enumFromThenTo :: RecFieldContext -> RecFieldContext -> RecFieldContext -> [RecFieldContext] #
Binary RecFieldContext
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> RecFieldContext -> IO () # put :: BinHandle -> RecFieldContext -> IO (Bin RecFieldContext) # get :: BinHandle -> IO RecFieldContext #
Outputable RecFieldContext
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: RecFieldContext -> SDoc #
Eq RecFieldContext
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: RecFieldContext -> RecFieldContext -> Bool # (/=) :: RecFieldContext -> RecFieldContext -> Bool #
Ord RecFieldContext
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: RecFieldContext -> RecFieldContext -> Ordering # (<) :: RecFieldContext -> RecFieldContext -> Bool # (<=) :: RecFieldContext -> RecFieldContext -> Bool # (>) :: RecFieldContext -> RecFieldContext -> Bool # (>=) :: RecFieldContext -> RecFieldContext -> Bool # max :: RecFieldContext -> RecFieldContext -> RecFieldContext # min :: RecFieldContext -> RecFieldContext -> RecFieldContext #

newtype EvBindDeps #

Eq/Ord instances compare on the converted HieName, as non-exported names may have different uniques after a roundtrip

Constructors

EvBindDeps
Fields getEvBindDeps :: [Name]

Instances

Instances details

Binary EvBindDeps
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> EvBindDeps -> IO () # put :: BinHandle -> EvBindDeps -> IO (Bin EvBindDeps) # get :: BinHandle -> IO EvBindDeps #
Outputable EvBindDeps
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: EvBindDeps -> SDoc #
Eq EvBindDeps
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: EvBindDeps -> EvBindDeps -> Bool # (/=) :: EvBindDeps -> EvBindDeps -> Bool #
Ord EvBindDeps
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: EvBindDeps -> EvBindDeps -> Ordering # (<) :: EvBindDeps -> EvBindDeps -> Bool # (<=) :: EvBindDeps -> EvBindDeps -> Bool # (>) :: EvBindDeps -> EvBindDeps -> Bool # (>=) :: EvBindDeps -> EvBindDeps -> Bool # max :: EvBindDeps -> EvBindDeps -> EvBindDeps # min :: EvBindDeps -> EvBindDeps -> EvBindDeps #

data EvVarSource #

Constructors

EvPatternBind	bound by a pattern match
EvSigBind	bound by a type signature
EvWrapperBind	bound by a hswrapper
EvImplicitBind	bound by an implicit variable
EvInstBind	Bound by some instance of given class
Fields isSuperInst :: Bool cls :: Name
EvLetBind EvBindDeps	A direct let binding

Instances

Instances details

Binary EvVarSource
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> EvVarSource -> IO () # put :: BinHandle -> EvVarSource -> IO (Bin EvVarSource) # get :: BinHandle -> IO EvVarSource #
Outputable EvVarSource
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: EvVarSource -> SDoc #
Eq EvVarSource
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: EvVarSource -> EvVarSource -> Bool # (/=) :: EvVarSource -> EvVarSource -> Bool #
Ord EvVarSource
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: EvVarSource -> EvVarSource -> Ordering # (<) :: EvVarSource -> EvVarSource -> Bool # (<=) :: EvVarSource -> EvVarSource -> Bool # (>) :: EvVarSource -> EvVarSource -> Bool # (>=) :: EvVarSource -> EvVarSource -> Bool # max :: EvVarSource -> EvVarSource -> EvVarSource # min :: EvVarSource -> EvVarSource -> EvVarSource #

data ContextInfo #

Different contexts under which identifiers exist

Constructors

Use	regular variable
MatchBind
IEThing IEType	import/export
TyDecl
ValBind	Value binding
Fields BindType whether or not the binding is in an instance Scope scope over which the value is bound (Maybe Span) span of entire binding
PatternBind	Pattern binding This case is tricky because the bound identifier can be used in two distinct scopes. Consider the following example (with `-XViewPatterns`) do (b, a, (a -> True)) <- bar foo a The identifier `a` has two scopes: in the view pattern `(a -> True)` and in the rest of the `do`-block in `foo a`.
Fields Scope scope in the pattern (the variable bound can be used further in the pattern) Scope rest of the scope outside the pattern (Maybe Span) span of entire binding
ClassTyDecl (Maybe Span)
Decl	Declaration
Fields DeclType type of declaration (Maybe Span) span of entire binding
TyVarBind Scope TyVarScope	Type variable
RecField RecFieldContext (Maybe Span)	Record field
EvidenceVarBind	Constraint/Dictionary evidence variable binding
Fields EvVarSource how did this bind come into being Scope scope over which the value is bound (Maybe Span) span of the binding site
EvidenceVarUse	Usage of evidence variable

Instances

Instances details

Binary ContextInfo
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> ContextInfo -> IO () # put :: BinHandle -> ContextInfo -> IO (Bin ContextInfo) # get :: BinHandle -> IO ContextInfo #
Outputable ContextInfo
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: ContextInfo -> SDoc #
Eq ContextInfo
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: ContextInfo -> ContextInfo -> Bool # (/=) :: ContextInfo -> ContextInfo -> Bool #
Ord ContextInfo
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: ContextInfo -> ContextInfo -> Ordering # (<) :: ContextInfo -> ContextInfo -> Bool # (<=) :: ContextInfo -> ContextInfo -> Bool # (>) :: ContextInfo -> ContextInfo -> Bool # (>=) :: ContextInfo -> ContextInfo -> Bool # max :: ContextInfo -> ContextInfo -> ContextInfo # min :: ContextInfo -> ContextInfo -> ContextInfo #

data IdentifierDetails a #

Information associated with every identifier

We need to include types with identifiers because sometimes multiple identifiers occur in the same span(Overloaded Record Fields and so on)

Constructors

IdentifierDetails
Fields identType :: Maybe a identInfo :: Set ContextInfo

Instances

Instances details

Foldable IdentifierDetails
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => IdentifierDetails m -> m # foldMap :: Monoid m => (a -> m) -> IdentifierDetails a -> m # foldMap' :: Monoid m => (a -> m) -> IdentifierDetails a -> m # foldr :: (a -> b -> b) -> b -> IdentifierDetails a -> b # foldr' :: (a -> b -> b) -> b -> IdentifierDetails a -> b # foldl :: (b -> a -> b) -> b -> IdentifierDetails a -> b # foldl' :: (b -> a -> b) -> b -> IdentifierDetails a -> b # foldr1 :: (a -> a -> a) -> IdentifierDetails a -> a # foldl1 :: (a -> a -> a) -> IdentifierDetails a -> a # toList :: IdentifierDetails a -> [a] # null :: IdentifierDetails a -> Bool # length :: IdentifierDetails a -> Int # elem :: Eq a => a -> IdentifierDetails a -> Bool # maximum :: Ord a => IdentifierDetails a -> a # minimum :: Ord a => IdentifierDetails a -> a # sum :: Num a => IdentifierDetails a -> a # product :: Num a => IdentifierDetails a -> a #
Traversable IdentifierDetails
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> IdentifierDetails a -> f (IdentifierDetails b) # sequenceA :: Applicative f => IdentifierDetails (f a) -> f (IdentifierDetails a) # mapM :: Monad m => (a -> m b) -> IdentifierDetails a -> m (IdentifierDetails b) # sequence :: Monad m => IdentifierDetails (m a) -> m (IdentifierDetails a) #
Functor IdentifierDetails
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> IdentifierDetails a -> IdentifierDetails b # (<$) :: a -> IdentifierDetails b -> IdentifierDetails a #
Monoid (IdentifierDetails a)
Instance details Defined in GHC.Iface.Ext.Types Methods mempty :: IdentifierDetails a # mappend :: IdentifierDetails a -> IdentifierDetails a -> IdentifierDetails a # mconcat :: [IdentifierDetails a] -> IdentifierDetails a #
Semigroup (IdentifierDetails a)
Instance details Defined in GHC.Iface.Ext.Types Methods (<>) :: IdentifierDetails a -> IdentifierDetails a -> IdentifierDetails a # sconcat :: NonEmpty (IdentifierDetails a) -> IdentifierDetails a # stimes :: Integral b => b -> IdentifierDetails a -> IdentifierDetails a #
NFData a => NFData (IdentifierDetails a) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: IdentifierDetails a -> () #
Binary (IdentifierDetails TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> IdentifierDetails TypeIndex -> IO () # put :: BinHandle -> IdentifierDetails TypeIndex -> IO (Bin (IdentifierDetails TypeIndex)) # get :: BinHandle -> IO (IdentifierDetails TypeIndex) #
Outputable a => Outputable (IdentifierDetails a)
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: IdentifierDetails a -> SDoc #
Eq a => Eq (IdentifierDetails a)
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: IdentifierDetails a -> IdentifierDetails a -> Bool # (/=) :: IdentifierDetails a -> IdentifierDetails a -> Bool #

type NodeIdentifiers a = Map Identifier (IdentifierDetails a) #

type Identifier = Either ModuleName Name #

data NodeInfo a #

The information stored in one AST node.

The type parameter exists to provide flexibility in representation of types (see Note [Efficient serialization of redundant type info]).

Constructors

NodeInfo (Set NodeAnnotation) [a] (NodeIdentifiers a)

Instances

Instances details

Foldable NodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => NodeInfo m -> m # foldMap :: Monoid m => (a -> m) -> NodeInfo a -> m # foldMap' :: Monoid m => (a -> m) -> NodeInfo a -> m # foldr :: (a -> b -> b) -> b -> NodeInfo a -> b # foldr' :: (a -> b -> b) -> b -> NodeInfo a -> b # foldl :: (b -> a -> b) -> b -> NodeInfo a -> b # foldl' :: (b -> a -> b) -> b -> NodeInfo a -> b # foldr1 :: (a -> a -> a) -> NodeInfo a -> a # foldl1 :: (a -> a -> a) -> NodeInfo a -> a # toList :: NodeInfo a -> [a] # null :: NodeInfo a -> Bool # length :: NodeInfo a -> Int # elem :: Eq a => a -> NodeInfo a -> Bool # maximum :: Ord a => NodeInfo a -> a # minimum :: Ord a => NodeInfo a -> a # sum :: Num a => NodeInfo a -> a # product :: Num a => NodeInfo a -> a #
Traversable NodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> NodeInfo a -> f (NodeInfo b) # sequenceA :: Applicative f => NodeInfo (f a) -> f (NodeInfo a) # mapM :: Monad m => (a -> m b) -> NodeInfo a -> m (NodeInfo b) # sequence :: Monad m => NodeInfo (m a) -> m (NodeInfo a) #
Functor NodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> NodeInfo a -> NodeInfo b # (<$) :: a -> NodeInfo b -> NodeInfo a #
Binary (NodeInfo TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> NodeInfo TypeIndex -> IO () # put :: BinHandle -> NodeInfo TypeIndex -> IO (Bin (NodeInfo TypeIndex)) # get :: BinHandle -> IO (NodeInfo TypeIndex) #
Outputable a => Outputable (NodeInfo a)
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: NodeInfo a -> SDoc #

data NodeAnnotation #

A node annotation

Constructors

NodeAnnotation
Fields nodeAnnotConstr :: !FastString name of the AST node constructor nodeAnnotType :: !FastString name of the AST node Type

Instances

Instances details

Binary NodeAnnotation
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> NodeAnnotation -> IO () # put :: BinHandle -> NodeAnnotation -> IO (Bin NodeAnnotation) # get :: BinHandle -> IO NodeAnnotation #
Outputable NodeAnnotation
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: NodeAnnotation -> SDoc #
Eq NodeAnnotation
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: NodeAnnotation -> NodeAnnotation -> Bool # (/=) :: NodeAnnotation -> NodeAnnotation -> Bool #
Ord NodeAnnotation
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: NodeAnnotation -> NodeAnnotation -> Ordering # (<) :: NodeAnnotation -> NodeAnnotation -> Bool # (<=) :: NodeAnnotation -> NodeAnnotation -> Bool # (>) :: NodeAnnotation -> NodeAnnotation -> Bool # (>=) :: NodeAnnotation -> NodeAnnotation -> Bool # max :: NodeAnnotation -> NodeAnnotation -> NodeAnnotation # min :: NodeAnnotation -> NodeAnnotation -> NodeAnnotation #

data NodeOrigin #

Source of node info

Constructors

SourceInfo
GeneratedInfo

Instances

Instances details

Enum NodeOrigin
Instance details Defined in GHC.Iface.Ext.Types Methods succ :: NodeOrigin -> NodeOrigin # pred :: NodeOrigin -> NodeOrigin # toEnum :: Int -> NodeOrigin # fromEnum :: NodeOrigin -> Int # enumFrom :: NodeOrigin -> [NodeOrigin] # enumFromThen :: NodeOrigin -> NodeOrigin -> [NodeOrigin] # enumFromTo :: NodeOrigin -> NodeOrigin -> [NodeOrigin] # enumFromThenTo :: NodeOrigin -> NodeOrigin -> NodeOrigin -> [NodeOrigin] #
Binary NodeOrigin
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> NodeOrigin -> IO () # put :: BinHandle -> NodeOrigin -> IO (Bin NodeOrigin) # get :: BinHandle -> IO NodeOrigin #
Outputable NodeOrigin
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: NodeOrigin -> SDoc #
Eq NodeOrigin
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: NodeOrigin -> NodeOrigin -> Bool # (/=) :: NodeOrigin -> NodeOrigin -> Bool #
Ord NodeOrigin
Instance details Defined in GHC.Iface.Ext.Types Methods compare :: NodeOrigin -> NodeOrigin -> Ordering # (<) :: NodeOrigin -> NodeOrigin -> Bool # (<=) :: NodeOrigin -> NodeOrigin -> Bool # (>) :: NodeOrigin -> NodeOrigin -> Bool # (>=) :: NodeOrigin -> NodeOrigin -> Bool # max :: NodeOrigin -> NodeOrigin -> NodeOrigin # min :: NodeOrigin -> NodeOrigin -> NodeOrigin #

newtype SourcedNodeInfo a #

NodeInfos grouped by source

Constructors

SourcedNodeInfo
Fields getSourcedNodeInfo :: Map NodeOrigin (NodeInfo a)

Instances

Instances details

Foldable SourcedNodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => SourcedNodeInfo m -> m # foldMap :: Monoid m => (a -> m) -> SourcedNodeInfo a -> m # foldMap' :: Monoid m => (a -> m) -> SourcedNodeInfo a -> m # foldr :: (a -> b -> b) -> b -> SourcedNodeInfo a -> b # foldr' :: (a -> b -> b) -> b -> SourcedNodeInfo a -> b # foldl :: (b -> a -> b) -> b -> SourcedNodeInfo a -> b # foldl' :: (b -> a -> b) -> b -> SourcedNodeInfo a -> b # foldr1 :: (a -> a -> a) -> SourcedNodeInfo a -> a # foldl1 :: (a -> a -> a) -> SourcedNodeInfo a -> a # toList :: SourcedNodeInfo a -> [a] # null :: SourcedNodeInfo a -> Bool # length :: SourcedNodeInfo a -> Int # elem :: Eq a => a -> SourcedNodeInfo a -> Bool # maximum :: Ord a => SourcedNodeInfo a -> a # minimum :: Ord a => SourcedNodeInfo a -> a # sum :: Num a => SourcedNodeInfo a -> a # product :: Num a => SourcedNodeInfo a -> a #
Traversable SourcedNodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> SourcedNodeInfo a -> f (SourcedNodeInfo b) # sequenceA :: Applicative f => SourcedNodeInfo (f a) -> f (SourcedNodeInfo a) # mapM :: Monad m => (a -> m b) -> SourcedNodeInfo a -> m (SourcedNodeInfo b) # sequence :: Monad m => SourcedNodeInfo (m a) -> m (SourcedNodeInfo a) #
Functor SourcedNodeInfo
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> SourcedNodeInfo a -> SourcedNodeInfo b # (<$) :: a -> SourcedNodeInfo b -> SourcedNodeInfo a #
Binary (SourcedNodeInfo TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> SourcedNodeInfo TypeIndex -> IO () # put :: BinHandle -> SourcedNodeInfo TypeIndex -> IO (Bin (SourcedNodeInfo TypeIndex)) # get :: BinHandle -> IO (SourcedNodeInfo TypeIndex) #
Outputable a => Outputable (SourcedNodeInfo a)
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: SourcedNodeInfo a -> SDoc #

data HieAST a #

Constructors

Node
Fields sourcedNodeInfo :: SourcedNodeInfo a nodeSpan :: Span nodeChildren :: [HieAST a]

Instances

Instances details

Foldable HieAST
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => HieAST m -> m # foldMap :: Monoid m => (a -> m) -> HieAST a -> m # foldMap' :: Monoid m => (a -> m) -> HieAST a -> m # foldr :: (a -> b -> b) -> b -> HieAST a -> b # foldr' :: (a -> b -> b) -> b -> HieAST a -> b # foldl :: (b -> a -> b) -> b -> HieAST a -> b # foldl' :: (b -> a -> b) -> b -> HieAST a -> b # foldr1 :: (a -> a -> a) -> HieAST a -> a # foldl1 :: (a -> a -> a) -> HieAST a -> a # toList :: HieAST a -> [a] # null :: HieAST a -> Bool # length :: HieAST a -> Int # elem :: Eq a => a -> HieAST a -> Bool # maximum :: Ord a => HieAST a -> a # minimum :: Ord a => HieAST a -> a # sum :: Num a => HieAST a -> a # product :: Num a => HieAST a -> a #
Traversable HieAST
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> HieAST a -> f (HieAST b) # sequenceA :: Applicative f => HieAST (f a) -> f (HieAST a) # mapM :: Monad m => (a -> m b) -> HieAST a -> m (HieAST b) # sequence :: Monad m => HieAST (m a) -> m (HieAST a) #
Functor HieAST
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> HieAST a -> HieAST b # (<$) :: a -> HieAST b -> HieAST a #
Binary (HieAST TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieAST TypeIndex -> IO () # put :: BinHandle -> HieAST TypeIndex -> IO (Bin (HieAST TypeIndex)) # get :: BinHandle -> IO (HieAST TypeIndex) #
Outputable a => Outputable (HieAST a)
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: HieAST a -> SDoc #

newtype HieASTs a #

Mapping from filepaths to the corresponding AST

Constructors

HieASTs
Fields getAsts :: Map HiePath (HieAST a)

Instances

Instances details

Foldable HieASTs
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => HieASTs m -> m # foldMap :: Monoid m => (a -> m) -> HieASTs a -> m # foldMap' :: Monoid m => (a -> m) -> HieASTs a -> m # foldr :: (a -> b -> b) -> b -> HieASTs a -> b # foldr' :: (a -> b -> b) -> b -> HieASTs a -> b # foldl :: (b -> a -> b) -> b -> HieASTs a -> b # foldl' :: (b -> a -> b) -> b -> HieASTs a -> b # foldr1 :: (a -> a -> a) -> HieASTs a -> a # foldl1 :: (a -> a -> a) -> HieASTs a -> a # toList :: HieASTs a -> [a] # null :: HieASTs a -> Bool # length :: HieASTs a -> Int # elem :: Eq a => a -> HieASTs a -> Bool # maximum :: Ord a => HieASTs a -> a # minimum :: Ord a => HieASTs a -> a # sum :: Num a => HieASTs a -> a # product :: Num a => HieASTs a -> a #
Traversable HieASTs
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> HieASTs a -> f (HieASTs b) # sequenceA :: Applicative f => HieASTs (f a) -> f (HieASTs a) # mapM :: Monad m => (a -> m b) -> HieASTs a -> m (HieASTs b) # sequence :: Monad m => HieASTs (m a) -> m (HieASTs a) #
Functor HieASTs
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> HieASTs a -> HieASTs b # (<$) :: a -> HieASTs b -> HieASTs a #
Binary (HieASTs TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieASTs TypeIndex -> IO () # put :: BinHandle -> HieASTs TypeIndex -> IO (Bin (HieASTs TypeIndex)) # get :: BinHandle -> IO (HieASTs TypeIndex) #
Outputable a => Outputable (HieASTs a)
Instance details Defined in GHC.Iface.Ext.Types Methods ppr :: HieASTs a -> SDoc #

type HiePath = LexicalFastString #

newtype HieArgs a #

A list of type arguments along with their respective visibilities (ie. is this an argument that would return True for isVisibleForAllTyFlag?).

Constructors

HieArgs [(Bool, a)]

Instances

Instances details

Foldable HieArgs
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => HieArgs m -> m # foldMap :: Monoid m => (a -> m) -> HieArgs a -> m # foldMap' :: Monoid m => (a -> m) -> HieArgs a -> m # foldr :: (a -> b -> b) -> b -> HieArgs a -> b # foldr' :: (a -> b -> b) -> b -> HieArgs a -> b # foldl :: (b -> a -> b) -> b -> HieArgs a -> b # foldl' :: (b -> a -> b) -> b -> HieArgs a -> b # foldr1 :: (a -> a -> a) -> HieArgs a -> a # foldl1 :: (a -> a -> a) -> HieArgs a -> a # toList :: HieArgs a -> [a] # null :: HieArgs a -> Bool # length :: HieArgs a -> Int # elem :: Eq a => a -> HieArgs a -> Bool # maximum :: Ord a => HieArgs a -> a # minimum :: Ord a => HieArgs a -> a # sum :: Num a => HieArgs a -> a # product :: Num a => HieArgs a -> a #
Traversable HieArgs
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> HieArgs a -> f (HieArgs b) # sequenceA :: Applicative f => HieArgs (f a) -> f (HieArgs a) # mapM :: Monad m => (a -> m b) -> HieArgs a -> m (HieArgs b) # sequence :: Monad m => HieArgs (m a) -> m (HieArgs a) #
Functor HieArgs
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> HieArgs a -> HieArgs b # (<$) :: a -> HieArgs b -> HieArgs a #
Binary (HieArgs TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieArgs TypeIndex -> IO () # put :: BinHandle -> HieArgs TypeIndex -> IO (Bin (HieArgs TypeIndex)) # get :: BinHandle -> IO (HieArgs TypeIndex) #
Eq a => Eq (HieArgs a)
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: HieArgs a -> HieArgs a -> Bool # (/=) :: HieArgs a -> HieArgs a -> Bool #

newtype HieTypeFix #

Roughly isomorphic to the original core Type.

Constructors

Roll (HieType HieTypeFix)

Instances

Instances details

Eq HieTypeFix
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: HieTypeFix -> HieTypeFix -> Bool # (/=) :: HieTypeFix -> HieTypeFix -> Bool #

type HieTypeFlat = HieType TypeIndex #

data HieType a #

A flattened version of Type.

See Note [Efficient serialization of redundant type info]

Constructors

HTyVarTy Name
HAppTy a (HieArgs a)
HTyConApp IfaceTyCon (HieArgs a)
HForAllTy ((Name, a), ForAllTyFlag) a
HFunTy a a a
HQualTy a a	type with constraint: `t1 => t2` (see `IfaceDFunTy`)
HLitTy IfaceTyLit
HCastTy a
HCoercionTy

Instances

Instances details

Foldable HieType
Instance details Defined in GHC.Iface.Ext.Types Methods fold :: Monoid m => HieType m -> m # foldMap :: Monoid m => (a -> m) -> HieType a -> m # foldMap' :: Monoid m => (a -> m) -> HieType a -> m # foldr :: (a -> b -> b) -> b -> HieType a -> b # foldr' :: (a -> b -> b) -> b -> HieType a -> b # foldl :: (b -> a -> b) -> b -> HieType a -> b # foldl' :: (b -> a -> b) -> b -> HieType a -> b # foldr1 :: (a -> a -> a) -> HieType a -> a # foldl1 :: (a -> a -> a) -> HieType a -> a # toList :: HieType a -> [a] # null :: HieType a -> Bool # length :: HieType a -> Int # elem :: Eq a => a -> HieType a -> Bool # maximum :: Ord a => HieType a -> a # minimum :: Ord a => HieType a -> a # sum :: Num a => HieType a -> a # product :: Num a => HieType a -> a #
Traversable HieType
Instance details Defined in GHC.Iface.Ext.Types Methods traverse :: Applicative f => (a -> f b) -> HieType a -> f (HieType b) # sequenceA :: Applicative f => HieType (f a) -> f (HieType a) # mapM :: Monad m => (a -> m b) -> HieType a -> m (HieType b) # sequence :: Monad m => HieType (m a) -> m (HieType a) #
Functor HieType
Instance details Defined in GHC.Iface.Ext.Types Methods fmap :: (a -> b) -> HieType a -> HieType b # (<$) :: a -> HieType b -> HieType a #
Binary (HieType TypeIndex)
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieType TypeIndex -> IO () # put :: BinHandle -> HieType TypeIndex -> IO (Bin (HieType TypeIndex)) # get :: BinHandle -> IO (HieType TypeIndex) #
Eq a => Eq (HieType a)
Instance details Defined in GHC.Iface.Ext.Types Methods (==) :: HieType a -> HieType a -> Bool # (/=) :: HieType a -> HieType a -> Bool #

type TypeIndex = Int #

data HieFile #

GHC builds up a wealth of information about Haskell source as it compiles it. .hie files are a way of persisting some of this information to disk so that external tools that need to work with haskell source don't need to parse, typecheck, and rename all over again. These files contain:

a simplified AST
- nodes are annotated with source positions and types
- identifiers are annotated with scope information
the raw bytes of the initial Haskell source

Besides saving compilation cycles, .hie files also offer a more stable interface than the GHC API.

Constructors

HieFile

Fields

hie_hs_file :: FilePath
Initial Haskell source file path
hie_module :: Module
The module this HIE file is for
hie_types :: Array TypeIndex HieTypeFlat
Types referenced in the hie_asts.
See Note [Efficient serialization of redundant type info]
hie_asts :: HieASTs TypeIndex
Type-annotated abstract syntax trees
hie_exports :: [AvailInfo]
The names that this module exports
hie_hs_src :: ByteString
Raw bytes of the initial Haskell source

Instances

Instances details

Show HieFile Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> HieFile -> ShowS # show :: HieFile -> String # showList :: [HieFile] -> ShowS #
NFData HieFile Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HieFile -> () #
Binary HieFile
Instance details Defined in GHC.Iface.Ext.Types Methods put_ :: BinHandle -> HieFile -> IO () # put :: BinHandle -> HieFile -> IO (Bin HieFile) # get :: BinHandle -> IO HieFile #

type Span = RealSrcSpan #

pattern HiePath :: FastString -> HiePath #

hieVersion :: Integer #

Current version of .hie files

pprNodeIdents :: Outputable a => NodeIdentifiers a -> SDoc #

pprIdentifier :: Identifier -> SDoc #

pprBindSpan :: Maybe Span -> SDoc #

hieNameOcc :: HieName -> OccName #

toHieName :: Name -> HieName #

module Compat.HieUtils

Compat modules

data Levity #

Constructors

Lifted
Unlifted

Instances

Instances details

Outputable Levity
Instance details Defined in GHC.Types.Basic Methods ppr :: Levity -> SDoc #
Eq Levity
Instance details Defined in GHC.Types.Basic Methods (==) :: Levity -> Levity -> Bool # (/=) :: Levity -> Levity -> Bool #

data Token #

Constructors

ITas
ITcase
ITclass
ITdata
ITdefault
ITderiving
ITdo (Maybe FastString)
ITelse
IThiding
ITforeign
ITif
ITimport
ITin
ITinfix
ITinfixl
ITinfixr
ITinstance
ITlet
ITmodule
ITnewtype
ITof
ITqualified
ITthen
ITtype
ITwhere
ITforall IsUnicodeSyntax
ITexport
ITlabel
ITdynamic
ITsafe
ITinterruptible
ITunsafe
ITstdcallconv
ITccallconv
ITcapiconv
ITprimcallconv
ITjavascriptcallconv
ITmdo (Maybe FastString)
ITfamily
ITrole
ITgroup
ITby
ITusing
ITpattern
ITstatic
ITstock
ITanyclass
ITvia
ITunit
ITsignature
ITdependency
ITrequires
ITinline_prag SourceText InlineSpec RuleMatchInfo
ITopaque_prag SourceText
ITspec_prag SourceText
ITspec_inline_prag SourceText Bool
ITsource_prag SourceText
ITrules_prag SourceText
ITwarning_prag SourceText
ITdeprecated_prag SourceText
ITline_prag SourceText
ITcolumn_prag SourceText
ITscc_prag SourceText
ITunpack_prag SourceText
ITnounpack_prag SourceText
ITann_prag SourceText
ITcomplete_prag SourceText
ITclose_prag
IToptions_prag String
ITinclude_prag String
ITlanguage_prag
ITminimal_prag SourceText
IToverlappable_prag SourceText
IToverlapping_prag SourceText
IToverlaps_prag SourceText
ITincoherent_prag SourceText
ITctype SourceText
ITcomment_line_prag
ITdotdot
ITcolon
ITdcolon IsUnicodeSyntax
ITequal
ITlam
ITlcase
ITlcases
ITvbar
ITlarrow IsUnicodeSyntax
ITrarrow IsUnicodeSyntax
ITdarrow IsUnicodeSyntax
ITlolly
ITminus
ITprefixminus
ITbang
ITtilde
ITat
ITtypeApp
ITpercent
ITstar IsUnicodeSyntax
ITdot
ITproj Bool
ITbiglam
ITocurly
ITccurly
ITvocurly
ITvccurly
ITobrack
ITopabrack
ITcpabrack
ITcbrack
IToparen
ITcparen
IToubxparen
ITcubxparen
ITsemi
ITcomma
ITunderscore
ITbackquote
ITsimpleQuote
ITvarid FastString
ITconid FastString
ITvarsym FastString
ITconsym FastString
ITqvarid (FastString, FastString)
ITqconid (FastString, FastString)
ITqvarsym (FastString, FastString)
ITqconsym (FastString, FastString)
ITdupipvarid FastString
ITlabelvarid SourceText FastString
ITchar SourceText Char
ITstring SourceText FastString
ITinteger IntegralLit
ITrational FractionalLit
ITprimchar SourceText Char
ITprimstring SourceText ByteString
ITprimint SourceText Integer
ITprimword SourceText Integer
ITprimfloat FractionalLit
ITprimdouble FractionalLit
ITopenExpQuote HasE IsUnicodeSyntax
ITopenPatQuote
ITopenDecQuote
ITopenTypQuote
ITcloseQuote IsUnicodeSyntax
ITopenTExpQuote HasE
ITcloseTExpQuote
ITdollar
ITdollardollar
ITtyQuote
ITquasiQuote (FastString, FastString, PsSpan)
ITqQuasiQuote (FastString, FastString, FastString, PsSpan)
ITproc
ITrec
IToparenbar IsUnicodeSyntax	(\|
ITcparenbar IsUnicodeSyntax	\|)
ITlarrowtail IsUnicodeSyntax	-<
ITrarrowtail IsUnicodeSyntax	>-
ITLarrowtail IsUnicodeSyntax	-<<
ITRarrowtail IsUnicodeSyntax	>>-
ITunknown String	Used when the lexer can't make sense of it
ITeof	end of file token
ITdocComment HsDocString PsSpan	The HsDocString contains more details about what this is and how to pretty print it
ITdocOptions String PsSpan	doc options (prune, ignore-exports, etc)
ITlineComment String PsSpan	comment starting by "--"
ITblockComment String PsSpan	comment in {- -}

Instances

Instances details

Show Token
Instance details Defined in GHC.Parser.Lexer Methods showsPrec :: Int -> Token -> ShowS # show :: Token -> String # showList :: [Token] -> ShowS #
Outputable Token
Instance details Defined in GHC.Parser.Lexer Methods ppr :: Token -> SDoc #

class Functor f => Applicative (f :: Type -> Type) where #

A functor with application, providing operations to

embed pure expressions (pure), and
sequence computations and combine their results (<*> and liftA2).

A minimal complete definition must include implementations of pure and of either <*> or liftA2. If it defines both, then they must behave the same as their default definitions:

(<*>) = liftA2 id

liftA2 f x y = f <$> x <*> y

Further, any definition must satisfy the following:

Identity

pure id <*> v = v

Composition

pure (.) <*> u <*> v <*> w = u <*> (v <*> w)

Homomorphism

pure f <*> pure x = pure (f x)

Interchange

u <*> pure y = pure ($ y) <*> u

The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:

```
u *> v = (id <$ u) <*> v
```
```
u <* v = liftA2 const u v
```

As a consequence of these laws, the Functor instance for f will satisfy

```
fmap f x = pure f <*> x
```

It may be useful to note that supposing

forall x y. p (q x y) = f x . g y

it follows from the above that

liftA2 p (liftA2 q u v) = liftA2 f u . liftA2 g v

If f is also a Monad, it should satisfy

```
pure = return
```

m1 <*> m2 = m1 >>= (\x1 -> m2 >>= (\x2 -> return (x1 x2)))

```
(*>) = (>>)
```

(which implies that pure and <*> satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a #

Lift a value.

(<*>) :: f (a -> b) -> f a -> f b infixl 4 #

Sequential application.

A few functors support an implementation of <*> that is more efficient than the default one.

Example

Expand

Used in combination with (<$>), (<*>) can be used to build a record.

>>> data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}

>>> produceFoo :: Applicative f => f Foo

>>> produceBar :: Applicative f => f Bar
>>> produceBaz :: Applicative f => f Baz

>>> mkState :: Applicative f => f MyState
>>> mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz

liftA2 :: (a -> b -> c) -> f a -> f b -> f c #

Lift a binary function to actions.

Some functors support an implementation of liftA2 that is more efficient than the default one. In particular, if fmap is an expensive operation, it is likely better to use liftA2 than to fmap over the structure and then use <*>.

This became a typeclass method in 4.10.0.0. Prior to that, it was a function defined in terms of <*> and fmap.

Example

Expand

>>> liftA2 (,) (Just 3) (Just 5)
Just (3,5)

(*>) :: f a -> f b -> f b infixl 4 #

Sequence actions, discarding the value of the first argument.

Examples

Expand

If used in conjunction with the Applicative instance for Maybe, you can chain Maybe computations, with a possible "early return" in case of Nothing.

>>> Just 2 *> Just 3
Just 3

>>> Nothing *> Just 3
Nothing

Of course a more interesting use case would be to have effectful computations instead of just returning pure values.

>>> import Data.Char
>>> import Text.ParserCombinators.ReadP
>>> let p = string "my name is " *> munch1 isAlpha <* eof
>>> readP_to_S p "my name is Simon"
[("Simon","")]

(<*) :: f a -> f b -> f a infixl 4 #

Sequence actions, discarding the value of the second argument.

Instances

Instances details

Applicative IResult
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> IResult a # (<>) :: IResult (a -> b) -> IResult a -> IResult b # liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c # (>) :: IResult a -> IResult b -> IResult b # (<*) :: IResult a -> IResult b -> IResult a #
Applicative Parser
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Parser a # (<>) :: Parser (a -> b) -> Parser a -> Parser b # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c # (>) :: Parser a -> Parser b -> Parser b # (<*) :: Parser a -> Parser b -> Parser a #
Applicative Result
Instance details Defined in Data.Aeson.Types.Internal Methods pure :: a -> Result a # (<>) :: Result (a -> b) -> Result a -> Result b # liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c # (>) :: Result a -> Result b -> Result b # (<*) :: Result a -> Result b -> Result a #
Applicative Graph	`<*>` is a good consumer of its first argument and a good producer.
Instance details Defined in Algebra.Graph Methods pure :: a -> Graph a # (<>) :: Graph (a -> b) -> Graph a -> Graph b # liftA2 :: (a -> b -> c) -> Graph a -> Graph b -> Graph c # (>) :: Graph a -> Graph b -> Graph b # (<*) :: Graph a -> Graph b -> Graph a #
Applicative List
Instance details Defined in Algebra.Graph.Internal Methods pure :: a -> List a # (<>) :: List (a -> b) -> List a -> List b # liftA2 :: (a -> b -> c) -> List a -> List b -> List c # (>) :: List a -> List b -> List b # (<*) :: List a -> List b -> List a #
Applicative Concurrently
Instance details Defined in Control.Concurrent.Async.Internal Methods pure :: a -> Concurrently a # (<>) :: Concurrently (a -> b) -> Concurrently a -> Concurrently b # liftA2 :: (a -> b -> c) -> Concurrently a -> Concurrently b -> Concurrently c # (>) :: Concurrently a -> Concurrently b -> Concurrently b # (<*) :: Concurrently a -> Concurrently b -> Concurrently a #
Applicative ZipList	f <$> ZipList xs1 <> ... <> ZipList xsN = ZipList (zipWithN f xs1 ... xsN) where `zipWithN` refers to the `zipWith` function of the appropriate arity (`zipWith`, `zipWith3`, `zipWith4`, ...). For example: (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <> ZipList "567" <> ZipList [1..] = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..]) = ZipList {getZipList = ["a5","b6b6","c7c7c7"]} Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> ZipList a # (<>) :: ZipList (a -> b) -> ZipList a -> ZipList b # liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c # (>) :: ZipList a -> ZipList b -> ZipList b # (<*) :: ZipList a -> ZipList b -> ZipList a #
Applicative Complex	Since: base-4.9.0.0
Instance details Defined in Data.Complex Methods pure :: a -> Complex a # (<>) :: Complex (a -> b) -> Complex a -> Complex b # liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c # (>) :: Complex a -> Complex b -> Complex b # (<*) :: Complex a -> Complex b -> Complex a #
Applicative Identity	Since: base-4.8.0.0
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a # (<>) :: Identity (a -> b) -> Identity a -> Identity b # liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c # (>) :: Identity a -> Identity b -> Identity b # (<*) :: Identity a -> Identity b -> Identity a #
Applicative First	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Last	Since: base-4.8.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Down	Since: base-4.11.0.0
Instance details Defined in Data.Ord Methods pure :: a -> Down a # (<>) :: Down (a -> b) -> Down a -> Down b # liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c # (>) :: Down a -> Down b -> Down b # (<*) :: Down a -> Down b -> Down a #
Applicative First	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> First a # (<>) :: First (a -> b) -> First a -> First b # liftA2 :: (a -> b -> c) -> First a -> First b -> First c # (>) :: First a -> First b -> First b # (<*) :: First a -> First b -> First a #
Applicative Last	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Last a # (<>) :: Last (a -> b) -> Last a -> Last b # liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c # (>) :: Last a -> Last b -> Last b # (<*) :: Last a -> Last b -> Last a #
Applicative Max	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Max a # (<>) :: Max (a -> b) -> Max a -> Max b # liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c # (>) :: Max a -> Max b -> Max b # (<*) :: Max a -> Max b -> Max a #
Applicative Min	Since: base-4.9.0.0
Instance details Defined in Data.Semigroup Methods pure :: a -> Min a # (<>) :: Min (a -> b) -> Min a -> Min b # liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c # (>) :: Min a -> Min b -> Min b # (<*) :: Min a -> Min b -> Min a #
Applicative Dual	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Dual a # (<>) :: Dual (a -> b) -> Dual a -> Dual b # liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c # (>) :: Dual a -> Dual b -> Dual b # (<*) :: Dual a -> Dual b -> Dual a #
Applicative Product	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Product a # (<>) :: Product (a -> b) -> Product a -> Product b # liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c # (>) :: Product a -> Product b -> Product b # (<*) :: Product a -> Product b -> Product a #
Applicative Sum	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Sum a # (<>) :: Sum (a -> b) -> Sum a -> Sum b # liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c # (>) :: Sum a -> Sum b -> Sum b # (<*) :: Sum a -> Sum b -> Sum a #
Applicative NonEmpty	Since: base-4.9.0.0
Instance details Defined in GHC.Base Methods pure :: a -> NonEmpty a # (<>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b # liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c # (>) :: NonEmpty a -> NonEmpty b -> NonEmpty b # (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a #
Applicative STM	Since: base-4.8.0.0
Instance details Defined in GHC.Conc.Sync Methods pure :: a -> STM a # (<>) :: STM (a -> b) -> STM a -> STM b # liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c # (>) :: STM a -> STM b -> STM b # (<*) :: STM a -> STM b -> STM a #
Applicative Par1	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Par1 a # (<>) :: Par1 (a -> b) -> Par1 a -> Par1 b # liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c # (>) :: Par1 a -> Par1 b -> Par1 b # (<*) :: Par1 a -> Par1 b -> Par1 a #
Applicative P	Since: base-4.5.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> P a # (<>) :: P (a -> b) -> P a -> P b # liftA2 :: (a -> b -> c) -> P a -> P b -> P c # (>) :: P a -> P b -> P b # (<*) :: P a -> P b -> P a #
Applicative ReadP	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a # (<>) :: ReadP (a -> b) -> ReadP a -> ReadP b # liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c # (>) :: ReadP a -> ReadP b -> ReadP b # (<*) :: ReadP a -> ReadP b -> ReadP a #
Applicative ReadPrec	Since: base-4.6.0.0
Instance details Defined in Text.ParserCombinators.ReadPrec Methods pure :: a -> ReadPrec a # (<>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b # liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c # (>) :: ReadPrec a -> ReadPrec b -> ReadPrec b # (<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a #
Applicative Get
Instance details Defined in Data.Binary.Get.Internal Methods pure :: a -> Get a # (<>) :: Get (a -> b) -> Get a -> Get b # liftA2 :: (a -> b -> c) -> Get a -> Get b -> Get c # (>) :: Get a -> Get b -> Get b # (<*) :: Get a -> Get b -> Get a #
Applicative PutM
Instance details Defined in Data.Binary.Put Methods pure :: a -> PutM a # (<>) :: PutM (a -> b) -> PutM a -> PutM b # liftA2 :: (a -> b -> c) -> PutM a -> PutM b -> PutM c # (>) :: PutM a -> PutM b -> PutM b # (<*) :: PutM a -> PutM b -> PutM a #
Applicative Put
Instance details Defined in Data.ByteString.Builder.Internal Methods pure :: a -> Put a # (<>) :: Put (a -> b) -> Put a -> Put b # liftA2 :: (a -> b -> c) -> Put a -> Put b -> Put c # (>) :: Put a -> Put b -> Put b # (<*) :: Put a -> Put b -> Put a #
Applicative Seq	Since: containers-0.5.4
Instance details Defined in Data.Sequence.Internal Methods pure :: a -> Seq a # (<>) :: Seq (a -> b) -> Seq a -> Seq b # liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c # (>) :: Seq a -> Seq b -> Seq b # (<*) :: Seq a -> Seq b -> Seq a #
Applicative Tree
Instance details Defined in Data.Tree Methods pure :: a -> Tree a # (<>) :: Tree (a -> b) -> Tree a -> Tree b # liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c # (>) :: Tree a -> Tree b -> Tree b # (<*) :: Tree a -> Tree b -> Tree a #
Applicative DNonEmpty
Instance details Defined in Data.DList.DNonEmpty.Internal Methods pure :: a -> DNonEmpty a # (<>) :: DNonEmpty (a -> b) -> DNonEmpty a -> DNonEmpty b # liftA2 :: (a -> b -> c) -> DNonEmpty a -> DNonEmpty b -> DNonEmpty c # (>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b # (<*) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty a #
Applicative DList
Instance details Defined in Data.DList.Internal Methods pure :: a -> DList a # (<>) :: DList (a -> b) -> DList a -> DList b # liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c # (>) :: DList a -> DList b -> DList b # (<*) :: DList a -> DList b -> DList a #
Applicative Assembler
Instance details Defined in GHC.ByteCode.Asm Methods pure :: a -> Assembler a # (<>) :: Assembler (a -> b) -> Assembler a -> Assembler b # liftA2 :: (a -> b -> c) -> Assembler a -> Assembler b -> Assembler c # (>) :: Assembler a -> Assembler b -> Assembler b # (<*) :: Assembler a -> Assembler b -> Assembler a #
Applicative NormM
Instance details Defined in GHC.Core.FamInstEnv Methods pure :: a -> NormM a # (<>) :: NormM (a -> b) -> NormM a -> NormM b # liftA2 :: (a -> b -> c) -> NormM a -> NormM b -> NormM c # (>) :: NormM a -> NormM b -> NormM b # (<*) :: NormM a -> NormM b -> NormM a #
Applicative UM
Instance details Defined in GHC.Core.Unify Methods pure :: a -> UM a # (<>) :: UM (a -> b) -> UM a -> UM b # liftA2 :: (a -> b -> c) -> UM a -> UM b -> UM c # (>) :: UM a -> UM b -> UM b # (<*) :: UM a -> UM b -> UM a #
Applicative UnifyResultM
Instance details Defined in GHC.Core.Unify Methods pure :: a -> UnifyResultM a # (<>) :: UnifyResultM (a -> b) -> UnifyResultM a -> UnifyResultM b # liftA2 :: (a -> b -> c) -> UnifyResultM a -> UnifyResultM b -> UnifyResultM c # (>) :: UnifyResultM a -> UnifyResultM b -> UnifyResultM b # (<*) :: UnifyResultM a -> UnifyResultM b -> UnifyResultM a #
Applicative CtsM
Instance details Defined in GHC.CoreToStg Methods pure :: a -> CtsM a # (<>) :: CtsM (a -> b) -> CtsM a -> CtsM b # liftA2 :: (a -> b -> c) -> CtsM a -> CtsM b -> CtsM c # (>) :: CtsM a -> CtsM b -> CtsM b # (<*) :: CtsM a -> CtsM b -> CtsM a #
Applicative Infinite
Instance details Defined in GHC.Data.List.Infinite Methods pure :: a -> Infinite a # (<>) :: Infinite (a -> b) -> Infinite a -> Infinite b # liftA2 :: (a -> b -> c) -> Infinite a -> Infinite b -> Infinite c # (>) :: Infinite a -> Infinite b -> Infinite b # (<*) :: Infinite a -> Infinite b -> Infinite a #
Applicative Pair
Instance details Defined in GHC.Data.Pair Methods pure :: a -> Pair a # (<>) :: Pair (a -> b) -> Pair a -> Pair b # liftA2 :: (a -> b -> c) -> Pair a -> Pair b -> Pair c # (>) :: Pair a -> Pair b -> Pair b # (<*) :: Pair a -> Pair b -> Pair a #
Applicative Maybe
Instance details Defined in GHC.Data.Strict Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Applicative Hsc
Instance details Defined in GHC.Driver.Env.Types Methods pure :: a -> Hsc a # (<>) :: Hsc (a -> b) -> Hsc a -> Hsc b # liftA2 :: (a -> b -> c) -> Hsc a -> Hsc b -> Hsc c # (>) :: Hsc a -> Hsc b -> Hsc b # (<*) :: Hsc a -> Hsc b -> Hsc a #
Applicative Ghc
Instance details Defined in GHC.Driver.Monad Methods pure :: a -> Ghc a # (<>) :: Ghc (a -> b) -> Ghc a -> Ghc b # liftA2 :: (a -> b -> c) -> Ghc a -> Ghc b -> Ghc c # (>) :: Ghc a -> Ghc b -> Ghc b # (<*) :: Ghc a -> Ghc b -> Ghc a #
Applicative MatchResult	Product is an "or" on fallibility---the combined match result is infallible only if the left and right argument match results both were. This is useful for combining a bunch of alternatives together and then getting the overall fallibility of the entire group. See `mkDataConCase` for an example.
Instance details Defined in GHC.HsToCore.Monad Methods pure :: a -> MatchResult a # (<>) :: MatchResult (a -> b) -> MatchResult a -> MatchResult b # liftA2 :: (a -> b -> c) -> MatchResult a -> MatchResult b -> MatchResult c # (>) :: MatchResult a -> MatchResult b -> MatchResult b # (<*) :: MatchResult a -> MatchResult b -> MatchResult a #
Applicative DFFV
Instance details Defined in GHC.Iface.Tidy Methods pure :: a -> DFFV a # (<>) :: DFFV (a -> b) -> DFFV a -> DFFV b # liftA2 :: (a -> b -> c) -> DFFV a -> DFFV b -> DFFV c # (>) :: DFFV a -> DFFV b -> DFFV b # (<*) :: DFFV a -> DFFV b -> DFFV a #
Applicative P
Instance details Defined in GHC.Parser.Lexer Methods pure :: a -> P a # (<>) :: P (a -> b) -> P a -> P b # liftA2 :: (a -> b -> c) -> P a -> P b -> P c # (>) :: P a -> P b -> P b # (<*) :: P a -> P b -> P a #
Applicative PV
Instance details Defined in GHC.Parser.PostProcess Methods pure :: a -> PV a # (<>) :: PV (a -> b) -> PV a -> PV b # liftA2 :: (a -> b -> c) -> PV a -> PV b -> PV c # (>) :: PV a -> PV b -> PV b # (<*) :: PV a -> PV b -> PV a #
Applicative StgM
Instance details Defined in GHC.Stg.Pipeline Methods pure :: a -> StgM a # (<>) :: StgM (a -> b) -> StgM a -> StgM b # liftA2 :: (a -> b -> c) -> StgM a -> StgM b -> StgM c # (>) :: StgM a -> StgM b -> StgM b # (<*) :: StgM a -> StgM b -> StgM a #
Applicative BcM
Instance details Defined in GHC.StgToByteCode Methods pure :: a -> BcM a # (<>) :: BcM (a -> b) -> BcM a -> BcM b # liftA2 :: (a -> b -> c) -> BcM a -> BcM b -> BcM c # (>) :: BcM a -> BcM b -> BcM b # (<*) :: BcM a -> BcM b -> BcM a #
Applicative TcS
Instance details Defined in GHC.Tc.Solver.Monad Methods pure :: a -> TcS a # (<>) :: TcS (a -> b) -> TcS a -> TcS b # liftA2 :: (a -> b -> c) -> TcS a -> TcS b -> TcS c # (>) :: TcS a -> TcS b -> TcS b # (<*) :: TcS a -> TcS b -> TcS a #
Applicative TcPluginM
Instance details Defined in GHC.Tc.Types Methods pure :: a -> TcPluginM a # (<>) :: TcPluginM (a -> b) -> TcPluginM a -> TcPluginM b # liftA2 :: (a -> b -> c) -> TcPluginM a -> TcPluginM b -> TcPluginM c # (>) :: TcPluginM a -> TcPluginM b -> TcPluginM b # (<*) :: TcPluginM a -> TcPluginM b -> TcPluginM a #
Applicative UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods pure :: a -> UniqSM a # (<>) :: UniqSM (a -> b) -> UniqSM a -> UniqSM b # liftA2 :: (a -> b -> c) -> UniqSM a -> UniqSM b -> UniqSM c # (>) :: UniqSM a -> UniqSM b -> UniqSM b # (<*) :: UniqSM a -> UniqSM b -> UniqSM a #
Applicative IO	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> IO a # (<>) :: IO (a -> b) -> IO a -> IO b # liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c # (>) :: IO a -> IO b -> IO b # (<*) :: IO a -> IO b -> IO a #
Applicative PositionResult Source #
Instance details Defined in Development.IDE.Core.PositionMapping Methods pure :: a -> PositionResult a # (<>) :: PositionResult (a -> b) -> PositionResult a -> PositionResult b # liftA2 :: (a -> b -> c) -> PositionResult a -> PositionResult b -> PositionResult c # (>) :: PositionResult a -> PositionResult b -> PositionResult b # (<*) :: PositionResult a -> PositionResult b -> PositionResult a #
Applicative IdeAction Source #
Instance details Defined in Development.IDE.Core.Shake Methods pure :: a -> IdeAction a # (<>) :: IdeAction (a -> b) -> IdeAction a -> IdeAction b # liftA2 :: (a -> b -> c) -> IdeAction a -> IdeAction b -> IdeAction c # (>) :: IdeAction a -> IdeAction b -> IdeAction b # (<*) :: IdeAction a -> IdeAction b -> IdeAction a #
Applicative CradleLoadResult
Instance details Defined in HIE.Bios.Types Methods pure :: a -> CradleLoadResult a # (<>) :: CradleLoadResult (a -> b) -> CradleLoadResult a -> CradleLoadResult b # liftA2 :: (a -> b -> c) -> CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult c # (>) :: CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult b # (<*) :: CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult a #
Applicative Action
Instance details Defined in Development.IDE.Graph.Internal.Types Methods pure :: a -> Action a # (<>) :: Action (a -> b) -> Action a -> Action b # liftA2 :: (a -> b -> c) -> Action a -> Action b -> Action c # (>) :: Action a -> Action b -> Action b # (<*) :: Action a -> Action b -> Action a #
Applicative Rules
Instance details Defined in Development.IDE.Graph.Internal.Types Methods pure :: a -> Rules a # (<>) :: Rules (a -> b) -> Rules a -> Rules b # liftA2 :: (a -> b -> c) -> Rules a -> Rules b -> Rules c # (>) :: Rules a -> Rules b -> Rules b # (<*) :: Rules a -> Rules b -> Rules a #
Applicative Parser
Instance details Defined in Options.Applicative.Types Methods pure :: a -> Parser a # (<>) :: Parser (a -> b) -> Parser a -> Parser b # liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c # (>) :: Parser a -> Parser b -> Parser b # (<*) :: Parser a -> Parser b -> Parser a #
Applicative ParserM
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ParserM a # (<>) :: ParserM (a -> b) -> ParserM a -> ParserM b # liftA2 :: (a -> b -> c) -> ParserM a -> ParserM b -> ParserM c # (>) :: ParserM a -> ParserM b -> ParserM b # (<*) :: ParserM a -> ParserM b -> ParserM a #
Applicative ParserResult
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ParserResult a # (<>) :: ParserResult (a -> b) -> ParserResult a -> ParserResult b # liftA2 :: (a -> b -> c) -> ParserResult a -> ParserResult b -> ParserResult c # (>) :: ParserResult a -> ParserResult b -> ParserResult b # (<*) :: ParserResult a -> ParserResult b -> ParserResult a #
Applicative ReadM
Instance details Defined in Options.Applicative.Types Methods pure :: a -> ReadM a # (<>) :: ReadM (a -> b) -> ReadM a -> ReadM b # liftA2 :: (a -> b -> c) -> ReadM a -> ReadM b -> ReadM c # (>) :: ReadM a -> ReadM b -> ReadM b # (<*) :: ReadM a -> ReadM b -> ReadM a #
Applicative Eval
Instance details Defined in Control.Parallel.Strategies Methods pure :: a -> Eval a # (<>) :: Eval (a -> b) -> Eval a -> Eval b # liftA2 :: (a -> b -> c) -> Eval a -> Eval b -> Eval c # (>) :: Eval a -> Eval b -> Eval b # (<*) :: Eval a -> Eval b -> Eval a #
Applicative Array
Instance details Defined in Data.Primitive.Array Methods pure :: a -> Array a # (<>) :: Array (a -> b) -> Array a -> Array b # liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c # (>) :: Array a -> Array b -> Array b # (<*) :: Array a -> Array b -> Array a #
Applicative SmallArray
Instance details Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a #
Applicative RowParser
Instance details Defined in Database.SQLite.Simple.Internal Methods pure :: a -> RowParser a # (<>) :: RowParser (a -> b) -> RowParser a -> RowParser b # liftA2 :: (a -> b -> c) -> RowParser a -> RowParser b -> RowParser c # (>) :: RowParser a -> RowParser b -> RowParser b # (<*) :: RowParser a -> RowParser b -> RowParser a #
Applicative Q
Instance details Defined in Language.Haskell.TH.Syntax Methods pure :: a -> Q a # (<>) :: Q (a -> b) -> Q a -> Q b # liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c # (>) :: Q a -> Q b -> Q b # (<*) :: Q a -> Q b -> Q a #
Applicative Flat
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Flat a # (<>) :: Flat (a -> b) -> Flat a -> Flat b # liftA2 :: (a -> b -> c) -> Flat a -> Flat b -> Flat c # (>) :: Flat a -> Flat b -> Flat b # (<*) :: Flat a -> Flat b -> Flat a #
Applicative FlatApp
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> FlatApp a # (<>) :: FlatApp (a -> b) -> FlatApp a -> FlatApp b # liftA2 :: (a -> b -> c) -> FlatApp a -> FlatApp b -> FlatApp c # (>) :: FlatApp a -> FlatApp b -> FlatApp b # (<*) :: FlatApp a -> FlatApp b -> FlatApp a #
Applicative Vector
Instance details Defined in Data.Vector Methods pure :: a -> Vector a # (<>) :: Vector (a -> b) -> Vector a -> Vector b # liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c # (>) :: Vector a -> Vector b -> Vector b # (<*) :: Vector a -> Vector b -> Vector a #
Applicative Maybe	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a # (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b # liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c # (>) :: Maybe a -> Maybe b -> Maybe b # (<*) :: Maybe a -> Maybe b -> Maybe a #
Applicative Solo	Since: base-4.15
Instance details Defined in GHC.Base Methods pure :: a -> Solo a # (<>) :: Solo (a -> b) -> Solo a -> Solo b # liftA2 :: (a -> b -> c) -> Solo a -> Solo b -> Solo c # (>) :: Solo a -> Solo b -> Solo b # (<*) :: Solo a -> Solo b -> Solo a #
Applicative List	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> [a] # (<>) :: [a -> b] -> [a] -> [b] # liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] # (>) :: [a] -> [b] -> [b] # (<*) :: [a] -> [b] -> [a] #
Representable f => Applicative (Co f)
Instance details Defined in Data.Functor.Rep Methods pure :: a -> Co f a # (<>) :: Co f (a -> b) -> Co f a -> Co f b # liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c # (>) :: Co f a -> Co f b -> Co f b # (<*) :: Co f a -> Co f b -> Co f a #
Applicative (ConcurrentlyE e)
Instance details Defined in Control.Concurrent.Async.Internal Methods pure :: a -> ConcurrentlyE e a # (<>) :: ConcurrentlyE e (a -> b) -> ConcurrentlyE e a -> ConcurrentlyE e b # liftA2 :: (a -> b -> c) -> ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e c # (>) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e b # (<*) :: ConcurrentlyE e a -> ConcurrentlyE e b -> ConcurrentlyE e a #
Applicative (Parser i)
Instance details Defined in Data.Attoparsec.Internal.Types Methods pure :: a -> Parser i a # (<>) :: Parser i (a -> b) -> Parser i a -> Parser i b # liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c # (>) :: Parser i a -> Parser i b -> Parser i b # (<*) :: Parser i a -> Parser i b -> Parser i a #
Monad m => Applicative (WrappedMonad m)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a #
Arrow a => Applicative (ArrowMonad a)	Since: base-4.6.0.0
Instance details Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 #
Applicative (Either e)	Since: base-3.0
Instance details Defined in Data.Either Methods pure :: a -> Either e a # (<>) :: Either e (a -> b) -> Either e a -> Either e b # liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c # (>) :: Either e a -> Either e b -> Either e b # (<*) :: Either e a -> Either e b -> Either e a #
Applicative (StateL s)	Since: base-4.0
Instance details Defined in Data.Functor.Utils Methods pure :: a -> StateL s a # (<>) :: StateL s (a -> b) -> StateL s a -> StateL s b # liftA2 :: (a -> b -> c) -> StateL s a -> StateL s b -> StateL s c # (>) :: StateL s a -> StateL s b -> StateL s b # (<*) :: StateL s a -> StateL s b -> StateL s a #
Applicative (StateR s)	Since: base-4.0
Instance details Defined in Data.Functor.Utils Methods pure :: a -> StateR s a # (<>) :: StateR s (a -> b) -> StateR s a -> StateR s b # liftA2 :: (a -> b -> c) -> StateR s a -> StateR s b -> StateR s c # (>) :: StateR s a -> StateR s b -> StateR s b # (<*) :: StateR s a -> StateR s b -> StateR s a #
Applicative (Proxy :: Type -> Type)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Applicative (U1 :: Type -> Type)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> U1 a # (<>) :: U1 (a -> b) -> U1 a -> U1 b # liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c # (>) :: U1 a -> U1 b -> U1 b # (<*) :: U1 a -> U1 b -> U1 a #
Monad m => Applicative (ZipSource m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipSource m a # (<>) :: ZipSource m (a -> b) -> ZipSource m a -> ZipSource m b # liftA2 :: (a -> b -> c) -> ZipSource m a -> ZipSource m b -> ZipSource m c # (>) :: ZipSource m a -> ZipSource m b -> ZipSource m b # (<*) :: ZipSource m a -> ZipSource m b -> ZipSource m a #
Applicative (SetM s)
Instance details Defined in Data.Graph Methods pure :: a -> SetM s a # (<>) :: SetM s (a -> b) -> SetM s a -> SetM s b # liftA2 :: (a -> b -> c) -> SetM s a -> SetM s b -> SetM s c # (>) :: SetM s a -> SetM s b -> SetM s b # (<*) :: SetM s a -> SetM s b -> SetM s a #
Alternative f => Applicative (Cofree f)
Instance details Defined in Control.Comonad.Cofree Methods pure :: a -> Cofree f a # (<>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b # liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c # (>) :: Cofree f a -> Cofree f b -> Cofree f b # (<*) :: Cofree f a -> Cofree f b -> Cofree f a #
Functor f => Applicative (Free f)
Instance details Defined in Control.Monad.Free Methods pure :: a -> Free f a # (<>) :: Free f (a -> b) -> Free f a -> Free f b # liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c # (>) :: Free f a -> Free f b -> Free f b # (<*) :: Free f a -> Free f b -> Free f a #
Applicative (IOEnv m)
Instance details Defined in GHC.Data.IOEnv Methods pure :: a -> IOEnv m a # (<>) :: IOEnv m (a -> b) -> IOEnv m a -> IOEnv m b # liftA2 :: (a -> b -> c) -> IOEnv m a -> IOEnv m b -> IOEnv m c # (>) :: IOEnv m a -> IOEnv m b -> IOEnv m b # (<*) :: IOEnv m a -> IOEnv m b -> IOEnv m a #
Applicative (MaybeErr err)
Instance details Defined in GHC.Data.Maybe Methods pure :: a -> MaybeErr err a # (<>) :: MaybeErr err (a -> b) -> MaybeErr err a -> MaybeErr err b # liftA2 :: (a -> b -> c) -> MaybeErr err a -> MaybeErr err b -> MaybeErr err c # (>) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err b # (<*) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err a #
Monad m => Applicative (EwM m)
Instance details Defined in GHC.Driver.CmdLine Methods pure :: a -> EwM m a # (<>) :: EwM m (a -> b) -> EwM m a -> EwM m b # liftA2 :: (a -> b -> c) -> EwM m a -> EwM m b -> EwM m c # (>) :: EwM m a -> EwM m b -> EwM m b # (<*) :: EwM m a -> EwM m b -> EwM m a #
Applicative m => Applicative (GhcT m)
Instance details Defined in GHC.Driver.Monad Methods pure :: a -> GhcT m a # (<>) :: GhcT m (a -> b) -> GhcT m a -> GhcT m b # liftA2 :: (a -> b -> c) -> GhcT m a -> GhcT m b -> GhcT m c # (>) :: GhcT m a -> GhcT m b -> GhcT m b # (<*) :: GhcT m a -> GhcT m b -> GhcT m a #
Applicative (CmdLineP s)
Instance details Defined in GHC.Driver.Session Methods pure :: a -> CmdLineP s a # (<>) :: CmdLineP s (a -> b) -> CmdLineP s a -> CmdLineP s b # liftA2 :: (a -> b -> c) -> CmdLineP s a -> CmdLineP s b -> CmdLineP s c # (>) :: CmdLineP s a -> CmdLineP s b -> CmdLineP s b # (<*) :: CmdLineP s a -> CmdLineP s b -> CmdLineP s a #
Applicative (Tracked age) Source #
Instance details Defined in Development.IDE.Core.UseStale Methods pure :: a -> Tracked age a # (<>) :: Tracked age (a -> b) -> Tracked age a -> Tracked age b # liftA2 :: (a -> b -> c) -> Tracked age a -> Tracked age b -> Tracked age c # (>) :: Tracked age a -> Tracked age b -> Tracked age b # (<*) :: Tracked age a -> Tracked age b -> Tracked age a #
Applicative (ServerM c) Source #
Instance details Defined in Development.IDE.LSP.Server Methods pure :: a -> ServerM c a # (<>) :: ServerM c (a -> b) -> ServerM c a -> ServerM c b # liftA2 :: (a -> b -> c0) -> ServerM c a -> ServerM c b -> ServerM c c0 # (>) :: ServerM c a -> ServerM c b -> ServerM c b # (<*) :: ServerM c a -> ServerM c b -> ServerM c a #
(Monad m, Applicative m) => Applicative (CradleLoadResultT m)
Instance details Defined in HIE.Bios.Types Methods pure :: a -> CradleLoadResultT m a # (<>) :: CradleLoadResultT m (a -> b) -> CradleLoadResultT m a -> CradleLoadResultT m b # liftA2 :: (a -> b -> c) -> CradleLoadResultT m a -> CradleLoadResultT m b -> CradleLoadResultT m c # (>) :: CradleLoadResultT m a -> CradleLoadResultT m b -> CradleLoadResultT m b # (<*) :: CradleLoadResultT m a -> CradleLoadResultT m b -> CradleLoadResultT m a #
Monad m => Applicative (DbMonadT m)
Instance details Defined in HieDb.Types Methods pure :: a -> DbMonadT m a # (<>) :: DbMonadT m (a -> b) -> DbMonadT m a -> DbMonadT m b # liftA2 :: (a -> b -> c) -> DbMonadT m a -> DbMonadT m b -> DbMonadT m c # (>) :: DbMonadT m a -> DbMonadT m b -> DbMonadT m b # (<*) :: DbMonadT m a -> DbMonadT m b -> DbMonadT m a #
Applicative f => Applicative (Yoneda f)
Instance details Defined in Data.Functor.Yoneda Methods pure :: a -> Yoneda f a # (<>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b # liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c # (>) :: Yoneda f a -> Yoneda f b -> Yoneda f b # (<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a #
Applicative f => Applicative (Indexing f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing f a # (<>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c # (>) :: Indexing f a -> Indexing f b -> Indexing f b # (<*) :: Indexing f a -> Indexing f b -> Indexing f a #
Applicative f => Applicative (Indexing64 f)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a #
Applicative (ReifiedFold s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #
Applicative (ReifiedGetter s)
Instance details Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #
(Monad m, Functor m) => Applicative (ListT m)
Instance details Defined in ListT Methods pure :: a -> ListT m a # (<>) :: ListT m (a -> b) -> ListT m a -> ListT m b # liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c # (>) :: ListT m a -> ListT m b -> ListT m b # (<*) :: ListT m a -> ListT m b -> ListT m a #
Applicative f => Applicative (WrappedPoly f)
Instance details Defined in Data.MonoTraversable Methods pure :: a -> WrappedPoly f a # (<>) :: WrappedPoly f (a -> b) -> WrappedPoly f a -> WrappedPoly f b # liftA2 :: (a -> b -> c) -> WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f c # (>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b # (<*) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f a #
Applicative m => Applicative (ResourceT m)
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods pure :: a -> ResourceT m a # (<>) :: ResourceT m (a -> b) -> ResourceT m a -> ResourceT m b # liftA2 :: (a -> b -> c) -> ResourceT m a -> ResourceT m b -> ResourceT m c # (>) :: ResourceT m a -> ResourceT m b -> ResourceT m b # (<*) :: ResourceT m a -> ResourceT m b -> ResourceT m a #
Semigroup a => Applicative (These a)
Instance details Defined in Data.Strict.These Methods pure :: a0 -> These a a0 # (<>) :: These a (a0 -> b) -> These a a0 -> These a b # liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c # (>) :: These a a0 -> These a b -> These a b # (<*) :: These a a0 -> These a b -> These a a0 #
Applicative m => Applicative (QuoteToQuasi m)
Instance details Defined in Language.Haskell.TH.Syntax.Compat Methods pure :: a -> QuoteToQuasi m a # (<>) :: QuoteToQuasi m (a -> b) -> QuoteToQuasi m a -> QuoteToQuasi m b # liftA2 :: (a -> b -> c) -> QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m c # (>) :: QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m b # (<*) :: QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m a #
Semigroup a => Applicative (These a)
Instance details Defined in Data.These Methods pure :: a0 -> These a a0 # (<>) :: These a (a0 -> b) -> These a a0 -> These a b # liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c # (>) :: These a a0 -> These a b -> These a b # (<*) :: These a a0 -> These a b -> These a a0 #
Applicative f => Applicative (Lift f)	A combination is `Pure` only if both parts are.
Instance details Defined in Control.Applicative.Lift Methods pure :: a -> Lift f a # (<>) :: Lift f (a -> b) -> Lift f a -> Lift f b # liftA2 :: (a -> b -> c) -> Lift f a -> Lift f b -> Lift f c # (>) :: Lift f a -> Lift f b -> Lift f b # (<*) :: Lift f a -> Lift f b -> Lift f a #
(Functor m, Monad m) => Applicative (MaybeT m)
Instance details Defined in Control.Monad.Trans.Maybe Methods pure :: a -> MaybeT m a # (<>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b # liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c # (>) :: MaybeT m a -> MaybeT m b -> MaybeT m b # (<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a #
MonadUnliftIO m => Applicative (Conc m)	Since: unliftio-0.2.9.0
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Conc m a # (<>) :: Conc m (a -> b) -> Conc m a -> Conc m b # liftA2 :: (a -> b -> c) -> Conc m a -> Conc m b -> Conc m c # (>) :: Conc m a -> Conc m b -> Conc m b # (<*) :: Conc m a -> Conc m b -> Conc m a #
MonadUnliftIO m => Applicative (Concurrently m)	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Internals.Async Methods pure :: a -> Concurrently m a # (<>) :: Concurrently m (a -> b) -> Concurrently m a -> Concurrently m b # liftA2 :: (a -> b -> c) -> Concurrently m a -> Concurrently m b -> Concurrently m c # (>) :: Concurrently m a -> Concurrently m b -> Concurrently m b # (<*) :: Concurrently m a -> Concurrently m b -> Concurrently m a #
Monoid a => Applicative ((,) a)	For tuples, the `Monoid` constraint on `a` determines how the first values merge. For example, `String`s concatenate: ("hello ", (+15)) <> ("world!", 2002) ("hello world!",2017) Since: base-2.1*
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, a0) # (<>) :: (a, a0 -> b) -> (a, a0) -> (a, b) # liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) # (>) :: (a, a0) -> (a, b) -> (a, b) # (<*) :: (a, a0) -> (a, b) -> (a, a0) #
Arrow a => Applicative (WrappedArrow a b)	Since: base-2.1
Instance details Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #
Applicative m => Applicative (Kleisli m a)	Since: base-4.14.0.0
Instance details Defined in Control.Arrow Methods pure :: a0 -> Kleisli m a a0 # (<>) :: Kleisli m a (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b # liftA2 :: (a0 -> b -> c) -> Kleisli m a a0 -> Kleisli m a b -> Kleisli m a c # (>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b # (<*) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a a0 #
Monoid m => Applicative (Const m :: Type -> Type)	Since: base-2.0.1
Instance details Defined in Data.Functor.Const Methods pure :: a -> Const m a # (<>) :: Const m (a -> b) -> Const m a -> Const m b # liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c # (>) :: Const m a -> Const m b -> Const m b # (<*) :: Const m a -> Const m b -> Const m a #
Monad m => Applicative (StateT s m)	Since: base-4.18.0.0
Instance details Defined in Data.Functor.Utils Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
Applicative f => Applicative (Ap f)	Since: base-4.12.0.0
Instance details Defined in Data.Monoid Methods pure :: a -> Ap f a # (<>) :: Ap f (a -> b) -> Ap f a -> Ap f b # liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c # (>) :: Ap f a -> Ap f b -> Ap f b # (<*) :: Ap f a -> Ap f b -> Ap f a #
Applicative f => Applicative (Alt f)	Since: base-4.8.0.0
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Alt f a # (<>) :: Alt f (a -> b) -> Alt f a -> Alt f b # liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c # (>) :: Alt f a -> Alt f b -> Alt f b # (<*) :: Alt f a -> Alt f b -> Alt f a #
(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f)	Since: base-4.17.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Generically1 f a # (<>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b # liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c # (>) :: Generically1 f a -> Generically1 f b -> Generically1 f b # (<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a #
Applicative f => Applicative (Rec1 f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> Rec1 f a # (<>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b # liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c # (>) :: Rec1 f a -> Rec1 f b -> Rec1 f b # (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a #
Biapplicative p => Applicative (Fix p)
Instance details Defined in Data.Bifunctor.Fix Methods pure :: a -> Fix p a # (<>) :: Fix p (a -> b) -> Fix p a -> Fix p b # liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c # (>) :: Fix p a -> Fix p b -> Fix p b # (<*) :: Fix p a -> Fix p b -> Fix p a #
Biapplicative p => Applicative (Join p)
Instance details Defined in Data.Bifunctor.Join Methods pure :: a -> Join p a # (<>) :: Join p (a -> b) -> Join p a -> Join p b # liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c # (>) :: Join p a -> Join p b -> Join p b # (<*) :: Join p a -> Join p b -> Join p a #
Monad m => Applicative (ZipSink i m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipSink i m a # (<>) :: ZipSink i m (a -> b) -> ZipSink i m a -> ZipSink i m b # liftA2 :: (a -> b -> c) -> ZipSink i m a -> ZipSink i m b -> ZipSink i m c # (>) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m b # (<*) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m a #
(Applicative f, Monad f) => Applicative (WhenMissing f x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))`. Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a #
Monad m => Applicative (Focus element m)
Instance details Defined in Focus Methods pure :: a -> Focus element m a # (<>) :: Focus element m (a -> b) -> Focus element m a -> Focus element m b # liftA2 :: (a -> b -> c) -> Focus element m a -> Focus element m b -> Focus element m c # (>) :: Focus element m a -> Focus element m b -> Focus element m b # (<*) :: Focus element m a -> Focus element m b -> Focus element m a #
(Alternative f, Applicative w) => Applicative (CofreeT f w)
Instance details Defined in Control.Comonad.Trans.Cofree Methods pure :: a -> CofreeT f w a # (<>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b # liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c # (>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b # (<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a #
(Functor f, Monad m) => Applicative (FreeT f m)
Instance details Defined in Control.Monad.Trans.Free Methods pure :: a -> FreeT f m a # (<>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b # liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c # (>) :: FreeT f m a -> FreeT f m b -> FreeT f m b # (<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a #
Applicative (Stream m a)
Instance details Defined in GHC.Data.Stream Methods pure :: a0 -> Stream m a a0 # (<>) :: Stream m a (a0 -> b) -> Stream m a a0 -> Stream m a b # liftA2 :: (a0 -> b -> c) -> Stream m a a0 -> Stream m a b -> Stream m a c # (>) :: Stream m a a0 -> Stream m a b -> Stream m a b # (<*) :: Stream m a a0 -> Stream m a b -> Stream m a a0 #
Monad m => Applicative (StreamS m a)
Instance details Defined in GHC.Data.Stream Methods pure :: a0 -> StreamS m a a0 # (<>) :: StreamS m a (a0 -> b) -> StreamS m a a0 -> StreamS m a b # liftA2 :: (a0 -> b -> c) -> StreamS m a a0 -> StreamS m a b -> StreamS m a c # (>) :: StreamS m a a0 -> StreamS m a b -> StreamS m a b # (<*) :: StreamS m a a0 -> StreamS m a b -> StreamS m a a0 #
Applicative f => Applicative (Indexing f)
Instance details Defined in WithIndex Methods pure :: a -> Indexing f a # (<>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c # (>) :: Indexing f a -> Indexing f b -> Indexing f b # (<*) :: Indexing f a -> Indexing f b -> Indexing f a #
(Applicative f, Applicative g) => Applicative (Day f g)
Instance details Defined in Data.Functor.Day Methods pure :: a -> Day f g a # (<>) :: Day f g (a -> b) -> Day f g a -> Day f g b # liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c # (>) :: Day f g a -> Day f g b -> Day f g b # (<*) :: Day f g a -> Day f g b -> Day f g a #
Applicative (Indexed i a)
Instance details Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 # (<>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c # (>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #
Applicative (Flows i b)	This is an illegal `Applicative`.
Instance details Defined in Control.Lens.Internal.Level Methods pure :: a -> Flows i b a # (<>) :: Flows i b (a -> b0) -> Flows i b a -> Flows i b b0 # liftA2 :: (a -> b0 -> c) -> Flows i b a -> Flows i b b0 -> Flows i b c # (>) :: Flows i b a -> Flows i b b0 -> Flows i b b0 # (<*) :: Flows i b a -> Flows i b b0 -> Flows i b a #
Applicative (Mafic a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Mafic a b a0 # (<>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 # liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c # (>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0 # (<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0 #
Monoid m => Applicative (Holes t m)
Instance details Defined in Control.Lens.Traversal Methods pure :: a -> Holes t m a # (<>) :: Holes t m (a -> b) -> Holes t m a -> Holes t m b # liftA2 :: (a -> b -> c) -> Holes t m a -> Holes t m b -> Holes t m c # (>) :: Holes t m a -> Holes t m b -> Holes t m b # (<*) :: Holes t m a -> Holes t m b -> Holes t m a #
Applicative m => Applicative (LspT config m)
Instance details Defined in Language.LSP.Server.Core Methods pure :: a -> LspT config m a # (<>) :: LspT config m (a -> b) -> LspT config m a -> LspT config m b # liftA2 :: (a -> b -> c) -> LspT config m a -> LspT config m b -> LspT config m c # (>) :: LspT config m a -> LspT config m b -> LspT config m b # (<*) :: LspT config m a -> LspT config m b -> LspT config m a #
(Applicative (Rep p), Representable p) => Applicative (Prep p)
Instance details Defined in Data.Profunctor.Rep Methods pure :: a -> Prep p a # (<>) :: Prep p (a -> b) -> Prep p a -> Prep p b # liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c # (>) :: Prep p a -> Prep p b -> Prep p b # (<*) :: Prep p a -> Prep p b -> Prep p a #
Applicative (Tagged s)
Instance details Defined in Data.Tagged Methods pure :: a -> Tagged s a # (<>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b # liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c # (>) :: Tagged s a -> Tagged s b -> Tagged s b # (<*) :: Tagged s a -> Tagged s b -> Tagged s a #
Applicative f => Applicative (Backwards f)	Apply `f`-actions in the reverse order.
Instance details Defined in Control.Applicative.Backwards Methods pure :: a -> Backwards f a # (<>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b # liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c # (>) :: Backwards f a -> Backwards f b -> Backwards f b # (<*) :: Backwards f a -> Backwards f b -> Backwards f a #
(Monoid w, Functor m, Monad m) => Applicative (AccumT w m)
Instance details Defined in Control.Monad.Trans.Accum Methods pure :: a -> AccumT w m a # (<>) :: AccumT w m (a -> b) -> AccumT w m a -> AccumT w m b # liftA2 :: (a -> b -> c) -> AccumT w m a -> AccumT w m b -> AccumT w m c # (>) :: AccumT w m a -> AccumT w m b -> AccumT w m b # (<*) :: AccumT w m a -> AccumT w m b -> AccumT w m a #
(Functor m, Monad m) => Applicative (ExceptT e m)
Instance details Defined in Control.Monad.Trans.Except Methods pure :: a -> ExceptT e m a # (<>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b # liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c # (>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b # (<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a #
Applicative m => Applicative (IdentityT m)
Instance details Defined in Control.Monad.Trans.Identity Methods pure :: a -> IdentityT m a # (<>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b # liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c # (>) :: IdentityT m a -> IdentityT m b -> IdentityT m b # (<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #
Applicative m => Applicative (ReaderT r m)
Instance details Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a # (<>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c # (>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
(Functor m, Monad m) => Applicative (SelectT r m)
Instance details Defined in Control.Monad.Trans.Select Methods pure :: a -> SelectT r m a # (<>) :: SelectT r m (a -> b) -> SelectT r m a -> SelectT r m b # liftA2 :: (a -> b -> c) -> SelectT r m a -> SelectT r m b -> SelectT r m c # (>) :: SelectT r m a -> SelectT r m b -> SelectT r m b # (<*) :: SelectT r m a -> SelectT r m b -> SelectT r m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a # (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c # (>) :: StateT s m a -> StateT s m b -> StateT s m b # (<*) :: StateT s m a -> StateT s m b -> StateT s m a #
(Functor m, Monad m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.CPS Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Strict Methods pure :: a -> WriterT w m a # (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c # (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
Monoid a => Applicative (Constant a :: Type -> Type)
Instance details Defined in Data.Functor.Constant Methods pure :: a0 -> Constant a a0 # (<>) :: Constant a (a0 -> b) -> Constant a a0 -> Constant a b # liftA2 :: (a0 -> b -> c) -> Constant a a0 -> Constant a b -> Constant a c # (>) :: Constant a a0 -> Constant a b -> Constant a b # (<*) :: Constant a a0 -> Constant a b -> Constant a a0 #
Applicative f => Applicative (Reverse f)	Derived instance.
Instance details Defined in Data.Functor.Reverse Methods pure :: a -> Reverse f a # (<>) :: Reverse f (a -> b) -> Reverse f a -> Reverse f b # liftA2 :: (a -> b -> c) -> Reverse f a -> Reverse f b -> Reverse f c # (>) :: Reverse f a -> Reverse f b -> Reverse f b # (<*) :: Reverse f a -> Reverse f b -> Reverse f a #
(Monoid a, Monoid b) => Applicative ((,,) a b)	Since: base-4.14.0.0
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, b, a0) # (<>) :: (a, b, a0 -> b0) -> (a, b, a0) -> (a, b, b0) # liftA2 :: (a0 -> b0 -> c) -> (a, b, a0) -> (a, b, b0) -> (a, b, c) # (>) :: (a, b, a0) -> (a, b, b0) -> (a, b, b0) # (<*) :: (a, b, a0) -> (a, b, b0) -> (a, b, a0) #
(Applicative f, Applicative g) => Applicative (Product f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Product Methods pure :: a -> Product f g a # (<>) :: Product f g (a -> b) -> Product f g a -> Product f g b # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c # (>) :: Product f g a -> Product f g b -> Product f g b # (<*) :: Product f g a -> Product f g b -> Product f g a #
(Applicative f, Applicative g) => Applicative (f :*: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :: g) a # (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b # liftA2 :: (a -> b -> c) -> (f :: g) a -> (f :: g) b -> (f :: g) c # (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b # (<) :: (f :: g) a -> (f :: g) b -> (f :: g) a #
Monoid c => Applicative (K1 i c :: Type -> Type)	Since: base-4.12.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> K1 i c a # (<>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b # liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 # (>) :: K1 i c a -> K1 i c b -> K1 i c b # (<*) :: K1 i c a -> K1 i c b -> K1 i c a #
Applicative (ConduitT i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ConduitT i o m a # (<>) :: ConduitT i o m (a -> b) -> ConduitT i o m a -> ConduitT i o m b # liftA2 :: (a -> b -> c) -> ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m c # (>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b # (<*) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m a #
Monad m => Applicative (ZipConduit i o m)
Instance details Defined in Data.Conduit.Internal.Conduit Methods pure :: a -> ZipConduit i o m a # (<>) :: ZipConduit i o m (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b # liftA2 :: (a -> b -> c) -> ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m c # (>) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m b # (<*) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m a #
(Monad f, Applicative f) => Applicative (WhenMatched f x y)	Equivalent to `ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a #
(Applicative f, Monad f) => Applicative (WhenMissing f k x)	Equivalent to `ReaderT k (ReaderT x (MaybeT f))` . Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a #
Applicative (Bazaar p a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> Bazaar p a b a0 # (<>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 # liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c # (>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 # (<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #
Applicative (Molten i a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Molten i a b a0 # (<>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 # liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c # (>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 # (<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 #
Applicative (ContT r m)
Instance details Defined in Control.Monad.Trans.Cont Methods pure :: a -> ContT r m a # (<>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b # liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c # (>) :: ContT r m a -> ContT r m b -> ContT r m b # (<*) :: ContT r m a -> ContT r m b -> ContT r m a #
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c)	Since: base-4.14.0.0
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, b, c, a0) # (<>) :: (a, b, c, a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) # liftA2 :: (a0 -> b0 -> c0) -> (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, c0) # (>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) # (<*) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, a0) #
Applicative ((->) r)	Since: base-2.1
Instance details Defined in GHC.Base Methods pure :: a -> r -> a # (<>) :: (r -> (a -> b)) -> (r -> a) -> r -> b # liftA2 :: (a -> b -> c) -> (r -> a) -> (r -> b) -> r -> c # (>) :: (r -> a) -> (r -> b) -> r -> b # (<*) :: (r -> a) -> (r -> b) -> r -> a #
(Applicative f, Applicative g) => Applicative (Compose f g)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a # (<>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c # (>) :: Compose f g a -> Compose f g b -> Compose f g b # (<*) :: Compose f g a -> Compose f g b -> Compose f g a #
(Applicative f, Applicative g) => Applicative (f :.: g)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> (f :.: g) a # (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c # (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #
Applicative f => Applicative (M1 i c f)	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods pure :: a -> M1 i c f a # (<>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b # liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 # (>) :: M1 i c f a -> M1 i c f b -> M1 i c f b # (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a #
(Monad f, Applicative f) => Applicative (WhenMatched f k x y)	Equivalent to `ReaderT k (ReaderT x (ReaderT y (MaybeT f)))` Since: containers-0.5.9
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a #
Applicative (BazaarT p g a b)
Instance details Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> BazaarT p g a b a0 # (<>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 # liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c # (>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 # (<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #
Applicative (TakingWhile p f a b)
Instance details Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> TakingWhile p f a b a0 # (<>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 # liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c # (>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 # (<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #
Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s)
Instance details Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #
(Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.CPS Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Lazy Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)
Instance details Defined in Control.Monad.Trans.RWS.Strict Methods pure :: a -> RWST r w s m a # (<>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c # (>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
Monad m => Applicative (Pipe l i o u m)
Instance details Defined in Data.Conduit.Internal.Pipe Methods pure :: a -> Pipe l i o u m a # (<>) :: Pipe l i o u m (a -> b) -> Pipe l i o u m a -> Pipe l i o u m b # liftA2 :: (a -> b -> c) -> Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m c # (>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b # (<*) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m a #

data TyCon #

TyCons represent type constructors. Type constructors are introduced by things such as:

1) Data declarations: data Foo = ... creates the Foo type constructor of kind *

2) Type synonyms: type Foo = ... creates the Foo type constructor

3) Newtypes: newtype Foo a = MkFoo ... creates the Foo type constructor of kind * -> *

4) Class declarations: class Foo where creates the Foo type constructor of kind *

This data type also encodes a number of primitive, built in type constructors such as those for function and tuple types.

If you edit this type, you may need to update the GHC formalism See Note [GHC Formalism] in GHC.Core.Lint

Instances

Instances details

Data TyCon
Instance details Defined in GHC.Core.TyCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyCon -> c TyCon # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyCon # toConstr :: TyCon -> Constr # dataTypeOf :: TyCon -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyCon) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyCon) # gmapT :: (forall b. Data b => b -> b) -> TyCon -> TyCon # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyCon -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyCon -> r # gmapQ :: (forall d. Data d => d -> u) -> TyCon -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TyCon -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCon -> m TyCon #
NamedThing TyCon
Instance details Defined in GHC.Core.TyCon Methods getOccName :: TyCon -> OccName # getName :: TyCon -> Name #
Uniquable TyCon
Instance details Defined in GHC.Core.TyCon Methods getUnique :: TyCon -> Unique #
Outputable TyCon
Instance details Defined in GHC.Core.TyCon Methods ppr :: TyCon -> SDoc #
Eq TyCon
Instance details Defined in GHC.Core.TyCon Methods (==) :: TyCon -> TyCon -> Bool # (/=) :: TyCon -> TyCon -> Bool #

type Module = GenModule Unit #

A Module is a pair of a Unit and a ModuleName.

data Type #

Constructors

TyVarTy Var	Vanilla type or kind variable (never a coercion variable)
AppTy Type Type	Type application to something other than a `TyCon`. Parameters: 1) Function: must not be a `TyConApp` or `CastTy`, must be another `AppTy`, or `TyVarTy` See Note [Respecting definitional equality] (EQ1) about the no `CastTy` requirement 2) Argument type
TyConApp TyCon [KindOrType]	Application of a `TyCon`, including newtypes and synonyms. Invariant: saturated applications of `FunTyCon` must use `FunTy` and saturated synonyms must use their own constructors. However, unsaturated `FunTyCon`s do appear as `TyConApp`s. Parameters: 1) Type constructor being applied to. 2) Type arguments. Might not have enough type arguments here to saturate the constructor. Even type synonyms are not necessarily saturated; for example unsaturated type synonyms can appear as the right hand side of a type synonym.
ForAllTy !ForAllTyBinder Type	A Π type. Note [When we quantify over a coercion variable] INVARIANT: If the binder is a coercion variable, it must be mentioned in the Type. See Note [Unused coercion variable in ForAllTy]
LitTy TyLit	Type literals are similar to type constructors.
CastTy Type KindCoercion	A kind cast. The coercion is always nominal. INVARIANT: The cast is never reflexive (EQ2) INVARIANT: The Type is not a CastTy (use TransCo instead) (EQ3) INVARIANT: The Type is not a ForAllTy over a tyvar (EQ4) See Note [Respecting definitional equality]
CoercionTy Coercion	Injection of a Coercion into a type This should only ever be used in the RHS of an AppTy, in the list of a TyConApp, when applying a promoted GADT data constructor

Instances

Instances details

Data Type
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type -> c Type # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Type # toConstr :: Type -> Constr # dataTypeOf :: Type -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Type) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Type) # gmapT :: (forall b. Data b => b -> b) -> Type -> Type # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r # gmapQ :: (forall d. Data d => d -> u) -> Type -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Type -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type -> m Type # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type #
NFData Type Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Type -> () #
Outputable Type
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: Type -> SDoc #
Eq (DeBruijn Type)
Instance details Defined in GHC.Core.Map.Type Methods (==) :: DeBruijn Type -> DeBruijn Type -> Bool # (/=) :: DeBruijn Type -> DeBruijn Type -> Bool #

type Arity = Int #

The number of value arguments that can be applied to a value before it does "real work". So: fib 100 has arity 0 x -> fib x has arity 1 See also Note [Definition of arity] in GHC.Core.Opt.Arity

data Name #

A unique, unambiguous name for something, containing information about where that thing originated.

Instances

Instances details

Data Name
Instance details Defined in GHC.Types.Name Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name -> c Name # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Name # toConstr :: Name -> Constr # dataTypeOf :: Name -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Name) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Name) # gmapT :: (forall b. Data b => b -> b) -> Name -> Name # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r # gmapQ :: (forall d. Data d => d -> u) -> Name -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Name -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name -> m Name # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name #
NFData Name
Instance details Defined in GHC.Types.Name Methods rnf :: Name -> () #
ModifyState Name
Instance details Defined in GHC.Iface.Ext.Ast Methods addSubstitution :: Name -> Name -> HieState -> HieState
NamedThing Name
Instance details Defined in GHC.Types.Name Methods getOccName :: Name -> OccName # getName :: Name -> Name #
HasOccName Name
Instance details Defined in GHC.Types.Name Methods occName :: Name -> OccName #
Uniquable Name
Instance details Defined in GHC.Types.Name Methods getUnique :: Name -> Unique #
Binary Name	Assumes that the `Name` is a non-binding one. See `putIfaceTopBndr` and `getIfaceTopBndr` for serializing binding `Name`s. See `UserData` for the rationale for this distinction.
Instance details Defined in GHC.Types.Name Methods put_ :: BinHandle -> Name -> IO () # put :: BinHandle -> Name -> IO (Bin Name) # get :: BinHandle -> IO Name #
Outputable Name
Instance details Defined in GHC.Types.Name Methods ppr :: Name -> SDoc #
OutputableBndr Name
Instance details Defined in GHC.Types.Name Methods pprBndr :: BindingSite -> Name -> SDoc # pprPrefixOcc :: Name -> SDoc # pprInfixOcc :: Name -> SDoc # bndrIsJoin_maybe :: Name -> Maybe Int #
Eq Name	The same comments as for `Name`'s `Ord` instance apply.
Instance details Defined in GHC.Types.Name Methods (==) :: Name -> Name -> Bool # (/=) :: Name -> Name -> Bool #
Ord Name	Caution: This instance is implemented via `nonDetCmpUnique`, which means that the ordering is not stable across deserialization or rebuilds. See `nonDetCmpUnique` for further information, and trac #15240 for a bug caused by improper use of this instance.
Instance details Defined in GHC.Types.Name Methods compare :: Name -> Name -> Ordering # (<) :: Name -> Name -> Bool # (<=) :: Name -> Name -> Bool # (>) :: Name -> Name -> Bool # (>=) :: Name -> Name -> Bool # max :: Name -> Name -> Name # min :: Name -> Name -> Name #
ToHie (LBooleanFormula (LocatedN Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]
ToHie (Context (Located Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Name) -> HieM [HieAST Type]
NFData (UniqFM Name [Name]) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: UniqFM Name [Name] -> () #
type Anno Name
Instance details Defined in GHC.Hs.Extension type Anno Name = SrcSpanAnnN
type Anno (LocatedN Name)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Name) = SrcSpan
type Anno [LocatedN Name]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Name] = SrcSpan

data DerivStrategy pass #

Which technique the user explicitly requested when deriving an instance.

Constructors

StockStrategy (XStockStrategy pass)	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.)
AnyclassStrategy (XAnyClassStrategy pass)	-XDeriveAnyClass
NewtypeStrategy (XNewtypeStrategy pass)	-XGeneralizedNewtypeDeriving
ViaStrategy (XViaStrategy pass)	-XDerivingVia

Instances

Instances details

ToHie (RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)) -> HieM [HieAST Type]
type Anno (DerivStrategy (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivStrategy (GhcPass p)) = SrcAnn NoEpAnns

type Kind = Type #

The key type representing kinds in the compiler.

data InjectivityAnn pass #

If the user supplied an injectivity annotation it is represented using InjectivityAnn. At the moment this is a single injectivity condition - see Note [Injectivity annotation]. `Located name` stores the LHS of injectivity condition. `[Located name]` stores the RHS of injectivity condition. Example:

type family Foo a b c = r | r -> a c where ...

This will be represented as "InjectivityAnn r [a, c]"

Constructors

InjectivityAnn (XCInjectivityAnn pass) (LIdP pass) [LIdP pass]	`AnnKeywordId` : `AnnRarrow`, `AnnVbar`
XInjectivityAnn !(XXInjectivityAnn pass)

Instances

Instances details

ToHie (LocatedAn NoEpAnns (InjectivityAnn GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (InjectivityAnn GhcRn) -> HieM [HieAST Type]
type Anno (InjectivityAnn (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InjectivityAnn (GhcPass p)) = SrcAnn NoEpAnns

data RuleBndr pass #

Rule Binder

Constructors

RuleBndr (XCRuleBndr pass) (LIdP pass)
RuleBndrSig (XRuleBndrSig pass) (LIdP pass) (HsPatSigType pass)
XRuleBndr !(XXRuleBndr pass)	`AnnKeywordId` : `AnnOpen`, `AnnDcolon`,`AnnClose`

Instances

Instances details

ToHie (RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)) -> HieM [HieAST Type]
type Anno (RuleBndr (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleBndr (GhcPass p)) = SrcAnn NoEpAnns

type FunDep a = ([a], [a]) #

type BangType pass = HsType pass #

Bang Type

In the parser, strictness and packedness annotations bind more tightly than docstrings. This means that when consuming a BangType (and looking for HsBangTy) we must be ready to peer behind a potential layer of HsDocTy. See #15206 for motivation and getBangType for an example.

type Stmt id body = StmtLR id id body #

do block Statement

data Pred #

A predicate in the solver. The solver tries to prove Wanted predicates from Given ones.

Constructors

ClassPred Class [Type]	A typeclass predicate.
EqPred EqRel Type Type	A type equality predicate.
IrredPred PredType	An irreducible predicate.
ForAllPred [TyVar] [PredType] PredType	A quantified predicate. See Note [Quantified constraints] in GHC.Tc.Solver.Canonical

data Match p body #

Constructors

Match
Fields m_ext :: XCMatch p body m_ctxt :: HsMatchContext p m_pats :: [LPat p] m_grhss :: GRHSs p body
XMatch !(XXMatch p body)

Instances

Instances details

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

data Pat p #

Pattern

AnnKeywordId : AnnBang

Constructors

WildPat (XWildPat p)	Wildcard Pattern The sole reason for a type on a WildPat is to support hsPatType :: Pat Id -> Type
VarPat (XVarPat p) (LIdP p)	Variable Pattern
LazyPat (XLazyPat p) (LPat p)	Lazy Pattern ^ - `AnnKeywordId` : `AnnTilde`
AsPat (XAsPat p) (LIdP p) !(LHsToken "@" p) (LPat p)	As pattern ^ - `AnnKeywordId` : `AnnAt`
ParPat
Fields (XParPat p) !(LHsToken "(" p) (LPat p) Parenthesised pattern !(LHsToken ")" p) `AnnKeywordId` : `AnnOpen` `'('`, `AnnClose` `')'`
BangPat (XBangPat p) (LPat p)	Bang pattern ^ - `AnnKeywordId` : `AnnBang`
ListPat (XListPat p) [LPat p]	Syntactic List `AnnKeywordId` : `AnnOpen` `'['`, `AnnClose` `']'`
TuplePat (XTuplePat p) [LPat p] Boxity	Tuple sub-patterns `AnnKeywordId` : `AnnOpen` `'('` or `'(#'`, `AnnClose` `')'` or `'#)'`
SumPat (XSumPat p) (LPat p) ConTag SumWidth	Anonymous sum pattern `AnnKeywordId` : `AnnOpen` `'(#'`, `AnnClose` `'#)'`
ConPat	Constructor Pattern
Fields pat_con_ext :: XConPat p pat_con :: XRec p (ConLikeP p) pat_args :: HsConPatDetails p
ViewPat	`AnnKeywordId` : `AnnRarrow`
Fields (XViewPat p) (LHsExpr p) (LPat p) View Pattern
SplicePat	`AnnKeywordId` : `AnnOpen` `'$('` `AnnClose` `')'`
Fields (XSplicePat p) (HsUntypedSplice p) Splice Pattern (Includes quasi-quotes)
LitPat (XLitPat p) (HsLit p)	Literal Pattern Used for non-overloaded literal patterns: Int#, Char#, Int, Char, String, etc.
NPat (XNPat p) (XRec p (HsOverLit p)) (Maybe (SyntaxExpr p)) (SyntaxExpr p)	Natural Pattern `AnnKeywordId` : `AnnVal` `+`
NPlusKPat (XNPlusKPat p) (LIdP p) (XRec p (HsOverLit p)) (HsOverLit p) (SyntaxExpr p) (SyntaxExpr p)	n+k pattern
SigPat	`AnnKeywordId` : `AnnDcolon`
Fields (XSigPat p) (LPat p) (HsPatSigType (NoGhcTc p)) Pattern with a type signature
XPat !(XXPat p)

Instances

Instances details

NFData (Pat (GhcPass 'Renamed)) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Pat (GhcPass 'Renamed) -> () #
HiePass p => HasType (LocatedA (Pat (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]
type Anno (Pat (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (Pat (GhcPass p)) = SrcSpanAnnA

data ConLike #

A constructor-like thing

Constructors

RealDataCon DataCon
PatSynCon PatSyn

Instances

Instances details

Data ConLike
Instance details Defined in GHC.Core.ConLike Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ConLike -> c ConLike # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ConLike # toConstr :: ConLike -> Constr # dataTypeOf :: ConLike -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ConLike) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ConLike) # gmapT :: (forall b. Data b => b -> b) -> ConLike -> ConLike # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ConLike -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ConLike -> r # gmapQ :: (forall d. Data d => d -> u) -> ConLike -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ConLike -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ConLike -> m ConLike #
NamedThing ConLike
Instance details Defined in GHC.Core.ConLike Methods getOccName :: ConLike -> OccName # getName :: ConLike -> Name #
Uniquable ConLike
Instance details Defined in GHC.Core.ConLike Methods getUnique :: ConLike -> Unique #
Outputable ConLike
Instance details Defined in GHC.Core.ConLike Methods ppr :: ConLike -> SDoc #
OutputableBndr ConLike
Instance details Defined in GHC.Core.ConLike Methods pprBndr :: BindingSite -> ConLike -> SDoc # pprPrefixOcc :: ConLike -> SDoc # pprInfixOcc :: ConLike -> SDoc # bndrIsJoin_maybe :: ConLike -> Maybe Int #
Eq ConLike
Instance details Defined in GHC.Core.ConLike Methods (==) :: ConLike -> ConLike -> Bool # (/=) :: ConLike -> ConLike -> Bool #
type Anno ConLike
Instance details Defined in GHC.Hs.Pat type Anno ConLike = SrcSpanAnnN

class (Typeable e, Show e) => Exception e where #

Any type that you wish to throw or catch as an exception must be an instance of the Exception class. The simplest case is a new exception type directly below the root:

data MyException = ThisException | ThatException
    deriving Show

instance Exception MyException

The default method definitions in the Exception class do what we need in this case. You can now throw and catch ThisException and ThatException as exceptions:

*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException))
Caught ThisException

In more complicated examples, you may wish to define a whole hierarchy of exceptions:

---------------------------------------------------------------------
-- Make the root exception type for all the exceptions in a compiler

data SomeCompilerException = forall e . Exception e => SomeCompilerException e

instance Show SomeCompilerException where
    show (SomeCompilerException e) = show e

instance Exception SomeCompilerException

compilerExceptionToException :: Exception e => e -> SomeException
compilerExceptionToException = toException . SomeCompilerException

compilerExceptionFromException :: Exception e => SomeException -> Maybe e
compilerExceptionFromException x = do
    SomeCompilerException a <- fromException x
    cast a

---------------------------------------------------------------------
-- Make a subhierarchy for exceptions in the frontend of the compiler

data SomeFrontendException = forall e . Exception e => SomeFrontendException e

instance Show SomeFrontendException where
    show (SomeFrontendException e) = show e

instance Exception SomeFrontendException where
    toException = compilerExceptionToException
    fromException = compilerExceptionFromException

frontendExceptionToException :: Exception e => e -> SomeException
frontendExceptionToException = toException . SomeFrontendException

frontendExceptionFromException :: Exception e => SomeException -> Maybe e
frontendExceptionFromException x = do
    SomeFrontendException a <- fromException x
    cast a

---------------------------------------------------------------------
-- Make an exception type for a particular frontend compiler exception

data MismatchedParentheses = MismatchedParentheses
    deriving Show

instance Exception MismatchedParentheses where
    toException   = frontendExceptionToException
    fromException = frontendExceptionFromException

We can now catch a MismatchedParentheses exception as MismatchedParentheses, SomeFrontendException or SomeCompilerException, but not other types, e.g. IOException:

*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: IOException))
*** Exception: MismatchedParentheses

Minimal complete definition

Nothing

Methods

toException :: e -> SomeException #

fromException :: SomeException -> Maybe e #

displayException :: e -> String #

Render this exception value in a human-friendly manner.

Default implementation: show.

Since: base-4.8.0.0

Instances

Instances details

Exception AesonException
Instance details Defined in Data.Aeson.Types.Internal Methods toException :: AesonException -> SomeException # fromException :: SomeException -> Maybe AesonException # displayException :: AesonException -> String #
Exception AsyncCancelled
Instance details Defined in Control.Concurrent.Async.Internal Methods toException :: AsyncCancelled -> SomeException # fromException :: SomeException -> Maybe AsyncCancelled # displayException :: AsyncCancelled -> String #
Exception ExceptionInLinkedThread
Instance details Defined in Control.Concurrent.Async.Internal Methods toException :: ExceptionInLinkedThread -> SomeException # fromException :: SomeException -> Maybe ExceptionInLinkedThread # displayException :: ExceptionInLinkedThread -> String #
Exception NestedAtomically	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: NestedAtomically -> SomeException # fromException :: SomeException -> Maybe NestedAtomically # displayException :: NestedAtomically -> String #
Exception NoMatchingContinuationPrompt	Since: base-4.18
Instance details Defined in Control.Exception.Base Methods toException :: NoMatchingContinuationPrompt -> SomeException # fromException :: SomeException -> Maybe NoMatchingContinuationPrompt # displayException :: NoMatchingContinuationPrompt -> String #
Exception NoMethodError	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: NoMethodError -> SomeException # fromException :: SomeException -> Maybe NoMethodError # displayException :: NoMethodError -> String #
Exception NonTermination	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: NonTermination -> SomeException # fromException :: SomeException -> Maybe NonTermination # displayException :: NonTermination -> String #
Exception PatternMatchFail	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: PatternMatchFail -> SomeException # fromException :: SomeException -> Maybe PatternMatchFail # displayException :: PatternMatchFail -> String #
Exception RecConError	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: RecConError -> SomeException # fromException :: SomeException -> Maybe RecConError # displayException :: RecConError -> String #
Exception RecSelError	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: RecSelError -> SomeException # fromException :: SomeException -> Maybe RecSelError # displayException :: RecSelError -> String #
Exception RecUpdError	Since: base-4.0
Instance details Defined in Control.Exception.Base Methods toException :: RecUpdError -> SomeException # fromException :: SomeException -> Maybe RecUpdError # displayException :: RecUpdError -> String #
Exception TypeError	Since: base-4.9.0.0
Instance details Defined in Control.Exception.Base Methods toException :: TypeError -> SomeException # fromException :: SomeException -> Maybe TypeError # displayException :: TypeError -> String #
Exception Dynamic	Since: base-4.0.0.0
Instance details Defined in Data.Dynamic Methods toException :: Dynamic -> SomeException # fromException :: SomeException -> Maybe Dynamic # displayException :: Dynamic -> String #
Exception Void	Since: base-4.8.0.0
Instance details Defined in GHC.Exception.Type Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String #
Exception ErrorCall	Since: base-4.0.0.0
Instance details Defined in GHC.Exception Methods toException :: ErrorCall -> SomeException # fromException :: SomeException -> Maybe ErrorCall # displayException :: ErrorCall -> String #
Exception ArithException	Since: base-4.0.0.0
Instance details Defined in GHC.Exception.Type Methods toException :: ArithException -> SomeException # fromException :: SomeException -> Maybe ArithException # displayException :: ArithException -> String #
Exception SomeException	Since: base-3.0
Instance details Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String #
Exception AllocationLimitExceeded	Since: base-4.8.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AllocationLimitExceeded -> SomeException # fromException :: SomeException -> Maybe AllocationLimitExceeded # displayException :: AllocationLimitExceeded -> String #
Exception ArrayException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: ArrayException -> SomeException # fromException :: SomeException -> Maybe ArrayException # displayException :: ArrayException -> String #
Exception AssertionFailed	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AssertionFailed -> SomeException # fromException :: SomeException -> Maybe AssertionFailed # displayException :: AssertionFailed -> String #
Exception AsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: AsyncException -> SomeException # fromException :: SomeException -> Maybe AsyncException # displayException :: AsyncException -> String #
Exception BlockedIndefinitelyOnMVar	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: BlockedIndefinitelyOnMVar -> SomeException # fromException :: SomeException -> Maybe BlockedIndefinitelyOnMVar # displayException :: BlockedIndefinitelyOnMVar -> String #
Exception BlockedIndefinitelyOnSTM	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: BlockedIndefinitelyOnSTM -> SomeException # fromException :: SomeException -> Maybe BlockedIndefinitelyOnSTM # displayException :: BlockedIndefinitelyOnSTM -> String #
Exception CompactionFailed	Since: base-4.10.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: CompactionFailed -> SomeException # fromException :: SomeException -> Maybe CompactionFailed # displayException :: CompactionFailed -> String #
Exception Deadlock	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: Deadlock -> SomeException # fromException :: SomeException -> Maybe Deadlock # displayException :: Deadlock -> String #
Exception ExitCode	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: ExitCode -> SomeException # fromException :: SomeException -> Maybe ExitCode # displayException :: ExitCode -> String #
Exception FixIOException	Since: base-4.11.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: FixIOException -> SomeException # fromException :: SomeException -> Maybe FixIOException # displayException :: FixIOException -> String #
Exception IOException	Since: base-4.1.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: IOException -> SomeException # fromException :: SomeException -> Maybe IOException # displayException :: IOException -> String #
Exception SomeAsyncException	Since: base-4.7.0.0
Instance details Defined in GHC.IO.Exception Methods toException :: SomeAsyncException -> SomeException # fromException :: SomeException -> Maybe SomeAsyncException # displayException :: SomeAsyncException -> String #
Exception SQLError
Instance details Defined in Database.SQLite3 Methods toException :: SQLError -> SomeException # fromException :: SomeException -> Maybe SQLError # displayException :: SQLError -> String #
Exception Timeout
Instance details Defined in System.Time.Extra Methods toException :: Timeout -> SomeException # fromException :: SomeException -> Maybe Timeout # displayException :: Timeout -> String #
Exception EncodingException
Instance details Defined in System.OsPath.Encoding.Internal Methods toException :: EncodingException -> SomeException # fromException :: SomeException -> Maybe EncodingException # displayException :: EncodingException -> String #
Exception GhcApiError
Instance details Defined in GHC Methods toException :: GhcApiError -> SomeException # fromException :: SomeException -> Maybe GhcApiError # displayException :: GhcApiError -> String #
Exception IOEnvFailure
Instance details Defined in GHC.Data.IOEnv Methods toException :: IOEnvFailure -> SomeException # fromException :: SomeException -> Maybe IOEnvFailure # displayException :: IOEnvFailure -> String #
Exception SourceError
Instance details Defined in GHC.Types.SourceError Methods toException :: SourceError -> SomeException # fromException :: SomeException -> Maybe SourceError # displayException :: SourceError -> String #
Exception GhcException
Instance details Defined in GHC.Utils.Panic Methods toException :: GhcException -> SomeException # fromException :: SomeException -> Maybe GhcException # displayException :: GhcException -> String #
Exception PlainGhcException
Instance details Defined in GHC.Utils.Panic.Plain Methods toException :: PlainGhcException -> SomeException # fromException :: SomeException -> Maybe PlainGhcException # displayException :: PlainGhcException -> String #
Exception BadDependency Source #
Instance details Defined in Development.IDE.Types.Shake Methods toException :: BadDependency -> SomeException # fromException :: SomeException -> Maybe BadDependency # displayException :: BadDependency -> String #
Exception CradleError
Instance details Defined in HIE.Bios.Types Methods toException :: CradleError -> SomeException # fromException :: SomeException -> Maybe CradleError # displayException :: CradleError -> String #
Exception HieDbException
Instance details Defined in HieDb.Types Methods toException :: HieDbException -> SomeException # fromException :: SomeException -> Maybe HieDbException # displayException :: HieDbException -> String #
Exception GraphException
Instance details Defined in Development.IDE.Graph.Internal.Types Methods toException :: GraphException -> SomeException # fromException :: SomeException -> Maybe GraphException # displayException :: GraphException -> String #
Exception StackException
Instance details Defined in Development.IDE.Graph.Internal.Types Methods toException :: StackException -> SomeException # fromException :: SomeException -> Maybe StackException # displayException :: StackException -> String #
Exception ProgressCancelledException
Instance details Defined in Language.LSP.Server.Core Methods toException :: ProgressCancelledException -> SomeException # fromException :: SomeException -> Maybe ProgressCancelledException # displayException :: ProgressCancelledException -> String #
Exception InvalidPosException
Instance details Defined in Text.Megaparsec.Pos Methods toException :: InvalidPosException -> SomeException # fromException :: SomeException -> Maybe InvalidPosException # displayException :: InvalidPosException -> String #
Exception NullError
Instance details Defined in Data.NonNull Methods toException :: NullError -> SomeException # fromException :: SomeException -> Maybe NullError # displayException :: NullError -> String #
Exception InvalidAccess
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods toException :: InvalidAccess -> SomeException # fromException :: SomeException -> Maybe InvalidAccess # displayException :: InvalidAccess -> String #
Exception ResourceCleanupException
Instance details Defined in Control.Monad.Trans.Resource.Internal Methods toException :: ResourceCleanupException -> SomeException # fromException :: SomeException -> Maybe ResourceCleanupException # displayException :: ResourceCleanupException -> String #
Exception AsyncExceptionWrapper
Instance details Defined in Control.Exception.Safe Methods toException :: AsyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe AsyncExceptionWrapper # displayException :: AsyncExceptionWrapper -> String #
Exception StringException
Instance details Defined in Control.Exception.Safe Methods toException :: StringException -> SomeException # fromException :: SomeException -> Maybe StringException # displayException :: StringException -> String #
Exception SyncExceptionWrapper
Instance details Defined in Control.Exception.Safe Methods toException :: SyncExceptionWrapper -> SomeException # fromException :: SomeException -> Maybe SyncExceptionWrapper # displayException :: SyncExceptionWrapper -> String #
Exception FormatError
Instance details Defined in Database.SQLite.Simple Methods toException :: FormatError -> SomeException # fromException :: SomeException -> Maybe FormatError # displayException :: FormatError -> String #
Exception ResultError
Instance details Defined in Database.SQLite.Simple.FromField Methods toException :: ResultError -> SomeException # fromException :: SomeException -> Maybe ResultError # displayException :: ResultError -> String #
Exception ColumnOutOfBounds
Instance details Defined in Database.SQLite.Simple.Internal Methods toException :: ColumnOutOfBounds -> SomeException # fromException :: SomeException -> Maybe ColumnOutOfBounds # displayException :: ColumnOutOfBounds -> String #
Exception UnicodeException
Instance details Defined in Data.Text.Encoding.Error Methods toException :: UnicodeException -> SomeException # fromException :: SomeException -> Maybe UnicodeException # displayException :: UnicodeException -> String #
Exception StringException	Since: unliftio-0.1.0.0
Instance details Defined in UnliftIO.Exception Methods toException :: StringException -> SomeException # fromException :: SomeException -> Maybe StringException # displayException :: StringException -> String #
Exception ConcException
Instance details Defined in UnliftIO.Internals.Async Methods toException :: ConcException -> SomeException # fromException :: SomeException -> Maybe ConcException # displayException :: ConcException -> String #
(Show s, Show (Token s), Show e, ShowErrorComponent e, VisualStream s, Typeable s, Typeable e) => Exception (ParseError s e)
Instance details Defined in Text.Megaparsec.Error Methods toException :: ParseError s e -> SomeException # fromException :: SomeException -> Maybe (ParseError s e) # displayException :: ParseError s e -> String #
(Show s, Show (Token s), Show e, ShowErrorComponent e, VisualStream s, TraversableStream s, Typeable s, Typeable e) => Exception (ParseErrorBundle s e)
Instance details Defined in Text.Megaparsec.Error Methods toException :: ParseErrorBundle s e -> SomeException # fromException :: SomeException -> Maybe (ParseErrorBundle s e) # displayException :: ParseErrorBundle s e -> String #

data SrcLoc #

Source Location

Constructors

UnhelpfulLoc !FastString

Instances

Instances details

Show SrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> SrcLoc -> ShowS # show :: SrcLoc -> String # showList :: [SrcLoc] -> ShowS #
Outputable SrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: SrcLoc -> SDoc #
Eq SrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: SrcLoc -> SrcLoc -> Bool # (/=) :: SrcLoc -> SrcLoc -> Bool #

data FractionalExponentBase #

Constructors

Base2
Base10

Instances

Instances details

Data FractionalExponentBase
Instance details Defined in GHC.Types.SourceText Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FractionalExponentBase -> c FractionalExponentBase # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FractionalExponentBase # toConstr :: FractionalExponentBase -> Constr # dataTypeOf :: FractionalExponentBase -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FractionalExponentBase) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FractionalExponentBase) # gmapT :: (forall b. Data b => b -> b) -> FractionalExponentBase -> FractionalExponentBase # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FractionalExponentBase -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FractionalExponentBase -> r # gmapQ :: (forall d. Data d => d -> u) -> FractionalExponentBase -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FractionalExponentBase -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FractionalExponentBase -> m FractionalExponentBase # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FractionalExponentBase -> m FractionalExponentBase # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FractionalExponentBase -> m FractionalExponentBase #
Show FractionalExponentBase
Instance details Defined in GHC.Types.SourceText Methods showsPrec :: Int -> FractionalExponentBase -> ShowS # show :: FractionalExponentBase -> String # showList :: [FractionalExponentBase] -> ShowS #
Eq FractionalExponentBase
Instance details Defined in GHC.Types.SourceText Methods (==) :: FractionalExponentBase -> FractionalExponentBase -> Bool # (/=) :: FractionalExponentBase -> FractionalExponentBase -> Bool #
Ord FractionalExponentBase
Instance details Defined in GHC.Types.SourceText Methods compare :: FractionalExponentBase -> FractionalExponentBase -> Ordering # (<) :: FractionalExponentBase -> FractionalExponentBase -> Bool # (<=) :: FractionalExponentBase -> FractionalExponentBase -> Bool # (>) :: FractionalExponentBase -> FractionalExponentBase -> Bool # (>=) :: FractionalExponentBase -> FractionalExponentBase -> Bool # max :: FractionalExponentBase -> FractionalExponentBase -> FractionalExponentBase # min :: FractionalExponentBase -> FractionalExponentBase -> FractionalExponentBase #

data Coercion #

A Coercion is concrete evidence of the equality/convertibility of two types.

Instances

Instances details

Data Coercion
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Coercion -> c Coercion # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Coercion # toConstr :: Coercion -> Constr # dataTypeOf :: Coercion -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Coercion) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Coercion) # gmapT :: (forall b. Data b => b -> b) -> Coercion -> Coercion # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Coercion -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Coercion -> r # gmapQ :: (forall d. Data d => d -> u) -> Coercion -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Coercion -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Coercion -> m Coercion #
Outputable Coercion
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: Coercion -> SDoc #
Eq (DeBruijn Coercion)
Instance details Defined in GHC.Core.Map.Type Methods (==) :: DeBruijn Coercion -> DeBruijn Coercion -> Bool # (/=) :: DeBruijn Coercion -> DeBruijn Coercion -> Bool #

data Fixity #

Constructors

Fixity SourceText Int FixityDirection

Instances

Instances details

Data Fixity
Instance details Defined in GHC.Types.Fixity Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixity -> c Fixity # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Fixity # toConstr :: Fixity -> Constr # dataTypeOf :: Fixity -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Fixity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Fixity) # gmapT :: (forall b. Data b => b -> b) -> Fixity -> Fixity # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r # gmapQ :: (forall d. Data d => d -> u) -> Fixity -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixity -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity #
Binary Fixity
Instance details Defined in GHC.Types.Fixity Methods put_ :: BinHandle -> Fixity -> IO () # put :: BinHandle -> Fixity -> IO (Bin Fixity) # get :: BinHandle -> IO Fixity #
Outputable Fixity
Instance details Defined in GHC.Types.Fixity Methods ppr :: Fixity -> SDoc #
Eq Fixity
Instance details Defined in GHC.Types.Fixity Methods (==) :: Fixity -> Fixity -> Bool # (/=) :: Fixity -> Fixity -> Bool #

data Session #

The Session is a handle to the complete state of a compilation session. A compilation session consists of a set of modules constituting the current program or library, the context for interactive evaluation, and various caches.

Constructors

Session !(IORef HscEnv)

newtype P a #

The parsing monad, isomorphic to StateT PState Maybe.

Constructors

P
Fields unP :: PState -> ParseResult a

Instances

Instances details

Applicative P
Instance details Defined in GHC.Parser.Lexer Methods pure :: a -> P a # (<>) :: P (a -> b) -> P a -> P b # liftA2 :: (a -> b -> c) -> P a -> P b -> P c # (>) :: P a -> P b -> P b # (<*) :: P a -> P b -> P a #
Functor P
Instance details Defined in GHC.Parser.Lexer Methods fmap :: (a -> b) -> P a -> P b # (<$) :: a -> P b -> P a #
Monad P
Instance details Defined in GHC.Parser.Lexer Methods (>>=) :: P a -> (a -> P b) -> P b # (>>) :: P a -> P b -> P b # return :: a -> P a #
MonadP P
Instance details Defined in GHC.Parser.Lexer Methods addError :: MsgEnvelope PsMessage -> P () # addWarning :: MsgEnvelope PsMessage -> P () # addFatalError :: MsgEnvelope PsMessage -> P a # getBit :: ExtBits -> P Bool # allocateCommentsP :: RealSrcSpan -> P EpAnnComments # allocatePriorCommentsP :: RealSrcSpan -> P EpAnnComments # allocateFinalCommentsP :: RealSrcSpan -> P EpAnnComments #

data Severity #

Used to describe warnings and errors o The message has a file/line/column heading, plus "warning:" or "error:", added by mkLocMessage o With SevIgnore the message is suppressed o Output is intended for end users

Constructors

SevIgnore	Ignore this message, for example in case of suppression of warnings users don't want to see. See Note [Suppressing Messages]
SevWarning
SevError

Instances

Instances details

Show Severity
Instance details Defined in GHC.Types.Error Methods showsPrec :: Int -> Severity -> ShowS # show :: Severity -> String # showList :: [Severity] -> ShowS #
ToJson Severity
Instance details Defined in GHC.Types.Error Methods json :: Severity -> JsonDoc #
Outputable Severity
Instance details Defined in GHC.Types.Error Methods ppr :: Severity -> SDoc #
Eq Severity
Instance details Defined in GHC.Types.Error Methods (==) :: Severity -> Severity -> Bool # (/=) :: Severity -> Severity -> Bool #

data Env gbl lcl #

Constructors

Env
Fields env_top :: !HscEnv env_um :: !Char env_gbl :: gbl env_lcl :: lcl

Instances

Instances details

ContainsHooks (Env gbl lcl)
Instance details Defined in GHC.Tc.Types Methods extractHooks :: Env gbl lcl -> Hooks #
ContainsDynFlags (Env gbl lcl)
Instance details Defined in GHC.Tc.Types Methods extractDynFlags :: Env gbl lcl -> DynFlags #
ContainsModule gbl => ContainsModule (Env gbl lcl)
Instance details Defined in GHC.Tc.Types Methods extractModule :: Env gbl lcl -> Module #
ContainsLogger (Env gbl lcl)
Instance details Defined in GHC.Tc.Types Methods extractLogger :: Env gbl lcl -> Logger #

data Class #

Instances

Instances details

Data Class
Instance details Defined in GHC.Core.Class Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Class -> c Class # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Class # toConstr :: Class -> Constr # dataTypeOf :: Class -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Class) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Class) # gmapT :: (forall b. Data b => b -> b) -> Class -> Class # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Class -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Class -> r # gmapQ :: (forall d. Data d => d -> u) -> Class -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Class -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Class -> m Class # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Class -> m Class # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Class -> m Class #
NamedThing Class
Instance details Defined in GHC.Core.Class Methods getOccName :: Class -> OccName # getName :: Class -> Name #
Uniquable Class
Instance details Defined in GHC.Core.Class Methods getUnique :: Class -> Unique #
Outputable Class
Instance details Defined in GHC.Core.Class Methods ppr :: Class -> SDoc #
Eq Class
Instance details Defined in GHC.Core.Class Methods (==) :: Class -> Class -> Bool # (/=) :: Class -> Class -> Bool #

data Var #

Variable

Essentially a typed Name, that may also contain some additional information about the Var and its use sites.

Instances

Instances details

Data Var
Instance details Defined in GHC.Types.Var Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Var -> c Var # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Var # toConstr :: Var -> Constr # dataTypeOf :: Var -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Var) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Var) # gmapT :: (forall b. Data b => b -> b) -> Var -> Var # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r # gmapQ :: (forall d. Data d => d -> u) -> Var -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Var -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Var -> m Var # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var #
ModifyState Id
Instance details Defined in GHC.Iface.Ext.Ast Methods addSubstitution :: Id -> Id -> HieState -> HieState
NamedThing Var
Instance details Defined in GHC.Types.Var Methods getOccName :: Var -> OccName # getName :: Var -> Name #
HasOccName Var
Instance details Defined in GHC.Types.Var Methods occName :: Var -> OccName #
Uniquable Var
Instance details Defined in GHC.Types.Var Methods getUnique :: Var -> Unique #
Outputable Var
Instance details Defined in GHC.Types.Var Methods ppr :: Var -> SDoc #
Eq Var
Instance details Defined in GHC.Types.Var Methods (==) :: Var -> Var -> Bool # (/=) :: Var -> Var -> Bool #
Ord Var
Instance details Defined in GHC.Types.Var Methods compare :: Var -> Var -> Ordering # (<) :: Var -> Var -> Bool # (<=) :: Var -> Var -> Bool # (>) :: Var -> Var -> Bool # (>=) :: Var -> Var -> Bool # max :: Var -> Var -> Var # min :: Var -> Var -> Var #
ToHie (Context (Located Var))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Var) -> HieM [HieAST Type]
Eq (DeBruijn Var)
Instance details Defined in GHC.Core.Map.Type Methods (==) :: DeBruijn Var -> DeBruijn Var -> Bool # (/=) :: DeBruijn Var -> DeBruijn Var -> Bool #
OutputableBndr (Id, TagSig)
Instance details Defined in GHC.Stg.InferTags.TagSig Methods pprBndr :: BindingSite -> (Id, TagSig) -> SDoc # pprPrefixOcc :: (Id, TagSig) -> SDoc # pprInfixOcc :: (Id, TagSig) -> SDoc # bndrIsJoin_maybe :: (Id, TagSig) -> Maybe Int #
type Anno Id
Instance details Defined in GHC.Hs.Extension type Anno Id = SrcSpanAnnN
type Anno (LocatedN Id)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Id) = SrcSpan
type Anno [LocatedN Id]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Id] = SrcSpan

data GhcException #

GHC's own exception type error messages all take the form:

     <location>: <error>

If the location is on the command line, or in GHC itself, then <location>="ghc". All of the error types below correspond to a <location> of "ghc", except for ProgramError (where the string is assumed to contain a location already, so we don't print one).

Constructors

Signal Int	Some other fatal signal (SIGHUP,SIGTERM)
UsageError String	Prints the short usage msg after the error
CmdLineError String	A problem with the command line arguments, but don't print usage.
Panic String	The `impossible` happened.
PprPanic String SDoc
Sorry String	The user tickled something that's known not to work yet, but we're not counting it as a bug.
PprSorry String SDoc
InstallationError String	An installation problem.
ProgramError String	An error in the user's code, probably.
PprProgramError String SDoc

Instances

Instances details

Exception GhcException
Instance details Defined in GHC.Utils.Panic Methods toException :: GhcException -> SomeException # fromException :: SomeException -> Maybe GhcException # displayException :: GhcException -> String #
Show GhcException
Instance details Defined in GHC.Utils.Panic Methods showsPrec :: Int -> GhcException -> ShowS # show :: GhcException -> String # showList :: [GhcException] -> ShowS #

data AnnDecl pass #

Annotation Declaration

Constructors

HsAnnotation (XHsAnnotation pass) (AnnProvenance pass) (XRec pass (HsExpr pass))	`AnnKeywordId` : `AnnOpen`, `AnnType` `AnnModule` `AnnClose`
XAnnDecl !(XXAnnDecl pass)

Instances

Instances details

ToHie (LocatedA (AnnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]
type Anno (AnnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

data IE pass #

Imported or exported entity.

Constructors

IEVar (XIEVar pass) (LIEWrappedName pass)	Imported or Exported Variable
IEThingAbs (XIEThingAbs pass) (LIEWrappedName pass)	Imported or exported Thing with Absent list The thing is a Class/Type (can't tell) - `AnnKeywordId`s : `AnnPattern`, `AnnType`,`AnnVal`
IEThingAll (XIEThingAll pass) (LIEWrappedName pass)	Imported or exported Thing with All imported or exported The thing is a ClassType and the All refers to methodsconstructors `AnnKeywordId`s : `AnnOpen`, `AnnDotdot`,`AnnClose`, `AnnType`
IEThingWith (XIEThingWith pass) (LIEWrappedName pass) IEWildcard [LIEWrappedName pass]	Imported or exported Thing With given imported or exported The thing is a Class/Type and the imported or exported things are methods/constructors and record fields; see Note [IEThingWith] - `AnnKeywordId`s : `AnnOpen`, `AnnClose`, `AnnComma`, `AnnType`
IEModuleContents (XIEModuleContents pass) (XRec pass ModuleName)	Imported or exported module contents (Export Only) `AnnKeywordId`s : `AnnModule`
IEGroup (XIEGroup pass) Int (LHsDoc pass)	Doc section heading
IEDoc (XIEDoc pass) (LHsDoc pass)	Some documentation
IEDocNamed (XIEDocNamed pass) String	Reference to named doc
XIE !(XXIE pass)

Instances

Instances details

ToHie (IEContext (LocatedA (IE GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno (IE (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (IE (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

data HsExpr p #

A Haskell expression.

Constructors

HsVar (XVar p) (LIdP p)	Variable See Note [Located RdrNames]
HsUnboundVar (XUnboundVar p) RdrName	Unbound variable; also used for "holes" (_ or _x). Turned from HsVar to HsUnboundVar by the renamer, when it finds an out-of-scope variable or hole. The (XUnboundVar p) field becomes an HoleExprRef after typechecking; this is where the erroring expression will be written after solving. See Note [Holes] in GHC.Tc.Types.Constraint.
HsRecSel (XRecSel p) (FieldOcc p)	Variable pointing to record selector See Note [Non-overloaded record field selectors] and Note [Record selectors in the AST]
HsOverLabel (XOverLabel p) SourceText FastString	Overloaded label (Note [Overloaded labels] in GHC.OverloadedLabels) Note [Pragma source text] in GHC.Types.SourceText
HsIPVar (XIPVar p) HsIPName	Implicit parameter (not in use after typechecking)
HsOverLit (XOverLitE p) (HsOverLit p)	Overloaded literals
HsLit (XLitE p) (HsLit p)	Simple (non-overloaded) literals
HsLam (XLam p) (MatchGroup p (LHsExpr p))	Lambda abstraction. Currently always a single match `AnnKeywordId` : `AnnLam`, `AnnRarrow`,
HsLamCase (XLamCase p) LamCaseVariant (MatchGroup p (LHsExpr p))	Lambda-case `AnnKeywordId` : `AnnLam`, `AnnCase`,`AnnOpen`, `AnnClose` `AnnKeywordId` : `AnnLam`, `AnnCases`,`AnnOpen`, `AnnClose`
HsApp (XApp p) (LHsExpr p) (LHsExpr p)	Application
HsAppType (XAppTypeE p) (LHsExpr p) !(LHsToken "@" p) (LHsWcType (NoGhcTc p))	Visible type application Explicit type argument; e.g f @Int x y NB: Has wildcards, but no implicit quantification `AnnKeywordId` : `AnnAt`,
OpApp (XOpApp p) (LHsExpr p) (LHsExpr p) (LHsExpr p)	Operator applications: NB Bracketed ops such as (+) come out as Vars.
NegApp (XNegApp p) (LHsExpr p) (SyntaxExpr p)	Negation operator. Contains the negated expression and the name of `negate` `AnnKeywordId` : `AnnMinus`
HsPar	`AnnKeywordId` : `AnnOpen` `'('`, `AnnClose` `')'`
Fields (XPar p) !(LHsToken "(" p) (LHsExpr p) Parenthesised expr; see Note [Parens in HsSyn] !(LHsToken ")" p)
SectionL (XSectionL p) (LHsExpr p) (LHsExpr p)
SectionR (XSectionR p) (LHsExpr p) (LHsExpr p)
ExplicitTuple (XExplicitTuple p) [HsTupArg p] Boxity	Used for explicit tuples and sections thereof `AnnKeywordId` : `AnnOpen`, `AnnClose`
ExplicitSum (XExplicitSum p) ConTag SumWidth (LHsExpr p)	Used for unboxed sum types `AnnKeywordId` : `AnnOpen` `'(#'`, `AnnVbar`, `AnnClose` `'#)'`, There will be multiple `AnnVbar`, (1 - alternative) before the expression, (arity - alternative) after it
HsCase (XCase p) (LHsExpr p) (MatchGroup p (LHsExpr p))	`AnnKeywordId` : `AnnCase`, `AnnOf`,`AnnOpen` `'{'`, `AnnClose` `'}'`
HsIf (XIf p) (LHsExpr p) (LHsExpr p) (LHsExpr p)	`AnnKeywordId` : `AnnIf`, `AnnSemi`, `AnnThen`,`AnnSemi`, `AnnElse`,
HsMultiIf (XMultiIf p) [LGRHS p (LHsExpr p)]	Multi-way if `AnnKeywordId` : `AnnIf` `AnnOpen`,`AnnClose`,
HsLet (XLet p) !(LHsToken "let" p) (HsLocalBinds p) !(LHsToken "in" p) (LHsExpr p)	let(rec) `AnnKeywordId` : `AnnLet`, `AnnOpen` `'{'`, `AnnClose` `'}'`,`AnnIn`
HsDo (XDo p) HsDoFlavour (XRec p [ExprLStmt p])	`AnnKeywordId` : `AnnDo`, `AnnOpen`, `AnnSemi`, `AnnVbar`, `AnnClose`
ExplicitList (XExplicitList p) [LHsExpr p]	Syntactic list: [a,b,c,...] `AnnKeywordId` : `AnnOpen` `'['`, `AnnClose` `']'`
RecordCon	Record construction `AnnKeywordId` : `AnnOpen` `'{'`, `AnnDotdot`,`AnnClose` `'}'`
Fields rcon_ext :: XRecordCon p rcon_con :: XRec p (ConLikeP p) rcon_flds :: HsRecordBinds p
RecordUpd	Record update `AnnKeywordId` : `AnnOpen` `'{'`, `AnnDotdot`,`AnnClose` `'}'` 'GHC.Parser.Annotation.AnnComma, `AnnDot`, `AnnClose` `'}'`
Fields rupd_ext :: XRecordUpd p rupd_expr :: LHsExpr p rupd_flds :: Either [LHsRecUpdField p] [LHsRecUpdProj p]
HsGetField	Record field selection e.g `z.x`. `AnnKeywordId` : `AnnDot`
Fields gf_ext :: XGetField p gf_expr :: LHsExpr p gf_field :: XRec p (DotFieldOcc p)
HsProjection	Record field selector. e.g. `(.x)` or `(.x.y)` This case only arises when the OverloadedRecordDot langauge extensions is enabled. See Note [Record selectors in the AST].
Fields proj_ext :: XProjection p proj_flds :: NonEmpty (XRec p (DotFieldOcc p))
ExprWithTySig (XExprWithTySig p) (LHsExpr p) (LHsSigWcType (NoGhcTc p))	Expression with an explicit type signature. `e :: type` `AnnKeywordId` : `AnnDcolon`
ArithSeq (XArithSeq p) (Maybe (SyntaxExpr p)) (ArithSeqInfo p)	Arithmetic sequence `AnnKeywordId` : `AnnOpen` `'['`, `AnnComma`,`AnnDotdot`, `AnnClose` `']'`
HsTypedBracket (XTypedBracket p) (LHsExpr p)	`AnnKeywordId` : `AnnOpen`, `AnnOpenE`,`AnnOpenEQ`, `AnnClose`,`AnnCloseQ`
HsUntypedBracket (XUntypedBracket p) (HsQuote p)
HsTypedSplice (XTypedSplice p) (LHsExpr p)	`AnnKeywordId` : `AnnOpen`, `AnnClose`
HsUntypedSplice (XUntypedSplice p) (HsUntypedSplice p)
HsProc (XProc p) (LPat p) (LHsCmdTop p)	`proc` notation for Arrows `AnnKeywordId` : `AnnProc`, `AnnRarrow`
HsStatic (XStatic p) (LHsExpr p)	`AnnKeywordId` : `AnnStatic`,
HsPragE (XPragE p) (HsPragE p) (LHsExpr p)
XExpr !(XXExpr p)

Instances

Instances details

NFData (HsExpr (GhcPass 'Renamed)) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HsExpr (GhcPass 'Renamed) -> () #
HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))	This instance tries to construct `HieAST` nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs. See Note [Computing the type of every node in the tree]
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
DisambECP (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess Associated Types type Body (HsExpr GhcPs) :: Type -> Type # type InfixOp (HsExpr GhcPs) # type FunArg (HsExpr GhcPs) # Methods ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsExpr GhcPs)) # ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsProjUpdatePV :: SrcSpan -> Located [LocatedAn NoEpAnns (DotFieldOcc GhcPs)] -> LocatedA (HsExpr GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsExpr GhcPs))) # mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsLetPV :: SrcSpan -> LHsToken "let" GhcPs -> HsLocalBinds GhcPs -> LHsToken "in" GhcPs -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # superInfixOp :: (DisambInfixOp (InfixOp (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsOpAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> LocatedN (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsExpr GhcPs)) # mkHsLamCasePV :: SrcSpan -> LamCaseVariant -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # superFunArg :: (DisambECP (FunArg (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LocatedA (FunArg (HsExpr GhcPs)) -> PV (LocatedA (HsExpr GhcPs)) # mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsToken "@" GhcPs -> LHsType GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsExpr GhcPs) -> Bool -> LocatedA (HsExpr GhcPs) -> AnnsIf -> PV (LocatedA (HsExpr GhcPs)) # mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsExpr GhcPs))] -> AnnList -> PV (LocatedA (HsExpr GhcPs)) # mkHsParPV :: SrcSpan -> LHsToken "(" GhcPs -> LocatedA (HsExpr GhcPs) -> LHsToken ")" GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs)) # mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsOverLitPV :: LocatedAn a (HsOverLit GhcPs) -> PV (LocatedAn a (HsExpr GhcPs)) # mkHsWildCardPV :: SrcSpan -> PV (Located (HsExpr GhcPs)) # mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsExpr GhcPs)] -> AnnList -> PV (LocatedA (HsExpr GhcPs)) # mkHsSplicePV :: Located (HsUntypedSplice GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsExpr GhcPs) -> ([Fbind (HsExpr GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsNegAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LHsToken "@" GhcPs -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # mkHsLazyPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsBangPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # rejectPragmaPV :: LocatedA (HsExpr GhcPs) -> PV () #
DisambInfixOp (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess Methods mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs)) # mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs)) # mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located (HsExpr GhcPs)) #
type Body (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type Body (HsExpr GhcPs) = HsExpr
type FunArg (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type FunArg (HsExpr GhcPs) = HsExpr GhcPs
type InfixOp (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type InfixOp (HsExpr GhcPs) = HsExpr GhcPs
type Anno (HsExpr (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

data RdrName #

Reader Name

Do not use the data constructors of RdrName directly: prefer the family of functions that creates them, such as mkRdrUnqual

Note: A Located RdrName will only have API Annotations if it is a compound one, e.g.

`bar`
( ~ )

AnnKeywordId : AnnType, AnnOpen '(' or '[' or '[:', AnnClose ')' or ']' or ':]',, AnnBackquote '`', AnnVal AnnTilde,

Constructors

Unqual OccName	Unqualified name Used for ordinary, unqualified occurrences, e.g. `x`, `y` or `Foo`. Create such a `RdrName` with `mkRdrUnqual`
Qual ModuleName OccName	Qualified name A qualified name written by the user in source code. The module isn't necessarily the module where the thing is defined; just the one from which it is imported. Examples are `Bar.x`, `Bar.y` or `Bar.Foo`. Create such a `RdrName` with `mkRdrQual`
Orig Module OccName	Original name An original name; the module is the defining module. This is used when GHC generates code that will be fed into the renamer (e.g. from deriving clauses), but where we want to say "Use Prelude.map dammit". One of these can be created with `mkOrig`
Exact Name	Exact name We know exactly the `Name`. This is used: When the parser parses built-in syntax like `[]` and `(,)`, but wants a `RdrName` from it By Template Haskell, when TH has generated a unique name Such a `RdrName` can be created by using `getRdrName` on a `Name`

Instances

Instances details

Data RdrName
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RdrName -> c RdrName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RdrName # toConstr :: RdrName -> Constr # dataTypeOf :: RdrName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RdrName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RdrName) # gmapT :: (forall b. Data b => b -> b) -> RdrName -> RdrName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r # gmapQ :: (forall d. Data d => d -> u) -> RdrName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> RdrName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName #
DisambInfixOp RdrName
Instance details Defined in GHC.Parser.PostProcess Methods mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN RdrName) # mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN RdrName) # mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located RdrName) #
HasOccName RdrName
Instance details Defined in GHC.Types.Name.Reader Methods occName :: RdrName -> OccName #
Outputable RdrName
Instance details Defined in GHC.Types.Name.Reader Methods ppr :: RdrName -> SDoc #
OutputableBndr RdrName
Instance details Defined in GHC.Types.Name.Reader Methods pprBndr :: BindingSite -> RdrName -> SDoc # pprPrefixOcc :: RdrName -> SDoc # pprInfixOcc :: RdrName -> SDoc # bndrIsJoin_maybe :: RdrName -> Maybe Int #
Eq RdrName
Instance details Defined in GHC.Types.Name.Reader Methods (==) :: RdrName -> RdrName -> Bool # (/=) :: RdrName -> RdrName -> Bool #
Ord RdrName
Instance details Defined in GHC.Types.Name.Reader Methods compare :: RdrName -> RdrName -> Ordering # (<) :: RdrName -> RdrName -> Bool # (<=) :: RdrName -> RdrName -> Bool # (>) :: RdrName -> RdrName -> Bool # (>=) :: RdrName -> RdrName -> Bool # max :: RdrName -> RdrName -> RdrName # min :: RdrName -> RdrName -> RdrName #
type Anno RdrName
Instance details Defined in GHC.Hs.Extension type Anno RdrName = SrcSpanAnnN
type Anno (LocatedN RdrName)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN RdrName) = SrcSpan
type Anno [LocatedN RdrName]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN RdrName] = SrcSpan

type Id = Var #

Identifier

data Subst #

Type & coercion & id substitution

The Subst data type defined in this module contains substitution for tyvar, covar and id. However, operations on IdSubstEnv (mapping from Id to CoreExpr) that require the definition of the Expr data type are defined in GHC.Core.Subst to avoid circular module dependency.

Constructors

Subst InScopeSet IdSubstEnv TvSubstEnv CvSubstEnv

Instances

Instances details

Outputable Subst
Instance details Defined in GHC.Core.TyCo.Subst Methods ppr :: Subst -> SDoc #

data NoExtField #

A placeholder type for TTG extension points that are not currently unused to represent any particular value.

This should not be confused with DataConCantHappen, which are found in unused extension constructors and therefore should never be inhabited. In contrast, NoExtField is used in extension points (e.g., as the field of some constructor), so it must have an inhabitant to construct AST passes that manipulate fields with that extension point as their type.

Constructors

NoExtField

Instances

Instances details

Data NoExtField
Instance details Defined in Language.Haskell.Syntax.Extension Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NoExtField -> c NoExtField # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NoExtField # toConstr :: NoExtField -> Constr # dataTypeOf :: NoExtField -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NoExtField) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NoExtField) # gmapT :: (forall b. Data b => b -> b) -> NoExtField -> NoExtField # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NoExtField -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NoExtField -> r # gmapQ :: (forall d. Data d => d -> u) -> NoExtField -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NoExtField -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField #
Eq NoExtField
Instance details Defined in Language.Haskell.Syntax.Extension Methods (==) :: NoExtField -> NoExtField -> Bool # (/=) :: NoExtField -> NoExtField -> Bool #
Ord NoExtField
Instance details Defined in Language.Haskell.Syntax.Extension Methods compare :: NoExtField -> NoExtField -> Ordering # (<) :: NoExtField -> NoExtField -> Bool # (<=) :: NoExtField -> NoExtField -> Bool # (>) :: NoExtField -> NoExtField -> Bool # (>=) :: NoExtField -> NoExtField -> Bool # max :: NoExtField -> NoExtField -> NoExtField # min :: NoExtField -> NoExtField -> NoExtField #
ToHie (Context (Located NoExtField))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

data TcGblEnv #

TcGblEnv describes the top-level of the module at the point at which the typechecker is finished work. It is this structure that is handed on to the desugarer For state that needs to be updated during the typechecking phase and returned at end, use a TcRef (= IORef).

Constructors

TcGblEnv

Fields

tcg_mod :: Module
Module being compiled
tcg_semantic_mod :: Module
If a signature, the backing module See also Note [Identity versus semantic module]
tcg_src :: HscSource
What kind of module (regular Haskell, hs-boot, hsig)
tcg_rdr_env :: GlobalRdrEnv
Top level envt; used during renaming
tcg_default :: Maybe [Type]
Types used for defaulting. Nothing => no default decl
tcg_fix_env :: FixityEnv
Just for things in this module
tcg_field_env :: RecFieldEnv
Just for things in this module See Note [The interactive package] in GHC.Runtime.Context
tcg_type_env :: TypeEnv
Global type env for the module we are compiling now. All TyCons and Classes (for this module) end up in here right away, along with their derived constructors, selectors.
(Ids defined in this module start in the local envt, though they move to the global envt during zonking)
NB: for what "things in this module" means, see Note [The interactive package] in GHC.Runtime.Context
tcg_type_env_var :: KnotVars (IORef TypeEnv)
tcg_inst_env :: !InstEnv
Instance envt for all home-package modules; Includes the dfuns in tcg_insts NB. BangPattern is to fix a leak, see #15111
tcg_fam_inst_env :: !FamInstEnv
Ditto for family instances NB. BangPattern is to fix a leak, see #15111
tcg_ann_env :: AnnEnv
And for annotations
tcg_exports :: [AvailInfo]
What is exported
tcg_imports :: ImportAvails
Information about what was imported from where, including things bound in this module. Also store Safe Haskell info here about transitive trusted package requirements.
There are not many uses of this field, so you can grep for all them.
The ImportAvails records information about the following things:
1. All of the modules you directly imported (tcRnImports)
2. The orphans (only!) of all imported modules in a GHCi session (runTcInteractive)
3. The module that instantiated a signature
4. Each of the signatures that merged in
It is used in the following ways: - imp_orphs is used to determine what orphan modules should be visible in the context (tcVisibleOrphanMods) - imp_finsts is used to determine what family instances should be visible (tcExtendLocalFamInstEnv) - To resolve the meaning of the export list of a module (tcRnExports) - imp_mods is used to compute usage info (mkIfaceTc, deSugar) - imp_trust_own_pkg is used for Safe Haskell in interfaces (mkIfaceTc, as well as in GHC.Driver.Main) - To create the Dependencies field in interface (mkDependencies)
tcg_dus :: DefUses
tcg_used_gres :: TcRef [GlobalRdrElt]
tcg_keep :: TcRef NameSet
tcg_th_used :: TcRef Bool
True <=> Template Haskell syntax used.
We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.
tcg_th_splice_used :: TcRef Bool
True <=> A Template Haskell splice was used.
Splices disable recompilation avoidance (see #481)
tcg_th_needed_deps :: TcRef ([Linkable], PkgsLoaded)
The set of runtime dependencies required by this module See Note [Object File Dependencies]
tcg_dfun_n :: TcRef OccSet
Allows us to choose unique DFun names.
tcg_merged :: [(Module, Fingerprint)]
The requirements we merged with; we always have to recompile if any of these changed.
tcg_rn_exports :: Maybe [(LIE GhcRn, Avails)]
tcg_rn_imports :: [LImportDecl GhcRn]
tcg_rn_decls :: Maybe (HsGroup GhcRn)
Renamed decls, maybe. Nothing <=> Don't retain renamed decls.
tcg_dependent_files :: TcRef [FilePath]
dependencies from addDependentFile
tcg_th_topdecls :: TcRef [LHsDecl GhcPs]
Top-level declarations from addTopDecls
tcg_th_foreign_files :: TcRef [(ForeignSrcLang, FilePath)]
Foreign files emitted from TH.
tcg_th_topnames :: TcRef NameSet
Exact names bound in top-level declarations in tcg_th_topdecls
tcg_th_modfinalizers :: TcRef [(TcLclEnv, ThModFinalizers)]
Template Haskell module finalizers.
They can use particular local environments.
tcg_th_coreplugins :: TcRef [String]
Core plugins added by Template Haskell code.
tcg_th_state :: TcRef (Map TypeRep Dynamic)
tcg_th_remote_state :: TcRef (Maybe (ForeignRef (IORef QState)))
Template Haskell state
tcg_th_docs :: TcRef THDocs
Docs added in Template Haskell via putDoc.
tcg_ev_binds :: Bag EvBind
tcg_tr_module :: Maybe Id
tcg_binds :: LHsBinds GhcTc
tcg_sigs :: NameSet
tcg_imp_specs :: [LTcSpecPrag]
tcg_warns :: Warnings GhcRn
tcg_anns :: [Annotation]
tcg_tcs :: [TyCon]
tcg_ksigs :: NameSet
tcg_insts :: [ClsInst]
tcg_fam_insts :: [FamInst]
tcg_rules :: [LRuleDecl GhcTc]
tcg_fords :: [LForeignDecl GhcTc]
tcg_patsyns :: [PatSyn]
tcg_doc_hdr :: Maybe (LHsDoc GhcRn)
Maybe Haddock header docs
tcg_hpc :: !AnyHpcUsage
True if any part of the prog uses hpc instrumentation. NB. BangPattern is to fix a leak, see #15111
tcg_self_boot :: SelfBootInfo
Whether this module has a corresponding hi-boot file
tcg_main :: Maybe Name
The Name of the main function, if this module is the main module.
tcg_safe_infer :: TcRef Bool
Has the typechecker inferred this module as -XSafe (Safe Haskell)? See Note [Safe Haskell Overlapping Instances Implementation], although this is used for more than just that failure case.
tcg_safe_infer_reasons :: TcRef (Messages TcRnMessage)
Unreported reasons why tcg_safe_infer is False. INVARIANT: If this Messages is non-empty, then tcg_safe_infer is False. It may be that tcg_safe_infer is False but this is empty, if no reasons are supplied (#19714), or if those reasons have already been reported by GHC.Driver.Main.markUnsafeInfer
tcg_tc_plugin_solvers :: [TcPluginSolver]
A list of user-defined type-checking plugins for constraint solving.
tcg_tc_plugin_rewriters :: UniqFM TyCon [TcPluginRewriter]
A collection of all the user-defined type-checking plugins for rewriting type family applications, collated by their type family TyCons.
tcg_defaulting_plugins :: [FillDefaulting]
A list of user-defined plugins for type defaulting plugins.
tcg_hf_plugins :: [HoleFitPlugin]
A list of user-defined plugins for hole fit suggestions.
tcg_top_loc :: RealSrcSpan
The RealSrcSpan this module came from
tcg_static_wc :: TcRef WantedConstraints
Wanted constraints of static forms. See Note [Constraints in static forms].
tcg_complete_matches :: !CompleteMatches
Tracking indices for cost centre annotations
tcg_cc_st :: TcRef CostCentreState
tcg_next_wrapper_num :: TcRef (ModuleEnv Int)
See Note [Generating fresh names for FFI wrappers]

Instances

Instances details

ContainsModule TcGblEnv
Instance details Defined in GHC.Tc.Types Methods extractModule :: TcGblEnv -> Module #

data DynFlags #

Contains not only a collection of GeneralFlags but also a plethora of information relating to the compilation of a single file or GHC session

data ForeignSrcLang #

Foreign formats supported by GHC via TH

Constructors

LangC	C
LangCxx	C++
LangObjc	Objective C
LangObjcxx	Objective C++
LangAsm	Assembly language (.s)
LangJs	JavaScript
RawObject	Object (.o)

Instances

Instances details

Generic ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Associated Types type Rep ForeignSrcLang :: Type -> Type # Methods from :: ForeignSrcLang -> Rep ForeignSrcLang x # to :: Rep ForeignSrcLang x -> ForeignSrcLang #
Show ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods showsPrec :: Int -> ForeignSrcLang -> ShowS # show :: ForeignSrcLang -> String # showList :: [ForeignSrcLang] -> ShowS #
Eq ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type Methods (==) :: ForeignSrcLang -> ForeignSrcLang -> Bool # (/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #
type Rep ForeignSrcLang
Instance details Defined in GHC.ForeignSrcLang.Type type Rep ForeignSrcLang = D1 ('MetaData "ForeignSrcLang" "GHC.ForeignSrcLang.Type" "ghc-boot-th-9.6.3" 'False) ((C1 ('MetaCons "LangC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "LangCxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LangObjc" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "LangObjcxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LangAsm" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LangJs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RawObject" 'PrefixI 'False) (U1 :: Type -> Type))))

data PlainGhcException #

This type is very similar to GhcException, but it omits the constructors that involve pretty-printing via SDoc. Due to the implementation of fromException for GhcException, this type can be caught as a GhcException.

Note that this should only be used for throwing exceptions, not for catching, as GhcException will not be converted to this type when catching.

Instances

Instances details

Exception PlainGhcException
Instance details Defined in GHC.Utils.Panic.Plain Methods toException :: PlainGhcException -> SomeException # fromException :: SomeException -> Maybe PlainGhcException # displayException :: PlainGhcException -> String #
Show PlainGhcException
Instance details Defined in GHC.Utils.Panic.Plain Methods showsPrec :: Int -> PlainGhcException -> ShowS # show :: PlainGhcException -> String # showList :: [PlainGhcException] -> ShowS #

data SrcUnpackedness #

Source Unpackedness

What unpackedness the user requested

Constructors

SrcUnpack	{-# UNPACK #-} specified
SrcNoUnpack	{-# NOUNPACK #-} specified
NoSrcUnpack	no unpack pragma

Instances

Instances details

Data SrcUnpackedness
Instance details Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcUnpackedness -> c SrcUnpackedness # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcUnpackedness # toConstr :: SrcUnpackedness -> Constr # dataTypeOf :: SrcUnpackedness -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcUnpackedness) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcUnpackedness) # gmapT :: (forall b. Data b => b -> b) -> SrcUnpackedness -> SrcUnpackedness # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r # gmapQ :: (forall d. Data d => d -> u) -> SrcUnpackedness -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcUnpackedness -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness #
Eq SrcUnpackedness
Instance details Defined in Language.Haskell.Syntax.Basic Methods (==) :: SrcUnpackedness -> SrcUnpackedness -> Bool # (/=) :: SrcUnpackedness -> SrcUnpackedness -> Bool #

data SrcStrictness #

Source Strictness

What strictness annotation the user wrote

Constructors

SrcLazy	Lazy, ie `~`
SrcStrict	Strict, ie `!`
NoSrcStrict	no strictness annotation

Instances

Instances details

Data SrcStrictness
Instance details Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcStrictness -> c SrcStrictness # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcStrictness # toConstr :: SrcStrictness -> Constr # dataTypeOf :: SrcStrictness -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcStrictness) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcStrictness) # gmapT :: (forall b. Data b => b -> b) -> SrcStrictness -> SrcStrictness # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r # gmapQ :: (forall d. Data d => d -> u) -> SrcStrictness -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcStrictness -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness #
Eq SrcStrictness
Instance details Defined in Language.Haskell.Syntax.Basic Methods (==) :: SrcStrictness -> SrcStrictness -> Bool # (/=) :: SrcStrictness -> SrcStrictness -> Bool #

data Role #

See Note [Roles] in GHC.Core.Coercion

Order of constructors matters: the Ord instance coincides with the *super*typing relation on roles.

Constructors

Nominal
Representational
Phantom

Instances

Instances details

Data Role
Instance details Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role -> c Role # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Role # toConstr :: Role -> Constr # dataTypeOf :: Role -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Role) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Role) # gmapT :: (forall b. Data b => b -> b) -> Role -> Role # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r # gmapQ :: (forall d. Data d => d -> u) -> Role -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Role -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role -> m Role # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role #
Eq Role
Instance details Defined in Language.Haskell.Syntax.Basic Methods (==) :: Role -> Role -> Bool # (/=) :: Role -> Role -> Bool #
Ord Role
Instance details Defined in Language.Haskell.Syntax.Basic Methods compare :: Role -> Role -> Ordering # (<) :: Role -> Role -> Bool # (<=) :: Role -> Role -> Bool # (>) :: Role -> Role -> Bool # (>=) :: Role -> Role -> Bool # max :: Role -> Role -> Role # min :: Role -> Role -> Role #
type Anno (Maybe Role)
Instance details Defined in GHC.Hs.Decls type Anno (Maybe Role) = SrcAnn NoEpAnns
type Anno (Maybe Role)
Instance details Defined in GHC.Hs.Decls type Anno (Maybe Role) = SrcAnn NoEpAnns

data FieldLabelString #

Field labels are just represented as strings; they are not necessarily unique (even within a module)

Instances

Instances details

Data FieldLabelString
Instance details Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldLabelString -> c FieldLabelString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FieldLabelString # toConstr :: FieldLabelString -> Constr # dataTypeOf :: FieldLabelString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FieldLabelString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FieldLabelString) # gmapT :: (forall b. Data b => b -> b) -> FieldLabelString -> FieldLabelString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabelString -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabelString -> r # gmapQ :: (forall d. Data d => d -> u) -> FieldLabelString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldLabelString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldLabelString -> m FieldLabelString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabelString -> m FieldLabelString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabelString -> m FieldLabelString #
NFData FieldLabelString
Instance details Defined in Language.Haskell.Syntax.Basic Methods rnf :: FieldLabelString -> () #
Eq FieldLabelString
Instance details Defined in Language.Haskell.Syntax.Basic Methods (==) :: FieldLabelString -> FieldLabelString -> Bool # (/=) :: FieldLabelString -> FieldLabelString -> Bool #
type Anno FieldLabelString
Instance details Defined in GHC.Hs.Expr type Anno FieldLabelString = SrcSpanAnnN

type ConTag = Int #

A *one-index* constructor tag

Type of the tags associated with each constructor possibility or superclass selector

data Boxity #

Constructors

Boxed
Unboxed

Instances

Instances details

Data Boxity
Instance details Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Boxity -> c Boxity # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Boxity # toConstr :: Boxity -> Constr # dataTypeOf :: Boxity -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Boxity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boxity) # gmapT :: (forall b. Data b => b -> b) -> Boxity -> Boxity # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r # gmapQ :: (forall d. Data d => d -> u) -> Boxity -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Boxity -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity #
Eq Boxity
Instance details Defined in Language.Haskell.Syntax.Basic Methods (==) :: Boxity -> Boxity -> Bool # (/=) :: Boxity -> Boxity -> Bool #

type family NoGhcTc p #

See Note [NoGhcTc] in GHC.Hs.Extension. It has to be in this module because it is used like an extension point (in the data definitions of types that should be parameter-agnostic.

Instances

Instances details

type NoGhcTc (GhcPass pass)	Marks that a field uses the GhcRn variant even when the pass parameter is GhcTc. Useful for storing HsTypes in GHC.Hs.Exprs, say, because HsType GhcTc should never occur. See Note [NoGhcTc]
Instance details Defined in GHC.Hs.Extension type NoGhcTc (GhcPass pass) = GhcPass (NoGhcTcPass pass)

type family XXIEWrappedName p #

Instances

Instances details

type XXIEWrappedName (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXIEWrappedName (GhcPass _1) = DataConCantHappen

type family XIEType p #

Instances

Instances details

type XIEType (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEType (GhcPass _1) = EpaLocation

type family XIEPattern p #

Instances

Instances details

type XIEPattern (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEPattern (GhcPass _1) = EpaLocation

type family XIEName p #

Instances

Instances details

type XIEName (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEName (GhcPass _1) = NoExtField

type family XXIE x #

Instances

Instances details

type XXIE (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXIE (GhcPass _1) = DataConCantHappen

type family XIEDocNamed x #

Instances

Instances details

type XIEDocNamed (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEDocNamed (GhcPass _1) = NoExtField

type family XIEDoc x #

Instances

Instances details

type XIEDoc (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEDoc (GhcPass _1) = NoExtField

type family XIEGroup x #

Instances

Instances details

type XIEGroup (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEGroup (GhcPass _1) = NoExtField

type family XIEModuleContents x #

Instances

Instances details

type XIEModuleContents GhcPs
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcPs = EpAnn [AddEpAnn]
type XIEModuleContents GhcRn
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcRn = NoExtField
type XIEModuleContents GhcTc
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcTc = NoExtField

type family XIEThingWith x #

Instances

Instances details

type XIEThingWith (GhcPass 'Parsed)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Parsed) = EpAnn [AddEpAnn]
type XIEThingWith (GhcPass 'Renamed)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Renamed) = [Located FieldLabel]
type XIEThingWith (GhcPass 'Typechecked)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Typechecked) = NoExtField

type family XIEThingAll x #

Instances

Instances details

type XIEThingAll (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEThingAll (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEThingAbs x #

Instances

Instances details

type XIEThingAbs (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEThingAbs (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEVar x #

Instances

Instances details

type XIEVar GhcPs
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcPs = NoExtField
type XIEVar GhcRn
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcRn = NoExtField
type XIEVar GhcTc
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcTc = NoExtField

type family ImportDeclPkgQual x #

Instances

Instances details

type ImportDeclPkgQual GhcPs
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcPs = RawPkgQual
type ImportDeclPkgQual GhcRn
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcRn = PkgQual
type ImportDeclPkgQual GhcTc
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcTc = PkgQual

type family XXImportDecl x #

Instances

Instances details

type XXImportDecl (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXImportDecl (GhcPass _1) = DataConCantHappen

type family XCImportDecl x #

Instances

Instances details

type XCImportDecl GhcPs
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcPs = XImportDeclPass
type XCImportDecl GhcRn
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcRn = XImportDeclPass
type XCImportDecl GhcTc
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcTc = DataConCantHappen

type family XXFieldOcc x #

Instances

Instances details

type XXFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXFieldOcc (GhcPass _1) = DataConCantHappen

type family XCFieldOcc x #

Instances

Instances details

type XCFieldOcc GhcPs
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcPs = NoExtField
type XCFieldOcc GhcRn
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcRn = Name
type XCFieldOcc GhcTc
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcTc = Id

type family XXConDeclField x #

Instances

Instances details

type XXConDeclField (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXConDeclField (GhcPass _1) = DataConCantHappen

type family XConDeclField x #

Instances

Instances details

type XConDeclField (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XConDeclField (GhcPass _1) = EpAnn [AddEpAnn]

type family XXTyVarBndr x #

Instances

Instances details

type XXTyVarBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXTyVarBndr (GhcPass _1) = DataConCantHappen

type family XKindedTyVar x #

Instances

Instances details

type XKindedTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XKindedTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XUserTyVar x #

Instances

Instances details

type XUserTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XUserTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XXHsForAllTelescope x #

Instances

Instances details

type XXHsForAllTelescope (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsForAllTelescope (GhcPass _1) = DataConCantHappen

type family XHsForAllInvis x #

Instances

Instances details

type XHsForAllInvis (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsForAllInvis (GhcPass _1) = EpAnnForallTy

type family XHsForAllVis x #

Instances

Instances details

type XHsForAllVis (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsForAllVis (GhcPass _1) = EpAnnForallTy

type family XXTyLit x #

Instances

Instances details

type XXTyLit (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXTyLit (GhcPass _1) = DataConCantHappen

type family XCharTy x #

Instances

Instances details

type XCharTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XCharTy (GhcPass _1) = SourceText

type family XStrTy x #

Instances

Instances details

type XStrTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XStrTy (GhcPass _1) = SourceText

type family XNumTy x #

Instances

Instances details

type XNumTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XNumTy (GhcPass _1) = SourceText

type family XXType x #

Instances

Instances details

type XXType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXType (GhcPass _1) = HsCoreTy

type family XWildCardTy x #

Instances

Instances details

type XWildCardTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XWildCardTy (GhcPass _1) = NoExtField

type family XTyLit x #

Instances

Instances details

type XTyLit (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTyLit (GhcPass _1) = NoExtField

type family XExplicitTupleTy x #

Instances

Instances details

type XExplicitTupleTy GhcPs
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcPs = EpAnn [AddEpAnn]
type XExplicitTupleTy GhcRn
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcRn = NoExtField
type XExplicitTupleTy GhcTc
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcTc = [Kind]

type family XExplicitListTy x #

Instances

Instances details

type XExplicitListTy GhcPs
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcPs = EpAnn [AddEpAnn]
type XExplicitListTy GhcRn
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcRn = NoExtField
type XExplicitListTy GhcTc
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcTc = Kind

type family XRecTy x #

Instances

Instances details

type XRecTy GhcPs
Instance details Defined in GHC.Hs.Type type XRecTy GhcPs = EpAnn AnnList
type XRecTy GhcRn
Instance details Defined in GHC.Hs.Type type XRecTy GhcRn = NoExtField
type XRecTy GhcTc
Instance details Defined in GHC.Hs.Type type XRecTy GhcTc = NoExtField

type family XBangTy x #

Instances

Instances details

type XBangTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XBangTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XDocTy x #

Instances

Instances details

type XDocTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XDocTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XSpliceTy x #

Instances

Instances details

type XSpliceTy GhcPs
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcPs = NoExtField
type XSpliceTy GhcRn
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcRn = HsUntypedSpliceResult (LHsType GhcRn)
type XSpliceTy GhcTc
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcTc = Kind

type family XKindSig x #

Instances

Instances details

type XKindSig (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XKindSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XStarTy x #

Instances

Instances details

type XStarTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XStarTy (GhcPass _1) = NoExtField

type family XIParamTy x #

Instances

Instances details

type XIParamTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XIParamTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XParTy x #

Instances

Instances details

type XParTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XParTy (GhcPass _1) = EpAnn AnnParen

type family XOpTy x #

Instances

Instances details

type XOpTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XOpTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XSumTy x #

Instances

Instances details

type XSumTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XSumTy (GhcPass _1) = EpAnn AnnParen

type family XTupleTy x #

Instances

Instances details

type XTupleTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTupleTy (GhcPass _1) = EpAnn AnnParen

type family XListTy x #

Instances

Instances details

type XListTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XListTy (GhcPass _1) = EpAnn AnnParen

type family XFunTy x #

Instances

Instances details

type XFunTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XFunTy (GhcPass _1) = EpAnnCO

type family XAppKindTy x #

Instances

Instances details

type XAppKindTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XAppKindTy (GhcPass _1) = SrcSpan

type family XAppTy x #

Instances

Instances details

type XAppTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XAppTy (GhcPass _1) = NoExtField

type family XTyVar x #

Instances

Instances details

type XTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XQualTy x #

Instances

Instances details

type XQualTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XQualTy (GhcPass _1) = NoExtField

type family XForAllTy x #

Instances

Instances details

type XForAllTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XForAllTy (GhcPass _1) = NoExtField

type family XXHsPatSigType x #

Instances

Instances details

type XXHsPatSigType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsPatSigType (GhcPass _1) = DataConCantHappen

type family XHsPS x #

Instances

Instances details

type XHsPS GhcPs
Instance details Defined in GHC.Hs.Type type XHsPS GhcPs = EpAnnCO
type XHsPS GhcRn
Instance details Defined in GHC.Hs.Type type XHsPS GhcRn = HsPSRn
type XHsPS GhcTc
Instance details Defined in GHC.Hs.Type type XHsPS GhcTc = HsPSRn

type family XXHsWildCardBndrs x b #

Instances

Instances details

type XXHsWildCardBndrs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Type type XXHsWildCardBndrs (GhcPass _1) _2 = DataConCantHappen

type family XHsWC x b #

Instances

Instances details

type XHsWC GhcPs b
Instance details Defined in GHC.Hs.Type type XHsWC GhcPs b = NoExtField
type XHsWC GhcRn b
Instance details Defined in GHC.Hs.Type type XHsWC GhcRn b = [Name]
type XHsWC GhcTc b
Instance details Defined in GHC.Hs.Type type XHsWC GhcTc b = [Name]

type family XXHsSigType x #

Instances

Instances details

type XXHsSigType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsSigType (GhcPass _1) = DataConCantHappen

type family XHsSig x #

Instances

Instances details

type XHsSig (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsSig (GhcPass _1) = NoExtField

type family XXHsOuterTyVarBndrs x #

Instances

Instances details

type XXHsOuterTyVarBndrs (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsOuterTyVarBndrs (GhcPass _1) = DataConCantHappen

type family XHsOuterExplicit x flag #

Instances

Instances details

type XHsOuterExplicit GhcPs _1
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcPs _1 = EpAnnForallTy
type XHsOuterExplicit GhcRn _1
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcRn _1 = NoExtField
type XHsOuterExplicit GhcTc flag
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcTc flag = [VarBndr TyVar flag]

type family XHsOuterImplicit x #

Instances

Instances details

type XHsOuterImplicit GhcPs
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcPs = NoExtField
type XHsOuterImplicit GhcRn
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcRn = [Name]
type XHsOuterImplicit GhcTc
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcTc = [TyVar]

type family XXLHsQTyVars x #

Instances

Instances details

type XXLHsQTyVars (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXLHsQTyVars (GhcPass _1) = DataConCantHappen

type family XHsQTvs x #

Instances

Instances details

type XHsQTvs GhcPs
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcPs = NoExtField
type XHsQTvs GhcRn
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcRn = HsQTvsRn
type XHsQTvs GhcTc
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcTc = HsQTvsRn

type family XHsFieldBind x #

Instances

Instances details

type XHsFieldBind _1
Instance details Defined in GHC.Hs.Pat type XHsFieldBind _1 = EpAnn [AddEpAnn]

type family XXPat x #

Instances

Instances details

type XXPat GhcPs
Instance details Defined in GHC.Hs.Pat type XXPat GhcPs = DataConCantHappen
type XXPat GhcRn
Instance details Defined in GHC.Hs.Pat type XXPat GhcRn = HsPatExpansion (Pat GhcRn) (Pat GhcRn)
type XXPat GhcTc
Instance details Defined in GHC.Hs.Pat type XXPat GhcTc = XXPatGhcTc

type family XCoPat x #

type family XSigPat x #

Instances

Instances details

type XSigPat GhcPs
Instance details Defined in GHC.Hs.Pat type XSigPat GhcPs = EpAnn [AddEpAnn]
type XSigPat GhcRn
Instance details Defined in GHC.Hs.Pat type XSigPat GhcRn = NoExtField
type XSigPat GhcTc
Instance details Defined in GHC.Hs.Pat type XSigPat GhcTc = Type

type family XNPlusKPat x #

Instances

Instances details

type XNPlusKPat GhcPs
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcPs = EpAnn EpaLocation
type XNPlusKPat GhcRn
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcRn = NoExtField
type XNPlusKPat GhcTc
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcTc = Type

type family XNPat x #

Instances

Instances details

type XNPat GhcPs
Instance details Defined in GHC.Hs.Pat type XNPat GhcPs = EpAnn [AddEpAnn]
type XNPat GhcRn
Instance details Defined in GHC.Hs.Pat type XNPat GhcRn = EpAnn [AddEpAnn]
type XNPat GhcTc
Instance details Defined in GHC.Hs.Pat type XNPat GhcTc = Type

type family XLitPat x #

Instances

Instances details

type XLitPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XLitPat (GhcPass _1) = NoExtField

type family XSplicePat x #

Instances

Instances details

type XSplicePat GhcPs
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcPs = NoExtField
type XSplicePat GhcRn
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcRn = HsUntypedSpliceResult (Pat GhcRn)
type XSplicePat GhcTc
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcTc = DataConCantHappen

type family XViewPat x #

Instances

Instances details

type XViewPat GhcPs
Instance details Defined in GHC.Hs.Pat type XViewPat GhcPs = EpAnn [AddEpAnn]
type XViewPat GhcRn
Instance details Defined in GHC.Hs.Pat type XViewPat GhcRn = Maybe (HsExpr GhcRn)
type XViewPat GhcTc
Instance details Defined in GHC.Hs.Pat type XViewPat GhcTc = Type

type family XConPat x #

Instances

Instances details

type XConPat GhcPs
Instance details Defined in GHC.Hs.Pat type XConPat GhcPs = EpAnn [AddEpAnn]
type XConPat GhcRn
Instance details Defined in GHC.Hs.Pat type XConPat GhcRn = NoExtField
type XConPat GhcTc
Instance details Defined in GHC.Hs.Pat type XConPat GhcTc = ConPatTc

type family XSumPat x #

Instances

Instances details

type XSumPat GhcPs
Instance details Defined in GHC.Hs.Pat type XSumPat GhcPs = EpAnn EpAnnSumPat
type XSumPat GhcRn
Instance details Defined in GHC.Hs.Pat type XSumPat GhcRn = NoExtField
type XSumPat GhcTc
Instance details Defined in GHC.Hs.Pat type XSumPat GhcTc = [Type]

type family XTuplePat x #

Instances

Instances details

type XTuplePat GhcPs
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcPs = EpAnn [AddEpAnn]
type XTuplePat GhcRn
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcRn = NoExtField
type XTuplePat GhcTc
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcTc = [Type]

type family XListPat x #

Instances

Instances details

type XListPat GhcPs
Instance details Defined in GHC.Hs.Pat type XListPat GhcPs = EpAnn AnnList
type XListPat GhcRn
Instance details Defined in GHC.Hs.Pat type XListPat GhcRn = NoExtField
type XListPat GhcTc
Instance details Defined in GHC.Hs.Pat type XListPat GhcTc = Type

type family XBangPat x #

Instances

Instances details

type XBangPat GhcPs
Instance details Defined in GHC.Hs.Pat type XBangPat GhcPs = EpAnn [AddEpAnn]
type XBangPat GhcRn
Instance details Defined in GHC.Hs.Pat type XBangPat GhcRn = NoExtField
type XBangPat GhcTc
Instance details Defined in GHC.Hs.Pat type XBangPat GhcTc = NoExtField

type family XParPat x #

Instances

Instances details

type XParPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XParPat (GhcPass _1) = EpAnnCO

type family XAsPat x #

Instances

Instances details

type XAsPat GhcPs
Instance details Defined in GHC.Hs.Pat type XAsPat GhcPs = EpAnnCO
type XAsPat GhcRn
Instance details Defined in GHC.Hs.Pat type XAsPat GhcRn = NoExtField
type XAsPat GhcTc
Instance details Defined in GHC.Hs.Pat type XAsPat GhcTc = NoExtField

type family XLazyPat x #

Instances

Instances details

type XLazyPat GhcPs
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcPs = EpAnn [AddEpAnn]
type XLazyPat GhcRn
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcRn = NoExtField
type XLazyPat GhcTc
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcTc = NoExtField

type family XVarPat x #

Instances

Instances details

type XVarPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XVarPat (GhcPass _1) = NoExtField

type family XWildPat x #

Instances

Instances details

type XWildPat GhcPs
Instance details Defined in GHC.Hs.Pat type XWildPat GhcPs = NoExtField
type XWildPat GhcRn
Instance details Defined in GHC.Hs.Pat type XWildPat GhcRn = NoExtField
type XWildPat GhcTc
Instance details Defined in GHC.Hs.Pat type XWildPat GhcTc = Type

type family XXOverLit x #

Instances

Instances details

type XXOverLit (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XXOverLit (GhcPass _1) = DataConCantHappen

type family XOverLit x #

Instances

Instances details

type XOverLit GhcPs
Instance details Defined in GHC.Hs.Lit type XOverLit GhcPs = NoExtField
type XOverLit GhcRn
Instance details Defined in GHC.Hs.Lit type XOverLit GhcRn = OverLitRn
type XOverLit GhcTc
Instance details Defined in GHC.Hs.Lit type XOverLit GhcTc = OverLitTc

type family XXLit x #

Instances

Instances details

type XXLit (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XXLit (GhcPass _1) = DataConCantHappen

type family XHsDoublePrim x #

Instances

Instances details

type XHsDoublePrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsDoublePrim (GhcPass _1) = NoExtField

type family XHsFloatPrim x #

Instances

Instances details

type XHsFloatPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsFloatPrim (GhcPass _1) = NoExtField

type family XHsRat x #

Instances

Instances details

type XHsRat (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsRat (GhcPass _1) = NoExtField

type family XHsInteger x #

Instances

Instances details

type XHsInteger (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInteger (GhcPass _1) = SourceText

type family XHsWord64Prim x #

Instances

Instances details

type XHsWord64Prim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsWord64Prim (GhcPass _1) = SourceText

type family XHsInt64Prim x #

Instances

Instances details

type XHsInt64Prim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInt64Prim (GhcPass _1) = SourceText

type family XHsWordPrim x #

Instances

Instances details

type XHsWordPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsWordPrim (GhcPass _1) = SourceText

type family XHsIntPrim x #

Instances

Instances details

type XHsIntPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsIntPrim (GhcPass _1) = SourceText

type family XHsInt x #

Instances

Instances details

type XHsInt (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInt (GhcPass _1) = NoExtField

type family XHsStringPrim x #

Instances

Instances details

type XHsStringPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsStringPrim (GhcPass _1) = SourceText

type family XHsString x #

Instances

Instances details

type XHsString (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsString (GhcPass _1) = SourceText

type family XHsCharPrim x #

Instances

Instances details

type XHsCharPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsCharPrim (GhcPass _1) = SourceText

type family XHsChar x #

Instances

Instances details

type XHsChar (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsChar (GhcPass _1) = SourceText

type family XXApplicativeArg x #

Instances

Instances details

type XXApplicativeArg (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXApplicativeArg (GhcPass _1) = DataConCantHappen

type family XApplicativeArgMany x #

Instances

Instances details

type XApplicativeArgMany (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XApplicativeArgMany (GhcPass _1) = NoExtField

type family XApplicativeArgOne x #

Instances

Instances details

type XApplicativeArgOne GhcPs
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcPs = NoExtField
type XApplicativeArgOne GhcRn
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcRn = FailOperator GhcRn
type XApplicativeArgOne GhcTc
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcTc = FailOperator GhcTc

type family XXParStmtBlock x x' #

Instances

Instances details

type XXParStmtBlock (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Expr type XXParStmtBlock (GhcPass pL) (GhcPass pR) = DataConCantHappen

type family XParStmtBlock x x' #

Instances

Instances details

type XParStmtBlock (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Expr type XParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtField

type family XXCmd x #

Instances

Instances details

type XXCmd GhcPs
Instance details Defined in GHC.Hs.Expr type XXCmd GhcPs = DataConCantHappen
type XXCmd GhcRn
Instance details Defined in GHC.Hs.Expr type XXCmd GhcRn = DataConCantHappen
type XXCmd GhcTc
Instance details Defined in GHC.Hs.Expr type XXCmd GhcTc = HsWrap HsCmd

type family XCmdWrap x #

Instances

Instances details

type XCmdWrap (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdWrap (GhcPass _1) = NoExtField

type family XCmdDo x #

Instances

Instances details

type XCmdDo GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcPs = EpAnn AnnList
type XCmdDo GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcRn = NoExtField
type XCmdDo GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcTc = Type

type family XCmdLet x #

Instances

Instances details

type XCmdLet GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcPs = EpAnnCO
type XCmdLet GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcRn = NoExtField
type XCmdLet GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcTc = NoExtField

type family XCmdIf x #

Instances

Instances details

type XCmdIf GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcPs = EpAnn AnnsIf
type XCmdIf GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcRn = NoExtField
type XCmdIf GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcTc = NoExtField

type family XCmdLamCase x #

Instances

Instances details

type XCmdLamCase (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XCmdCase x #

Instances

Instances details

type XCmdCase GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcPs = EpAnn EpAnnHsCase
type XCmdCase GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcRn = NoExtField
type XCmdCase GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcTc = NoExtField

type family XCmdPar x #

Instances

Instances details

type XCmdPar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdPar (GhcPass _1) = EpAnnCO

type family XCmdLam x #

Instances

Instances details

type XCmdLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdLam (GhcPass _1) = NoExtField

type family XCmdApp x #

Instances

Instances details

type XCmdApp (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdApp (GhcPass _1) = EpAnnCO

type family XCmdArrForm x #

Instances

Instances details

type XCmdArrForm GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcPs = EpAnn AnnList
type XCmdArrForm GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcRn = NoExtField
type XCmdArrForm GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcTc = NoExtField

type family XCmdArrApp x #

Instances

Instances details

type XCmdArrApp GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcPs = EpAnn AddEpAnn
type XCmdArrApp GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcRn = NoExtField
type XCmdArrApp GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcTc = Type

type family XXStmtLR x x' b #

Instances

Instances details

type XXStmtLR (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XXStmtLR (GhcPass _1) (GhcPass _2) b = DataConCantHappen

type family XRecStmt x x' b #

Instances

Instances details

type XRecStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcPs b = EpAnn AnnList
type XRecStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcRn b = NoExtField
type XRecStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcTc b = RecStmtTc

type family XTransStmt x x' b #

Instances

Instances details

type XTransStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]
type XTransStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcRn b = NoExtField
type XTransStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcTc b = Type

type family XParStmt x x' b #

Instances

Instances details

type XParStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcPs b = NoExtField
type XParStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcRn b = NoExtField
type XParStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcTc b = Type

type family XLetStmt x x' b #

Instances

Instances details

type XLetStmt (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XLetStmt (GhcPass _1) (GhcPass _2) b = EpAnn [AddEpAnn]

type family XBodyStmt x x' b #

Instances

Instances details

type XBodyStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcPs b = NoExtField
type XBodyStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcRn b = NoExtField
type XBodyStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcTc b = Type

type family XApplicativeStmt x x' b #

Instances

Instances details

type XApplicativeStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcPs b = NoExtField
type XApplicativeStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcRn b = NoExtField
type XApplicativeStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcTc b = Type

type family XBindStmt x x' b #

Instances

Instances details

type XBindStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]
type XBindStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcRn b = XBindStmtRn
type XBindStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcTc b = XBindStmtTc

type family XLastStmt x x' b #

Instances

Instances details

type XLastStmt (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XLastStmt (GhcPass _1) (GhcPass _2) b = NoExtField

type family XXGRHS x b #

Instances

Instances details

type XXGRHS (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXGRHS (GhcPass _1) b = DataConCantHappen

type family XCGRHS x b #

Instances

Instances details

type XCGRHS (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XCGRHS (GhcPass _1) _2 = EpAnn GrhsAnn

type family XXGRHSs x b #

Instances

Instances details

type XXGRHSs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XXGRHSs (GhcPass _1) _2 = DataConCantHappen

type family XCGRHSs x b #

Instances

Instances details

type XCGRHSs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XCGRHSs (GhcPass _1) _2 = EpAnnComments

type family XXMatch x b #

Instances

Instances details

type XXMatch (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXMatch (GhcPass _1) b = DataConCantHappen

type family XCMatch x b #

Instances

Instances details

type XCMatch (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XCMatch (GhcPass _1) b = EpAnn [AddEpAnn]

type family XXMatchGroup x b #

Instances

Instances details

type XXMatchGroup (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXMatchGroup (GhcPass _1) b = DataConCantHappen

type family XMG x b #

Instances

Instances details

type XMG GhcPs b
Instance details Defined in GHC.Hs.Expr type XMG GhcPs b = Origin
type XMG GhcRn b
Instance details Defined in GHC.Hs.Expr type XMG GhcRn b = Origin
type XMG GhcTc b
Instance details Defined in GHC.Hs.Expr type XMG GhcTc b = MatchGroupTc

type family XXCmdTop x #

Instances

Instances details

type XXCmdTop (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXCmdTop (GhcPass _1) = DataConCantHappen

type family XCmdTop x #

Instances

Instances details

type XCmdTop GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcPs = NoExtField
type XCmdTop GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcRn = CmdSyntaxTable GhcRn
type XCmdTop GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcTc = CmdTopTc

type family XXQuote x #

Instances

Instances details

type XXQuote GhcPs
Instance details Defined in GHC.Hs.Expr type XXQuote GhcPs = DataConCantHappen
type XXQuote GhcRn
Instance details Defined in GHC.Hs.Expr type XXQuote GhcRn = DataConCantHappen
type XXQuote GhcTc
Instance details Defined in GHC.Hs.Expr type XXQuote GhcTc = NoExtField

type family XVarBr x #

Instances

Instances details

type XVarBr GhcPs
Instance details Defined in GHC.Hs.Expr type XVarBr GhcPs = NoExtField
type XVarBr GhcRn
Instance details Defined in GHC.Hs.Expr type XVarBr GhcRn = NoExtField
type XVarBr GhcTc
Instance details Defined in GHC.Hs.Expr type XVarBr GhcTc = DataConCantHappen

type family XTypBr x #

Instances

Instances details

type XTypBr GhcPs
Instance details Defined in GHC.Hs.Expr type XTypBr GhcPs = NoExtField
type XTypBr GhcRn
Instance details Defined in GHC.Hs.Expr type XTypBr GhcRn = NoExtField
type XTypBr GhcTc
Instance details Defined in GHC.Hs.Expr type XTypBr GhcTc = DataConCantHappen

type family XDecBrG x #

Instances

Instances details

type XDecBrG GhcPs
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcPs = NoExtField
type XDecBrG GhcRn
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcRn = NoExtField
type XDecBrG GhcTc
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcTc = DataConCantHappen

type family XDecBrL x #

Instances

Instances details

type XDecBrL GhcPs
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcPs = NoExtField
type XDecBrL GhcRn
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcRn = NoExtField
type XDecBrL GhcTc
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcTc = DataConCantHappen

type family XPatBr x #

Instances

Instances details

type XPatBr GhcPs
Instance details Defined in GHC.Hs.Expr type XPatBr GhcPs = NoExtField
type XPatBr GhcRn
Instance details Defined in GHC.Hs.Expr type XPatBr GhcRn = NoExtField
type XPatBr GhcTc
Instance details Defined in GHC.Hs.Expr type XPatBr GhcTc = DataConCantHappen

type family XExpBr x #

Instances

Instances details

type XExpBr GhcPs
Instance details Defined in GHC.Hs.Expr type XExpBr GhcPs = NoExtField
type XExpBr GhcRn
Instance details Defined in GHC.Hs.Expr type XExpBr GhcRn = NoExtField
type XExpBr GhcTc
Instance details Defined in GHC.Hs.Expr type XExpBr GhcTc = DataConCantHappen

type family XXUntypedSplice x #

Instances

Instances details

type XXUntypedSplice p
Instance details Defined in GHC.Hs.Expr type XXUntypedSplice p = DataConCantHappen

type family XQuasiQuote x #

Instances

Instances details

type XQuasiQuote p
Instance details Defined in GHC.Hs.Expr type XQuasiQuote p = NoExtField

type family XUntypedSpliceExpr x #

Instances

Instances details

type XUntypedSpliceExpr GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcPs = EpAnn [AddEpAnn]
type XUntypedSpliceExpr GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcRn = EpAnn [AddEpAnn]
type XUntypedSpliceExpr GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcTc = DataConCantHappen

type family XXTupArg x #

Instances

Instances details

type XXTupArg (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXTupArg (GhcPass _1) = DataConCantHappen

type family XMissing x #

Instances

Instances details

type XMissing GhcPs
Instance details Defined in GHC.Hs.Expr type XMissing GhcPs = EpAnn EpaLocation
type XMissing GhcRn
Instance details Defined in GHC.Hs.Expr type XMissing GhcRn = NoExtField
type XMissing GhcTc
Instance details Defined in GHC.Hs.Expr type XMissing GhcTc = Scaled Type

type family XPresent x #

Instances

Instances details

type XPresent (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPresent (GhcPass _1) = EpAnn [AddEpAnn]

type family XXAmbiguousFieldOcc x #

Instances

Instances details

type XXAmbiguousFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXAmbiguousFieldOcc (GhcPass _1) = DataConCantHappen

type family XAmbiguous x #

Instances

Instances details

type XAmbiguous GhcPs
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcPs = NoExtField
type XAmbiguous GhcRn
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcRn = NoExtField
type XAmbiguous GhcTc
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcTc = Id

type family XUnambiguous x #

Instances

Instances details

type XUnambiguous GhcPs
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcPs = NoExtField
type XUnambiguous GhcRn
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcRn = Name
type XUnambiguous GhcTc
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcTc = Id

type family XXPragE x #

Instances

Instances details

type XXPragE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXPragE (GhcPass _1) = DataConCantHappen

type family XSCC x #

Instances

Instances details

type XSCC (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XSCC (GhcPass _1) = (EpAnn AnnPragma, SourceText)

type family XXDotFieldOcc x #

Instances

Instances details

type XXDotFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXDotFieldOcc (GhcPass _1) = DataConCantHappen

type family XCDotFieldOcc x #

Instances

Instances details

type XCDotFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCDotFieldOcc (GhcPass _1) = EpAnn AnnFieldLabel

type family XXExpr x #

Instances

Instances details

type XXExpr GhcPs
Instance details Defined in GHC.Hs.Expr type XXExpr GhcPs = DataConCantHappen
type XXExpr GhcRn
Instance details Defined in GHC.Hs.Expr type XXExpr GhcRn = HsExpansion (HsExpr GhcRn) (HsExpr GhcRn)
type XXExpr GhcTc
Instance details Defined in GHC.Hs.Expr type XXExpr GhcTc = XXExprGhcTc

type family XPragE x #

Instances

Instances details

type XPragE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPragE (GhcPass _1) = NoExtField

type family XBinTick x #

type family XTick x #

type family XStatic x #

Instances

Instances details

type XStatic GhcPs
Instance details Defined in GHC.Hs.Expr type XStatic GhcPs = EpAnn [AddEpAnn]
type XStatic GhcRn
Instance details Defined in GHC.Hs.Expr type XStatic GhcRn = NameSet
type XStatic GhcTc
Instance details Defined in GHC.Hs.Expr type XStatic GhcTc = (NameSet, Type)

type family XProc x #

Instances

Instances details

type XProc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XProc (GhcPass _1) = EpAnn [AddEpAnn]

type family XUntypedSplice x #

Instances

Instances details

type XUntypedSplice GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcPs = EpAnnCO
type XUntypedSplice GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcRn = HsUntypedSpliceResult (HsExpr GhcRn)
type XUntypedSplice GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcTc = DataConCantHappen

type family XTypedSplice x #

Instances

Instances details

type XTypedSplice GhcPs
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcPs = (EpAnnCO, EpAnn [AddEpAnn])
type XTypedSplice GhcRn
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcRn = SplicePointName
type XTypedSplice GhcTc
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcTc = DelayedSplice

type family XUntypedBracket x #

Instances

Instances details

type XUntypedBracket GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcPs = EpAnn [AddEpAnn]
type XUntypedBracket GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcRn = [PendingRnSplice]
type XUntypedBracket GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcTc = HsBracketTc

type family XTypedBracket x #

Instances

Instances details

type XTypedBracket GhcPs
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcPs = EpAnn [AddEpAnn]
type XTypedBracket GhcRn
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcRn = NoExtField
type XTypedBracket GhcTc
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcTc = HsBracketTc

type family XArithSeq x #

Instances

Instances details

type XArithSeq GhcPs
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcPs = EpAnn [AddEpAnn]
type XArithSeq GhcRn
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcRn = NoExtField
type XArithSeq GhcTc
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcTc = PostTcExpr

type family XExprWithTySig x #

Instances

Instances details

type XExprWithTySig GhcPs
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcPs = EpAnn [AddEpAnn]
type XExprWithTySig GhcRn
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcRn = NoExtField
type XExprWithTySig GhcTc
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcTc = NoExtField

type family XProjection x #

Instances

Instances details

type XProjection GhcPs
Instance details Defined in GHC.Hs.Expr type XProjection GhcPs = EpAnn AnnProjection
type XProjection GhcRn
Instance details Defined in GHC.Hs.Expr type XProjection GhcRn = NoExtField
type XProjection GhcTc
Instance details Defined in GHC.Hs.Expr type XProjection GhcTc = DataConCantHappen

type family XGetField x #

Instances

Instances details

type XGetField GhcPs
Instance details Defined in GHC.Hs.Expr type XGetField GhcPs = EpAnnCO
type XGetField GhcRn
Instance details Defined in GHC.Hs.Expr type XGetField GhcRn = NoExtField
type XGetField GhcTc
Instance details Defined in GHC.Hs.Expr type XGetField GhcTc = DataConCantHappen

type family XRecordUpd x #

Instances

Instances details

type XRecordUpd GhcPs
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcPs = EpAnn [AddEpAnn]
type XRecordUpd GhcRn
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcRn = NoExtField
type XRecordUpd GhcTc
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcTc = DataConCantHappen

type family XRecordCon x #

Instances

Instances details

type XRecordCon GhcPs
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcPs = EpAnn [AddEpAnn]
type XRecordCon GhcRn
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcRn = NoExtField
type XRecordCon GhcTc
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcTc = PostTcExpr

type family XExplicitList x #

Instances

Instances details

type XExplicitList GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcPs = EpAnn AnnList
type XExplicitList GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcRn = NoExtField
type XExplicitList GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcTc = Type

type family XDo x #

Instances

Instances details

type XDo GhcPs
Instance details Defined in GHC.Hs.Expr type XDo GhcPs = EpAnn AnnList
type XDo GhcRn
Instance details Defined in GHC.Hs.Expr type XDo GhcRn = NoExtField
type XDo GhcTc
Instance details Defined in GHC.Hs.Expr type XDo GhcTc = Type

type family XLet x #

Instances

Instances details

type XLet GhcPs
Instance details Defined in GHC.Hs.Expr type XLet GhcPs = EpAnnCO
type XLet GhcRn
Instance details Defined in GHC.Hs.Expr type XLet GhcRn = NoExtField
type XLet GhcTc
Instance details Defined in GHC.Hs.Expr type XLet GhcTc = NoExtField

type family XMultiIf x #

Instances

Instances details

type XMultiIf GhcPs
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcPs = EpAnn [AddEpAnn]
type XMultiIf GhcRn
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcRn = NoExtField
type XMultiIf GhcTc
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcTc = Type

type family XIf x #

Instances

Instances details

type XIf GhcPs
Instance details Defined in GHC.Hs.Expr type XIf GhcPs = EpAnn AnnsIf
type XIf GhcRn
Instance details Defined in GHC.Hs.Expr type XIf GhcRn = NoExtField
type XIf GhcTc
Instance details Defined in GHC.Hs.Expr type XIf GhcTc = NoExtField

type family XCase x #

Instances

Instances details

type XCase GhcPs
Instance details Defined in GHC.Hs.Expr type XCase GhcPs = EpAnn EpAnnHsCase
type XCase GhcRn
Instance details Defined in GHC.Hs.Expr type XCase GhcRn = NoExtField
type XCase GhcTc
Instance details Defined in GHC.Hs.Expr type XCase GhcTc = NoExtField

type family XExplicitSum x #

Instances

Instances details

type XExplicitSum GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcPs = EpAnn AnnExplicitSum
type XExplicitSum GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcRn = NoExtField
type XExplicitSum GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcTc = [Type]

type family XExplicitTuple x #

Instances

Instances details

type XExplicitTuple GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcPs = EpAnn [AddEpAnn]
type XExplicitTuple GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcRn = NoExtField
type XExplicitTuple GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcTc = NoExtField

type family XSectionR x #

Instances

Instances details

type XSectionR GhcPs
Instance details Defined in GHC.Hs.Expr type XSectionR GhcPs = EpAnnCO
type XSectionR GhcRn
Instance details Defined in GHC.Hs.Expr type XSectionR GhcRn = EpAnnCO
type XSectionR GhcTc
Instance details Defined in GHC.Hs.Expr type XSectionR GhcTc = DataConCantHappen

type family XSectionL x #

Instances

Instances details

type XSectionL GhcPs
Instance details Defined in GHC.Hs.Expr type XSectionL GhcPs = EpAnnCO
type XSectionL GhcRn
Instance details Defined in GHC.Hs.Expr type XSectionL GhcRn = EpAnnCO
type XSectionL GhcTc
Instance details Defined in GHC.Hs.Expr type XSectionL GhcTc = DataConCantHappen

type family XPar x #

Instances

Instances details

type XPar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPar (GhcPass _1) = EpAnnCO

type family XNegApp x #

Instances

Instances details

type XNegApp GhcPs
Instance details Defined in GHC.Hs.Expr type XNegApp GhcPs = EpAnn [AddEpAnn]
type XNegApp GhcRn
Instance details Defined in GHC.Hs.Expr type XNegApp GhcRn = NoExtField
type XNegApp GhcTc
Instance details Defined in GHC.Hs.Expr type XNegApp GhcTc = NoExtField

type family XOpApp x #

Instances

Instances details

type XOpApp GhcPs
Instance details Defined in GHC.Hs.Expr type XOpApp GhcPs = EpAnn [AddEpAnn]
type XOpApp GhcRn
Instance details Defined in GHC.Hs.Expr type XOpApp GhcRn = Fixity
type XOpApp GhcTc
Instance details Defined in GHC.Hs.Expr type XOpApp GhcTc = DataConCantHappen

type family XAppTypeE x #

Instances

Instances details

type XAppTypeE GhcPs
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcPs = NoExtField
type XAppTypeE GhcRn
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcRn = NoExtField
type XAppTypeE GhcTc
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcTc = Type

type family XApp x #

Instances

Instances details

type XApp (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XApp (GhcPass _1) = EpAnnCO

type family XLamCase x #

Instances

Instances details

type XLamCase (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XLam x #

Instances

Instances details

type XLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLam (GhcPass _1) = NoExtField
type XLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLam (GhcPass _1) = NoExtField

type family XLitE x #

Instances

Instances details

type XLitE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLitE (GhcPass _1) = EpAnnCO

type family XOverLitE x #

Instances

Instances details

type XOverLitE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XOverLitE (GhcPass _1) = EpAnnCO

type family XIPVar x #

Instances

Instances details

type XIPVar GhcPs
Instance details Defined in GHC.Hs.Expr type XIPVar GhcPs = EpAnnCO
type XIPVar GhcRn
Instance details Defined in GHC.Hs.Expr type XIPVar GhcRn = EpAnnCO
type XIPVar GhcTc
Instance details Defined in GHC.Hs.Expr type XIPVar GhcTc = DataConCantHappen

type family XOverLabel x #

Instances

Instances details

type XOverLabel GhcPs
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcPs = EpAnnCO
type XOverLabel GhcRn
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcRn = EpAnnCO
type XOverLabel GhcTc
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcTc = DataConCantHappen

type family XRecSel x #

Instances

Instances details

type XRecSel GhcPs
Instance details Defined in GHC.Hs.Expr type XRecSel GhcPs = DataConCantHappen
type XRecSel GhcRn
Instance details Defined in GHC.Hs.Expr type XRecSel GhcRn = NoExtField
type XRecSel GhcTc
Instance details Defined in GHC.Hs.Expr type XRecSel GhcTc = NoExtField

type family XUnboundVar x #

Instances

Instances details

type XUnboundVar GhcPs
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcPs = EpAnn EpAnnUnboundVar
type XUnboundVar GhcRn
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcRn = NoExtField
type XUnboundVar GhcTc
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcTc = HoleExprRef

type family XVar x #

Instances

Instances details

type XVar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XVar (GhcPass _1) = NoExtField
type XVar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XVar (GhcPass _1) = NoExtField

type family XXModule x #

Instances

Instances details

type XXModule p
Instance details Defined in GHC.Hs type XXModule p = DataConCantHappen

type family XCModule x #

Instances

Instances details

type XCModule GhcPs
Instance details Defined in GHC.Hs type XCModule GhcPs = XModulePs
type XCModule GhcRn
Instance details Defined in GHC.Hs type XCModule GhcRn = DataConCantHappen
type XCModule GhcTc
Instance details Defined in GHC.Hs type XCModule GhcTc = DataConCantHappen

type family XXInjectivityAnn x #

Instances

Instances details

type XXInjectivityAnn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXInjectivityAnn (GhcPass _1) = DataConCantHappen

type family XCInjectivityAnn x #

Instances

Instances details

type XCInjectivityAnn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCInjectivityAnn (GhcPass _1) = EpAnn [AddEpAnn]

type family XXRoleAnnotDecl x #

Instances

Instances details

type XXRoleAnnotDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRoleAnnotDecl (GhcPass _1) = DataConCantHappen

type family XCRoleAnnotDecl x #

Instances

Instances details

type XCRoleAnnotDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcPs = EpAnn [AddEpAnn]
type XCRoleAnnotDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcRn = NoExtField
type XCRoleAnnotDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcTc = NoExtField

type family XXAnnDecl x #

Instances

Instances details

type XXAnnDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXAnnDecl (GhcPass _1) = DataConCantHappen

type family XHsAnnotation x #

Instances

Instances details

type XHsAnnotation (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XHsAnnotation (GhcPass _1) = (EpAnn AnnPragma, SourceText)

type family XXWarnDecl x #

Instances

Instances details

type XXWarnDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXWarnDecl (GhcPass _1) = DataConCantHappen

type family XWarning x #

Instances

Instances details

type XWarning (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XWarning (GhcPass _1) = EpAnn [AddEpAnn]

type family XXWarnDecls x #

Instances

Instances details

type XXWarnDecls (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXWarnDecls (GhcPass _1) = DataConCantHappen

type family XWarnings x #

Instances

Instances details

type XWarnings GhcPs
Instance details Defined in GHC.Hs.Decls type XWarnings GhcPs = (EpAnn [AddEpAnn], SourceText)
type XWarnings GhcRn
Instance details Defined in GHC.Hs.Decls type XWarnings GhcRn = SourceText
type XWarnings GhcTc
Instance details Defined in GHC.Hs.Decls type XWarnings GhcTc = SourceText

type family XXRuleBndr x #

Instances

Instances details

type XXRuleBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleBndr (GhcPass _1) = DataConCantHappen

type family XRuleBndrSig x #

Instances

Instances details

type XRuleBndrSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRuleBndrSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XCRuleBndr x #

Instances

Instances details

type XCRuleBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCRuleBndr (GhcPass _1) = EpAnn [AddEpAnn]

type family XXRuleDecl x #

Instances

Instances details

type XXRuleDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleDecl (GhcPass _1) = DataConCantHappen

type family XHsRule x #

Instances

Instances details

type XHsRule GhcPs
Instance details Defined in GHC.Hs.Decls type XHsRule GhcPs = (EpAnn HsRuleAnn, SourceText)
type XHsRule GhcRn
Instance details Defined in GHC.Hs.Decls type XHsRule GhcRn = (HsRuleRn, SourceText)
type XHsRule GhcTc
Instance details Defined in GHC.Hs.Decls type XHsRule GhcTc = (HsRuleRn, SourceText)

type family XXRuleDecls x #

Instances

Instances details

type XXRuleDecls (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleDecls (GhcPass _1) = DataConCantHappen

type family XCRuleDecls x #

Instances

Instances details

type XCRuleDecls GhcPs
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcPs = (EpAnn [AddEpAnn], SourceText)
type XCRuleDecls GhcRn
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcRn = SourceText
type XCRuleDecls GhcTc
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcTc = SourceText

type family XXForeignExport x #

Instances

Instances details

type XXForeignExport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignExport (GhcPass _1) = DataConCantHappen

type family XCExport x #

Instances

Instances details

type XCExport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCExport (GhcPass _1) = Located SourceText

type family XXForeignImport x #

Instances

Instances details

type XXForeignImport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignImport (GhcPass _1) = DataConCantHappen

type family XCImport x #

Instances

Instances details

type XCImport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCImport (GhcPass _1) = Located SourceText

type family XXForeignDecl x #

Instances

Instances details

type XXForeignDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignDecl (GhcPass _1) = DataConCantHappen

type family XForeignExport x #

Instances

Instances details

type XForeignExport GhcPs
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcPs = EpAnn [AddEpAnn]
type XForeignExport GhcRn
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcRn = NoExtField
type XForeignExport GhcTc
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcTc = Coercion

type family XForeignImport x #

Instances

Instances details

type XForeignImport GhcPs
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcPs = EpAnn [AddEpAnn]
type XForeignImport GhcRn
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcRn = NoExtField
type XForeignImport GhcTc
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcTc = Coercion

type family XXDefaultDecl x #

Instances

Instances details

type XXDefaultDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDefaultDecl (GhcPass _1) = DataConCantHappen

type family XCDefaultDecl x #

Instances

Instances details

type XCDefaultDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcPs = EpAnn [AddEpAnn]
type XCDefaultDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcRn = NoExtField
type XCDefaultDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcTc = NoExtField

type family XViaStrategy x #

Instances

Instances details

type XViaStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcPs = XViaStrategyPs
type XViaStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcRn = LHsSigType GhcRn
type XViaStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcTc = Type

type family XNewtypeStrategy x #

Instances

Instances details

type XNewtypeStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcPs = EpAnn [AddEpAnn]
type XNewtypeStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcRn = NoExtField
type XNewtypeStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcTc = NoExtField

type family XAnyClassStrategy x #

Instances

Instances details

type XAnyClassStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcPs = EpAnn [AddEpAnn]
type XAnyClassStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcRn = NoExtField
type XAnyClassStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcTc = NoExtField

type family XStockStrategy x #

Instances

Instances details

type XStockStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcPs = EpAnn [AddEpAnn]
type XStockStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcRn = NoExtField
type XStockStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcTc = NoExtField

type family XXDerivDecl x #

Instances

Instances details

type XXDerivDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDerivDecl (GhcPass _1) = DataConCantHappen

type family XCDerivDecl x #

Instances

Instances details

type XCDerivDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCDerivDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XXInstDecl x #

Instances

Instances details

type XXInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXInstDecl (GhcPass _1) = DataConCantHappen

type family XTyFamInstD x #

Instances

Instances details

type XTyFamInstD GhcPs
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcPs = NoExtField
type XTyFamInstD GhcRn
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcRn = NoExtField
type XTyFamInstD GhcTc
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcTc = NoExtField

type family XDataFamInstD x #

Instances

Instances details

type XDataFamInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDataFamInstD (GhcPass _1) = NoExtField

type family XClsInstD x #

Instances

Instances details

type XClsInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XClsInstD (GhcPass _1) = NoExtField

type family XXClsInstDecl x #

Instances

Instances details

type XXClsInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXClsInstDecl (GhcPass _1) = DataConCantHappen

type family XCClsInstDecl x #

Instances

Instances details

type XCClsInstDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)
type XCClsInstDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcRn = NoExtField
type XCClsInstDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcTc = NoExtField

type family XXTyFamInstDecl x #

Instances

Instances details

type XXTyFamInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyFamInstDecl (GhcPass _1) = DataConCantHappen

type family XCTyFamInstDecl x #

Instances

Instances details

type XCTyFamInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCTyFamInstDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XXFamEqn x r #

Instances

Instances details

type XXFamEqn (GhcPass _1) r
Instance details Defined in GHC.Hs.Decls type XXFamEqn (GhcPass _1) r = DataConCantHappen

type family XCFamEqn x r #

Instances

Instances details

type XCFamEqn (GhcPass _1) r
Instance details Defined in GHC.Hs.Decls type XCFamEqn (GhcPass _1) r = EpAnn [AddEpAnn]

type family XXConDecl x #

Instances

Instances details

type XXConDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXConDecl (GhcPass _1) = DataConCantHappen

type family XConDeclH98 x #

Instances

Instances details

type XConDeclH98 (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XConDeclH98 (GhcPass _1) = EpAnn [AddEpAnn]

type family XConDeclGADT x #

Instances

Instances details

type XConDeclGADT (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XConDeclGADT (GhcPass _1) = EpAnn [AddEpAnn]

type family XXDerivClauseTys x #

Instances

Instances details

type XXDerivClauseTys (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDerivClauseTys (GhcPass _1) = DataConCantHappen

type family XDctMulti x #

Instances

Instances details

type XDctMulti (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDctMulti (GhcPass _1) = NoExtField

type family XDctSingle x #

Instances

Instances details

type XDctSingle (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDctSingle (GhcPass _1) = NoExtField

type family XXHsDerivingClause x #

Instances

Instances details

type XXHsDerivingClause (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDerivingClause (GhcPass _1) = DataConCantHappen

type family XCHsDerivingClause x #

Instances

Instances details

type XCHsDerivingClause (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsDerivingClause (GhcPass _1) = EpAnn [AddEpAnn]

type family XXHsDataDefn x #

Instances

Instances details

type XXHsDataDefn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDataDefn (GhcPass _1) = DataConCantHappen

type family XCHsDataDefn x #

Instances

Instances details

type XCHsDataDefn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsDataDefn (GhcPass _1) = NoExtField

type family XXFamilyDecl x #

Instances

Instances details

type XXFamilyDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFamilyDecl (GhcPass _1) = DataConCantHappen

type family XCFamilyDecl x #

Instances

Instances details

type XCFamilyDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCFamilyDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XXFamilyResultSig x #

Instances

Instances details

type XXFamilyResultSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFamilyResultSig (GhcPass _1) = DataConCantHappen

type family XTyVarSig x #

Instances

Instances details

type XTyVarSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XTyVarSig (GhcPass _1) = NoExtField

type family XCKindSig x #

Instances

Instances details

type XCKindSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCKindSig (GhcPass _1) = NoExtField

type family XNoSig x #

Instances

Instances details

type XNoSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XNoSig (GhcPass _1) = NoExtField

type family XXTyClGroup x #

Instances

Instances details

type XXTyClGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyClGroup (GhcPass _1) = DataConCantHappen

type family XCTyClGroup x #

Instances

Instances details

type XCTyClGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCTyClGroup (GhcPass _1) = NoExtField

type family XXFunDep x #

Instances

Instances details

type XXFunDep (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFunDep (GhcPass _1) = DataConCantHappen

type family XCFunDep x #

Instances

Instances details

type XCFunDep (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCFunDep (GhcPass _1) = EpAnn [AddEpAnn]

type family XXTyClDecl x #

Instances

Instances details

type XXTyClDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyClDecl (GhcPass _1) = DataConCantHappen

type family XClassDecl x #

Instances

Instances details

type XClassDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)
type XClassDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcRn = NameSet
type XClassDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcTc = NameSet

type family XDataDecl x #

Instances

Instances details

type XDataDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcPs = EpAnn [AddEpAnn]
type XDataDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcRn = DataDeclRn
type XDataDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcTc = DataDeclRn

type family XSynDecl x #

Instances

Instances details

type XSynDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcPs = EpAnn [AddEpAnn]
type XSynDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcRn = NameSet
type XSynDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcTc = NameSet

type family XFamDecl x #

Instances

Instances details

type XFamDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XFamDecl (GhcPass _1) = NoExtField

type family XXSpliceDecl x #

Instances

Instances details

type XXSpliceDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXSpliceDecl (GhcPass _1) = DataConCantHappen

type family XSpliceDecl x #

Instances

Instances details

type XSpliceDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSpliceDecl (GhcPass _1) = NoExtField

type family XXHsGroup x #

Instances

Instances details

type XXHsGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsGroup (GhcPass _1) = DataConCantHappen

type family XCHsGroup x #

Instances

Instances details

type XCHsGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsGroup (GhcPass _1) = NoExtField

type family XXHsDecl x #

Instances

Instances details

type XXHsDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDecl (GhcPass _1) = DataConCantHappen

type family XRoleAnnotD x #

Instances

Instances details

type XRoleAnnotD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRoleAnnotD (GhcPass _1) = NoExtField

type family XDocD x #

Instances

Instances details

type XDocD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDocD (GhcPass _1) = NoExtField

type family XSpliceD x #

Instances

Instances details

type XSpliceD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSpliceD (GhcPass _1) = NoExtField

type family XRuleD x #

Instances

Instances details

type XRuleD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRuleD (GhcPass _1) = NoExtField

type family XAnnD x #

Instances

Instances details

type XAnnD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XAnnD (GhcPass _1) = NoExtField

type family XWarningD x #

Instances

Instances details

type XWarningD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XWarningD (GhcPass _1) = NoExtField

type family XForD x #

Instances

Instances details

type XForD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XForD (GhcPass _1) = NoExtField

type family XDefD x #

Instances

Instances details

type XDefD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDefD (GhcPass _1) = NoExtField

type family XKindSigD x #

Instances

Instances details

type XKindSigD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XKindSigD (GhcPass _1) = NoExtField

type family XSigD x #

Instances

Instances details

type XSigD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSigD (GhcPass _1) = NoExtField

type family XValD x #

Instances

Instances details

type XValD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XValD (GhcPass _1) = NoExtField

type family XDerivD x #

Instances

Instances details

type XDerivD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDerivD (GhcPass _1) = NoExtField

type family XInstD x #

Instances

Instances details

type XInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XInstD (GhcPass _1) = NoExtField

type family XTyClD x #

Instances

Instances details

type XTyClD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XTyClD (GhcPass _1) = NoExtField

type family XXStandaloneKindSig x #

Instances

Instances details

type XXStandaloneKindSig (GhcPass p)
Instance details Defined in GHC.Hs.Decls type XXStandaloneKindSig (GhcPass p) = DataConCantHappen

type family XStandaloneKindSig x #

Instances

Instances details

type XStandaloneKindSig GhcPs
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcPs = EpAnn [AddEpAnn]
type XStandaloneKindSig GhcRn
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcRn = NoExtField
type XStandaloneKindSig GhcTc
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcTc = NoExtField

type family XXFixitySig x #

Instances

Instances details

type XXFixitySig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXFixitySig (GhcPass p) = DataConCantHappen

type family XFixitySig x #

Instances

Instances details

type XFixitySig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XFixitySig (GhcPass p) = NoExtField

type family XXSig x #

Instances

Instances details

type XXSig GhcPs
Instance details Defined in GHC.Hs.Binds type XXSig GhcPs = DataConCantHappen
type XXSig GhcRn
Instance details Defined in GHC.Hs.Binds type XXSig GhcRn = IdSig
type XXSig GhcTc
Instance details Defined in GHC.Hs.Binds type XXSig GhcTc = IdSig

type family XCompleteMatchSig x #

Instances

Instances details

type XCompleteMatchSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XCompleteMatchSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)

type family XSCCFunSig x #

Instances

Instances details

type XSCCFunSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSCCFunSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)

type family XMinimalSig x #

Instances

Instances details

type XMinimalSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XMinimalSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)

type family XSpecInstSig x #

Instances

Instances details

type XSpecInstSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSpecInstSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)

type family XSpecSig x #

Instances

Instances details

type XSpecSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSpecSig (GhcPass p) = EpAnn [AddEpAnn]

type family XInlineSig x #

Instances

Instances details

type XInlineSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XInlineSig (GhcPass p) = EpAnn [AddEpAnn]

type family XFixSig x #

Instances

Instances details

type XFixSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XFixSig (GhcPass p) = EpAnn [AddEpAnn]

type family XIdSig x #

type family XClassOpSig x #

Instances

Instances details

type XClassOpSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XClassOpSig (GhcPass p) = EpAnn AnnSig

type family XPatSynSig x #

Instances

Instances details

type XPatSynSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XPatSynSig (GhcPass p) = EpAnn AnnSig

type family XTypeSig x #

Instances

Instances details

type XTypeSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XTypeSig (GhcPass p) = EpAnn AnnSig

type family XXIPBind x #

Instances

Instances details

type XXIPBind (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXIPBind (GhcPass p) = DataConCantHappen

type family XCIPBind x #

Instances

Instances details

type XCIPBind GhcPs
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcPs = EpAnn [AddEpAnn]
type XCIPBind GhcRn
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcRn = NoExtField
type XCIPBind GhcTc
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcTc = Id

type family XXHsIPBinds x #

Instances

Instances details

type XXHsIPBinds (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXHsIPBinds (GhcPass p) = DataConCantHappen

type family XIPBinds x #

Instances

Instances details

type XIPBinds GhcPs
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcPs = NoExtField
type XIPBinds GhcRn
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcRn = NoExtField
type XIPBinds GhcTc
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcTc = TcEvBinds

type family XXPatSynBind x x' #

Instances

Instances details

type XXPatSynBind (GhcPass idL) (GhcPass idR)
Instance details Defined in GHC.Hs.Binds type XXPatSynBind (GhcPass idL) (GhcPass idR) = DataConCantHappen

type family XPSB x x' #

Instances

Instances details

type XPSB (GhcPass idL) GhcPs
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcPs = EpAnn [AddEpAnn]
type XPSB (GhcPass idL) GhcRn
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcRn = NameSet
type XPSB (GhcPass idL) GhcTc
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcTc = NameSet

type family XXHsBindsLR x x' #

Instances

Instances details

type XXHsBindsLR GhcPs pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcPs pR = DataConCantHappen
type XXHsBindsLR GhcRn pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcRn pR = DataConCantHappen
type XXHsBindsLR GhcTc pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcTc pR = AbsBinds

type family XPatSynBind x x' #

Instances

Instances details

type XPatSynBind (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatSynBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XVarBind x x' #

Instances

Instances details

type XVarBind (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XVarBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XPatBind x x' #

Instances

Instances details

type XPatBind GhcPs (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcPs (GhcPass pR) = EpAnn [AddEpAnn]
type XPatBind GhcRn (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcRn (GhcPass pR) = NameSet
type XPatBind GhcTc (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcTc (GhcPass pR) = (Type, ([CoreTickish], [[CoreTickish]]))

type family XFunBind x x' #

Instances

Instances details

type XFunBind (GhcPass pL) GhcPs
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcPs = NoExtField
type XFunBind (GhcPass pL) GhcRn	After the renamer (but before the type-checker), the FunBind extension field contains the locally-bound free variables of this defn. See Note [Bind free vars]
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcRn = NameSet
type XFunBind (GhcPass pL) GhcTc	After the type-checker, the FunBind extension field contains the ticks to put on the rhs, if any, and a coercion from the type of the MatchGroup to the type of the Id. Example: f :: Int -> forall a. a -> a f x y = y Then the MatchGroup will have type (Int -> a' -> a') (with a free type variable a'). The coercion will take a CoreExpr of this type and convert it to a CoreExpr of type Int -> forall a'. a' -> a' Notice that the coercion captures the free a'.
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcTc = (HsWrapper, [CoreTickish])

type family XXValBindsLR x x' #

Instances

Instances details

type XXValBindsLR (GhcPass pL) pR
Instance details Defined in GHC.Hs.Binds type XXValBindsLR (GhcPass pL) pR = NHsValBindsLR (GhcPass pL)

type family XValBinds x x' #

Instances

Instances details

type XValBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XValBinds (GhcPass pL) (GhcPass pR) = AnnSortKey

type family XXHsLocalBindsLR x x' #

Instances

Instances details

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR) = DataConCantHappen

type family XEmptyLocalBinds x x' #

Instances

Instances details

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XEmptyLocalBinds (GhcPass pL) (GhcPass pR) = NoExtField

type family XHsIPBinds x x' #

Instances

Instances details

type XHsIPBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XHsIPBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type family XHsValBinds x x' #

Instances

Instances details

type XHsValBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XHsValBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type LIdP p = XRec p (IdP p) #

type family IdP p #

Maps the "normal" id type for a given pass

Instances

Instances details

type IdP (GhcPass p)
Instance details Defined in GHC.Hs.Extension type IdP (GhcPass p) = IdGhcP p

class WrapXRec p a where #

The trivial wrapper that carries no additional information See Note [XRec and SrcSpans in the AST]

Methods

wrapXRec :: a -> XRec p a #

class MapXRec p where #

We can map over the underlying type contained in an XRec while preserving the annotation as is.

Methods

mapXRec :: Anno a ~ Anno b => (a -> b) -> XRec p a -> XRec p b #

Instances

Instances details

MapXRec (GhcPass p)
Instance details Defined in GHC.Hs.Extension Methods mapXRec :: Anno a ~ Anno b => (a -> b) -> XRec (GhcPass p) a -> XRec (GhcPass p) b #

class UnXRec p where #

We can strip off the XRec to access the underlying data. See Note [XRec and SrcSpans in the AST]

Methods

unXRec :: XRec p a -> a #

Instances

Instances details

UnXRec (GhcPass p)
Instance details Defined in GHC.Hs.Extension Methods unXRec :: XRec (GhcPass p) a -> a #

type family Anno a = (b :: Type) #

Instances

Instances details

type Anno ConLike
Instance details Defined in GHC.Hs.Pat type Anno ConLike = SrcSpanAnnN
type Anno FastString
Instance details Defined in GHC.Hs.Expr type Anno FastString = SrcAnn NoEpAnns
type Anno OverlapMode
Instance details Defined in GHC.Hs.Decls type Anno OverlapMode = SrcSpanAnnP
type Anno OverlapMode
Instance details Defined in GHC.Hs.Decls type Anno OverlapMode = SrcSpanAnnP
type Anno CCallConv
Instance details Defined in GHC.Hs.Decls type Anno CCallConv = SrcSpan
type Anno CExportSpec
Instance details Defined in GHC.Hs.Decls type Anno CExportSpec = SrcSpan
type Anno CType
Instance details Defined in GHC.Hs.Decls type Anno CType = SrcSpanAnnP
type Anno Safety
Instance details Defined in GHC.Hs.Decls type Anno Safety = SrcSpan
type Anno Name
Instance details Defined in GHC.Hs.Extension type Anno Name = SrcSpanAnnN
type Anno RdrName
Instance details Defined in GHC.Hs.Extension type Anno RdrName = SrcSpanAnnN
type Anno StringLiteral
Instance details Defined in GHC.Hs.Binds type Anno StringLiteral = SrcAnn NoEpAnns
type Anno Id
Instance details Defined in GHC.Hs.Extension type Anno Id = SrcSpanAnnN
type Anno FieldLabelString
Instance details Defined in GHC.Hs.Expr type Anno FieldLabelString = SrcSpanAnnN
type Anno ModuleName
Instance details Defined in GHC.Hs type Anno ModuleName = SrcSpanAnnA
type Anno ModuleName
Instance details Defined in GHC.Hs.ImpExp type Anno ModuleName = SrcSpanAnnA
type Anno RecFieldsDotDot
Instance details Defined in GHC.Hs.Pat type Anno RecFieldsDotDot = SrcSpan
type Anno HsIPName
Instance details Defined in GHC.Hs.Type type Anno HsIPName = SrcAnn NoEpAnns
type Anno Bool
Instance details Defined in GHC.Hs.Decls type Anno Bool = SrcAnn NoEpAnns
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno (LocatedN Name)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Name) = SrcSpan
type Anno (LocatedN RdrName)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN RdrName) = SrcSpan
type Anno (LocatedN Id)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Id) = SrcSpan
type Anno (FixitySig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA
type Anno (IPBind (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (IPBind (GhcPass p)) = SrcSpanAnnA
type Anno (Sig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (Sig (GhcPass p)) = SrcSpanAnnA
type Anno (HsToken tok)
Instance details Defined in GHC.Hs.Extension type Anno (HsToken tok) = TokenLocation
type Anno (AnnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA
type Anno (ClsInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (ConDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DataFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DefaultDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DerivClauseTys (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC
type Anno (DerivDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DerivStrategy (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivStrategy (GhcPass p)) = SrcAnn NoEpAnns
type Anno (DocDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DocDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FamilyDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FamilyResultSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyResultSig (GhcPass p)) = SrcAnn NoEpAnns
type Anno (ForeignDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FunDep (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FunDep (GhcPass p)) = SrcSpanAnnA
type Anno (HsDecl (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA
type Anno (HsDerivingClause (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (HsDerivingClause (GhcPass p)) = SrcAnn NoEpAnns
type Anno (InjectivityAnn (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InjectivityAnn (GhcPass p)) = SrcAnn NoEpAnns
type Anno (InstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RoleAnnotDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RuleBndr (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleBndr (GhcPass p)) = SrcAnn NoEpAnns
type Anno (RuleDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RuleDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA
type Anno (SpliceDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA
type Anno (StandaloneKindSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA
type Anno (TyClDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA
type Anno (TyFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (WarnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA
type Anno (WarnDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA
type Anno (DotFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (DotFieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (FieldLabelStrings (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (FieldLabelStrings (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsCmd (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA
type Anno (HsCmdTop (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmdTop (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsExpr (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA
type Anno (HsUntypedSplice (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsUntypedSplice (GhcPass p)) = SrcSpanAnnA
type Anno (IE (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (IE (GhcPass p)) = SrcSpanAnnA
type Anno (IEWrappedName (GhcPass _1))
Instance details Defined in GHC.Hs.ImpExp type Anno (IEWrappedName (GhcPass _1)) = SrcSpanAnnA
type Anno (ImportDecl (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA
type Anno (HsOverLit (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (HsOverLit (GhcPass p)) = SrcAnn NoEpAnns
type Anno (Pat (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (Pat (GhcPass p)) = SrcSpanAnnA
type Anno (AmbiguousFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (AmbiguousFieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (BangType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (BangType (GhcPass p)) = SrcSpanAnnA
type Anno (ConDeclField (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA
type Anno (FieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (FieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsKind (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsKind (GhcPass p)) = SrcSpanAnnA
type Anno (HsSigType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA
type Anno (HsType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsType (GhcPass p)) = SrcSpanAnnA
type Anno (Maybe Role)
Instance details Defined in GHC.Hs.Decls type Anno (Maybe Role) = SrcAnn NoEpAnns
type Anno (Maybe Role)
Instance details Defined in GHC.Hs.Decls type Anno (Maybe Role) = SrcAnn NoEpAnns
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type Anno [LocatedN Name]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Name] = SrcSpan
type Anno [LocatedN RdrName]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN RdrName] = SrcSpan
type Anno [LocatedN Id]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Id] = SrcSpan
type Anno (HsBindLR (GhcPass idL) (GhcPass idR))
Instance details Defined in GHC.Hs.Binds type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA
type Anno (HsUniToken tok utok)
Instance details Defined in GHC.Hs.Extension type Anno (HsUniToken tok utok) = TokenLocation
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (HsFieldBind lhs rhs)
Instance details Defined in GHC.Hs.Pat type Anno (HsFieldBind lhs rhs) = SrcSpanAnnA
type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))
Instance details Defined in GHC.Hs.Type type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag (GhcPass _1))
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcPs)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcRn)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcTc)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA
type Anno (SourceText, RuleName)
Instance details Defined in GHC.Hs.Decls type Anno (SourceText, RuleName) = SrcAnn NoEpAnns
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type family XRec p a = (r :: Type) | r -> a #

GHC's L prefixed variants wrap their vanilla variant in this type family, to add SrcLoc info via Located. Other passes than GhcPass not interested in location information can define this as type instance XRec NoLocated a = a. See Note [XRec and SrcSpans in the AST]

Instances

Instances details

type XRec (GhcPass p) a
Instance details Defined in GHC.Hs.Extension type XRec (GhcPass p) a = GenLocated (Anno a) a

data DataConCantHappen #

Instances

Instances details

Data DataConCantHappen
Instance details Defined in Language.Haskell.Syntax.Extension Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataConCantHappen -> c DataConCantHappen # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataConCantHappen # toConstr :: DataConCantHappen -> Constr # dataTypeOf :: DataConCantHappen -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataConCantHappen) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataConCantHappen) # gmapT :: (forall b. Data b => b -> b) -> DataConCantHappen -> DataConCantHappen # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataConCantHappen -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataConCantHappen -> r # gmapQ :: (forall d. Data d => d -> u) -> DataConCantHappen -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DataConCantHappen -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataConCantHappen -> m DataConCantHappen # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataConCantHappen -> m DataConCantHappen # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataConCantHappen -> m DataConCantHappen #
Eq DataConCantHappen
Instance details Defined in Language.Haskell.Syntax.Extension Methods (==) :: DataConCantHappen -> DataConCantHappen -> Bool # (/=) :: DataConCantHappen -> DataConCantHappen -> Bool #
Ord DataConCantHappen
Instance details Defined in Language.Haskell.Syntax.Extension Methods compare :: DataConCantHappen -> DataConCantHappen -> Ordering # (<) :: DataConCantHappen -> DataConCantHappen -> Bool # (<=) :: DataConCantHappen -> DataConCantHappen -> Bool # (>) :: DataConCantHappen -> DataConCantHappen -> Bool # (>=) :: DataConCantHappen -> DataConCantHappen -> Bool # max :: DataConCantHappen -> DataConCantHappen -> DataConCantHappen # min :: DataConCantHappen -> DataConCantHappen -> DataConCantHappen #

newtype ModuleName #

A ModuleName is essentially a simple string, e.g. Data.List.

Constructors

ModuleName FastString

Instances

Instances details

Data ModuleName
Instance details Defined in Language.Haskell.Syntax.Module.Name Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleName -> c ModuleName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModuleName # toConstr :: ModuleName -> Constr # dataTypeOf :: ModuleName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModuleName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModuleName) # gmapT :: (forall b. Data b => b -> b) -> ModuleName -> ModuleName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r # gmapQ :: (forall d. Data d => d -> u) -> ModuleName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName #
Show ModuleName
Instance details Defined in Language.Haskell.Syntax.Module.Name Methods showsPrec :: Int -> ModuleName -> ShowS # show :: ModuleName -> String # showList :: [ModuleName] -> ShowS #
NFData ModuleName
Instance details Defined in Language.Haskell.Syntax.Module.Name Methods rnf :: ModuleName -> () #
Uniquable ModuleName
Instance details Defined in GHC.Types.Unique Methods getUnique :: ModuleName -> Unique #
Binary ModuleName
Instance details Defined in GHC.Utils.Binary Methods put_ :: BinHandle -> ModuleName -> IO () # put :: BinHandle -> ModuleName -> IO (Bin ModuleName) # get :: BinHandle -> IO ModuleName #
Outputable ModuleName
Instance details Defined in GHC.Utils.Outputable Methods ppr :: ModuleName -> SDoc #
Eq ModuleName
Instance details Defined in Language.Haskell.Syntax.Module.Name Methods (==) :: ModuleName -> ModuleName -> Bool # (/=) :: ModuleName -> ModuleName -> Bool #
Ord ModuleName
Instance details Defined in Language.Haskell.Syntax.Module.Name Methods compare :: ModuleName -> ModuleName -> Ordering # (<) :: ModuleName -> ModuleName -> Bool # (<=) :: ModuleName -> ModuleName -> Bool # (>) :: ModuleName -> ModuleName -> Bool # (>=) :: ModuleName -> ModuleName -> Bool # max :: ModuleName -> ModuleName -> ModuleName # min :: ModuleName -> ModuleName -> ModuleName #
Hashable ModuleName Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods hashWithSalt :: Int -> ModuleName -> Int # hash :: ModuleName -> Int #
ToHie (IEContext (LocatedA ModuleName))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]
type Anno ModuleName
Instance details Defined in GHC.Hs type Anno ModuleName = SrcSpanAnnA
type Anno ModuleName
Instance details Defined in GHC.Hs.ImpExp type Anno ModuleName = SrcSpanAnnA

data IfaceBndr #

Constructors

IfaceIdBndr !IfaceIdBndr
IfaceTvBndr !IfaceTvBndr

Instances

Instances details

NFData IfaceBndr
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceBndr -> () #
Binary IfaceBndr
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceBndr -> IO () # put :: BinHandle -> IfaceBndr -> IO (Bin IfaceBndr) # get :: BinHandle -> IO IfaceBndr #
Outputable IfaceBndr
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceBndr -> SDoc #

data IfaceCoercion #

Instances

Instances details

NFData IfaceCoercion
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceCoercion -> () #
Binary IfaceCoercion
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceCoercion -> IO () # put :: BinHandle -> IfaceCoercion -> IO (Bin IfaceCoercion) # get :: BinHandle -> IO IfaceCoercion #
Outputable IfaceCoercion
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceCoercion -> SDoc #

data IfaceTyLit #

Constructors

IfaceNumTyLit Integer
IfaceStrTyLit FastString
IfaceCharTyLit Char

Instances

Instances details

NFData IfaceTyLit
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceTyLit -> () #
Binary IfaceTyLit
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceTyLit -> IO () # put :: BinHandle -> IfaceTyLit -> IO (Bin IfaceTyLit) # get :: BinHandle -> IO IfaceTyLit #
Outputable IfaceTyLit
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceTyLit -> SDoc #
Eq IfaceTyLit
Instance details Defined in GHC.Iface.Type Methods (==) :: IfaceTyLit -> IfaceTyLit -> Bool # (/=) :: IfaceTyLit -> IfaceTyLit -> Bool #

data IfaceTyCon #

Constructors

IfaceTyCon
Fields ifaceTyConName :: IfExtName ifaceTyConInfo :: IfaceTyConInfo

Instances

Instances details

NFData IfaceTyCon
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceTyCon -> () #
Binary IfaceTyCon
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceTyCon -> IO () # put :: BinHandle -> IfaceTyCon -> IO (Bin IfaceTyCon) # get :: BinHandle -> IO IfaceTyCon #
Outputable IfaceTyCon
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceTyCon -> SDoc #
Eq IfaceTyCon
Instance details Defined in GHC.Iface.Type Methods (==) :: IfaceTyCon -> IfaceTyCon -> Bool # (/=) :: IfaceTyCon -> IfaceTyCon -> Bool #

data IfaceType #

A kind of universal type, used for types and kinds.

Any time a Type is pretty-printed, it is first converted to an IfaceType before being printed. See Note [Pretty printing via Iface syntax] in GHC.Types.TyThing.Ppr

Instances

Instances details

NFData IfaceType
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceType -> () #
Binary IfaceType
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceType -> IO () # put :: BinHandle -> IfaceType -> IO (Bin IfaceType) # get :: BinHandle -> IO IfaceType #
Outputable IfaceType
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceType -> SDoc #
Binary (DefMethSpec IfaceType)
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> DefMethSpec IfaceType -> IO () # put :: BinHandle -> DefMethSpec IfaceType -> IO (Bin (DefMethSpec IfaceType)) # get :: BinHandle -> IO (DefMethSpec IfaceType) #

data IfaceAppArgs #

Stores the arguments in a type application as a list. See Note [Suppressing invisible arguments].

Constructors

IA_Nil
IA_Arg IfaceType ForAllTyFlag IfaceAppArgs

Instances

Instances details

Monoid IfaceAppArgs
Instance details Defined in GHC.Iface.Type Methods mempty :: IfaceAppArgs # mappend :: IfaceAppArgs -> IfaceAppArgs -> IfaceAppArgs # mconcat :: [IfaceAppArgs] -> IfaceAppArgs #
Semigroup IfaceAppArgs
Instance details Defined in GHC.Iface.Type Methods (<>) :: IfaceAppArgs -> IfaceAppArgs -> IfaceAppArgs # sconcat :: NonEmpty IfaceAppArgs -> IfaceAppArgs # stimes :: Integral b => b -> IfaceAppArgs -> IfaceAppArgs #
NFData IfaceAppArgs
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceAppArgs -> () #
Binary IfaceAppArgs
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceAppArgs -> IO () # put :: BinHandle -> IfaceAppArgs -> IO (Bin IfaceAppArgs) # get :: BinHandle -> IO IfaceAppArgs #
Outputable IfaceAppArgs
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceAppArgs -> SDoc #

class HasOccName name where #

Other names in the compiler add additional information to an OccName. This class provides a consistent way to access the underlying OccName.

Methods

occName :: name -> OccName #

Instances

Instances details

HasOccName IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceClassOp -> OccName #
HasOccName IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceConDecl -> OccName #
HasOccName IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceDecl -> OccName #
HasOccName HoleFitCandidate
Instance details Defined in GHC.Tc.Errors.Hole.FitTypes Methods occName :: HoleFitCandidate -> OccName #
HasOccName TcBinder
Instance details Defined in GHC.Tc.Types Methods occName :: TcBinder -> OccName #
HasOccName GreName
Instance details Defined in GHC.Types.Avail Methods occName :: GreName -> OccName #
HasOccName FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods occName :: FieldLabel -> OccName #
HasOccName Name
Instance details Defined in GHC.Types.Name Methods occName :: Name -> OccName #
HasOccName OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods occName :: OccName -> OccName #
HasOccName GlobalRdrElt
Instance details Defined in GHC.Types.Name.Reader Methods occName :: GlobalRdrElt -> OccName #
HasOccName RdrName
Instance details Defined in GHC.Types.Name.Reader Methods occName :: RdrName -> OccName #
HasOccName Var
Instance details Defined in GHC.Types.Var Methods occName :: Var -> OccName #

data OccName #

Occurrence Name

In this context that means: "classified (i.e. as a type name, value name, etc) but not qualified and not yet resolved"

Instances

Instances details

Data OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccName -> c OccName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OccName # toConstr :: OccName -> Constr # dataTypeOf :: OccName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OccName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OccName) # gmapT :: (forall b. Data b => b -> b) -> OccName -> OccName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r # gmapQ :: (forall d. Data d => d -> u) -> OccName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OccName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccName -> m OccName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName #
Show OccName Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> OccName -> ShowS # show :: OccName -> String # showList :: [OccName] -> ShowS #
NFData OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods rnf :: OccName -> () #
HasOccName OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods occName :: OccName -> OccName #
Uniquable OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods getUnique :: OccName -> Unique #
Binary OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods put_ :: BinHandle -> OccName -> IO () # put :: BinHandle -> OccName -> IO (Bin OccName) # get :: BinHandle -> IO OccName #
Outputable OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods ppr :: OccName -> SDoc #
OutputableBndr OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods pprBndr :: BindingSite -> OccName -> SDoc # pprPrefixOcc :: OccName -> SDoc # pprInfixOcc :: OccName -> SDoc # bndrIsJoin_maybe :: OccName -> Maybe Int #
Eq OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods (==) :: OccName -> OccName -> Bool # (/=) :: OccName -> OccName -> Bool #
Ord OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods compare :: OccName -> OccName -> Ordering # (<) :: OccName -> OccName -> Bool # (<=) :: OccName -> OccName -> Bool # (>) :: OccName -> OccName -> Bool # (>=) :: OccName -> OccName -> Bool # max :: OccName -> OccName -> OccName # min :: OccName -> OccName -> OccName #
Hashable OccName Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods hashWithSalt :: Int -> OccName -> Int # hash :: OccName -> Int #

data IsBootInterface #

Indicates whether a module name is referring to a boot interface (hs-boot file) or regular module (hs file). We need to treat boot modules specially when building compilation graphs, since they break cycles. Regular source files and signature files are treated equivalently.

Constructors

NotBoot
IsBoot

Instances

Instances details

Data IsBootInterface
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsBootInterface -> c IsBootInterface # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsBootInterface # toConstr :: IsBootInterface -> Constr # dataTypeOf :: IsBootInterface -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsBootInterface) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsBootInterface) # gmapT :: (forall b. Data b => b -> b) -> IsBootInterface -> IsBootInterface # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r # gmapQ :: (forall d. Data d => d -> u) -> IsBootInterface -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IsBootInterface -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface #
Show IsBootInterface
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods showsPrec :: Int -> IsBootInterface -> ShowS # show :: IsBootInterface -> String # showList :: [IsBootInterface] -> ShowS #
Eq IsBootInterface
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods (==) :: IsBootInterface -> IsBootInterface -> Bool # (/=) :: IsBootInterface -> IsBootInterface -> Bool #
Ord IsBootInterface
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods compare :: IsBootInterface -> IsBootInterface -> Ordering # (<) :: IsBootInterface -> IsBootInterface -> Bool # (<=) :: IsBootInterface -> IsBootInterface -> Bool # (>) :: IsBootInterface -> IsBootInterface -> Bool # (>=) :: IsBootInterface -> IsBootInterface -> Bool # max :: IsBootInterface -> IsBootInterface -> IsBootInterface # min :: IsBootInterface -> IsBootInterface -> IsBootInterface #

type Unit = GenUnit UnitId #

data GenUnit uid #

A unit identifier identifies a (possibly partially) instantiated library. It is primarily used as part of GenModule, which in turn is used in Name, which is used to give names to entities when typechecking.

There are two possible forms for a Unit:

1) It can be a RealUnit, in which case we just have a DefUnitId that uniquely identifies some fully compiled, installed library we have on disk.

2) It can be an VirtUnit. When we are typechecking a library with missing holes, we may need to instantiate a library on the fly (in which case we don't have any on-disk representation.) In that case, you have an GenInstantiatedUnit, which explicitly records the instantiation, so that we can substitute over it.

Constructors

RealUnit !(Definite uid)	Installed definite unit (either a fully instantiated unit or a closed unit)
VirtUnit !(GenInstantiatedUnit uid)	Virtual unit instantiated on-the-fly. It may be definite if all the holes are instantiated but we don't have code objects for it.
HoleUnit	Fake hole unit

Instances

Instances details

Data Unit
Instance details Defined in GHC.Unit.Types Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit -> c Unit # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Unit # toConstr :: Unit -> Constr # dataTypeOf :: Unit -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Unit) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Unit) # gmapT :: (forall b. Data b => b -> b) -> Unit -> Unit # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r # gmapQ :: (forall d. Data d => d -> u) -> Unit -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit -> m Unit # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit #
Show Module Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Show Unit
Instance details Defined in GHC.Unit.Types Methods showsPrec :: Int -> Unit -> ShowS # show :: Unit -> String # showList :: [Unit] -> ShowS #
NFData Unit
Instance details Defined in GHC.Unit.Types Methods rnf :: Unit -> () #
Uniquable Module
Instance details Defined in GHC.Unit.Types Methods getUnique :: Module -> Unique #
Binary Unit
Instance details Defined in GHC.Unit.Types Methods put_ :: BinHandle -> Unit -> IO () # put :: BinHandle -> Unit -> IO (Bin Unit) # get :: BinHandle -> IO Unit #
Outputable Module
Instance details Defined in GHC.Unit.Types Methods ppr :: Module -> SDoc #
Outputable Unit
Instance details Defined in GHC.Unit.Types Methods ppr :: Unit -> SDoc #
Ord Unit
Instance details Defined in GHC.Unit.Types Methods compare :: Unit -> Unit -> Ordering # (<) :: Unit -> Unit -> Bool # (<=) :: Unit -> Unit -> Bool # (>) :: Unit -> Unit -> Bool # (>=) :: Unit -> Unit -> Bool # max :: Unit -> Unit -> Unit # min :: Unit -> Unit -> Unit #
IsUnitId u => Uniquable (GenUnit u)
Instance details Defined in GHC.Unit.Types Methods getUnique :: GenUnit u -> Unique #
IsUnitId u => IsUnitId (GenUnit u)
Instance details Defined in GHC.Unit.Types Methods unitFS :: GenUnit u -> FastString #
IsUnitId u => Eq (GenUnit u)
Instance details Defined in GHC.Unit.Types Methods (==) :: GenUnit u -> GenUnit u -> Bool # (/=) :: GenUnit u -> GenUnit u -> Bool #

data GenModule unit #

A generic module is a pair of a unit identifier and a ModuleName.

Constructors

Module !unit !ModuleName

Instances

Instances details

Functor GenModule
Instance details Defined in GHC.Unit.Types Methods fmap :: (a -> b) -> GenModule a -> GenModule b # (<$) :: a -> GenModule b -> GenModule a #
Show Module Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> Module -> ShowS # show :: Module -> String # showList :: [Module] -> ShowS #
Uniquable Module
Instance details Defined in GHC.Unit.Types Methods getUnique :: Module -> Unique #
Outputable InstalledModule
Instance details Defined in GHC.Unit.Types Methods ppr :: InstalledModule -> SDoc #
Outputable InstantiatedModule
Instance details Defined in GHC.Unit.Types Methods ppr :: InstantiatedModule -> SDoc #
Outputable Module
Instance details Defined in GHC.Unit.Types Methods ppr :: Module -> SDoc #
Data unit => Data (GenModule unit)
Instance details Defined in GHC.Unit.Types Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenModule unit -> c (GenModule unit) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenModule unit) # toConstr :: GenModule unit -> Constr # dataTypeOf :: GenModule unit -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenModule unit)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GenModule unit)) # gmapT :: (forall b. Data b => b -> b) -> GenModule unit -> GenModule unit # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenModule unit -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenModule unit -> r # gmapQ :: (forall d. Data d => d -> u) -> GenModule unit -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GenModule unit -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit) #
NFData (GenModule a)
Instance details Defined in GHC.Unit.Types Methods rnf :: GenModule a -> () #
Binary a => Binary (GenModule a)
Instance details Defined in GHC.Unit.Types Methods put_ :: BinHandle -> GenModule a -> IO () # put :: BinHandle -> GenModule a -> IO (Bin (GenModule a)) # get :: BinHandle -> IO (GenModule a) #
Eq unit => Eq (GenModule unit)
Instance details Defined in GHC.Unit.Types Methods (==) :: GenModule unit -> GenModule unit -> Bool # (/=) :: GenModule unit -> GenModule unit -> Bool #
Ord unit => Ord (GenModule unit)
Instance details Defined in GHC.Unit.Types Methods compare :: GenModule unit -> GenModule unit -> Ordering # (<) :: GenModule unit -> GenModule unit -> Bool # (<=) :: GenModule unit -> GenModule unit -> Bool # (>) :: GenModule unit -> GenModule unit -> Bool # (>=) :: GenModule unit -> GenModule unit -> Bool # max :: GenModule unit -> GenModule unit -> GenModule unit # min :: GenModule unit -> GenModule unit -> GenModule unit #

data Hooks #

class Uniquable a where #

Class of things that we can obtain a Unique from

Methods

getUnique :: a -> Unique #

Instances

Instances details

Uniquable Label
Instance details Defined in GHC.Cmm.Dataflow.Label Methods getUnique :: Label -> Unique #
Uniquable Class
Instance details Defined in GHC.Core.Class Methods getUnique :: Class -> Unique #
Uniquable CoAxiomRule
Instance details Defined in GHC.Core.Coercion.Axiom Methods getUnique :: CoAxiomRule -> Unique #
Uniquable ConLike
Instance details Defined in GHC.Core.ConLike Methods getUnique :: ConLike -> Unique #
Uniquable DataCon
Instance details Defined in GHC.Core.DataCon Methods getUnique :: DataCon -> Unique #
Uniquable PatSyn
Instance details Defined in GHC.Core.PatSyn Methods getUnique :: PatSyn -> Unique #
Uniquable CoercionHole
Instance details Defined in GHC.Core.TyCo.Rep Methods getUnique :: CoercionHole -> Unique #
Uniquable TyCon
Instance details Defined in GHC.Core.TyCon Methods getUnique :: TyCon -> Unique #
Uniquable FastString
Instance details Defined in GHC.Types.Unique Methods getUnique :: FastString -> Unique #
Uniquable Ident
Instance details Defined in GHC.JS.Syntax Methods getUnique :: Ident -> Unique #
Uniquable EvBindsVar
Instance details Defined in GHC.Tc.Types.Evidence Methods getUnique :: EvBindsVar -> Unique #
Uniquable SkolemInfo
Instance details Defined in GHC.Tc.Types.Origin Methods getUnique :: SkolemInfo -> Unique #
Uniquable Name
Instance details Defined in GHC.Types.Name Methods getUnique :: Name -> Unique #
Uniquable OccName
Instance details Defined in GHC.Types.Name.Occurrence Methods getUnique :: OccName -> Unique #
Uniquable Unique
Instance details Defined in GHC.Types.Unique Methods getUnique :: Unique -> Unique #
Uniquable Var
Instance details Defined in GHC.Types.Var Methods getUnique :: Var -> Unique #
Uniquable PackageId
Instance details Defined in GHC.Unit.Info Methods getUnique :: PackageId -> Unique #
Uniquable PackageName
Instance details Defined in GHC.Unit.Info Methods getUnique :: PackageName -> Unique #
Uniquable Module
Instance details Defined in GHC.Unit.Types Methods getUnique :: Module -> Unique #
Uniquable UnitId
Instance details Defined in GHC.Unit.Types Methods getUnique :: UnitId -> Unique #
Uniquable ModuleName
Instance details Defined in GHC.Types.Unique Methods getUnique :: ModuleName -> Unique #
Uniquable Int
Instance details Defined in GHC.Types.Unique Methods getUnique :: Int -> Unique #
Uniquable (CoAxiom br)
Instance details Defined in GHC.Core.Coercion.Axiom Methods getUnique :: CoAxiom br -> Unique #
Uniquable unit => Uniquable (Definite unit)
Instance details Defined in GHC.Unit.Types Methods getUnique :: Definite unit -> Unique #
IsUnitId u => Uniquable (GenUnit u)
Instance details Defined in GHC.Unit.Types Methods getUnique :: GenUnit u -> Unique #

class NamedThing a where #

A class allowing convenient access to the Name of various datatypes

Minimal complete definition

getName

Methods

getOccName :: a -> OccName #

getName :: a -> Name #

Instances

Instances details

NamedThing Class
Instance details Defined in GHC.Core.Class Methods getOccName :: Class -> OccName # getName :: Class -> Name #
NamedThing ConLike
Instance details Defined in GHC.Core.ConLike Methods getOccName :: ConLike -> OccName # getName :: ConLike -> Name #
NamedThing DataCon
Instance details Defined in GHC.Core.DataCon Methods getOccName :: DataCon -> OccName # getName :: DataCon -> Name #
NamedThing FamInst
Instance details Defined in GHC.Core.FamInstEnv Methods getOccName :: FamInst -> OccName # getName :: FamInst -> Name #
NamedThing ClsInst
Instance details Defined in GHC.Core.InstEnv Methods getOccName :: ClsInst -> OccName # getName :: ClsInst -> Name #
NamedThing PatSyn
Instance details Defined in GHC.Core.PatSyn Methods getOccName :: PatSyn -> OccName # getName :: PatSyn -> Name #
NamedThing TyCon
Instance details Defined in GHC.Core.TyCon Methods getOccName :: TyCon -> OccName # getName :: TyCon -> Name #
NamedThing IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceClassOp -> OccName # getName :: IfaceClassOp -> Name #
NamedThing IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceConDecl -> OccName # getName :: IfaceConDecl -> Name #
NamedThing IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceDecl -> OccName # getName :: IfaceDecl -> Name #
NamedThing HoleFitCandidate
Instance details Defined in GHC.Tc.Errors.Hole.FitTypes Methods getOccName :: HoleFitCandidate -> OccName # getName :: HoleFitCandidate -> Name #
NamedThing Name
Instance details Defined in GHC.Types.Name Methods getOccName :: Name -> OccName # getName :: Name -> Name #
NamedThing TyThing
Instance details Defined in GHC.Types.TyThing Methods getOccName :: TyThing -> OccName # getName :: TyThing -> Name #
NamedThing Var
Instance details Defined in GHC.Types.Var Methods getOccName :: Var -> OccName # getName :: Var -> Name #
NamedThing (CoAxiom br)
Instance details Defined in GHC.Core.Coercion.Axiom Methods getOccName :: CoAxiom br -> OccName # getName :: CoAxiom br -> Name #
NamedThing e => NamedThing (Located e)
Instance details Defined in GHC.Types.Name Methods getOccName :: Located e -> OccName # getName :: Located e -> Name #
NamedThing (Located a) => NamedThing (LocatedAn an a)
Instance details Defined in GHC.Parser.Annotation Methods getOccName :: LocatedAn an a -> OccName # getName :: LocatedAn an a -> Name #
NamedThing tv => NamedThing (VarBndr tv flag)
Instance details Defined in GHC.Types.Var Methods getOccName :: VarBndr tv flag -> OccName # getName :: VarBndr tv flag -> Name #

type TyCoVar = Id #

Type or Coercion Variable

type TyVar = Var #

Type or kind Variable

data Specificity #

Whether an Invisible argument may appear in source Haskell.

Constructors

InferredSpec	the argument may not appear in source Haskell, it is only inferred.
SpecifiedSpec	the argument may appear in source Haskell, but isn't required.

Instances

Instances details

Data Specificity
Instance details Defined in GHC.Types.Var Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Specificity -> c Specificity # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Specificity # toConstr :: Specificity -> Constr # dataTypeOf :: Specificity -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Specificity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Specificity) # gmapT :: (forall b. Data b => b -> b) -> Specificity -> Specificity # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r # gmapQ :: (forall d. Data d => d -> u) -> Specificity -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Specificity -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity #
Binary Specificity
Instance details Defined in GHC.Types.Var Methods put_ :: BinHandle -> Specificity -> IO () # put :: BinHandle -> Specificity -> IO (Bin Specificity) # get :: BinHandle -> IO Specificity #
Eq Specificity
Instance details Defined in GHC.Types.Var Methods (==) :: Specificity -> Specificity -> Bool # (/=) :: Specificity -> Specificity -> Bool #
Ord Specificity
Instance details Defined in GHC.Types.Var Methods compare :: Specificity -> Specificity -> Ordering # (<) :: Specificity -> Specificity -> Bool # (<=) :: Specificity -> Specificity -> Bool # (>) :: Specificity -> Specificity -> Bool # (>=) :: Specificity -> Specificity -> Bool # max :: Specificity -> Specificity -> Specificity # min :: Specificity -> Specificity -> Specificity #
OutputableBndrFlag Specificity p
Instance details Defined in GHC.Hs.Type Methods pprTyVarBndr :: HsTyVarBndr Specificity (GhcPass p) -> SDoc
ReifyFlag Specificity Specificity
Instance details Defined in GHC.Tc.Gen.Splice Methods reifyFlag :: Specificity0 -> Specificity
Outputable tv => Outputable (VarBndr tv Specificity)
Instance details Defined in GHC.Types.Var Methods ppr :: VarBndr tv Specificity -> SDoc #

data FunTyFlag #

The non-dependent version of ForAllTyFlag. See Note [FunTyFlag] Appears here partly so that it's together with its friends ForAllTyFlag and ForallVisFlag, but also because it is used in IfaceType, rather early in the compilation chain

Constructors

FTF_T_T
FTF_T_C
FTF_C_T
FTF_C_C

Instances

Instances details

Data FunTyFlag
Instance details Defined in GHC.Types.Var Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunTyFlag -> c FunTyFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunTyFlag # toConstr :: FunTyFlag -> Constr # dataTypeOf :: FunTyFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FunTyFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunTyFlag) # gmapT :: (forall b. Data b => b -> b) -> FunTyFlag -> FunTyFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunTyFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunTyFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> FunTyFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FunTyFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunTyFlag -> m FunTyFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunTyFlag -> m FunTyFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunTyFlag -> m FunTyFlag #
Binary FunTyFlag
Instance details Defined in GHC.Types.Var Methods put_ :: BinHandle -> FunTyFlag -> IO () # put :: BinHandle -> FunTyFlag -> IO (Bin FunTyFlag) # get :: BinHandle -> IO FunTyFlag #
Outputable FunTyFlag
Instance details Defined in GHC.Types.Var Methods ppr :: FunTyFlag -> SDoc #
Eq FunTyFlag
Instance details Defined in GHC.Types.Var Methods (==) :: FunTyFlag -> FunTyFlag -> Bool # (/=) :: FunTyFlag -> FunTyFlag -> Bool #
Ord FunTyFlag
Instance details Defined in GHC.Types.Var Methods compare :: FunTyFlag -> FunTyFlag -> Ordering # (<) :: FunTyFlag -> FunTyFlag -> Bool # (<=) :: FunTyFlag -> FunTyFlag -> Bool # (>) :: FunTyFlag -> FunTyFlag -> Bool # (>=) :: FunTyFlag -> FunTyFlag -> Bool # max :: FunTyFlag -> FunTyFlag -> FunTyFlag # min :: FunTyFlag -> FunTyFlag -> FunTyFlag #

data ForAllTyFlag #

ForAllTyFlag

Is something required to appear in source Haskell (Required), permitted by request (Specified) (visible type application), or prohibited entirely from appearing in source Haskell (Inferred)? See Note [VarBndrs, ForAllTyBinders, TyConBinders, and visibility] in GHC.Core.TyCo.Rep

Constructors

Invisible Specificity
Required

Bundled Patterns

pattern Specified :: ForAllTyFlag
pattern Inferred :: ForAllTyFlag

Instances

Instances details

Data ForAllTyFlag
Instance details Defined in GHC.Types.Var Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForAllTyFlag -> c ForAllTyFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForAllTyFlag # toConstr :: ForAllTyFlag -> Constr # dataTypeOf :: ForAllTyFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForAllTyFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForAllTyFlag) # gmapT :: (forall b. Data b => b -> b) -> ForAllTyFlag -> ForAllTyFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForAllTyFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForAllTyFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> ForAllTyFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ForAllTyFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForAllTyFlag -> m ForAllTyFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForAllTyFlag -> m ForAllTyFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForAllTyFlag -> m ForAllTyFlag #
Binary ForAllTyFlag
Instance details Defined in GHC.Types.Var Methods put_ :: BinHandle -> ForAllTyFlag -> IO () # put :: BinHandle -> ForAllTyFlag -> IO (Bin ForAllTyFlag) # get :: BinHandle -> IO ForAllTyFlag #
Outputable ForAllTyFlag
Instance details Defined in GHC.Types.Var Methods ppr :: ForAllTyFlag -> SDoc #
Eq ForAllTyFlag
Instance details Defined in GHC.Types.Var Methods (==) :: ForAllTyFlag -> ForAllTyFlag -> Bool # (/=) :: ForAllTyFlag -> ForAllTyFlag -> Bool #
Ord ForAllTyFlag
Instance details Defined in GHC.Types.Var Methods compare :: ForAllTyFlag -> ForAllTyFlag -> Ordering # (<) :: ForAllTyFlag -> ForAllTyFlag -> Bool # (<=) :: ForAllTyFlag -> ForAllTyFlag -> Bool # (>) :: ForAllTyFlag -> ForAllTyFlag -> Bool # (>=) :: ForAllTyFlag -> ForAllTyFlag -> Bool # max :: ForAllTyFlag -> ForAllTyFlag -> ForAllTyFlag # min :: ForAllTyFlag -> ForAllTyFlag -> ForAllTyFlag #
Outputable tv => Outputable (VarBndr tv ForAllTyFlag)
Instance details Defined in GHC.Types.Var Methods ppr :: VarBndr tv ForAllTyFlag -> SDoc #

type TyConRepName = Name #

data TyThing #

A global typecheckable-thing, essentially anything that has a name. Not to be confused with a TcTyThing, which is also a typecheckable thing but in the *local* context. See GHC.Tc.Utils.Env for how to retrieve a TyThing given a Name.

Constructors

AnId Id
AConLike ConLike
ATyCon TyCon
ACoAxiom (CoAxiom Branched)

Instances

Instances details

NamedThing TyThing
Instance details Defined in GHC.Types.TyThing Methods getOccName :: TyThing -> OccName # getName :: TyThing -> Name #
Outputable TyThing
Instance details Defined in GHC.Types.TyThing Methods ppr :: TyThing -> SDoc #

type MCoercionN = MCoercion #

type CoercionN = Coercion #

type ThetaType = [PredType] #

A collection of PredTypes

type RuntimeRepType = Type #

Type synonym used for types of kind RuntimeRep.

type PredType = Type #

A type of the form p of constraint kind represents a value whose type is the Haskell predicate p, where a predicate is what occurs before the => in a Haskell type.

We use PredType as documentation to mark those types that we guarantee to have this kind.

It can be expanded into its representation, but:

The type checker must treat it as opaque
The rest of the compiler treats it as transparent

Consider these examples:

f :: (Eq a) => a -> Int
g :: (?x :: Int -> Int) => a -> Int
h :: (r\l) => {r} => {l::Int | r}

Here the Eq a and ?x :: Int -> Int and rl are all called "predicates"

type Mult = Type #

Mult is a type alias for Type.

Mult must contain Type because multiplicity variables are mere type variables (of kind Multiplicity) in Haskell. So the simplest implementation is to make Mult be Type.

Multiplicities can be formed with: - One: GHC.Types.One (= oneDataCon) - Many: GHC.Types.Many (= manyDataCon) - Multiplication: GHC.Types.MultMul (= multMulTyCon)

So that Mult feels a bit more structured, we provide pattern synonyms and smart constructors for these.

data Scaled a #

A shorthand for data with an attached Mult element (the multiplicity).

Instances

Instances details

Data a => Data (Scaled a)
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Scaled a -> c (Scaled a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Scaled a) # toConstr :: Scaled a -> Constr # dataTypeOf :: Scaled a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Scaled a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Scaled a)) # gmapT :: (forall b. Data b => b -> b) -> Scaled a -> Scaled a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Scaled a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Scaled a -> r # gmapQ :: (forall d. Data d => d -> u) -> Scaled a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Scaled a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a) #
Outputable a => Outputable (Scaled a)
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: Scaled a -> SDoc #

data MCoercion #

A semantically more meaningful type to represent what may or may not be a useful Coercion.

Constructors

MRefl
MCo Coercion

Instances

Instances details

Data MCoercion
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MCoercion -> c MCoercion # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MCoercion # toConstr :: MCoercion -> Constr # dataTypeOf :: MCoercion -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MCoercion) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MCoercion) # gmapT :: (forall b. Data b => b -> b) -> MCoercion -> MCoercion # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MCoercion -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MCoercion -> r # gmapQ :: (forall d. Data d => d -> u) -> MCoercion -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> MCoercion -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> MCoercion -> m MCoercion # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MCoercion -> m MCoercion # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MCoercion -> m MCoercion #
Outputable MCoercion
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: MCoercion -> SDoc #

data UnivCoProvenance #

For simplicity, we have just one UnivCo that represents a coercion from some type to some other type, with (in general) no restrictions on the type. The UnivCoProvenance specifies more exactly what the coercion really is and why a program should (or shouldn't!) trust the coercion. It is reasonable to consider each constructor of UnivCoProvenance as a totally independent coercion form; their only commonality is that they don't tell you what types they coercion between. (That info is in the UnivCo constructor of Coercion.

Instances

Instances details

Data UnivCoProvenance
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UnivCoProvenance -> c UnivCoProvenance # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UnivCoProvenance # toConstr :: UnivCoProvenance -> Constr # dataTypeOf :: UnivCoProvenance -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UnivCoProvenance) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UnivCoProvenance) # gmapT :: (forall b. Data b => b -> b) -> UnivCoProvenance -> UnivCoProvenance # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UnivCoProvenance -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UnivCoProvenance -> r # gmapQ :: (forall d. Data d => d -> u) -> UnivCoProvenance -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UnivCoProvenance -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UnivCoProvenance -> m UnivCoProvenance #
Outputable UnivCoProvenance
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: UnivCoProvenance -> SDoc #

data CoSel #

Constructors

SelTyCon Int Role
SelFun FunSel
SelForAll

Instances

Instances details

Data CoSel
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CoSel -> c CoSel # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CoSel # toConstr :: CoSel -> Constr # dataTypeOf :: CoSel -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CoSel) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CoSel) # gmapT :: (forall b. Data b => b -> b) -> CoSel -> CoSel # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CoSel -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CoSel -> r # gmapQ :: (forall d. Data d => d -> u) -> CoSel -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CoSel -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CoSel -> m CoSel # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CoSel -> m CoSel # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CoSel -> m CoSel #
NFData CoSel
Instance details Defined in GHC.Core.TyCo.Rep Methods rnf :: CoSel -> () #
Binary CoSel
Instance details Defined in GHC.Core.TyCo.Rep Methods put_ :: BinHandle -> CoSel -> IO () # put :: BinHandle -> CoSel -> IO (Bin CoSel) # get :: BinHandle -> IO CoSel #
Outputable CoSel
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: CoSel -> SDoc #
Eq CoSel
Instance details Defined in GHC.Core.TyCo.Rep Methods (==) :: CoSel -> CoSel -> Bool # (/=) :: CoSel -> CoSel -> Bool #

newtype NonDetUniqFM key ele #

A wrapper around UniqFM with the sole purpose of informing call sites that the provided Foldable and Traversable instances are nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.

Constructors

NonDetUniqFM
Fields getNonDet :: UniqFM key ele

Instances

Instances details

Foldable (NonDetUniqFM key)	Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.
Instance details Defined in GHC.Types.Unique.FM Methods fold :: Monoid m => NonDetUniqFM key m -> m # foldMap :: Monoid m => (a -> m) -> NonDetUniqFM key a -> m # foldMap' :: Monoid m => (a -> m) -> NonDetUniqFM key a -> m # foldr :: (a -> b -> b) -> b -> NonDetUniqFM key a -> b # foldr' :: (a -> b -> b) -> b -> NonDetUniqFM key a -> b # foldl :: (b -> a -> b) -> b -> NonDetUniqFM key a -> b # foldl' :: (b -> a -> b) -> b -> NonDetUniqFM key a -> b # foldr1 :: (a -> a -> a) -> NonDetUniqFM key a -> a # foldl1 :: (a -> a -> a) -> NonDetUniqFM key a -> a # toList :: NonDetUniqFM key a -> [a] # null :: NonDetUniqFM key a -> Bool # length :: NonDetUniqFM key a -> Int # elem :: Eq a => a -> NonDetUniqFM key a -> Bool # maximum :: Ord a => NonDetUniqFM key a -> a # minimum :: Ord a => NonDetUniqFM key a -> a # sum :: Num a => NonDetUniqFM key a -> a # product :: Num a => NonDetUniqFM key a -> a #
Traversable (NonDetUniqFM key)	Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.
Instance details Defined in GHC.Types.Unique.FM Methods traverse :: Applicative f => (a -> f b) -> NonDetUniqFM key a -> f (NonDetUniqFM key b) # sequenceA :: Applicative f => NonDetUniqFM key (f a) -> f (NonDetUniqFM key a) # mapM :: Monad m => (a -> m b) -> NonDetUniqFM key a -> m (NonDetUniqFM key b) # sequence :: Monad m => NonDetUniqFM key (m a) -> m (NonDetUniqFM key a) #
Functor (NonDetUniqFM key)
Instance details Defined in GHC.Types.Unique.FM Methods fmap :: (a -> b) -> NonDetUniqFM key a -> NonDetUniqFM key b # (<$) :: a -> NonDetUniqFM key b -> NonDetUniqFM key a #

data UniqFM key ele #

A finite map from uniques of one type to elements in another type.

The key is just here to keep us honest. It's always safe to use a single type as key. If two types don't overlap in their uniques it's also safe to index the same map at multiple key types. But this is very much discouraged.

Instances

Instances details

Functor (UniqFM key)
Instance details Defined in GHC.Types.Unique.FM Methods fmap :: (a -> b) -> UniqFM key a -> UniqFM key b # (<$) :: a -> UniqFM key b -> UniqFM key a #
(Data key, Data ele) => Data (UniqFM key ele)
Instance details Defined in GHC.Types.Unique.FM Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqFM key ele -> c (UniqFM key ele) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (UniqFM key ele) # toConstr :: UniqFM key ele -> Constr # dataTypeOf :: UniqFM key ele -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (UniqFM key ele)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (UniqFM key ele)) # gmapT :: (forall b. Data b => b -> b) -> UniqFM key ele -> UniqFM key ele # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqFM key ele -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqFM key ele -> r # gmapQ :: (forall d. Data d => d -> u) -> UniqFM key ele -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqFM key ele -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqFM key ele -> m (UniqFM key ele) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqFM key ele -> m (UniqFM key ele) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqFM key ele -> m (UniqFM key ele) #
Monoid (UniqFM key a)
Instance details Defined in GHC.Types.Unique.FM Methods mempty :: UniqFM key a # mappend :: UniqFM key a -> UniqFM key a -> UniqFM key a # mconcat :: [UniqFM key a] -> UniqFM key a #
Semigroup (UniqFM key a)
Instance details Defined in GHC.Types.Unique.FM Methods (<>) :: UniqFM key a -> UniqFM key a -> UniqFM key a # sconcat :: NonEmpty (UniqFM key a) -> UniqFM key a # stimes :: Integral b => b -> UniqFM key a -> UniqFM key a #
NFData (UniqFM Name [Name]) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: UniqFM Name [Name] -> () #
Outputable a => Outputable (UniqFM key a)
Instance details Defined in GHC.Types.Unique.FM Methods ppr :: UniqFM key a -> SDoc #
Eq ele => Eq (UniqFM key ele)
Instance details Defined in GHC.Types.Unique.FM Methods (==) :: UniqFM key ele -> UniqFM key ele -> Bool # (/=) :: UniqFM key ele -> UniqFM key ele -> Bool #

class Monad m => MonadUnique (m :: Type -> Type) where #

A monad for generating unique identifiers

Minimal complete definition

getUniqueSupplyM

Methods

getUniqueSupplyM :: m UniqSupply #

Get a new UniqueSupply

getUniqueM :: m Unique #

Get a new unique identifier

getUniquesM :: m [Unique] #

Get an infinite list of new unique identifiers

Instances

Instances details

MonadUnique StgM
Instance details Defined in GHC.Stg.Pipeline Methods getUniqueSupplyM :: StgM UniqSupply # getUniqueM :: StgM Unique # getUniquesM :: StgM [Unique] #
MonadUnique TcS
Instance details Defined in GHC.Tc.Solver.Monad Methods getUniqueSupplyM :: TcS UniqSupply # getUniqueM :: TcS Unique # getUniquesM :: TcS [Unique] #
MonadUnique UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods getUniqueSupplyM :: UniqSM UniqSupply # getUniqueM :: UniqSM Unique # getUniquesM :: UniqSM [Unique] #

data UniqSM result #

A monad which just gives the ability to obtain Uniques

Instances

Instances details

MonadFail UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods fail :: String -> UniqSM a #
MonadFix UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods mfix :: (a -> UniqSM a) -> UniqSM a #
Applicative UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods pure :: a -> UniqSM a # (<>) :: UniqSM (a -> b) -> UniqSM a -> UniqSM b # liftA2 :: (a -> b -> c) -> UniqSM a -> UniqSM b -> UniqSM c # (>) :: UniqSM a -> UniqSM b -> UniqSM b # (<*) :: UniqSM a -> UniqSM b -> UniqSM a #
Functor UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods fmap :: (a -> b) -> UniqSM a -> UniqSM b # (<$) :: a -> UniqSM b -> UniqSM a #
Monad UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods (>>=) :: UniqSM a -> (a -> UniqSM b) -> UniqSM b # (>>) :: UniqSM a -> UniqSM b -> UniqSM b # return :: a -> UniqSM a #
MonadUnique UniqSM
Instance details Defined in GHC.Types.Unique.Supply Methods getUniqueSupplyM :: UniqSM UniqSupply # getUniqueM :: UniqSM Unique # getUniquesM :: UniqSM [Unique] #

data UniqSupply #

Unique Supply

A value of type UniqSupply is unique, and it can supply one distinct Unique. Also, from the supply, one can also manufacture an arbitrary number of further UniqueSupply values, which will be distinct from the first and from all others.

data LayoutInfo pass #

Layout information for declarations.

Constructors

ExplicitBraces !(LHsToken "{" pass) !(LHsToken "}" pass)	Explicit braces written by the user. class C a where { foo :: a; bar :: a }
VirtualBraces	Virtual braces inserted by the layout algorithm. class C a where foo :: a bar :: a
Fields !Int Layout column (indentation level, begins at 1)
NoLayoutInfo	Empty or compiler-generated blocks do not have layout information associated with them.

Instances

Instances details

Typeable p => Data (LayoutInfo (GhcPass p))

Instance details

Defined in GHC.Hs.Extension

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LayoutInfo (GhcPass p) -> c (LayoutInfo (GhcPass p)) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (LayoutInfo (GhcPass p)) #

toConstr :: LayoutInfo (GhcPass p) -> Constr #

dataTypeOf :: LayoutInfo (GhcPass p) -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (LayoutInfo (GhcPass p))) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (LayoutInfo (GhcPass p))) #

gmapT :: (forall b. Data b => b -> b) -> LayoutInfo (GhcPass p) -> LayoutInfo (GhcPass p) #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LayoutInfo (GhcPass p) -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LayoutInfo (GhcPass p) -> r #

gmapQ :: (forall d. Data d => d -> u) -> LayoutInfo (GhcPass p) -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> LayoutInfo (GhcPass p) -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) #

data HsUniToken (tok :: Symbol) (utok :: Symbol) #

With UnicodeSyntax, there might be multiple ways to write the same token. For example an arrow could be either -> or →. This choice must be recorded in order to exactprint such tokens, so instead of HsToken "->" we introduce HsUniToken "->" "→".

See also IsUnicodeSyntax in GHC.Parser.Annotation; we do not use here to avoid a dependency.

Constructors

HsNormalTok
HsUnicodeTok

Instances

Instances details

(KnownSymbol tok, KnownSymbol utok) => Data (HsUniToken tok utok)
Instance details Defined in Language.Haskell.Syntax.Concrete Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsUniToken tok utok -> c (HsUniToken tok utok) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsUniToken tok utok) # toConstr :: HsUniToken tok utok -> Constr # dataTypeOf :: HsUniToken tok utok -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsUniToken tok utok)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsUniToken tok utok)) # gmapT :: (forall b. Data b => b -> b) -> HsUniToken tok utok -> HsUniToken tok utok # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsUniToken tok utok -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsUniToken tok utok -> r # gmapQ :: (forall d. Data d => d -> u) -> HsUniToken tok utok -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsUniToken tok utok -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsUniToken tok utok -> m (HsUniToken tok utok) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsUniToken tok utok -> m (HsUniToken tok utok) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsUniToken tok utok -> m (HsUniToken tok utok) #
type Anno (HsUniToken tok utok)
Instance details Defined in GHC.Hs.Extension type Anno (HsUniToken tok utok) = TokenLocation

data HsToken (tok :: Symbol) #

A token stored in the syntax tree. For example, when parsing a let-expression, we store HsToken "let" and HsToken "in". The locations of those tokens can be used to faithfully reproduce (exactprint) the original program text.

Constructors

HsTok

Instances

Instances details

KnownSymbol tok => Data (HsToken tok)
Instance details Defined in Language.Haskell.Syntax.Concrete Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsToken tok -> c (HsToken tok) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsToken tok) # toConstr :: HsToken tok -> Constr # dataTypeOf :: HsToken tok -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsToken tok)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsToken tok)) # gmapT :: (forall b. Data b => b -> b) -> HsToken tok -> HsToken tok # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsToken tok -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsToken tok -> r # gmapQ :: (forall d. Data d => d -> u) -> HsToken tok -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsToken tok -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsToken tok -> m (HsToken tok) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsToken tok -> m (HsToken tok) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsToken tok -> m (HsToken tok) #
type Anno (HsToken tok)
Instance details Defined in GHC.Hs.Extension type Anno (HsToken tok) = TokenLocation

type LHsUniToken (tok :: Symbol) (utok :: Symbol) p = XRec p (HsUniToken tok utok) #

type LHsToken (tok :: Symbol) p = XRec p (HsToken tok) #

type RealLocated = GenLocated RealSrcSpan #

type Located = GenLocated SrcSpan #

data GenLocated l e #

We attach SrcSpans to lots of things, so let's have a datatype for it.

Constructors

L l e

Instances

Instances details

Bifunctor GenLocated Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods bimap :: (a -> b) -> (c -> d) -> GenLocated a c -> GenLocated b d # first :: (a -> b) -> GenLocated a c -> GenLocated b c # second :: (b -> c) -> GenLocated a b -> GenLocated a c #
Foldable (GenLocated l)
Instance details Defined in GHC.Types.SrcLoc Methods fold :: Monoid m => GenLocated l m -> m # foldMap :: Monoid m => (a -> m) -> GenLocated l a -> m # foldMap' :: Monoid m => (a -> m) -> GenLocated l a -> m # foldr :: (a -> b -> b) -> b -> GenLocated l a -> b # foldr' :: (a -> b -> b) -> b -> GenLocated l a -> b # foldl :: (b -> a -> b) -> b -> GenLocated l a -> b # foldl' :: (b -> a -> b) -> b -> GenLocated l a -> b # foldr1 :: (a -> a -> a) -> GenLocated l a -> a # foldl1 :: (a -> a -> a) -> GenLocated l a -> a # toList :: GenLocated l a -> [a] # null :: GenLocated l a -> Bool # length :: GenLocated l a -> Int # elem :: Eq a => a -> GenLocated l a -> Bool # maximum :: Ord a => GenLocated l a -> a # minimum :: Ord a => GenLocated l a -> a # sum :: Num a => GenLocated l a -> a # product :: Num a => GenLocated l a -> a #
Traversable (GenLocated l)
Instance details Defined in GHC.Types.SrcLoc Methods traverse :: Applicative f => (a -> f b) -> GenLocated l a -> f (GenLocated l b) # sequenceA :: Applicative f => GenLocated l (f a) -> f (GenLocated l a) # mapM :: Monad m => (a -> m b) -> GenLocated l a -> m (GenLocated l b) # sequence :: Monad m => GenLocated l (m a) -> m (GenLocated l a) #
Functor (GenLocated l)
Instance details Defined in GHC.Types.SrcLoc Methods fmap :: (a -> b) -> GenLocated l a -> GenLocated l b # (<$) :: a -> GenLocated l b -> GenLocated l a #
HasLoc (LocatedA a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedA a -> SrcSpan
HasLoc (LocatedN a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedN a -> SrcSpan
HasLoc (Located a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: Located a -> SrcSpan
HiePass p => HasType (LocatedA (HsBind (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))	This instance tries to construct `HieAST` nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs. See Note [Computing the type of every node in the tree]
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (Pat (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]
ToHie (LBooleanFormula (LocatedN Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]
ToHie (LHsDoc GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LHsDoc GhcRn -> HieM [HieAST Type]
HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedA a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedA a) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedN a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedN a) -> HieM [HieAST Type]
ToHie (Context (Located Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Name) -> HieM [HieAST Type]
ToHie (Context (Located Var))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Var) -> HieM [HieAST Type]
ToHie (Context (Located NoExtField))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located NoExtField) -> HieM [HieAST Type]
ToHie (EvBindContext (LocatedA TcEvBinds))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IE GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IEWrappedName GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IEWrappedName GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA ModuleName))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]
ToHie (IEContext (Located FieldLabel))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]
HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]
(ToHie (RFContext label), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsFieldBind label arg)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (LocatedA (HsFieldBind label arg)) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)) -> HieM [HieAST Type]
HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]
ToHie (TScoped (LocatedA (HsSigType GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]
ToHie (LocatedA HsWrapper)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA HsWrapper -> HieM [HieAST Type]
ToHie (LocatedA (FixitySig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (AnnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ClsInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DataFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DefaultDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DerivDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DocDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DocDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FamilyDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ForeignDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FunDep GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (InstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RoleAnnotDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (SpliceDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (StandaloneKindSig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyClDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsUntypedSplice (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsUntypedSplice (GhcPass p)) -> HieM [HieAST Type]
(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
ToHie (LocatedA (ImportDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDeclField GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (HsType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC (DerivClauseTys GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC [LocatedA (HsType GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedP OverlapMode)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedP OverlapMode -> HieM [HieAST Type]
HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]
ToHie (Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)] -> HieM [HieAST Type]
NamedThing e => NamedThing (Located e)
Instance details Defined in GHC.Types.Name Methods getOccName :: Located e -> OccName # getName :: Located e -> Name #
Outputable e => Outputable (Located e)
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: Located e -> SDoc #
(Data l, Data e) => Data (GenLocated l e)
Instance details Defined in GHC.Types.SrcLoc Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenLocated l e -> c (GenLocated l e) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenLocated l e) # toConstr :: GenLocated l e -> Constr # dataTypeOf :: GenLocated l e -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenLocated l e)) # dataCast2 :: Typeable t => (forall d e0. (Data d, Data e0) => c (t d e0)) -> Maybe (c (GenLocated l e)) # gmapT :: (forall b. Data b => b -> b) -> GenLocated l e -> GenLocated l e # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r # gmapQ :: (forall d. Data d => d -> u) -> GenLocated l e -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GenLocated l e -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e) #
(Show l, Show e) => Show (GenLocated l e)
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> GenLocated l e -> ShowS # show :: GenLocated l e -> String # showList :: [GenLocated l e] -> ShowS #
(NFData l, NFData e) => NFData (GenLocated l e)
Instance details Defined in GHC.Types.SrcLoc Methods rnf :: GenLocated l e -> () #
ToHie (LocatedAn NoEpAnns (HsDerivingClause GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsDerivingClause GhcRn) -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns (InjectivityAnn GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (InjectivityAnn GhcRn) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedAn NoEpAnns (HsCmdTop (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns HsIPName)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns HsIPName -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
NamedThing (Located a) => NamedThing (LocatedAn an a)
Instance details Defined in GHC.Parser.Annotation Methods getOccName :: LocatedAn an a -> OccName # getName :: LocatedAn an a -> Name #
Outputable (GenLocated Anchor EpaComment)
Instance details Defined in GHC.Parser.Annotation Methods ppr :: GenLocated Anchor EpaComment -> SDoc #
(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)
Instance details Defined in GHC.Parser.Annotation Methods ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc #
Outputable a => Outputable (GenLocated TokenLocation a)
Instance details Defined in GHC.Parser.Annotation Methods ppr :: GenLocated TokenLocation a -> SDoc #
Outputable e => Outputable (GenLocated RealSrcSpan e)
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: GenLocated RealSrcSpan e -> SDoc #
(Outputable a, OutputableBndr e) => OutputableBndr (GenLocated (SrcSpanAnn' a) e)
Instance details Defined in GHC.Parser.Annotation Methods pprBndr :: BindingSite -> GenLocated (SrcSpanAnn' a) e -> SDoc # pprPrefixOcc :: GenLocated (SrcSpanAnn' a) e -> SDoc # pprInfixOcc :: GenLocated (SrcSpanAnn' a) e -> SDoc # bndrIsJoin_maybe :: GenLocated (SrcSpanAnn' a) e -> Maybe Int #
(Eq l, Eq e) => Eq (GenLocated l e)
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: GenLocated l e -> GenLocated l e -> Bool # (/=) :: GenLocated l e -> GenLocated l e -> Bool #
(Ord l, Ord e) => Ord (GenLocated l e)
Instance details Defined in GHC.Types.SrcLoc Methods compare :: GenLocated l e -> GenLocated l e -> Ordering # (<) :: GenLocated l e -> GenLocated l e -> Bool # (<=) :: GenLocated l e -> GenLocated l e -> Bool # (>) :: GenLocated l e -> GenLocated l e -> Bool # (>=) :: GenLocated l e -> GenLocated l e -> Bool # max :: GenLocated l e -> GenLocated l e -> GenLocated l e # min :: GenLocated l e -> GenLocated l e -> GenLocated l e #
HasSrcSpan (GenLocated (SrcSpanAnn' ann) a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan Source #
HasSrcSpan (GenLocated SrcSpan a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated SrcSpan a -> SrcSpan Source #
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno (LocatedN Name)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Name) = SrcSpan
type Anno (LocatedN RdrName)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN RdrName) = SrcSpan
type Anno (LocatedN Id)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Id) = SrcSpan
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type Anno [LocatedN Name]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Name] = SrcSpan
type Anno [LocatedN RdrName]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN RdrName] = SrcSpan
type Anno [LocatedN Id]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Id] = SrcSpan
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data SrcSpan #

Source Span

A SrcSpan identifies either a specific portion of a text file or a human-readable description of a location.

Constructors

UnhelpfulSpan !UnhelpfulSpanReason

Instances

Instances details

Data SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpan -> c SrcSpan # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcSpan # toConstr :: SrcSpan -> Constr # dataTypeOf :: SrcSpan -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcSpan) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcSpan) # gmapT :: (forall b. Data b => b -> b) -> SrcSpan -> SrcSpan # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r # gmapQ :: (forall d. Data d => d -> u) -> SrcSpan -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpan -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan #
Show SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> SrcSpan -> ShowS # show :: SrcSpan -> String # showList :: [SrcSpan] -> ShowS #
NFData SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods rnf :: SrcSpan -> () #
ToJson SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods json :: SrcSpan -> JsonDoc #
Outputable SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: SrcSpan -> SDoc #
Eq SrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: SrcSpan -> SrcSpan -> Bool # (/=) :: SrcSpan -> SrcSpan -> Bool #
Ord SrcSpan Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods compare :: SrcSpan -> SrcSpan -> Ordering # (<) :: SrcSpan -> SrcSpan -> Bool # (<=) :: SrcSpan -> SrcSpan -> Bool # (>) :: SrcSpan -> SrcSpan -> Bool # (>=) :: SrcSpan -> SrcSpan -> Bool # max :: SrcSpan -> SrcSpan -> SrcSpan # min :: SrcSpan -> SrcSpan -> SrcSpan #
HasSrcSpan SrcSpan Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: SrcSpan -> SrcSpan Source #
HasLoc (Located a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: Located a -> SrcSpan
ToHie (LHsDoc GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LHsDoc GhcRn -> HieM [HieAST Type]
ToHie (Context (Located Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Name) -> HieM [HieAST Type]
ToHie (Context (Located Var))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located Var) -> HieM [HieAST Type]
ToHie (Context (Located NoExtField))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (Located NoExtField) -> HieM [HieAST Type]
ToHie (IEContext (Located FieldLabel))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]
HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]
ToHie (Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)] -> HieM [HieAST Type]
NamedThing e => NamedThing (Located e)
Instance details Defined in GHC.Types.Name Methods getOccName :: Located e -> OccName # getName :: Located e -> Name #
Outputable e => Outputable (Located e)
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: Located e -> SDoc #
HasSrcSpan (GenLocated SrcSpan a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated SrcSpan a -> SrcSpan Source #

data RealSrcSpan #

A RealSrcSpan delimits a portion of a text file. It could be represented by a pair of (line,column) coordinates, but in fact we optimise slightly by using more compact representations for single-line and zero-length spans, both of which are quite common.

The end position is defined to be the column after the end of the span. That is, a span of (1,1)-(1,2) is one character long, and a span of (1,1)-(1,1) is zero characters long.

Real Source Span

Instances

Instances details

FromJSON RealSrcSpan Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods parseJSON :: Value -> Parser RealSrcSpan # parseJSONList :: Value -> Parser [RealSrcSpan] # omittedField :: Maybe RealSrcSpan #
ToJSON RealSrcSpan Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods toJSON :: RealSrcSpan -> Value # toEncoding :: RealSrcSpan -> Encoding # toJSONList :: [RealSrcSpan] -> Value # toEncodingList :: [RealSrcSpan] -> Encoding # omitField :: RealSrcSpan -> Bool #
Data RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RealSrcSpan -> c RealSrcSpan # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RealSrcSpan # toConstr :: RealSrcSpan -> Constr # dataTypeOf :: RealSrcSpan -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RealSrcSpan) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RealSrcSpan) # gmapT :: (forall b. Data b => b -> b) -> RealSrcSpan -> RealSrcSpan # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r # gmapQ :: (forall d. Data d => d -> u) -> RealSrcSpan -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> RealSrcSpan -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan #
Show RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> RealSrcSpan -> ShowS # show :: RealSrcSpan -> String # showList :: [RealSrcSpan] -> ShowS #
NFData RealSrcSpan Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: RealSrcSpan -> () #
ToJson RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods json :: RealSrcSpan -> JsonDoc #
Outputable RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: RealSrcSpan -> SDoc #
Eq RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: RealSrcSpan -> RealSrcSpan -> Bool # (/=) :: RealSrcSpan -> RealSrcSpan -> Bool #
Ord RealSrcSpan
Instance details Defined in GHC.Types.SrcLoc Methods compare :: RealSrcSpan -> RealSrcSpan -> Ordering # (<) :: RealSrcSpan -> RealSrcSpan -> Bool # (<=) :: RealSrcSpan -> RealSrcSpan -> Bool # (>) :: RealSrcSpan -> RealSrcSpan -> Bool # (>=) :: RealSrcSpan -> RealSrcSpan -> Bool # max :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan # min :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan #
MapAge RealSrcSpan Source #
Instance details Defined in Development.IDE.Core.UseStale Methods mapAgeFrom :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked to RealSrcSpan -> Maybe (Tracked from RealSrcSpan) Source # mapAgeTo :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked from RealSrcSpan -> Maybe (Tracked to RealSrcSpan) Source #
Outputable e => Outputable (GenLocated RealSrcSpan e)
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: GenLocated RealSrcSpan e -> SDoc #

data BufSpan #

StringBuffer Source Span

Instances

Instances details

Data BufSpan
Instance details Defined in GHC.Types.SrcLoc Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BufSpan -> c BufSpan # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BufSpan # toConstr :: BufSpan -> Constr # dataTypeOf :: BufSpan -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BufSpan) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BufSpan) # gmapT :: (forall b. Data b => b -> b) -> BufSpan -> BufSpan # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BufSpan -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BufSpan -> r # gmapQ :: (forall d. Data d => d -> u) -> BufSpan -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BufSpan -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BufSpan -> m BufSpan # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BufSpan -> m BufSpan # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BufSpan -> m BufSpan #
Semigroup BufSpan
Instance details Defined in GHC.Types.SrcLoc Methods (<>) :: BufSpan -> BufSpan -> BufSpan # sconcat :: NonEmpty BufSpan -> BufSpan # stimes :: Integral b => b -> BufSpan -> BufSpan #
Show BufSpan
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> BufSpan -> ShowS # show :: BufSpan -> String # showList :: [BufSpan] -> ShowS #
Eq BufSpan
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: BufSpan -> BufSpan -> Bool # (/=) :: BufSpan -> BufSpan -> Bool #
Ord BufSpan
Instance details Defined in GHC.Types.SrcLoc Methods compare :: BufSpan -> BufSpan -> Ordering # (<) :: BufSpan -> BufSpan -> Bool # (<=) :: BufSpan -> BufSpan -> Bool # (>) :: BufSpan -> BufSpan -> Bool # (>=) :: BufSpan -> BufSpan -> Bool # max :: BufSpan -> BufSpan -> BufSpan # min :: BufSpan -> BufSpan -> BufSpan #

data RealSrcLoc #

Real Source Location

Represents a single point within a file

Instances

Instances details

Show RealSrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods showsPrec :: Int -> RealSrcLoc -> ShowS # show :: RealSrcLoc -> String # showList :: [RealSrcLoc] -> ShowS #
Outputable RealSrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods ppr :: RealSrcLoc -> SDoc #
Eq RealSrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods (==) :: RealSrcLoc -> RealSrcLoc -> Bool # (/=) :: RealSrcLoc -> RealSrcLoc -> Bool #
Ord RealSrcLoc
Instance details Defined in GHC.Types.SrcLoc Methods compare :: RealSrcLoc -> RealSrcLoc -> Ordering # (<) :: RealSrcLoc -> RealSrcLoc -> Bool # (<=) :: RealSrcLoc -> RealSrcLoc -> Bool # (>) :: RealSrcLoc -> RealSrcLoc -> Bool # (>=) :: RealSrcLoc -> RealSrcLoc -> Bool # max :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc # min :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc #

type FastStringEnv a = UniqFM FastString a #

A non-deterministic set of FastStrings. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DFastStringEnv if the set eventually gets converted into a list or folded over in a way where the order changes the generated code.

data StringLiteral #

A String Literal in the source, including its original raw format for use by source to source manipulation tools.

Constructors

StringLiteral
Fields sl_st :: SourceText sl_fs :: FastString sl_tc :: Maybe RealSrcSpan

Instances

Instances details

Data StringLiteral
Instance details Defined in GHC.Types.SourceText Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> StringLiteral -> c StringLiteral # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c StringLiteral # toConstr :: StringLiteral -> Constr # dataTypeOf :: StringLiteral -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c StringLiteral) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c StringLiteral) # gmapT :: (forall b. Data b => b -> b) -> StringLiteral -> StringLiteral # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> StringLiteral -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> StringLiteral -> r # gmapQ :: (forall d. Data d => d -> u) -> StringLiteral -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> StringLiteral -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> StringLiteral -> m StringLiteral # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> StringLiteral -> m StringLiteral # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> StringLiteral -> m StringLiteral #
Binary StringLiteral
Instance details Defined in GHC.Types.SourceText Methods put_ :: BinHandle -> StringLiteral -> IO () # put :: BinHandle -> StringLiteral -> IO (Bin StringLiteral) # get :: BinHandle -> IO StringLiteral #
Outputable StringLiteral
Instance details Defined in GHC.Types.SourceText Methods ppr :: StringLiteral -> SDoc #
Eq StringLiteral
Instance details Defined in GHC.Types.SourceText Methods (==) :: StringLiteral -> StringLiteral -> Bool # (/=) :: StringLiteral -> StringLiteral -> Bool #
type Anno StringLiteral
Instance details Defined in GHC.Hs.Binds type Anno StringLiteral = SrcAnn NoEpAnns

data FractionalLit #

Fractional Literal

Used (instead of Rational) to represent exactly the floating point literal that we encountered in the user's source program. This allows us to pretty-print exactly what the user wrote, which is important e.g. for floating point numbers that can't represented as Doubles (we used to via Double for pretty-printing). See also #2245. Note [FractionalLit representation] in GHC.HsToCore.Match.Literal The actual value then is: sign * fl_signi * (fl_exp_base^fl_exp) where sign = if fl_neg then (-1) else 1

For example FL { fl_neg = True, fl_signi = 5.3, fl_exp = 4, fl_exp_base = Base10 } denotes -5300

Constructors

FL
Fields fl_text :: SourceText How the value was written in the source fl_neg :: Bool fl_signi :: Rational fl_exp :: Integer fl_exp_base :: FractionalExponentBase

Instances

Instances details

Data FractionalLit
Instance details Defined in GHC.Types.SourceText Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FractionalLit -> c FractionalLit # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FractionalLit # toConstr :: FractionalLit -> Constr # dataTypeOf :: FractionalLit -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FractionalLit) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FractionalLit) # gmapT :: (forall b. Data b => b -> b) -> FractionalLit -> FractionalLit # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FractionalLit -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FractionalLit -> r # gmapQ :: (forall d. Data d => d -> u) -> FractionalLit -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FractionalLit -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FractionalLit -> m FractionalLit # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FractionalLit -> m FractionalLit # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FractionalLit -> m FractionalLit #
Show FractionalLit
Instance details Defined in GHC.Types.SourceText Methods showsPrec :: Int -> FractionalLit -> ShowS # show :: FractionalLit -> String # showList :: [FractionalLit] -> ShowS #
Outputable FractionalLit
Instance details Defined in GHC.Types.SourceText Methods ppr :: FractionalLit -> SDoc #
Eq FractionalLit	Be wary of using this instance to compare for equal values when exponents are large. The same value expressed in different syntactic form won't compare as equal when any of the exponents is >= 100.
Instance details Defined in GHC.Types.SourceText Methods (==) :: FractionalLit -> FractionalLit -> Bool # (/=) :: FractionalLit -> FractionalLit -> Bool #
Ord FractionalLit	Be wary of using this instance to compare for equal values when exponents are large. The same value expressed in different syntactic form won't compare as equal when any of the exponents is >= 100.
Instance details Defined in GHC.Types.SourceText Methods compare :: FractionalLit -> FractionalLit -> Ordering # (<) :: FractionalLit -> FractionalLit -> Bool # (<=) :: FractionalLit -> FractionalLit -> Bool # (>) :: FractionalLit -> FractionalLit -> Bool # (>=) :: FractionalLit -> FractionalLit -> Bool # max :: FractionalLit -> FractionalLit -> FractionalLit # min :: FractionalLit -> FractionalLit -> FractionalLit #

data IntegralLit #

Integral Literal

Used (instead of Integer) to represent negative zegative zero which is required for NegativeLiterals extension to correctly parse `-0::Double` as negative zero. See also #13211.

Constructors

IL
Fields il_text :: SourceText il_neg :: Bool il_value :: Integer

Instances

Instances details

Data IntegralLit
Instance details Defined in GHC.Types.SourceText Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntegralLit -> c IntegralLit # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IntegralLit # toConstr :: IntegralLit -> Constr # dataTypeOf :: IntegralLit -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IntegralLit) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IntegralLit) # gmapT :: (forall b. Data b => b -> b) -> IntegralLit -> IntegralLit # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntegralLit -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntegralLit -> r # gmapQ :: (forall d. Data d => d -> u) -> IntegralLit -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IntegralLit -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntegralLit -> m IntegralLit # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntegralLit -> m IntegralLit # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntegralLit -> m IntegralLit #
Show IntegralLit
Instance details Defined in GHC.Types.SourceText Methods showsPrec :: Int -> IntegralLit -> ShowS # show :: IntegralLit -> String # showList :: [IntegralLit] -> ShowS #
Outputable IntegralLit
Instance details Defined in GHC.Types.SourceText Methods ppr :: IntegralLit -> SDoc #
Eq IntegralLit
Instance details Defined in GHC.Types.SourceText Methods (==) :: IntegralLit -> IntegralLit -> Bool # (/=) :: IntegralLit -> IntegralLit -> Bool #
Ord IntegralLit
Instance details Defined in GHC.Types.SourceText Methods compare :: IntegralLit -> IntegralLit -> Ordering # (<) :: IntegralLit -> IntegralLit -> Bool # (<=) :: IntegralLit -> IntegralLit -> Bool # (>) :: IntegralLit -> IntegralLit -> Bool # (>=) :: IntegralLit -> IntegralLit -> Bool # max :: IntegralLit -> IntegralLit -> IntegralLit # min :: IntegralLit -> IntegralLit -> IntegralLit #

data SourceText #

Constructors

SourceText String
NoSourceText	For when code is generated, e.g. TH, deriving. The pretty printer will then make its own representation of the item.

Instances

Instances details

Data SourceText
Instance details Defined in GHC.Types.SourceText Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SourceText -> c SourceText # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SourceText # toConstr :: SourceText -> Constr # dataTypeOf :: SourceText -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SourceText) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SourceText) # gmapT :: (forall b. Data b => b -> b) -> SourceText -> SourceText # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r # gmapQ :: (forall d. Data d => d -> u) -> SourceText -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SourceText -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText #
Show SourceText
Instance details Defined in GHC.Types.SourceText Methods showsPrec :: Int -> SourceText -> ShowS # show :: SourceText -> String # showList :: [SourceText] -> ShowS #
Binary SourceText
Instance details Defined in GHC.Types.SourceText Methods put_ :: BinHandle -> SourceText -> IO () # put :: BinHandle -> SourceText -> IO (Bin SourceText) # get :: BinHandle -> IO SourceText #
Outputable SourceText
Instance details Defined in GHC.Types.SourceText Methods ppr :: SourceText -> SDoc #
Eq SourceText
Instance details Defined in GHC.Types.SourceText Methods (==) :: SourceText -> SourceText -> Bool # (/=) :: SourceText -> SourceText -> Bool #
type Anno (SourceText, RuleName)
Instance details Defined in GHC.Hs.Decls type Anno (SourceText, RuleName) = SrcAnn NoEpAnns

data SafeHaskellMode #

The various Safe Haskell modes

Constructors

Sf_None	inferred unsafe
Sf_Unsafe	declared and checked
Sf_Trustworthy	declared and checked
Sf_Safe	declared and checked
Sf_SafeInferred	inferred as safe
Sf_Ignore	`-fno-safe-haskell` state

Instances

Instances details

Show SafeHaskellMode
Instance details Defined in GHC.Types.SafeHaskell Methods showsPrec :: Int -> SafeHaskellMode -> ShowS # show :: SafeHaskellMode -> String # showList :: [SafeHaskellMode] -> ShowS #
NFData SafeHaskellMode Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: SafeHaskellMode -> () #
Outputable SafeHaskellMode
Instance details Defined in GHC.Types.SafeHaskell Methods ppr :: SafeHaskellMode -> SDoc #
Eq SafeHaskellMode
Instance details Defined in GHC.Types.SafeHaskell Methods (==) :: SafeHaskellMode -> SafeHaskellMode -> Bool # (/=) :: SafeHaskellMode -> SafeHaskellMode -> Bool #

data FieldLabel #

Fields in an algebraic record type; see Note [FieldLabel].

Constructors

FieldLabel
Fields flLabel :: FieldLabelString User-visible label of the field flHasDuplicateRecordFields :: DuplicateRecordFields Was `DuplicateRecordFields` on in the defining module for this datatype? flHasFieldSelector :: FieldSelectors Was `FieldSelectors` enabled in the defining module for this datatype? See Note [NoFieldSelectors] in GHC.Rename.Env flSelector :: Name Record selector function

Instances

Instances details

Data FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldLabel -> c FieldLabel # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FieldLabel # toConstr :: FieldLabel -> Constr # dataTypeOf :: FieldLabel -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FieldLabel) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FieldLabel) # gmapT :: (forall b. Data b => b -> b) -> FieldLabel -> FieldLabel # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r # gmapQ :: (forall d. Data d => d -> u) -> FieldLabel -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldLabel -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel #
NFData FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods rnf :: FieldLabel -> () #
HasOccName FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods occName :: FieldLabel -> OccName #
Binary Name => Binary FieldLabel	We need the `Binary Name` constraint here even though there is an instance defined in GHC.Types.Name, because the we have a SOURCE import, so the instance is not in scope. And the instance cannot be added to Name.hs-boot because GHC.Utils.Binary itself depends on GHC.Types.Name.
Instance details Defined in GHC.Types.FieldLabel Methods put_ :: BinHandle -> FieldLabel -> IO () # put :: BinHandle -> FieldLabel -> IO (Bin FieldLabel) # get :: BinHandle -> IO FieldLabel #
Outputable FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods ppr :: FieldLabel -> SDoc #
Eq FieldLabel
Instance details Defined in GHC.Types.FieldLabel Methods (==) :: FieldLabel -> FieldLabel -> Bool # (/=) :: FieldLabel -> FieldLabel -> Bool #
ToHie (IEContext (Located FieldLabel))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]

data LexicalFixity #

Captures the fixity of declarations as they are parsed. This is not necessarily the same as the fixity declaration, as the normal fixity may be overridden using parens or backticks.

Constructors

Prefix
Infix

Instances

Instances details

Data LexicalFixity
Instance details Defined in GHC.Types.Fixity Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LexicalFixity -> c LexicalFixity # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LexicalFixity # toConstr :: LexicalFixity -> Constr # dataTypeOf :: LexicalFixity -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LexicalFixity) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LexicalFixity) # gmapT :: (forall b. Data b => b -> b) -> LexicalFixity -> LexicalFixity # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r # gmapQ :: (forall d. Data d => d -> u) -> LexicalFixity -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LexicalFixity -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity #
Outputable LexicalFixity
Instance details Defined in GHC.Types.Fixity Methods ppr :: LexicalFixity -> SDoc #
Eq LexicalFixity
Instance details Defined in GHC.Types.Fixity Methods (==) :: LexicalFixity -> LexicalFixity -> Bool # (/=) :: LexicalFixity -> LexicalFixity -> Bool #

newtype HsDocStringChunk #

A contiguous chunk of documentation

Constructors

HsDocStringChunk ByteString

Instances

Instances details

Data HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsDocStringChunk -> c HsDocStringChunk # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsDocStringChunk # toConstr :: HsDocStringChunk -> Constr # dataTypeOf :: HsDocStringChunk -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsDocStringChunk) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsDocStringChunk) # gmapT :: (forall b. Data b => b -> b) -> HsDocStringChunk -> HsDocStringChunk # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsDocStringChunk -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsDocStringChunk -> r # gmapQ :: (forall d. Data d => d -> u) -> HsDocStringChunk -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsDocStringChunk -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsDocStringChunk -> m HsDocStringChunk # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocStringChunk -> m HsDocStringChunk # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocStringChunk -> m HsDocStringChunk #
Show HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods showsPrec :: Int -> HsDocStringChunk -> ShowS # show :: HsDocStringChunk -> String # showList :: [HsDocStringChunk] -> ShowS #
NFData HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods rnf :: HsDocStringChunk -> () #
Binary HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods put_ :: BinHandle -> HsDocStringChunk -> IO () # put :: BinHandle -> HsDocStringChunk -> IO (Bin HsDocStringChunk) # get :: BinHandle -> IO HsDocStringChunk #
Outputable HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods ppr :: HsDocStringChunk -> SDoc #
Eq HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods (==) :: HsDocStringChunk -> HsDocStringChunk -> Bool # (/=) :: HsDocStringChunk -> HsDocStringChunk -> Bool #
Ord HsDocStringChunk
Instance details Defined in GHC.Hs.DocString Methods compare :: HsDocStringChunk -> HsDocStringChunk -> Ordering # (<) :: HsDocStringChunk -> HsDocStringChunk -> Bool # (<=) :: HsDocStringChunk -> HsDocStringChunk -> Bool # (>) :: HsDocStringChunk -> HsDocStringChunk -> Bool # (>=) :: HsDocStringChunk -> HsDocStringChunk -> Bool # max :: HsDocStringChunk -> HsDocStringChunk -> HsDocStringChunk # min :: HsDocStringChunk -> HsDocStringChunk -> HsDocStringChunk #

type LHsDocStringChunk = Located HsDocStringChunk #

data HsDocStringDecorator #

Constructors

HsDocStringNext	'\|' is the decorator
HsDocStringPrevious	`^` is the decorator
HsDocStringNamed !String	'$string' is the decorator
HsDocStringGroup !Int	The decorator is the given number of `*`s

Instances

Instances details

Data HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsDocStringDecorator -> c HsDocStringDecorator # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsDocStringDecorator # toConstr :: HsDocStringDecorator -> Constr # dataTypeOf :: HsDocStringDecorator -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsDocStringDecorator) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsDocStringDecorator) # gmapT :: (forall b. Data b => b -> b) -> HsDocStringDecorator -> HsDocStringDecorator # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsDocStringDecorator -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsDocStringDecorator -> r # gmapQ :: (forall d. Data d => d -> u) -> HsDocStringDecorator -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsDocStringDecorator -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsDocStringDecorator -> m HsDocStringDecorator # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocStringDecorator -> m HsDocStringDecorator # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocStringDecorator -> m HsDocStringDecorator #
Show HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods showsPrec :: Int -> HsDocStringDecorator -> ShowS # show :: HsDocStringDecorator -> String # showList :: [HsDocStringDecorator] -> ShowS #
NFData HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods rnf :: HsDocStringDecorator -> () #
Binary HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods put_ :: BinHandle -> HsDocStringDecorator -> IO () # put :: BinHandle -> HsDocStringDecorator -> IO (Bin HsDocStringDecorator) # get :: BinHandle -> IO HsDocStringDecorator #
Outputable HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods ppr :: HsDocStringDecorator -> SDoc #
Eq HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods (==) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool # (/=) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool #
Ord HsDocStringDecorator
Instance details Defined in GHC.Hs.DocString Methods compare :: HsDocStringDecorator -> HsDocStringDecorator -> Ordering # (<) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool # (<=) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool # (>) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool # (>=) :: HsDocStringDecorator -> HsDocStringDecorator -> Bool # max :: HsDocStringDecorator -> HsDocStringDecorator -> HsDocStringDecorator # min :: HsDocStringDecorator -> HsDocStringDecorator -> HsDocStringDecorator #

data HsDocString #

Haskell Documentation String

Rich structure to support exact printing The location around each chunk doesn't include the decorators

Constructors

MultiLineDocString !HsDocStringDecorator !(NonEmpty LHsDocStringChunk)	The first chunk is preceded by "-- decorator" and each following chunk is preceded by "--" Example: -- \| This is a docstring for `foo`. It is the line with the decorator '\|' and is always included -- This continues that docstring and is the second element in the NonEmpty list foo :: a -> a
NestedDocString !HsDocStringDecorator LHsDocStringChunk	The docstring is preceded by "{-decorator" and followed by "-}" The chunk contains balanced pairs of '{-' and '-}'
GeneratedDocString HsDocStringChunk	A docstring generated either internally or via TH Pretty printed with the '-- \|' decorator This is because it may contain unbalanced pairs of '{-' and '-}' and not form a valid `NestedDocString`

Instances

Instances details

Data HsDocString
Instance details Defined in GHC.Hs.DocString Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsDocString -> c HsDocString # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsDocString # toConstr :: HsDocString -> Constr # dataTypeOf :: HsDocString -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsDocString) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsDocString) # gmapT :: (forall b. Data b => b -> b) -> HsDocString -> HsDocString # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsDocString -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsDocString -> r # gmapQ :: (forall d. Data d => d -> u) -> HsDocString -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsDocString -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsDocString -> m HsDocString # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocString -> m HsDocString # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsDocString -> m HsDocString #
Show HsDocString
Instance details Defined in GHC.Hs.DocString Methods showsPrec :: Int -> HsDocString -> ShowS # show :: HsDocString -> String # showList :: [HsDocString] -> ShowS #
NFData HsDocString
Instance details Defined in GHC.Hs.DocString Methods rnf :: HsDocString -> () #
Binary HsDocString
Instance details Defined in GHC.Hs.DocString Methods put_ :: BinHandle -> HsDocString -> IO () # put :: BinHandle -> HsDocString -> IO (Bin HsDocString) # get :: BinHandle -> IO HsDocString #
Outputable HsDocString
Instance details Defined in GHC.Hs.DocString Methods ppr :: HsDocString -> SDoc #
Eq HsDocString
Instance details Defined in GHC.Hs.DocString Methods (==) :: HsDocString -> HsDocString -> Bool # (/=) :: HsDocString -> HsDocString -> Bool #
ToHie (LHsDoc GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LHsDoc GhcRn -> HieM [HieAST Type]

type LHsDocString = Located HsDocString #

data WarningFlag #

Constructors

Opt_WarnDuplicateExports
Opt_WarnDuplicateConstraints
Opt_WarnRedundantConstraints
Opt_WarnHiShadows
Opt_WarnImplicitPrelude
Opt_WarnIncompletePatterns
Opt_WarnIncompleteUniPatterns
Opt_WarnIncompletePatternsRecUpd
Opt_WarnOverflowedLiterals
Opt_WarnEmptyEnumerations
Opt_WarnMissingFields
Opt_WarnMissingImportList
Opt_WarnMissingMethods
Opt_WarnMissingSignatures
Opt_WarnMissingLocalSignatures
Opt_WarnNameShadowing
Opt_WarnOverlappingPatterns
Opt_WarnTypeDefaults
Opt_WarnMonomorphism
Opt_WarnUnusedTopBinds
Opt_WarnUnusedLocalBinds
Opt_WarnUnusedPatternBinds
Opt_WarnUnusedImports
Opt_WarnUnusedMatches
Opt_WarnUnusedTypePatterns
Opt_WarnUnusedForalls
Opt_WarnUnusedRecordWildcards
Opt_WarnRedundantBangPatterns
Opt_WarnRedundantRecordWildcards
Opt_WarnWarningsDeprecations
Opt_WarnDeprecatedFlags
Opt_WarnMissingMonadFailInstances
Opt_WarnSemigroup
Opt_WarnDodgyExports
Opt_WarnDodgyImports
Opt_WarnOrphans
Opt_WarnAutoOrphans
Opt_WarnIdentities
Opt_WarnTabs
Opt_WarnUnrecognisedPragmas
Opt_WarnMisplacedPragmas
Opt_WarnDodgyForeignImports
Opt_WarnUnusedDoBind
Opt_WarnWrongDoBind
Opt_WarnAlternativeLayoutRuleTransitional
Opt_WarnUnsafe
Opt_WarnSafe
Opt_WarnTrustworthySafe
Opt_WarnMissedSpecs
Opt_WarnAllMissedSpecs
Opt_WarnUnsupportedCallingConventions
Opt_WarnUnsupportedLlvmVersion
Opt_WarnMissedExtraSharedLib
Opt_WarnInlineRuleShadowing
Opt_WarnTypedHoles
Opt_WarnPartialTypeSignatures
Opt_WarnMissingExportedSignatures
Opt_WarnUntickedPromotedConstructors
Opt_WarnDerivingTypeable
Opt_WarnDeferredTypeErrors
Opt_WarnDeferredOutOfScopeVariables
Opt_WarnNonCanonicalMonadInstances
Opt_WarnNonCanonicalMonadFailInstances
Opt_WarnNonCanonicalMonoidInstances
Opt_WarnMissingPatternSynonymSignatures
Opt_WarnUnrecognisedWarningFlags
Opt_WarnSimplifiableClassConstraints
Opt_WarnCPPUndef
Opt_WarnUnbangedStrictPatterns
Opt_WarnMissingHomeModules
Opt_WarnPartialFields
Opt_WarnMissingExportList
Opt_WarnInaccessibleCode
Opt_WarnStarIsType
Opt_WarnStarBinder
Opt_WarnImplicitKindVars
Opt_WarnSpaceAfterBang
Opt_WarnMissingDerivingStrategies
Opt_WarnPrepositiveQualifiedModule
Opt_WarnUnusedPackages
Opt_WarnInferredSafeImports
Opt_WarnMissingSafeHaskellMode
Opt_WarnCompatUnqualifiedImports
Opt_WarnDerivingDefaults
Opt_WarnInvalidHaddock
Opt_WarnOperatorWhitespaceExtConflict
Opt_WarnOperatorWhitespace
Opt_WarnAmbiguousFields
Opt_WarnImplicitLift
Opt_WarnMissingKindSignatures
Opt_WarnMissingExportedPatternSynonymSignatures
Opt_WarnRedundantStrictnessFlags
Opt_WarnForallIdentifier
Opt_WarnUnicodeBidirectionalFormatCharacters
Opt_WarnGADTMonoLocalBinds
Opt_WarnTypeEqualityOutOfScope
Opt_WarnTypeEqualityRequiresOperators
Opt_WarnLoopySuperclassSolve

Instances

Instances details

Enum WarningFlag
Instance details Defined in GHC.Driver.Flags Methods succ :: WarningFlag -> WarningFlag # pred :: WarningFlag -> WarningFlag # toEnum :: Int -> WarningFlag # fromEnum :: WarningFlag -> Int # enumFrom :: WarningFlag -> [WarningFlag] # enumFromThen :: WarningFlag -> WarningFlag -> [WarningFlag] # enumFromTo :: WarningFlag -> WarningFlag -> [WarningFlag] # enumFromThenTo :: WarningFlag -> WarningFlag -> WarningFlag -> [WarningFlag] #
Show WarningFlag
Instance details Defined in GHC.Driver.Flags Methods showsPrec :: Int -> WarningFlag -> ShowS # show :: WarningFlag -> String # showList :: [WarningFlag] -> ShowS #
Eq WarningFlag
Instance details Defined in GHC.Driver.Flags Methods (==) :: WarningFlag -> WarningFlag -> Bool # (/=) :: WarningFlag -> WarningFlag -> Bool #
Ord WarningFlag
Instance details Defined in GHC.Driver.Flags Methods compare :: WarningFlag -> WarningFlag -> Ordering # (<) :: WarningFlag -> WarningFlag -> Bool # (<=) :: WarningFlag -> WarningFlag -> Bool # (>) :: WarningFlag -> WarningFlag -> Bool # (>=) :: WarningFlag -> WarningFlag -> Bool # max :: WarningFlag -> WarningFlag -> WarningFlag # min :: WarningFlag -> WarningFlag -> WarningFlag #

data GeneralFlag #

Enumerates the simple on-or-off dynamic flags

Constructors

Opt_DumpToFile	Append dump output to files instead of stdout.
Opt_DumpWithWays	Use foo.ways.dumpFlag instead of foo.dumpFlag
Opt_D_dump_minimal_imports
Opt_DoCoreLinting
Opt_DoLinearCoreLinting
Opt_DoStgLinting
Opt_DoCmmLinting
Opt_DoAsmLinting
Opt_DoAnnotationLinting
Opt_DoBoundsChecking
Opt_NoLlvmMangler
Opt_FastLlvm
Opt_NoTypeableBinds
Opt_DistinctConstructorTables
Opt_InfoTableMap
Opt_InfoTableMapWithFallback
Opt_InfoTableMapWithStack
Opt_WarnIsError
Opt_ShowWarnGroups
Opt_HideSourcePaths
Opt_PrintExplicitForalls
Opt_PrintExplicitKinds
Opt_PrintExplicitCoercions
Opt_PrintExplicitRuntimeReps
Opt_PrintEqualityRelations
Opt_PrintAxiomIncomps
Opt_PrintUnicodeSyntax
Opt_PrintExpandedSynonyms
Opt_PrintPotentialInstances
Opt_PrintRedundantPromotionTicks
Opt_PrintTypecheckerElaboration
Opt_CallArity
Opt_Exitification
Opt_Strictness
Opt_LateDmdAnal
Opt_KillAbsence
Opt_KillOneShot
Opt_FullLaziness
Opt_FloatIn
Opt_LocalFloatOut	Enable floating out of let-bindings in the simplifier
Opt_LocalFloatOutTopLevel	Enable floating out of let-bindings at the top level in the simplifier N.B. See Note [RHS Floating]
Opt_LateSpecialise
Opt_Specialise
Opt_SpecialiseAggressively
Opt_CrossModuleSpecialise
Opt_PolymorphicSpecialisation
Opt_InlineGenerics
Opt_InlineGenericsAggressively
Opt_StaticArgumentTransformation
Opt_CSE
Opt_StgCSE
Opt_StgLiftLams
Opt_LiberateCase
Opt_SpecConstr
Opt_SpecConstrKeen
Opt_DoLambdaEtaExpansion
Opt_IgnoreAsserts
Opt_DoEtaReduction
Opt_CaseMerge
Opt_CaseFolding
Opt_UnboxStrictFields
Opt_UnboxSmallStrictFields
Opt_DictsCheap
Opt_EnableRewriteRules
Opt_EnableThSpliceWarnings
Opt_RegsGraph
Opt_RegsIterative
Opt_PedanticBottoms
Opt_LlvmTBAA
Opt_LlvmFillUndefWithGarbage
Opt_IrrefutableTuples
Opt_CmmSink
Opt_CmmStaticPred
Opt_CmmElimCommonBlocks
Opt_CmmControlFlow
Opt_AsmShortcutting
Opt_OmitYields
Opt_FunToThunk
Opt_DictsStrict
Opt_DmdTxDictSel	deprecated, no effect and behaviour is now default. Allowed switching of a special demand transformer for dictionary selectors
Opt_Loopification
Opt_CfgBlocklayout	Use the cfg based block layout algorithm.
Opt_WeightlessBlocklayout	Layout based on last instruction per block.
Opt_CprAnal
Opt_WorkerWrapper
Opt_WorkerWrapperUnlift	Do W/W split for unlifting even if we won't unbox anything.
Opt_SolveConstantDicts
Opt_AlignmentSanitisation
Opt_CatchNonexhaustiveCases
Opt_NumConstantFolding
Opt_CoreConstantFolding
Opt_FastPAPCalls
Opt_DoTagInferenceChecks
Opt_SimplPreInlining
Opt_IgnoreInterfacePragmas
Opt_OmitInterfacePragmas
Opt_ExposeAllUnfoldings
Opt_WriteInterface
Opt_WriteHie
Opt_AutoSccsOnIndividualCafs
Opt_ProfCountEntries
Opt_ProfLateInlineCcs
Opt_ProfLateCcs
Opt_ProfManualCcs	Ignore manual SCC annotations
Opt_Pp
Opt_ForceRecomp
Opt_IgnoreOptimChanges
Opt_IgnoreHpcChanges
Opt_ExcessPrecision
Opt_EagerBlackHoling
Opt_NoHsMain
Opt_SplitSections
Opt_StgStats
Opt_HideAllPackages
Opt_HideAllPluginPackages
Opt_PrintBindResult
Opt_Haddock
Opt_HaddockOptions
Opt_BreakOnException
Opt_BreakOnError
Opt_PrintEvldWithShow
Opt_PrintBindContents
Opt_GenManifest
Opt_EmbedManifest
Opt_SharedImplib
Opt_BuildingCabalPackage
Opt_IgnoreDotGhci
Opt_GhciSandbox
Opt_GhciHistory
Opt_GhciLeakCheck
Opt_ValidateHie
Opt_LocalGhciHistory
Opt_NoIt
Opt_HelpfulErrors
Opt_DeferTypeErrors
Opt_DeferTypedHoles
Opt_DeferOutOfScopeVariables
Opt_PIC	-fPIC
Opt_PIE	-fPIE
Opt_PICExecutable	-pie
Opt_ExternalDynamicRefs
Opt_Ticky
Opt_Ticky_Allocd
Opt_Ticky_LNE
Opt_Ticky_Dyn_Thunk
Opt_Ticky_Tag
Opt_Ticky_AP	Use regular thunks even when we could use std ap thunks in order to get entry counts
Opt_CmmThreadSanitizer
Opt_RPath
Opt_RelativeDynlibPaths
Opt_CompactUnwind	-fcompact-unwind
Opt_Hpc
Opt_FamAppCache
Opt_ExternalInterpreter
Opt_OptimalApplicativeDo
Opt_VersionMacros
Opt_WholeArchiveHsLibs
Opt_SingleLibFolder
Opt_ExposeInternalSymbols
Opt_KeepCAFs
Opt_KeepGoing
Opt_ByteCode
Opt_ByteCodeAndObjectCode
Opt_LinkRts
Opt_ErrorSpans
Opt_DeferDiagnostics
Opt_DiagnosticsShowCaret
Opt_PprCaseAsLet
Opt_PprShowTicks
Opt_ShowHoleConstraints
Opt_ShowValidHoleFits
Opt_SortValidHoleFits
Opt_SortBySizeHoleFits
Opt_SortBySubsumHoleFits
Opt_AbstractRefHoleFits
Opt_UnclutterValidHoleFits
Opt_ShowTypeAppOfHoleFits
Opt_ShowTypeAppVarsOfHoleFits
Opt_ShowDocsOfHoleFits
Opt_ShowTypeOfHoleFits
Opt_ShowProvOfHoleFits
Opt_ShowMatchesOfHoleFits
Opt_ShowLoadedModules
Opt_HexWordLiterals
Opt_SuppressCoercions
Opt_SuppressCoercionTypes
Opt_SuppressVarKinds
Opt_SuppressModulePrefixes
Opt_SuppressTypeApplications
Opt_SuppressIdInfo
Opt_SuppressUnfoldings
Opt_SuppressTypeSignatures
Opt_SuppressUniques
Opt_SuppressStgExts
Opt_SuppressStgReps
Opt_SuppressTicks
Opt_SuppressTimestamps	Suppress timestamps in dumps
Opt_SuppressCoreSizes	Suppress per binding Core size stats in dumps
Opt_ShowErrorContext
Opt_AutoLinkPackages
Opt_ImplicitImportQualified
Opt_KeepHscppFiles
Opt_KeepHiDiffs
Opt_KeepHcFiles
Opt_KeepSFiles
Opt_KeepTmpFiles
Opt_KeepRawTokenStream
Opt_KeepLlvmFiles
Opt_KeepHiFiles
Opt_KeepOFiles
Opt_BuildDynamicToo
Opt_WriteIfSimplifiedCore
Opt_UseBytecodeRatherThanObjects
Opt_DistrustAllPackages
Opt_PackageTrust
Opt_PluginTrustworthy
Opt_G_NoStateHack
Opt_G_NoOptCoercion

Instances

Instances details

Enum GeneralFlag
Instance details Defined in GHC.Driver.Flags Methods succ :: GeneralFlag -> GeneralFlag # pred :: GeneralFlag -> GeneralFlag # toEnum :: Int -> GeneralFlag # fromEnum :: GeneralFlag -> Int # enumFrom :: GeneralFlag -> [GeneralFlag] # enumFromThen :: GeneralFlag -> GeneralFlag -> [GeneralFlag] # enumFromTo :: GeneralFlag -> GeneralFlag -> [GeneralFlag] # enumFromThenTo :: GeneralFlag -> GeneralFlag -> GeneralFlag -> [GeneralFlag] #
Show GeneralFlag
Instance details Defined in GHC.Driver.Flags Methods showsPrec :: Int -> GeneralFlag -> ShowS # show :: GeneralFlag -> String # showList :: [GeneralFlag] -> ShowS #
Eq GeneralFlag
Instance details Defined in GHC.Driver.Flags Methods (==) :: GeneralFlag -> GeneralFlag -> Bool # (/=) :: GeneralFlag -> GeneralFlag -> Bool #

newtype UniqMap k a #

Maps indexed by Uniquable keys

Constructors

UniqMap
Fields getUniqMap :: UniqFM k (k, a)

Instances

Instances details

Functor (UniqMap k)
Instance details Defined in GHC.Types.Unique.Map Methods fmap :: (a -> b) -> UniqMap k a -> UniqMap k b # (<$) :: a -> UniqMap k b -> UniqMap k a #
(Data k, Data a) => Data (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UniqMap k a -> c (UniqMap k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (UniqMap k a) # toConstr :: UniqMap k a -> Constr # dataTypeOf :: UniqMap k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (UniqMap k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (UniqMap k a)) # gmapT :: (forall b. Data b => b -> b) -> UniqMap k a -> UniqMap k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UniqMap k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UniqMap k a -> r # gmapQ :: (forall d. Data d => d -> u) -> UniqMap k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> UniqMap k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> UniqMap k a -> m (UniqMap k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqMap k a -> m (UniqMap k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UniqMap k a -> m (UniqMap k a) #
Monoid (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods mempty :: UniqMap k a # mappend :: UniqMap k a -> UniqMap k a -> UniqMap k a # mconcat :: [UniqMap k a] -> UniqMap k a #
Semigroup (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods (<>) :: UniqMap k a -> UniqMap k a -> UniqMap k a # sconcat :: NonEmpty (UniqMap k a) -> UniqMap k a # stimes :: Integral b => b -> UniqMap k a -> UniqMap k a #
(NFData k, NFData a) => NFData (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods rnf :: UniqMap k a -> () #
ToJExpr a => ToJExpr (UniqMap FastString a)
Instance details Defined in GHC.JS.Make Methods toJExpr :: UniqMap FastString a -> JExpr # toJExprFromList :: [UniqMap FastString a] -> JExpr #
(Outputable k, Outputable a) => Outputable (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods ppr :: UniqMap k a -> SDoc #
(Eq k, Eq a) => Eq (UniqMap k a)
Instance details Defined in GHC.Types.Unique.Map Methods (==) :: UniqMap k a -> UniqMap k a -> Bool # (/=) :: UniqMap k a -> UniqMap k a -> Bool #

type ModuleWithIsBoot = GenWithIsBoot Module #

type ModuleNameWithIsBoot = GenWithIsBoot ModuleName #

data GenWithIsBoot mod #

This data type just pairs a value mod with an IsBootInterface flag. In practice, mod is usually a Module or ModuleName'.

Constructors

GWIB
Fields gwib_mod :: mod gwib_isBoot :: IsBootInterface

Instances

Instances details

Foldable GenWithIsBoot
Instance details Defined in GHC.Unit.Types Methods fold :: Monoid m => GenWithIsBoot m -> m # foldMap :: Monoid m => (a -> m) -> GenWithIsBoot a -> m # foldMap' :: Monoid m => (a -> m) -> GenWithIsBoot a -> m # foldr :: (a -> b -> b) -> b -> GenWithIsBoot a -> b # foldr' :: (a -> b -> b) -> b -> GenWithIsBoot a -> b # foldl :: (b -> a -> b) -> b -> GenWithIsBoot a -> b # foldl' :: (b -> a -> b) -> b -> GenWithIsBoot a -> b # foldr1 :: (a -> a -> a) -> GenWithIsBoot a -> a # foldl1 :: (a -> a -> a) -> GenWithIsBoot a -> a # toList :: GenWithIsBoot a -> [a] # null :: GenWithIsBoot a -> Bool # length :: GenWithIsBoot a -> Int # elem :: Eq a => a -> GenWithIsBoot a -> Bool # maximum :: Ord a => GenWithIsBoot a -> a # minimum :: Ord a => GenWithIsBoot a -> a # sum :: Num a => GenWithIsBoot a -> a # product :: Num a => GenWithIsBoot a -> a #
Traversable GenWithIsBoot
Instance details Defined in GHC.Unit.Types Methods traverse :: Applicative f => (a -> f b) -> GenWithIsBoot a -> f (GenWithIsBoot b) # sequenceA :: Applicative f => GenWithIsBoot (f a) -> f (GenWithIsBoot a) # mapM :: Monad m => (a -> m b) -> GenWithIsBoot a -> m (GenWithIsBoot b) # sequence :: Monad m => GenWithIsBoot (m a) -> m (GenWithIsBoot a) #
Functor GenWithIsBoot
Instance details Defined in GHC.Unit.Types Methods fmap :: (a -> b) -> GenWithIsBoot a -> GenWithIsBoot b # (<$) :: a -> GenWithIsBoot b -> GenWithIsBoot a #
Show mod => Show (GenWithIsBoot mod)
Instance details Defined in GHC.Unit.Types Methods showsPrec :: Int -> GenWithIsBoot mod -> ShowS # show :: GenWithIsBoot mod -> String # showList :: [GenWithIsBoot mod] -> ShowS #
Binary a => Binary (GenWithIsBoot a)
Instance details Defined in GHC.Unit.Types Methods put_ :: BinHandle -> GenWithIsBoot a -> IO () # put :: BinHandle -> GenWithIsBoot a -> IO (Bin (GenWithIsBoot a)) # get :: BinHandle -> IO (GenWithIsBoot a) #
Outputable a => Outputable (GenWithIsBoot a)
Instance details Defined in GHC.Unit.Types Methods ppr :: GenWithIsBoot a -> SDoc #
Eq mod => Eq (GenWithIsBoot mod)
Instance details Defined in GHC.Unit.Types Methods (==) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool # (/=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool #
Ord mod => Ord (GenWithIsBoot mod)
Instance details Defined in GHC.Unit.Types Methods compare :: GenWithIsBoot mod -> GenWithIsBoot mod -> Ordering # (<) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool # (<=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool # (>) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool # (>=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool # max :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod # min :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod #

newtype Definite unit #

A definite unit (i.e. without any free module hole)

Constructors

Definite
Fields unDefinite :: unit

Instances

Instances details

Functor Definite
Instance details Defined in GHC.Unit.Types Methods fmap :: (a -> b) -> Definite a -> Definite b # (<$) :: a -> Definite b -> Definite a #
Uniquable unit => Uniquable (Definite unit)
Instance details Defined in GHC.Unit.Types Methods getUnique :: Definite unit -> Unique #
IsUnitId unit => IsUnitId (Definite unit)
Instance details Defined in GHC.Unit.Types Methods unitFS :: Definite unit -> FastString #
Binary unit => Binary (Definite unit)
Instance details Defined in GHC.Unit.Types Methods put_ :: BinHandle -> Definite unit -> IO () # put :: BinHandle -> Definite unit -> IO (Bin (Definite unit)) # get :: BinHandle -> IO (Definite unit) #
Outputable unit => Outputable (Definite unit)
Instance details Defined in GHC.Unit.Types Methods ppr :: Definite unit -> SDoc #
Eq unit => Eq (Definite unit)
Instance details Defined in GHC.Unit.Types Methods (==) :: Definite unit -> Definite unit -> Bool # (/=) :: Definite unit -> Definite unit -> Bool #
Ord unit => Ord (Definite unit)
Instance details Defined in GHC.Unit.Types Methods compare :: Definite unit -> Definite unit -> Ordering # (<) :: Definite unit -> Definite unit -> Bool # (<=) :: Definite unit -> Definite unit -> Bool # (>) :: Definite unit -> Definite unit -> Bool # (>=) :: Definite unit -> Definite unit -> Bool # max :: Definite unit -> Definite unit -> Definite unit # min :: Definite unit -> Definite unit -> Definite unit #

type DefUnitId = Definite UnitId #

A DefUnitId is an UnitId with the invariant that it only refers to a definite library; i.e., one we have generated code for.

type Instantiations = GenInstantiations UnitId #

type GenInstantiations unit = [(ModuleName, GenModule (GenUnit unit))] #

type InstantiatedUnit = GenInstantiatedUnit UnitId #

data GenInstantiatedUnit unit #

An instantiated unit.

It identifies an indefinite library (with holes) that has been instantiated.

This unit may be indefinite or not (i.e. with remaining holes or not). If it is definite, we don't know if it has already been compiled and installed in a database. Nevertheless, we have a mechanism called "improvement" to try to match a fully instantiated unit with existing compiled and installed units: see Note [VirtUnit to RealUnit improvement].

An indefinite unit identifier pretty-prints to something like p[H=H,A=aimpl:A>] (p is the UnitId, and the brackets enclose the module substitution).

Constructors

InstantiatedUnit

Fields

instUnitFS :: !FastString
A private, uniquely identifying representation of an InstantiatedUnit. This string is completely private to GHC and is just used to get a unique.
instUnitKey :: !Unique
Cached unique of unitFS.
instUnitInstanceOf :: !unit
The (indefinite) unit being instantiated.
instUnitInsts :: !(GenInstantiations unit)
The sorted (by ModuleName) instantiations of this unit.
instUnitHoles :: UniqDSet ModuleName
A cache of the free module holes of instUnitInsts. This lets us efficiently tell if a GenInstantiatedUnit has been fully instantiated (empty set of free module holes) and whether or not a substitution can have any effect.

Instances

Instances details

Binary InstantiatedUnit
Instance details Defined in GHC.Unit.Types Methods put_ :: BinHandle -> InstantiatedUnit -> IO () # put :: BinHandle -> InstantiatedUnit -> IO (Bin InstantiatedUnit) # get :: BinHandle -> IO InstantiatedUnit #
Outputable InstantiatedModule
Instance details Defined in GHC.Unit.Types Methods ppr :: InstantiatedModule -> SDoc #
Outputable InstantiatedUnit
Instance details Defined in GHC.Unit.Types Methods ppr :: InstantiatedUnit -> SDoc #
Eq (GenInstantiatedUnit unit)
Instance details Defined in GHC.Unit.Types Methods (==) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool # (/=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool #
Ord (GenInstantiatedUnit unit)
Instance details Defined in GHC.Unit.Types Methods compare :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Ordering # (<) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool # (<=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool # (>) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool # (>=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool # max :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> GenInstantiatedUnit unit # min :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> GenInstantiatedUnit unit #

newtype UnitKey #

A unit key in the database

Constructors

UnitKey FastString

Instances

Instances details

IsUnitId UnitKey
Instance details Defined in GHC.Unit.Types Methods unitFS :: UnitKey -> FastString #

class IsUnitId u where #

Class for types that are used as unit identifiers (UnitKey, UnitId, Unit)

We need this class because we create new unit ids for virtual units (see VirtUnit) and they have to to be made from units with different kinds of identifiers.

Methods

unitFS :: u -> FastString #

Instances

Instances details

IsUnitId UnitId
Instance details Defined in GHC.Unit.Types Methods unitFS :: UnitId -> FastString #
IsUnitId UnitKey
Instance details Defined in GHC.Unit.Types Methods unitFS :: UnitKey -> FastString #
IsUnitId unit => IsUnitId (Definite unit)
Instance details Defined in GHC.Unit.Types Methods unitFS :: Definite unit -> FastString #
IsUnitId u => IsUnitId (GenUnit u)
Instance details Defined in GHC.Unit.Types Methods unitFS :: GenUnit u -> FastString #

type InstantiatedModule = GenModule InstantiatedUnit #

An InstantiatedModule is a GenModule whose unit is identified with an GenInstantiatedUnit.

type HomeUnitModule = GenModule UnitId #

A HomeUnitModule is like an InstalledModule but we expect to find it in one of the home units rather than the package database.

type InstalledModule = GenModule UnitId #

A InstalledModule is a GenModule whose unit is identified with an UnitId.

data ModLocation #

Module Location

Where a module lives on the file system: the actual locations of the .hs, .hi, .dyn_hi, .o, .dyn_o and .hie files, if we have them.

For a module in another unit, the ml_hs_file and ml_obj_file components of ModLocation are undefined.

The locations specified by a ModLocation may or may not correspond to actual files yet: for example, even if the object file doesn't exist, the ModLocation still contains the path to where the object file will reside if/when it is created.

The paths of anything which can affect recompilation should be placed inside ModLocation.

When a ModLocation is created none of the filepaths will have -boot suffixes. This is because in --make mode the ModLocation is put in the finder cache which is indexed by ModuleName, when a ModLocation is retrieved from the FinderCache the boot suffixes are appended. The other case is in -c mode, there the ModLocation immediately gets given the boot suffixes in mkOneShotModLocation.

Instances

Instances details

Show ModLocation
Instance details Defined in GHC.Unit.Module.Location Methods showsPrec :: Int -> ModLocation -> ShowS # show :: ModLocation -> String # showList :: [ModLocation] -> ShowS #
Outputable ModLocation
Instance details Defined in GHC.Unit.Module.Location Methods ppr :: ModLocation -> SDoc #

data InstalledModuleEnv elt #

A map keyed off of InstalledModule

Instances

Instances details

Outputable elt => Outputable (InstalledModuleEnv elt)
Instance details Defined in GHC.Unit.Module.Env Methods ppr :: InstalledModuleEnv elt -> SDoc #

type DModuleNameEnv elt = UniqDFM ModuleName elt #

A map keyed off of ModuleNames (actually, their Uniques) Has deterministic folds and can be deterministically converted to a list

type ModuleNameEnv elt = UniqFM ModuleName elt #

A map keyed off of ModuleNames (actually, their Uniques)

type ModuleSet = Set NDModule #

A set of GenModules

data ModuleEnv elt #

A map keyed off of GenModules

Instances

Instances details

Outputable a => Outputable (ModuleEnv a)
Instance details Defined in GHC.Unit.Module.Env Methods ppr :: ModuleEnv a -> SDoc #

class HasModule (m :: Type -> Type) where #

Methods

getModule :: m Module #

Instances

Instances details

HasModule TcS
Instance details Defined in GHC.Tc.Solver.Monad Methods getModule :: TcS Module #
ContainsModule env => HasModule (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods getModule :: IOEnv env Module #

class ContainsModule t where #

Methods

extractModule :: t -> Module #

Instances

Instances details

ContainsModule DsGblEnv
Instance details Defined in GHC.HsToCore.Types Methods extractModule :: DsGblEnv -> Module #
ContainsModule TcGblEnv
Instance details Defined in GHC.Tc.Types Methods extractModule :: TcGblEnv -> Module #
ContainsModule gbl => ContainsModule (Env gbl lcl)
Instance details Defined in GHC.Tc.Types Methods extractModule :: Env gbl lcl -> Module #

data HscSource #

Constructors

HsSrcFile	.hs file
HsBootFile	.hs-boot file
HsigFile	.hsig file

Instances

Instances details

Show HscSource
Instance details Defined in GHC.Types.SourceFile Methods showsPrec :: Int -> HscSource -> ShowS # show :: HscSource -> String # showList :: [HscSource] -> ShowS #
Binary HscSource
Instance details Defined in GHC.Types.SourceFile Methods put_ :: BinHandle -> HscSource -> IO () # put :: BinHandle -> HscSource -> IO (Bin HscSource) # get :: BinHandle -> IO HscSource #
Eq HscSource
Instance details Defined in GHC.Types.SourceFile Methods (==) :: HscSource -> HscSource -> Bool # (/=) :: HscSource -> HscSource -> Bool #
Ord HscSource
Instance details Defined in GHC.Types.SourceFile Methods compare :: HscSource -> HscSource -> Ordering # (<) :: HscSource -> HscSource -> Bool # (<=) :: HscSource -> HscSource -> Bool # (>) :: HscSource -> HscSource -> Bool # (>=) :: HscSource -> HscSource -> Bool # max :: HscSource -> HscSource -> HscSource # min :: HscSource -> HscSource -> HscSource #

data KnotVars a #

Constructors

KnotVars
Fields kv_domain :: [Module] kv_lookup :: Module -> Maybe a
NoKnotVars

Instances

Instances details

Functor KnotVars
Instance details Defined in GHC.Driver.Env.KnotVars Methods fmap :: (a -> b) -> KnotVars a -> KnotVars b # (<$) :: a -> KnotVars b -> KnotVars a #
Outputable (KnotVars a)
Instance details Defined in GHC.Driver.Env.KnotVars Methods ppr :: KnotVars a -> SDoc #

type LPat p = XRec p (Pat p) #

type LHsExpr p #

Arguments

= XRec p (HsExpr p)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Expression

type family SyntaxExpr p #

Syntax Expression

SyntaxExpr is represents the function used in interpreting rebindable syntax. In the parser, we have no information to supply; in the renamer, we have the name of the function (but see Note [Monad fail : Rebindable syntax, overloaded strings] for a wrinkle) and in the type-checker we have a more elaborate structure SyntaxExprTc.

In some contexts, rebindable syntax is not implemented, and so we have constructors to represent that possibility in both the renamer and typechecker instantiations.

E.g. (>>=) is filled in before the renamer by the appropriate Name for (>>=), and then instantiated by the type checker with its type args etc

Instances

Instances details

type SyntaxExpr (GhcPass p)
Instance details Defined in GHC.Hs.Expr type SyntaxExpr (GhcPass p) = SyntaxExprGhc p

data GRHSs p body #

Guarded Right-Hand Sides

GRHSs are used both for pattern bindings and for Matches

AnnKeywordId : AnnVbar, AnnEqual,AnnWhere, AnnOpen,AnnClose AnnRarrow,AnnSemi

Constructors

GRHSs
Fields grhssExt :: XCGRHSs p body grhssGRHSs :: [LGRHS p body] Guarded RHSs grhssLocalBinds :: HsLocalBinds p The where clause
XGRHSs !(XXGRHSs p body)

Instances

Instances details

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

data MatchGroup p body #

Constructors

MG
Fields mg_ext :: XMG p body mg_alts :: XRec p [LMatch p body]
XMatchGroup !(XXMatchGroup p body)

Instances

Instances details

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

data HsUntypedSplice id #

Haskell Splice

Constructors

HsUntypedSpliceExpr (XUntypedSpliceExpr id) (LHsExpr id)
HsQuasiQuote (XQuasiQuote id) (IdP id) (XRec id FastString)
XUntypedSplice !(XXUntypedSplice id)

Instances

Instances details

HiePass p => ToHie (LocatedA (HsUntypedSplice (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsUntypedSplice (GhcPass p)) -> HieM [HieAST Type]
type Anno (HsUntypedSplice (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsUntypedSplice (GhcPass p)) = SrcSpanAnnA

data PromotionFlag #

Is a TyCon a promoted data constructor or just a normal type constructor?

Constructors

NotPromoted
IsPromoted

Instances

Instances details

Data PromotionFlag
Instance details Defined in Language.Haskell.Syntax.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PromotionFlag -> c PromotionFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PromotionFlag # toConstr :: PromotionFlag -> Constr # dataTypeOf :: PromotionFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PromotionFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PromotionFlag) # gmapT :: (forall b. Data b => b -> b) -> PromotionFlag -> PromotionFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PromotionFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PromotionFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> PromotionFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PromotionFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PromotionFlag -> m PromotionFlag #
Eq PromotionFlag
Instance details Defined in Language.Haskell.Syntax.Type Methods (==) :: PromotionFlag -> PromotionFlag -> Bool # (/=) :: PromotionFlag -> PromotionFlag -> Bool #

data DefaultingStrategy #

Specify whether to default kind variables, and type variables of kind RuntimeRepLevityMultiplicity.

Constructors

DefaultKindVars

Default kind variables:

default kind variables of kind Type to Type,
default RuntimeRepLevityMultiplicity kind variables to LiftedRepLiftedMany, respectively.

When this strategy is used, it means that we have determined that the variables we are considering defaulting are all kind variables.

Usually, we pass this option when -XNoPolyKinds is enabled.

NonStandardDefaulting NonStandardDefaultingStrategy

Default (or don't default) non-standard variables, of kinds RuntimeRep, Levity and Multiplicity.

Instances

Instances details

Outputable DefaultingStrategy
Instance details Defined in GHC.Types.Basic Methods ppr :: DefaultingStrategy -> SDoc #

data NonStandardDefaultingStrategy #

Specify whether to default type variables of kind RuntimeRepLevityMultiplicity.

Constructors

DefaultNonStandardTyVars

Default type variables of the given kinds:

default RuntimeRep variables to LiftedRep
default Levity variables to Lifted
default Multiplicity variables to Many

TryNotToDefaultNonStandardTyVars

Try not to default type variables of the kinds RuntimeRepLevityMultiplicity.

Note that these might get defaulted anyway, if they are kind variables and `-XNoPolyKinds` is enabled.

Instances

Instances details

Outputable NonStandardDefaultingStrategy
Instance details Defined in GHC.Types.Basic Methods ppr :: NonStandardDefaultingStrategy -> SDoc #

data TypeOrConstraint #

Constructors

TypeLike
ConstraintLike

Instances

Instances details

Data TypeOrConstraint
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeOrConstraint -> c TypeOrConstraint # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TypeOrConstraint # toConstr :: TypeOrConstraint -> Constr # dataTypeOf :: TypeOrConstraint -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TypeOrConstraint) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeOrConstraint) # gmapT :: (forall b. Data b => b -> b) -> TypeOrConstraint -> TypeOrConstraint # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeOrConstraint -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeOrConstraint -> r # gmapQ :: (forall d. Data d => d -> u) -> TypeOrConstraint -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeOrConstraint -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeOrConstraint -> m TypeOrConstraint # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeOrConstraint -> m TypeOrConstraint # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeOrConstraint -> m TypeOrConstraint #
Eq TypeOrConstraint
Instance details Defined in GHC.Types.Basic Methods (==) :: TypeOrConstraint -> TypeOrConstraint -> Bool # (/=) :: TypeOrConstraint -> TypeOrConstraint -> Bool #
Ord TypeOrConstraint
Instance details Defined in GHC.Types.Basic Methods compare :: TypeOrConstraint -> TypeOrConstraint -> Ordering # (<) :: TypeOrConstraint -> TypeOrConstraint -> Bool # (<=) :: TypeOrConstraint -> TypeOrConstraint -> Bool # (>) :: TypeOrConstraint -> TypeOrConstraint -> Bool # (>=) :: TypeOrConstraint -> TypeOrConstraint -> Bool # max :: TypeOrConstraint -> TypeOrConstraint -> TypeOrConstraint # min :: TypeOrConstraint -> TypeOrConstraint -> TypeOrConstraint #

data TypeOrKind #

Flag to see whether we're type-checking terms or kind-checking types

Constructors

TypeLevel
KindLevel

Instances

Instances details

Outputable TypeOrKind
Instance details Defined in GHC.Types.Basic Methods ppr :: TypeOrKind -> SDoc #
Eq TypeOrKind
Instance details Defined in GHC.Types.Basic Methods (==) :: TypeOrKind -> TypeOrKind -> Bool # (/=) :: TypeOrKind -> TypeOrKind -> Bool #

data IntWithInf #

An integer or infinity

Instances

Instances details

Num IntWithInf
Instance details Defined in GHC.Types.Basic Methods (+) :: IntWithInf -> IntWithInf -> IntWithInf # (-) :: IntWithInf -> IntWithInf -> IntWithInf # (*) :: IntWithInf -> IntWithInf -> IntWithInf # negate :: IntWithInf -> IntWithInf # abs :: IntWithInf -> IntWithInf # signum :: IntWithInf -> IntWithInf # fromInteger :: Integer -> IntWithInf #
Outputable IntWithInf
Instance details Defined in GHC.Types.Basic Methods ppr :: IntWithInf -> SDoc #
Eq IntWithInf
Instance details Defined in GHC.Types.Basic Methods (==) :: IntWithInf -> IntWithInf -> Bool # (/=) :: IntWithInf -> IntWithInf -> Bool #
Ord IntWithInf
Instance details Defined in GHC.Types.Basic Methods compare :: IntWithInf -> IntWithInf -> Ordering # (<) :: IntWithInf -> IntWithInf -> Bool # (<=) :: IntWithInf -> IntWithInf -> Bool # (>) :: IntWithInf -> IntWithInf -> Bool # (>=) :: IntWithInf -> IntWithInf -> Bool # max :: IntWithInf -> IntWithInf -> IntWithInf # min :: IntWithInf -> IntWithInf -> IntWithInf #

data UnfoldingSource #

Constructors

VanillaSrc
StableUserSrc
StableSystemSrc
CompulsorySrc

Instances

Instances details

Binary UnfoldingSource
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> UnfoldingSource -> IO () # put :: BinHandle -> UnfoldingSource -> IO (Bin UnfoldingSource) # get :: BinHandle -> IO UnfoldingSource #
Outputable UnfoldingSource
Instance details Defined in GHC.Types.Basic Methods ppr :: UnfoldingSource -> SDoc #

data InlineSpec #

Inline Specification

Constructors

Inline SourceText
Inlinable SourceText
NoInline SourceText
Opaque SourceText
NoUserInlinePrag

Instances

Instances details

Data InlineSpec
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InlineSpec -> c InlineSpec # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c InlineSpec # toConstr :: InlineSpec -> Constr # dataTypeOf :: InlineSpec -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c InlineSpec) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c InlineSpec) # gmapT :: (forall b. Data b => b -> b) -> InlineSpec -> InlineSpec # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InlineSpec -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InlineSpec -> r # gmapQ :: (forall d. Data d => d -> u) -> InlineSpec -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> InlineSpec -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> InlineSpec -> m InlineSpec # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InlineSpec -> m InlineSpec # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InlineSpec -> m InlineSpec #
Show InlineSpec
Instance details Defined in GHC.Types.Basic Methods showsPrec :: Int -> InlineSpec -> ShowS # show :: InlineSpec -> String # showList :: [InlineSpec] -> ShowS #
Binary InlineSpec
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> InlineSpec -> IO () # put :: BinHandle -> InlineSpec -> IO (Bin InlineSpec) # get :: BinHandle -> IO InlineSpec #
Outputable InlineSpec
Instance details Defined in GHC.Types.Basic Methods ppr :: InlineSpec -> SDoc #
Eq InlineSpec
Instance details Defined in GHC.Types.Basic Methods (==) :: InlineSpec -> InlineSpec -> Bool # (/=) :: InlineSpec -> InlineSpec -> Bool #

data RuleMatchInfo #

Rule Match Information

Constructors

ConLike
FunLike

Instances

Instances details

Data RuleMatchInfo
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RuleMatchInfo -> c RuleMatchInfo # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RuleMatchInfo # toConstr :: RuleMatchInfo -> Constr # dataTypeOf :: RuleMatchInfo -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RuleMatchInfo) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RuleMatchInfo) # gmapT :: (forall b. Data b => b -> b) -> RuleMatchInfo -> RuleMatchInfo # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RuleMatchInfo -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RuleMatchInfo -> r # gmapQ :: (forall d. Data d => d -> u) -> RuleMatchInfo -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> RuleMatchInfo -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RuleMatchInfo -> m RuleMatchInfo # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleMatchInfo -> m RuleMatchInfo # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RuleMatchInfo -> m RuleMatchInfo #
Show RuleMatchInfo
Instance details Defined in GHC.Types.Basic Methods showsPrec :: Int -> RuleMatchInfo -> ShowS # show :: RuleMatchInfo -> String # showList :: [RuleMatchInfo] -> ShowS #
Binary RuleMatchInfo
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> RuleMatchInfo -> IO () # put :: BinHandle -> RuleMatchInfo -> IO (Bin RuleMatchInfo) # get :: BinHandle -> IO RuleMatchInfo #
Outputable RuleMatchInfo
Instance details Defined in GHC.Types.Basic Methods ppr :: RuleMatchInfo -> SDoc #
Eq RuleMatchInfo
Instance details Defined in GHC.Types.Basic Methods (==) :: RuleMatchInfo -> RuleMatchInfo -> Bool # (/=) :: RuleMatchInfo -> RuleMatchInfo -> Bool #

data InlinePragma #

Constructors

InlinePragma
Fields inl_src :: SourceText inl_inline :: InlineSpec inl_sat :: Maybe Arity inl_act :: Activation inl_rule :: RuleMatchInfo

Instances

Instances details

Data InlinePragma
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> InlinePragma -> c InlinePragma # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c InlinePragma # toConstr :: InlinePragma -> Constr # dataTypeOf :: InlinePragma -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c InlinePragma) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c InlinePragma) # gmapT :: (forall b. Data b => b -> b) -> InlinePragma -> InlinePragma # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> InlinePragma -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> InlinePragma -> r # gmapQ :: (forall d. Data d => d -> u) -> InlinePragma -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> InlinePragma -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> InlinePragma -> m InlinePragma #
Binary InlinePragma
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> InlinePragma -> IO () # put :: BinHandle -> InlinePragma -> IO (Bin InlinePragma) # get :: BinHandle -> IO InlinePragma #
Outputable InlinePragma
Instance details Defined in GHC.Types.Basic Methods ppr :: InlinePragma -> SDoc #
Eq InlinePragma
Instance details Defined in GHC.Types.Basic Methods (==) :: InlinePragma -> InlinePragma -> Bool # (/=) :: InlinePragma -> InlinePragma -> Bool #

data Activation #

Constructors

AlwaysActive
ActiveBefore SourceText PhaseNum
ActiveAfter SourceText PhaseNum
FinalActive
NeverActive

Instances

Instances details

Data Activation
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Activation -> c Activation # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Activation # toConstr :: Activation -> Constr # dataTypeOf :: Activation -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Activation) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Activation) # gmapT :: (forall b. Data b => b -> b) -> Activation -> Activation # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Activation -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Activation -> r # gmapQ :: (forall d. Data d => d -> u) -> Activation -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Activation -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Activation -> m Activation # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation -> m Activation # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Activation -> m Activation #
Binary Activation
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> Activation -> IO () # put :: BinHandle -> Activation -> IO (Bin Activation) # get :: BinHandle -> IO Activation #
Outputable Activation
Instance details Defined in GHC.Types.Basic Methods ppr :: Activation -> SDoc #
Eq Activation
Instance details Defined in GHC.Types.Basic Methods (==) :: Activation -> Activation -> Bool # (/=) :: Activation -> Activation -> Bool #

data CompilerPhase #

Constructors

InitialPhase
Phase PhaseNum
FinalPhase

Instances

Instances details

Outputable CompilerPhase
Instance details Defined in GHC.Types.Basic Methods ppr :: CompilerPhase -> SDoc #
Eq CompilerPhase
Instance details Defined in GHC.Types.Basic Methods (==) :: CompilerPhase -> CompilerPhase -> Bool # (/=) :: CompilerPhase -> CompilerPhase -> Bool #

data Phase #

Untyped Phase description

Constructors

Unlit HscSource
Cpp HscSource
HsPp HscSource
Hsc HscSource
Ccxx
Cc
Cobjc
Cobjcxx
HCc
As Bool
LlvmOpt
LlvmLlc
LlvmMangle
CmmCpp
Cmm
MergeForeign
Js
StopLn

Instances

Instances details

Show Phase
Instance details Defined in GHC.Driver.Phases Methods showsPrec :: Int -> Phase -> ShowS # show :: Phase -> String # showList :: [Phase] -> ShowS #
Outputable Phase
Instance details Defined in GHC.Driver.Phases Methods ppr :: Phase -> SDoc #
Eq Phase
Instance details Defined in GHC.Driver.Phases Methods (==) :: Phase -> Phase -> Bool # (/=) :: Phase -> Phase -> Bool #

type PhaseNum = Int #

Phase Number

data SuccessFlag #

Constructors

Succeeded
Failed

Instances

Instances details

Semigroup SuccessFlag
Instance details Defined in GHC.Types.Basic Methods (<>) :: SuccessFlag -> SuccessFlag -> SuccessFlag # sconcat :: NonEmpty SuccessFlag -> SuccessFlag # stimes :: Integral b => b -> SuccessFlag -> SuccessFlag #
Outputable SuccessFlag
Instance details Defined in GHC.Types.Basic Methods ppr :: SuccessFlag -> SDoc #

data DefMethSpec ty #

Default Method Specification

Constructors

VanillaDM
GenericDM ty

Instances

Instances details

Binary (DefMethSpec IfaceType)
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> DefMethSpec IfaceType -> IO () # put :: BinHandle -> DefMethSpec IfaceType -> IO (Bin (DefMethSpec IfaceType)) # get :: BinHandle -> IO (DefMethSpec IfaceType) #
Outputable (DefMethSpec ty)
Instance details Defined in GHC.Types.Basic Methods ppr :: DefMethSpec ty -> SDoc #

data TailCallInfo #

Constructors

AlwaysTailCalled JoinArity
NoTailCallInfo

Instances

Instances details

Outputable TailCallInfo
Instance details Defined in GHC.Types.Basic Methods ppr :: TailCallInfo -> SDoc #
Eq TailCallInfo
Instance details Defined in GHC.Types.Basic Methods (==) :: TailCallInfo -> TailCallInfo -> Bool # (/=) :: TailCallInfo -> TailCallInfo -> Bool #

data InsideLam #

Inside Lambda

Constructors

IsInsideLam	Occurs inside a non-linear lambda Substituting a redex for this occurrence is dangerous because it might duplicate work.
NotInsideLam

Instances

Instances details

Monoid InsideLam
Instance details Defined in GHC.Types.Basic Methods mempty :: InsideLam # mappend :: InsideLam -> InsideLam -> InsideLam # mconcat :: [InsideLam] -> InsideLam #
Semigroup InsideLam	If any occurrence of an identifier is inside a lambda, then the occurrence info of that identifier marks it as occurring inside a lambda
Instance details Defined in GHC.Types.Basic Methods (<>) :: InsideLam -> InsideLam -> InsideLam # sconcat :: NonEmpty InsideLam -> InsideLam # stimes :: Integral b => b -> InsideLam -> InsideLam #
Eq InsideLam
Instance details Defined in GHC.Types.Basic Methods (==) :: InsideLam -> InsideLam -> Bool # (/=) :: InsideLam -> InsideLam -> Bool #

data InterestingCxt #

Interesting Context

Constructors

IsInteresting	Function: is applied Data value: scrutinised by a case with at least one non-DEFAULT branch
NotInteresting

Instances

Instances details

Monoid InterestingCxt
Instance details Defined in GHC.Types.Basic Methods mempty :: InterestingCxt # mappend :: InterestingCxt -> InterestingCxt -> InterestingCxt # mconcat :: [InterestingCxt] -> InterestingCxt #
Semigroup InterestingCxt	If there is any `interesting` identifier occurrence, then the aggregated occurrence info of that identifier is considered interesting.
Instance details Defined in GHC.Types.Basic Methods (<>) :: InterestingCxt -> InterestingCxt -> InterestingCxt # sconcat :: NonEmpty InterestingCxt -> InterestingCxt # stimes :: Integral b => b -> InterestingCxt -> InterestingCxt #
Eq InterestingCxt
Instance details Defined in GHC.Types.Basic Methods (==) :: InterestingCxt -> InterestingCxt -> Bool # (/=) :: InterestingCxt -> InterestingCxt -> Bool #

type BranchCount = Int #

data OccInfo #

identifier Occurrence Information

Constructors

ManyOccs	There are many occurrences, or unknown occurrences
Fields occ_tail :: !TailCallInfo
IAmDead	Marks unused variables. Sometimes useful for lambda and case-bound variables.
OneOcc	Occurs exactly once (per branch), not inside a rule
Fields occ_in_lam :: !InsideLam occ_n_br :: !BranchCount occ_int_cxt :: !InterestingCxt occ_tail :: !TailCallInfo
IAmALoopBreaker	This identifier breaks a loop of mutually recursive functions. The field marks whether it is only a loop breaker due to a reference in a rule
Fields occ_rules_only :: !RulesOnly occ_tail :: !TailCallInfo

Instances

Instances details

Outputable OccInfo
Instance details Defined in GHC.Types.Basic Methods ppr :: OccInfo -> SDoc #
Eq OccInfo
Instance details Defined in GHC.Types.Basic Methods (==) :: OccInfo -> OccInfo -> Bool # (/=) :: OccInfo -> OccInfo -> Bool #

data EP a #

Embedding Projection pair

Constructors

EP
Fields fromEP :: a toEP :: a

data UnboxedTupleOrSum #

Are we dealing with an unboxed tuple or an unboxed sum?

Used when validity checking, see check_ubx_tuple_or_sum.

Constructors

UnboxedTupleType
UnboxedSumType

Instances

Instances details

Outputable UnboxedTupleOrSum
Instance details Defined in GHC.Types.Basic Methods ppr :: UnboxedTupleOrSum -> SDoc #
Eq UnboxedTupleOrSum
Instance details Defined in GHC.Types.Basic Methods (==) :: UnboxedTupleOrSum -> UnboxedTupleOrSum -> Bool # (/=) :: UnboxedTupleOrSum -> UnboxedTupleOrSum -> Bool #

data TupleSort #

Constructors

BoxedTuple
UnboxedTuple
ConstraintTuple

Instances

Instances details

Data TupleSort
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TupleSort -> c TupleSort # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TupleSort # toConstr :: TupleSort -> Constr # dataTypeOf :: TupleSort -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TupleSort) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TupleSort) # gmapT :: (forall b. Data b => b -> b) -> TupleSort -> TupleSort # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TupleSort -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TupleSort -> r # gmapQ :: (forall d. Data d => d -> u) -> TupleSort -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TupleSort -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort #
Binary TupleSort
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> TupleSort -> IO () # put :: BinHandle -> TupleSort -> IO (Bin TupleSort) # get :: BinHandle -> IO TupleSort #
Outputable TupleSort
Instance details Defined in GHC.Types.Basic Methods ppr :: TupleSort -> SDoc #
Eq TupleSort
Instance details Defined in GHC.Types.Basic Methods (==) :: TupleSort -> TupleSort -> Bool # (/=) :: TupleSort -> TupleSort -> Bool #

newtype PprPrec #

A general-purpose pretty-printing precedence type.

Constructors

PprPrec Int

Instances

Instances details

Show PprPrec
Instance details Defined in GHC.Types.Basic Methods showsPrec :: Int -> PprPrec -> ShowS # show :: PprPrec -> String # showList :: [PprPrec] -> ShowS #
Eq PprPrec
Instance details Defined in GHC.Types.Basic Methods (==) :: PprPrec -> PprPrec -> Bool # (/=) :: PprPrec -> PprPrec -> Bool #
Ord PprPrec
Instance details Defined in GHC.Types.Basic Methods compare :: PprPrec -> PprPrec -> Ordering # (<) :: PprPrec -> PprPrec -> Bool # (<=) :: PprPrec -> PprPrec -> Bool # (>) :: PprPrec -> PprPrec -> Bool # (>=) :: PprPrec -> PprPrec -> Bool # max :: PprPrec -> PprPrec -> PprPrec # min :: PprPrec -> PprPrec -> PprPrec #

data OverlapMode #

Constructors

NoOverlap SourceText	This instance must not overlap another `NoOverlap` instance. However, it may be overlapped by `Overlapping` instances, and it may overlap `Overlappable` instances.
Overlappable SourceText	Silently ignore this instance if you find a more specific one that matches the constraint you are trying to resolve Example: constraint (Foo [Int]) instance Foo [Int] instance {-# OVERLAPPABLE #-} Foo [a] Since the second instance has the Overlappable flag, the first instance will be chosen (otherwise its ambiguous which to choose)
Overlapping SourceText	Silently ignore any more general instances that may be used to solve the constraint. Example: constraint (Foo [Int]) instance {-# OVERLAPPING #-} Foo [Int] instance Foo [a] Since the first instance has the Overlapping flag, the second---more general---instance will be ignored (otherwise it is ambiguous which to choose)
Overlaps SourceText	Equivalent to having both `Overlapping` and `Overlappable` flags.
Incoherent SourceText	Behave like Overlappable and Overlapping, and in addition pick an arbitrary one if there are multiple matching candidates, and don't worry about later instantiation Example: constraint (Foo [b]) instance {-# INCOHERENT -} Foo [Int] instance Foo [a] Without the Incoherent flag, we'd complain that instantiating `b` would change which instance was chosen. See also Note [Incoherent instances] in GHC.Core.InstEnv

Instances

Instances details

Data OverlapMode
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OverlapMode -> c OverlapMode # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OverlapMode # toConstr :: OverlapMode -> Constr # dataTypeOf :: OverlapMode -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OverlapMode) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OverlapMode) # gmapT :: (forall b. Data b => b -> b) -> OverlapMode -> OverlapMode # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OverlapMode -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OverlapMode -> r # gmapQ :: (forall d. Data d => d -> u) -> OverlapMode -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OverlapMode -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OverlapMode -> m OverlapMode # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OverlapMode -> m OverlapMode # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OverlapMode -> m OverlapMode #
Binary OverlapMode
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> OverlapMode -> IO () # put :: BinHandle -> OverlapMode -> IO (Bin OverlapMode) # get :: BinHandle -> IO OverlapMode #
Outputable OverlapMode
Instance details Defined in GHC.Types.Basic Methods ppr :: OverlapMode -> SDoc #
Eq OverlapMode
Instance details Defined in GHC.Types.Basic Methods (==) :: OverlapMode -> OverlapMode -> Bool # (/=) :: OverlapMode -> OverlapMode -> Bool #
ToHie (LocatedP OverlapMode)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedP OverlapMode -> HieM [HieAST Type]
type Anno OverlapMode
Instance details Defined in GHC.Hs.Decls type Anno OverlapMode = SrcSpanAnnP
type Anno OverlapMode
Instance details Defined in GHC.Hs.Decls type Anno OverlapMode = SrcSpanAnnP

data OverlapFlag #

The semantics allowed for overlapping instances for a particular instance. See Note [Safe Haskell isSafeOverlap] in GHC.Core.InstEnv for a explanation of the isSafeOverlap field.

AnnKeywordId : AnnOpen '{-# OVERLAPPABLE' or '{-# OVERLAPPING' or '{-# OVERLAPS' or '{-# INCOHERENT', AnnClose `#-}`,

Constructors

OverlapFlag
Fields overlapMode :: OverlapMode isSafeOverlap :: Bool

Instances

Instances details

Data OverlapFlag
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OverlapFlag -> c OverlapFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OverlapFlag # toConstr :: OverlapFlag -> Constr # dataTypeOf :: OverlapFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OverlapFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OverlapFlag) # gmapT :: (forall b. Data b => b -> b) -> OverlapFlag -> OverlapFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OverlapFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OverlapFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> OverlapFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OverlapFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OverlapFlag -> m OverlapFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OverlapFlag -> m OverlapFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OverlapFlag -> m OverlapFlag #
Binary OverlapFlag
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> OverlapFlag -> IO () # put :: BinHandle -> OverlapFlag -> IO (Bin OverlapFlag) # get :: BinHandle -> IO OverlapFlag #
Outputable OverlapFlag
Instance details Defined in GHC.Types.Basic Methods ppr :: OverlapFlag -> SDoc #
Eq OverlapFlag
Instance details Defined in GHC.Types.Basic Methods (==) :: OverlapFlag -> OverlapFlag -> Bool # (/=) :: OverlapFlag -> OverlapFlag -> Bool #

data Origin #

Constructors

FromSource
Generated

Instances

Instances details

Data Origin
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Origin -> c Origin # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Origin # toConstr :: Origin -> Constr # dataTypeOf :: Origin -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Origin) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Origin) # gmapT :: (forall b. Data b => b -> b) -> Origin -> Origin # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Origin -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Origin -> r # gmapQ :: (forall d. Data d => d -> u) -> Origin -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Origin -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Origin -> m Origin # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Origin -> m Origin # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Origin -> m Origin #
Outputable Origin
Instance details Defined in GHC.Types.Basic Methods ppr :: Origin -> SDoc #
Eq Origin
Instance details Defined in GHC.Types.Basic Methods (==) :: Origin -> Origin -> Bool # (/=) :: Origin -> Origin -> Bool #

data RecFlag #

Recursivity Flag

Constructors

Recursive
NonRecursive

Instances

Instances details

Data RecFlag
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RecFlag -> c RecFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RecFlag # toConstr :: RecFlag -> Constr # dataTypeOf :: RecFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RecFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RecFlag) # gmapT :: (forall b. Data b => b -> b) -> RecFlag -> RecFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RecFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RecFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> RecFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> RecFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag #
Binary RecFlag
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> RecFlag -> IO () # put :: BinHandle -> RecFlag -> IO (Bin RecFlag) # get :: BinHandle -> IO RecFlag #
Outputable RecFlag
Instance details Defined in GHC.Types.Basic Methods ppr :: RecFlag -> SDoc #
Eq RecFlag
Instance details Defined in GHC.Types.Basic Methods (==) :: RecFlag -> RecFlag -> Bool # (/=) :: RecFlag -> RecFlag -> Bool #

data CbvMark #

Should an argument be passed evaluated *and* tagged.

Constructors

MarkedCbv
NotMarkedCbv

Instances

Instances details

Binary CbvMark
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> CbvMark -> IO () # put :: BinHandle -> CbvMark -> IO (Bin CbvMark) # get :: BinHandle -> IO CbvMark #
Outputable CbvMark
Instance details Defined in GHC.Types.Basic Methods ppr :: CbvMark -> SDoc #
Eq CbvMark
Instance details Defined in GHC.Types.Basic Methods (==) :: CbvMark -> CbvMark -> Bool # (/=) :: CbvMark -> CbvMark -> Bool #

data TopLevelFlag #

Constructors

TopLevel
NotTopLevel

Instances

Instances details

Data TopLevelFlag
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TopLevelFlag -> c TopLevelFlag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TopLevelFlag # toConstr :: TopLevelFlag -> Constr # dataTypeOf :: TopLevelFlag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TopLevelFlag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TopLevelFlag) # gmapT :: (forall b. Data b => b -> b) -> TopLevelFlag -> TopLevelFlag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r # gmapQ :: (forall d. Data d => d -> u) -> TopLevelFlag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TopLevelFlag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag #
Outputable TopLevelFlag
Instance details Defined in GHC.Types.Basic Methods ppr :: TopLevelFlag -> SDoc #

type RuleName = FastString #

data FunctionOrData #

Constructors

IsFunction
IsData

Instances

Instances details

Data FunctionOrData
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunctionOrData -> c FunctionOrData # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunctionOrData # toConstr :: FunctionOrData -> Constr # dataTypeOf :: FunctionOrData -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FunctionOrData) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunctionOrData) # gmapT :: (forall b. Data b => b -> b) -> FunctionOrData -> FunctionOrData # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunctionOrData -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunctionOrData -> r # gmapQ :: (forall d. Data d => d -> u) -> FunctionOrData -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FunctionOrData -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunctionOrData -> m FunctionOrData # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionOrData -> m FunctionOrData # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunctionOrData -> m FunctionOrData #
Binary FunctionOrData
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> FunctionOrData -> IO () # put :: BinHandle -> FunctionOrData -> IO (Bin FunctionOrData) # get :: BinHandle -> IO FunctionOrData #
Outputable FunctionOrData
Instance details Defined in GHC.Types.Basic Methods ppr :: FunctionOrData -> SDoc #
Eq FunctionOrData
Instance details Defined in GHC.Types.Basic Methods (==) :: FunctionOrData -> FunctionOrData -> Bool # (/=) :: FunctionOrData -> FunctionOrData -> Bool #
Ord FunctionOrData
Instance details Defined in GHC.Types.Basic Methods compare :: FunctionOrData -> FunctionOrData -> Ordering # (<) :: FunctionOrData -> FunctionOrData -> Bool # (<=) :: FunctionOrData -> FunctionOrData -> Bool # (>) :: FunctionOrData -> FunctionOrData -> Bool # (>=) :: FunctionOrData -> FunctionOrData -> Bool # max :: FunctionOrData -> FunctionOrData -> FunctionOrData # min :: FunctionOrData -> FunctionOrData -> FunctionOrData #

data SwapFlag #

Constructors

NotSwapped
IsSwapped

Instances

Instances details

Outputable SwapFlag
Instance details Defined in GHC.Types.Basic Methods ppr :: SwapFlag -> SDoc #

data OneShotInfo #

If the Id is a lambda-bound variable then it may have lambda-bound variable info. Sometimes we know whether the lambda binding this variable is a "one-shot" lambda; that is, whether it is applied at most once.

This information may be useful in optimisation, as computations may safely be floated inside such a lambda without risk of duplicating work.

See also Note [OneShotInfo overview] above.

Constructors

NoOneShotInfo	No information
OneShotLam	The lambda is applied at most once.

Instances

Instances details

Outputable OneShotInfo
Instance details Defined in GHC.Types.Basic Methods ppr :: OneShotInfo -> SDoc #
Eq OneShotInfo
Instance details Defined in GHC.Types.Basic Methods (==) :: OneShotInfo -> OneShotInfo -> Bool # (/=) :: OneShotInfo -> OneShotInfo -> Bool #

data Alignment #

A power-of-two alignment

Instances

Instances details

Outputable Alignment
Instance details Defined in GHC.Types.Basic Methods ppr :: Alignment -> SDoc #
Eq Alignment
Instance details Defined in GHC.Types.Basic Methods (==) :: Alignment -> Alignment -> Bool # (/=) :: Alignment -> Alignment -> Bool #
Ord Alignment
Instance details Defined in GHC.Types.Basic Methods compare :: Alignment -> Alignment -> Ordering # (<) :: Alignment -> Alignment -> Bool # (<=) :: Alignment -> Alignment -> Bool # (>) :: Alignment -> Alignment -> Bool # (>=) :: Alignment -> Alignment -> Bool # max :: Alignment -> Alignment -> Alignment # min :: Alignment -> Alignment -> Alignment #
OutputableP env Alignment
Instance details Defined in GHC.Types.Basic Methods pdoc :: env -> Alignment -> SDoc #

type ConTagZ = Int #

A *zero-indexed* constructor tag

type FullArgCount = Int #

FullArgCount is the number of type or value arguments in an application, or the number of type or value binders in a lambda. Note: it includes both type and value arguments!

type JoinArity = Int #

The number of arguments that a join point takes. Unlike the arity of a function, this is a purely syntactic property and is fixed when the join point is created (or converted from a value). Both type and value arguments are counted.

type RepArity = Int #

Representation Arity

The number of represented arguments that can be applied to a value before it does "real work". So: fib 100 has representation arity 0 x -> fib x has representation arity 1 (# x, y #) -> fib (x + y) has representation arity 2

data LeftOrRight #

Constructors

CLeft
CRight

Instances

Instances details

Data LeftOrRight
Instance details Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LeftOrRight -> c LeftOrRight # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LeftOrRight # toConstr :: LeftOrRight -> Constr # dataTypeOf :: LeftOrRight -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LeftOrRight) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LeftOrRight) # gmapT :: (forall b. Data b => b -> b) -> LeftOrRight -> LeftOrRight # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LeftOrRight -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LeftOrRight -> r # gmapQ :: (forall d. Data d => d -> u) -> LeftOrRight -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LeftOrRight -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight #
Binary LeftOrRight
Instance details Defined in GHC.Types.Basic Methods put_ :: BinHandle -> LeftOrRight -> IO () # put :: BinHandle -> LeftOrRight -> IO (Bin LeftOrRight) # get :: BinHandle -> IO LeftOrRight #
Outputable LeftOrRight
Instance details Defined in GHC.Types.Basic Methods ppr :: LeftOrRight -> SDoc #
Eq LeftOrRight
Instance details Defined in GHC.Types.Basic Methods (==) :: LeftOrRight -> LeftOrRight -> Bool # (/=) :: LeftOrRight -> LeftOrRight -> Bool #

data EqSpec #

An EqSpec is a tyvar/type pair representing an equality made in rejigging a GADT constructor

Instances

Instances details

Outputable EqSpec
Instance details Defined in GHC.Core.DataCon Methods ppr :: EqSpec -> SDoc #

data DataConRep #

Data Constructor Representation See Note [Data constructor workers and wrappers]

Constructors

NoDataConRep
DCR
Fields dcr_wrap_id :: Id dcr_boxer :: DataConBoxer dcr_arg_tys :: [Scaled Type] dcr_stricts :: [StrictnessMark] dcr_bangs :: [HsImplBang]

data DataCon #

A data constructor

AnnKeywordId : AnnOpen, AnnClose,AnnComma

Instances

Instances details

Data DataCon
Instance details Defined in GHC.Core.DataCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataCon -> c DataCon # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataCon # toConstr :: DataCon -> Constr # dataTypeOf :: DataCon -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataCon) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataCon) # gmapT :: (forall b. Data b => b -> b) -> DataCon -> DataCon # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r # gmapQ :: (forall d. Data d => d -> u) -> DataCon -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DataCon -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon #
NamedThing DataCon
Instance details Defined in GHC.Core.DataCon Methods getOccName :: DataCon -> OccName # getName :: DataCon -> Name #
Uniquable DataCon
Instance details Defined in GHC.Core.DataCon Methods getUnique :: DataCon -> Unique #
Outputable DataCon
Instance details Defined in GHC.Core.DataCon Methods ppr :: DataCon -> SDoc #
OutputableBndr DataCon
Instance details Defined in GHC.Core.DataCon Methods pprBndr :: BindingSite -> DataCon -> SDoc # pprPrefixOcc :: DataCon -> SDoc # pprInfixOcc :: DataCon -> SDoc # bndrIsJoin_maybe :: DataCon -> Maybe Int #
Eq DataCon
Instance details Defined in GHC.Core.DataCon Methods (==) :: DataCon -> DataCon -> Bool # (/=) :: DataCon -> DataCon -> Bool #

type TidyOccEnv = UniqFM FastString Int #

type OccSet = UniqSet OccName #

data OccEnv a #

Instances

Instances details

Data a => Data (OccEnv a)
Instance details Defined in GHC.Types.Name.Occurrence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccEnv a -> c (OccEnv a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (OccEnv a) # toConstr :: OccEnv a -> Constr # dataTypeOf :: OccEnv a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (OccEnv a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (OccEnv a)) # gmapT :: (forall b. Data b => b -> b) -> OccEnv a -> OccEnv a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccEnv a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccEnv a -> r # gmapQ :: (forall d. Data d => d -> u) -> OccEnv a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OccEnv a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a) #
Outputable a => Outputable (OccEnv a)
Instance details Defined in GHC.Types.Name.Occurrence Methods ppr :: OccEnv a -> SDoc #

data NameSpace #

Instances

Instances details

Binary NameSpace
Instance details Defined in GHC.Types.Name.Occurrence Methods put_ :: BinHandle -> NameSpace -> IO () # put :: BinHandle -> NameSpace -> IO (Bin NameSpace) # get :: BinHandle -> IO NameSpace #
Eq NameSpace
Instance details Defined in GHC.Types.Name.Occurrence Methods (==) :: NameSpace -> NameSpace -> Bool # (/=) :: NameSpace -> NameSpace -> Bool #
Ord NameSpace
Instance details Defined in GHC.Types.Name.Occurrence Methods compare :: NameSpace -> NameSpace -> Ordering # (<) :: NameSpace -> NameSpace -> Bool # (<=) :: NameSpace -> NameSpace -> Bool # (>) :: NameSpace -> NameSpace -> Bool # (>=) :: NameSpace -> NameSpace -> Bool # max :: NameSpace -> NameSpace -> NameSpace # min :: NameSpace -> NameSpace -> NameSpace #

data BuiltInSyntax #

BuiltInSyntax is for things like (:), [] and tuples, which have special syntactic forms. They aren't in scope as such.

Constructors

BuiltInSyntax
UserSyntax

data PiTyBinder #

A PiTyBinder represents an argument to a function. PiTyBinders can be dependent (Named) or nondependent (Anon). They may also be visible or not. See Note [PiTyBinders]

Instances

Instances details

Data PiTyBinder
Instance details Defined in GHC.Types.Var Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PiTyBinder -> c PiTyBinder # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PiTyBinder # toConstr :: PiTyBinder -> Constr # dataTypeOf :: PiTyBinder -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PiTyBinder) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PiTyBinder) # gmapT :: (forall b. Data b => b -> b) -> PiTyBinder -> PiTyBinder # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PiTyBinder -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PiTyBinder -> r # gmapQ :: (forall d. Data d => d -> u) -> PiTyBinder -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PiTyBinder -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PiTyBinder -> m PiTyBinder # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PiTyBinder -> m PiTyBinder # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PiTyBinder -> m PiTyBinder #
Outputable PiTyBinder
Instance details Defined in GHC.Types.Var Methods ppr :: PiTyBinder -> SDoc #

type TyVarBinder = VarBndr TyVar ForAllTyFlag #

type ForAllTyBinder = VarBndr TyCoVar ForAllTyFlag #

Variable Binder

A ForAllTyBinder is the binder of a ForAllTy It's convenient to define this synonym here rather its natural home in GHC.Core.TyCo.Rep, because it's used in GHC.Core.DataCon.hs-boot

A TyVarBinder is a binder with only TyVar

type OutId = Id #

type OutVar = Var #

type InId = Id #

type InVar = Var #

type JoinId = Id #

type DictId = EvId #

Dictionary Identifier

type DFunId = Id #

Dictionary Function Identifier

type CoVar = Id #

Coercion Variable

newtype NonCaffySet #

Ids which have no CAF references. This is a result of analysis of C--. It is always safe to use an empty NonCaffySet. TODO Refer to Note.

Constructors

NonCaffySet
Fields ncs_nameSet :: NameSet

Instances

Instances details

Monoid NonCaffySet
Instance details Defined in GHC.Types.Name.Set Methods mempty :: NonCaffySet # mappend :: NonCaffySet -> NonCaffySet -> NonCaffySet # mconcat :: [NonCaffySet] -> NonCaffySet #
Semigroup NonCaffySet
Instance details Defined in GHC.Types.Name.Set Methods (<>) :: NonCaffySet -> NonCaffySet -> NonCaffySet # sconcat :: NonEmpty NonCaffySet -> NonCaffySet # stimes :: Integral b => b -> NonCaffySet -> NonCaffySet #

type DefUses = OrdList DefUse #

A number of DefUses in dependency order: earlier Defs scope over later Uses In a single (def, use) pair, the defs also scope over the uses

type DefUse = (Maybe Defs, Uses) #

(Just ds, us) => The use of any member of the ds implies that all the us are used too. Also, us may mention ds.

Nothing => Nothing is defined in this group, but nevertheless all the uses are essential. Used for instance declarations, for example

type Uses = NameSet #

A set of names that are used somewhere

type Defs = NameSet #

A set of names that are defined somewhere

type FreeVars = NameSet #

type NameSet = UniqSet Name #

type DNameEnv a = UniqDFM Name a #

Deterministic Name Environment

See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why we need DNameEnv.

type NameEnv a = UniqFM Name a #

Name Environment

data GreName #

Used where we may have an ordinary name or a record field label. See Note [GreNames] in GHC.Types.Name.Reader.

Constructors

NormalGreName Name
FieldGreName FieldLabel

Instances

Instances details

Data GreName
Instance details Defined in GHC.Types.Avail Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GreName -> c GreName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GreName # toConstr :: GreName -> Constr # dataTypeOf :: GreName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GreName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GreName) # gmapT :: (forall b. Data b => b -> b) -> GreName -> GreName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GreName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GreName -> r # gmapQ :: (forall d. Data d => d -> u) -> GreName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GreName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GreName -> m GreName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GreName -> m GreName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GreName -> m GreName #
NFData GreName
Instance details Defined in GHC.Types.Avail Methods rnf :: GreName -> () #
HasOccName GreName
Instance details Defined in GHC.Types.Avail Methods occName :: GreName -> OccName #
Binary GreName
Instance details Defined in GHC.Types.Avail Methods put_ :: BinHandle -> GreName -> IO () # put :: BinHandle -> GreName -> IO (Bin GreName) # get :: BinHandle -> IO GreName #
Outputable GreName
Instance details Defined in GHC.Types.Avail Methods ppr :: GreName -> SDoc #
Eq GreName
Instance details Defined in GHC.Types.Avail Methods (==) :: GreName -> GreName -> Bool # (/=) :: GreName -> GreName -> Bool #
Ord GreName
Instance details Defined in GHC.Types.Avail Methods compare :: GreName -> GreName -> Ordering # (<) :: GreName -> GreName -> Bool # (<=) :: GreName -> GreName -> Bool # (>) :: GreName -> GreName -> Bool # (>=) :: GreName -> GreName -> Bool # max :: GreName -> GreName -> GreName # min :: GreName -> GreName -> GreName #

data AvailInfo #

Records what things are "available", i.e. in scope

Instances

Instances details

Data AvailInfo
Instance details Defined in GHC.Types.Avail Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AvailInfo -> c AvailInfo # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AvailInfo # toConstr :: AvailInfo -> Constr # dataTypeOf :: AvailInfo -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AvailInfo) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AvailInfo) # gmapT :: (forall b. Data b => b -> b) -> AvailInfo -> AvailInfo # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r # gmapQ :: (forall d. Data d => d -> u) -> AvailInfo -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AvailInfo -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo #
NFData AvailInfo
Instance details Defined in GHC.Types.Avail Methods rnf :: AvailInfo -> () #
Binary AvailInfo
Instance details Defined in GHC.Types.Avail Methods put_ :: BinHandle -> AvailInfo -> IO () # put :: BinHandle -> AvailInfo -> IO (Bin AvailInfo) # get :: BinHandle -> IO AvailInfo #
Outputable AvailInfo
Instance details Defined in GHC.Types.Avail Methods ppr :: AvailInfo -> SDoc #
Eq AvailInfo	Used when deciding if the interface has changed
Instance details Defined in GHC.Types.Avail Methods (==) :: AvailInfo -> AvailInfo -> Bool # (/=) :: AvailInfo -> AvailInfo -> Bool #

data ImpItemSpec #

Import Item Specification

Describes import info a particular Name

Constructors

ImpAll

The import had no import list, or had a hiding list

ImpSome

The import had an import list. The is_explicit field is True iff the thing was named explicitly in the import specs rather than being imported as part of a "..." group. Consider:

import C( T(..) )

Here the constructors of T are not named explicitly; only T is named explicitly.

Fields

is_explicit :: Bool
is_iloc :: SrcSpan

Instances

Instances details

Data ImpItemSpec
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpItemSpec -> c ImpItemSpec # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpItemSpec # toConstr :: ImpItemSpec -> Constr # dataTypeOf :: ImpItemSpec -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpItemSpec) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpItemSpec) # gmapT :: (forall b. Data b => b -> b) -> ImpItemSpec -> ImpItemSpec # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r # gmapQ :: (forall d. Data d => d -> u) -> ImpItemSpec -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpItemSpec -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec #
Eq ImpItemSpec
Instance details Defined in GHC.Types.Name.Reader Methods (==) :: ImpItemSpec -> ImpItemSpec -> Bool # (/=) :: ImpItemSpec -> ImpItemSpec -> Bool #

data ImpDeclSpec #

Import Declaration Specification

Describes a particular import declaration and is shared among all the Provenances for that decl

Constructors

ImpDeclSpec
Fields is_mod :: ModuleName Module imported, e.g. `import Muggle` Note the `Muggle` may well not be the defining module for this thing! is_as :: ModuleName Import alias, e.g. from `as M` (or `Muggle` if there is no `as` clause) is_qual :: Bool Was this import qualified? is_dloc :: SrcSpan The location of the entire import declaration

Instances

Instances details

Data ImpDeclSpec
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpDeclSpec -> c ImpDeclSpec # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpDeclSpec # toConstr :: ImpDeclSpec -> Constr # dataTypeOf :: ImpDeclSpec -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpDeclSpec) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpDeclSpec) # gmapT :: (forall b. Data b => b -> b) -> ImpDeclSpec -> ImpDeclSpec # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r # gmapQ :: (forall d. Data d => d -> u) -> ImpDeclSpec -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpDeclSpec -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec #
Eq ImpDeclSpec
Instance details Defined in GHC.Types.Name.Reader Methods (==) :: ImpDeclSpec -> ImpDeclSpec -> Bool # (/=) :: ImpDeclSpec -> ImpDeclSpec -> Bool #

data ImportSpec #

Import Specification

The ImportSpec of something says how it came to be imported It's quite elaborate so that we can give accurate unused-name warnings.

Constructors

ImpSpec
Fields is_decl :: ImpDeclSpec is_item :: ImpItemSpec

Instances

Instances details

Data ImportSpec
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpec -> c ImportSpec # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportSpec # toConstr :: ImportSpec -> Constr # dataTypeOf :: ImportSpec -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportSpec) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportSpec) # gmapT :: (forall b. Data b => b -> b) -> ImportSpec -> ImportSpec # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r # gmapQ :: (forall d. Data d => d -> u) -> ImportSpec -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec #
Outputable ImportSpec
Instance details Defined in GHC.Types.Name.Reader Methods ppr :: ImportSpec -> SDoc #
Eq ImportSpec
Instance details Defined in GHC.Types.Name.Reader Methods (==) :: ImportSpec -> ImportSpec -> Bool # (/=) :: ImportSpec -> ImportSpec -> Bool #

data Parent #

See Note [Parents]

Constructors

NoParent
ParentIs
Fields par_is :: Name

Instances

Instances details

Data Parent
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Parent -> c Parent # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Parent # toConstr :: Parent -> Constr # dataTypeOf :: Parent -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Parent) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Parent) # gmapT :: (forall b. Data b => b -> b) -> Parent -> Parent # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Parent -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Parent -> r # gmapQ :: (forall d. Data d => d -> u) -> Parent -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Parent -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Parent -> m Parent # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Parent -> m Parent # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Parent -> m Parent #
Outputable Parent
Instance details Defined in GHC.Types.Name.Reader Methods ppr :: Parent -> SDoc #
Eq Parent
Instance details Defined in GHC.Types.Name.Reader Methods (==) :: Parent -> Parent -> Bool # (/=) :: Parent -> Parent -> Bool #

data GlobalRdrElt #

Global Reader Element

An element of the GlobalRdrEnv

Instances

Instances details

Data GlobalRdrElt
Instance details Defined in GHC.Types.Name.Reader Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GlobalRdrElt -> c GlobalRdrElt # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GlobalRdrElt # toConstr :: GlobalRdrElt -> Constr # dataTypeOf :: GlobalRdrElt -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GlobalRdrElt) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GlobalRdrElt) # gmapT :: (forall b. Data b => b -> b) -> GlobalRdrElt -> GlobalRdrElt # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GlobalRdrElt -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GlobalRdrElt -> r # gmapQ :: (forall d. Data d => d -> u) -> GlobalRdrElt -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GlobalRdrElt -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt #
HasOccName GlobalRdrElt
Instance details Defined in GHC.Types.Name.Reader Methods occName :: GlobalRdrElt -> OccName #
Outputable GlobalRdrElt
Instance details Defined in GHC.Types.Name.Reader Methods ppr :: GlobalRdrElt -> SDoc #

type GlobalRdrEnv = OccEnv [GlobalRdrElt] #

Global Reader Environment

Keyed by OccName; when looking up a qualified name we look up the OccName part, and then check the Provenance to see if the appropriate qualification is valid. This saves routinely doubling the size of the env by adding both qualified and unqualified names to the domain.

The list in the codomain is required because there may be name clashes These only get reported on lookup, not on construction

INVARIANT 1: All the members of the list have distinct gre_name fields; that is, no duplicate Names

INVARIANT 2: Imported provenance => Name is an ExternalName However LocalDefs can have an InternalName. This happens only when type-checking a [d| ... |] Template Haskell quotation; see this note in GHC.Rename.Names Note [Top-level Names in Template Haskell decl quotes]

INVARIANT 3: If the GlobalRdrEnv maps [occ -> gre], then greOccName gre = occ

NB: greOccName gre is usually the same as nameOccName (greMangledName gre), but not always in the case of record selectors; see Note [GreNames]

data LocalRdrEnv #

Local Reader Environment See Note [LocalRdrEnv]

Instances

Instances details

Outputable LocalRdrEnv
Instance details Defined in GHC.Types.Name.Reader Methods ppr :: LocalRdrEnv -> SDoc #

data ImportedModsVal #

Constructors

ImportedModsVal

Fields

imv_name :: ModuleName
The name the module is imported with
imv_span :: SrcSpan
the source span of the whole import
imv_is_safe :: IsSafeImport
whether this is a safe import
imv_is_hiding :: Bool
whether this is an "hiding" import
imv_all_exports :: !GlobalRdrEnv
all the things the module could provide.
NB. BangPattern here: otherwise this leaks. (#15111)
imv_qualified :: Bool
whether this is a qualified import

data NameAnn #

exact print annotations for a RdrName. There are many kinds of adornment that can be attached to a given RdrName. This type captures them, as detailed on the individual constructors.

Constructors

NameAnn	Used for a name with an adornment, so `foo`, `(bar)`
Fields nann_adornment :: NameAdornment nann_open :: EpaLocation nann_name :: EpaLocation nann_close :: EpaLocation nann_trailing :: [TrailingAnn]
NameAnnCommas	Used for `(,,,)`, or @()#
Fields nann_adornment :: NameAdornment nann_open :: EpaLocation nann_commas :: [EpaLocation] nann_close :: EpaLocation nann_trailing :: [TrailingAnn]
NameAnnBars	Used for `(# \| \| #)`
Fields nann_adornment :: NameAdornment nann_open :: EpaLocation nann_bars :: [EpaLocation] nann_close :: EpaLocation nann_trailing :: [TrailingAnn]
NameAnnOnly	Used for `()`, `(##)`, `[]`
Fields nann_adornment :: NameAdornment nann_open :: EpaLocation nann_close :: EpaLocation nann_trailing :: [TrailingAnn]
NameAnnRArrow	Used for `->`, as an identifier
Fields nann_name :: EpaLocation nann_trailing :: [TrailingAnn]
NameAnnQuote	Used for an item with a leading `'`. The annotation for unquoted item is stored in `nann_quoted`.
Fields nann_quote :: EpaLocation nann_quoted :: SrcSpanAnnN nann_trailing :: [TrailingAnn]
NameAnnTrailing	Used when adding a `TrailingAnn` to an existing `LocatedN` which has no Api Annotation (via the `EpAnnNotUsed` constructor.
Fields nann_trailing :: [TrailingAnn]

Instances

Instances details

Data NameAnn
Instance details Defined in GHC.Parser.Annotation Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NameAnn -> c NameAnn # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NameAnn # toConstr :: NameAnn -> Constr # dataTypeOf :: NameAnn -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NameAnn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NameAnn) # gmapT :: (forall b. Data b => b -> b) -> NameAnn -> NameAnn # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NameAnn -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NameAnn -> r # gmapQ :: (forall d. Data d => d -> u) -> NameAnn -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NameAnn -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn #
Monoid NameAnn
Instance details Defined in GHC.Parser.Annotation Methods mempty :: NameAnn # mappend :: NameAnn -> NameAnn -> NameAnn # mconcat :: [NameAnn] -> NameAnn #
Semigroup NameAnn
Instance details Defined in GHC.Parser.Annotation Methods (<>) :: NameAnn -> NameAnn -> NameAnn # sconcat :: NonEmpty NameAnn -> NameAnn # stimes :: Integral b => b -> NameAnn -> NameAnn #
Outputable NameAnn
Instance details Defined in GHC.Parser.Annotation Methods ppr :: NameAnn -> SDoc #
Eq NameAnn
Instance details Defined in GHC.Parser.Annotation Methods (==) :: NameAnn -> NameAnn -> Bool # (/=) :: NameAnn -> NameAnn -> Bool #
HasLoc (LocatedN a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedN a -> SrcSpan
ToHie (LBooleanFormula (LocatedN Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedN a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedN a) -> HieM [HieAST Type]
type Anno (LocatedN Name)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Name) = SrcSpan
type Anno (LocatedN RdrName)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN RdrName) = SrcSpan
type Anno (LocatedN Id)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Id) = SrcSpan
type Anno [LocatedN Name]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Name] = SrcSpan
type Anno [LocatedN RdrName]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN RdrName] = SrcSpan
type Anno [LocatedN Id]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Id] = SrcSpan

data AnnListItem #

Annotation for items appearing in a list. They can have one or more trailing punctuations items, such as commas or semicolons.

Constructors

AnnListItem
Fields lann_trailing :: [TrailingAnn]

Instances

Instances details

Data AnnListItem
Instance details Defined in GHC.Parser.Annotation Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnListItem -> c AnnListItem # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnListItem # toConstr :: AnnListItem -> Constr # dataTypeOf :: AnnListItem -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnListItem) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnListItem) # gmapT :: (forall b. Data b => b -> b) -> AnnListItem -> AnnListItem # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnListItem -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnListItem -> r # gmapQ :: (forall d. Data d => d -> u) -> AnnListItem -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnListItem -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem #
Monoid AnnListItem
Instance details Defined in GHC.Parser.Annotation Methods mempty :: AnnListItem # mappend :: AnnListItem -> AnnListItem -> AnnListItem # mconcat :: [AnnListItem] -> AnnListItem #
Semigroup AnnListItem
Instance details Defined in GHC.Parser.Annotation Methods (<>) :: AnnListItem -> AnnListItem -> AnnListItem # sconcat :: NonEmpty AnnListItem -> AnnListItem # stimes :: Integral b => b -> AnnListItem -> AnnListItem #
Outputable AnnListItem
Instance details Defined in GHC.Parser.Annotation Methods ppr :: AnnListItem -> SDoc #
Eq AnnListItem
Instance details Defined in GHC.Parser.Annotation Methods (==) :: AnnListItem -> AnnListItem -> Bool # (/=) :: AnnListItem -> AnnListItem -> Bool #
HasLoc (LocatedA a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedA a -> SrcSpan
HiePass p => HasType (LocatedA (HsBind (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))	This instance tries to construct `HieAST` nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs. See Note [Computing the type of every node in the tree]
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (Pat (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedA a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedA a) -> HieM [HieAST Type]
ToHie (EvBindContext (LocatedA TcEvBinds))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IE GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IEWrappedName GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IEWrappedName GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA ModuleName))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]
HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]
(ToHie (RFContext label), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsFieldBind label arg)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (LocatedA (HsFieldBind label arg)) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]
HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]
ToHie (TScoped (LocatedA (HsSigType GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]
ToHie (LocatedA HsWrapper)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA HsWrapper -> HieM [HieAST Type]
ToHie (LocatedA (FixitySig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (AnnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ClsInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DataFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DefaultDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DerivDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DocDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DocDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FamilyDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ForeignDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FunDep GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (InstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RoleAnnotDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (SpliceDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (StandaloneKindSig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyClDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsUntypedSplice (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsUntypedSplice (GhcPass p)) -> HieM [HieAST Type]
(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
ToHie (LocatedA (ImportDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDeclField GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (HsType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC [LocatedA (HsType GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type LocatedAn a = LocatedAn a Source #

type LocatedA = GenLocated SrcSpanAnnA #

type SrcAnn ann = SrcSpanAnn' (EpAnn ann) #

We mostly use 'SrcSpanAnn'' with an 'EpAnn''

data SrcSpanAnn' a #

The 'SrcSpanAnn'' type wraps a normal SrcSpan, together with an extra annotation type. This is mapped to a specific GenLocated usage in the AST through the XRec and Anno type families.

Instances

Instances details

Functor SrcSpanAnn' Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods fmap :: (a -> b) -> SrcSpanAnn' a -> SrcSpanAnn' b # (<$) :: a -> SrcSpanAnn' b -> SrcSpanAnn' a #
Data a => Data (SrcSpanAnn' a)
Instance details Defined in GHC.Parser.Annotation Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpanAnn' a -> c (SrcSpanAnn' a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SrcSpanAnn' a) # toConstr :: SrcSpanAnn' a -> Constr # dataTypeOf :: SrcSpanAnn' a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SrcSpanAnn' a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SrcSpanAnn' a)) # gmapT :: (forall b. Data b => b -> b) -> SrcSpanAnn' a -> SrcSpanAnn' a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r # gmapQ :: (forall d. Data d => d -> u) -> SrcSpanAnn' a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpanAnn' a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a) #
Semigroup an => Semigroup (SrcSpanAnn' an)
Instance details Defined in GHC.Parser.Annotation Methods (<>) :: SrcSpanAnn' an -> SrcSpanAnn' an -> SrcSpanAnn' an # sconcat :: NonEmpty (SrcSpanAnn' an) -> SrcSpanAnn' an # stimes :: Integral b => b -> SrcSpanAnn' an -> SrcSpanAnn' an #
NFData (SrcSpanAnn' a) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: SrcSpanAnn' a -> () #
HasLoc (LocatedA a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedA a -> SrcSpan
HasLoc (LocatedN a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: LocatedN a -> SrcSpan
HiePass p => HasType (LocatedA (HsBind (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))	This instance tries to construct `HieAST` nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs. See Note [Computing the type of every node in the tree]
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (Pat (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]
ToHie (LBooleanFormula (LocatedN Name))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]
HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedA a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedA a) -> HieM [HieAST Type]
ToHie (Context (Located a)) => ToHie (Context (LocatedN a))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (LocatedN a) -> HieM [HieAST Type]
ToHie (EvBindContext (LocatedA TcEvBinds))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IE GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IEWrappedName GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IEWrappedName GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA ModuleName))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]
HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]
(ToHie (RFContext label), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsFieldBind label arg)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (LocatedA (HsFieldBind label arg)) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)) -> HieM [HieAST Type]
HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]
ToHie (TScoped (LocatedA (HsSigType GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]
ToHie (LocatedA HsWrapper)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA HsWrapper -> HieM [HieAST Type]
ToHie (LocatedA (FixitySig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (AnnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ClsInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DataFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DefaultDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DerivDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DocDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DocDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FamilyDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ForeignDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FunDep GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (InstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RoleAnnotDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (SpliceDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (StandaloneKindSig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyClDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsUntypedSplice (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsUntypedSplice (GhcPass p)) -> HieM [HieAST Type]
(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
ToHie (LocatedA (ImportDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDeclField GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (HsType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC (DerivClauseTys GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC [LocatedA (HsType GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedP OverlapMode)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedP OverlapMode -> HieM [HieAST Type]
ToHie (Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)] -> HieM [HieAST Type]
Outputable a => Outputable (SrcSpanAnn' a)
Instance details Defined in GHC.Parser.Annotation Methods ppr :: SrcSpanAnn' a -> SDoc #
Eq a => Eq (SrcSpanAnn' a)
Instance details Defined in GHC.Parser.Annotation Methods (==) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool # (/=) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool #
HasSrcSpan (SrcSpanAnn' ann) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: SrcSpanAnn' ann -> SrcSpan Source #
ToHie (LocatedAn NoEpAnns (HsDerivingClause GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsDerivingClause GhcRn) -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns (InjectivityAnn GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (InjectivityAnn GhcRn) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedAn NoEpAnns (HsCmdTop (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns HsIPName)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns HsIPName -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
NamedThing (Located a) => NamedThing (LocatedAn an a)
Instance details Defined in GHC.Parser.Annotation Methods getOccName :: LocatedAn an a -> OccName # getName :: LocatedAn an a -> Name #
(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)
Instance details Defined in GHC.Parser.Annotation Methods ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc #
(Outputable a, OutputableBndr e) => OutputableBndr (GenLocated (SrcSpanAnn' a) e)
Instance details Defined in GHC.Parser.Annotation Methods pprBndr :: BindingSite -> GenLocated (SrcSpanAnn' a) e -> SDoc # pprPrefixOcc :: GenLocated (SrcSpanAnn' a) e -> SDoc # pprInfixOcc :: GenLocated (SrcSpanAnn' a) e -> SDoc # bndrIsJoin_maybe :: GenLocated (SrcSpanAnn' a) e -> Maybe Int #
HasSrcSpan (GenLocated (SrcSpanAnn' ann) a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan Source #
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno (LocatedN Name)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Name) = SrcSpan
type Anno (LocatedN RdrName)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN RdrName) = SrcSpan
type Anno (LocatedN Id)
Instance details Defined in GHC.Hs.Binds type Anno (LocatedN Id) = SrcSpan
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type Anno [LocatedN Name]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Name] = SrcSpan
type Anno [LocatedN RdrName]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN RdrName] = SrcSpan
type Anno [LocatedN Id]
Instance details Defined in GHC.Hs.Binds type Anno [LocatedN Id] = SrcSpan
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type OutputableBndrId (pass :: Pass) = (OutputableBndr (IdGhcP pass), OutputableBndr (IdGhcP (NoGhcTcPass pass)), Outputable (GenLocated (Anno (IdGhcP pass)) (IdGhcP pass)), Outputable (GenLocated (Anno (IdGhcP (NoGhcTcPass pass))) (IdGhcP (NoGhcTcPass pass))), IsPass pass) #

Constraint type to bundle up the requirement for OutputableBndr on both the id and the NoGhcTc of it. See Note [NoGhcTc].

type family NoGhcTcPass (p :: Pass) :: Pass where ... #

Equations

NoGhcTcPass 'Typechecked = 'Renamed
NoGhcTcPass other = other

type family IdGhcP (pass :: Pass) where ... #

Maps the "normal" id type for a given GHC pass

Equations

IdGhcP 'Parsed = RdrName
IdGhcP 'Renamed = Name
IdGhcP 'Typechecked = Id

class (NoGhcTcPass (NoGhcTcPass p) ~ NoGhcTcPass p, IsPass (NoGhcTcPass p)) => IsPass (p :: Pass) where #

Allows us to check what phase we're in at GHC's runtime. For example, this class allows us to write > f :: forall p. IsPass p => HsExpr (GhcPass p) -> blah > f e = case ghcPass @p of > GhcPs -> ... in this RHS we have HsExpr GhcPs... > GhcRn -> ... in this RHS we have HsExpr GhcRn... > GhcTc -> ... in this RHS we have HsExpr GhcTc... which is very useful, for example, when pretty-printing. See Note [IsPass].

Methods

ghcPass :: GhcPass p #

Instances

Instances details

IsPass 'Parsed
Instance details Defined in GHC.Hs.Extension Methods ghcPass :: GhcPass 'Parsed #
IsPass 'Renamed
Instance details Defined in GHC.Hs.Extension Methods ghcPass :: GhcPass 'Renamed #
IsPass 'Typechecked
Instance details Defined in GHC.Hs.Extension Methods ghcPass :: GhcPass 'Typechecked #

type GhcTc = GhcPass 'Typechecked #

type GhcRn = GhcPass 'Renamed #

type GhcPs = GhcPass 'Parsed #

data Pass #

Constructors

Parsed
Renamed
Typechecked

Instances

Instances details

Data Pass

Instance details

Defined in GHC.Hs.Extension

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Pass -> c Pass #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Pass #

toConstr :: Pass -> Constr #

dataTypeOf :: Pass -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> Pass -> Pass #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Pass -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Pass -> r #

gmapQ :: (forall d. Data d => d -> u) -> Pass -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> Pass -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Pass -> m Pass #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Pass -> m Pass #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Pass -> m Pass #

data GhcPass (c :: Pass) where #

Used as a data type index for the hsSyn AST; also serves as a singleton type for Pass

Constructors

GhcPs :: GhcPass 'Parsed
GhcRn :: GhcPass 'Renamed
GhcTc :: GhcPass 'Typechecked

Instances

Instances details

Typeable p => Data (GhcPass p)
Instance details Defined in GHC.Hs.Extension Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GhcPass p -> c (GhcPass p) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GhcPass p) # toConstr :: GhcPass p -> Constr # dataTypeOf :: GhcPass p -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GhcPass p)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GhcPass p)) # gmapT :: (forall b. Data b => b -> b) -> GhcPass p -> GhcPass p # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GhcPass p -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GhcPass p -> r # gmapQ :: (forall d. Data d => d -> u) -> GhcPass p -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GhcPass p -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GhcPass p -> m (GhcPass p) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GhcPass p -> m (GhcPass p) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GhcPass p -> m (GhcPass p) #
Typeable p => Data (LayoutInfo (GhcPass p))
Instance details Defined in GHC.Hs.Extension Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LayoutInfo (GhcPass p) -> c (LayoutInfo (GhcPass p)) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (LayoutInfo (GhcPass p)) # toConstr :: LayoutInfo (GhcPass p) -> Constr # dataTypeOf :: LayoutInfo (GhcPass p) -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (LayoutInfo (GhcPass p))) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (LayoutInfo (GhcPass p))) # gmapT :: (forall b. Data b => b -> b) -> LayoutInfo (GhcPass p) -> LayoutInfo (GhcPass p) # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LayoutInfo (GhcPass p) -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LayoutInfo (GhcPass p) -> r # gmapQ :: (forall d. Data d => d -> u) -> LayoutInfo (GhcPass p) -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LayoutInfo (GhcPass p) -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LayoutInfo (GhcPass p) -> m (LayoutInfo (GhcPass p)) #
NFData (HsExpr (GhcPass 'Renamed)) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HsExpr (GhcPass 'Renamed) -> () #
NFData (ImportDecl GhcPs) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ImportDecl GhcPs -> () #
NFData (Pat (GhcPass 'Renamed)) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Pat (GhcPass 'Renamed) -> () #
IsPass p => CollectPass (GhcPass p)
Instance details Defined in GHC.Hs.Utils Methods collectXXPat :: CollectFlag (GhcPass p) -> XXPat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] # collectXXHsBindsLR :: XXHsBindsLR (GhcPass p) pR -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] # collectXSplicePat :: CollectFlag (GhcPass p) -> XSplicePat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] #
HasLoc (HsDataDefn GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: HsDataDefn GhcRn -> SrcSpan
HiePass p => HasType (LocatedA (HsBind (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))	This instance tries to construct `HieAST` nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs. See Note [Computing the type of every node in the tree]
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => HasType (LocatedA (Pat (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]
ToHie (LHsDoc GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LHsDoc GhcRn -> HieM [HieAST Type]
HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (Context (FieldOcc (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (FieldOcc (GhcPass p)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IE GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]
ToHie (IEContext (LocatedA (IEWrappedName GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IEWrappedName GhcRn)) -> HieM [HieAST Type]
HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (PatSynFieldContext (RecordPatSynField (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PatSynFieldContext (RecordPatSynField (GhcPass p)) -> HieM [HieAST Type]
(ToHie arg, HasLoc arg, Data arg, HiePass p) => ToHie (RContext (HsRecFields (GhcPass p) arg))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (HsRecFields (GhcPass p) arg) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (NHsValBindsLR (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (NHsValBindsLR (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (DerivStrategy GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)) -> HieM [HieAST Type]
ToHie (RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (RuleBndr GhcRn)) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (HsLocalBinds (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (HsLocalBinds (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (HsValBindsLR (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (HsValBindsLR (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (RScoped (ApplicativeArg (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (ApplicativeArg (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]
ToHie (TScoped (LocatedA (HsSigType GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (HsPatSigType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsPatSigType GhcRn) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (LHsQTyVars GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LHsQTyVars GhcRn) -> HieM [HieAST Type]
Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]
Data flag => ToHie (TVScoped (HsOuterTyVarBndrs flag GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (HsOuterTyVarBndrs flag GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FixitySig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (AnnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ClsInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DataFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DefaultDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DerivDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (DocDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DocDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FamilyDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ForeignDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (FunDep GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (InstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RoleAnnotDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (RuleDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (SpliceDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (StandaloneKindSig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyClDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (TyFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (WarnDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedA (HsUntypedSplice (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsUntypedSplice (GhcPass p)) -> HieM [HieAST Type]
(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
ToHie (LocatedA (ImportDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (ConDeclField GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]
ToHie (LocatedA (HsType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC (DerivClauseTys GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC [LocatedA (HsType GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]
HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]
ToHie (Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)] -> HieM [HieAST Type]
HiePass p => ToHie (HsPatSynDir (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsPatSynDir (GhcPass p) -> HieM [HieAST Type]
ToHie (AnnProvenance GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: AnnProvenance GhcRn -> HieM [HieAST Type]
ToHie (FamilyInfo GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: FamilyInfo GhcRn -> HieM [HieAST Type]
ToHie (ForeignExport GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: ForeignExport GhcRn -> HieM [HieAST Type]
ToHie (ForeignImport GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: ForeignImport GhcRn -> HieM [HieAST Type]
ToHie (HsConDeclGADTDetails GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsConDeclGADTDetails GhcRn -> HieM [HieAST Type]
ToHie (HsDataDefn GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsDataDefn GhcRn -> HieM [HieAST Type]
ToHie (StandaloneKindSig GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: StandaloneKindSig GhcRn -> HieM [HieAST Type]
ToHie (TyClGroup GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TyClGroup GhcRn -> HieM [HieAST Type]
HiePass p => ToHie (HsMatchContext (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsMatchContext (GhcPass p) -> HieM [HieAST Type]
ToHie (HsQuote GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsQuote GhcRn -> HieM [HieAST Type]
HiePass p => ToHie (HsStmtContext (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsStmtContext (GhcPass p) -> HieM [HieAST Type]
HiePass p => ToHie (HsTupArg (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsTupArg (GhcPass p) -> HieM [HieAST Type]
DisambECP (PatBuilder GhcPs)
Instance details Defined in GHC.Parser.PostProcess Associated Types type Body (PatBuilder GhcPs) :: Type -> Type # type InfixOp (PatBuilder GhcPs) # type FunArg (PatBuilder GhcPs) # Methods ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (PatBuilder GhcPs)) # ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (PatBuilder GhcPs)) # mkHsProjUpdatePV :: SrcSpan -> Located [LocatedAn NoEpAnns (DotFieldOcc GhcPs)] -> LocatedA (PatBuilder GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (PatBuilder GhcPs))) # mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (PatBuilder GhcPs))) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsLetPV :: SrcSpan -> LHsToken "let" GhcPs -> HsLocalBinds GhcPs -> LHsToken "in" GhcPs -> LocatedA (PatBuilder GhcPs) -> PV (LocatedA (PatBuilder GhcPs)) # superInfixOp :: (DisambInfixOp (InfixOp (PatBuilder GhcPs)) => PV (LocatedA (PatBuilder GhcPs))) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsOpAppPV :: SrcSpan -> LocatedA (PatBuilder GhcPs) -> LocatedN (InfixOp (PatBuilder GhcPs)) -> LocatedA (PatBuilder GhcPs) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (PatBuilder GhcPs))] -> EpAnnHsCase -> PV (LocatedA (PatBuilder GhcPs)) # mkHsLamCasePV :: SrcSpan -> LamCaseVariant -> LocatedL [LMatch GhcPs (LocatedA (PatBuilder GhcPs))] -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # superFunArg :: (DisambECP (FunArg (PatBuilder GhcPs)) => PV (LocatedA (PatBuilder GhcPs))) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsAppPV :: SrcSpanAnnA -> LocatedA (PatBuilder GhcPs) -> LocatedA (FunArg (PatBuilder GhcPs)) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (PatBuilder GhcPs) -> LHsToken "@" GhcPs -> LHsType GhcPs -> PV (LocatedA (PatBuilder GhcPs)) # mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (PatBuilder GhcPs) -> Bool -> LocatedA (PatBuilder GhcPs) -> AnnsIf -> PV (LocatedA (PatBuilder GhcPs)) # mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (PatBuilder GhcPs))] -> AnnList -> PV (LocatedA (PatBuilder GhcPs)) # mkHsParPV :: SrcSpan -> LHsToken "(" GhcPs -> LocatedA (PatBuilder GhcPs) -> LHsToken ")" GhcPs -> PV (LocatedA (PatBuilder GhcPs)) # mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (PatBuilder GhcPs)) # mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (PatBuilder GhcPs)) # mkHsOverLitPV :: LocatedAn a (HsOverLit GhcPs) -> PV (LocatedAn a (PatBuilder GhcPs)) # mkHsWildCardPV :: SrcSpan -> PV (Located (PatBuilder GhcPs)) # mkHsTySigPV :: SrcSpanAnnA -> LocatedA (PatBuilder GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkHsExplicitListPV :: SrcSpan -> [LocatedA (PatBuilder GhcPs)] -> AnnList -> PV (LocatedA (PatBuilder GhcPs)) # mkHsSplicePV :: Located (HsUntypedSplice GhcPs) -> PV (Located (PatBuilder GhcPs)) # mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (PatBuilder GhcPs) -> ([Fbind (PatBuilder GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkHsNegAppPV :: SrcSpan -> LocatedA (PatBuilder GhcPs) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (PatBuilder GhcPs)) -> LocatedA (PatBuilder GhcPs) -> PV (Located (PatBuilder GhcPs)) # mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (PatBuilder GhcPs) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LHsToken "@" GhcPs -> LocatedA (PatBuilder GhcPs) -> PV (LocatedA (PatBuilder GhcPs)) # mkHsLazyPatPV :: SrcSpan -> LocatedA (PatBuilder GhcPs) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkHsBangPatPV :: SrcSpan -> LocatedA (PatBuilder GhcPs) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (PatBuilder GhcPs) -> [AddEpAnn] -> PV (LocatedA (PatBuilder GhcPs)) # rejectPragmaPV :: LocatedA (PatBuilder GhcPs) -> PV () #
DisambECP (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess Associated Types type Body (HsCmd GhcPs) :: Type -> Type # type InfixOp (HsCmd GhcPs) # type FunArg (HsCmd GhcPs) # Methods ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsCmd GhcPs)) # ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsProjUpdatePV :: SrcSpan -> Located [LocatedAn NoEpAnns (DotFieldOcc GhcPs)] -> LocatedA (HsCmd GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsCmd GhcPs))) # mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsLetPV :: SrcSpan -> LHsToken "let" GhcPs -> HsLocalBinds GhcPs -> LHsToken "in" GhcPs -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # superInfixOp :: (DisambInfixOp (InfixOp (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsOpAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> LocatedN (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsCmd GhcPs)) # mkHsLamCasePV :: SrcSpan -> LamCaseVariant -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # superFunArg :: (DisambECP (FunArg (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LocatedA (FunArg (HsCmd GhcPs)) -> PV (LocatedA (HsCmd GhcPs)) # mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LHsToken "@" GhcPs -> LHsType GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsCmd GhcPs) -> Bool -> LocatedA (HsCmd GhcPs) -> AnnsIf -> PV (LocatedA (HsCmd GhcPs)) # mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsCmd GhcPs))] -> AnnList -> PV (LocatedA (HsCmd GhcPs)) # mkHsParPV :: SrcSpan -> LHsToken "(" GhcPs -> LocatedA (HsCmd GhcPs) -> LHsToken ")" GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsCmd GhcPs)) # mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsOverLitPV :: LocatedAn a (HsOverLit GhcPs) -> PV (LocatedAn a (HsCmd GhcPs)) # mkHsWildCardPV :: SrcSpan -> PV (Located (HsCmd GhcPs)) # mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsCmd GhcPs)] -> AnnList -> PV (LocatedA (HsCmd GhcPs)) # mkHsSplicePV :: Located (HsUntypedSplice GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsCmd GhcPs) -> ([Fbind (HsCmd GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsNegAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LHsToken "@" GhcPs -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # mkHsLazyPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsBangPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # rejectPragmaPV :: LocatedA (HsCmd GhcPs) -> PV () #
DisambECP (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess Associated Types type Body (HsExpr GhcPs) :: Type -> Type # type InfixOp (HsExpr GhcPs) # type FunArg (HsExpr GhcPs) # Methods ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsExpr GhcPs)) # ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsProjUpdatePV :: SrcSpan -> Located [LocatedAn NoEpAnns (DotFieldOcc GhcPs)] -> LocatedA (HsExpr GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsExpr GhcPs))) # mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsLetPV :: SrcSpan -> LHsToken "let" GhcPs -> HsLocalBinds GhcPs -> LHsToken "in" GhcPs -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # superInfixOp :: (DisambInfixOp (InfixOp (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsOpAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> LocatedN (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsExpr GhcPs)) # mkHsLamCasePV :: SrcSpan -> LamCaseVariant -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # superFunArg :: (DisambECP (FunArg (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs)) # mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LocatedA (FunArg (HsExpr GhcPs)) -> PV (LocatedA (HsExpr GhcPs)) # mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsToken "@" GhcPs -> LHsType GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsExpr GhcPs) -> Bool -> LocatedA (HsExpr GhcPs) -> AnnsIf -> PV (LocatedA (HsExpr GhcPs)) # mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsExpr GhcPs))] -> AnnList -> PV (LocatedA (HsExpr GhcPs)) # mkHsParPV :: SrcSpan -> LHsToken "(" GhcPs -> LocatedA (HsExpr GhcPs) -> LHsToken ")" GhcPs -> PV (LocatedA (HsExpr GhcPs)) # mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs)) # mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsOverLitPV :: LocatedAn a (HsOverLit GhcPs) -> PV (LocatedAn a (HsExpr GhcPs)) # mkHsWildCardPV :: SrcSpan -> PV (Located (HsExpr GhcPs)) # mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsExpr GhcPs)] -> AnnList -> PV (LocatedA (HsExpr GhcPs)) # mkHsSplicePV :: Located (HsUntypedSplice GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsExpr GhcPs) -> ([Fbind (HsExpr GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsNegAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (Located (HsExpr GhcPs)) # mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LHsToken "@" GhcPs -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs)) # mkHsLazyPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkHsBangPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs)) # rejectPragmaPV :: LocatedA (HsExpr GhcPs) -> PV () #
DisambInfixOp (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess Methods mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs)) # mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs)) # mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located (HsExpr GhcPs)) #
DisambTD (HsType GhcPs)
Instance details Defined in GHC.Parser.PostProcess Methods mkHsAppTyHeadPV :: LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsAppTyPV :: LocatedA (HsType GhcPs) -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsAppKindTyPV :: LocatedA (HsType GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsOpTyPV :: PromotionFlag -> LHsType GhcPs -> LocatedN RdrName -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkUnpackednessPV :: Located UnpackednessPragma -> LocatedA (HsType GhcPs) -> PV (LocatedA (HsType GhcPs)) #
Binary (WarningTxt GhcRn)
Instance details Defined in GHC.Unit.Module.Warnings Methods put_ :: BinHandle -> WarningTxt GhcRn -> IO () # put :: BinHandle -> WarningTxt GhcRn -> IO (Bin (WarningTxt GhcRn)) # get :: BinHandle -> IO (WarningTxt GhcRn) #
Binary (Warnings GhcRn)
Instance details Defined in GHC.Unit.Module.Warnings Methods put_ :: BinHandle -> Warnings GhcRn -> IO () # put :: BinHandle -> Warnings GhcRn -> IO (Bin (Warnings GhcRn)) # get :: BinHandle -> IO (Warnings GhcRn) #
Outputable (PatBuilder GhcPs)
Instance details Defined in GHC.Parser.Types Methods ppr :: PatBuilder GhcPs -> SDoc #
OutputableBndrId a => Outputable (InstInfo (GhcPass a))
Instance details Defined in GHC.Tc.Utils.Env Methods ppr :: InstInfo (GhcPass a) -> SDoc #
MapXRec (GhcPass p)
Instance details Defined in GHC.Hs.Extension Methods mapXRec :: Anno a ~ Anno b => (a -> b) -> XRec (GhcPass p) a -> XRec (GhcPass p) b #
UnXRec (GhcPass p)
Instance details Defined in GHC.Hs.Extension Methods unXRec :: XRec (GhcPass p) a -> a #
(HasLoc a, HiePass p) => HasLoc (FamEqn (GhcPass p) a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: FamEqn (GhcPass p) a -> SrcSpan
ToHie (LocatedAn NoEpAnns (HsDerivingClause GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsDerivingClause GhcRn) -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns (InjectivityAnn GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (InjectivityAnn GhcRn) -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
HiePass p => ToHie (LocatedAn NoEpAnns (HsCmdTop (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]
(ToHie rhs, HasLoc rhs) => ToHie (FamEqn GhcRn rhs)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: FamEqn GhcRn rhs -> HieM [HieAST Type]
(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]
ToHie a => ToHie (HsScaled GhcRn a)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsScaled GhcRn a -> HieM [HieAST Type]
Binary a => Binary (WithHsDocIdentifiers a GhcRn)
Instance details Defined in GHC.Hs.Doc Methods put_ :: BinHandle -> WithHsDocIdentifiers a GhcRn -> IO () # put :: BinHandle -> WithHsDocIdentifiers a GhcRn -> IO (Bin (WithHsDocIdentifiers a GhcRn)) # get :: BinHandle -> IO (WithHsDocIdentifiers a GhcRn) #
type ImportDeclPkgQual GhcPs
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcPs = RawPkgQual
type ImportDeclPkgQual GhcRn
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcRn = PkgQual
type ImportDeclPkgQual GhcTc
Instance details Defined in GHC.Hs.ImpExp type ImportDeclPkgQual GhcTc = PkgQual
type XAmbiguous GhcPs
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcPs = NoExtField
type XAmbiguous GhcRn
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcRn = NoExtField
type XAmbiguous GhcTc
Instance details Defined in GHC.Hs.Type type XAmbiguous GhcTc = Id
type XAnyClassStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcPs = EpAnn [AddEpAnn]
type XAnyClassStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcRn = NoExtField
type XAnyClassStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XAnyClassStrategy GhcTc = NoExtField
type XAppTypeE GhcPs
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcPs = NoExtField
type XAppTypeE GhcRn
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcRn = NoExtField
type XAppTypeE GhcTc
Instance details Defined in GHC.Hs.Expr type XAppTypeE GhcTc = Type
type XApplicativeArgOne GhcPs
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcPs = NoExtField
type XApplicativeArgOne GhcRn
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcRn = FailOperator GhcRn
type XApplicativeArgOne GhcTc
Instance details Defined in GHC.Hs.Expr type XApplicativeArgOne GhcTc = FailOperator GhcTc
type XArithSeq GhcPs
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcPs = EpAnn [AddEpAnn]
type XArithSeq GhcRn
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcRn = NoExtField
type XArithSeq GhcTc
Instance details Defined in GHC.Hs.Expr type XArithSeq GhcTc = PostTcExpr
type XAsPat GhcPs
Instance details Defined in GHC.Hs.Pat type XAsPat GhcPs = EpAnnCO
type XAsPat GhcRn
Instance details Defined in GHC.Hs.Pat type XAsPat GhcRn = NoExtField
type XAsPat GhcTc
Instance details Defined in GHC.Hs.Pat type XAsPat GhcTc = NoExtField
type XBangPat GhcPs
Instance details Defined in GHC.Hs.Pat type XBangPat GhcPs = EpAnn [AddEpAnn]
type XBangPat GhcRn
Instance details Defined in GHC.Hs.Pat type XBangPat GhcRn = NoExtField
type XBangPat GhcTc
Instance details Defined in GHC.Hs.Pat type XBangPat GhcTc = NoExtField
type XCClsInstDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)
type XCClsInstDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcRn = NoExtField
type XCClsInstDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCClsInstDecl GhcTc = NoExtField
type XCDefaultDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcPs = EpAnn [AddEpAnn]
type XCDefaultDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcRn = NoExtField
type XCDefaultDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCDefaultDecl GhcTc = NoExtField
type XCFieldOcc GhcPs
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcPs = NoExtField
type XCFieldOcc GhcRn
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcRn = Name
type XCFieldOcc GhcTc
Instance details Defined in GHC.Hs.Type type XCFieldOcc GhcTc = Id
type XCIPBind GhcPs
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcPs = EpAnn [AddEpAnn]
type XCIPBind GhcRn
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcRn = NoExtField
type XCIPBind GhcTc
Instance details Defined in GHC.Hs.Binds type XCIPBind GhcTc = Id
type XCImportDecl GhcPs
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcPs = XImportDeclPass
type XCImportDecl GhcRn
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcRn = XImportDeclPass
type XCImportDecl GhcTc
Instance details Defined in GHC.Hs.ImpExp type XCImportDecl GhcTc = DataConCantHappen
type XCModule GhcPs
Instance details Defined in GHC.Hs type XCModule GhcPs = XModulePs
type XCModule GhcRn
Instance details Defined in GHC.Hs type XCModule GhcRn = DataConCantHappen
type XCModule GhcTc
Instance details Defined in GHC.Hs type XCModule GhcTc = DataConCantHappen
type XCRoleAnnotDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcPs = EpAnn [AddEpAnn]
type XCRoleAnnotDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcRn = NoExtField
type XCRoleAnnotDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XCRoleAnnotDecl GhcTc = NoExtField
type XCRuleDecls GhcPs
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcPs = (EpAnn [AddEpAnn], SourceText)
type XCRuleDecls GhcRn
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcRn = SourceText
type XCRuleDecls GhcTc
Instance details Defined in GHC.Hs.Decls type XCRuleDecls GhcTc = SourceText
type XCase GhcPs
Instance details Defined in GHC.Hs.Expr type XCase GhcPs = EpAnn EpAnnHsCase
type XCase GhcRn
Instance details Defined in GHC.Hs.Expr type XCase GhcRn = NoExtField
type XCase GhcTc
Instance details Defined in GHC.Hs.Expr type XCase GhcTc = NoExtField
type XClassDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)
type XClassDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcRn = NameSet
type XClassDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XClassDecl GhcTc = NameSet
type XCmdArrApp GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcPs = EpAnn AddEpAnn
type XCmdArrApp GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcRn = NoExtField
type XCmdArrApp GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdArrApp GhcTc = Type
type XCmdArrForm GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcPs = EpAnn AnnList
type XCmdArrForm GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcRn = NoExtField
type XCmdArrForm GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdArrForm GhcTc = NoExtField
type XCmdCase GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcPs = EpAnn EpAnnHsCase
type XCmdCase GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcRn = NoExtField
type XCmdCase GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdCase GhcTc = NoExtField
type XCmdDo GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcPs = EpAnn AnnList
type XCmdDo GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcRn = NoExtField
type XCmdDo GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdDo GhcTc = Type
type XCmdIf GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcPs = EpAnn AnnsIf
type XCmdIf GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcRn = NoExtField
type XCmdIf GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdIf GhcTc = NoExtField
type XCmdLet GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcPs = EpAnnCO
type XCmdLet GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcRn = NoExtField
type XCmdLet GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdLet GhcTc = NoExtField
type XCmdTop GhcPs
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcPs = NoExtField
type XCmdTop GhcRn
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcRn = CmdSyntaxTable GhcRn
type XCmdTop GhcTc
Instance details Defined in GHC.Hs.Expr type XCmdTop GhcTc = CmdTopTc
type XConPat GhcPs
Instance details Defined in GHC.Hs.Pat type XConPat GhcPs = EpAnn [AddEpAnn]
type XConPat GhcRn
Instance details Defined in GHC.Hs.Pat type XConPat GhcRn = NoExtField
type XConPat GhcTc
Instance details Defined in GHC.Hs.Pat type XConPat GhcTc = ConPatTc
type XDataDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcPs = EpAnn [AddEpAnn]
type XDataDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcRn = DataDeclRn
type XDataDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XDataDecl GhcTc = DataDeclRn
type XDecBrG GhcPs
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcPs = NoExtField
type XDecBrG GhcRn
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcRn = NoExtField
type XDecBrG GhcTc
Instance details Defined in GHC.Hs.Expr type XDecBrG GhcTc = DataConCantHappen
type XDecBrL GhcPs
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcPs = NoExtField
type XDecBrL GhcRn
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcRn = NoExtField
type XDecBrL GhcTc
Instance details Defined in GHC.Hs.Expr type XDecBrL GhcTc = DataConCantHappen
type XDo GhcPs
Instance details Defined in GHC.Hs.Expr type XDo GhcPs = EpAnn AnnList
type XDo GhcRn
Instance details Defined in GHC.Hs.Expr type XDo GhcRn = NoExtField
type XDo GhcTc
Instance details Defined in GHC.Hs.Expr type XDo GhcTc = Type
type XExpBr GhcPs
Instance details Defined in GHC.Hs.Expr type XExpBr GhcPs = NoExtField
type XExpBr GhcRn
Instance details Defined in GHC.Hs.Expr type XExpBr GhcRn = NoExtField
type XExpBr GhcTc
Instance details Defined in GHC.Hs.Expr type XExpBr GhcTc = DataConCantHappen
type XExplicitList GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcPs = EpAnn AnnList
type XExplicitList GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcRn = NoExtField
type XExplicitList GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitList GhcTc = Type
type XExplicitListTy GhcPs
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcPs = EpAnn [AddEpAnn]
type XExplicitListTy GhcRn
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcRn = NoExtField
type XExplicitListTy GhcTc
Instance details Defined in GHC.Hs.Type type XExplicitListTy GhcTc = Kind
type XExplicitSum GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcPs = EpAnn AnnExplicitSum
type XExplicitSum GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcRn = NoExtField
type XExplicitSum GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitSum GhcTc = [Type]
type XExplicitTuple GhcPs
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcPs = EpAnn [AddEpAnn]
type XExplicitTuple GhcRn
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcRn = NoExtField
type XExplicitTuple GhcTc
Instance details Defined in GHC.Hs.Expr type XExplicitTuple GhcTc = NoExtField
type XExplicitTupleTy GhcPs
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcPs = EpAnn [AddEpAnn]
type XExplicitTupleTy GhcRn
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcRn = NoExtField
type XExplicitTupleTy GhcTc
Instance details Defined in GHC.Hs.Type type XExplicitTupleTy GhcTc = [Kind]
type XExprWithTySig GhcPs
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcPs = EpAnn [AddEpAnn]
type XExprWithTySig GhcRn
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcRn = NoExtField
type XExprWithTySig GhcTc
Instance details Defined in GHC.Hs.Expr type XExprWithTySig GhcTc = NoExtField
type XForeignExport GhcPs
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcPs = EpAnn [AddEpAnn]
type XForeignExport GhcRn
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcRn = NoExtField
type XForeignExport GhcTc
Instance details Defined in GHC.Hs.Decls type XForeignExport GhcTc = Coercion
type XForeignImport GhcPs
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcPs = EpAnn [AddEpAnn]
type XForeignImport GhcRn
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcRn = NoExtField
type XForeignImport GhcTc
Instance details Defined in GHC.Hs.Decls type XForeignImport GhcTc = Coercion
type XGetField GhcPs
Instance details Defined in GHC.Hs.Expr type XGetField GhcPs = EpAnnCO
type XGetField GhcRn
Instance details Defined in GHC.Hs.Expr type XGetField GhcRn = NoExtField
type XGetField GhcTc
Instance details Defined in GHC.Hs.Expr type XGetField GhcTc = DataConCantHappen
type XHsOuterImplicit GhcPs
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcPs = NoExtField
type XHsOuterImplicit GhcRn
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcRn = [Name]
type XHsOuterImplicit GhcTc
Instance details Defined in GHC.Hs.Type type XHsOuterImplicit GhcTc = [TyVar]
type XHsPS GhcPs
Instance details Defined in GHC.Hs.Type type XHsPS GhcPs = EpAnnCO
type XHsPS GhcRn
Instance details Defined in GHC.Hs.Type type XHsPS GhcRn = HsPSRn
type XHsPS GhcTc
Instance details Defined in GHC.Hs.Type type XHsPS GhcTc = HsPSRn
type XHsQTvs GhcPs
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcPs = NoExtField
type XHsQTvs GhcRn
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcRn = HsQTvsRn
type XHsQTvs GhcTc
Instance details Defined in GHC.Hs.Type type XHsQTvs GhcTc = HsQTvsRn
type XHsRule GhcPs
Instance details Defined in GHC.Hs.Decls type XHsRule GhcPs = (EpAnn HsRuleAnn, SourceText)
type XHsRule GhcRn
Instance details Defined in GHC.Hs.Decls type XHsRule GhcRn = (HsRuleRn, SourceText)
type XHsRule GhcTc
Instance details Defined in GHC.Hs.Decls type XHsRule GhcTc = (HsRuleRn, SourceText)
type XIEModuleContents GhcPs
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcPs = EpAnn [AddEpAnn]
type XIEModuleContents GhcRn
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcRn = NoExtField
type XIEModuleContents GhcTc
Instance details Defined in GHC.Hs.ImpExp type XIEModuleContents GhcTc = NoExtField
type XIEVar GhcPs
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcPs = NoExtField
type XIEVar GhcRn
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcRn = NoExtField
type XIEVar GhcTc
Instance details Defined in GHC.Hs.ImpExp type XIEVar GhcTc = NoExtField
type XIPBinds GhcPs
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcPs = NoExtField
type XIPBinds GhcRn
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcRn = NoExtField
type XIPBinds GhcTc
Instance details Defined in GHC.Hs.Binds type XIPBinds GhcTc = TcEvBinds
type XIPVar GhcPs
Instance details Defined in GHC.Hs.Expr type XIPVar GhcPs = EpAnnCO
type XIPVar GhcRn
Instance details Defined in GHC.Hs.Expr type XIPVar GhcRn = EpAnnCO
type XIPVar GhcTc
Instance details Defined in GHC.Hs.Expr type XIPVar GhcTc = DataConCantHappen
type XIf GhcPs
Instance details Defined in GHC.Hs.Expr type XIf GhcPs = EpAnn AnnsIf
type XIf GhcRn
Instance details Defined in GHC.Hs.Expr type XIf GhcRn = NoExtField
type XIf GhcTc
Instance details Defined in GHC.Hs.Expr type XIf GhcTc = NoExtField
type XLazyPat GhcPs
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcPs = EpAnn [AddEpAnn]
type XLazyPat GhcRn
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcRn = NoExtField
type XLazyPat GhcTc
Instance details Defined in GHC.Hs.Pat type XLazyPat GhcTc = NoExtField
type XLet GhcPs
Instance details Defined in GHC.Hs.Expr type XLet GhcPs = EpAnnCO
type XLet GhcRn
Instance details Defined in GHC.Hs.Expr type XLet GhcRn = NoExtField
type XLet GhcTc
Instance details Defined in GHC.Hs.Expr type XLet GhcTc = NoExtField
type XListPat GhcPs
Instance details Defined in GHC.Hs.Pat type XListPat GhcPs = EpAnn AnnList
type XListPat GhcRn
Instance details Defined in GHC.Hs.Pat type XListPat GhcRn = NoExtField
type XListPat GhcTc
Instance details Defined in GHC.Hs.Pat type XListPat GhcTc = Type
type XMissing GhcPs
Instance details Defined in GHC.Hs.Expr type XMissing GhcPs = EpAnn EpaLocation
type XMissing GhcRn
Instance details Defined in GHC.Hs.Expr type XMissing GhcRn = NoExtField
type XMissing GhcTc
Instance details Defined in GHC.Hs.Expr type XMissing GhcTc = Scaled Type
type XMultiIf GhcPs
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcPs = EpAnn [AddEpAnn]
type XMultiIf GhcRn
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcRn = NoExtField
type XMultiIf GhcTc
Instance details Defined in GHC.Hs.Expr type XMultiIf GhcTc = Type
type XNPat GhcPs
Instance details Defined in GHC.Hs.Pat type XNPat GhcPs = EpAnn [AddEpAnn]
type XNPat GhcRn
Instance details Defined in GHC.Hs.Pat type XNPat GhcRn = EpAnn [AddEpAnn]
type XNPat GhcTc
Instance details Defined in GHC.Hs.Pat type XNPat GhcTc = Type
type XNPlusKPat GhcPs
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcPs = EpAnn EpaLocation
type XNPlusKPat GhcRn
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcRn = NoExtField
type XNPlusKPat GhcTc
Instance details Defined in GHC.Hs.Pat type XNPlusKPat GhcTc = Type
type XNegApp GhcPs
Instance details Defined in GHC.Hs.Expr type XNegApp GhcPs = EpAnn [AddEpAnn]
type XNegApp GhcRn
Instance details Defined in GHC.Hs.Expr type XNegApp GhcRn = NoExtField
type XNegApp GhcTc
Instance details Defined in GHC.Hs.Expr type XNegApp GhcTc = NoExtField
type XNewtypeStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcPs = EpAnn [AddEpAnn]
type XNewtypeStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcRn = NoExtField
type XNewtypeStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XNewtypeStrategy GhcTc = NoExtField
type XOpApp GhcPs
Instance details Defined in GHC.Hs.Expr type XOpApp GhcPs = EpAnn [AddEpAnn]
type XOpApp GhcRn
Instance details Defined in GHC.Hs.Expr type XOpApp GhcRn = Fixity
type XOpApp GhcTc
Instance details Defined in GHC.Hs.Expr type XOpApp GhcTc = DataConCantHappen
type XOverLabel GhcPs
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcPs = EpAnnCO
type XOverLabel GhcRn
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcRn = EpAnnCO
type XOverLabel GhcTc
Instance details Defined in GHC.Hs.Expr type XOverLabel GhcTc = DataConCantHappen
type XOverLit GhcPs
Instance details Defined in GHC.Hs.Lit type XOverLit GhcPs = NoExtField
type XOverLit GhcRn
Instance details Defined in GHC.Hs.Lit type XOverLit GhcRn = OverLitRn
type XOverLit GhcTc
Instance details Defined in GHC.Hs.Lit type XOverLit GhcTc = OverLitTc
type XPatBr GhcPs
Instance details Defined in GHC.Hs.Expr type XPatBr GhcPs = NoExtField
type XPatBr GhcRn
Instance details Defined in GHC.Hs.Expr type XPatBr GhcRn = NoExtField
type XPatBr GhcTc
Instance details Defined in GHC.Hs.Expr type XPatBr GhcTc = DataConCantHappen
type XProjection GhcPs
Instance details Defined in GHC.Hs.Expr type XProjection GhcPs = EpAnn AnnProjection
type XProjection GhcRn
Instance details Defined in GHC.Hs.Expr type XProjection GhcRn = NoExtField
type XProjection GhcTc
Instance details Defined in GHC.Hs.Expr type XProjection GhcTc = DataConCantHappen
type XRecSel GhcPs
Instance details Defined in GHC.Hs.Expr type XRecSel GhcPs = DataConCantHappen
type XRecSel GhcRn
Instance details Defined in GHC.Hs.Expr type XRecSel GhcRn = NoExtField
type XRecSel GhcTc
Instance details Defined in GHC.Hs.Expr type XRecSel GhcTc = NoExtField
type XRecTy GhcPs
Instance details Defined in GHC.Hs.Type type XRecTy GhcPs = EpAnn AnnList
type XRecTy GhcRn
Instance details Defined in GHC.Hs.Type type XRecTy GhcRn = NoExtField
type XRecTy GhcTc
Instance details Defined in GHC.Hs.Type type XRecTy GhcTc = NoExtField
type XRecordCon GhcPs
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcPs = EpAnn [AddEpAnn]
type XRecordCon GhcRn
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcRn = NoExtField
type XRecordCon GhcTc
Instance details Defined in GHC.Hs.Expr type XRecordCon GhcTc = PostTcExpr
type XRecordUpd GhcPs
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcPs = EpAnn [AddEpAnn]
type XRecordUpd GhcRn
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcRn = NoExtField
type XRecordUpd GhcTc
Instance details Defined in GHC.Hs.Expr type XRecordUpd GhcTc = DataConCantHappen
type XSectionL GhcPs
Instance details Defined in GHC.Hs.Expr type XSectionL GhcPs = EpAnnCO
type XSectionL GhcRn
Instance details Defined in GHC.Hs.Expr type XSectionL GhcRn = EpAnnCO
type XSectionL GhcTc
Instance details Defined in GHC.Hs.Expr type XSectionL GhcTc = DataConCantHappen
type XSectionR GhcPs
Instance details Defined in GHC.Hs.Expr type XSectionR GhcPs = EpAnnCO
type XSectionR GhcRn
Instance details Defined in GHC.Hs.Expr type XSectionR GhcRn = EpAnnCO
type XSectionR GhcTc
Instance details Defined in GHC.Hs.Expr type XSectionR GhcTc = DataConCantHappen
type XSigPat GhcPs
Instance details Defined in GHC.Hs.Pat type XSigPat GhcPs = EpAnn [AddEpAnn]
type XSigPat GhcRn
Instance details Defined in GHC.Hs.Pat type XSigPat GhcRn = NoExtField
type XSigPat GhcTc
Instance details Defined in GHC.Hs.Pat type XSigPat GhcTc = Type
type XSplicePat GhcPs
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcPs = NoExtField
type XSplicePat GhcRn
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcRn = HsUntypedSpliceResult (Pat GhcRn)
type XSplicePat GhcTc
Instance details Defined in GHC.Hs.Pat type XSplicePat GhcTc = DataConCantHappen
type XSpliceTy GhcPs
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcPs = NoExtField
type XSpliceTy GhcRn
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcRn = HsUntypedSpliceResult (LHsType GhcRn)
type XSpliceTy GhcTc
Instance details Defined in GHC.Hs.Type type XSpliceTy GhcTc = Kind
type XStandaloneKindSig GhcPs
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcPs = EpAnn [AddEpAnn]
type XStandaloneKindSig GhcRn
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcRn = NoExtField
type XStandaloneKindSig GhcTc
Instance details Defined in GHC.Hs.Decls type XStandaloneKindSig GhcTc = NoExtField
type XStatic GhcPs
Instance details Defined in GHC.Hs.Expr type XStatic GhcPs = EpAnn [AddEpAnn]
type XStatic GhcRn
Instance details Defined in GHC.Hs.Expr type XStatic GhcRn = NameSet
type XStatic GhcTc
Instance details Defined in GHC.Hs.Expr type XStatic GhcTc = (NameSet, Type)
type XStockStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcPs = EpAnn [AddEpAnn]
type XStockStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcRn = NoExtField
type XStockStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XStockStrategy GhcTc = NoExtField
type XSumPat GhcPs
Instance details Defined in GHC.Hs.Pat type XSumPat GhcPs = EpAnn EpAnnSumPat
type XSumPat GhcRn
Instance details Defined in GHC.Hs.Pat type XSumPat GhcRn = NoExtField
type XSumPat GhcTc
Instance details Defined in GHC.Hs.Pat type XSumPat GhcTc = [Type]
type XSynDecl GhcPs
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcPs = EpAnn [AddEpAnn]
type XSynDecl GhcRn
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcRn = NameSet
type XSynDecl GhcTc
Instance details Defined in GHC.Hs.Decls type XSynDecl GhcTc = NameSet
type XTuplePat GhcPs
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcPs = EpAnn [AddEpAnn]
type XTuplePat GhcRn
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcRn = NoExtField
type XTuplePat GhcTc
Instance details Defined in GHC.Hs.Pat type XTuplePat GhcTc = [Type]
type XTyFamInstD GhcPs
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcPs = NoExtField
type XTyFamInstD GhcRn
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcRn = NoExtField
type XTyFamInstD GhcTc
Instance details Defined in GHC.Hs.Decls type XTyFamInstD GhcTc = NoExtField
type XTypBr GhcPs
Instance details Defined in GHC.Hs.Expr type XTypBr GhcPs = NoExtField
type XTypBr GhcRn
Instance details Defined in GHC.Hs.Expr type XTypBr GhcRn = NoExtField
type XTypBr GhcTc
Instance details Defined in GHC.Hs.Expr type XTypBr GhcTc = DataConCantHappen
type XTypedBracket GhcPs
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcPs = EpAnn [AddEpAnn]
type XTypedBracket GhcRn
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcRn = NoExtField
type XTypedBracket GhcTc
Instance details Defined in GHC.Hs.Expr type XTypedBracket GhcTc = HsBracketTc
type XTypedSplice GhcPs
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcPs = (EpAnnCO, EpAnn [AddEpAnn])
type XTypedSplice GhcRn
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcRn = SplicePointName
type XTypedSplice GhcTc
Instance details Defined in GHC.Hs.Expr type XTypedSplice GhcTc = DelayedSplice
type XUnambiguous GhcPs
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcPs = NoExtField
type XUnambiguous GhcRn
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcRn = Name
type XUnambiguous GhcTc
Instance details Defined in GHC.Hs.Type type XUnambiguous GhcTc = Id
type XUnboundVar GhcPs
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcPs = EpAnn EpAnnUnboundVar
type XUnboundVar GhcRn
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcRn = NoExtField
type XUnboundVar GhcTc
Instance details Defined in GHC.Hs.Expr type XUnboundVar GhcTc = HoleExprRef
type XUntypedBracket GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcPs = EpAnn [AddEpAnn]
type XUntypedBracket GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcRn = [PendingRnSplice]
type XUntypedBracket GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedBracket GhcTc = HsBracketTc
type XUntypedSplice GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcPs = EpAnnCO
type XUntypedSplice GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcRn = HsUntypedSpliceResult (HsExpr GhcRn)
type XUntypedSplice GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedSplice GhcTc = DataConCantHappen
type XUntypedSpliceExpr GhcPs
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcPs = EpAnn [AddEpAnn]
type XUntypedSpliceExpr GhcRn
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcRn = EpAnn [AddEpAnn]
type XUntypedSpliceExpr GhcTc
Instance details Defined in GHC.Hs.Expr type XUntypedSpliceExpr GhcTc = DataConCantHappen
type XVarBr GhcPs
Instance details Defined in GHC.Hs.Expr type XVarBr GhcPs = NoExtField
type XVarBr GhcRn
Instance details Defined in GHC.Hs.Expr type XVarBr GhcRn = NoExtField
type XVarBr GhcTc
Instance details Defined in GHC.Hs.Expr type XVarBr GhcTc = DataConCantHappen
type XViaStrategy GhcPs
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcPs = XViaStrategyPs
type XViaStrategy GhcRn
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcRn = LHsSigType GhcRn
type XViaStrategy GhcTc
Instance details Defined in GHC.Hs.Decls type XViaStrategy GhcTc = Type
type XViewPat GhcPs
Instance details Defined in GHC.Hs.Pat type XViewPat GhcPs = EpAnn [AddEpAnn]
type XViewPat GhcRn
Instance details Defined in GHC.Hs.Pat type XViewPat GhcRn = Maybe (HsExpr GhcRn)
type XViewPat GhcTc
Instance details Defined in GHC.Hs.Pat type XViewPat GhcTc = Type
type XWarnings GhcPs
Instance details Defined in GHC.Hs.Decls type XWarnings GhcPs = (EpAnn [AddEpAnn], SourceText)
type XWarnings GhcRn
Instance details Defined in GHC.Hs.Decls type XWarnings GhcRn = SourceText
type XWarnings GhcTc
Instance details Defined in GHC.Hs.Decls type XWarnings GhcTc = SourceText
type XWildPat GhcPs
Instance details Defined in GHC.Hs.Pat type XWildPat GhcPs = NoExtField
type XWildPat GhcRn
Instance details Defined in GHC.Hs.Pat type XWildPat GhcRn = NoExtField
type XWildPat GhcTc
Instance details Defined in GHC.Hs.Pat type XWildPat GhcTc = Type
type XXCmd GhcPs
Instance details Defined in GHC.Hs.Expr type XXCmd GhcPs = DataConCantHappen
type XXCmd GhcRn
Instance details Defined in GHC.Hs.Expr type XXCmd GhcRn = DataConCantHappen
type XXCmd GhcTc
Instance details Defined in GHC.Hs.Expr type XXCmd GhcTc = HsWrap HsCmd
type XXExpr GhcPs
Instance details Defined in GHC.Hs.Expr type XXExpr GhcPs = DataConCantHappen
type XXExpr GhcRn
Instance details Defined in GHC.Hs.Expr type XXExpr GhcRn = HsExpansion (HsExpr GhcRn) (HsExpr GhcRn)
type XXExpr GhcTc
Instance details Defined in GHC.Hs.Expr type XXExpr GhcTc = XXExprGhcTc
type XXPat GhcPs
Instance details Defined in GHC.Hs.Pat type XXPat GhcPs = DataConCantHappen
type XXPat GhcRn
Instance details Defined in GHC.Hs.Pat type XXPat GhcRn = HsPatExpansion (Pat GhcRn) (Pat GhcRn)
type XXPat GhcTc
Instance details Defined in GHC.Hs.Pat type XXPat GhcTc = XXPatGhcTc
type XXQuote GhcPs
Instance details Defined in GHC.Hs.Expr type XXQuote GhcPs = DataConCantHappen
type XXQuote GhcRn
Instance details Defined in GHC.Hs.Expr type XXQuote GhcRn = DataConCantHappen
type XXQuote GhcTc
Instance details Defined in GHC.Hs.Expr type XXQuote GhcTc = NoExtField
type XXSig GhcPs
Instance details Defined in GHC.Hs.Binds type XXSig GhcPs = DataConCantHappen
type XXSig GhcRn
Instance details Defined in GHC.Hs.Binds type XXSig GhcRn = IdSig
type XXSig GhcTc
Instance details Defined in GHC.Hs.Binds type XXSig GhcTc = IdSig
type ConLikeP GhcPs
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcPs = RdrName
type ConLikeP GhcRn
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcRn = Name
type ConLikeP GhcTc
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcTc = ConLike
type XHsOuterExplicit GhcPs _1
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcPs _1 = EpAnnForallTy
type XHsOuterExplicit GhcRn _1
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcRn _1 = NoExtField
type XHsOuterExplicit GhcTc flag
Instance details Defined in GHC.Hs.Type type XHsOuterExplicit GhcTc flag = [VarBndr TyVar flag]
type XHsWC GhcPs b
Instance details Defined in GHC.Hs.Type type XHsWC GhcPs b = NoExtField
type XHsWC GhcRn b
Instance details Defined in GHC.Hs.Type type XHsWC GhcRn b = [Name]
type XHsWC GhcTc b
Instance details Defined in GHC.Hs.Type type XHsWC GhcTc b = [Name]
type XMG GhcPs b
Instance details Defined in GHC.Hs.Expr type XMG GhcPs b = Origin
type XMG GhcRn b
Instance details Defined in GHC.Hs.Expr type XMG GhcRn b = Origin
type XMG GhcTc b
Instance details Defined in GHC.Hs.Expr type XMG GhcTc b = MatchGroupTc
type XXHsBindsLR GhcPs pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcPs pR = DataConCantHappen
type XXHsBindsLR GhcRn pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcRn pR = DataConCantHappen
type XXHsBindsLR GhcTc pR
Instance details Defined in GHC.Hs.Binds type XXHsBindsLR GhcTc pR = AbsBinds
type XPatBind GhcPs (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcPs (GhcPass pR) = EpAnn [AddEpAnn]
type XPatBind GhcRn (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcRn (GhcPass pR) = NameSet
type XPatBind GhcTc (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatBind GhcTc (GhcPass pR) = (Type, ([CoreTickish], [[CoreTickish]]))
type Body (PatBuilder GhcPs)
Instance details Defined in GHC.Parser.PostProcess type Body (PatBuilder GhcPs) = PatBuilder
type Body (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type Body (HsCmd GhcPs) = HsCmd
type Body (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type Body (HsExpr GhcPs) = HsExpr
type FunArg (PatBuilder GhcPs)
Instance details Defined in GHC.Parser.PostProcess type FunArg (PatBuilder GhcPs) = PatBuilder GhcPs
type FunArg (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type FunArg (HsCmd GhcPs) = HsExpr GhcPs
type FunArg (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type FunArg (HsExpr GhcPs) = HsExpr GhcPs
type InfixOp (PatBuilder GhcPs)
Instance details Defined in GHC.Parser.PostProcess type InfixOp (PatBuilder GhcPs) = RdrName
type InfixOp (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type InfixOp (HsCmd GhcPs) = HsExpr GhcPs
type InfixOp (HsExpr GhcPs)
Instance details Defined in GHC.Parser.PostProcess type InfixOp (HsExpr GhcPs) = HsExpr GhcPs
type SyntaxExpr (GhcPass p)
Instance details Defined in GHC.Hs.Expr type SyntaxExpr (GhcPass p) = SyntaxExprGhc p
type Anno (LocatedA (IE (GhcPass p)))
Instance details Defined in GHC.Hs.ImpExp type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA
type Anno (FixitySig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA
type Anno (IPBind (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (IPBind (GhcPass p)) = SrcSpanAnnA
type Anno (Sig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (Sig (GhcPass p)) = SrcSpanAnnA
type Anno (AnnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA
type Anno (ClsInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (ConDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DataFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DefaultDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DerivClauseTys (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC
type Anno (DerivDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA
type Anno (DerivStrategy (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivStrategy (GhcPass p)) = SrcAnn NoEpAnns
type Anno (DocDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DocDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FamilyDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FamilyResultSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyResultSig (GhcPass p)) = SrcAnn NoEpAnns
type Anno (ForeignDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA
type Anno (FunDep (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FunDep (GhcPass p)) = SrcSpanAnnA
type Anno (HsDecl (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA
type Anno (HsDerivingClause (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (HsDerivingClause (GhcPass p)) = SrcAnn NoEpAnns
type Anno (InjectivityAnn (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InjectivityAnn (GhcPass p)) = SrcAnn NoEpAnns
type Anno (InstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RoleAnnotDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RuleBndr (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleBndr (GhcPass p)) = SrcAnn NoEpAnns
type Anno (RuleDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA
type Anno (RuleDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA
type Anno (SpliceDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA
type Anno (StandaloneKindSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA
type Anno (TyClDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA
type Anno (TyFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA
type Anno (WarnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA
type Anno (WarnDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA
type Anno (DotFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (DotFieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (FieldLabelStrings (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (FieldLabelStrings (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsCmd (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA
type Anno (HsCmdTop (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmdTop (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsExpr (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA
type Anno (HsUntypedSplice (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsUntypedSplice (GhcPass p)) = SrcSpanAnnA
type Anno (IE (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (IE (GhcPass p)) = SrcSpanAnnA
type Anno (IEWrappedName (GhcPass _1))
Instance details Defined in GHC.Hs.ImpExp type Anno (IEWrappedName (GhcPass _1)) = SrcSpanAnnA
type Anno (ImportDecl (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA
type Anno (HsOverLit (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (HsOverLit (GhcPass p)) = SrcAnn NoEpAnns
type Anno (Pat (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (Pat (GhcPass p)) = SrcSpanAnnA
type Anno (AmbiguousFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (AmbiguousFieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (BangType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (BangType (GhcPass p)) = SrcSpanAnnA
type Anno (ConDeclField (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA
type Anno (FieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (FieldOcc (GhcPass p)) = SrcAnn NoEpAnns
type Anno (HsKind (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsKind (GhcPass p)) = SrcSpanAnnA
type Anno (HsSigType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA
type Anno (HsType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsType (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.PostProcess type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno [LocatedA (IE (GhcPass p))]
Instance details Defined in GHC.Hs.ImpExp type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type IdP (GhcPass p)
Instance details Defined in GHC.Hs.Extension type IdP (GhcPass p) = IdGhcP p
type NoGhcTc (GhcPass pass)	Marks that a field uses the GhcRn variant even when the pass parameter is GhcTc. Useful for storing HsTypes in GHC.Hs.Exprs, say, because HsType GhcTc should never occur. See Note [NoGhcTc]
Instance details Defined in GHC.Hs.Extension type NoGhcTc (GhcPass pass) = GhcPass (NoGhcTcPass pass)
type XAnnD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XAnnD (GhcPass _1) = NoExtField
type XApp (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XApp (GhcPass _1) = EpAnnCO
type XAppKindTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XAppKindTy (GhcPass _1) = SrcSpan
type XAppTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XAppTy (GhcPass _1) = NoExtField
type XApplicativeArgMany (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XApplicativeArgMany (GhcPass _1) = NoExtField
type XBangTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XBangTy (GhcPass _1) = EpAnn [AddEpAnn]
type XCDerivDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCDerivDecl (GhcPass _1) = EpAnn [AddEpAnn]
type XCDotFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCDotFieldOcc (GhcPass _1) = EpAnn AnnFieldLabel
type XCExport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCExport (GhcPass _1) = Located SourceText
type XCFamilyDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCFamilyDecl (GhcPass _1) = EpAnn [AddEpAnn]
type XCFunDep (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCFunDep (GhcPass _1) = EpAnn [AddEpAnn]
type XCHsDataDefn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsDataDefn (GhcPass _1) = NoExtField
type XCHsDerivingClause (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsDerivingClause (GhcPass _1) = EpAnn [AddEpAnn]
type XCHsGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCHsGroup (GhcPass _1) = NoExtField
type XCImport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCImport (GhcPass _1) = Located SourceText
type XCInjectivityAnn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCInjectivityAnn (GhcPass _1) = EpAnn [AddEpAnn]
type XCKindSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCKindSig (GhcPass _1) = NoExtField
type XCRuleBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCRuleBndr (GhcPass _1) = EpAnn [AddEpAnn]
type XCTyClGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCTyClGroup (GhcPass _1) = NoExtField
type XCTyFamInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XCTyFamInstDecl (GhcPass _1) = EpAnn [AddEpAnn]
type XCharTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XCharTy (GhcPass _1) = SourceText
type XClassOpSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XClassOpSig (GhcPass p) = EpAnn AnnSig
type XClsInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XClsInstD (GhcPass _1) = NoExtField
type XCmdApp (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdApp (GhcPass _1) = EpAnnCO
type XCmdLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdLam (GhcPass _1) = NoExtField
type XCmdLamCase (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdLamCase (GhcPass _1) = EpAnn [AddEpAnn]
type XCmdPar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdPar (GhcPass _1) = EpAnnCO
type XCmdWrap (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XCmdWrap (GhcPass _1) = NoExtField
type XCompleteMatchSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XCompleteMatchSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)
type XConDeclField (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XConDeclField (GhcPass _1) = EpAnn [AddEpAnn]
type XConDeclGADT (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XConDeclGADT (GhcPass _1) = EpAnn [AddEpAnn]
type XConDeclH98 (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XConDeclH98 (GhcPass _1) = EpAnn [AddEpAnn]
type XDataFamInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDataFamInstD (GhcPass _1) = NoExtField
type XDctMulti (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDctMulti (GhcPass _1) = NoExtField
type XDctSingle (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDctSingle (GhcPass _1) = NoExtField
type XDefD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDefD (GhcPass _1) = NoExtField
type XDerivD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDerivD (GhcPass _1) = NoExtField
type XDocD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XDocD (GhcPass _1) = NoExtField
type XDocTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XDocTy (GhcPass _1) = EpAnn [AddEpAnn]
type XFamDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XFamDecl (GhcPass _1) = NoExtField
type XFixSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XFixSig (GhcPass p) = EpAnn [AddEpAnn]
type XFixitySig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XFixitySig (GhcPass p) = NoExtField
type XForAllTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XForAllTy (GhcPass _1) = NoExtField
type XForD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XForD (GhcPass _1) = NoExtField
type XFunTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XFunTy (GhcPass _1) = EpAnnCO
type XHsAnnotation (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XHsAnnotation (GhcPass _1) = (EpAnn AnnPragma, SourceText)
type XHsChar (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsChar (GhcPass _1) = SourceText
type XHsCharPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsCharPrim (GhcPass _1) = SourceText
type XHsDoublePrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsDoublePrim (GhcPass _1) = NoExtField
type XHsFloatPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsFloatPrim (GhcPass _1) = NoExtField
type XHsForAllInvis (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsForAllInvis (GhcPass _1) = EpAnnForallTy
type XHsForAllVis (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsForAllVis (GhcPass _1) = EpAnnForallTy
type XHsInt (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInt (GhcPass _1) = NoExtField
type XHsInt64Prim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInt64Prim (GhcPass _1) = SourceText
type XHsIntPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsIntPrim (GhcPass _1) = SourceText
type XHsInteger (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsInteger (GhcPass _1) = SourceText
type XHsRat (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsRat (GhcPass _1) = NoExtField
type XHsSig (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XHsSig (GhcPass _1) = NoExtField
type XHsString (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsString (GhcPass _1) = SourceText
type XHsStringPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsStringPrim (GhcPass _1) = SourceText
type XHsWord64Prim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsWord64Prim (GhcPass _1) = SourceText
type XHsWordPrim (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XHsWordPrim (GhcPass _1) = SourceText
type XIEDoc (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEDoc (GhcPass _1) = NoExtField
type XIEDocNamed (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEDocNamed (GhcPass _1) = NoExtField
type XIEGroup (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEGroup (GhcPass _1) = NoExtField
type XIEName (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEName (GhcPass _1) = NoExtField
type XIEPattern (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEPattern (GhcPass _1) = EpaLocation
type XIEThingAbs (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEThingAbs (GhcPass _1) = EpAnn [AddEpAnn]
type XIEThingAll (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEThingAll (GhcPass _1) = EpAnn [AddEpAnn]
type XIEThingWith (GhcPass 'Parsed)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Parsed) = EpAnn [AddEpAnn]
type XIEThingWith (GhcPass 'Renamed)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Renamed) = [Located FieldLabel]
type XIEThingWith (GhcPass 'Typechecked)
Instance details Defined in GHC.Hs.ImpExp type XIEThingWith (GhcPass 'Typechecked) = NoExtField
type XIEType (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XIEType (GhcPass _1) = EpaLocation
type XIParamTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XIParamTy (GhcPass _1) = EpAnn [AddEpAnn]
type XInlineSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XInlineSig (GhcPass p) = EpAnn [AddEpAnn]
type XInstD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XInstD (GhcPass _1) = NoExtField
type XKindSig (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XKindSig (GhcPass _1) = EpAnn [AddEpAnn]
type XKindSigD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XKindSigD (GhcPass _1) = NoExtField
type XKindedTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XKindedTyVar (GhcPass _1) = EpAnn [AddEpAnn]
type XLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLam (GhcPass _1) = NoExtField
type XLam (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLam (GhcPass _1) = NoExtField
type XLamCase (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLamCase (GhcPass _1) = EpAnn [AddEpAnn]
type XListTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XListTy (GhcPass _1) = EpAnn AnnParen
type XLitE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XLitE (GhcPass _1) = EpAnnCO
type XLitPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XLitPat (GhcPass _1) = NoExtField
type XMinimalSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XMinimalSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)
type XNoSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XNoSig (GhcPass _1) = NoExtField
type XNumTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XNumTy (GhcPass _1) = SourceText
type XOpTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XOpTy (GhcPass _1) = EpAnn [AddEpAnn]
type XOverLitE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XOverLitE (GhcPass _1) = EpAnnCO
type XPar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPar (GhcPass _1) = EpAnnCO
type XParPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XParPat (GhcPass _1) = EpAnnCO
type XParTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XParTy (GhcPass _1) = EpAnn AnnParen
type XPatSynSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XPatSynSig (GhcPass p) = EpAnn AnnSig
type XPragE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPragE (GhcPass _1) = NoExtField
type XPresent (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XPresent (GhcPass _1) = EpAnn [AddEpAnn]
type XProc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XProc (GhcPass _1) = EpAnn [AddEpAnn]
type XQualTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XQualTy (GhcPass _1) = NoExtField
type XRoleAnnotD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRoleAnnotD (GhcPass _1) = NoExtField
type XRuleBndrSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRuleBndrSig (GhcPass _1) = EpAnn [AddEpAnn]
type XRuleD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XRuleD (GhcPass _1) = NoExtField
type XSCC (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XSCC (GhcPass _1) = (EpAnn AnnPragma, SourceText)
type XSCCFunSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSCCFunSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)
type XSigD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSigD (GhcPass _1) = NoExtField
type XSpecInstSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSpecInstSig (GhcPass p) = (EpAnn [AddEpAnn], SourceText)
type XSpecSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XSpecSig (GhcPass p) = EpAnn [AddEpAnn]
type XSpliceD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSpliceD (GhcPass _1) = NoExtField
type XSpliceDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XSpliceDecl (GhcPass _1) = NoExtField
type XStarTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XStarTy (GhcPass _1) = NoExtField
type XStrTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XStrTy (GhcPass _1) = SourceText
type XSumTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XSumTy (GhcPass _1) = EpAnn AnnParen
type XTupleTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTupleTy (GhcPass _1) = EpAnn AnnParen
type XTyClD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XTyClD (GhcPass _1) = NoExtField
type XTyLit (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTyLit (GhcPass _1) = NoExtField
type XTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XTyVar (GhcPass _1) = EpAnn [AddEpAnn]
type XTyVarSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XTyVarSig (GhcPass _1) = NoExtField
type XTypeSig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XTypeSig (GhcPass p) = EpAnn AnnSig
type XUserTyVar (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XUserTyVar (GhcPass _1) = EpAnn [AddEpAnn]
type XValD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XValD (GhcPass _1) = NoExtField
type XVar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XVar (GhcPass _1) = NoExtField
type XVar (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XVar (GhcPass _1) = NoExtField
type XVarPat (GhcPass _1)
Instance details Defined in GHC.Hs.Pat type XVarPat (GhcPass _1) = NoExtField
type XWarning (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XWarning (GhcPass _1) = EpAnn [AddEpAnn]
type XWarningD (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XWarningD (GhcPass _1) = NoExtField
type XWildCardTy (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XWildCardTy (GhcPass _1) = NoExtField
type XXAmbiguousFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXAmbiguousFieldOcc (GhcPass _1) = DataConCantHappen
type XXAnnDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXAnnDecl (GhcPass _1) = DataConCantHappen
type XXApplicativeArg (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXApplicativeArg (GhcPass _1) = DataConCantHappen
type XXClsInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXClsInstDecl (GhcPass _1) = DataConCantHappen
type XXCmdTop (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXCmdTop (GhcPass _1) = DataConCantHappen
type XXConDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXConDecl (GhcPass _1) = DataConCantHappen
type XXConDeclField (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXConDeclField (GhcPass _1) = DataConCantHappen
type XXDefaultDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDefaultDecl (GhcPass _1) = DataConCantHappen
type XXDerivClauseTys (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDerivClauseTys (GhcPass _1) = DataConCantHappen
type XXDerivDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXDerivDecl (GhcPass _1) = DataConCantHappen
type XXDotFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXDotFieldOcc (GhcPass _1) = DataConCantHappen
type XXFamilyDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFamilyDecl (GhcPass _1) = DataConCantHappen
type XXFamilyResultSig (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFamilyResultSig (GhcPass _1) = DataConCantHappen
type XXFieldOcc (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXFieldOcc (GhcPass _1) = DataConCantHappen
type XXFixitySig (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXFixitySig (GhcPass p) = DataConCantHappen
type XXForeignDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignDecl (GhcPass _1) = DataConCantHappen
type XXForeignExport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignExport (GhcPass _1) = DataConCantHappen
type XXForeignImport (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXForeignImport (GhcPass _1) = DataConCantHappen
type XXFunDep (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXFunDep (GhcPass _1) = DataConCantHappen
type XXHsDataDefn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDataDefn (GhcPass _1) = DataConCantHappen
type XXHsDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDecl (GhcPass _1) = DataConCantHappen
type XXHsDerivingClause (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsDerivingClause (GhcPass _1) = DataConCantHappen
type XXHsForAllTelescope (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsForAllTelescope (GhcPass _1) = DataConCantHappen
type XXHsGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXHsGroup (GhcPass _1) = DataConCantHappen
type XXHsIPBinds (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXHsIPBinds (GhcPass p) = DataConCantHappen
type XXHsOuterTyVarBndrs (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsOuterTyVarBndrs (GhcPass _1) = DataConCantHappen
type XXHsPatSigType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsPatSigType (GhcPass _1) = DataConCantHappen
type XXHsSigType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXHsSigType (GhcPass _1) = DataConCantHappen
type XXIE (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXIE (GhcPass _1) = DataConCantHappen
type XXIEWrappedName (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXIEWrappedName (GhcPass _1) = DataConCantHappen
type XXIPBind (GhcPass p)
Instance details Defined in GHC.Hs.Binds type XXIPBind (GhcPass p) = DataConCantHappen
type XXImportDecl (GhcPass _1)
Instance details Defined in GHC.Hs.ImpExp type XXImportDecl (GhcPass _1) = DataConCantHappen
type XXInjectivityAnn (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXInjectivityAnn (GhcPass _1) = DataConCantHappen
type XXInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXInstDecl (GhcPass _1) = DataConCantHappen
type XXLHsQTyVars (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXLHsQTyVars (GhcPass _1) = DataConCantHappen
type XXLit (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XXLit (GhcPass _1) = DataConCantHappen
type XXOverLit (GhcPass _1)
Instance details Defined in GHC.Hs.Lit type XXOverLit (GhcPass _1) = DataConCantHappen
type XXPragE (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXPragE (GhcPass _1) = DataConCantHappen
type XXRoleAnnotDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRoleAnnotDecl (GhcPass _1) = DataConCantHappen
type XXRuleBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleBndr (GhcPass _1) = DataConCantHappen
type XXRuleDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleDecl (GhcPass _1) = DataConCantHappen
type XXRuleDecls (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXRuleDecls (GhcPass _1) = DataConCantHappen
type XXSpliceDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXSpliceDecl (GhcPass _1) = DataConCantHappen
type XXStandaloneKindSig (GhcPass p)
Instance details Defined in GHC.Hs.Decls type XXStandaloneKindSig (GhcPass p) = DataConCantHappen
type XXTupArg (GhcPass _1)
Instance details Defined in GHC.Hs.Expr type XXTupArg (GhcPass _1) = DataConCantHappen
type XXTyClDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyClDecl (GhcPass _1) = DataConCantHappen
type XXTyClGroup (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyClGroup (GhcPass _1) = DataConCantHappen
type XXTyFamInstDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXTyFamInstDecl (GhcPass _1) = DataConCantHappen
type XXTyLit (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXTyLit (GhcPass _1) = DataConCantHappen
type XXTyVarBndr (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXTyVarBndr (GhcPass _1) = DataConCantHappen
type XXType (GhcPass _1)
Instance details Defined in GHC.Hs.Type type XXType (GhcPass _1) = HsCoreTy
type XXWarnDecl (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXWarnDecl (GhcPass _1) = DataConCantHappen
type XXWarnDecls (GhcPass _1)
Instance details Defined in GHC.Hs.Decls type XXWarnDecls (GhcPass _1) = DataConCantHappen
type XCFamEqn (GhcPass _1) r
Instance details Defined in GHC.Hs.Decls type XCFamEqn (GhcPass _1) r = EpAnn [AddEpAnn]
type XCGRHS (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XCGRHS (GhcPass _1) _2 = EpAnn GrhsAnn
type XCGRHSs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XCGRHSs (GhcPass _1) _2 = EpAnnComments
type XCMatch (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XCMatch (GhcPass _1) b = EpAnn [AddEpAnn]
type XFunBind (GhcPass pL) GhcPs
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcPs = NoExtField
type XFunBind (GhcPass pL) GhcRn	After the renamer (but before the type-checker), the FunBind extension field contains the locally-bound free variables of this defn. See Note [Bind free vars]
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcRn = NameSet
type XFunBind (GhcPass pL) GhcTc	After the type-checker, the FunBind extension field contains the ticks to put on the rhs, if any, and a coercion from the type of the MatchGroup to the type of the Id. Example: f :: Int -> forall a. a -> a f x y = y Then the MatchGroup will have type (Int -> a' -> a') (with a free type variable a'). The coercion will take a CoreExpr of this type and convert it to a CoreExpr of type Int -> forall a'. a' -> a' Notice that the coercion captures the free a'.
Instance details Defined in GHC.Hs.Binds type XFunBind (GhcPass pL) GhcTc = (HsWrapper, [CoreTickish])
type XPSB (GhcPass idL) GhcPs
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcPs = EpAnn [AddEpAnn]
type XPSB (GhcPass idL) GhcRn
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcRn = NameSet
type XPSB (GhcPass idL) GhcTc
Instance details Defined in GHC.Hs.Binds type XPSB (GhcPass idL) GhcTc = NameSet
type XRec (GhcPass p) a
Instance details Defined in GHC.Hs.Extension type XRec (GhcPass p) a = GenLocated (Anno a) a
type XXFamEqn (GhcPass _1) r
Instance details Defined in GHC.Hs.Decls type XXFamEqn (GhcPass _1) r = DataConCantHappen
type XXGRHS (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXGRHS (GhcPass _1) b = DataConCantHappen
type XXGRHSs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Expr type XXGRHSs (GhcPass _1) _2 = DataConCantHappen
type XXHsWildCardBndrs (GhcPass _1) _2
Instance details Defined in GHC.Hs.Type type XXHsWildCardBndrs (GhcPass _1) _2 = DataConCantHappen
type XXMatch (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXMatch (GhcPass _1) b = DataConCantHappen
type XXMatchGroup (GhcPass _1) b
Instance details Defined in GHC.Hs.Expr type XXMatchGroup (GhcPass _1) b = DataConCantHappen
type XXValBindsLR (GhcPass pL) pR
Instance details Defined in GHC.Hs.Binds type XXValBindsLR (GhcPass pL) pR = NHsValBindsLR (GhcPass pL)
type XApplicativeStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcPs b = NoExtField
type XApplicativeStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcRn b = NoExtField
type XApplicativeStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XApplicativeStmt (GhcPass _1) GhcTc b = Type
type XBindStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]
type XBindStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcRn b = XBindStmtRn
type XBindStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XBindStmt (GhcPass _1) GhcTc b = XBindStmtTc
type XBodyStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcPs b = NoExtField
type XBodyStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcRn b = NoExtField
type XBodyStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XBodyStmt (GhcPass _1) GhcTc b = Type
type XParStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcPs b = NoExtField
type XParStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcRn b = NoExtField
type XParStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XParStmt (GhcPass _1) GhcTc b = Type
type XRecStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcPs b = EpAnn AnnList
type XRecStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcRn b = NoExtField
type XRecStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XRecStmt (GhcPass _1) GhcTc b = RecStmtTc
type XTransStmt (GhcPass _1) GhcPs b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]
type XTransStmt (GhcPass _1) GhcRn b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcRn b = NoExtField
type XTransStmt (GhcPass _1) GhcTc b
Instance details Defined in GHC.Hs.Expr type XTransStmt (GhcPass _1) GhcTc b = Type
type XEmptyLocalBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XEmptyLocalBinds (GhcPass pL) (GhcPass pR) = NoExtField
type XHsIPBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XHsIPBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList
type XHsValBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XHsValBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList
type XParStmtBlock (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Expr type XParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtField
type XPatSynBind (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XPatSynBind (GhcPass pL) (GhcPass pR) = NoExtField
type XValBinds (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XValBinds (GhcPass pL) (GhcPass pR) = AnnSortKey
type XVarBind (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XVarBind (GhcPass pL) (GhcPass pR) = NoExtField
type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Binds type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR) = DataConCantHappen
type XXParStmtBlock (GhcPass pL) (GhcPass pR)
Instance details Defined in GHC.Hs.Expr type XXParStmtBlock (GhcPass pL) (GhcPass pR) = DataConCantHappen
type XXPatSynBind (GhcPass idL) (GhcPass idR)
Instance details Defined in GHC.Hs.Binds type XXPatSynBind (GhcPass idL) (GhcPass idR) = DataConCantHappen
type XLastStmt (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XLastStmt (GhcPass _1) (GhcPass _2) b = NoExtField
type XLetStmt (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XLetStmt (GhcPass _1) (GhcPass _2) b = EpAnn [AddEpAnn]
type XXStmtLR (GhcPass _1) (GhcPass _2) b
Instance details Defined in GHC.Hs.Expr type XXStmtLR (GhcPass _1) (GhcPass _2) b = DataConCantHappen
type Anno (HsBindLR (GhcPass idL) (GhcPass idR))
Instance details Defined in GHC.Hs.Binds type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA
type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA
type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))
Instance details Defined in GHC.Hs.Type type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag (GhcPass _1))
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcPs)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcRn)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcTc)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type IsSrcSpanAnn (p :: Pass) a = (Anno (IdGhcP p) ~ SrcSpanAnn' (EpAnn a), IsPass p) #

data ExtractedTHDocs #

Maps of docs that were added via Template Haskell's putDoc.

Constructors

ExtractedTHDocs
Fields ethd_mod_header :: Maybe (HsDoc GhcRn) The added module header documentation, if it exists. ethd_decl_docs :: UniqMap Name (HsDoc GhcRn) The documentation added to declarations. ethd_arg_docs :: UniqMap Name (IntMap (HsDoc GhcRn)) The documentation added to function arguments. ethd_inst_docs :: UniqMap Name (HsDoc GhcRn) The documentation added to class and family instances.

data Docs #

Constructors

Docs

Fields

docs_mod_hdr :: Maybe (HsDoc GhcRn)
Module header.
docs_decls :: UniqMap Name [HsDoc GhcRn]
Docs for declarations: functions, data types, instances, methods etc. A list because sometimes subsequent haddock comments can be combined into one
docs_args :: UniqMap Name (IntMap (HsDoc GhcRn))
Docs for arguments. E.g. function arguments, method arguments.
docs_structure :: DocStructure
docs_named_chunks :: Map String (HsDoc GhcRn)
Map from chunk name to content.
This map will be empty unless we have an explicit export list from which we can reference the chunks.
docs_haddock_opts :: Maybe String
Haddock options from OPTIONS_HADDOCK or from -haddock-opts.
docs_language :: Maybe Language
The Language used in the module, for example Haskell2010.
docs_extensions :: EnumSet Extension
The full set of language extensions used in the module.

Instances

Instances details

NFData Docs
Instance details Defined in GHC.Hs.Doc Methods rnf :: Docs -> () #
Binary Docs
Instance details Defined in GHC.Hs.Doc Methods put_ :: BinHandle -> Docs -> IO () # put :: BinHandle -> Docs -> IO (Bin Docs) # get :: BinHandle -> IO Docs #
Outputable Docs
Instance details Defined in GHC.Hs.Doc Methods ppr :: Docs -> SDoc #

type DocStructure = [DocStructureItem] #

data DocStructureItem #

A simplified version of IE.

Constructors

DsiSectionHeading !Int !(HsDoc GhcRn)
DsiDocChunk !(HsDoc GhcRn)
DsiNamedChunkRef !String
DsiExports !Avails
DsiModExport
Fields !(NonEmpty ModuleName) We might re-export avails from multiple modules with a single export declaration. E.g. when we have module M (module X) where import R0 as X import R1 as X !Avails

Instances

Instances details

NFData DocStructureItem
Instance details Defined in GHC.Hs.Doc Methods rnf :: DocStructureItem -> () #
Binary DocStructureItem
Instance details Defined in GHC.Hs.Doc Methods put_ :: BinHandle -> DocStructureItem -> IO () # put :: BinHandle -> DocStructureItem -> IO (Bin DocStructureItem) # get :: BinHandle -> IO DocStructureItem #
Outputable DocStructureItem
Instance details Defined in GHC.Hs.Doc Methods ppr :: DocStructureItem -> SDoc #

type LHsDoc pass = Located (HsDoc pass) #

data WithHsDocIdentifiers a pass #

Annotate a value with the probable identifiers found in it These will be used by haddock to generate links.

The identifiers are bundled along with their location in the source file. This is useful for tooling to know exactly where they originate.

This type is currently used in two places - for regular documentation comments, with a set to HsDocString, and for adding identifier information to warnings, where a is StringLiteral

Constructors

WithHsDocIdentifiers
Fields hsDocString :: !a hsDocIdentifiers :: ![Located (IdP pass)]

Instances

Instances details

ToHie (LHsDoc GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LHsDoc GhcRn -> HieM [HieAST Type]
(Data pass, Data (IdP pass), Data a) => Data (WithHsDocIdentifiers a pass)
Instance details Defined in GHC.Hs.Doc Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WithHsDocIdentifiers a pass -> c (WithHsDocIdentifiers a pass) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WithHsDocIdentifiers a pass) # toConstr :: WithHsDocIdentifiers a pass -> Constr # dataTypeOf :: WithHsDocIdentifiers a pass -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WithHsDocIdentifiers a pass)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WithHsDocIdentifiers a pass)) # gmapT :: (forall b. Data b => b -> b) -> WithHsDocIdentifiers a pass -> WithHsDocIdentifiers a pass # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WithHsDocIdentifiers a pass -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WithHsDocIdentifiers a pass -> r # gmapQ :: (forall d. Data d => d -> u) -> WithHsDocIdentifiers a pass -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> WithHsDocIdentifiers a pass -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> WithHsDocIdentifiers a pass -> m (WithHsDocIdentifiers a pass) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> WithHsDocIdentifiers a pass -> m (WithHsDocIdentifiers a pass) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> WithHsDocIdentifiers a pass -> m (WithHsDocIdentifiers a pass) #
(NFData (IdP pass), NFData a) => NFData (WithHsDocIdentifiers a pass)
Instance details Defined in GHC.Hs.Doc Methods rnf :: WithHsDocIdentifiers a pass -> () #
Binary a => Binary (WithHsDocIdentifiers a GhcRn)
Instance details Defined in GHC.Hs.Doc Methods put_ :: BinHandle -> WithHsDocIdentifiers a GhcRn -> IO () # put :: BinHandle -> WithHsDocIdentifiers a GhcRn -> IO (Bin (WithHsDocIdentifiers a GhcRn)) # get :: BinHandle -> IO (WithHsDocIdentifiers a GhcRn) #
Outputable a => Outputable (WithHsDocIdentifiers a pass)	For compatibility with the existing @-ddump-parsed' output, we only show the docstring. Use `pprHsDoc` to show `HsDoc`'s internals.
Instance details Defined in GHC.Hs.Doc Methods ppr :: WithHsDocIdentifiers a pass -> SDoc #
(Eq (IdP pass), Eq a) => Eq (WithHsDocIdentifiers a pass)
Instance details Defined in GHC.Hs.Doc Methods (==) :: WithHsDocIdentifiers a pass -> WithHsDocIdentifiers a pass -> Bool # (/=) :: WithHsDocIdentifiers a pass -> WithHsDocIdentifiers a pass -> Bool #

type HsDoc = WithHsDocIdentifiers HsDocString #

A docstring with the (probable) identifiers found in it.

type LIEWrappedName p = XRec p (IEWrappedName p) #

Located name with possible adornment - AnnKeywordIds : AnnType, AnnPattern

data IEWrappedName p #

A name in an import or export specification which may have adornments. Used primarily for accurate pretty printing of ParsedSource, and API Annotation placement. The Annotation is the location of the adornment in the original source.

Constructors

IEName (XIEName p) (LIdP p)	no extra
IEPattern (XIEPattern p) (LIdP p)	pattern X
IEType (XIEType p) (LIdP p)	type (:+:)
XIEWrappedName !(XXIEWrappedName p)

Instances

Instances details

ToHie (IEContext (LocatedA (IEWrappedName GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: IEContext (LocatedA (IEWrappedName GhcRn)) -> HieM [HieAST Type]
type Anno (IEWrappedName (GhcPass _1))
Instance details Defined in GHC.Hs.ImpExp type Anno (IEWrappedName (GhcPass _1)) = SrcSpanAnnA

data IEWildcard #

Wildcard in an import or export sublist, like the .. in import Mod ( T(Mk1, Mk2, ..) ).

Constructors

NoIEWildcard	no wildcard in this list
IEWildcard Int	wildcard after the given # of items in this list The `Int` is in the range [0..n], where n is the length of the list.

Instances

Instances details

Data IEWildcard
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IEWildcard -> c IEWildcard # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IEWildcard # toConstr :: IEWildcard -> Constr # dataTypeOf :: IEWildcard -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IEWildcard) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IEWildcard) # gmapT :: (forall b. Data b => b -> b) -> IEWildcard -> IEWildcard # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IEWildcard -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IEWildcard -> r # gmapQ :: (forall d. Data d => d -> u) -> IEWildcard -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IEWildcard -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IEWildcard -> m IEWildcard # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IEWildcard -> m IEWildcard # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IEWildcard -> m IEWildcard #
Eq IEWildcard
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods (==) :: IEWildcard -> IEWildcard -> Bool # (/=) :: IEWildcard -> IEWildcard -> Bool #

type LIE pass #

Arguments

= XRec pass (IE pass)

When in a list this may have

AnnKeywordId : AnnComma

Located Import or Export

data ImportListInterpretation #

Whether the import list is exactly what to import, or whether hiding was used, and therefore everything but what was listed should be imported

Constructors

Exactly
EverythingBut

Instances

Instances details

Data ImportListInterpretation
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportListInterpretation -> c ImportListInterpretation # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportListInterpretation # toConstr :: ImportListInterpretation -> Constr # dataTypeOf :: ImportListInterpretation -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportListInterpretation) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportListInterpretation) # gmapT :: (forall b. Data b => b -> b) -> ImportListInterpretation -> ImportListInterpretation # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportListInterpretation -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportListInterpretation -> r # gmapQ :: (forall d. Data d => d -> u) -> ImportListInterpretation -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportListInterpretation -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportListInterpretation -> m ImportListInterpretation # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportListInterpretation -> m ImportListInterpretation # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportListInterpretation -> m ImportListInterpretation #
Eq ImportListInterpretation
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods (==) :: ImportListInterpretation -> ImportListInterpretation -> Bool # (/=) :: ImportListInterpretation -> ImportListInterpretation -> Bool #

data ImportDecl pass #

Import Declaration

A single Haskell import declaration.

Constructors

ImportDecl

Fields

ideclExt :: XCImportDecl pass
ideclName :: XRec pass ModuleName
Module name.
ideclPkgQual :: ImportDeclPkgQual pass
Package qualifier.
ideclSource :: IsBootInterface
IsBoot = {-# SOURCE #-} import
ideclSafe :: Bool
True => safe import
ideclQualified :: ImportDeclQualifiedStyle
If/how the import is qualified.
ideclAs :: Maybe (XRec pass ModuleName)
as Module
ideclImportList :: Maybe (ImportListInterpretation, XRec pass [LIE pass])
Explicit import list (EverythingBut => hiding, names)

XImportDecl !(XXImportDecl pass)

AnnKeywordIds

AnnImport
AnnOpen, AnnClose for ideclSource
AnnSafe,AnnQualified, AnnPackageName,AnnAs, AnnVal
AnnHiding,AnnOpen, AnnClose attached to location in ideclImportList

Instances

Instances details

NFData (ImportDecl GhcPs) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ImportDecl GhcPs -> () #
ToHie (LocatedA (ImportDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]
type Anno (ImportDecl (GhcPass p))
Instance details Defined in GHC.Hs.ImpExp type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA

data ImportDeclQualifiedStyle #

If/how an import is qualified.

Constructors

QualifiedPre	`qualified` appears in prepositive position.
QualifiedPost	`qualified` appears in postpositive position.
NotQualified	Not qualified.

Instances

Instances details

Data ImportDeclQualifiedStyle
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportDeclQualifiedStyle -> c ImportDeclQualifiedStyle # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportDeclQualifiedStyle # toConstr :: ImportDeclQualifiedStyle -> Constr # dataTypeOf :: ImportDeclQualifiedStyle -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportDeclQualifiedStyle) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportDeclQualifiedStyle) # gmapT :: (forall b. Data b => b -> b) -> ImportDeclQualifiedStyle -> ImportDeclQualifiedStyle # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportDeclQualifiedStyle -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportDeclQualifiedStyle -> r # gmapQ :: (forall d. Data d => d -> u) -> ImportDeclQualifiedStyle -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportDeclQualifiedStyle -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportDeclQualifiedStyle -> m ImportDeclQualifiedStyle # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDeclQualifiedStyle -> m ImportDeclQualifiedStyle # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportDeclQualifiedStyle -> m ImportDeclQualifiedStyle #
Eq ImportDeclQualifiedStyle
Instance details Defined in Language.Haskell.Syntax.ImpExp Methods (==) :: ImportDeclQualifiedStyle -> ImportDeclQualifiedStyle -> Bool # (/=) :: ImportDeclQualifiedStyle -> ImportDeclQualifiedStyle -> Bool #

type LImportDecl pass #

Arguments

= XRec pass (ImportDecl pass)

When in a list this may have

AnnKeywordId : AnnSemi

Located Import Declaration

data EpAnnImportDecl #

Constructors

EpAnnImportDecl
Fields importDeclAnnImport :: EpaLocation importDeclAnnPragma :: Maybe (EpaLocation, EpaLocation) importDeclAnnSafe :: Maybe EpaLocation importDeclAnnQualified :: Maybe EpaLocation importDeclAnnPackage :: Maybe EpaLocation importDeclAnnAs :: Maybe EpaLocation

Instances

Instances details

Data EpAnnImportDecl

Instance details

Defined in GHC.Hs.ImpExp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnnImportDecl -> c EpAnnImportDecl #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpAnnImportDecl #

toConstr :: EpAnnImportDecl -> Constr #

dataTypeOf :: EpAnnImportDecl -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> EpAnnImportDecl -> EpAnnImportDecl #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnImportDecl -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnImportDecl -> r #

gmapQ :: (forall d. Data d => d -> u) -> EpAnnImportDecl -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnnImportDecl -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnnImportDecl -> m EpAnnImportDecl #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnImportDecl -> m EpAnnImportDecl #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnImportDecl -> m EpAnnImportDecl #

data XImportDeclPass #

Constructors

XImportDeclPass
Fields ideclAnn :: EpAnn EpAnnImportDecl ideclSourceText :: SourceText ideclImplicit :: Bool GHC generates an `ImportDecl` to represent the invisible `import Prelude` that appears in any file that omits `import Prelude`, setting this field to indicate that the import doesn't appear in the original source. True => implicit import (of Prelude)

Instances

Instances details

Data XImportDeclPass

Instance details

Defined in GHC.Hs.ImpExp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XImportDeclPass -> c XImportDeclPass #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c XImportDeclPass #

toConstr :: XImportDeclPass -> Constr #

dataTypeOf :: XImportDeclPass -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> XImportDeclPass -> XImportDeclPass #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XImportDeclPass -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XImportDeclPass -> r #

gmapQ :: (forall d. Data d => d -> u) -> XImportDeclPass -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> XImportDeclPass -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> XImportDeclPass -> m XImportDeclPass #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XImportDeclPass -> m XImportDeclPass #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XImportDeclPass -> m XImportDeclPass #

data Way #

A way

Don't change the constructor order as it is used by waysTag to create a unique tag (e.g. thr_debug_p) which is expected by other tools (e.g. Cabal).

Instances

Instances details

Read Way
Instance details Defined in GHC.Platform.Ways Methods readsPrec :: Int -> ReadS Way # readList :: ReadS [Way] # readPrec :: ReadPrec Way # readListPrec :: ReadPrec [Way] #
Show Way
Instance details Defined in GHC.Platform.Ways Methods showsPrec :: Int -> Way -> ShowS # show :: Way -> String # showList :: [Way] -> ShowS #
Eq Way
Instance details Defined in GHC.Platform.Ways Methods (==) :: Way -> Way -> Bool # (/=) :: Way -> Way -> Bool #
Ord Way
Instance details Defined in GHC.Platform.Ways Methods compare :: Way -> Way -> Ordering # (<) :: Way -> Way -> Bool # (<=) :: Way -> Way -> Bool # (>) :: Way -> Way -> Bool # (>=) :: Way -> Way -> Bool # max :: Way -> Way -> Way # min :: Way -> Way -> Way #

newtype PackageName #

Constructors

PackageName
Fields unPackageName :: FastString

Instances

Instances details

Show PackageName Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> PackageName -> ShowS # show :: PackageName -> String # showList :: [PackageName] -> ShowS #
Uniquable PackageName
Instance details Defined in GHC.Unit.Info Methods getUnique :: PackageName -> Unique #
Outputable PackageName
Instance details Defined in GHC.Unit.Info Methods ppr :: PackageName -> SDoc #
Eq PackageName
Instance details Defined in GHC.Unit.Info Methods (==) :: PackageName -> PackageName -> Bool # (/=) :: PackageName -> PackageName -> Bool #

data StopPhase #

Constructors

StopPreprocess	-E
StopC	-C
StopAs	-S
NoStop	-c

data LiftingContext #

Constructors

LC Subst LiftCoEnv

Instances

Instances details

Outputable LiftingContext
Instance details Defined in GHC.Core.Coercion Methods ppr :: LiftingContext -> SDoc #

type ClassMinimalDef = BooleanFormula Name #

data ATValidityInfo #

Information about an associated type family default implementation. This is used solely for validity checking. See Note [Type-checking default assoc decls] in GHC.Tc.TyCl.

Constructors

NoATVI
ATVI SrcSpan [Type]

data ClassATItem #

Constructors

ATI TyCon (Maybe (Type, ATValidityInfo))

type DefMethInfo = Maybe (Name, DefMethSpec Type) #

type ClassOpItem = (Id, DefMethInfo) #

data TyConFlavour #

Paints a picture of what a TyCon represents, in broad strokes. This is used towards more informative error messages.

Constructors

ClassFlavour
TupleFlavour Boxity
SumFlavour
DataTypeFlavour
NewtypeFlavour
AbstractTypeFlavour
DataFamilyFlavour (Maybe TyCon)
OpenTypeFamilyFlavour (Maybe TyCon)
ClosedTypeFamilyFlavour
TypeSynonymFlavour
BuiltInTypeFlavour	e.g., the `(->)` `TyCon`.
PromotedDataConFlavour

Instances

Instances details

Outputable TyConFlavour
Instance details Defined in GHC.Core.TyCon Methods ppr :: TyConFlavour -> SDoc #
Eq TyConFlavour
Instance details Defined in GHC.Core.TyCon Methods (==) :: TyConFlavour -> TyConFlavour -> Bool # (/=) :: TyConFlavour -> TyConFlavour -> Bool #

data ExpandSynResult tyco #

Constructors

NoExpansion
ExpandsSyn [(TyVar, tyco)] Type [tyco]

data PrimElemRep #

Constructors

Int8ElemRep
Int16ElemRep
Int32ElemRep
Int64ElemRep
Word8ElemRep
Word16ElemRep
Word32ElemRep
Word64ElemRep
FloatElemRep
DoubleElemRep

Instances

Instances details

Data PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PrimElemRep -> c PrimElemRep # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PrimElemRep # toConstr :: PrimElemRep -> Constr # dataTypeOf :: PrimElemRep -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PrimElemRep) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PrimElemRep) # gmapT :: (forall b. Data b => b -> b) -> PrimElemRep -> PrimElemRep # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PrimElemRep -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PrimElemRep -> r # gmapQ :: (forall d. Data d => d -> u) -> PrimElemRep -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PrimElemRep -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PrimElemRep -> m PrimElemRep # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimElemRep -> m PrimElemRep # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimElemRep -> m PrimElemRep #
Enum PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods succ :: PrimElemRep -> PrimElemRep # pred :: PrimElemRep -> PrimElemRep # toEnum :: Int -> PrimElemRep # fromEnum :: PrimElemRep -> Int # enumFrom :: PrimElemRep -> [PrimElemRep] # enumFromThen :: PrimElemRep -> PrimElemRep -> [PrimElemRep] # enumFromTo :: PrimElemRep -> PrimElemRep -> [PrimElemRep] # enumFromThenTo :: PrimElemRep -> PrimElemRep -> PrimElemRep -> [PrimElemRep] #
Show PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods showsPrec :: Int -> PrimElemRep -> ShowS # show :: PrimElemRep -> String # showList :: [PrimElemRep] -> ShowS #
Binary PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods put_ :: BinHandle -> PrimElemRep -> IO () # put :: BinHandle -> PrimElemRep -> IO (Bin PrimElemRep) # get :: BinHandle -> IO PrimElemRep #
Outputable PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods ppr :: PrimElemRep -> SDoc #
Eq PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods (==) :: PrimElemRep -> PrimElemRep -> Bool # (/=) :: PrimElemRep -> PrimElemRep -> Bool #
Ord PrimElemRep
Instance details Defined in GHC.Core.TyCon Methods compare :: PrimElemRep -> PrimElemRep -> Ordering # (<) :: PrimElemRep -> PrimElemRep -> Bool # (<=) :: PrimElemRep -> PrimElemRep -> Bool # (>) :: PrimElemRep -> PrimElemRep -> Bool # (>=) :: PrimElemRep -> PrimElemRep -> Bool # max :: PrimElemRep -> PrimElemRep -> PrimElemRep # min :: PrimElemRep -> PrimElemRep -> PrimElemRep #

data PrimRep #

A PrimRep is an abstraction of a type. It contains information that the code generator needs in order to pass arguments, return results, and store values of this type. See also Note [RuntimeRep and PrimRep] in GHC.Types.RepType and Note [VoidRep] in GHC.Types.RepType.

Constructors

VoidRep
LiftedRep
UnliftedRep	Unlifted pointer
Int8Rep	Signed, 8-bit value
Int16Rep	Signed, 16-bit value
Int32Rep	Signed, 32-bit value
Int64Rep	Signed, 64 bit value
IntRep	Signed, word-sized value
Word8Rep	Unsigned, 8 bit value
Word16Rep	Unsigned, 16 bit value
Word32Rep	Unsigned, 32 bit value
Word64Rep	Unsigned, 64 bit value
WordRep	Unsigned, word-sized value
AddrRep	A pointer, but not to a Haskell value (use '(Un)liftedRep')
FloatRep
DoubleRep
VecRep Int PrimElemRep	A vector

Instances

Instances details

Data PrimRep
Instance details Defined in GHC.Core.TyCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PrimRep -> c PrimRep # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PrimRep # toConstr :: PrimRep -> Constr # dataTypeOf :: PrimRep -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PrimRep) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PrimRep) # gmapT :: (forall b. Data b => b -> b) -> PrimRep -> PrimRep # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PrimRep -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PrimRep -> r # gmapQ :: (forall d. Data d => d -> u) -> PrimRep -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PrimRep -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PrimRep -> m PrimRep # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimRep -> m PrimRep # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PrimRep -> m PrimRep #
Show PrimRep
Instance details Defined in GHC.Core.TyCon Methods showsPrec :: Int -> PrimRep -> ShowS # show :: PrimRep -> String # showList :: [PrimRep] -> ShowS #
Binary PrimRep
Instance details Defined in GHC.Core.TyCon Methods put_ :: BinHandle -> PrimRep -> IO () # put :: BinHandle -> PrimRep -> IO (Bin PrimRep) # get :: BinHandle -> IO PrimRep #
Outputable PrimRep
Instance details Defined in GHC.Core.TyCon Methods ppr :: PrimRep -> SDoc #
Eq PrimRep
Instance details Defined in GHC.Core.TyCon Methods (==) :: PrimRep -> PrimRep -> Bool # (/=) :: PrimRep -> PrimRep -> Bool #
Ord PrimRep
Instance details Defined in GHC.Core.TyCon Methods compare :: PrimRep -> PrimRep -> Ordering # (<) :: PrimRep -> PrimRep -> Bool # (<=) :: PrimRep -> PrimRep -> Bool # (>) :: PrimRep -> PrimRep -> Bool # (>=) :: PrimRep -> PrimRep -> Bool # max :: PrimRep -> PrimRep -> PrimRep # min :: PrimRep -> PrimRep -> PrimRep #

data FamTyConFlav #

Information pertaining to the expansion of a type synonym (type)

Constructors

DataFamilyTyCon TyConRepName	Represents an open type family without a fixed right hand side. Additional instances can appear at any time. These are introduced by either a top level declaration: data family T a :: * Or an associated data type declaration, within a class declaration: class C a b where data T b :: *
OpenSynFamilyTyCon	An open type synonym family e.g. `type family F x y :: * -> *`
ClosedSynFamilyTyCon (Maybe (CoAxiom Branched))	A closed type synonym family e.g. `type family F x where { F Int = Bool }`
AbstractClosedSynFamilyTyCon	A closed type synonym family declared in an hs-boot file with type family F a where ..
BuiltInSynFamTyCon BuiltInSynFamily	Built-in type family used by the TypeNats solver

Instances

Instances details

Outputable FamTyConFlav
Instance details Defined in GHC.Core.TyCon Methods ppr :: FamTyConFlav -> SDoc #

data Injectivity #

Constructors

NotInjective
Injective [Bool]

Instances

Instances details

Binary Injectivity
Instance details Defined in GHC.Core.TyCon Methods put_ :: BinHandle -> Injectivity -> IO () # put :: BinHandle -> Injectivity -> IO (Bin Injectivity) # get :: BinHandle -> IO Injectivity #
Eq Injectivity
Instance details Defined in GHC.Core.TyCon Methods (==) :: Injectivity -> Injectivity -> Bool # (/=) :: Injectivity -> Injectivity -> Bool #

data AlgTyConFlav #

Describes the flavour of an algebraic type constructor. For classes and data families, this flavour includes a reference to the parent TyCon.

Constructors

VanillaAlgTyCon TyConRepName	An ordinary algebraic type constructor. This includes unlifted and representation-polymorphic datatypes and newtypes and unboxed tuples, but NOT unboxed sums; see UnboxedSumTyCon.
UnboxedSumTyCon	An unboxed sum type constructor. This is distinct from VanillaAlgTyCon because we currently don't allow unboxed sums to be Typeable since there are too many of them. See #13276.
ClassTyCon Class TyConRepName	Type constructors representing a class dictionary. See Note [ATyCon for classes] in GHC.Core.TyCo.Rep
DataFamInstTyCon (CoAxiom Unbranched) TyCon [Type]	Type constructors representing an instance of a data family. Parameters: 1) The type family in question 2) Instance types; free variables are the `tyConTyVars` of the current `TyCon` (not the family one). INVARIANT: the number of types matches the arity of the family `TyCon` 3) A `CoTyCon` identifying the representation type with the type instance family

Instances

Instances details

Outputable AlgTyConFlav
Instance details Defined in GHC.Core.TyCon Methods ppr :: AlgTyConFlav -> SDoc #

data PromDataConInfo #

Some promoted datacons signify extra info relevant to GHC. For example, the IntRep constructor of RuntimeRep corresponds to the IntRep constructor of PrimRep. This data structure allows us to store this information right in the TyCon. The other approach would be to look up things like RuntimeRep's PrimRep by known-key every time. See also Note [Getting from RuntimeRep to PrimRep] in GHC.Types.RepType

Constructors

NoPromInfo	an ordinary promoted data con
RuntimeRep ([Type] -> [PrimRep])	A constructor of `RuntimeRep`. The argument to the function should be the list of arguments to the promoted datacon.
VecCount Int	A constructor of `VecCount`
VecElem PrimElemRep	A constructor of `VecElem`
Levity Levity	A constructor of `PromDataConInfo`

data AlgTyConRhs #

Represents right-hand-sides of TyCons for algebraic types

Constructors

AbstractTyCon	Says that we know nothing about this data type, except that it's represented by a pointer. Used when we export a data type abstractly into an .hi file.
DataTyCon	Information about those `TyCon`s derived from a `data` declaration. This includes data types with no constructors at all.
Fields data_cons :: [DataCon] The data type constructors; can be empty if the user declares the type to have no constructors INVARIANT: Kept in order of increasing `DataCon` tag (see the tag assignment in mkTyConTagMap) data_cons_size :: Int Cached value: length data_cons is_enum :: Bool Cached value: is this an enumeration type? See Note [Enumeration types] is_type_data :: Bool data_fixed_lev :: Bool `True` if the data type constructor has a known, fixed levity when fully applied to its arguments, False otherwise. This can only be `False` with UnliftedDatatypes, e.g. data A :: TYPE (BoxedRep l) where { MkA :: Int -> A } This boolean is cached to make it cheaper to check for levity and representation-polymorphism in tcHasFixedRuntimeRep.
TupleTyCon
Fields data_con :: DataCon The unique constructor for the `newtype`. It has no existentials tup_sort :: TupleSort Is this a boxed, unboxed or constraint tuple?
SumTyCon	An unboxed sum type.
Fields data_cons :: [DataCon] The data type constructors; can be empty if the user declares the type to have no constructors INVARIANT: Kept in order of increasing `DataCon` tag (see the tag assignment in mkTyConTagMap) data_cons_size :: Int Cached value: length data_cons
NewTyCon	Information about those `TyCon`s derived from a `newtype` declaration
Fields data_con :: DataCon The unique constructor for the `newtype`. It has no existentials nt_rhs :: Type Cached value: the argument type of the constructor, which is just the representation type of the `TyCon` (remember that `newtype`s do not exist at runtime so need a different representation type). The free `TyVar`s of this type are the `tyConTyVars` from the corresponding `TyCon` nt_etad_rhs :: ([TyVar], Type) Same as the `nt_rhs`, but this time eta-reduced. Hence the list of `TyVar`s in this field may be shorter than the declared arity of the `TyCon`. nt_co :: CoAxiom Unbranched nt_fixed_rep :: Bool `True` if the newtype has a known, fixed representation when fully applied to its arguments, `False` otherwise. This can only ever be `False` with UnliftedNewtypes. Example: newtype N (a :: TYPE r) = MkN a Invariant: nt_fixed_rep nt = tcHasFixedRuntimeRep (nt_rhs nt) This boolean is cached to make it cheaper to check if a variable binding is representation-polymorphic in tcHasFixedRuntimeRep.

data TyConBndrVis #

Constructors

NamedTCB ForAllTyFlag
AnonTCB FunTyFlag

Instances

Instances details

Binary TyConBndrVis
Instance details Defined in GHC.Core.TyCon Methods put_ :: BinHandle -> TyConBndrVis -> IO () # put :: BinHandle -> TyConBndrVis -> IO (Bin TyConBndrVis) # get :: BinHandle -> IO TyConBndrVis #
Outputable TyConBndrVis
Instance details Defined in GHC.Core.TyCon Methods ppr :: TyConBndrVis -> SDoc #
OutputableBndr tv => Outputable (VarBndr tv TyConBndrVis)
Instance details Defined in GHC.Core.TyCon Methods ppr :: VarBndr tv TyConBndrVis -> SDoc #

type TyConPiTyBinder = VarBndr TyCoVar TyConBndrVis #

type TyConBinder = VarBndr TyVar TyConBndrVis #

data TyCoFolder env a #

Constructors

TyCoFolder
Fields tcf_view :: Type -> Maybe Type tcf_tyvar :: env -> TyVar -> a tcf_covar :: env -> CoVar -> a tcf_hole :: env -> CoercionHole -> a What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep. tcf_tycobinder :: env -> TyCoVar -> ForAllTyFlag -> env The returned env is used in the extended scope

data CoercionHole #

A coercion to be filled in by the type-checker. See Note [Coercion holes]

Constructors

CoercionHole
Fields ch_co_var :: CoVar ch_ref :: IORef (Maybe Coercion)

Instances

Instances details

Data CoercionHole
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CoercionHole -> c CoercionHole # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CoercionHole # toConstr :: CoercionHole -> Constr # dataTypeOf :: CoercionHole -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CoercionHole) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CoercionHole) # gmapT :: (forall b. Data b => b -> b) -> CoercionHole -> CoercionHole # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CoercionHole -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CoercionHole -> r # gmapQ :: (forall d. Data d => d -> u) -> CoercionHole -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> CoercionHole -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole #
Uniquable CoercionHole
Instance details Defined in GHC.Core.TyCo.Rep Methods getUnique :: CoercionHole -> Unique #
Outputable CoercionHole
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: CoercionHole -> SDoc #

type MCoercionR = MCoercion #

type CoercionP = Coercion #

type CoercionR = Coercion #

data FunSel #

Constructors

SelMult
SelArg
SelRes

Instances

Instances details

Data FunSel
Instance details Defined in GHC.Core.TyCo.Rep Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FunSel -> c FunSel # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FunSel # toConstr :: FunSel -> Constr # dataTypeOf :: FunSel -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FunSel) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FunSel) # gmapT :: (forall b. Data b => b -> b) -> FunSel -> FunSel # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FunSel -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FunSel -> r # gmapQ :: (forall d. Data d => d -> u) -> FunSel -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> FunSel -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> FunSel -> m FunSel # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FunSel -> m FunSel # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FunSel -> m FunSel #
Outputable FunSel
Instance details Defined in GHC.Core.TyCo.Rep Methods ppr :: FunSel -> SDoc #
Eq FunSel
Instance details Defined in GHC.Core.TyCo.Rep Methods (==) :: FunSel -> FunSel -> Bool # (/=) :: FunSel -> FunSel -> Bool #

type KnotTied ty = ty #

A type labeled KnotTied might have knot-tied tycons in it. See Note [Type checking recursive type and class declarations] in GHC.Tc.TyCl

type FRRType = Type #

type KindOrType = Type #

The key representation of types within the compiler

type CvSubstEnv = CoVarEnv Coercion #

A substitution of Coercions for CoVars

type TvSubstEnv = TyVarEnv Type #

A substitution of Types for TyVars and Kinds for KindVars

type IdSubstEnv = IdEnv CoreExpr #

A substitution of Exprs for non-coercion Ids

data TyCoMapper env (m :: Type -> Type) #

This describes how a "map" operation over a type/coercion should behave

Constructors

TyCoMapper

Fields

tcm_tyvar :: env -> TyVar -> m Type
tcm_covar :: env -> CoVar -> m Coercion
tcm_hole :: env -> CoercionHole -> m Coercion
What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep.
tcm_tycobinder :: env -> TyCoVar -> ForAllTyFlag -> m (env, TyCoVar)
The returned env is used in the extended scope
tcm_tycon :: TyCon -> m TyCon
This is used only for TcTyCons a) To zonk TcTyCons b) To turn TcTyCons into TyCons. See Note [Type checking recursive type and class declarations] in GHC.Tc.TyCl

data OverLitVal #

Overloaded Literal Value

Constructors

HsIntegral !IntegralLit	Integer-looking literals;
HsFractional !FractionalLit	Frac-looking literals
HsIsString !SourceText !FastString	String-looking literals

Instances

Instances details

Data OverLitVal
Instance details Defined in Language.Haskell.Syntax.Lit Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OverLitVal -> c OverLitVal # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OverLitVal # toConstr :: OverLitVal -> Constr # dataTypeOf :: OverLitVal -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OverLitVal) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OverLitVal) # gmapT :: (forall b. Data b => b -> b) -> OverLitVal -> OverLitVal # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OverLitVal -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OverLitVal -> r # gmapQ :: (forall d. Data d => d -> u) -> OverLitVal -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> OverLitVal -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal #
Eq OverLitVal
Instance details Defined in Language.Haskell.Syntax.Lit Methods (==) :: OverLitVal -> OverLitVal -> Bool # (/=) :: OverLitVal -> OverLitVal -> Bool #
Ord OverLitVal
Instance details Defined in Language.Haskell.Syntax.Lit Methods compare :: OverLitVal -> OverLitVal -> Ordering # (<) :: OverLitVal -> OverLitVal -> Bool # (<=) :: OverLitVal -> OverLitVal -> Bool # (>) :: OverLitVal -> OverLitVal -> Bool # (>=) :: OverLitVal -> OverLitVal -> Bool # max :: OverLitVal -> OverLitVal -> OverLitVal # min :: OverLitVal -> OverLitVal -> OverLitVal #

data HsOverLit p #

Haskell Overloaded Literal

Constructors

OverLit
Fields ol_ext :: XOverLit p ol_val :: OverLitVal
XOverLit !(XXOverLit p)

Instances

Instances details

Eq (XXOverLit p) => Eq (HsOverLit p)
Instance details Defined in Language.Haskell.Syntax.Lit Methods (==) :: HsOverLit p -> HsOverLit p -> Bool # (/=) :: HsOverLit p -> HsOverLit p -> Bool #
Ord (XXOverLit p) => Ord (HsOverLit p)
Instance details Defined in Language.Haskell.Syntax.Lit Methods compare :: HsOverLit p -> HsOverLit p -> Ordering # (<) :: HsOverLit p -> HsOverLit p -> Bool # (<=) :: HsOverLit p -> HsOverLit p -> Bool # (>) :: HsOverLit p -> HsOverLit p -> Bool # (>=) :: HsOverLit p -> HsOverLit p -> Bool # max :: HsOverLit p -> HsOverLit p -> HsOverLit p # min :: HsOverLit p -> HsOverLit p -> HsOverLit p #
type Anno (HsOverLit (GhcPass p))
Instance details Defined in GHC.Hs.Pat type Anno (HsOverLit (GhcPass p)) = SrcAnn NoEpAnns

data HsLit x #

Haskell Literal

Constructors

HsChar (XHsChar x) Char	Character
HsCharPrim (XHsCharPrim x) Char	Unboxed character
HsString (XHsString x) FastString	String
HsStringPrim (XHsStringPrim x) !ByteString	Packed bytes
HsInt (XHsInt x) IntegralLit	Genuinely an Int; arises from GHC.Tc.Deriv.Generate, and from TRANSLATION
HsIntPrim (XHsIntPrim x) Integer	literal `Int#`
HsWordPrim (XHsWordPrim x) Integer	literal `Word#`
HsInt64Prim (XHsInt64Prim x) Integer	literal `Int64#`
HsWord64Prim (XHsWord64Prim x) Integer	literal `Word64#`
HsInteger (XHsInteger x) Integer Type	Genuinely an integer; arises only from TRANSLATION (overloaded literals are done with HsOverLit)
HsRat (XHsRat x) FractionalLit Type	Genuinely a rational; arises only from TRANSLATION (overloaded literals are done with HsOverLit)
HsFloatPrim (XHsFloatPrim x) FractionalLit	Unboxed Float
HsDoublePrim (XHsDoublePrim x) FractionalLit	Unboxed Double
XLit !(XXLit x)

Instances

Instances details

Eq (HsLit x)
Instance details Defined in Language.Haskell.Syntax.Lit Methods (==) :: HsLit x -> HsLit x -> Bool # (/=) :: HsLit x -> HsLit x -> Bool #

data ShowForAllFlag #

Show forall flag

Unconditionally show the forall quantifier with (ShowForAllMust) or when (ShowForAllWhen) the names used are free in the binder or when compiling with -fprint-explicit-foralls.

Constructors

ShowForAllMust
ShowForAllWhen

newtype PrintExplicitKinds #

Constructors

PrintExplicitKinds Bool

newtype UseBndrParens #

Constructors

UseBndrParens Bool

newtype SuppressBndrSig #

Do we want to suppress kind annotations on binders? See Note [Suppressing binder signatures]

Constructors

SuppressBndrSig Bool

data IfaceUnivCoProv #

Constructors

IfacePhantomProv IfaceCoercion
IfaceProofIrrelProv IfaceCoercion
IfacePluginProv String
IfaceCorePrepProv Bool

Instances

Instances details

NFData IfaceUnivCoProv
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceUnivCoProv -> () #
Binary IfaceUnivCoProv
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceUnivCoProv -> IO () # put :: BinHandle -> IfaceUnivCoProv -> IO (Bin IfaceUnivCoProv) # get :: BinHandle -> IO IfaceUnivCoProv #

data IfaceMCoercion #

Constructors

IfaceMRefl
IfaceMCo IfaceCoercion

Instances

Instances details

NFData IfaceMCoercion
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceMCoercion -> () #
Binary IfaceMCoercion
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceMCoercion -> IO () # put :: BinHandle -> IfaceMCoercion -> IO (Bin IfaceMCoercion) # get :: BinHandle -> IO IfaceMCoercion #

data IfaceTyConInfo #

Constructors

IfaceTyConInfo
Fields ifaceTyConIsPromoted :: PromotionFlag ifaceTyConSort :: IfaceTyConSort

Instances

Instances details

NFData IfaceTyConInfo
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceTyConInfo -> () #
Binary IfaceTyConInfo
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceTyConInfo -> IO () # put :: BinHandle -> IfaceTyConInfo -> IO (Bin IfaceTyConInfo) # get :: BinHandle -> IO IfaceTyConInfo #
Outputable IfaceTyConInfo
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceTyConInfo -> SDoc #
Eq IfaceTyConInfo
Instance details Defined in GHC.Iface.Type Methods (==) :: IfaceTyConInfo -> IfaceTyConInfo -> Bool # (/=) :: IfaceTyConInfo -> IfaceTyConInfo -> Bool #

data IfaceTyConSort #

The various types of TyCons which have special, built-in syntax.

Constructors

IfaceNormalTyCon	a regular tycon
IfaceTupleTyCon !Arity !TupleSort	a tuple, e.g. `(a, b, c)` or `(#a, b, c#)`. The arity is the tuple width, not the tycon arity (which is twice the width in the case of unboxed tuples).
IfaceSumTyCon !Arity	an unboxed sum, e.g. `(# a \| b \| c #)`
IfaceEqualityTyCon	A heterogeneous equality TyCon (i.e. eqPrimTyCon, eqReprPrimTyCon, heqTyCon) that is actually being applied to two types of the same kind. This affects pretty-printing only: see Note [Equality predicates in IfaceType]

Instances

Instances details

NFData IfaceTyConSort
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceTyConSort -> () #
Binary IfaceTyConSort
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceTyConSort -> IO () # put :: BinHandle -> IfaceTyConSort -> IO (Bin IfaceTyConSort) # get :: BinHandle -> IO IfaceTyConSort #
Outputable IfaceTyConSort
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceTyConSort -> SDoc #
Eq IfaceTyConSort
Instance details Defined in GHC.Iface.Type Methods (==) :: IfaceTyConSort -> IfaceTyConSort -> Bool # (/=) :: IfaceTyConSort -> IfaceTyConSort -> Bool #

type IfaceForAllSpecBndr = VarBndr IfaceBndr Specificity #

type IfaceForAllBndr = VarBndr IfaceBndr ForAllTyFlag #

type IfaceTyConBinder = VarBndr IfaceBndr TyConBndrVis #

type IfaceContext = [IfacePredType] #

type IfacePredType = IfaceType #

type IfaceMult = IfaceType #

type IfaceKind = IfaceType #

data IfaceOneShot #

Constructors

IfaceNoOneShot
IfaceOneShot

Instances

Instances details

NFData IfaceOneShot
Instance details Defined in GHC.Iface.Type Methods rnf :: IfaceOneShot -> () #
Binary IfaceOneShot
Instance details Defined in GHC.Iface.Type Methods put_ :: BinHandle -> IfaceOneShot -> IO () # put :: BinHandle -> IfaceOneShot -> IO (Bin IfaceOneShot) # get :: BinHandle -> IO IfaceOneShot #
Outputable IfaceOneShot
Instance details Defined in GHC.Iface.Type Methods ppr :: IfaceOneShot -> SDoc #

type IfaceLamBndr = (IfaceBndr, IfaceOneShot) #

type IfaceTvBndr = (IfLclName, IfaceKind) #

type IfaceIdBndr = (IfaceType, IfLclName, IfaceType) #

type IfExtName = Name #

type IfLclName = FastString #

type LiftCoEnv = VarEnv Coercion #

data NormaliseStepResult ev #

The result of stepping in a normalisation function. See topNormaliseTypeX.

Constructors

NS_Done	Nothing more to do
NS_Abort	Utter failure. The outer function should fail too.
NS_Step RecTcChecker Type ev	We stepped, yielding new bits; ^ ev is evidence; Usually a co :: old type ~ new type

Instances

Instances details

Functor NormaliseStepResult
Instance details Defined in GHC.Core.Coercion Methods fmap :: (a -> b) -> NormaliseStepResult a -> NormaliseStepResult b # (<$) :: a -> NormaliseStepResult b -> NormaliseStepResult a #
Outputable ev => Outputable (NormaliseStepResult ev)
Instance details Defined in GHC.Core.Coercion Methods ppr :: NormaliseStepResult ev -> SDoc #

type NormaliseStepper ev = RecTcChecker -> TyCon -> [Type] -> NormaliseStepResult ev #

A function to check if we can reduce a type by one step. Used with topNormaliseTypeX.

newtype TempDir #

Constructors

TempDir FilePath

data TempFileLifetime #

Used when a temp file is created. This determines which component Set of PathsToClean will get the temp file

Constructors

TFL_CurrentModule	A file with lifetime TFL_CurrentModule will be cleaned up at the end of upweep_mod
TFL_GhcSession	A file with lifetime TFL_GhcSession will be cleaned up at the end of runGhc(T)

Instances

Instances details

Show TempFileLifetime
Instance details Defined in GHC.Utils.TmpFs Methods showsPrec :: Int -> TempFileLifetime -> ShowS # show :: TempFileLifetime -> String # showList :: [TempFileLifetime] -> ShowS #

data PathsToClean #

A collection of paths that must be deleted before ghc exits.

Constructors

PathsToClean
Fields ptcGhcSession :: !(Set FilePath) Paths that will be deleted at the end of runGhc(T) ptcCurrentModule :: !(Set FilePath) Paths that will be deleted the next time `cleanCurrentModuleTempFiles` is called, or otherwise at the end of the session.

data TmpFs #

Temporary file-system

data Warn #

A command-line warning message and the reason it arose

Constructors

Warn
Fields warnReason :: DiagnosticReason warnMsg :: Located String

data BindFlag #

Constructors

BindMe	A regular type variable
Apart	Declare that this type variable is apart from the type provided. That is, the type variable will never be instantiated to that type. See also Note [Binding when looking up instances] in GHC.Core.InstEnv.

Instances

Instances details

Eq BindFlag
Instance details Defined in GHC.Core.Unify Methods (==) :: BindFlag -> BindFlag -> Bool # (/=) :: BindFlag -> BindFlag -> Bool #

data MaybeApartReason #

Why are two types MaybeApart? MARInfinite takes precedence: This is used (only) in Note [Infinitary substitution in lookup] in GHC.Core.InstEnv As of Feb 2022, we never differentiate between MARTypeFamily and MARTypeVsConstraint; it's really only MARInfinite that's interesting here.

Constructors

MARTypeFamily	matching e.g. F Int ~? Bool
MARInfinite	matching e.g. a ~? Maybe a
MARTypeVsConstraint	matching Type ~? Constraint or the arrow types See Note [Type and Constraint are not apart] in GHC.Builtin.Types.Prim

Instances

Instances details

Semigroup MaybeApartReason
Instance details Defined in GHC.Core.Unify Methods (<>) :: MaybeApartReason -> MaybeApartReason -> MaybeApartReason # sconcat :: NonEmpty MaybeApartReason -> MaybeApartReason # stimes :: Integral b => b -> MaybeApartReason -> MaybeApartReason #
Outputable MaybeApartReason
Instance details Defined in GHC.Core.Unify Methods ppr :: MaybeApartReason -> SDoc #

data UnifyResultM a #

See Note [Unification result]

Constructors

Unifiable a
MaybeApart MaybeApartReason a
SurelyApart

Instances

Instances details

Applicative UnifyResultM
Instance details Defined in GHC.Core.Unify Methods pure :: a -> UnifyResultM a # (<>) :: UnifyResultM (a -> b) -> UnifyResultM a -> UnifyResultM b # liftA2 :: (a -> b -> c) -> UnifyResultM a -> UnifyResultM b -> UnifyResultM c # (>) :: UnifyResultM a -> UnifyResultM b -> UnifyResultM b # (<*) :: UnifyResultM a -> UnifyResultM b -> UnifyResultM a #
Functor UnifyResultM
Instance details Defined in GHC.Core.Unify Methods fmap :: (a -> b) -> UnifyResultM a -> UnifyResultM b # (<$) :: a -> UnifyResultM b -> UnifyResultM a #
Monad UnifyResultM
Instance details Defined in GHC.Core.Unify Methods (>>=) :: UnifyResultM a -> (a -> UnifyResultM b) -> UnifyResultM b # (>>) :: UnifyResultM a -> UnifyResultM b -> UnifyResultM b # return :: a -> UnifyResultM a #
Outputable a => Outputable (UnifyResultM a)
Instance details Defined in GHC.Core.Unify Methods ppr :: UnifyResultM a -> SDoc #

type UnifyResult = UnifyResultM Subst #

type BindFun = TyCoVar -> Type -> BindFlag #

Some unification functions are parameterised by a BindFun, which says whether or not to allow a certain unification to take place. A BindFun takes the TyVar involved along with the Type it will potentially be bound to.

It is possible for the variable to actually be a coercion variable (Note [Matching coercion variables]), but only when one-way matching. In this case, the Type will be a CoercionTy.

data EqRel #

A choice of equality relation. This is separate from the type Role because Phantom does not define a (non-trivial) equality relation.

Constructors

NomEq
ReprEq

Instances

Instances details

Outputable EqRel
Instance details Defined in GHC.Core.Predicate Methods ppr :: EqRel -> SDoc #
Eq EqRel
Instance details Defined in GHC.Core.Predicate Methods (==) :: EqRel -> EqRel -> Bool # (/=) :: EqRel -> EqRel -> Bool #
Ord EqRel
Instance details Defined in GHC.Core.Predicate Methods compare :: EqRel -> EqRel -> Ordering # (<) :: EqRel -> EqRel -> Bool # (<=) :: EqRel -> EqRel -> Bool # (>) :: EqRel -> EqRel -> Bool # (>=) :: EqRel -> EqRel -> Bool # max :: EqRel -> EqRel -> EqRel # min :: EqRel -> EqRel -> EqRel #

data StrictnessMark #

Constructors

MarkedStrict
NotMarkedStrict

Instances

Instances details

Binary StrictnessMark
Instance details Defined in GHC.Core.DataCon Methods put_ :: BinHandle -> StrictnessMark -> IO () # put :: BinHandle -> StrictnessMark -> IO (Bin StrictnessMark) # get :: BinHandle -> IO StrictnessMark #
Outputable StrictnessMark
Instance details Defined in GHC.Core.DataCon Methods ppr :: StrictnessMark -> SDoc #
Eq StrictnessMark
Instance details Defined in GHC.Core.DataCon Methods (==) :: StrictnessMark -> StrictnessMark -> Bool # (/=) :: StrictnessMark -> StrictnessMark -> Bool #

data HsImplBang #

Haskell Implementation Bang

Bangs of data constructor arguments as generated by the compiler after consulting HsSrcBang, flags, etc.

Constructors

HsLazy	Lazy field, or one with an unlifted type
HsStrict Bool	Strict but not unpacked field True = we could have unpacked, but opted not to because of -O0. See Note [Detecting useless UNPACK pragmas]
HsUnpack (Maybe Coercion)	Strict and unpacked field co :: arg-ty ~ product-ty HsBang

Instances

Instances details

Data HsImplBang
Instance details Defined in GHC.Core.DataCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsImplBang -> c HsImplBang # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsImplBang # toConstr :: HsImplBang -> Constr # dataTypeOf :: HsImplBang -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsImplBang) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsImplBang) # gmapT :: (forall b. Data b => b -> b) -> HsImplBang -> HsImplBang # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r # gmapQ :: (forall d. Data d => d -> u) -> HsImplBang -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsImplBang -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang #
Outputable HsImplBang
Instance details Defined in GHC.Core.DataCon Methods ppr :: HsImplBang -> SDoc #

data HsSrcBang #

Haskell Source Bang

Bangs on data constructor arguments as the user wrote them in the source code.

(HsSrcBang _ SrcUnpack SrcLazy) and (HsSrcBang _ SrcUnpack NoSrcStrict) (without StrictData) makes no sense, we emit a warning (in checkValidDataCon) and treat it like (HsSrcBang _ NoSrcUnpack SrcLazy)

Constructors

HsSrcBang SourceText SrcUnpackedness SrcStrictness

Instances

Instances details

Data HsSrcBang
Instance details Defined in GHC.Core.DataCon Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsSrcBang -> c HsSrcBang # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsSrcBang # toConstr :: HsSrcBang -> Constr # dataTypeOf :: HsSrcBang -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsSrcBang) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsSrcBang) # gmapT :: (forall b. Data b => b -> b) -> HsSrcBang -> HsSrcBang # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r # gmapQ :: (forall d. Data d => d -> u) -> HsSrcBang -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsSrcBang -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang #
Outputable HsSrcBang
Instance details Defined in GHC.Core.DataCon Methods ppr :: HsSrcBang -> SDoc #

type DataConEnv a = UniqFM DataCon a #

data AmbiguousFieldOcc pass #

Ambiguous Field Occurrence

Represents an *occurrence* of a field that is potentially ambiguous after the renamer, with the ambiguity resolved by the typechecker. We always store the RdrName that the user originally wrote, and store the selector function after the renamer (for unambiguous occurrences) or the typechecker (for ambiguous occurrences).

See Note [HsRecField and HsRecUpdField] in GHC.Hs.Pat. See Note [Located RdrNames] in GHC.Hs.Expr.

Constructors

Unambiguous (XUnambiguous pass) (XRec pass RdrName)
Ambiguous (XAmbiguous pass) (XRec pass RdrName)
XAmbiguousFieldOcc !(XXAmbiguousFieldOcc pass)

Instances

Instances details

HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (AmbiguousFieldOcc (GhcPass p))) -> HieM [HieAST Type]
type Anno (AmbiguousFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (AmbiguousFieldOcc (GhcPass p)) = SrcAnn NoEpAnns

type LAmbiguousFieldOcc pass = XRec pass (AmbiguousFieldOcc pass) #

Located Ambiguous Field Occurence

data FieldOcc pass #

Field Occurrence

Represents an *occurrence* of a field. This may or may not be a binding occurrence (e.g. this type is used in ConDeclField and RecordPatSynField which bind their fields, but also in HsRecField for record construction and patterns, which do not).

We store both the RdrName the user originally wrote, and after the renamer we use the extension field to store the selector function.

Constructors

FieldOcc
Fields foExt :: XCFieldOcc pass foLabel :: XRec pass RdrName
XFieldOcc !(XXFieldOcc pass)

Instances

Instances details

HiePass p => ToHie (Context (FieldOcc (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Context (FieldOcc (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RFContext (LocatedAn NoEpAnns (FieldOcc (GhcPass p))) -> HieM [HieAST Type]
(Eq (XRec pass RdrName), Eq (XCFieldOcc pass), Eq (XXFieldOcc pass)) => Eq (FieldOcc pass)
Instance details Defined in Language.Haskell.Syntax.Type Methods (==) :: FieldOcc pass -> FieldOcc pass -> Bool # (/=) :: FieldOcc pass -> FieldOcc pass -> Bool #
type Anno (FieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (FieldOcc (GhcPass p)) = SrcAnn NoEpAnns

type LFieldOcc pass = XRec pass (FieldOcc pass) #

Located Field Occurrence

type LHsTypeArg p = HsArg (LHsType p) (LHsKind p) #

data HsArg tm ty #

Arguments in an expression/type after splitting

Constructors

HsValArg tm
HsTypeArg SrcSpan ty
HsArgPar SrcSpan

Instances

Instances details

(HasLoc tm, HasLoc ty) => HasLoc (HsArg tm ty)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: HsArg tm ty -> SrcSpan
(ToHie tm, ToHie ty) => ToHie (HsArg tm ty)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsArg tm ty -> HieM [HieAST Type]

data HsConDetails tyarg arg rec #

Describes the arguments to a data constructor. This is a common representation for several constructor-related concepts, including:

The arguments in a Haskell98-style constructor declaration (see HsConDeclH98Details in GHC.Hs.Decls).
The arguments in constructor patterns in case/function definitions (see HsConPatDetails in GHC.Hs.Pat).
The left-hand side arguments in a pattern synonym binding (see HsPatSynDetails in GHC.Hs.Binds).

One notable exception is the arguments in a GADT constructor, which uses a separate data type entirely (see HsConDeclGADTDetails in GHC.Hs.Decls). This is because GADT constructors cannot be declared with infix syntax, unlike the concepts above (#18844).

Constructors

PrefixCon [tyarg] [arg]
RecCon rec
InfixCon arg arg

Instances

Instances details

(Data tyarg, Data rec, Data arg) => Data (HsConDetails tyarg arg rec)
Instance details Defined in Language.Haskell.Syntax.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsConDetails tyarg arg rec -> c (HsConDetails tyarg arg rec) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsConDetails tyarg arg rec) # toConstr :: HsConDetails tyarg arg rec -> Constr # dataTypeOf :: HsConDetails tyarg arg rec -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsConDetails tyarg arg rec)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsConDetails tyarg arg rec)) # gmapT :: (forall b. Data b => b -> b) -> HsConDetails tyarg arg rec -> HsConDetails tyarg arg rec # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsConDetails tyarg arg rec -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsConDetails tyarg arg rec -> r # gmapQ :: (forall d. Data d => d -> u) -> HsConDetails tyarg arg rec -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsConDetails tyarg arg rec -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec) #
(ToHie tyarg, ToHie arg, ToHie rec) => ToHie (HsConDetails tyarg arg rec)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsConDetails tyarg arg rec -> HieM [HieAST Type]

data ConDeclField pass #

Constructor Declaration Field

Constructors

ConDeclField
Fields cd_fld_ext :: XConDeclField pass cd_fld_names :: [LFieldOcc pass] See Note [ConDeclField pass] cd_fld_type :: LBangType pass cd_fld_doc :: Maybe (LHsDoc pass) `AnnKeywordId` : `AnnDcolon`
XConDeclField !(XXConDeclField pass)

Instances

Instances details

ToHie (LocatedA (ConDeclField GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]
ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]
type Anno (ConDeclField (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (ConDeclField (GhcPass _1))]
Instance details Defined in GHC.Hs.Decls type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type LConDeclField pass #

Arguments

= XRec pass (ConDeclField pass)

May have AnnKeywordId : AnnComma when in a list

Located Constructor Declaration Field

data HsTupleSort #

Haskell Tuple Sort

Constructors

HsUnboxedTuple
HsBoxedOrConstraintTuple

Instances

Instances details

Data HsTupleSort

Instance details

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsTupleSort -> c HsTupleSort #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsTupleSort #

toConstr :: HsTupleSort -> Constr #

dataTypeOf :: HsTupleSort -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> HsTupleSort -> HsTupleSort #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsTupleSort -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsTupleSort -> r #

gmapQ :: (forall d. Data d => d -> u) -> HsTupleSort -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsTupleSort -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort #

data HsScaled pass a #

This is used in the syntax. In constructor declaration. It must keep the arrow representation.

Constructors

HsScaled (HsArrow pass) a

Instances

Instances details

ToHie a => ToHie (HsScaled GhcRn a)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsScaled GhcRn a -> HieM [HieAST Type]

data HsLinearArrowTokens pass #

Constructors

HsPct1 !(LHsToken "%1" pass) !(LHsUniToken "->" "\8594" pass)
HsLolly !(LHsToken "\8888" pass)

data HsArrow pass #

Denotes the type of arrows in the surface language

Constructors

HsUnrestrictedArrow !(LHsUniToken "->" "\8594" pass)	a -> b or a → b
HsLinearArrow !(HsLinearArrowTokens pass)	a %1 -> b or a %1 → b, or a ⊸ b
HsExplicitMult !(LHsToken "%" pass) !(LHsType pass) !(LHsUniToken "->" "\8594" pass)	a %m -> b or a %m → b (very much including `a %Many -> b`! This is how the programmer wrote it). It is stored as an `HsType` so as to preserve the syntax as written in the program.

data HsTyLit pass #

Haskell Type Literal

Constructors

HsNumTy (XNumTy pass) Integer
HsStrTy (XStrTy pass) FastString
HsCharTy (XCharTy pass) Char
XTyLit !(XXTyLit pass)

data HsType pass #

Haskell Type

Constructors

HsForAllTy	`AnnKeywordId` : `AnnForall`, `AnnDot`,`AnnDarrow` For details on above see Note [exact print annotations] in GHC.Parser.Annotation
Fields hst_xforall :: XForAllTy pass hst_tele :: HsForAllTelescope pass hst_body :: LHsType pass
HsQualTy
Fields hst_xqual :: XQualTy pass hst_ctxt :: LHsContext pass hst_body :: LHsType pass
HsTyVar (XTyVar pass) PromotionFlag (LIdP pass)	`AnnKeywordId` : None
HsAppTy (XAppTy pass) (LHsType pass) (LHsType pass)	`AnnKeywordId` : None
HsAppKindTy (XAppKindTy pass) (LHsType pass) (LHsKind pass)
HsFunTy (XFunTy pass) (HsArrow pass) (LHsType pass) (LHsType pass)	`AnnKeywordId` : `AnnRarrow`,
HsListTy (XListTy pass) (LHsType pass)	`AnnKeywordId` : `AnnOpen` `'['`, `AnnClose` `']'`
HsTupleTy (XTupleTy pass) HsTupleSort [LHsType pass]	`AnnKeywordId` : `AnnOpen` `'(' or '(#'`, `AnnClose` `')' or '#)'`
HsSumTy (XSumTy pass) [LHsType pass]	`AnnKeywordId` : `AnnOpen` `'(#'`, `AnnClose` '#)'@
HsOpTy (XOpTy pass) PromotionFlag (LHsType pass) (LIdP pass) (LHsType pass)	`AnnKeywordId` : None
HsParTy (XParTy pass) (LHsType pass)	`AnnKeywordId` : `AnnOpen` `'('`, `AnnClose` `')'`
HsIParamTy (XIParamTy pass) (XRec pass HsIPName) (LHsType pass)	(?x :: ty) `AnnKeywordId` : `AnnDcolon`
HsStarTy (XStarTy pass) Bool	`AnnKeywordId` : None
HsKindSig (XKindSig pass) (LHsType pass) (LHsKind pass)	(ty :: kind) `AnnKeywordId` : `AnnOpen` `'('`, `AnnDcolon`,`AnnClose` `')'`
HsSpliceTy (XSpliceTy pass) (HsUntypedSplice pass)	`AnnKeywordId` : `AnnOpen` `'$('`, `AnnClose` `')'`
HsDocTy (XDocTy pass) (LHsType pass) (LHsDoc pass)	`AnnKeywordId` : None
HsBangTy (XBangTy pass) HsSrcBang (LHsType pass)	`AnnKeywordId` : `AnnOpen` `'{-# UNPACK' or '{-# NOUNPACK'`, `AnnClose` `'#-}'` `AnnBang` `'!'`
HsRecTy (XRecTy pass) [LConDeclField pass]	`AnnKeywordId` : `AnnOpen` `'{'`, `AnnClose` `'}'`
HsExplicitListTy (XExplicitListTy pass) PromotionFlag [LHsType pass]	`AnnKeywordId` : `AnnOpen` `"'["`, `AnnClose` `']'`
HsExplicitTupleTy (XExplicitTupleTy pass) [LHsType pass]	`AnnKeywordId` : `AnnOpen` `"'("`, `AnnClose` `')'`
HsTyLit (XTyLit pass) (HsTyLit pass)	`AnnKeywordId` : None
HsWildCardTy (XWildCardTy pass)	`AnnKeywordId` : None
XHsType !(XXType pass)

Instances

Instances details

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (LocatedA (HsType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]
ToHie (LocatedC [LocatedA (HsType GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]
DisambTD (HsType GhcPs)
Instance details Defined in GHC.Parser.PostProcess Methods mkHsAppTyHeadPV :: LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsAppTyPV :: LocatedA (HsType GhcPs) -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsAppKindTyPV :: LocatedA (HsType GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkHsOpTyPV :: PromotionFlag -> LHsType GhcPs -> LocatedN RdrName -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs)) # mkUnpackednessPV :: Located UnpackednessPragma -> LocatedA (HsType GhcPs) -> PV (LocatedA (HsType GhcPs)) #
type Anno (BangType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (BangType (GhcPass p)) = SrcSpanAnnA
type Anno (HsKind (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsKind (GhcPass p)) = SrcSpanAnnA
type Anno (HsType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsType (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (HsType (GhcPass p))]
Instance details Defined in GHC.Hs.Type type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data HsTyVarBndr flag pass #

Haskell Type Variable Binder The flag annotates the binder. It is Specificity in places where explicit specificity is allowed (e.g. x :: forall {a} b. ...) or () in other places.

Constructors

UserTyVar (XUserTyVar pass) flag (LIdP pass)
KindedTyVar (XKindedTyVar pass) flag (LIdP pass) (LHsKind pass)	`AnnKeywordId` : `AnnOpen`, `AnnDcolon`, `AnnClose`
XTyVarBndr !(XXTyVarBndr pass)

Instances

Instances details

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]
type Anno (HsTyVarBndr _flag (GhcPass _1))
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcPs)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcRn)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA
type Anno (HsTyVarBndr _flag GhcTc)
Instance details Defined in GHC.Hs.Type type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

newtype HsIPName #

These names are used early on to store the names of implicit parameters. They completely disappear after type-checking.

Constructors

HsIPName FastString

Instances

Instances details

Data HsIPName
Instance details Defined in Language.Haskell.Syntax.Type Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsIPName -> c HsIPName # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsIPName # toConstr :: HsIPName -> Constr # dataTypeOf :: HsIPName -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsIPName) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsIPName) # gmapT :: (forall b. Data b => b -> b) -> HsIPName -> HsIPName # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsIPName -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsIPName -> r # gmapQ :: (forall d. Data d => d -> u) -> HsIPName -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsIPName -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName #
Eq HsIPName
Instance details Defined in Language.Haskell.Syntax.Type Methods (==) :: HsIPName -> HsIPName -> Bool # (/=) :: HsIPName -> HsIPName -> Bool #
ToHie (LocatedAn NoEpAnns HsIPName)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns HsIPName -> HieM [HieAST Type]
type Anno HsIPName
Instance details Defined in GHC.Hs.Type type Anno HsIPName = SrcAnn NoEpAnns

data HsSigType pass #

A type signature that obeys the forall-or-nothing rule. In other words, an LHsType that uses an HsOuterSigTyVarBndrs to represent its outermost type variable quantification. See Note [Representing type signatures].

Constructors

HsSig
Fields sig_ext :: XHsSig pass sig_bndrs :: HsOuterSigTyVarBndrs pass sig_body :: LHsType pass
XHsSigType !(XXHsSigType pass)

Instances

Instances details

ToHie (TScoped (LocatedA (HsSigType GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
type Anno (HsSigType (GhcPass p))
Instance details Defined in GHC.Hs.Type type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

type LHsSigWcType pass = HsWildCardBndrs pass (LHsSigType pass) #

Located Haskell Signature Wildcard Type

type LHsWcType pass = HsWildCardBndrs pass (LHsType pass) #

Located Haskell Wildcard Type

type LHsSigType pass = XRec pass (HsSigType pass) #

Located Haskell Signature Type

data HsPatSigType pass #

Types that can appear in pattern signatures, as well as the signatures for term-level binders in RULES. See Note [Pattern signature binders and scoping].

This is very similar to HsSigWcType, but with slightly different semantics: see Note [HsType binders]. See also Note [The wildcard story for types].

Constructors

HsPS
Fields hsps_ext :: XHsPS pass After renamer: `HsPSRn` hsps_body :: LHsType pass Main payload (the type itself)
XHsPatSigType !(XXHsPatSigType pass)

Instances

Instances details

ToHie (TScoped (HsPatSigType GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsPatSigType GhcRn) -> HieM [HieAST Type]

data HsWildCardBndrs pass thing #

Haskell Wildcard Binders

Constructors

HsWC
Fields hswc_ext :: XHsWC pass thing hswc_body :: thing
XHsWildCardBndrs !(XXHsWildCardBndrs pass thing)

Instances

Instances details

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

type HsOuterFamEqnTyVarBndrs = HsOuterTyVarBndrs () #

Used for type-family instance equations, e.g.,

type instance forall a. F [a] = Tree a

The notion of specificity is irrelevant in type family equations, so we use () for the HsOuterTyVarBndrs flag.

type HsOuterSigTyVarBndrs = HsOuterTyVarBndrs Specificity #

Used for signatures, e.g.,

f :: forall a {b}. blah

We use Specificity for the HsOuterTyVarBndrs flag to allow distinguishing between specified and inferred type variables.

data HsOuterTyVarBndrs flag pass #

The outermost type variables in a type that obeys the forall-or-nothing rule. See Note [forall-or-nothing rule].

Constructors

HsOuterImplicit	Implicit forall, e.g., `f :: a -> b -> b`
Fields hso_ximplicit :: XHsOuterImplicit pass
HsOuterExplicit	Explicit forall, e.g., `f :: forall a b. a -> b -> b`
Fields hso_xexplicit :: XHsOuterExplicit pass flag hso_bndrs :: [LHsTyVarBndr flag (NoGhcTc pass)]
XHsOuterTyVarBndrs !(XXHsOuterTyVarBndrs pass)

Instances

Instances details

Data flag => ToHie (TVScoped (HsOuterTyVarBndrs flag GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TVScoped (HsOuterTyVarBndrs flag GhcRn) -> HieM [HieAST Type]
type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))
Instance details Defined in GHC.Hs.Type type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

data LHsQTyVars pass #

Located Haskell Quantified Type Variables

Constructors

HsQTvs
Fields hsq_ext :: XHsQTvs pass hsq_explicit :: [LHsTyVarBndr () pass]
XLHsQTyVars !(XXLHsQTyVars pass)

Instances

Instances details

ToHie (TScoped (LHsQTyVars GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (LHsQTyVars GhcRn) -> HieM [HieAST Type]

type LHsTyVarBndr flag pass = XRec pass (HsTyVarBndr flag pass) #

Located Haskell Type Variable Binder

data HsForAllTelescope pass #

The type variable binders in an HsForAllTy. See also Note [Variable Specificity and Forall Visibility] in GHC.Tc.Gen.HsType.

Constructors

HsForAllVis	A visible `forall` (e.g., `forall a -> {...}`). These do not have any notion of specificity, so we use `()` as a placeholder value.
Fields hsf_xvis :: XHsForAllVis pass hsf_vis_bndrs :: [LHsTyVarBndr () pass]
HsForAllInvis	An invisible `forall` (e.g., `forall a {b} c. {...}`), where each binder has a `Specificity`.
Fields hsf_xinvis :: XHsForAllInvis pass hsf_invis_bndrs :: [LHsTyVarBndr Specificity pass]
XHsForAllTelescope !(XXHsForAllTelescope pass)

type LHsKind pass #

Arguments

= XRec pass (HsKind pass)

AnnKeywordId : AnnDcolon

Located Haskell Kind

type HsKind pass = HsType pass #

Haskell Kind

type LHsType pass #

Arguments

= XRec pass (HsType pass)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Type

type HsContext pass = [LHsType pass] #

Haskell Context

type LHsContext pass #

Arguments

= XRec pass (HsContext pass)

AnnKeywordId : AnnUnit For details on above see Note [exact print annotations] in GHC.Parser.Annotation

Located Haskell Context

type LBangType pass = XRec pass (BangType pass) #

Located Bang Type

data HsFieldBind lhs rhs #

Haskell Field Binding

AnnKeywordId : AnnEqual,

For details on above see Note [exact print annotations] in GHC.Parser.Annotation

Constructors

HsFieldBind
Fields hfbAnn :: XHsFieldBind lhs hfbLHS :: lhs hfbRHS :: rhs Filled in by renamer when punning hfbPun :: Bool Note [Punning]

Instances

Instances details

Foldable (HsFieldBind lhs)
Instance details Defined in Language.Haskell.Syntax.Pat Methods fold :: Monoid m => HsFieldBind lhs m -> m # foldMap :: Monoid m => (a -> m) -> HsFieldBind lhs a -> m # foldMap' :: Monoid m => (a -> m) -> HsFieldBind lhs a -> m # foldr :: (a -> b -> b) -> b -> HsFieldBind lhs a -> b # foldr' :: (a -> b -> b) -> b -> HsFieldBind lhs a -> b # foldl :: (b -> a -> b) -> b -> HsFieldBind lhs a -> b # foldl' :: (b -> a -> b) -> b -> HsFieldBind lhs a -> b # foldr1 :: (a -> a -> a) -> HsFieldBind lhs a -> a # foldl1 :: (a -> a -> a) -> HsFieldBind lhs a -> a # toList :: HsFieldBind lhs a -> [a] # null :: HsFieldBind lhs a -> Bool # length :: HsFieldBind lhs a -> Int # elem :: Eq a => a -> HsFieldBind lhs a -> Bool # maximum :: Ord a => HsFieldBind lhs a -> a # minimum :: Ord a => HsFieldBind lhs a -> a # sum :: Num a => HsFieldBind lhs a -> a # product :: Num a => HsFieldBind lhs a -> a #
Traversable (HsFieldBind lhs)
Instance details Defined in Language.Haskell.Syntax.Pat Methods traverse :: Applicative f => (a -> f b) -> HsFieldBind lhs a -> f (HsFieldBind lhs b) # sequenceA :: Applicative f => HsFieldBind lhs (f a) -> f (HsFieldBind lhs a) # mapM :: Monad m => (a -> m b) -> HsFieldBind lhs a -> m (HsFieldBind lhs b) # sequence :: Monad m => HsFieldBind lhs (m a) -> m (HsFieldBind lhs a) #
Functor (HsFieldBind lhs)
Instance details Defined in Language.Haskell.Syntax.Pat Methods fmap :: (a -> b) -> HsFieldBind lhs a -> HsFieldBind lhs b # (<$) :: a -> HsFieldBind lhs b -> HsFieldBind lhs a #
(ToHie (RFContext label), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsFieldBind label arg)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (LocatedA (HsFieldBind label arg)) -> HieM [HieAST Type]
type Anno (HsFieldBind lhs rhs)
Instance details Defined in GHC.Hs.Pat type Anno (HsFieldBind lhs rhs) = SrcSpanAnnA

type HsRecUpdField p = HsFieldBind (LAmbiguousFieldOcc p) (LHsExpr p) #

Haskell Record Update Field

type HsRecField p arg = HsFieldBind (LFieldOcc p) arg #

Haskell Record Field

type LHsRecUpdField p = XRec p (HsRecUpdField p) #

Located Haskell Record Update Field

type LHsRecField p arg = XRec p (HsRecField p arg) #

Located Haskell Record Field

type LHsFieldBind p id arg = XRec p (HsFieldBind id arg) #

Located Haskell Record Field

newtype RecFieldsDotDot #

Newtype to be able to have a specific XRec instance for the Int in rec_dotdot

Constructors

RecFieldsDotDot
Fields unRecFieldsDotDot :: Int

Instances

Instances details

Data RecFieldsDotDot
Instance details Defined in Language.Haskell.Syntax.Pat Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RecFieldsDotDot -> c RecFieldsDotDot # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RecFieldsDotDot # toConstr :: RecFieldsDotDot -> Constr # dataTypeOf :: RecFieldsDotDot -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RecFieldsDotDot) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RecFieldsDotDot) # gmapT :: (forall b. Data b => b -> b) -> RecFieldsDotDot -> RecFieldsDotDot # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RecFieldsDotDot -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RecFieldsDotDot -> r # gmapQ :: (forall d. Data d => d -> u) -> RecFieldsDotDot -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> RecFieldsDotDot -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RecFieldsDotDot -> m RecFieldsDotDot # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFieldsDotDot -> m RecFieldsDotDot # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFieldsDotDot -> m RecFieldsDotDot #
Eq RecFieldsDotDot
Instance details Defined in Language.Haskell.Syntax.Pat Methods (==) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool # (/=) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool #
Ord RecFieldsDotDot
Instance details Defined in Language.Haskell.Syntax.Pat Methods compare :: RecFieldsDotDot -> RecFieldsDotDot -> Ordering # (<) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool # (<=) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool # (>) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool # (>=) :: RecFieldsDotDot -> RecFieldsDotDot -> Bool # max :: RecFieldsDotDot -> RecFieldsDotDot -> RecFieldsDotDot # min :: RecFieldsDotDot -> RecFieldsDotDot -> RecFieldsDotDot #
type Anno RecFieldsDotDot
Instance details Defined in GHC.Hs.Pat type Anno RecFieldsDotDot = SrcSpan

data HsRecFields p arg #

Haskell Record Fields

HsRecFields is used only for patterns and expressions (not data type declarations)

Constructors

HsRecFields
Fields rec_flds :: [LHsRecField p arg] rec_dotdot :: Maybe (XRec p RecFieldsDotDot)

Instances

Instances details

(ToHie arg, HasLoc arg, Data arg, HiePass p) => ToHie (RContext (HsRecFields (GhcPass p) arg))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RContext (HsRecFields (GhcPass p) arg) -> HieM [HieAST Type]

type HsConPatDetails p = HsConDetails (HsConPatTyArg (NoGhcTc p)) (LPat p) (HsRecFields p (LPat p)) #

Haskell Constructor Pattern Details

data HsConPatTyArg p #

Type argument in a data constructor pattern, e.g. the @a in f (Just @a x) = ....

Constructors

HsConPatTyArg !(LHsToken "@" p) (HsPatSigType p)

type family ConLikeP x #

Instances

Instances details

type ConLikeP GhcPs
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcPs = RdrName
type ConLikeP GhcRn
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcRn = Name
type ConLikeP GhcTc
Instance details Defined in GHC.Hs.Pat type ConLikeP GhcTc = ConLike

data HsPatSynDir id #

Haskell Pattern Synonym Direction

Constructors

Unidirectional
ImplicitBidirectional
ExplicitBidirectional (MatchGroup id (LHsExpr id))

Instances

Instances details

HiePass p => ToHie (HsPatSynDir (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsPatSynDir (GhcPass p) -> HieM [HieAST Type]

data RecordPatSynField pass #

Record Pattern Synonym Field

Constructors

RecordPatSynField
Fields recordPatSynField :: FieldOcc pass Field label visible in rest of the file recordPatSynPatVar :: LIdP pass Filled in by renamer, the name used internally by the pattern

Instances

Instances details

HiePass p => ToHie (PatSynFieldContext (RecordPatSynField (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PatSynFieldContext (RecordPatSynField (GhcPass p)) -> HieM [HieAST Type]

type HsPatSynDetails pass = HsConDetails Void (LIdP pass) [RecordPatSynField pass] #

Haskell Pattern Synonym Details

data FixitySig pass #

Fixity Signature

Constructors

FixitySig (XFixitySig pass) [LIdP pass] Fixity
XFixitySig !(XXFixitySig pass)

Instances

Instances details

ToHie (LocatedA (FixitySig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]
type Anno (FixitySig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

type LFixitySig pass = XRec pass (FixitySig pass) #

Located Fixity Signature

data Sig pass #

Signatures and pragmas

Constructors

TypeSig (XTypeSig pass) [LIdP pass] (LHsSigWcType pass)	An ordinary type signature f :: Num a => a -> a After renaming, this list of Names contains the named wildcards brought into scope by this signature. For a signature `_ -> _a -> Bool`, the renamer will leave the unnamed wildcard `_` untouched, and the named wildcard `_a` is then replaced with fresh meta vars in the type. Their names are stored in the type signature that brought them into scope, in this third field to be more specific. `AnnKeywordId` : `AnnDcolon`, `AnnComma`
PatSynSig (XPatSynSig pass) [LIdP pass] (LHsSigType pass)	A pattern synonym type signature pattern Single :: () => (Show a) => a -> [a] `AnnKeywordId` : `AnnPattern`, `AnnDcolon`,`AnnForall` `AnnDot`,`AnnDarrow`
ClassOpSig (XClassOpSig pass) Bool [LIdP pass] (LHsSigType pass)	A signature for a class method False: ordinary class-method signature True: generic-default class method signature e.g. class C a where op :: a -> a -- Ordinary default op :: Eq a => a -> a -- Generic default No wildcards allowed here `AnnKeywordId` : `AnnDefault`, `AnnDcolon`
FixSig (XFixSig pass) (FixitySig pass)	An ordinary fixity declaration infixl 8 *** `AnnKeywordId` : `AnnInfix`, `AnnVal`
InlineSig (XInlineSig pass) (LIdP pass) InlinePragma	An inline pragma {#- INLINE f #-} `AnnKeywordId` : `AnnOpen` `'{-# INLINE'` and `'['`, `AnnClose`,`AnnOpen`, `AnnVal`,`AnnTilde`, `AnnClose`
SpecSig (XSpecSig pass) (LIdP pass) [LHsSigType pass] InlinePragma	A specialisation pragma {-# SPECIALISE f :: Int -> Int #-} `AnnKeywordId` : `AnnOpen`, `AnnOpen` `'{-# SPECIALISE'` and `'['`, `AnnTilde`, `AnnVal`, `AnnClose` `']'` and `'#-}'`, `AnnDcolon`
SpecInstSig (XSpecInstSig pass) (LHsSigType pass)	A specialisation pragma for instance declarations only {-# SPECIALISE instance Eq [Int] #-} (Class tys); should be a specialisation of the current instance declaration `AnnKeywordId` : `AnnOpen`, `AnnInstance`,`AnnClose`
MinimalSig (XMinimalSig pass) (LBooleanFormula (LIdP pass))	A minimal complete definition pragma {-# MINIMAL a \| (b, c \| (d \| e)) #-} `AnnKeywordId` : `AnnOpen`, `AnnVbar`,`AnnComma`, `AnnClose`
SCCFunSig (XSCCFunSig pass) (LIdP pass) (Maybe (XRec pass StringLiteral))	A "set cost centre" pragma for declarations {-# SCC funName #-} or {-# SCC funName "cost_centre_name" #-}
CompleteMatchSig (XCompleteMatchSig pass) (XRec pass [LIdP pass]) (Maybe (LIdP pass))	A complete match pragma {-# COMPLETE C, D [:: T] #-} Used to inform the pattern match checker about additional complete matchings which, for example, arise from pattern synonym definitions.
XSig !(XXSig pass)

Instances

Instances details

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]
type Anno (Sig (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (Sig (GhcPass p)) = SrcSpanAnnA

type LSig pass = XRec pass (Sig pass) #

Located Signature

data IPBind id #

Implicit parameter bindings.

AnnKeywordId : AnnEqual

Constructors

IPBind (XCIPBind id) (XRec id HsIPName) (LHsExpr id)
XIPBind !(XXIPBind id)

Instances

Instances details

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]
type Anno (IPBind (GhcPass p))
Instance details Defined in GHC.Hs.Binds type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

type LIPBind id = XRec id (IPBind id) #

Located Implicit Parameter Binding

May have AnnKeywordId : AnnSemi when in a list

data HsIPBinds id #

Haskell Implicit Parameter Bindings

Constructors

IPBinds (XIPBinds id) [LIPBind id]
XHsIPBinds !(XXHsIPBinds id)

data PatSynBind idL idR #

AnnKeywordId : AnnPattern, AnnEqual,AnnLarrow, AnnWhere,AnnOpen '{', AnnClose '}',

Pattern Synonym binding

Constructors

PSB
Fields psb_ext :: XPSB idL idR psb_id :: LIdP idL Name of the pattern synonym psb_args :: HsPatSynDetails idR Formal parameter names psb_def :: LPat idR Right-hand side psb_dir :: HsPatSynDir idR Directionality
XPatSynBind !(XXPatSynBind idL idR)

Instances

Instances details

HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

data HsBindLR idL idR #

Haskell Binding with separate Left and Right id's

Constructors

FunBind	Function-like Binding FunBind is used for both functions `f x = e` and variables `f = x -> e` and strict variables `!x = x + 1` Reason 1: Special case for type inference: see `tcMonoBinds`. Reason 2: Instance decls can only have FunBinds, which is convenient. If you change this, you'll need to change e.g. rnMethodBinds But note that the form `f :: a->a = ...` parses as a pattern binding, just like `(f :: a -> a) = ...` Strict bindings have their strictness recorded in the `SrcStrictness` of their `MatchContext`. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind. `AnnKeywordId`s `AnnFunId`, attached to each element of fun_matches `AnnEqual`,`AnnWhere`, `AnnOpen`,`AnnClose`,
Fields fun_ext :: XFunBind idL idR fun_id :: LIdP idL fun_matches :: MatchGroup idR (LHsExpr idR) The payload
PatBind	Pattern Binding The pattern is never a simple variable; That case is done by FunBind. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind.
Fields pat_ext :: XPatBind idL idR pat_lhs :: LPat idL pat_rhs :: GRHSs idR (LHsExpr idR)
VarBind	Variable Binding Dictionary binding and suchlike. All VarBinds are introduced by the type checker
Fields var_ext :: XVarBind idL idR var_id :: IdP idL var_rhs :: LHsExpr idR Located only for consistency
PatSynBind	Patterns Synonym Binding
Fields (XPatSynBind idL idR) (PatSynBind idL idR) `AnnKeywordId` : `AnnPattern`, `AnnLarrow`,`AnnEqual`, `AnnWhere` `AnnOpen` `'{'`,`AnnClose` `'}'`
XHsBindsLR !(XXHsBindsLR idL idR)

Instances

Instances details

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]
HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]
type Anno (HsBindLR (GhcPass idL) (GhcPass idR))
Instance details Defined in GHC.Hs.Binds type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type LHsBindLR idL idR = XRec idL (HsBindLR idL idR) #

Located Haskell Binding with separate Left and Right identifier types

type LHsBindsLR idL idR = Bag (LHsBindLR idL idR) #

Located Haskell Bindings with separate Left and Right identifier types

type HsBind id = HsBindLR id id #

Haskell Binding

type LHsBinds id = LHsBindsLR id id #

Located Haskell Bindings

type LHsBind id = LHsBindLR id id #

Located Haskell Binding

data HsValBindsLR idL idR #

Haskell Value bindings with separate Left and Right identifier types (not implicit parameters) Used for both top level and nested bindings May contain pattern synonym bindings

Constructors

ValBinds (XValBinds idL idR) (LHsBindsLR idL idR) [LSig idR]

Value Bindings In

Before renaming RHS; idR is always RdrName Not dependency analysed Recursive by default

XValBindsLR !(XXValBindsLR idL idR)

Value Bindings Out

After renaming RHS; idR can be Name or Id Dependency analysed, later bindings in the list may depend on earlier ones.

Instances

Instances details

HiePass p => ToHie (RScoped (HsValBindsLR (GhcPass p) (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (HsValBindsLR (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

type HsValBinds id = HsValBindsLR id id #

Haskell Value Bindings

type LHsLocalBindsLR idL idR = XRec idL (HsLocalBindsLR idL idR) #

data HsLocalBindsLR idL idR #

Haskell Local Bindings with separate Left and Right identifier types

Bindings in a 'let' expression or a 'where' clause

Constructors

HsValBinds (XHsValBinds idL idR) (HsValBindsLR idL idR)	Haskell Value Bindings
HsIPBinds (XHsIPBinds idL idR) (HsIPBinds idR)	Haskell Implicit Parameter Bindings
EmptyLocalBinds (XEmptyLocalBinds idL idR)	Empty Local Bindings
XHsLocalBindsLR !(XXHsLocalBindsLR idL idR)

Instances

Instances details

HiePass p => ToHie (RScoped (HsLocalBinds (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (HsLocalBinds (GhcPass p)) -> HieM [HieAST Type]

type LHsLocalBinds id = XRec id (HsLocalBinds id) #

Located Haskell local bindings

type HsLocalBinds id = HsLocalBindsLR id id #

Haskell Local Bindings

data RoleAnnotDecl pass #

Role Annotation Declaration

Constructors

RoleAnnotDecl (XCRoleAnnotDecl pass) (LIdP pass) [XRec pass (Maybe Role)]	`AnnKeywordId` : `AnnType`, `AnnRole`
XRoleAnnotDecl !(XXRoleAnnotDecl pass)

Instances

Instances details

ToHie (LocatedA (RoleAnnotDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]
type Anno (RoleAnnotDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

type LRoleAnnotDecl pass = XRec pass (RoleAnnotDecl pass) #

Located Role Annotation Declaration

data AnnProvenance pass #

Annotation Provenance

Constructors

ValueAnnProvenance (LIdP pass)
TypeAnnProvenance (LIdP pass)
ModuleAnnProvenance

Instances

Instances details

ToHie (AnnProvenance GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: AnnProvenance GhcRn -> HieM [HieAST Type]

type LAnnDecl pass = XRec pass (AnnDecl pass) #

Located Annotation Declaration

data WarnDecl pass #

Warning pragma Declaration

Constructors

Warning (XWarning pass) [LIdP pass] (WarningTxt pass)
XWarnDecl !(XXWarnDecl pass)

Instances

Instances details

ToHie (LocatedA (WarnDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]
type Anno (WarnDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type LWarnDecl pass = XRec pass (WarnDecl pass) #

Located Warning pragma Declaration

data WarnDecls pass #

Warning pragma Declarations

Constructors

Warnings
Fields wd_ext :: XWarnings pass wd_warnings :: [LWarnDecl pass]
XWarnDecls !(XXWarnDecls pass)

Instances

Instances details

ToHie (LocatedA (WarnDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]
type Anno (WarnDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

type LWarnDecls pass = XRec pass (WarnDecls pass) #

Located Warning Declarations

data DocDecl pass #

Documentation comment Declaration

Constructors

DocCommentNext (LHsDoc pass)
DocCommentPrev (LHsDoc pass)
DocCommentNamed String (LHsDoc pass)
DocGroup Int (LHsDoc pass)

Instances

Instances details

(Data pass, Data (IdP pass)) => Data (DocDecl pass)
Instance details Defined in Language.Haskell.Syntax.Decls Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DocDecl pass -> c (DocDecl pass) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DocDecl pass) # toConstr :: DocDecl pass -> Constr # dataTypeOf :: DocDecl pass -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DocDecl pass)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DocDecl pass)) # gmapT :: (forall b. Data b => b -> b) -> DocDecl pass -> DocDecl pass # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl pass -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl pass -> r # gmapQ :: (forall d. Data d => d -> u) -> DocDecl pass -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DocDecl pass -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DocDecl pass -> m (DocDecl pass) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl pass -> m (DocDecl pass) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl pass -> m (DocDecl pass) #
ToHie (LocatedA (DocDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DocDecl GhcRn) -> HieM [HieAST Type]
type Anno (DocDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DocDecl (GhcPass p)) = SrcSpanAnnA

type LDocDecl pass = XRec pass (DocDecl pass) #

Located Documentation comment Declaration

type LRuleBndr pass = XRec pass (RuleBndr pass) #

Located Rule Binder

data RuleDecl pass #

Rule Declaration

Constructors

HsRule
Fields rd_ext :: XHsRule pass After renamer, free-vars from the LHS and RHS rd_name :: XRec pass RuleName Note [Pragma source text] in GHC.Types.Basic rd_act :: Activation rd_tyvs :: Maybe [LHsTyVarBndr () (NoGhcTc pass)] Forall'd type vars rd_tmvs :: [LRuleBndr pass] Forall'd term vars, before typechecking; after typechecking this includes all forall'd vars rd_lhs :: XRec pass (HsExpr pass) rd_rhs :: XRec pass (HsExpr pass) `AnnKeywordId` : `AnnOpen`,`AnnTilde`, `AnnVal`, `AnnClose`, `AnnForall`,`AnnDot`, `AnnEqual`,
XRuleDecl !(XXRuleDecl pass)

Instances

Instances details

ToHie (LocatedA (RuleDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]
type Anno (RuleDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

type LRuleDecl pass = XRec pass (RuleDecl pass) #

Located Rule Declaration

data RuleDecls pass #

Rule Declarations

Constructors

HsRules
Fields rds_ext :: XCRuleDecls pass rds_rules :: [LRuleDecl pass]
XRuleDecls !(XXRuleDecls pass)

Instances

Instances details

ToHie (LocatedA (RuleDecls GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]
type Anno (RuleDecls (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

type LRuleDecls pass = XRec pass (RuleDecls pass) #

Located Rule Declarations

data ForeignExport pass #

Constructors

CExport (XCExport pass) (XRec pass CExportSpec)
XForeignExport !(XXForeignExport pass)

Instances

Instances details

ToHie (ForeignExport GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: ForeignExport GhcRn -> HieM [HieAST Type]

data CImportSpec #

Constructors

CLabel CLabelString
CFunction CCallTarget
CWrapper

Instances

Instances details

Data CImportSpec

Instance details

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CImportSpec -> c CImportSpec #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CImportSpec #

toConstr :: CImportSpec -> Constr #

dataTypeOf :: CImportSpec -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> CImportSpec -> CImportSpec #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r #

gmapQ :: (forall d. Data d => d -> u) -> CImportSpec -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> CImportSpec -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec #

data ForeignImport pass #

Constructors

CImport (XCImport pass) (XRec pass CCallConv) (XRec pass Safety) (Maybe Header) CImportSpec
XForeignImport !(XXForeignImport pass)

Instances

Instances details

ToHie (ForeignImport GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: ForeignImport GhcRn -> HieM [HieAST Type]

data ForeignDecl pass #

Foreign Declaration

Constructors

ForeignImport
Fields fd_i_ext :: XForeignImport pass fd_name :: LIdP pass fd_sig_ty :: LHsSigType pass fd_fi :: ForeignImport pass
ForeignExport	`AnnKeywordId` : `AnnForeign`, `AnnImport`,`AnnExport`, `AnnDcolon`
Fields fd_e_ext :: XForeignExport pass fd_name :: LIdP pass fd_sig_ty :: LHsSigType pass fd_fe :: ForeignExport pass
XForeignDecl !(XXForeignDecl pass)

Instances

Instances details

ToHie (LocatedA (ForeignDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]
type Anno (ForeignDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

type LForeignDecl pass = XRec pass (ForeignDecl pass) #

Located Foreign Declaration

data DefaultDecl pass #

Default Declaration

Constructors

DefaultDecl (XCDefaultDecl pass) [LHsType pass]	`AnnKeywordId`s : `AnnDefault`, `AnnOpen`,`AnnClose`
XDefaultDecl !(XXDefaultDecl pass)

Instances

Instances details

ToHie (LocatedA (DefaultDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]
type Anno (DefaultDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

type LDefaultDecl pass = XRec pass (DefaultDecl pass) #

Located Default Declaration

type LDerivStrategy pass = XRec pass (DerivStrategy pass) #

A Located DerivStrategy.

data DerivDecl pass #

Stand-alone 'deriving instance' declaration

Constructors

DerivDecl
Fields deriv_ext :: XCDerivDecl pass deriv_type :: LHsSigWcType pass The instance type to derive. It uses an `LHsSigWcType` because the context is allowed to be a single wildcard: deriving instance _ => Eq (Foo a) Which signifies that the context should be inferred. deriv_strategy :: Maybe (LDerivStrategy pass) deriv_overlap_mode :: Maybe (XRec pass OverlapMode) `AnnKeywordId` : `AnnDeriving`, `AnnInstance`, `AnnStock`, `AnnAnyClass`, `AnnNewtype`, `AnnOpen`,`AnnClose`
XDerivDecl !(XXDerivDecl pass)

Instances

Instances details

ToHie (LocatedA (DerivDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]
type Anno (DerivDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

type LDerivDecl pass = XRec pass (DerivDecl pass) #

Located stand-alone 'deriving instance' declaration

data InstDecl pass #

Instance Declaration

Constructors

ClsInstD
Fields cid_d_ext :: XClsInstD pass cid_inst :: ClsInstDecl pass
DataFamInstD
Fields dfid_ext :: XDataFamInstD pass dfid_inst :: DataFamInstDecl pass
TyFamInstD
Fields tfid_ext :: XTyFamInstD pass tfid_inst :: TyFamInstDecl pass
XInstDecl !(XXInstDecl pass)

Instances

Instances details

ToHie (LocatedA (InstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]
type Anno (InstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

type LInstDecl pass = XRec pass (InstDecl pass) #

Located Instance Declaration

data ClsInstDecl pass #

Class Instance Declaration - AnnKeywordId : AnnInstance, AnnWhere, AnnOpen,AnnClose, For details on above see Note [exact print annotations] in GHC.Parser.Annotation

Constructors

ClsInstDecl
Fields cid_ext :: XCClsInstDecl pass cid_poly_ty :: LHsSigType pass cid_binds :: LHsBinds pass cid_sigs :: [LSig pass] cid_tyfam_insts :: [LTyFamInstDecl pass] cid_datafam_insts :: [LDataFamInstDecl pass] cid_overlap_mode :: Maybe (XRec pass OverlapMode) `AnnKeywordId` : `AnnOpen`, `AnnClose`,
XClsInstDecl !(XXClsInstDecl pass)

Instances

Instances details

ToHie (LocatedA (ClsInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]
type Anno (ClsInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

type LClsInstDecl pass = XRec pass (ClsInstDecl pass) #

Located Class Instance Declaration

data FamEqn pass rhs #

Family Equation

One equation in a type family instance declaration, data family instance declaration, or type family default. See Note [Type family instance declarations in HsSyn] See Note [Family instance declaration binders]

Constructors

FamEqn
Fields feqn_ext :: XCFamEqn pass rhs feqn_tycon :: LIdP pass feqn_bndrs :: HsOuterFamEqnTyVarBndrs pass Optional quantified type vars feqn_pats :: HsTyPats pass feqn_fixity :: LexicalFixity Fixity used in the declaration feqn_rhs :: rhs `AnnKeywordId` : `AnnEqual`
XFamEqn !(XXFamEqn pass rhs)

Instances

Instances details

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]
ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]
(HasLoc a, HiePass p) => HasLoc (FamEqn (GhcPass p) a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: FamEqn (GhcPass p) a -> SrcSpan
(ToHie rhs, HasLoc rhs) => ToHie (FamEqn GhcRn rhs)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: FamEqn GhcRn rhs -> HieM [HieAST Type]
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (FamEqn (GhcPass p) _1)
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA
type Anno (FamEqn p (LocatedA (HsType p)))
Instance details Defined in GHC.Hs.Decls type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

newtype DataFamInstDecl pass #

Data Family Instance Declaration

Constructors

DataFamInstDecl	`AnnKeywordId` : `AnnData`, `AnnNewType`,`AnnInstance`, `AnnDcolon` `AnnWhere`,`AnnOpen`, `AnnClose`
Fields dfid_eqn :: FamEqn pass (HsDataDefn pass)

Instances

Instances details

ToHie (LocatedA (DataFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]
type Anno (DataFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

type LDataFamInstDecl pass = XRec pass (DataFamInstDecl pass) #

Located Data Family Instance Declaration

data TyFamInstDecl pass #

Type Family Instance Declaration

Constructors

TyFamInstDecl	`AnnKeywordId` : `AnnType`, `AnnInstance`,
Fields tfid_xtn :: XCTyFamInstDecl pass tfid_eqn :: TyFamInstEqn pass
XTyFamInstDecl !(XXTyFamInstDecl pass)

Instances

Instances details

ToHie (LocatedA (TyFamInstDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]
type Anno (TyFamInstDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type LTyFamInstDecl pass = XRec pass (TyFamInstDecl pass) #

Located Type Family Instance Declaration

type LTyFamDefltDecl pass = XRec pass (TyFamDefltDecl pass) #

Located type family default declarations.

type TyFamDefltDecl = TyFamInstDecl #

Type family default declarations. A convenient synonym for TyFamInstDecl. See Note [Type family instance declarations in HsSyn].

type TyFamInstEqn pass = FamEqn pass (LHsType pass) #

Type Family Instance Equation

type HsTyPats pass = [LHsTypeArg pass] #

Haskell Type Patterns

type LTyFamInstEqn pass #

Arguments

= XRec pass (TyFamInstEqn pass)

May have AnnKeywordId : AnnSemi when in a list

Located Type Family Instance Equation

data HsConDeclGADTDetails pass #

The arguments in a GADT constructor. Unlike Haskell98-style constructors, GADT constructors cannot be declared with infix syntax. As a result, we do not use HsConDetails here, as InfixCon would be an unrepresentable state. (There is a notion of infix GADT constructors for the purposes of derived Show instances—see Note [Infix GADT constructors] in GHC.Tc.TyCl—but that is an orthogonal concern.)

Constructors

PrefixConGADT [HsScaled pass (LBangType pass)]
RecConGADT (XRec pass [LConDeclField pass]) (LHsUniToken "->" "\8594" pass)

Instances

Instances details

ToHie (HsConDeclGADTDetails GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsConDeclGADTDetails GhcRn -> HieM [HieAST Type]

type HsConDeclH98Details pass = HsConDetails Void (HsScaled pass (LBangType pass)) (XRec pass [LConDeclField pass]) #

The arguments in a Haskell98-style data constructor.

data ConDecl pass #

data T b = forall a. Eq a => MkT a b
  MkT :: forall b a. Eq a => MkT a b

data T b where
     MkT1 :: Int -> T Int

data T = Int MkT Int
       | MkT2

data T a where
     Int MkT Int :: T Int

AnnKeywordIds : AnnOpen, AnnDotdot,AnnCLose, AnnEqual,AnnVbar, AnnDarrow,AnnDarrow, AnnForall,AnnDot

data Constructor Declaration

Constructors

ConDeclGADT
Fields con_g_ext :: XConDeclGADT pass con_names :: NonEmpty (LIdP pass) con_dcolon :: !(LHsUniToken "::" "\8759" pass) con_bndrs :: XRec pass (HsOuterSigTyVarBndrs pass) The outermost type variable binders, be they explicit or implicit. The `XRec` is used to anchor exact print annotations, AnnForall and AnnDot. con_mb_cxt :: Maybe (LHsContext pass) User-written context (if any) con_g_args :: HsConDeclGADTDetails pass Arguments; never infix con_res_ty :: LHsType pass Result type con_doc :: Maybe (LHsDoc pass) A possible Haddock comment.
ConDeclH98
Fields con_ext :: XConDeclH98 pass con_name :: LIdP pass con_forall :: Bool True = explicit user-written forall e.g. data T a = forall b. MkT b (b->a) con_ex_tvs = {b} False => con_ex_tvs is empty con_ex_tvs :: [LHsTyVarBndr Specificity pass] Existentials only con_mb_cxt :: Maybe (LHsContext pass) User-written context (if any) con_args :: HsConDeclH98Details pass Arguments; can be infix con_doc :: Maybe (LHsDoc pass) A possible Haddock comment.
XConDecl !(XXConDecl pass)

Instances

Instances details

ToHie (LocatedA (ConDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]
type Anno (ConDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

type LConDecl pass #

Arguments

= XRec pass (ConDecl pass)

May have AnnKeywordId : AnnSemi when in a GADT constructor list

Located data Constructor Declaration

data DataDefnCons a #

Whether a data-type declaration is data or newtype, and its constructors.

Constructors

NewTypeCon a
DataTypeCons Bool [a]

Instances

Instances details

Foldable DataDefnCons
Instance details Defined in Language.Haskell.Syntax.Decls Methods fold :: Monoid m => DataDefnCons m -> m # foldMap :: Monoid m => (a -> m) -> DataDefnCons a -> m # foldMap' :: Monoid m => (a -> m) -> DataDefnCons a -> m # foldr :: (a -> b -> b) -> b -> DataDefnCons a -> b # foldr' :: (a -> b -> b) -> b -> DataDefnCons a -> b # foldl :: (b -> a -> b) -> b -> DataDefnCons a -> b # foldl' :: (b -> a -> b) -> b -> DataDefnCons a -> b # foldr1 :: (a -> a -> a) -> DataDefnCons a -> a # foldl1 :: (a -> a -> a) -> DataDefnCons a -> a # toList :: DataDefnCons a -> [a] # null :: DataDefnCons a -> Bool # length :: DataDefnCons a -> Int # elem :: Eq a => a -> DataDefnCons a -> Bool # maximum :: Ord a => DataDefnCons a -> a # minimum :: Ord a => DataDefnCons a -> a # sum :: Num a => DataDefnCons a -> a # product :: Num a => DataDefnCons a -> a #
Traversable DataDefnCons
Instance details Defined in Language.Haskell.Syntax.Decls Methods traverse :: Applicative f => (a -> f b) -> DataDefnCons a -> f (DataDefnCons b) # sequenceA :: Applicative f => DataDefnCons (f a) -> f (DataDefnCons a) # mapM :: Monad m => (a -> m b) -> DataDefnCons a -> m (DataDefnCons b) # sequence :: Monad m => DataDefnCons (m a) -> m (DataDefnCons a) #
Functor DataDefnCons
Instance details Defined in Language.Haskell.Syntax.Decls Methods fmap :: (a -> b) -> DataDefnCons a -> DataDefnCons b # (<$) :: a -> DataDefnCons b -> DataDefnCons a #
Data a => Data (DataDefnCons a)
Instance details Defined in Language.Haskell.Syntax.Decls Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataDefnCons a -> c (DataDefnCons a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (DataDefnCons a) # toConstr :: DataDefnCons a -> Constr # dataTypeOf :: DataDefnCons a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (DataDefnCons a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (DataDefnCons a)) # gmapT :: (forall b. Data b => b -> b) -> DataDefnCons a -> DataDefnCons a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataDefnCons a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataDefnCons a -> r # gmapQ :: (forall d. Data d => d -> u) -> DataDefnCons a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> DataDefnCons a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataDefnCons a -> m (DataDefnCons a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDefnCons a -> m (DataDefnCons a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDefnCons a -> m (DataDefnCons a) #
HasLoc a => HasLoc (DataDefnCons a)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: DataDefnCons a -> SrcSpan
ToHie a => ToHie (DataDefnCons a)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: DataDefnCons a -> HieM [HieAST Type]
Eq a => Eq (DataDefnCons a)
Instance details Defined in Language.Haskell.Syntax.Decls Methods (==) :: DataDefnCons a -> DataDefnCons a -> Bool # (/=) :: DataDefnCons a -> DataDefnCons a -> Bool #

data NewOrData #

When we only care whether a data-type declaration is `data` or `newtype`, but not what constructors it has

Constructors

NewType	newtype Blah ...
DataType	data Blah ...

Instances

Instances details

Data NewOrData
Instance details Defined in Language.Haskell.Syntax.Decls Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NewOrData -> c NewOrData # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NewOrData # toConstr :: NewOrData -> Constr # dataTypeOf :: NewOrData -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NewOrData) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NewOrData) # gmapT :: (forall b. Data b => b -> b) -> NewOrData -> NewOrData # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r # gmapQ :: (forall d. Data d => d -> u) -> NewOrData -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NewOrData -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData #
Eq NewOrData
Instance details Defined in Language.Haskell.Syntax.Decls Methods (==) :: NewOrData -> NewOrData -> Bool # (/=) :: NewOrData -> NewOrData -> Bool #

data StandaloneKindSig pass #

Constructors

StandaloneKindSig (XStandaloneKindSig pass) (LIdP pass) (LHsSigType pass)
XStandaloneKindSig !(XXStandaloneKindSig pass)

Instances

Instances details

ToHie (LocatedA (StandaloneKindSig GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]
ToHie (StandaloneKindSig GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: StandaloneKindSig GhcRn -> HieM [HieAST Type]
type Anno (StandaloneKindSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

type LStandaloneKindSig pass = XRec pass (StandaloneKindSig pass) #

Located Standalone Kind Signature

data DerivClauseTys pass #

The types mentioned in a single deriving clause. This can come in two forms, DctSingle or DctMulti, depending on whether the types are surrounded by enclosing parentheses or not. These parentheses are semantically different than HsParTy. For example, deriving () means "derive zero classes" rather than "derive an instance of the 0-tuple".

DerivClauseTys use LHsSigType because deriving clauses can mention type variables that aren't bound by the datatype, e.g.

data T b = ... deriving (C [a])

should produce a derived instance for C [a] (T b).

Constructors

DctSingle (XDctSingle pass) (LHsSigType pass)

A deriving clause with a single type. Moreover, that type can only be a type constructor without any arguments.

Example: deriving Eq

DctMulti (XDctMulti pass) [LHsSigType pass]

A deriving clause with a comma-separated list of types, surrounded by enclosing parentheses.

Example: deriving (Eq, C a)

XDerivClauseTys !(XXDerivClauseTys pass)

Instances

Instances details

ToHie (LocatedC (DerivClauseTys GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]
type Anno (DerivClauseTys (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

type LDerivClauseTys pass = XRec pass (DerivClauseTys pass) #

data HsDerivingClause pass #

A single deriving clause of a data declaration.

AnnKeywordId : AnnDeriving, AnnStock, AnnAnyClass, AnnNewtype, AnnOpen,AnnClose

Constructors

HsDerivingClause
Fields deriv_clause_ext :: XCHsDerivingClause pass deriv_clause_strategy :: Maybe (LDerivStrategy pass) The user-specified strategy (if any) to use when deriving `deriv_clause_tys`. deriv_clause_tys :: LDerivClauseTys pass The types to derive.
XHsDerivingClause !(XXHsDerivingClause pass)

Instances

Instances details

ToHie (Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)])
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: Located [LocatedAn NoEpAnns (HsDerivingClause GhcRn)] -> HieM [HieAST Type]
ToHie (LocatedAn NoEpAnns (HsDerivingClause GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsDerivingClause GhcRn) -> HieM [HieAST Type]
type Anno (HsDerivingClause (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (HsDerivingClause (GhcPass p)) = SrcAnn NoEpAnns

type LHsDerivingClause pass = XRec pass (HsDerivingClause pass) #

type HsDeriving pass #

Arguments

= [LHsDerivingClause pass]

The optional deriving clauses of a data declaration. Clauses is plural because one can specify multiple deriving clauses using the -XDerivingStrategies language extension.

The list of LHsDerivingClauses corresponds to exactly what the user requested to derive, in order. If no deriving clauses were specified, the list is empty.

Haskell Deriving clause

data HsDataDefn pass #

Haskell Data type Definition

Constructors

HsDataDefn	Declares a data type or newtype, giving its constructors `data/newtype T a = constrs data/newtype instance T [a] = constrs`
Fields dd_ext :: XCHsDataDefn pass dd_ctxt :: Maybe (LHsContext pass) Context dd_cType :: Maybe (XRec pass CType) dd_kindSig :: Maybe (LHsKind pass) Optional kind signature. `(Just k)` for a GADT-style `data`, or `data instance` decl, with explicit kind sig Always `Nothing` for H98-syntax decls dd_cons :: DataDefnCons (LConDecl pass) Data constructors For `data T a = T1 \| T2 a` the `LConDecl`s all have `ConDeclH98`. For `data T a where { T1 :: T a }` the `LConDecls` all have `ConDeclGADT`. dd_derivs :: HsDeriving pass Optional 'deriving' clause
XHsDataDefn !(XXHsDataDefn pass)

Instances

Instances details

HasLoc (HsDataDefn GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods loc :: HsDataDefn GhcRn -> SrcSpan
ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]
ToHie (HsDataDefn GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsDataDefn GhcRn -> HieM [HieAST Type]

data FamilyInfo pass #

Constructors

DataFamily
OpenTypeFamily
ClosedTypeFamily (Maybe [LTyFamInstEqn pass])	`Nothing` if we're in an hs-boot file and the user said "type family Foo x where .."

Instances

Instances details

ToHie (FamilyInfo GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: FamilyInfo GhcRn -> HieM [HieAST Type]

type LInjectivityAnn pass = XRec pass (InjectivityAnn pass) #

Located Injectivity Annotation

data FamilyDecl pass #

type Family Declaration

Constructors

FamilyDecl
Fields fdExt :: XCFamilyDecl pass fdInfo :: FamilyInfo pass fdTopLevel :: TopLevelFlag fdLName :: LIdP pass fdTyVars :: LHsQTyVars pass fdFixity :: LexicalFixity fdResultSig :: LFamilyResultSig pass fdInjectivityAnn :: Maybe (LInjectivityAnn pass)
XFamilyDecl !(XXFamilyDecl pass)	`AnnKeywordId` : `AnnType`, `AnnData`, `AnnFamily`, `AnnWhere`, `AnnOpenP`, `AnnDcolon`, `AnnCloseP`, `AnnEqual`, `AnnRarrow`, `AnnVbar`

Instances

Instances details

ToHie (LocatedA (FamilyDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]
type Anno (FamilyDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

type LFamilyDecl pass = XRec pass (FamilyDecl pass) #

Located type Family Declaration

data FamilyResultSig pass #

type Family Result Signature

Constructors

NoSig (XNoSig pass)	`AnnKeywordId` :
KindSig (XCKindSig pass) (LHsKind pass)	`AnnKeywordId` : `AnnOpenP`,`AnnDcolon`, `AnnCloseP`
TyVarSig (XTyVarSig pass) (LHsTyVarBndr () pass)	`AnnKeywordId` : `AnnOpenP`,`AnnDcolon`, `AnnCloseP`, `AnnEqual`
XFamilyResultSig !(XXFamilyResultSig pass)

Instances

Instances details

ToHie (RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedAn NoEpAnns (FamilyResultSig GhcRn)) -> HieM [HieAST Type]
type Anno (FamilyResultSig (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (FamilyResultSig (GhcPass p)) = SrcAnn NoEpAnns

type LFamilyResultSig pass = XRec pass (FamilyResultSig pass) #

Located type Family Result Signature

data TyClGroup pass #

Type or Class Group

Constructors

TyClGroup
Fields group_ext :: XCTyClGroup pass group_tyclds :: [LTyClDecl pass] group_roles :: [LRoleAnnotDecl pass] group_kisigs :: [LStandaloneKindSig pass] group_instds :: [LInstDecl pass]
XTyClGroup !(XXTyClGroup pass)

Instances

Instances details

ToHie (TyClGroup GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: TyClGroup GhcRn -> HieM [HieAST Type]

type LHsFunDep pass = XRec pass (FunDep pass) #

data TyClDecl pass #

A type or class declaration.

Constructors

FamDecl	type/data family T :: -> `AnnKeywordId` : `AnnType`, `AnnData`, `AnnFamily`,`AnnDcolon`, `AnnWhere`,`AnnOpenP`, `AnnDcolon`,`AnnCloseP`, `AnnEqual`,`AnnRarrow`, `AnnVbar`
Fields tcdFExt :: XFamDecl pass tcdFam :: FamilyDecl pass
SynDecl	`type` declaration `AnnKeywordId` : `AnnType`, `AnnEqual`,
Fields tcdSExt :: XSynDecl pass Post renamer, FVs tcdLName :: LIdP pass Type constructor tcdTyVars :: LHsQTyVars pass Type variables; for an associated type these include outer binders tcdFixity :: LexicalFixity Fixity used in the declaration tcdRhs :: LHsType pass RHS of type declaration
DataDecl	`data` declaration `AnnKeywordId` : `AnnData`, `AnnFamily`, `AnnNewType`, `AnnNewType`,`AnnDcolon` `AnnWhere`,
Fields tcdDExt :: XDataDecl pass Post renamer, CUSK flag, FVs tcdLName :: LIdP pass Type constructor tcdTyVars :: LHsQTyVars pass Type variables; for an associated type these include outer binders tcdFixity :: LexicalFixity Fixity used in the declaration tcdDataDefn :: HsDataDefn pass
ClassDecl	`AnnKeywordId` : `AnnClass`, `AnnWhere`,`AnnOpen`, `AnnClose` The tcdFDs will have `AnnVbar`, `AnnComma` `AnnRarrow` For details on above see Note [exact print annotations] in GHC.Parser.Annotation
Fields tcdCExt :: XClassDecl pass Post renamer, FVs tcdLayout :: !(LayoutInfo pass) Explicit or virtual braces See Note [Class LayoutInfo] tcdCtxt :: Maybe (LHsContext pass) Context... tcdLName :: LIdP pass Type constructor tcdTyVars :: LHsQTyVars pass Type variables; for an associated type these include outer binders tcdFixity :: LexicalFixity Fixity used in the declaration tcdFDs :: [LHsFunDep pass] Functional deps tcdSigs :: [LSig pass] Methods' signatures tcdMeths :: LHsBinds pass Default methods tcdATs :: [LFamilyDecl pass] Associated types; tcdATDefs :: [LTyFamDefltDecl pass] Associated type defaults tcdDocs :: [LDocDecl pass] Haddock docs
XTyClDecl !(XXTyClDecl pass)

Instances

Instances details

ToHie (LocatedA (TyClDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]
type Anno (TyClDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

type LTyClDecl pass = XRec pass (TyClDecl pass) #

Located Declaration of a Type or Class

data SpliceDecoration #

A splice can appear with various decorations wrapped around it. This data type captures explicitly how it was originally written, for use in the pretty printer.

Constructors

DollarSplice	$splice
BareSplice	bare splice

Instances

Instances details

Data SpliceDecoration
Instance details Defined in Language.Haskell.Syntax.Decls Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpliceDecoration -> c SpliceDecoration # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SpliceDecoration # toConstr :: SpliceDecoration -> Constr # dataTypeOf :: SpliceDecoration -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SpliceDecoration) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SpliceDecoration) # gmapT :: (forall b. Data b => b -> b) -> SpliceDecoration -> SpliceDecoration # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpliceDecoration -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpliceDecoration -> r # gmapQ :: (forall d. Data d => d -> u) -> SpliceDecoration -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> SpliceDecoration -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration #
Show SpliceDecoration
Instance details Defined in Language.Haskell.Syntax.Decls Methods showsPrec :: Int -> SpliceDecoration -> ShowS # show :: SpliceDecoration -> String # showList :: [SpliceDecoration] -> ShowS #
Eq SpliceDecoration
Instance details Defined in Language.Haskell.Syntax.Decls Methods (==) :: SpliceDecoration -> SpliceDecoration -> Bool # (/=) :: SpliceDecoration -> SpliceDecoration -> Bool #

data SpliceDecl p #

Splice Declaration

Constructors

SpliceDecl (XSpliceDecl p) (XRec p (HsUntypedSplice p)) SpliceDecoration
XSpliceDecl !(XXSpliceDecl p)

Instances

Instances details

ToHie (LocatedA (SpliceDecl GhcRn))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]
type Anno (SpliceDecl (GhcPass p))
Instance details Defined in GHC.Hs.Decls type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

type LSpliceDecl pass = XRec pass (SpliceDecl pass) #

Located Splice Declaration

data HsGroup p #

Haskell Group

A HsDecl is categorised into a HsGroup before being fed to the renamer.

Constructors

HsGroup
Fields hs_ext :: XCHsGroup p hs_valds :: HsValBinds p hs_splcds :: [LSpliceDecl p] hs_tyclds :: [TyClGroup p] hs_derivds :: [LDerivDecl p] hs_fixds :: [LFixitySig p] hs_defds :: [LDefaultDecl p] hs_fords :: [LForeignDecl p] hs_warnds :: [LWarnDecls p] hs_annds :: [LAnnDecl p] hs_ruleds :: [LRuleDecls p] hs_docs :: [LDocDecl p]
XHsGroup !(XXHsGroup p)

data HsDecl p #

A Haskell Declaration

Constructors

TyClD (XTyClD p) (TyClDecl p)	Type or Class Declaration
InstD (XInstD p) (InstDecl p)	Instance declaration
DerivD (XDerivD p) (DerivDecl p)	Deriving declaration
ValD (XValD p) (HsBind p)	Value declaration
SigD (XSigD p) (Sig p)	Signature declaration
KindSigD (XKindSigD p) (StandaloneKindSig p)	Standalone kind signature
DefD (XDefD p) (DefaultDecl p)	'default' declaration
ForD (XForD p) (ForeignDecl p)	Foreign declaration
WarningD (XWarningD p) (WarnDecls p)	Warning declaration
AnnD (XAnnD p) (AnnDecl p)	Annotation declaration
RuleD (XRuleD p) (RuleDecls p)	Rule declaration
SpliceD (XSpliceD p) (SpliceDecl p)	Splice declaration (Includes quasi-quotes)
DocD (XDocD p) (DocDecl p)	Documentation comment declaration
RoleAnnotD (XRoleAnnotD p) (RoleAnnotDecl p)	Role annotation declaration
XHsDecl !(XXHsDecl p)

Instances

Instances details

type Anno (HsDecl (GhcPass _1))
Instance details Defined in GHC.Hs.Decls type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

type LHsDecl p #

Arguments

= XRec p (HsDecl p)

When in a list this may have

AnnKeywordId : AnnSemi

data HsDoFlavour #

Constructors

DoExpr (Maybe ModuleName)	ModuleName. do { ... }
MDoExpr (Maybe ModuleName)	ModuleName. mdo { ... } ie recursive do-expression
GhciStmtCtxt	A command-line Stmt in GHCi pat <- rhs
ListComp
MonadComp

data HsArrowMatchContext #

Haskell arrow match context.

Constructors

ProcExpr	A proc expression
ArrowCaseAlt	A case alternative inside arrow notation
ArrowLamCaseAlt LamCaseVariant	A case or cases alternative inside arrow notation
KappaExpr	An arrow kappa abstraction

data HsStmtContext p #

Haskell Statement Context.

Constructors

HsDoStmt HsDoFlavour	Context for HsDo (do-notation and comprehensions)
PatGuard (HsMatchContext p)	Pattern guard for specified thing
ParStmtCtxt (HsStmtContext p)	A branch of a parallel stmt
TransStmtCtxt (HsStmtContext p)	A branch of a transform stmt
ArrowExpr	do-notation in an arrow-command context

Instances

Instances details

HiePass p => ToHie (HsStmtContext (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsStmtContext (GhcPass p) -> HieM [HieAST Type]

data HsMatchContext p #

Haskell Match Context

Context of a pattern match. This is more subtle than it would seem. See Note [FunBind vs PatBind].

Constructors

FunRhs	A pattern matching on an argument of a function binding
Fields mc_fun :: LIdP (NoGhcTc p) function binder of `f` See Note [mc_fun field of FunRhs] See #20415 for a long discussion about this field and why it uses NoGhcTc. mc_fixity :: LexicalFixity fixing of `f` mc_strictness :: SrcStrictness was `f` banged? See Note [FunBind vs PatBind]
LambdaExpr	Patterns of a lambda
CaseAlt	Patterns and guards in a case alternative
LamCaseAlt LamCaseVariant	Patterns and guards in `case` and `cases`
IfAlt	Guards of a multi-way if alternative
ArrowMatchCtxt HsArrowMatchContext	A pattern match inside arrow notation
PatBindRhs	A pattern binding eg [y] <- e = e
PatBindGuards	Guards of pattern bindings, e.g., (Just b) \| Just _ <- x = e \| otherwise = e'
RecUpd	Record update [used only in GHC.HsToCore.Expr to tell matchWrapper what sort of runtime error message to generate]
StmtCtxt (HsStmtContext p)	Pattern of a do-stmt, list comprehension, pattern guard, etc
ThPatSplice	A Template Haskell pattern splice
ThPatQuote	A Template Haskell pattern quotation [p\| (a,b) \|]
PatSyn	A pattern synonym declaration

Instances

Instances details

HiePass p => ToHie (HsMatchContext (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsMatchContext (GhcPass p) -> HieM [HieAST Type]

data PatSyn #

Pattern Synonym

See Note [Pattern synonym representation] See Note [Pattern synonym signature contexts]

Instances

Instances details

Data PatSyn
Instance details Defined in GHC.Core.PatSyn Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> PatSyn -> c PatSyn # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c PatSyn # toConstr :: PatSyn -> Constr # dataTypeOf :: PatSyn -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c PatSyn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c PatSyn) # gmapT :: (forall b. Data b => b -> b) -> PatSyn -> PatSyn # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> PatSyn -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> PatSyn -> r # gmapQ :: (forall d. Data d => d -> u) -> PatSyn -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> PatSyn -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> PatSyn -> m PatSyn # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSyn -> m PatSyn # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> PatSyn -> m PatSyn #
NamedThing PatSyn
Instance details Defined in GHC.Core.PatSyn Methods getOccName :: PatSyn -> OccName # getName :: PatSyn -> Name #
Uniquable PatSyn
Instance details Defined in GHC.Core.PatSyn Methods getUnique :: PatSyn -> Unique #
Outputable PatSyn
Instance details Defined in GHC.Core.PatSyn Methods ppr :: PatSyn -> SDoc #
OutputableBndr PatSyn
Instance details Defined in GHC.Core.PatSyn Methods pprBndr :: BindingSite -> PatSyn -> SDoc # pprPrefixOcc :: PatSyn -> SDoc # pprInfixOcc :: PatSyn -> SDoc # bndrIsJoin_maybe :: PatSyn -> Maybe Int #
Eq PatSyn
Instance details Defined in GHC.Core.PatSyn Methods (==) :: PatSyn -> PatSyn -> Bool # (/=) :: PatSyn -> PatSyn -> Bool #

data ArithSeqInfo id #

Arithmetic Sequence Information

Constructors

From (LHsExpr id)
FromThen (LHsExpr id) (LHsExpr id)
FromTo (LHsExpr id) (LHsExpr id)
FromThenTo (LHsExpr id) (LHsExpr id) (LHsExpr id)

Instances

Instances details

ToHie (LHsExpr a) => ToHie (ArithSeqInfo a)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: ArithSeqInfo a -> HieM [HieAST Type]

data HsQuote p #

Haskell (Untyped) Quote = Expr + Pat + Type + Var

Constructors

ExpBr (XExpBr p) (LHsExpr p)
PatBr (XPatBr p) (LPat p)
DecBrL (XDecBrL p) [LHsDecl p]
DecBrG (XDecBrG p) (HsGroup p)
TypBr (XTypBr p) (LHsType p)
VarBr (XVarBr p) Bool (LIdP p)
XQuote !(XXQuote p)

Instances

Instances details

ToHie (HsQuote GhcRn)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsQuote GhcRn -> HieM [HieAST Type]

data ApplicativeArg idL #

Applicative Argument

Constructors

ApplicativeArgOne
Fields xarg_app_arg_one :: XApplicativeArgOne idL The fail operator, after renaming The fail operator is needed if this is a BindStmt where the pattern can fail. E.g.: (Just a) <- stmt The fail operator will be invoked if the pattern match fails. It is also used for guards in MonadComprehensions. The fail operator is Nothing if the pattern match can't fail app_arg_pattern :: LPat idL arg_expr :: LHsExpr idL is_body_stmt :: Bool True = was a BodyStmt, False = was a BindStmt. See Note [Applicative BodyStmt]
ApplicativeArgMany
Fields xarg_app_arg_many :: XApplicativeArgMany idL app_stmts :: [ExprLStmt idL] final_expr :: HsExpr idL bv_pattern :: LPat idL stmt_context :: HsDoFlavour context of the do expression, used in pprArg
XApplicativeArg !(XXApplicativeArg idL)

Instances

Instances details

HiePass p => ToHie (RScoped (ApplicativeArg (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (ApplicativeArg (GhcPass p)) -> HieM [HieAST Type]

type FailOperator id = Maybe (SyntaxExpr id) #

The fail operator

This is used for `.. <-` "bind statements" in do notation, including non-monadic "binds" in applicative.

The fail operator is 'Just expr' if it potentially fail monadically. if the pattern match cannot fail, or shouldn't fail monadically (regular incomplete pattern exception), it is Nothing.

See Note [Monad fail : Rebindable syntax, overloaded strings] for the type of expression in the Just case, and why it is so.

See Note [Failing pattern matches in Stmts] for which contexts for 'BindStmt's should use the monadic fail and which shouldn't.

data ParStmtBlock idL idR #

Parenthesised Statement Block

Constructors

ParStmtBlock (XParStmtBlock idL idR) [ExprLStmt idL] [IdP idR] (SyntaxExpr idR)
XParStmtBlock !(XXParStmtBlock idL idR)

data TransForm #

Constructors

ThenForm
GroupForm

Instances

Instances details

Data TransForm

Instance details

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TransForm -> c TransForm #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TransForm #

toConstr :: TransForm -> Constr #

dataTypeOf :: TransForm -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> TransForm -> TransForm #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TransForm -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TransForm -> r #

gmapQ :: (forall d. Data d => d -> u) -> TransForm -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> TransForm -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm #

data StmtLR idL idR body #

Exact print annotations when in qualifier lists or guards - AnnKeywordId : AnnVbar, AnnComma,AnnThen, AnnBy,AnnBy, AnnGroup,AnnUsing

Constructors

LastStmt (XLastStmt idL idR body) body (Maybe Bool) (SyntaxExpr idR)
BindStmt
Fields (XBindStmt idL idR body) Post renaming has optional fail and bind / (>>=) operator. Post typechecking, also has multiplicity of the argument and the result type of the function passed to bind; that is, (P, S) in (>>=) :: Q -> (R % P -> S) -> T See Note [The type of bind in Stmts] (LPat idL) body
ApplicativeStmt (XApplicativeStmt idL idR body) [(SyntaxExpr idR, ApplicativeArg idL)] (Maybe (SyntaxExpr idR))	`ApplicativeStmt` represents an applicative expression built with `<$>` and `<*>`. It is generated by the renamer, and is desugared into the appropriate applicative expression by the desugarer, but it is intended to be invisible in error messages. For full details, see Note [ApplicativeDo] in GHC.Rename.Expr
BodyStmt (XBodyStmt idL idR body) body (SyntaxExpr idR) (SyntaxExpr idR)
LetStmt (XLetStmt idL idR body) (HsLocalBindsLR idL idR)	`AnnKeywordId` : `AnnLet` `AnnOpen` `'{'`,`AnnClose` `'}'`,
ParStmt (XParStmt idL idR body) [ParStmtBlock idL idR] (HsExpr idR) (SyntaxExpr idR)
TransStmt
Fields trS_ext :: XTransStmt idL idR body trS_form :: TransForm trS_stmts :: [ExprLStmt idL] trS_bndrs :: [(IdP idR, IdP idR)] trS_using :: LHsExpr idR trS_by :: Maybe (LHsExpr idR) trS_ret :: SyntaxExpr idR trS_bind :: SyntaxExpr idR trS_fmap :: HsExpr idR
RecStmt	`AnnKeywordId` : `AnnRec`
Fields recS_ext :: XRecStmt idL idR body recS_stmts :: XRec idR [LStmtLR idL idR body] recS_later_ids :: [IdP idR] recS_rec_ids :: [IdP idR] recS_bind_fn :: SyntaxExpr idR recS_ret_fn :: SyntaxExpr idR recS_mfix_fn :: SyntaxExpr idR
XStmtLR !(XXStmtLR idL idR body)

Instances

Instances details

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]
Instance details Defined in GHC.Parser.Types type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL
type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr)))) = SrcSpanAnnA
type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA
type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))
Instance details Defined in GHC.Hs.Expr type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type GhciStmt id = Stmt id (LHsExpr id) #

Ghci Statement

type GhciLStmt id = LStmt id (LHsExpr id) #

Ghci Located Statement

type GuardStmt id = Stmt id (LHsExpr id) #

Guard Statement

type GuardLStmt id = LStmt id (LHsExpr id) #

Guard Located Statement

type ExprStmt id = Stmt id (LHsExpr id) #

Expression Statement

type ExprLStmt id = LStmt id (LHsExpr id) #

Expression Located Statement

type CmdStmt id = Stmt id (LHsCmd id) #

Command Statement

type CmdLStmt id = LStmt id (LHsCmd id) #

Command Located Statement

type LStmtLR idL idR body = XRec idL (StmtLR idL idR body) #

Located Statement with separate Left and Right id's

type LStmt id body = XRec id (StmtLR id id body) #

Located do block Statement

data GRHS p body #

Guarded Right Hand Side.

Constructors

GRHS (XCGRHS p body) [GuardLStmt p] body
XGRHS !(XXGRHS p body)

Instances

Instances details

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))
Instance details Defined in GHC.Parser.PostProcess type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcAnn NoEpAnns

type LGRHS id body = XRec id (GRHS id body) #

Located Guarded Right-Hand Side

type LMatch id body = XRec id (Match id body) #

Located Match

May have AnnKeywordId : AnnSemi when in a list

type HsRecordBinds p = HsRecFields p (LHsExpr p) #

Haskell Record Bindings

data HsCmdTop p #

Haskell Top-level Command

Constructors

HsCmdTop (XCmdTop p) (LHsCmd p)
XCmdTop !(XXCmdTop p)

Instances

Instances details

HiePass p => ToHie (LocatedAn NoEpAnns (HsCmdTop (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedAn NoEpAnns (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]
type Anno (HsCmdTop (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmdTop (GhcPass p)) = SrcAnn NoEpAnns

type LHsCmdTop p = XRec p (HsCmdTop p) #

Top-level command, introducing a new arrow. This may occur inside a proc (where the stack is empty) or as an argument of a command-forming operator.

Located Haskell Top-level Command

data HsArrAppType #

Haskell arrow application type.

Constructors

HsHigherOrderApp	First order arrow application `-<`
HsFirstOrderApp	Higher order arrow application `-<<`

Instances

Instances details

Data HsArrAppType

Instance details

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsArrAppType -> c HsArrAppType #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsArrAppType #

toConstr :: HsArrAppType -> Constr #

dataTypeOf :: HsArrAppType -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> HsArrAppType -> HsArrAppType #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsArrAppType -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsArrAppType -> r #

gmapQ :: (forall d. Data d => d -> u) -> HsArrAppType -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsArrAppType -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType #

data HsCmd id #

Haskell Command (e.g. a "statement" in an Arrow proc block)

Constructors

HsCmdArrApp (XCmdArrApp id) (LHsExpr id) (LHsExpr id) HsArrAppType Bool	`AnnKeywordId` : `Annlarrowtail`, `Annrarrowtail`,`AnnLarrowtail`, `AnnRarrowtail`
HsCmdArrForm (XCmdArrForm id) (LHsExpr id) LexicalFixity (Maybe Fixity) [LHsCmdTop id]	`AnnKeywordId` : `AnnOpenB` `'(\|'`, `AnnCloseB` `'\|)'`
HsCmdApp (XCmdApp id) (LHsCmd id) (LHsExpr id)
HsCmdLam (XCmdLam id) (MatchGroup id (LHsCmd id))	`AnnKeywordId` : `AnnLam`, `AnnRarrow`,
HsCmdPar (XCmdPar id) !(LHsToken "(" id) (LHsCmd id) !(LHsToken ")" id)	`AnnKeywordId` : `AnnOpen` `'('`, `AnnClose` `')'`
HsCmdCase (XCmdCase id) (LHsExpr id) (MatchGroup id (LHsCmd id))	`AnnKeywordId` : `AnnCase`, `AnnOf`,`AnnOpen` `'{'`, `AnnClose` `'}'`
HsCmdLamCase (XCmdLamCase id) LamCaseVariant (MatchGroup id (LHsCmd id))	Lambda-case `AnnKeywordId` : `AnnLam`, `AnnCase`,`AnnOpen` `'{'`, `AnnClose` `'}'` `AnnKeywordId` : `AnnLam`, `AnnCases`,`AnnOpen` `'{'`, `AnnClose` `'}'`
HsCmdIf (XCmdIf id) (SyntaxExpr id) (LHsExpr id) (LHsCmd id) (LHsCmd id)	`AnnKeywordId` : `AnnIf`, `AnnSemi`, `AnnThen`,`AnnSemi`, `AnnElse`,
HsCmdLet (XCmdLet id) !(LHsToken "let" id) (HsLocalBinds id) !(LHsToken "in" id) (LHsCmd id)	`AnnKeywordId` : `AnnLet`, `AnnOpen` `'{'`, `AnnClose` `'}'`,`AnnIn`
HsCmdDo (XCmdDo id) (XRec id [CmdLStmt id])	`AnnKeywordId` : `AnnDo`, `AnnOpen`, `AnnSemi`, `AnnVbar`, `AnnClose`
XCmd !(XXCmd id)

Instances

Instances details

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]
DisambECP (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess Associated Types type Body (HsCmd GhcPs) :: Type -> Type # type InfixOp (HsCmd GhcPs) # type FunArg (HsCmd GhcPs) # Methods ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsCmd GhcPs)) # ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsProjUpdatePV :: SrcSpan -> Located [LocatedAn NoEpAnns (DotFieldOcc GhcPs)] -> LocatedA (HsCmd GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsCmd GhcPs))) # mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsLetPV :: SrcSpan -> LHsToken "let" GhcPs -> HsLocalBinds GhcPs -> LHsToken "in" GhcPs -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # superInfixOp :: (DisambInfixOp (InfixOp (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsOpAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> LocatedN (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsCmd GhcPs)) # mkHsLamCasePV :: SrcSpan -> LamCaseVariant -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # superFunArg :: (DisambECP (FunArg (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs)) # mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LocatedA (FunArg (HsCmd GhcPs)) -> PV (LocatedA (HsCmd GhcPs)) # mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LHsToken "@" GhcPs -> LHsType GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsCmd GhcPs) -> Bool -> LocatedA (HsCmd GhcPs) -> AnnsIf -> PV (LocatedA (HsCmd GhcPs)) # mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsCmd GhcPs))] -> AnnList -> PV (LocatedA (HsCmd GhcPs)) # mkHsParPV :: SrcSpan -> LHsToken "(" GhcPs -> LocatedA (HsCmd GhcPs) -> LHsToken ")" GhcPs -> PV (LocatedA (HsCmd GhcPs)) # mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsCmd GhcPs)) # mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsOverLitPV :: LocatedAn a (HsOverLit GhcPs) -> PV (LocatedAn a (HsCmd GhcPs)) # mkHsWildCardPV :: SrcSpan -> PV (Located (HsCmd GhcPs)) # mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsCmd GhcPs)] -> AnnList -> PV (LocatedA (HsCmd GhcPs)) # mkHsSplicePV :: Located (HsUntypedSplice GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsCmd GhcPs) -> ([Fbind (HsCmd GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsNegAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (Located (HsCmd GhcPs)) # mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LHsToken "@" GhcPs -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs)) # mkHsLazyPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkHsBangPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs)) # rejectPragmaPV :: LocatedA (HsCmd GhcPs) -> PV () #
type Body (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type Body (HsCmd GhcPs) = HsCmd
type FunArg (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type FunArg (HsCmd GhcPs) = HsExpr GhcPs
type InfixOp (HsCmd GhcPs)
Instance details Defined in GHC.Parser.PostProcess type InfixOp (HsCmd GhcPs) = HsExpr GhcPs
type Anno (HsCmd (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA
type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]
Instance details Defined in GHC.Hs.Expr type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL
type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcAnn NoEpAnns
type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))
Instance details Defined in GHC.Hs.Expr type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type LHsCmd id = XRec id (HsCmd id) #

Located Haskell Command (for arrow syntax)

data LamCaseVariant #

Which kind of lambda case are we dealing with?

Constructors

LamCase	`case`
LamCases	`cases`

Instances

Instances details

Data LamCaseVariant
Instance details Defined in Language.Haskell.Syntax.Expr Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LamCaseVariant -> c LamCaseVariant # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LamCaseVariant # toConstr :: LamCaseVariant -> Constr # dataTypeOf :: LamCaseVariant -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LamCaseVariant) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LamCaseVariant) # gmapT :: (forall b. Data b => b -> b) -> LamCaseVariant -> LamCaseVariant # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LamCaseVariant -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LamCaseVariant -> r # gmapQ :: (forall d. Data d => d -> u) -> LamCaseVariant -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LamCaseVariant -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LamCaseVariant -> m LamCaseVariant # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LamCaseVariant -> m LamCaseVariant # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LamCaseVariant -> m LamCaseVariant #
Eq LamCaseVariant
Instance details Defined in Language.Haskell.Syntax.Expr Methods (==) :: LamCaseVariant -> LamCaseVariant -> Bool # (/=) :: LamCaseVariant -> LamCaseVariant -> Bool #

data HsTupArg id #

AnnKeywordId : AnnComma

Haskell Tuple Argument

Constructors

Present (XPresent id) (LHsExpr id)	The argument
Missing (XMissing id)	The argument is missing, but this is its type
XTupArg !(XXTupArg id)	Extension point; see Note [Trees That Grow] in Language.Haskell.Syntax.Extension

Instances

Instances details

HiePass p => ToHie (HsTupArg (GhcPass p))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: HsTupArg (GhcPass p) -> HieM [HieAST Type]

type LHsTupArg id = XRec id (HsTupArg id) #

Located Haskell Tuple Argument

HsTupArg is used for tuple sections (,a,) is represented by ExplicitTuple [Missing ty1, Present a, Missing ty3] Which in turn stands for (x:ty1 y:ty2. (x,a,y))

data HsPragE p #

A pragma, written as {-# ... #-}, that may appear within an expression.

Constructors

HsPragSCC (XSCC p) StringLiteral
XHsPragE !(XXPragE p)	`AnnKeywordId` : `AnnOpen`, `AnnOpen` `'{-# GENERATED'`, `AnnVal`,`AnnVal`, `AnnColon`,`AnnVal`, `AnnMinus`, `AnnVal`,`AnnColon`, `AnnVal`, `AnnClose` `'#-}'`

data DotFieldOcc p #

Constructors

DotFieldOcc
Fields dfoExt :: XCDotFieldOcc p dfoLabel :: XRec p FieldLabelString
XDotFieldOcc !(XXDotFieldOcc p)

Instances

Instances details

type Anno (DotFieldOcc (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (DotFieldOcc (GhcPass p)) = SrcAnn NoEpAnns

type LHsRecUpdProj p = XRec p (RecUpdProj p) #

type RecUpdProj p = RecProj p (LHsExpr p) #

type LHsRecProj p arg = XRec p (RecProj p arg) #

type RecProj p arg = HsFieldBind (LFieldLabelStrings p) arg #

newtype FieldLabelStrings p #

Constructors

FieldLabelStrings [XRec p (DotFieldOcc p)]

Instances

Instances details

type Anno (FieldLabelStrings (GhcPass p))
Instance details Defined in GHC.Hs.Expr type Anno (FieldLabelStrings (GhcPass p)) = SrcAnn NoEpAnns

type LFieldLabelStrings p = XRec p (FieldLabelStrings p) #

RecordDotSyntax field updates

data HsUntypedSpliceResult thing #

Constructors

HsUntypedSpliceTop
Fields utsplice_result_finalizers :: ThModFinalizers TH finalizers produced by the splice. utsplice_result :: thing The result of splicing; See Note [Lifecycle of a splice]
HsUntypedSpliceNested SplicePointName

newtype ThModFinalizers #

Finalizers produced by a splice with addModFinalizer

See Note [Delaying modFinalizers in untyped splices] in GHC.Rename.Splice. For how this is used.

Constructors

ThModFinalizers [ForeignRef (Q ())]

Instances

Instances details

Data ThModFinalizers

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ThModFinalizers -> c ThModFinalizers #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ThModFinalizers #

toConstr :: ThModFinalizers -> Constr #

dataTypeOf :: ThModFinalizers -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> ThModFinalizers -> ThModFinalizers #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ThModFinalizers -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ThModFinalizers -> r #

gmapQ :: (forall d. Data d => d -> u) -> ThModFinalizers -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> ThModFinalizers -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers #

type SplicePointName = Name #

data HsModule p #

Haskell Module

All we actually declare here is the top-level structure for a module.

Constructors

HsModule

AnnKeywordIds

AnnModule,AnnWhere
AnnOpen,AnnSemi, AnnClose for explicit braces and semi around hsmodImports,hsmodDecls if this style is used.

Fields

hsmodExt :: XCModule p
HsModule extension point
hsmodName :: Maybe (XRec p ModuleName)
Nothing: "module X where" is omitted (in which case the next field is Nothing too)
hsmodExports :: Maybe (XRec p [LIE p])
Export list
- Nothing: export list omitted, so export everything
- Just []: export nothing
- Just [...]: as you would expect...
- AnnKeywordIds : AnnOpen ,AnnClose
hsmodImports :: [LImportDecl p]
hsmodDecls :: [LHsDecl p]
Type, class, value, and interface signature decls

XModule !(XXModule p)

Instances

Instances details

NFData (HsModule a) Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HsModule a -> () #

type IdUnfoldingFun = Id -> Unfolding #

type PatSynBuilder = Maybe (Name, Type, Bool) #

type PatSynMatcher = (Name, Type, Bool) #

type CompleteMatches = [CompleteMatch] #

data CompleteMatch #

A list of conlikes which represents a complete pattern match. These arise from COMPLETE signatures. See also Note [Implementation of COMPLETE pragmas].

Instances

Instances details

Outputable CompleteMatch
Instance details Defined in GHC.Types.CompleteMatch Methods ppr :: CompleteMatch -> SDoc #

class Monad m => MonadThings (m :: Type -> Type) where #

Class that abstracts out the common ability of the monads in GHC to lookup a TyThing in the monadic environment by Name. Provides a number of related convenience functions for accessing particular kinds of TyThing

Minimal complete definition

lookupThing

Methods

lookupThing :: Name -> m TyThing #

lookupId :: Name -> m Id #

lookupDataCon :: Name -> m DataCon #

lookupTyCon :: Name -> m TyCon #

Instances

Instances details

MonadThings TcS
Instance details Defined in GHC.Tc.Solver.Monad Methods lookupThing :: Name -> TcS TyThing # lookupId :: Name -> TcS Id # lookupDataCon :: Name -> TcS DataCon # lookupTyCon :: Name -> TcS TyCon #
MonadThings m => MonadThings (ReaderT s m)
Instance details Defined in GHC.Types.TyThing Methods lookupThing :: Name -> ReaderT s m TyThing # lookupId :: Name -> ReaderT s m Id # lookupDataCon :: Name -> ReaderT s m DataCon # lookupTyCon :: Name -> ReaderT s m TyCon #

data BoxingInfo b #

Constructors

BI_NoBoxNeeded
BI_NoBoxAvailable
BI_Box
Fields bi_data_con :: DataCon bi_inst_con :: Expr b bi_boxed_type :: Type

type OrigNameCache = ModuleEnv (OccEnv Name) #

Per-module cache of original OccNames given Names

data NameCache #

The NameCache makes sure that there is just one Unique assigned for each original name; i.e. (module-name, occ-name) pair and provides something of a lookup mechanism for those names.

Constructors

NameCache
Fields nsUniqChar :: !Char nsNames :: !(MVar OrigNameCache)

data FamInstMatch #

Constructors

FamInstMatch
Fields fim_instance :: FamInst fim_tys :: [Type] fim_cos :: [Coercion]

Instances

Instances details

Outputable FamInstMatch
Instance details Defined in GHC.Core.FamInstEnv Methods ppr :: FamInstMatch -> SDoc #

data InjectivityCheckResult #

Result of testing two type family equations for injectiviy.

Constructors

InjectivityAccepted	Either RHSs are distinct or unification of RHSs leads to unification of LHSs
InjectivityUnified CoAxBranch CoAxBranch	RHSs unify but LHSs don't unify under that substitution. Relevant for closed type families where equation after unification might be overlapped (in which case it is OK if they don't unify). Constructor stores axioms after unification.

data FamInstEnv #

Instances

Instances details

Outputable FamInstEnv
Instance details Defined in GHC.Core.FamInstEnv Methods ppr :: FamInstEnv -> SDoc #

type FamInstEnvs = (FamInstEnv, FamInstEnv) #

data FamFlavor #

Constructors

SynFamilyInst
DataFamilyInst TyCon

data FamInst #

Constructors

FamInst
Fields fi_axiom :: CoAxiom Unbranched fi_flavor :: FamFlavor fi_fam :: Name fi_tcs :: [RoughMatchTc] fi_tvs :: [TyVar] fi_cvs :: [CoVar] fi_tys :: [Type] fi_rhs :: Type

Instances

Instances details

NamedThing FamInst
Instance details Defined in GHC.Core.FamInstEnv Methods getOccName :: FamInst -> OccName # getName :: FamInst -> Name #
Outputable FamInst
Instance details Defined in GHC.Core.FamInstEnv Methods ppr :: FamInst -> SDoc #

type CheapAppFun = Id -> Arity -> Bool #

data ShowHowMuch #

Constructors

ShowHeader AltPpr

Header information only, not rhs

ShowSome [OccName] AltPpr

Show only some sub-components. Specifically,

[]: Print all sub-components.
(n:ns): Print sub-component n with ShowSub = ns; elide other sub-components to ... May 14: the list is max 1 element long at the moment

ShowIface

Everything including GHC-internal information (used in --show-iface)

Instances

Instances details

Outputable ShowHowMuch
Instance details Defined in GHC.Iface.Syntax Methods ppr :: ShowHowMuch -> SDoc #

newtype AltPpr #

Constructors

AltPpr (Maybe (OccName -> SDoc))

data ShowSub #

Constructors

ShowSub
Fields ss_how_much :: ShowHowMuch ss_forall :: ShowForAllFlag

data IfaceJoinInfo #

Constructors

IfaceNotJoinPoint
IfaceJoinPoint JoinArity

Instances

Instances details

NFData IfaceJoinInfo
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceJoinInfo -> () #
Binary IfaceJoinInfo
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceJoinInfo -> IO () # put :: BinHandle -> IfaceJoinInfo -> IO (Bin IfaceJoinInfo) # get :: BinHandle -> IO IfaceJoinInfo #
Outputable IfaceJoinInfo
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceJoinInfo -> SDoc #

data IfaceMaybeRhs #

Constructors

IfUseUnfoldingRhs
IfRhs IfaceExpr

Instances

Instances details

NFData IfaceMaybeRhs
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceMaybeRhs -> () #
Binary IfaceMaybeRhs
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceMaybeRhs -> IO () # put :: BinHandle -> IfaceMaybeRhs -> IO (Bin IfaceMaybeRhs) # get :: BinHandle -> IO IfaceMaybeRhs #
Outputable IfaceMaybeRhs
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceMaybeRhs -> SDoc #

data IfaceTopBndrInfo #

Constructors

IfLclTopBndr IfLclName IfaceType IfaceIdInfo IfaceIdDetails
IfGblTopBndr IfaceTopBndr

Instances

Instances details

NFData IfaceTopBndrInfo
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceTopBndrInfo -> () #
Binary IfaceTopBndrInfo
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceTopBndrInfo -> IO () # put :: BinHandle -> IfaceTopBndrInfo -> IO (Bin IfaceTopBndrInfo) # get :: BinHandle -> IO IfaceTopBndrInfo #
Outputable IfaceTopBndrInfo
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceTopBndrInfo -> SDoc #

data IfaceLetBndr #

Constructors

IfLetBndr IfLclName IfaceType IfaceIdInfo IfaceJoinInfo

Instances

Instances details

NFData IfaceLetBndr
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceLetBndr -> () #
Binary IfaceLetBndr
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceLetBndr -> IO () # put :: BinHandle -> IfaceLetBndr -> IO (Bin IfaceLetBndr) # get :: BinHandle -> IO IfaceLetBndr #

data IfaceBindingX r b #

Constructors

IfaceNonRec b r
IfaceRec [(b, r)]

Instances

Instances details

Foldable (IfaceBindingX r)
Instance details Defined in GHC.Iface.Syntax Methods fold :: Monoid m => IfaceBindingX r m -> m # foldMap :: Monoid m => (a -> m) -> IfaceBindingX r a -> m # foldMap' :: Monoid m => (a -> m) -> IfaceBindingX r a -> m # foldr :: (a -> b -> b) -> b -> IfaceBindingX r a -> b # foldr' :: (a -> b -> b) -> b -> IfaceBindingX r a -> b # foldl :: (b -> a -> b) -> b -> IfaceBindingX r a -> b # foldl' :: (b -> a -> b) -> b -> IfaceBindingX r a -> b # foldr1 :: (a -> a -> a) -> IfaceBindingX r a -> a # foldl1 :: (a -> a -> a) -> IfaceBindingX r a -> a # toList :: IfaceBindingX r a -> [a] # null :: IfaceBindingX r a -> Bool # length :: IfaceBindingX r a -> Int # elem :: Eq a => a -> IfaceBindingX r a -> Bool # maximum :: Ord a => IfaceBindingX r a -> a # minimum :: Ord a => IfaceBindingX r a -> a # sum :: Num a => IfaceBindingX r a -> a # product :: Num a => IfaceBindingX r a -> a #
Traversable (IfaceBindingX r)
Instance details Defined in GHC.Iface.Syntax Methods traverse :: Applicative f => (a -> f b) -> IfaceBindingX r a -> f (IfaceBindingX r b) # sequenceA :: Applicative f => IfaceBindingX r (f a) -> f (IfaceBindingX r a) # mapM :: Monad m => (a -> m b) -> IfaceBindingX r a -> m (IfaceBindingX r b) # sequence :: Monad m => IfaceBindingX r (m a) -> m (IfaceBindingX r a) #
Functor (IfaceBindingX r)
Instance details Defined in GHC.Iface.Syntax Methods fmap :: (a -> b) -> IfaceBindingX r a -> IfaceBindingX r b # (<$) :: a -> IfaceBindingX r b -> IfaceBindingX r a #
(NFData b, NFData a) => NFData (IfaceBindingX a b)
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceBindingX a b -> () #
(Binary r, Binary b) => Binary (IfaceBindingX b r)
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceBindingX b r -> IO () # put :: BinHandle -> IfaceBindingX b r -> IO (Bin (IfaceBindingX b r)) # get :: BinHandle -> IO (IfaceBindingX b r) #
(Outputable r, Outputable b) => Outputable (IfaceBindingX r b)
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceBindingX r b -> SDoc #
(Eq b, Eq r) => Eq (IfaceBindingX r b)
Instance details Defined in GHC.Iface.Syntax Methods (==) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool # (/=) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool #
(Ord b, Ord r) => Ord (IfaceBindingX r b)
Instance details Defined in GHC.Iface.Syntax Methods compare :: IfaceBindingX r b -> IfaceBindingX r b -> Ordering # (<) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool # (<=) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool # (>) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool # (>=) :: IfaceBindingX r b -> IfaceBindingX r b -> Bool # max :: IfaceBindingX r b -> IfaceBindingX r b -> IfaceBindingX r b # min :: IfaceBindingX r b -> IfaceBindingX r b -> IfaceBindingX r b #

type IfaceBinding b = IfaceBindingX IfaceExpr b #

data IfaceConAlt #

Constructors

IfaceDefault
IfaceDataAlt IfExtName
IfaceLitAlt Literal

Instances

Instances details

NFData IfaceConAlt
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceConAlt -> () #
Binary IfaceConAlt
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceConAlt -> IO () # put :: BinHandle -> IfaceConAlt -> IO (Bin IfaceConAlt) # get :: BinHandle -> IO IfaceConAlt #
Outputable IfaceConAlt
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceConAlt -> SDoc #

data IfaceAlt #

Constructors

IfaceAlt IfaceConAlt [IfLclName] IfaceExpr

Instances

Instances details

NFData IfaceAlt
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceAlt -> () #
Binary IfaceAlt
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceAlt -> IO () # put :: BinHandle -> IfaceAlt -> IO (Bin IfaceAlt) # get :: BinHandle -> IO IfaceAlt #

data IfaceTickish #

Constructors

IfaceHpcTick Module Int
IfaceSCC CostCentre Bool Bool
IfaceSource RealSrcSpan String

Instances

Instances details

NFData IfaceTickish
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceTickish -> () #
Binary IfaceTickish
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceTickish -> IO () # put :: BinHandle -> IfaceTickish -> IO (Bin IfaceTickish) # get :: BinHandle -> IO IfaceTickish #

data IfaceExpr #

Instances

Instances details

NFData IfaceExpr
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceExpr -> () #
Binary IfaceExpr
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceExpr -> IO () # put :: BinHandle -> IfaceExpr -> IO (Bin IfaceExpr) # get :: BinHandle -> IO IfaceExpr #
Outputable IfaceExpr
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceExpr -> SDoc #

data IfaceLFInfo #

Iface type for LambdaFormInfo. Fields not relevant for imported Ids are omitted in this type.

Constructors

IfLFReEntrant !RepArity
IfLFThunk !Bool !Bool
IfLFCon !Name
IfLFUnknown !Bool
IfLFUnlifted

Instances

Instances details

Binary IfaceLFInfo
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceLFInfo -> IO () # put :: BinHandle -> IfaceLFInfo -> IO (Bin IfaceLFInfo) # get :: BinHandle -> IO IfaceLFInfo #
Outputable IfaceLFInfo
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceLFInfo -> SDoc #

data IfaceIdDetails #

Constructors

IfVanillaId
IfWorkerLikeId [CbvMark]
IfRecSelId (Either IfaceTyCon IfaceDecl) Bool
IfDFunId

Instances

Instances details

NFData IfaceIdDetails
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceIdDetails -> () #
Binary IfaceIdDetails
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceIdDetails -> IO () # put :: BinHandle -> IfaceIdDetails -> IO (Bin IfaceIdDetails) # get :: BinHandle -> IO IfaceIdDetails #
Outputable IfaceIdDetails
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceIdDetails -> SDoc #

data IfGuidance #

Constructors

IfNoGuidance
IfWhen Arity Bool Bool

Instances

Instances details

NFData IfGuidance
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfGuidance -> () #
Binary IfGuidance
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfGuidance -> IO () # put :: BinHandle -> IfGuidance -> IO (Bin IfGuidance) # get :: BinHandle -> IO IfGuidance #
Outputable IfGuidance
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfGuidance -> SDoc #

data IfaceUnfolding #

Constructors

IfCoreUnfold UnfoldingSource IfUnfoldingCache IfGuidance IfaceExpr
IfDFunUnfold [IfaceBndr] [IfaceExpr]

Instances

Instances details

NFData IfaceUnfolding
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceUnfolding -> () #
Binary IfaceUnfolding
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceUnfolding -> IO () # put :: BinHandle -> IfaceUnfolding -> IO (Bin IfaceUnfolding) # get :: BinHandle -> IO IfaceUnfolding #
Outputable IfaceUnfolding
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceUnfolding -> SDoc #

data IfaceInfoItem #

Constructors

HsArity Arity
HsDmdSig DmdSig
HsCprSig CprSig
HsInline InlinePragma
HsUnfold Bool IfaceUnfolding
HsNoCafRefs
HsLFInfo IfaceLFInfo
HsTagSig TagSig

Instances

Instances details

NFData IfaceInfoItem
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceInfoItem -> () #
Binary IfaceInfoItem
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceInfoItem -> IO () # put :: BinHandle -> IfaceInfoItem -> IO (Bin IfaceInfoItem) # get :: BinHandle -> IO IfaceInfoItem #
Outputable IfaceInfoItem
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceInfoItem -> SDoc #

type IfaceIdInfo = [IfaceInfoItem] #

data IfaceCompleteMatch #

Constructors

IfaceCompleteMatch [IfExtName] (Maybe IfaceTyCon)

Instances

Instances details

NFData IfaceCompleteMatch
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceCompleteMatch -> () #
Binary IfaceCompleteMatch
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceCompleteMatch -> IO () # put :: BinHandle -> IfaceCompleteMatch -> IO (Bin IfaceCompleteMatch) # get :: BinHandle -> IO IfaceCompleteMatch #
Outputable IfaceCompleteMatch
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceCompleteMatch -> SDoc #

type IfaceAnnTarget = AnnTarget OccName #

data IfaceAnnotation #

Constructors

IfaceAnnotation
Fields ifAnnotatedTarget :: IfaceAnnTarget ifAnnotatedValue :: AnnPayload

Instances

Instances details

NFData IfaceAnnotation
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceAnnotation -> () #
Binary IfaceAnnotation
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceAnnotation -> IO () # put :: BinHandle -> IfaceAnnotation -> IO (Bin IfaceAnnotation) # get :: BinHandle -> IO IfaceAnnotation #
Outputable IfaceAnnotation
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceAnnotation -> SDoc #

data IfaceRule #

Constructors

IfaceRule
Fields ifRuleName :: RuleName ifActivation :: Activation ifRuleBndrs :: [IfaceBndr] ifRuleHead :: IfExtName ifRuleArgs :: [IfaceExpr] ifRuleRhs :: IfaceExpr ifRuleAuto :: Bool ifRuleOrph :: IsOrphan

Instances

Instances details

NFData IfaceRule
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceRule -> () #
Binary IfaceRule
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceRule -> IO () # put :: BinHandle -> IfaceRule -> IO (Bin IfaceRule) # get :: BinHandle -> IO IfaceRule #
Outputable IfaceRule
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceRule -> SDoc #

data IfaceFamInst #

Constructors

IfaceFamInst
Fields ifFamInstFam :: IfExtName ifFamInstTys :: [Maybe IfaceTyCon] ifFamInstAxiom :: IfExtName ifFamInstOrph :: IsOrphan

Instances

Instances details

NFData IfaceFamInst
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceFamInst -> () #
Binary IfaceFamInst
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceFamInst -> IO () # put :: BinHandle -> IfaceFamInst -> IO (Bin IfaceFamInst) # get :: BinHandle -> IO IfaceFamInst #
Outputable IfaceFamInst
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceFamInst -> SDoc #

data IfaceClsInst #

Constructors

IfaceClsInst
Fields ifInstCls :: IfExtName ifInstTys :: [Maybe IfaceTyCon] ifDFun :: IfExtName ifOFlag :: OverlapFlag ifInstOrph :: IsOrphan

Instances

Instances details

NFData IfaceClsInst
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceClsInst -> () #
Binary IfaceClsInst
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceClsInst -> IO () # put :: BinHandle -> IfaceClsInst -> IO (Bin IfaceClsInst) # get :: BinHandle -> IO IfaceClsInst #
Outputable IfaceClsInst
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceClsInst -> SDoc #

data IfaceSrcBang #

This corresponds to HsSrcBang

Constructors

IfSrcBang SrcUnpackedness SrcStrictness

Instances

Instances details

NFData IfaceSrcBang
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceSrcBang -> () #
Binary IfaceSrcBang
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceSrcBang -> IO () # put :: BinHandle -> IfaceSrcBang -> IO (Bin IfaceSrcBang) # get :: BinHandle -> IO IfaceSrcBang #

data IfaceBang #

This corresponds to an HsImplBang; that is, the final implementation decision about the data constructor arg

Constructors

IfNoBang
IfStrict
IfUnpack
IfUnpackCo IfaceCoercion

Instances

Instances details

NFData IfaceBang
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceBang -> () #
Binary IfaceBang
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceBang -> IO () # put :: BinHandle -> IfaceBang -> IO (Bin IfaceBang) # get :: BinHandle -> IO IfaceBang #

type IfaceEqSpec = [(IfLclName, IfaceType)] #

data IfaceConDecl #

Constructors

IfCon
Fields ifConName :: IfaceTopBndr ifConWrapper :: Bool ifConInfix :: Bool ifConExTCvs :: [IfaceBndr] ifConUserTvBinders :: [IfaceForAllSpecBndr] ifConEqSpec :: IfaceEqSpec ifConCtxt :: IfaceContext ifConArgTys :: [(IfaceMult, IfaceType)] ifConFields :: [FieldLabel] ifConStricts :: [IfaceBang] ifConSrcStricts :: [IfaceSrcBang]

Instances

Instances details

NFData IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceConDecl -> () #
NamedThing IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceConDecl -> OccName # getName :: IfaceConDecl -> Name #
HasOccName IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceConDecl -> OccName #
Binary IfaceConDecl
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceConDecl -> IO () # put :: BinHandle -> IfaceConDecl -> IO (Bin IfaceConDecl) # get :: BinHandle -> IO IfaceConDecl #

data IfaceConDecls #

Constructors

IfAbstractTyCon
IfDataTyCon !Bool [IfaceConDecl]
IfNewTyCon IfaceConDecl

Instances

Instances details

NFData IfaceConDecls
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceConDecls -> () #
Binary IfaceConDecls
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceConDecls -> IO () # put :: BinHandle -> IfaceConDecls -> IO (Bin IfaceConDecls) # get :: BinHandle -> IO IfaceConDecls #

data IfaceAxBranch #

Constructors

IfaceAxBranch
Fields ifaxbTyVars :: [IfaceTvBndr] ifaxbEtaTyVars :: [IfaceTvBndr] ifaxbCoVars :: [IfaceIdBndr] ifaxbLHS :: IfaceAppArgs ifaxbRoles :: [Role] ifaxbRHS :: IfaceType ifaxbIncomps :: [BranchIndex]

Instances

Instances details

NFData IfaceAxBranch
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceAxBranch -> () #
Binary IfaceAxBranch
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceAxBranch -> IO () # put :: BinHandle -> IfaceAxBranch -> IO (Bin IfaceAxBranch) # get :: BinHandle -> IO IfaceAxBranch #

data IfaceAT #

Constructors

IfaceAT IfaceDecl (Maybe IfaceType)

Instances

Instances details

NFData IfaceAT
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceAT -> () #
Binary IfaceAT
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceAT -> IO () # put :: BinHandle -> IfaceAT -> IO (Bin IfaceAT) # get :: BinHandle -> IO IfaceAT #
Outputable IfaceAT
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceAT -> SDoc #

data IfaceClassOp #

Constructors

IfaceClassOp IfaceTopBndr IfaceType (Maybe (DefMethSpec IfaceType))

Instances

Instances details

NFData IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceClassOp -> () #
NamedThing IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceClassOp -> OccName # getName :: IfaceClassOp -> Name #
HasOccName IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceClassOp -> OccName #
Binary IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceClassOp -> IO () # put :: BinHandle -> IfaceClassOp -> IO (Bin IfaceClassOp) # get :: BinHandle -> IO IfaceClassOp #
Outputable IfaceClassOp
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceClassOp -> SDoc #

data IfaceFamTyConFlav #

Constructors

IfaceDataFamilyTyCon
IfaceOpenSynFamilyTyCon
IfaceClosedSynFamilyTyCon (Maybe (IfExtName, [IfaceAxBranch]))	Name of associated axiom and branches for pretty printing purposes, or `Nothing` for an empty closed family without an axiom See Note [Pretty printing via Iface syntax] in GHC.Types.TyThing.Ppr
IfaceAbstractClosedSynFamilyTyCon
IfaceBuiltInSynFamTyCon

Instances

Instances details

NFData IfaceFamTyConFlav
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceFamTyConFlav -> () #
Binary IfaceFamTyConFlav
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceFamTyConFlav -> IO () # put :: BinHandle -> IfaceFamTyConFlav -> IO (Bin IfaceFamTyConFlav) # get :: BinHandle -> IO IfaceFamTyConFlav #

data IfaceTyConParent #

Constructors

IfNoParent
IfDataInstance IfExtName IfaceTyCon IfaceAppArgs

Instances

Instances details

NFData IfaceTyConParent
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceTyConParent -> () #
Binary IfaceTyConParent
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceTyConParent -> IO () # put :: BinHandle -> IfaceTyConParent -> IO (Bin IfaceTyConParent) # get :: BinHandle -> IO IfaceTyConParent #
Outputable IfaceTyConParent
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceTyConParent -> SDoc #

data IfaceClassBody #

Constructors

IfAbstractClass
IfConcreteClass
Fields ifClassCtxt :: IfaceContext ifATs :: [IfaceAT] ifSigs :: [IfaceClassOp] ifMinDef :: BooleanFormula IfLclName

Instances

Instances details

NFData IfaceClassBody
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceClassBody -> () #

data IfaceDecl #

Constructors

IfaceId
Fields ifName :: IfaceTopBndr ifType :: IfaceType ifIdDetails :: IfaceIdDetails ifIdInfo :: IfaceIdInfo
IfaceData
Fields ifName :: IfaceTopBndr ifBinders :: [IfaceTyConBinder] ifResKind :: IfaceType ifCType :: Maybe CType ifRoles :: [Role] ifCtxt :: IfaceContext ifCons :: IfaceConDecls ifGadtSyntax :: Bool ifParent :: IfaceTyConParent
IfaceSynonym
Fields ifName :: IfaceTopBndr ifRoles :: [Role] ifBinders :: [IfaceTyConBinder] ifResKind :: IfaceKind ifSynRhs :: IfaceType
IfaceFamily
Fields ifName :: IfaceTopBndr ifResVar :: Maybe IfLclName ifBinders :: [IfaceTyConBinder] ifResKind :: IfaceKind ifFamFlav :: IfaceFamTyConFlav ifFamInj :: Injectivity
IfaceClass
Fields ifName :: IfaceTopBndr ifRoles :: [Role] ifBinders :: [IfaceTyConBinder] ifFDs :: [FunDep IfLclName] ifBody :: IfaceClassBody
IfaceAxiom
Fields ifName :: IfaceTopBndr ifTyCon :: IfaceTyCon ifRole :: Role ifAxBranches :: [IfaceAxBranch]
IfacePatSyn
Fields ifName :: IfaceTopBndr ifPatIsInfix :: Bool ifPatMatcher :: (IfExtName, Bool) ifPatBuilder :: Maybe (IfExtName, Bool) ifPatUnivBndrs :: [IfaceForAllSpecBndr] ifPatExBndrs :: [IfaceForAllSpecBndr] ifPatProvCtxt :: IfaceContext ifPatReqCtxt :: IfaceContext ifPatArgs :: [IfaceType] ifPatTy :: IfaceType ifFieldLabels :: [FieldLabel]

Instances

Instances details

NFData IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods rnf :: IfaceDecl -> () #
NamedThing IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods getOccName :: IfaceDecl -> OccName # getName :: IfaceDecl -> Name #
HasOccName IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods occName :: IfaceDecl -> OccName #
Binary IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods put_ :: BinHandle -> IfaceDecl -> IO () # put :: BinHandle -> IfaceDecl -> IO (Bin IfaceDecl) # get :: BinHandle -> IO IfaceDecl #
Outputable IfaceDecl
Instance details Defined in GHC.Iface.Syntax Methods ppr :: IfaceDecl -> SDoc #

type IfaceTopBndr = Name #

A binding top-level Name in an interface file (e.g. the name of an IfaceDecl).

class OutputableBndrFlag flag (p :: Pass) #

Minimal complete definition

pprTyVarBndr

Instances

Instances details

OutputableBndrFlag Specificity p
Instance details Defined in GHC.Hs.Type Methods pprTyVarBndr :: HsTyVarBndr Specificity (GhcPass p) -> SDoc
OutputableBndrFlag () p
Instance details Defined in GHC.Hs.Type Methods pprTyVarBndr :: HsTyVarBndr () (GhcPass p) -> SDoc

type HsCoreTy = Type #

data HsPSRn #

The extension field for HsPatSigType, which is only used in the renamer onwards. See Note [Pattern signature binders and scoping].

Constructors

HsPSRn
Fields hsps_nwcs :: [Name] Wildcard names hsps_imp_tvs :: [Name] Implicitly bound variable names

Instances

Instances details

Data HsPSRn

Instance details

Defined in GHC.Hs.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsPSRn -> c HsPSRn #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsPSRn #

toConstr :: HsPSRn -> Constr #

dataTypeOf :: HsPSRn -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> HsPSRn -> HsPSRn #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsPSRn -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsPSRn -> r #

gmapQ :: (forall d. Data d => d -> u) -> HsPSRn -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsPSRn -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn #

type EpAnnForallTy #

Arguments

= EpAnn (AddEpAnn, AddEpAnn)

Location of forall and -> for HsForAllVis Location of forall and . for HsForAllInvis

data FlagSpec flag #

Constructors

FlagSpec
Fields flagSpecName :: String Flag in string form flagSpecFlag :: flag Flag in internal form flagSpecAction :: TurnOnFlag -> DynP () Extra action to run when the flag is found Typically, emit a warning or error flagSpecGhcMode :: GhcFlagMode In which ghc mode the flag has effect

data PackageFlag #

Flags for manipulating packages visibility.

Instances

Instances details

Show PackageFlag Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> PackageFlag -> ShowS # show :: PackageFlag -> String # showList :: [PackageFlag] -> ShowS #
Outputable PackageFlag
Instance details Defined in GHC.Driver.Session Methods ppr :: PackageFlag -> SDoc #
Eq PackageFlag
Instance details Defined in GHC.Driver.Session Methods (==) :: PackageFlag -> PackageFlag -> Bool # (/=) :: PackageFlag -> PackageFlag -> Bool #

data ModRenaming #

Represents the renaming that may be associated with an exposed package, e.g. the rns part of -package "foo (rns)".

Here are some example parsings of the package flags (where a string literal is punned to be a ModuleName:

-package foo is ModRenaming True []
-package foo () is ModRenaming False []
-package foo (A) is ModRenaming False [(A, A)]
-package foo (A as B) is ModRenaming False [(A, B)]
-package foo with (A as B) is ModRenaming True [(A, B)]

Constructors

ModRenaming
Fields modRenamingWithImplicit :: Bool Bring all exposed modules into scope? modRenamings :: [(ModuleName, ModuleName)] Bring module `m` into scope under name `n`.

Instances

Instances details

Outputable ModRenaming
Instance details Defined in GHC.Driver.Session Methods ppr :: ModRenaming -> SDoc #
Eq ModRenaming
Instance details Defined in GHC.Driver.Session Methods (==) :: ModRenaming -> ModRenaming -> Bool # (/=) :: ModRenaming -> ModRenaming -> Bool #

data PackageArg #

We accept flags which make packages visible, but how they select the package varies; this data type reflects what selection criterion is used.

Constructors

PackageArg String	`-package`, by `PackageName`
UnitIdArg Unit	`-package-id`, by `Unit`

Instances

Instances details

Show PackageArg
Instance details Defined in GHC.Driver.Session Methods showsPrec :: Int -> PackageArg -> ShowS # show :: PackageArg -> String # showList :: [PackageArg] -> ShowS #
Outputable PackageArg
Instance details Defined in GHC.Driver.Session Methods ppr :: PackageArg -> SDoc #
Eq PackageArg
Instance details Defined in GHC.Driver.Session Methods (==) :: PackageArg -> PackageArg -> Bool # (/=) :: PackageArg -> PackageArg -> Bool #

data TcTyThing #

A typecheckable thing available in a local context. Could be AGlobal TyThing, but also lexically scoped variables, etc. See GHC.Tc.Utils.Env for how to retrieve a TyThing given a Name.

Constructors

AGlobal TyThing
ATcId
Fields tct_id :: TcId tct_info :: IdBindingInfo
ATyVar Name TcTyVar
ATcTyCon TyCon
APromotionErr PromotionErr

Instances

Instances details

Outputable TcTyThing
Instance details Defined in GHC.Tc.Types Methods ppr :: TcTyThing -> SDoc #

data TcIdSigInfo #

Constructors

CompleteSig
Fields sig_bndr :: TcId sig_ctxt :: UserTypeCtxt sig_loc :: SrcSpan
PartialSig
Fields psig_name :: Name psig_hs_ty :: LHsSigWcType GhcRn sig_ctxt :: UserTypeCtxt sig_loc :: SrcSpan

Instances

Instances details

Outputable TcIdSigInfo
Instance details Defined in GHC.Tc.Types Methods ppr :: TcIdSigInfo -> SDoc #

data SelfBootInfo #

Constructors

NoSelfBoot
SelfBoot
Fields sb_mds :: ModDetails sb_tcs :: NameSet

data TcLclEnv #

Constructors

TcLclEnv
Fields tcl_loc :: RealSrcSpan tcl_ctxt :: [ErrCtxt] tcl_in_gen_code :: Bool tcl_tclvl :: TcLevel tcl_th_ctxt :: ThStage tcl_th_bndrs :: ThBindEnv tcl_arrow_ctxt :: ArrowCtxt tcl_rdr :: LocalRdrEnv tcl_env :: TcTypeEnv tcl_usage :: TcRef UsageEnv tcl_bndrs :: TcBinderStack tcl_lie :: TcRef WantedConstraints tcl_errs :: TcRef (Messages TcRnMessage)

data QuoteWrapper #

Constructors

QuoteWrapper EvVar Type

Instances

Instances details

Data QuoteWrapper

Instance details

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QuoteWrapper -> c QuoteWrapper #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c QuoteWrapper #

toConstr :: QuoteWrapper -> Constr #

dataTypeOf :: QuoteWrapper -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> QuoteWrapper -> QuoteWrapper #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QuoteWrapper -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QuoteWrapper -> r #

gmapQ :: (forall d. Data d => d -> u) -> QuoteWrapper -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> QuoteWrapper -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper #

data HoleExprRef #

Where to store evidence for expression holes See Note [Holes] in GHC.Tc.Types.Constraint

Constructors

HER
Fields (IORef EvTerm) where to write the erroring expression TcType expected type of that expression Unique for debug output only

Instances

Instances details

Data HoleExprRef
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HoleExprRef -> c HoleExprRef # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HoleExprRef # toConstr :: HoleExprRef -> Constr # dataTypeOf :: HoleExprRef -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HoleExprRef) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HoleExprRef) # gmapT :: (forall b. Data b => b -> b) -> HoleExprRef -> HoleExprRef # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HoleExprRef -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HoleExprRef -> r # gmapQ :: (forall d. Data d => d -> u) -> HoleExprRef -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HoleExprRef -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef #
Outputable HoleExprRef
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: HoleExprRef -> SDoc #

data EvCallStack #

Evidence for CallStack implicit parameters.

Constructors

EvCsEmpty
EvCsPushCall FastString RealSrcSpan EvExpr	`EvCsPushCall origin loc stk` represents a call from `origin`, occurring at `loc`, in a calling context `stk`.

Instances

Instances details

Data EvCallStack
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvCallStack -> c EvCallStack # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvCallStack # toConstr :: EvCallStack -> Constr # dataTypeOf :: EvCallStack -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvCallStack) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvCallStack) # gmapT :: (forall b. Data b => b -> b) -> EvCallStack -> EvCallStack # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvCallStack -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvCallStack -> r # gmapQ :: (forall d. Data d => d -> u) -> EvCallStack -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> EvCallStack -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack #
Outputable EvCallStack
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvCallStack -> SDoc #

data EvTypeable #

Instructions on how to make a Typeable dictionary. See Note [Typeable evidence terms]

Constructors

EvTypeableTyCon TyCon [EvTerm]	Dictionary for `Typeable T` where `T` is a type constructor with all of its kind variables saturated. The `[EvTerm]` is `Typeable` evidence for the applied kinds..
EvTypeableTyApp EvTerm EvTerm	Dictionary for `Typeable (s t)`, given a dictionaries for `s` and `t`.
EvTypeableTrFun EvTerm EvTerm EvTerm	Dictionary for `Typeable (s % w -> t)`, given a dictionaries for `w`, `s`, and `t`.
EvTypeableTyLit EvTerm	Dictionary for a type literal, e.g. `Typeable "foo"` or `Typeable 3` The `EvTerm` is evidence of, e.g., `KnownNat 3` (see #10348)

Instances

Instances details

Data EvTypeable
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvTypeable -> c EvTypeable # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvTypeable # toConstr :: EvTypeable -> Constr # dataTypeOf :: EvTypeable -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvTypeable) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvTypeable) # gmapT :: (forall b. Data b => b -> b) -> EvTypeable -> EvTypeable # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvTypeable -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvTypeable -> r # gmapQ :: (forall d. Data d => d -> u) -> EvTypeable -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> EvTypeable -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable #
Outputable EvTypeable
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvTypeable -> SDoc #

type EvExpr = CoreExpr #

data EvTerm #

Constructors

EvExpr EvExpr
EvTypeable Type EvTypeable
EvFun
Fields et_tvs :: [TyVar] et_given :: [EvVar] et_binds :: TcEvBinds et_body :: EvVar

Instances

Instances details

Data EvTerm
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvTerm -> c EvTerm # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvTerm # toConstr :: EvTerm -> Constr # dataTypeOf :: EvTerm -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvTerm) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvTerm) # gmapT :: (forall b. Data b => b -> b) -> EvTerm -> EvTerm # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvTerm -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvTerm -> r # gmapQ :: (forall d. Data d => d -> u) -> EvTerm -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> EvTerm -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm #
Outputable EvTerm
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvTerm -> SDoc #

data EvBind #

Constructors

EvBind
Fields eb_lhs :: EvVar eb_rhs :: EvTerm eb_is_given :: Bool

Instances

Instances details

Outputable EvBind
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvBind -> SDoc #

newtype EvBindMap #

Constructors

EvBindMap
Fields ev_bind_varenv :: DVarEnv EvBind

Instances

Instances details

Outputable EvBindMap
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvBindMap -> SDoc #

data EvBindsVar #

Constructors

EvBindsVar
Fields ebv_uniq :: Unique ebv_binds :: IORef EvBindMap ebv_tcvs :: IORef CoVarSet
CoEvBindsVar
Fields ebv_uniq :: Unique ebv_tcvs :: IORef CoVarSet

Instances

Instances details

Uniquable EvBindsVar
Instance details Defined in GHC.Tc.Types.Evidence Methods getUnique :: EvBindsVar -> Unique #
Outputable EvBindsVar
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: EvBindsVar -> SDoc #

data TcEvBinds #

Constructors

TcEvBinds EvBindsVar
EvBinds (Bag EvBind)

Instances

Instances details

Data TcEvBinds
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcEvBinds -> c TcEvBinds # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcEvBinds # toConstr :: TcEvBinds -> Constr # dataTypeOf :: TcEvBinds -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcEvBinds) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcEvBinds) # gmapT :: (forall b. Data b => b -> b) -> TcEvBinds -> TcEvBinds # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r # gmapQ :: (forall d. Data d => d -> u) -> TcEvBinds -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TcEvBinds -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds #
Outputable TcEvBinds
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: TcEvBinds -> SDoc #
ToHie (EvBindContext (LocatedA TcEvBinds))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

data HsWrapper #

Instances

Instances details

Data HsWrapper
Instance details Defined in GHC.Tc.Types.Evidence Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsWrapper -> c HsWrapper # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsWrapper # toConstr :: HsWrapper -> Constr # dataTypeOf :: HsWrapper -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsWrapper) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsWrapper) # gmapT :: (forall b. Data b => b -> b) -> HsWrapper -> HsWrapper # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsWrapper -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsWrapper -> r # gmapQ :: (forall d. Data d => d -> u) -> HsWrapper -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsWrapper -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper #
Monoid HsWrapper
Instance details Defined in GHC.Tc.Types.Evidence Methods mempty :: HsWrapper # mappend :: HsWrapper -> HsWrapper -> HsWrapper # mconcat :: [HsWrapper] -> HsWrapper #
Semigroup HsWrapper	The Semigroup instance is a bit fishy, since `WpCompose`, as a data constructor, is "syntactic" and not associative. Concretely, if `a`, `b`, and `c` aren't `WpHole`: (a <> b) <> c ?= a <> (b <> c) > (a `WpCompose` b) `WpCompose` c /= @ a `WpCompose` (b `WpCompose` c) However these two associations are are "semantically equal" in the sense that they produce equal functions when passed to `GHC.HsToCore.Binds.dsHsWrapper`.
Instance details Defined in GHC.Tc.Types.Evidence Methods (<>) :: HsWrapper -> HsWrapper -> HsWrapper # sconcat :: NonEmpty HsWrapper -> HsWrapper # stimes :: Integral b => b -> HsWrapper -> HsWrapper #
Outputable HsWrapper
Instance details Defined in GHC.Tc.Types.Evidence Methods ppr :: HsWrapper -> SDoc #
ToHie (LocatedA HsWrapper)
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

type TcMCoercionR = MCoercionR #

type TcMCoercionN = MCoercionN #

type TcMCoercion = MCoercion #

type TcCoercionP = CoercionP #

type TcCoercionR = CoercionR #

type TcCoercionN = CoercionN #

type TcCoercion = Coercion #

data PotentialUnifiers #

Constructors

NoUnifiers
OneOrMoreUnifiers [ClsInst]

Instances

Instances details

Monoid PotentialUnifiers
Instance details Defined in GHC.Core.InstEnv Methods mempty :: PotentialUnifiers # mappend :: PotentialUnifiers -> PotentialUnifiers -> PotentialUnifiers # mconcat :: [PotentialUnifiers] -> PotentialUnifiers #
Semigroup PotentialUnifiers
Instance details Defined in GHC.Core.InstEnv Methods (<>) :: PotentialUnifiers -> PotentialUnifiers -> PotentialUnifiers # sconcat :: NonEmpty PotentialUnifiers -> PotentialUnifiers # stimes :: Integral b => b -> PotentialUnifiers -> PotentialUnifiers #
Outputable PotentialUnifiers
Instance details Defined in GHC.Core.InstEnv Methods ppr :: PotentialUnifiers -> SDoc #

type ClsInstLookupResult = ([InstMatch], PotentialUnifiers, [InstMatch]) #

type InstMatch = (ClsInst, [DFunInstType]) #

type DFunInstType = Maybe Type #

type VisibleOrphanModules = ModuleSet #

Set of visible orphan modules, according to what modules have been directly imported. This is based off of the dep_orphs field, which records transitively reachable orphan modules (modules that define orphan instances).

data InstEnvs #

InstEnvs represents the combination of the global type class instance environment, the local type class instance environment, and the set of transitively reachable orphan modules (according to what modules have been directly imported) used to test orphan instance visibility.

Constructors

InstEnvs
Fields ie_global :: InstEnv ie_local :: InstEnv ie_visible :: VisibleOrphanModules

data InstEnv #

Instances

Instances details

Outputable InstEnv
Instance details Defined in GHC.Core.InstEnv Methods ppr :: InstEnv -> SDoc #

data ClsInst #

A type-class instance. Note that there is some tricky laziness at work here. See Note [ClsInst laziness and the rough-match fields] for more details.

Constructors

ClsInst

Fields

is_cls_nm :: Name
Class name
is_tcs :: [RoughMatchTc]
Top of type args The class itself is always the first element of this list
is_dfun_name :: Name
is_dfun_name = idName . is_dfun.
We use is_dfun_name for the visibility check, instIsVisible, which needs to know the GenModule which the dictionary is defined in. However, we cannot use the GenModule attached to is_dfun since doing so would mean we would potentially pull in an entire interface file unnecessarily. This was the cause of #12367.
is_tvs :: [TyVar]
is_cls :: Class
is_tys :: [Type]
is_dfun :: DFunId
is_flag :: OverlapFlag
is_orphan :: IsOrphan

Instances

Instances details

Data ClsInst
Instance details Defined in GHC.Core.InstEnv Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ClsInst -> c ClsInst # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ClsInst # toConstr :: ClsInst -> Constr # dataTypeOf :: ClsInst -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ClsInst) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ClsInst) # gmapT :: (forall b. Data b => b -> b) -> ClsInst -> ClsInst # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ClsInst -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ClsInst -> r # gmapQ :: (forall d. Data d => d -> u) -> ClsInst -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> ClsInst -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ClsInst -> m ClsInst #
NamedThing ClsInst
Instance details Defined in GHC.Core.InstEnv Methods getOccName :: ClsInst -> OccName # getName :: ClsInst -> Name #
Outputable ClsInst
Instance details Defined in GHC.Core.InstEnv Methods ppr :: ClsInst -> SDoc #

data ModDetails #

The ModDetails is essentially a cache for information in the ModIface for home modules only. Information relating to packages will be loaded into global environments in ExternalPackageState.

Constructors

ModDetails

Fields

md_exports :: [AvailInfo]
md_types :: !TypeEnv
Local type environment for this particular module Includes Ids, TyCons, PatSyns
md_insts :: InstEnv
DFunIds for the instances in this module
md_fam_insts :: ![FamInst]
md_rules :: ![CoreRule]
Domain may include Ids from other modules
md_anns :: ![Annotation]
Annotations present in this module: currently they only annotate things also declared in this module
md_complete_matches :: [CompleteMatch]
Complete match pragmas for this module

Instances

Instances details

Show ModDetails Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> ModDetails -> ShowS # show :: ModDetails -> String # showList :: [ModDetails] -> ShowS #
NFData ModDetails Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ModDetails -> () #

data ModuleOrigin #

Given a module name, there may be multiple ways it came into scope, possibly simultaneously. This data type tracks all the possible ways it could have come into scope. Warning: don't use the record functions, they're partial!

Constructors

ModHidden	Module is hidden, and thus never will be available for import. (But maybe the user didn't realize), so we'll still keep track of these modules.)
ModUnusable UnusableUnitReason	Module is unavailable because the package is unusable.
ModOrigin	Module is public, and could have come from some places.
Fields fromOrigUnit :: Maybe Bool `Just False` means that this module is in someone's `exported-modules` list, but that package is hidden; `Just True` means that it is available; `Nothing` means neither applies. fromExposedReexport :: [UnitInfo] Is the module available from a reexport of an exposed package? There could be multiple. fromHiddenReexport :: [UnitInfo] Is the module available from a reexport of a hidden package? fromPackageFlag :: Bool Did the module export come from a package flag? (ToDo: track more information.

Instances

Instances details

Monoid ModuleOrigin
Instance details Defined in GHC.Unit.State Methods mempty :: ModuleOrigin # mappend :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin # mconcat :: [ModuleOrigin] -> ModuleOrigin #
Semigroup ModuleOrigin
Instance details Defined in GHC.Unit.State Methods (<>) :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin # sconcat :: NonEmpty ModuleOrigin -> ModuleOrigin # stimes :: Integral b => b -> ModuleOrigin -> ModuleOrigin #
Outputable ModuleOrigin
Instance details Defined in GHC.Unit.State Methods ppr :: ModuleOrigin -> SDoc #

data ImportAvails #

ImportAvails summarises what was imported from where, irrespective of whether the imported things are actually used or not. It is used:

when processing the export list,
when constructing usage info for the interface file,
to identify the list of directly imported modules for initialisation purposes and for optimised overlap checking of family instances,
when figuring out what things are really unused

Constructors

ImportAvails

Fields

imp_mods :: ImportedMods
Domain is all directly-imported modules
See the documentation on ImportedModsVal in GHC.Unit.Module.Imported for the meaning of the fields.
We need a full ModuleEnv rather than a ModuleNameEnv here, because we might be importing modules of the same name from different packages. (currently not the case, but might be in the future).
imp_direct_dep_mods :: InstalledModuleEnv ModuleNameWithIsBoot
Home-package modules directly imported by the module being compiled.
imp_dep_direct_pkgs :: Set UnitId
Packages directly needed by the module being compiled
imp_trust_own_pkg :: Bool
Do we require that our own package is trusted? This is to handle efficiently the case where a Safe module imports a Trustworthy module that resides in the same package as it. See Note [Trust Own Package] in GHC.Rename.Names
imp_trust_pkgs :: Set UnitId
This records the packages the current module needs to trust for Safe Haskell compilation to succeed. A package is required to be trusted if we are dependent on a trustworthy module in that package. See Note [Tracking Trust Transitively] in GHC.Rename.Names
imp_boot_mods :: InstalledModuleEnv ModuleNameWithIsBoot
Domain is all modules which have hs-boot files, and whether we should import the boot version of interface file. Only used in one-shot mode to populate eps_is_boot.
imp_sig_mods :: [ModuleName]
Signature modules below this one
imp_orphs :: [Module]
Orphan modules below us in the import tree (and maybe including us for imported modules)
imp_finsts :: [Module]
Family instance modules below us in the import tree (and maybe including us for imported modules)

data LibrarySpec #

Constructors

Objects [FilePath]
Archive FilePath
DLL String
DLLPath FilePath
Framework String

Instances

Instances details

Outputable LibrarySpec
Instance details Defined in GHC.Linker.Types Methods ppr :: LibrarySpec -> SDoc #

data SptEntry #

An entry to be inserted into a module's static pointer table. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable.

Constructors

SptEntry Id Fingerprint

Instances

Instances details

Outputable SptEntry
Instance details Defined in GHC.Linker.Types Methods ppr :: SptEntry -> SDoc #

data Unlinked #

Objects which have yet to be linked by the compiler

Constructors

DotO ObjFile	An object file (.o)
DotA FilePath	Static archive file (.a)
DotDLL FilePath	Dynamically linked library file (.so, .dll, .dylib)
CoreBindings WholeCoreBindings	Serialised core which we can turn into BCOs (or object files), or used by some other backend See Note [Interface Files with Core Definitions]
LoadedBCOs [Unlinked]	A list of BCOs, but hidden behind extra indirection to avoid being too strict.
BCOs CompiledByteCode [SptEntry]	A byte-code object, lives only in memory. Also carries some static pointer table entries which should be loaded along with the BCOs. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable.

Instances

Instances details

NFData Unlinked Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Unlinked -> () #
Outputable Unlinked
Instance details Defined in GHC.Linker.Types Methods ppr :: Unlinked -> SDoc #

type ObjFile = FilePath #

type LinkableSet = ModuleEnv Linkable #

data Linkable #

Information we can use to dynamically link modules into the compiler

Constructors

LM
Fields linkableTime :: !UTCTime Time at which this linkable was built (i.e. when the bytecodes were produced, or the mod date on the files) linkableModule :: !Module The linkable module itself linkableUnlinked :: [Unlinked] Those files and chunks of code we have yet to link. INVARIANT: A valid linkable always has at least one `Unlinked` item.

Instances

Instances details

Show Linkable Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> Linkable -> ShowS # show :: Linkable -> String # showList :: [Linkable] -> ShowS #
NFData Linkable Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Linkable -> () #
Outputable Linkable
Instance details Defined in GHC.Linker.Types Methods ppr :: Linkable -> SDoc #

data LoadedPkgInfo #

Constructors

LoadedPkgInfo
Fields loaded_pkg_uid :: !UnitId loaded_pkg_hs_objs :: ![LibrarySpec] loaded_pkg_non_hs_objs :: ![LibrarySpec] loaded_pkg_trans_deps :: UniqDSet UnitId

Instances

Instances details

Outputable LoadedPkgInfo
Instance details Defined in GHC.Linker.Types Methods ppr :: LoadedPkgInfo -> SDoc #

type PkgsLoaded = UniqDFM UnitId LoadedPkgInfo #

type ClosureEnv = NameEnv (Name, ForeignHValue) #

data LinkerEnv #

Constructors

LinkerEnv

Fields

closure_env :: ClosureEnv
Current global mapping from closure Names to their true values
itbl_env :: !ItblEnv
The current global mapping from RdrNames of DataCons to info table addresses. When a new Unlinked is linked into the running image, or an existing module in the image is replaced, the itbl_env must be updated appropriately.
addr_env :: !AddrEnv
Like closure_env and itbl_env, but for top-level 'Addr#' literals, see Note [Generating code for top-level string literal bindings] in GHC.StgToByteCode.

data LoaderState #

Constructors

LoaderState

Fields

linker_env :: !LinkerEnv
Current global mapping from Names to their true values
bcos_loaded :: !LinkableSet
The currently loaded interpreted modules (home package)
objs_loaded :: !LinkableSet
And the currently-loaded compiled modules (home package)
pkgs_loaded :: !PkgsLoaded
The currently-loaded packages; always object code haskell libraries, system libraries, transitive dependencies
temp_sos :: ![(FilePath, String)]
We need to remember the name of previous temporary DLL/.so libraries so we can link them (see #10322)

newtype Loader #

Constructors

Loader
Fields loader_state :: MVar (Maybe LoaderState)

data TargetId #

Constructors

TargetModule !ModuleName	A module name: search for the file
TargetFile !FilePath !(Maybe Phase)	A filename: preprocess & parse it to find the module name. If specified, the Phase indicates how to compile this file (which phase to start from). Nothing indicates the starting phase should be determined from the suffix of the filename.

Instances

Instances details

Outputable TargetId
Instance details Defined in GHC.Types.Target Methods ppr :: TargetId -> SDoc #
Eq TargetId
Instance details Defined in GHC.Types.Target Methods (==) :: TargetId -> TargetId -> Bool # (/=) :: TargetId -> TargetId -> Bool #

data Target #

A compilation target.

A target may be supplied with the actual text of the module. If so, use this instead of the file contents (this is for use in an IDE where the file hasn't been saved by the user yet).

These fields are strict because Targets are long lived.

Constructors

Target

Fields

targetId :: !TargetId
module or filename
targetAllowObjCode :: !Bool
object code allowed?
targetUnitId :: !UnitId
id of the unit this target is part of
targetContents :: !(Maybe (InputFileBuffer, UTCTime))
Optional in-memory buffer containing the source code GHC should use for this target instead of reading it from disk.
Since GHC version 8.10 modules which require preprocessors such as Literate Haskell or CPP to run are also supported.
If a corresponding source file does not exist on disk this will result in a SourceError exception if targetId = TargetModule _ is used. However together with targetId = TargetFile _ GHC will not complain about the file missing.

Instances

Instances details

Outputable Target
Instance details Defined in GHC.Types.Target Methods ppr :: Target -> SDoc #

data FinderOpts #

Locations and information the finder cares about.

Should be taken from DynFlags via initFinderOpts.

Constructors

FinderOpts

Fields

finder_importPaths :: [FilePath]
Where are we allowed to look for Modules and Source files
finder_lookupHomeInterfaces :: Bool
When looking up a home module:
- True: search interface files (e.g. in '-c' mode)
- False: search source files (e.g. in '--make' mode)
finder_bypassHiFileCheck :: Bool
Don't check that an imported interface file actually exists if it can only be at one location. The interface will be reported as InstalledFound even if the file doesn't exist, so this is only useful in specific cases (e.g. to generate dependencies with `ghc -M`)
finder_ways :: Ways
finder_enableSuggestions :: Bool
If we encounter unknown modules, should we suggest modules that have a similar name.
finder_workingDirectory :: Maybe FilePath
finder_thisPackageName :: Maybe FastString
finder_hiddenModules :: Set ModuleName
finder_reexportedModules :: Set ModuleName
finder_hieDir :: Maybe FilePath
finder_hieSuf :: String
finder_hiDir :: Maybe FilePath
finder_hiSuf :: String
finder_dynHiSuf :: String
finder_objectDir :: Maybe FilePath
finder_objectSuf :: String
finder_dynObjectSuf :: String
finder_stubDir :: Maybe FilePath

Instances

Instances details

Show FinderOpts
Instance details Defined in GHC.Unit.Finder.Types Methods showsPrec :: Int -> FinderOpts -> ShowS # show :: FinderOpts -> String # showList :: [FinderOpts] -> ShowS #

data FindResult #

The result of searching for an imported module.

NB: FindResult manages both user source-import lookups (which can result in GenModule) as well as direct imports for interfaces (which always result in InstalledModule).

Constructors

Found ModLocation Module	The module was found
NoPackage Unit	The requested unit was not found
FoundMultiple [(Module, ModuleOrigin)]	_Error_: both in multiple packages
NotFound	Not found
Fields fr_paths :: [FilePath] Places where I looked fr_pkg :: Maybe Unit Just p => module is in this unit's manifest, but couldn't find the .hi file fr_mods_hidden :: [Unit] Module is in these units, but the module is hidden fr_pkgs_hidden :: [Unit] Module is in these units, but the unit is hidden fr_unusables :: [(Unit, UnusableUnitReason)] Module is in these units, but it is unusable fr_suggestions :: [ModuleSuggestion] Possible mis-spelled modules

data InstalledFindResult #

Constructors

InstalledFound ModLocation InstalledModule
InstalledNoPackage UnitId
InstalledNotFound [FilePath] (Maybe UnitId)

data FinderCache #

Constructors

FinderCache
Fields fcModuleCache :: IORef FinderCacheState fcFileCache :: IORef FileCacheState

type FinderCacheState = InstalledModuleEnv InstalledFindResult #

The FinderCache maps modules to the result of searching for that module. It records the results of searching for modules along the search path. On :load, we flush the entire contents of this cache.

data IOEnvFailure #

Constructors

IOEnvFailure

Instances

Instances details

Exception IOEnvFailure
Instance details Defined in GHC.Data.IOEnv Methods toException :: IOEnvFailure -> SomeException # fromException :: SomeException -> Maybe IOEnvFailure # displayException :: IOEnvFailure -> String #
Show IOEnvFailure
Instance details Defined in GHC.Data.IOEnv Methods showsPrec :: Int -> IOEnvFailure -> ShowS # show :: IOEnvFailure -> String # showList :: [IOEnvFailure] -> ShowS #

data IOEnv env a #

Instances

Instances details

MonadFail (IOEnv m)
Instance details Defined in GHC.Data.IOEnv Methods fail :: String -> IOEnv m a #
MonadFix (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods mfix :: (a -> IOEnv env a) -> IOEnv env a #
MonadIO (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods liftIO :: IO a -> IOEnv env a #
Alternative (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods empty :: IOEnv env a # (<\|>) :: IOEnv env a -> IOEnv env a -> IOEnv env a # some :: IOEnv env a -> IOEnv env [a] # many :: IOEnv env a -> IOEnv env [a] #
Applicative (IOEnv m)
Instance details Defined in GHC.Data.IOEnv Methods pure :: a -> IOEnv m a # (<>) :: IOEnv m (a -> b) -> IOEnv m a -> IOEnv m b # liftA2 :: (a -> b -> c) -> IOEnv m a -> IOEnv m b -> IOEnv m c # (>) :: IOEnv m a -> IOEnv m b -> IOEnv m b # (<*) :: IOEnv m a -> IOEnv m b -> IOEnv m a #
Functor (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods fmap :: (a -> b) -> IOEnv env a -> IOEnv env b # (<$) :: a -> IOEnv env b -> IOEnv env a #
Monad (IOEnv m)
Instance details Defined in GHC.Data.IOEnv Methods (>>=) :: IOEnv m a -> (a -> IOEnv m b) -> IOEnv m b # (>>) :: IOEnv m a -> IOEnv m b -> IOEnv m b # return :: a -> IOEnv m a #
MonadPlus (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods mzero :: IOEnv env a # mplus :: IOEnv env a -> IOEnv env a -> IOEnv env a #
MonadCatch (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods catch :: (HasCallStack, Exception e) => IOEnv env a -> (e -> IOEnv env a) -> IOEnv env a #
MonadMask (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods mask :: HasCallStack => ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b # uninterruptibleMask :: HasCallStack => ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b # generalBracket :: HasCallStack => IOEnv env a -> (a -> ExitCase b -> IOEnv env c) -> (a -> IOEnv env b) -> IOEnv env (b, c) #
MonadThrow (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods throwM :: (HasCallStack, Exception e) => e -> IOEnv env a #
ContainsHooks env => HasHooks (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods getHooks :: IOEnv env Hooks #
ContainsDynFlags env => HasDynFlags (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods getDynFlags :: IOEnv env DynFlags #
ContainsModule env => HasModule (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods getModule :: IOEnv env Module #
ContainsLogger env => HasLogger (IOEnv env)
Instance details Defined in GHC.Data.IOEnv Methods getLogger :: IOEnv env Logger #

data TcSpecPrag #

Type checker Specification Pragma

Constructors

SpecPrag Id HsWrapper InlinePragma

The Id to be specialised, a wrapper that specialises the polymorphic function, and inlining spec for the specialised function

Instances

Instances details

Data TcSpecPrag
Instance details Defined in GHC.Hs.Binds Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcSpecPrag -> c TcSpecPrag # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcSpecPrag # toConstr :: TcSpecPrag -> Constr # dataTypeOf :: TcSpecPrag -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcSpecPrag) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcSpecPrag) # gmapT :: (forall b. Data b => b -> b) -> TcSpecPrag -> TcSpecPrag # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrag -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrag -> r # gmapQ :: (forall d. Data d => d -> u) -> TcSpecPrag -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> TcSpecPrag -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag #
Outputable TcSpecPrag
Instance details Defined in GHC.Hs.Binds Methods ppr :: TcSpecPrag -> SDoc #

type LTcSpecPrag = Located TcSpecPrag #

Located Type checker Specification Pragmas

data TcSpecPrags #

Type checker Specialisation Pragmas

TcSpecPrags conveys SPECIALISE pragmas from the type checker to the desugarer

Constructors

IsDefaultMethod	Super-specialised: a default method should be macro-expanded at every call site
SpecPrags [LTcSpecPrag]

Instances

Instances details

Data TcSpecPrags

Instance details

Defined in GHC.Hs.Binds

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcSpecPrags -> c TcSpecPrags #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcSpecPrags #

toConstr :: TcSpecPrags -> Constr #

dataTypeOf :: TcSpecPrags -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> TcSpecPrags -> TcSpecPrags #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrags -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrags -> r #

gmapQ :: (forall d. Data d => d -> u) -> TcSpecPrags -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> TcSpecPrags -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags #

data AnnSig #

Constructors

AnnSig
Fields asDcolon :: AddEpAnn asRest :: [AddEpAnn]

Instances

Instances details

Data AnnSig

Instance details

Defined in GHC.Hs.Binds

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnSig -> c AnnSig #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnSig #

toConstr :: AnnSig -> Constr #

dataTypeOf :: AnnSig -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> AnnSig -> AnnSig #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnSig -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnSig -> r #

gmapQ :: (forall d. Data d => d -> u) -> AnnSig -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnSig -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnSig -> m AnnSig #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnSig -> m AnnSig #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnSig -> m AnnSig #

newtype IdSig #

A type signature in generated code, notably the code generated for record selectors. We simply record the desired Id itself, replete with its name, type and IdDetails. Otherwise it's just like a type signature: there should be an accompanying binding

Constructors

IdSig
Fields unIdSig :: Id

Instances

Instances details

Data IdSig

Instance details

Defined in GHC.Hs.Binds

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IdSig -> c IdSig #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IdSig #

toConstr :: IdSig -> Constr #

dataTypeOf :: IdSig -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> IdSig -> IdSig #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IdSig -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IdSig -> r #

gmapQ :: (forall d. Data d => d -> u) -> IdSig -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> IdSig -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IdSig -> m IdSig #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IdSig -> m IdSig #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IdSig -> m IdSig #

data ABExport #

Abstraction Bindings Export

Constructors

ABE
Fields abe_poly :: Id Any INLINE pragma is attached to this Id abe_mono :: Id abe_wrap :: HsWrapper See Note [ABExport wrapper] Shape: (forall abs_tvs. abs_ev_vars => abe_mono) ~ abe_poly abe_prags :: TcSpecPrags SPECIALISE pragmas

Instances

Instances details

Outputable ABExport
Instance details Defined in GHC.Hs.Binds Methods ppr :: ABExport -> SDoc #

data AbsBinds #

Typechecked, generalised bindings, used in the output to the type checker. See Note [AbsBinds].

Constructors

AbsBinds

Fields

abs_tvs :: [TyVar]
abs_ev_vars :: [EvVar]
Includes equality constraints
abs_exports :: [ABExport]
AbsBinds only gets used when idL = idR after renaming, but these need to be idL's for the collect... code in HsUtil to have the right type
abs_ev_binds :: [TcEvBinds]
Evidence bindings Why a list? See GHC.Tc.TyCl.Instance Note [Typechecking plan for instance declarations]
abs_binds :: LHsBinds GhcTc
Typechecked user bindings
abs_sig :: Bool

data NHsValBindsLR idL #

Constructors

NValBinds [(RecFlag, LHsBinds idL)] [LSig GhcRn]

Instances

Instances details

HiePass p => ToHie (RScoped (NHsValBindsLR (GhcPass p)))
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: RScoped (NHsValBindsLR (GhcPass p)) -> HieM [HieAST Type]

data ConPatTc #

This is the extension field for ConPat, added after typechecking It adds quite a few extra fields, to support elaboration of pattern matching.

Constructors

ConPatTc

Fields

cpt_arg_tys :: [Type]
The universal arg types 1-1 with the universal tyvars of the constructor/pattern synonym Use (conLikeResTy pat_con cpt_arg_tys) to get the type of the pattern
cpt_tvs :: [TyVar]
Existentially bound type variables in correctly-scoped order e.g. [k:* x:k]
cpt_dicts :: [EvVar]
Ditto *coercion variables* and *dictionaries* One reason for putting coercion variable here I think is to ensure their kinds are zonked
cpt_binds :: TcEvBinds
Bindings involving those dictionaries
cpt_wrap :: HsWrapper
Extra wrapper to pass to the matcher Only relevant for pattern-synonyms; ignored for data cons

data HsPatExpansion a b #

Constructors

HsPatExpanded a b

Instances

Instances details

(Data a, Data b) => Data (HsPatExpansion a b)
Instance details Defined in GHC.Hs.Pat Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> HsPatExpansion a b -> c (HsPatExpansion a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsPatExpansion a b) # toConstr :: HsPatExpansion a b -> Constr # dataTypeOf :: HsPatExpansion a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsPatExpansion a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsPatExpansion a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> HsPatExpansion a b -> HsPatExpansion a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsPatExpansion a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsPatExpansion a b -> r # gmapQ :: (forall d. Data d => d -> u) -> HsPatExpansion a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsPatExpansion a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsPatExpansion a b -> m (HsPatExpansion a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPatExpansion a b -> m (HsPatExpansion a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPatExpansion a b -> m (HsPatExpansion a b) #
(Outputable a, Outputable b) => Outputable (HsPatExpansion a b)
Instance details Defined in GHC.Hs.Pat Methods ppr :: HsPatExpansion a b -> SDoc #

data XXPatGhcTc #

Extension constructor for Pat, added after typechecking.

Constructors

CoPat

Coercion Pattern (translation only)

During desugaring a (CoPat co pat) turns into a cast with co on the scrutinee, followed by a match on pat.

Fields

co_cpt_wrap :: HsWrapper
Coercion Pattern If co :: t1 ~ t2, p :: t2, then (CoPat co p) :: t1
co_pat_inner :: Pat GhcTc
Why not LPat? Ans: existing locn will do
co_pat_ty :: Type
Type of whole pattern, t1

ExpansionPat (Pat GhcRn) (Pat GhcTc)

Pattern expansion: original pattern, and desugared pattern, for RebindableSyntax and other overloaded syntax such as OverloadedLists. See Note [Rebindable syntax and HsExpansion].

data EpAnnSumPat #

Constructors

EpAnnSumPat
Fields sumPatParens :: [AddEpAnn] sumPatVbarsBefore :: [EpaLocation] sumPatVbarsAfter :: [EpaLocation]

Instances

Instances details

Data EpAnnSumPat

Instance details

Defined in GHC.Hs.Pat

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnnSumPat -> c EpAnnSumPat #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpAnnSumPat #

toConstr :: EpAnnSumPat -> Constr #

dataTypeOf :: EpAnnSumPat -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> EpAnnSumPat -> EpAnnSumPat #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnSumPat -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnSumPat -> r #

gmapQ :: (forall d. Data d => d -> u) -> EpAnnSumPat -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnnSumPat -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnnSumPat -> m EpAnnSumPat #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnSumPat -> m EpAnnSumPat #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnSumPat -> m EpAnnSumPat #

data HsRuleAnn #

Constructors

HsRuleAnn
Fields ra_tyanns :: Maybe (AddEpAnn, AddEpAnn) The locations of `forall` and `.` for forall'd type vars Using AddEpAnn to capture possible unicode variants ra_tmanns :: Maybe (AddEpAnn, AddEpAnn) The locations of `forall` and `.` for forall'd term vars Using AddEpAnn to capture possible unicode variants ra_rest :: [AddEpAnn]

Instances

Instances details

Data HsRuleAnn
Instance details Defined in GHC.Hs.Decls Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsRuleAnn -> c HsRuleAnn # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsRuleAnn # toConstr :: HsRuleAnn -> Constr # dataTypeOf :: HsRuleAnn -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsRuleAnn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsRuleAnn) # gmapT :: (forall b. Data b => b -> b) -> HsRuleAnn -> HsRuleAnn # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleAnn -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleAnn -> r # gmapQ :: (forall d. Data d => d -> u) -> HsRuleAnn -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsRuleAnn -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn #
Eq HsRuleAnn
Instance details Defined in GHC.Hs.Decls Methods (==) :: HsRuleAnn -> HsRuleAnn -> Bool # (/=) :: HsRuleAnn -> HsRuleAnn -> Bool #

data HsRuleRn #

Constructors

HsRuleRn NameSet NameSet

Instances

Instances details

Data HsRuleRn

Instance details

Defined in GHC.Hs.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsRuleRn -> c HsRuleRn #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsRuleRn #

toConstr :: HsRuleRn -> Constr #

dataTypeOf :: HsRuleRn -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> HsRuleRn -> HsRuleRn #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r #

gmapQ :: (forall d. Data d => d -> u) -> HsRuleRn -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsRuleRn -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn #

data XViaStrategyPs #

Constructors

XViaStrategyPs (EpAnn [AddEpAnn]) (LHsSigType GhcPs)

Instances

Instances details

Outputable XViaStrategyPs
Instance details Defined in GHC.Hs.Decls Methods ppr :: XViaStrategyPs -> SDoc #

data DataDeclRn #

Constructors

DataDeclRn
Fields tcdDataCusk :: Bool does this have a CUSK? See Note [CUSKs: complete user-supplied kind signatures] tcdFVs :: NameSet

Instances

Instances details

Data DataDeclRn

Instance details

Defined in GHC.Hs.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataDeclRn -> c DataDeclRn #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataDeclRn #

toConstr :: DataDeclRn -> Constr #

dataTypeOf :: DataDeclRn -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> DataDeclRn -> DataDeclRn #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r #

gmapQ :: (forall d. Data d => d -> u) -> DataDeclRn -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataDeclRn -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn #

data PendingTcSplice #

Pending Type-checker Splice

Constructors

PendingTcSplice SplicePointName (LHsExpr GhcTc)

Instances

Instances details

ToHie PendingTcSplice
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PendingTcSplice -> HieM [HieAST Type]
Outputable PendingTcSplice
Instance details Defined in GHC.Hs.Expr Methods ppr :: PendingTcSplice -> SDoc #

data PendingRnSplice #

Pending Renamer Splice

Constructors

PendingRnSplice UntypedSpliceFlavour SplicePointName (LHsExpr GhcRn)

Instances

Instances details

ToHie PendingRnSplice
Instance details Defined in GHC.Iface.Ext.Ast Methods toHie :: PendingRnSplice -> HieM [HieAST Type]
Outputable PendingRnSplice
Instance details Defined in GHC.Hs.Expr Methods ppr :: PendingRnSplice -> SDoc #

data UntypedSpliceFlavour #

Constructors

UntypedExpSplice
UntypedPatSplice
UntypedTypeSplice
UntypedDeclSplice

Instances

Instances details

Data UntypedSpliceFlavour

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UntypedSpliceFlavour -> c UntypedSpliceFlavour #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UntypedSpliceFlavour #

toConstr :: UntypedSpliceFlavour -> Constr #

dataTypeOf :: UntypedSpliceFlavour -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> UntypedSpliceFlavour -> UntypedSpliceFlavour #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UntypedSpliceFlavour -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UntypedSpliceFlavour -> r #

gmapQ :: (forall d. Data d => d -> u) -> UntypedSpliceFlavour -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> UntypedSpliceFlavour -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour #

data DelayedSplice #

Constructors

DelayedSplice TcLclEnv (LHsExpr GhcRn) TcType (LHsExpr GhcTc)

Instances

Instances details

Data DelayedSplice

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DelayedSplice -> c DelayedSplice #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DelayedSplice #

toConstr :: DelayedSplice -> Constr #

dataTypeOf :: DelayedSplice -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> DelayedSplice -> DelayedSplice #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DelayedSplice -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DelayedSplice -> r #

gmapQ :: (forall d. Data d => d -> u) -> DelayedSplice -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> DelayedSplice -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DelayedSplice -> m DelayedSplice #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DelayedSplice -> m DelayedSplice #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DelayedSplice -> m DelayedSplice #

data XBindStmtTc #

Constructors

XBindStmtTc
Fields xbstc_bindOp :: SyntaxExpr GhcTc xbstc_boundResultType :: Type xbstc_boundResultMult :: Mult xbstc_failOp :: FailOperator GhcTc

data XBindStmtRn #

Constructors

XBindStmtRn
Fields xbsrn_bindOp :: SyntaxExpr GhcRn xbsrn_failOp :: FailOperator GhcRn

data RecStmtTc #

Constructors

RecStmtTc
Fields recS_bind_ty :: Type recS_later_rets :: [PostTcExpr] recS_rec_rets :: [PostTcExpr] recS_ret_ty :: Type

data GrhsAnn #

Constructors

GrhsAnn
Fields ga_vbar :: Maybe EpaLocation ga_sep :: AddEpAnn Match separator location

Instances

Instances details

Data GrhsAnn
Instance details Defined in GHC.Hs.Expr Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GrhsAnn -> c GrhsAnn # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GrhsAnn # toConstr :: GrhsAnn -> Constr # dataTypeOf :: GrhsAnn -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GrhsAnn) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GrhsAnn) # gmapT :: (forall b. Data b => b -> b) -> GrhsAnn -> GrhsAnn # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GrhsAnn -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GrhsAnn -> r # gmapQ :: (forall d. Data d => d -> u) -> GrhsAnn -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GrhsAnn -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GrhsAnn -> m GrhsAnn # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GrhsAnn -> m GrhsAnn # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GrhsAnn -> m GrhsAnn #
Outputable GrhsAnn
Instance details Defined in GHC.Hs.Expr Methods ppr :: GrhsAnn -> SDoc #

data MatchGroupTc #

Constructors

MatchGroupTc
Fields mg_arg_tys :: [Scaled Type] mg_res_ty :: Type mg_origin :: Origin

Instances

Instances details

Data MatchGroupTc

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MatchGroupTc -> c MatchGroupTc #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MatchGroupTc #

toConstr :: MatchGroupTc -> Constr #

dataTypeOf :: MatchGroupTc -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> MatchGroupTc -> MatchGroupTc #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MatchGroupTc -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MatchGroupTc -> r #

gmapQ :: (forall d. Data d => d -> u) -> MatchGroupTc -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> MatchGroupTc -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc #

data CmdTopTc #

Constructors

CmdTopTc Type Type (CmdSyntaxTable GhcTc)

type CmdSyntaxTable p = [(Name, HsExpr p)] #

Command Syntax Table (for Arrow syntax)

data HsExpansion orig expanded #

Constructors

HsExpanded orig expanded

Instances

Instances details

(Data orig, Data expanded) => Data (HsExpansion orig expanded)
Instance details Defined in GHC.Hs.Expr Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsExpansion orig expanded -> c (HsExpansion orig expanded) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsExpansion orig expanded) # toConstr :: HsExpansion orig expanded -> Constr # dataTypeOf :: HsExpansion orig expanded -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsExpansion orig expanded)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsExpansion orig expanded)) # gmapT :: (forall b. Data b => b -> b) -> HsExpansion orig expanded -> HsExpansion orig expanded # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsExpansion orig expanded -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsExpansion orig expanded -> r # gmapQ :: (forall d. Data d => d -> u) -> HsExpansion orig expanded -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HsExpansion orig expanded -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsExpansion orig expanded -> m (HsExpansion orig expanded) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsExpansion orig expanded -> m (HsExpansion orig expanded) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsExpansion orig expanded -> m (HsExpansion orig expanded) #
(Outputable a, Outputable b) => Outputable (HsExpansion a b)	Just print the original expression (the `a`).
Instance details Defined in GHC.Hs.Expr Methods ppr :: HsExpansion a b -> SDoc #

data XXExprGhcTc #

Constructors

WrapExpr !(HsWrap HsExpr)
ExpansionExpr !(HsExpansion (HsExpr GhcRn) (HsExpr GhcTc))
ConLikeTc ConLike [TcTyVar] [Scaled TcType]
HsTick CoreTickish (LHsExpr GhcTc)
HsBinTick Int Int (LHsExpr GhcTc)

Instances

Instances details

Outputable XXExprGhcTc
Instance details Defined in GHC.Hs.Expr Methods ppr :: XXExprGhcTc -> SDoc #

data AnnsIf #

Constructors

AnnsIf
Fields aiIf :: EpaLocation aiThen :: EpaLocation aiElse :: EpaLocation aiThenSemi :: Maybe EpaLocation aiElseSemi :: Maybe EpaLocation

Instances

Instances details

Data AnnsIf

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnsIf -> c AnnsIf #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnsIf #

toConstr :: AnnsIf -> Constr #

dataTypeOf :: AnnsIf -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> AnnsIf -> AnnsIf #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnsIf -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnsIf -> r #

gmapQ :: (forall d. Data d => d -> u) -> AnnsIf -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnsIf -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnsIf -> m AnnsIf #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsIf -> m AnnsIf #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsIf -> m AnnsIf #

data AnnProjection #

Constructors

AnnProjection
Fields apOpen :: EpaLocation '(' apClose :: EpaLocation ')'

Instances

Instances details

Data AnnProjection

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnProjection -> c AnnProjection #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnProjection #

toConstr :: AnnProjection -> Constr #

dataTypeOf :: AnnProjection -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> AnnProjection -> AnnProjection #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnProjection -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnProjection -> r #

gmapQ :: (forall d. Data d => d -> u) -> AnnProjection -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnProjection -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnProjection -> m AnnProjection #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnProjection -> m AnnProjection #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnProjection -> m AnnProjection #

data AnnFieldLabel #

Constructors

AnnFieldLabel
Fields afDot :: Maybe EpaLocation

Instances

Instances details

Data AnnFieldLabel

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnFieldLabel -> c AnnFieldLabel #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnFieldLabel #

toConstr :: AnnFieldLabel -> Constr #

dataTypeOf :: AnnFieldLabel -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> AnnFieldLabel -> AnnFieldLabel #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnFieldLabel -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnFieldLabel -> r #

gmapQ :: (forall d. Data d => d -> u) -> AnnFieldLabel -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnFieldLabel -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnFieldLabel -> m AnnFieldLabel #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnFieldLabel -> m AnnFieldLabel #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnFieldLabel -> m AnnFieldLabel #

data AnnExplicitSum #

Constructors

AnnExplicitSum
Fields aesOpen :: EpaLocation aesBarsBefore :: [EpaLocation] aesBarsAfter :: [EpaLocation] aesClose :: EpaLocation

Instances

Instances details

Data AnnExplicitSum

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnExplicitSum -> c AnnExplicitSum #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnExplicitSum #

toConstr :: AnnExplicitSum -> Constr #

dataTypeOf :: AnnExplicitSum -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> AnnExplicitSum -> AnnExplicitSum #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnExplicitSum -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnExplicitSum -> r #

gmapQ :: (forall d. Data d => d -> u) -> AnnExplicitSum -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnExplicitSum -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnExplicitSum -> m AnnExplicitSum #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnExplicitSum -> m AnnExplicitSum #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnExplicitSum -> m AnnExplicitSum #

data EpAnnUnboundVar #

Constructors

EpAnnUnboundVar
Fields hsUnboundBackquotes :: (EpaLocation, EpaLocation) hsUnboundHole :: EpaLocation

Instances

Instances details

Data EpAnnUnboundVar

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnnUnboundVar -> c EpAnnUnboundVar #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpAnnUnboundVar #

toConstr :: EpAnnUnboundVar -> Constr #

dataTypeOf :: EpAnnUnboundVar -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> EpAnnUnboundVar -> EpAnnUnboundVar #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnUnboundVar -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnUnboundVar -> r #

gmapQ :: (forall d. Data d => d -> u) -> EpAnnUnboundVar -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnnUnboundVar -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnnUnboundVar -> m EpAnnUnboundVar #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnUnboundVar -> m EpAnnUnboundVar #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnUnboundVar -> m EpAnnUnboundVar #

data EpAnnHsCase #

Constructors

EpAnnHsCase
Fields hsCaseAnnCase :: EpaLocation hsCaseAnnOf :: EpaLocation hsCaseAnnsRest :: [AddEpAnn]

Instances

Instances details

Data EpAnnHsCase

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnnHsCase -> c EpAnnHsCase #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpAnnHsCase #

toConstr :: EpAnnHsCase -> Constr #

dataTypeOf :: EpAnnHsCase -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> EpAnnHsCase -> EpAnnHsCase #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnHsCase -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnHsCase -> r #

gmapQ :: (forall d. Data d => d -> u) -> EpAnnHsCase -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnnHsCase -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnnHsCase -> m EpAnnHsCase #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnHsCase -> m EpAnnHsCase #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnHsCase -> m EpAnnHsCase #

data HsBracketTc #

Constructors

HsBracketTc
Fields hsb_quote :: HsQuote GhcRn hsb_ty :: Type hsb_wrap :: Maybe QuoteWrapper hsb_splices :: [PendingTcSplice]

data HsWrap (hs_syn :: Type -> Type) #

HsWrap appears only in typechecker output

Constructors

HsWrap HsWrapper (hs_syn GhcTc)

Instances

Instances details

(Data (hs_syn GhcTc), Typeable hs_syn) => Data (HsWrap hs_syn)

Instance details

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsWrap hs_syn -> c (HsWrap hs_syn) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsWrap hs_syn) #

toConstr :: HsWrap hs_syn -> Constr #

dataTypeOf :: HsWrap hs_syn -> DataType #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsWrap hs_syn)) #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsWrap hs_syn)) #

gmapT :: (forall b. Data b => b -> b) -> HsWrap hs_syn -> HsWrap hs_syn #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsWrap hs_syn -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsWrap hs_syn -> r #

gmapQ :: (forall d. Data d => d -> u) -> HsWrap hs_syn -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsWrap hs_syn -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsWrap hs_syn -> m (HsWrap hs_syn) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrap hs_syn -> m (HsWrap hs_syn) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrap hs_syn -> m (HsWrap hs_syn) #

data SyntaxExprTc #

An expression with wrappers, used for rebindable syntax

This should desugar to

syn_res_wrap $ syn_expr (syn_arg_wraps[0] arg0)
                        (syn_arg_wraps[1] arg1) ...

where the actual arguments come from elsewhere in the AST.

Constructors

SyntaxExprTc
Fields syn_expr :: HsExpr GhcTc syn_arg_wraps :: [HsWrapper] syn_res_wrap :: HsWrapper
NoSyntaxExprTc

Instances

Instances details

Outputable SyntaxExprTc
Instance details Defined in GHC.Hs.Expr Methods ppr :: SyntaxExprTc -> SDoc #

data SyntaxExprRn #

The function to use in rebindable syntax. See Note [NoSyntaxExpr].

Constructors

SyntaxExprRn (HsExpr GhcRn)
NoSyntaxExprRn

Instances

Instances details

Outputable SyntaxExprRn
Instance details Defined in GHC.Hs.Expr Methods ppr :: SyntaxExprRn -> SDoc #

type family SyntaxExprGhc (p :: Pass) = (r :: Type) | r -> p where ... #

Equations

SyntaxExprGhc 'Parsed = NoExtField
SyntaxExprGhc 'Renamed = SyntaxExprRn
SyntaxExprGhc 'Typechecked = SyntaxExprTc

type PostTcTable = [(Name, PostTcExpr)] #

Post-Type checking Table

We use a PostTcTable where there are a bunch of pieces of evidence, more than is convenient to keep individually.

type PostTcExpr = HsExpr GhcTc #

Post-Type checking Expression

PostTcExpr is an evidence expression attached to the syntax tree by the type checker (c.f. postTcType).

class UnXRec p => CollectPass p where #

This class specifies how to collect variable identifiers from extension patterns in the given pass. Consumers of the GHC API that define their own passes should feel free to implement instances in order to make use of functions which depend on it.

In particular, Haddock already makes use of this, with an instance for its DocNameI pass so that it can reuse the code in GHC for collecting binders.

Methods

collectXXPat :: CollectFlag p -> XXPat p -> [IdP p] -> [IdP p] #

collectXXHsBindsLR :: XXHsBindsLR p pR -> [IdP p] -> [IdP p] #

collectXSplicePat :: CollectFlag p -> XSplicePat p -> [IdP p] -> [IdP p] #

Instances

Instances details

IsPass p => CollectPass (GhcPass p)
Instance details Defined in GHC.Hs.Utils Methods collectXXPat :: CollectFlag (GhcPass p) -> XXPat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] # collectXXHsBindsLR :: XXHsBindsLR (GhcPass p) pR -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] # collectXSplicePat :: CollectFlag (GhcPass p) -> XSplicePat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)] #

data CollectFlag p where #

Indicate if evidence binders have to be collected.

This type is used as a boolean (should we collect evidence binders or not?) but also to pass an evidence that the AST has been typechecked when we do want to collect evidence binders, otherwise these binders are not available.

See Note [Dictionary binders in ConPatOut]

Constructors

CollNoDictBinders :: forall p. CollectFlag p	Don't collect evidence binders
CollWithDictBinders :: CollectFlag (GhcPass 'Typechecked)	Collect evidence binders

data CgGuts #

A restricted form of ModGuts for code generation purposes

Constructors

CgGuts

Fields

cg_module :: !Module
Module being compiled
cg_tycons :: [TyCon]
Algebraic data types (including ones that started life as classes); generate constructors and info tables. Includes newtypes, just for the benefit of External Core
cg_binds :: CoreProgram
The tidied main bindings, including previously-implicit bindings for record and class selectors, and data constructor wrappers. But *not* data constructor workers; reason: we regard them as part of the code-gen of tycons
cg_ccs :: [CostCentre]
cg_foreign :: !ForeignStubs
Foreign export stubs
cg_foreign_files :: ![(ForeignSrcLang, FilePath)]
cg_dep_pkgs :: !(Set UnitId)
Dependent packages, used to generate #includes for C code gen
cg_hpc_info :: !HpcInfo
Program coverage tick box information
cg_modBreaks :: !(Maybe ModBreaks)
Module breakpoints
cg_spt_entries :: [SptEntry]
Static pointer table entries for static forms defined in the module. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable

Instances

Instances details

Show CgGuts Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> CgGuts -> ShowS # show :: CgGuts -> String # showList :: [CgGuts] -> ShowS #
NFData CgGuts Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: CgGuts -> () #

data ModGuts #

A ModGuts is carried through the compiler, accumulating stuff as it goes There is only one ModGuts at any time, the one for the module being compiled right now. Once it is compiled, a ModIface and ModDetails are extracted and the ModGuts is discarded.

Constructors

ModGuts

Fields

mg_module :: !Module
Module being compiled
mg_hsc_src :: HscSource
Whether it's an hs-boot module
mg_loc :: SrcSpan
For error messages from inner passes
mg_exports :: ![AvailInfo]
What it exports
mg_deps :: !Dependencies
What it depends on, directly or otherwise
mg_usages :: ![Usage]
What was used? Used for interfaces.
mg_used_th :: !Bool
Did we run a TH splice?
mg_rdr_env :: !GlobalRdrEnv
Top-level lexical environment
mg_fix_env :: !FixityEnv
Fixities declared in this module. Used for creating interface files.
mg_tcs :: ![TyCon]
TyCons declared in this module (includes TyCons for classes)
mg_insts :: ![ClsInst]
Class instances declared in this module
mg_fam_insts :: ![FamInst]
Family instances declared in this module
mg_patsyns :: ![PatSyn]
Pattern synonyms declared in this module
mg_rules :: ![CoreRule]
Before the core pipeline starts, contains See Note [Overall plumbing for rules] in GHC.Core.Rules
mg_binds :: !CoreProgram
Bindings for this module
mg_foreign :: !ForeignStubs
Foreign exports declared in this module
mg_foreign_files :: ![(ForeignSrcLang, FilePath)]
Files to be compiled with the C compiler
mg_warns :: !(Warnings GhcRn)
Warnings declared in the module
mg_anns :: [Annotation]
Annotations declared in this module
mg_complete_matches :: [CompleteMatch]
Complete Matches
mg_hpc_info :: !HpcInfo
Coverage tick boxes in the module
mg_modBreaks :: !(Maybe ModBreaks)
Breakpoints for the module
mg_inst_env :: InstEnv
Class instance environment for home-package modules (including this one); c.f. tcg_inst_env
mg_fam_inst_env :: FamInstEnv
Type-family instance environment for home-package modules (including this one); c.f. tcg_fam_inst_env
mg_boot_exports :: !NameSet
mg_safe_haskell :: SafeHaskellMode
Safe Haskell mode
mg_trust_pkg :: Bool
Do we need to trust our own package for Safe Haskell? See Note [Trust Own Package] in GHC.Rename.Names
mg_docs :: !(Maybe Docs)
Documentation.

Instances

Instances details

Show ModGuts Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> ModGuts -> ShowS # show :: ModGuts -> String # showList :: [ModGuts] -> ShowS #
NFData ModGuts Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ModGuts -> () #

type IfaceExport = AvailInfo #

The original names declared of a certain module that are exported

data ModIface_ (phase :: ModIfacePhase) #

A ModIface plus a ModDetails summarises everything we know about a compiled module. The ModIface is the stuff *before* linking, and can be written out to an interface file. The 'ModDetails is after linking and can be completely recovered from just the ModIface.

When we read an interface file, we also construct a ModIface from it, except that we explicitly make the mi_decls and a few other fields empty; as when reading we consolidate the declarations etc. into a number of indexed maps and environments in the ExternalPackageState.

See Note [Strictness in ModIface] to learn about why some fields are strict and others are not.

Constructors

ModIface

Fields

mi_module :: !Module
Name of the module we are for
mi_sig_of :: !(Maybe Module)
Are we a sig of another mod?
mi_hsc_src :: !HscSource
Boot? Signature?
mi_deps :: Dependencies
The dependencies of the module. This is consulted for directly-imported modules, but not for anything else (hence lazy)
mi_usages :: [Usage]
Usages; kept sorted so that it's easy to decide whether to write a new iface file (changing usages doesn't affect the hash of this module) NOT STRICT! we read this field lazily from the interface file It is *only* consulted by the recompilation checker
mi_exports :: ![IfaceExport]
Exports Kept sorted by (mod,occ), to make version comparisons easier Records the modules that are the declaration points for things exported by this module, and the OccNames of those things
mi_used_th :: !Bool
Module required TH splices when it was compiled. This disables recompilation avoidance (see #481).
mi_fixities :: [(OccName, Fixity)]
Fixities NOT STRICT! we read this field lazily from the interface file
mi_warns :: Warnings GhcRn
Warnings NOT STRICT! we read this field lazily from the interface file
mi_anns :: [IfaceAnnotation]
Annotations NOT STRICT! we read this field lazily from the interface file
mi_decls :: [IfaceDeclExts phase]
Type, class and variable declarations The hash of an Id changes if its fixity or deprecations change (as well as its type of course) Ditto data constructors, class operations, except that the hash of the parent class/tycon changes
mi_extra_decls :: Maybe [IfaceBindingX IfaceMaybeRhs IfaceTopBndrInfo]
Extra variable definitions which are **NOT** exposed but when combined with mi_decls allows us to restart code generation. See Note [Interface Files with Core Definitions] and Note [Interface File with Core: Sharing RHSs]
mi_globals :: !(Maybe GlobalRdrEnv)
Binds all the things defined at the top level in the original source code for this module. which is NOT the same as mi_exports, nor mi_decls (which may contains declarations for things not actually defined by the user). Used for GHCi and for inspecting the contents of modules via the GHC API only.
(We need the source file to figure out the top-level environment, if we didn't compile this module from source then this field contains Nothing).
Strictly speaking this field should live in the HomeModInfo, but that leads to more plumbing.
mi_insts :: [IfaceClsInst]
Sorted class instance
mi_fam_insts :: [IfaceFamInst]
Sorted family instances
mi_rules :: [IfaceRule]
Sorted rules
mi_hpc :: !AnyHpcUsage
True if this program uses Hpc at any point in the program.
mi_trust :: !IfaceTrustInfo
Safe Haskell Trust information for this module.
mi_trust_pkg :: !Bool
Do we require the package this module resides in be trusted to trust this module? This is used for the situation where a module is Safe (so doesn't require the package be trusted itself) but imports some trustworthy modules from its own package (which does require its own package be trusted). See Note [Trust Own Package] in GHC.Rename.Names
mi_complete_matches :: ![IfaceCompleteMatch]
mi_docs :: !(Maybe Docs)
Docstrings and related data for use by haddock, the ghci :doc command, and other tools.
Just _ = the module was built with -haddock.
mi_final_exts :: !(IfaceBackendExts phase)
Either () or ModIfaceBackend for a fully instantiated interface.
mi_ext_fields :: !ExtensibleFields
Additional optional fields, where the Map key represents the field name, resulting in a (size, serialized data) pair. Because the data is intended to be serialized through the internal Binary class (increasing compatibility with types using Name and FastString, such as HIE), this format is chosen over ByteStrings.
mi_src_hash :: !Fingerprint
Hash of the .hs source, used for recompilation checking.

Instances

Instances details

Binary ModIface
Instance details Defined in GHC.Unit.Module.ModIface Methods put_ :: BinHandle -> ModIface -> IO () # put :: BinHandle -> ModIface -> IO (Bin ModIface) # get :: BinHandle -> IO ModIface #
(NFData (IfaceBackendExts phase), NFData (IfaceDeclExts phase)) => NFData (ModIface_ phase)
Instance details Defined in GHC.Unit.Module.ModIface Methods rnf :: ModIface_ phase -> () #

type ModIface = ModIface_ 'ModIfaceFinal #

data HomeModInfo #

Information about modules in the package being compiled

Constructors

HomeModInfo

Fields

hm_iface :: !ModIface
The basic loaded interface file: every loaded module has one of these, even if it is imported from another package
hm_details :: ModDetails
Extra information that has been created from the ModIface for the module, typically during typechecking
hm_linkable :: !HomeModLinkable
The actual artifact we would like to link to access things in this module. See Note [Home module build products]
hm_linkable might be empty:
1. If this is an .hs-boot module
2. Temporarily during compilation if we pruned away the old linkable because it was out of date.
When re-linking a module (HscNoRecomp), we construct the HomeModInfo by building a new ModDetails from the old ModIface (only).

Instances

Instances details

Show HomeModInfo Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> HomeModInfo -> ShowS # show :: HomeModInfo -> String # showList :: [HomeModInfo] -> ShowS #
NFData HomeModInfo Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: HomeModInfo -> () #

newtype UnitEnvGraph v #

Constructors

UnitEnvGraph
Fields unitEnv_graph :: Map UnitEnvGraphKey v

Instances

Instances details

Foldable UnitEnvGraph
Instance details Defined in GHC.Unit.Env Methods fold :: Monoid m => UnitEnvGraph m -> m # foldMap :: Monoid m => (a -> m) -> UnitEnvGraph a -> m # foldMap' :: Monoid m => (a -> m) -> UnitEnvGraph a -> m # foldr :: (a -> b -> b) -> b -> UnitEnvGraph a -> b # foldr' :: (a -> b -> b) -> b -> UnitEnvGraph a -> b # foldl :: (b -> a -> b) -> b -> UnitEnvGraph a -> b # foldl' :: (b -> a -> b) -> b -> UnitEnvGraph a -> b # foldr1 :: (a -> a -> a) -> UnitEnvGraph a -> a # foldl1 :: (a -> a -> a) -> UnitEnvGraph a -> a # toList :: UnitEnvGraph a -> [a] # null :: UnitEnvGraph a -> Bool # length :: UnitEnvGraph a -> Int # elem :: Eq a => a -> UnitEnvGraph a -> Bool # maximum :: Ord a => UnitEnvGraph a -> a # minimum :: Ord a => UnitEnvGraph a -> a # sum :: Num a => UnitEnvGraph a -> a # product :: Num a => UnitEnvGraph a -> a #
Traversable UnitEnvGraph
Instance details Defined in GHC.Unit.Env Methods traverse :: Applicative f => (a -> f b) -> UnitEnvGraph a -> f (UnitEnvGraph b) # sequenceA :: Applicative f => UnitEnvGraph (f a) -> f (UnitEnvGraph a) # mapM :: Monad m => (a -> m b) -> UnitEnvGraph a -> m (UnitEnvGraph b) # sequence :: Monad m => UnitEnvGraph (m a) -> m (UnitEnvGraph a) #
Functor UnitEnvGraph
Instance details Defined in GHC.Unit.Env Methods fmap :: (a -> b) -> UnitEnvGraph a -> UnitEnvGraph b # (<$) :: a -> UnitEnvGraph b -> UnitEnvGraph a #
Outputable (UnitEnvGraph HomeUnitEnv)
Instance details Defined in GHC.Unit.Env Methods ppr :: UnitEnvGraph HomeUnitEnv -> SDoc #

type UnitEnvGraphKey = UnitId #

type HomeUnitGraph = UnitEnvGraph HomeUnitEnv #

data HomeUnitEnv #

Constructors

HomeUnitEnv

Fields

homeUnitEnv_units :: !UnitState
External units
homeUnitEnv_unit_dbs :: !(Maybe [UnitDatabase UnitId])
Stack of unit databases for the target platform.
This field is populated with the result of initUnits.
Nothing means the databases have never been read from disk.
Usually we don't reload the databases from disk if they are cached, even if the database flags changed!
homeUnitEnv_dflags :: DynFlags
The dynamic flag settings
homeUnitEnv_hpt :: HomePackageTable
The home package table describes already-compiled home-package modules, excluding the module we are compiling right now. (In one-shot mode the current module is the only home-package module, so homeUnitEnv_hpt is empty. All other modules count as "external-package" modules. However, even in GHCi mode, hi-boot interfaces are demand-loaded into the external-package table.)
homeUnitEnv_hpt is not mutable because we only demand-load external packages; the home package is eagerly loaded, module by module, by the compilation manager.
The HPT may contain modules compiled earlier by --make but not actually below the current module in the dependency graph.
(This changes a previous invariant: changed Jan 05.)
homeUnitEnv_home_unit :: !(Maybe HomeUnit)
Home-unit

Instances

Instances details

Outputable HomeUnitEnv
Instance details Defined in GHC.Unit.Env Methods ppr :: HomeUnitEnv -> SDoc #
Outputable (UnitEnvGraph HomeUnitEnv)
Instance details Defined in GHC.Unit.Env Methods ppr :: UnitEnvGraph HomeUnitEnv -> SDoc #

data UnitEnv #

Constructors

UnitEnv
Fields ue_eps :: !ExternalUnitCache Information about the currently loaded external packages. This is mutable because packages will be demand-loaded during a compilation run as required. ue_current_unit :: UnitId ue_home_unit_graph :: !HomeUnitGraph ue_platform :: !Platform Platform ue_namever :: !GhcNameVersion GHC name/version (used for dynamic library suffix)

data InteractiveImport #

Constructors

IIDecl (ImportDecl GhcPs)	Bring the exports of a particular module (filtered by an import decl) into scope
IIModule ModuleName	Bring into scope the entire top-level envt of of this module, including the things imported into it.

Instances

Instances details

Show InteractiveImport Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> InteractiveImport -> ShowS # show :: InteractiveImport -> String # showList :: [InteractiveImport] -> ShowS #
Outputable InteractiveImport
Instance details Defined in GHC.Runtime.Context Methods ppr :: InteractiveImport -> SDoc #

data ModSummary #

Data for a module node in a ModuleGraph. Module nodes of the module graph are one of:

A regular Haskell source module
A hi-boot source module

Constructors

ModSummary

Fields

ms_mod :: Module
Identity of the module
ms_hsc_src :: HscSource
The module source either plain Haskell, hs-boot, or hsig
ms_location :: ModLocation
Location of the various files belonging to the module
ms_hs_hash :: Fingerprint
Content hash of source file
ms_obj_date :: Maybe UTCTime
Timestamp of object, if we have one
ms_dyn_obj_date :: !(Maybe UTCTime)
Timestamp of dynamic object, if we have one
ms_iface_date :: Maybe UTCTime
Timestamp of hi file, if we have one See Note [When source is considered modified] and #9243
ms_hie_date :: Maybe UTCTime
Timestamp of hie file, if we have one
ms_srcimps :: [(PkgQual, Located ModuleName)]
Source imports of the module
ms_textual_imps :: [(PkgQual, Located ModuleName)]
Non-source imports of the module from the module *text*
ms_ghc_prim_import :: !Bool
Whether the special module GHC.Prim was imported explicitly
ms_parsed_mod :: Maybe HsParsedModule
The parsed, nonrenamed source, if we have it. This is also used to support "inline module syntax" in Backpack files.
ms_hspp_file :: FilePath
Filename of preprocessed source file
ms_hspp_opts :: DynFlags
Cached flags from OPTIONS, INCLUDE and LANGUAGE pragmas in the modules source code
ms_hspp_buf :: Maybe StringBuffer
The actual preprocessed source, if we have it

Instances

Instances details

Show ModSummary Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> ModSummary -> ShowS # show :: ModSummary -> String # showList :: [ModSummary] -> ShowS #
NFData ModSummary Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ModSummary -> () #
Outputable ModSummary
Instance details Defined in GHC.Unit.Module.ModSummary Methods ppr :: ModSummary -> SDoc #

type ModNodeKey = ModuleNameWithIsBoot #

type SummaryNode = Node Int ModuleGraphNode #

data ModuleGraph #

A 'ModuleGraph' contains all the nodes from the home package (only). See 'ModuleGraphNode' for information about the nodes.

Modules need to be compiled. hs-boots need to be typechecked before the associated "real" module so modules with {-# SOURCE #-} imports can be built. Instantiations also need to be typechecked to ensure that the module fits the signature. Substantiation typechecking is roughly comparable to the check that the module and its hs-boot agree.

The graph is not necessarily stored in topologically-sorted order. Use topSortModuleGraph and flattenSCC to achieve this.

Instances

Instances details

Show ModuleGraph Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> ModuleGraph -> ShowS # show :: ModuleGraph -> String # showList :: [ModuleGraph] -> ShowS #
NFData ModuleGraph Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: ModuleGraph -> () #

data ModNodeKeyWithUid #

Constructors

ModNodeKeyWithUid
Fields mnkModuleName :: !ModuleNameWithIsBoot mnkUnitId :: !UnitId

Instances

Instances details

Outputable ModNodeKeyWithUid
Instance details Defined in GHC.Unit.Module.Graph Methods ppr :: ModNodeKeyWithUid -> SDoc #
Eq ModNodeKeyWithUid
Instance details Defined in GHC.Unit.Module.Graph Methods (==) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool # (/=) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool #
Ord ModNodeKeyWithUid
Instance details Defined in GHC.Unit.Module.Graph Methods compare :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Ordering # (<) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool # (<=) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool # (>) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool # (>=) :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> Bool # max :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> ModNodeKeyWithUid # min :: ModNodeKeyWithUid -> ModNodeKeyWithUid -> ModNodeKeyWithUid #

data NodeKey #

Constructors

NodeKey_Unit !InstantiatedUnit
NodeKey_Module !ModNodeKeyWithUid
NodeKey_Link !UnitId

Instances

Instances details

NFData NodeKey Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: NodeKey -> () #
Outputable NodeKey
Instance details Defined in GHC.Unit.Module.Graph Methods ppr :: NodeKey -> SDoc #
Eq NodeKey
Instance details Defined in GHC.Unit.Module.Graph Methods (==) :: NodeKey -> NodeKey -> Bool # (/=) :: NodeKey -> NodeKey -> Bool #
Ord NodeKey
Instance details Defined in GHC.Unit.Module.Graph Methods compare :: NodeKey -> NodeKey -> Ordering # (<) :: NodeKey -> NodeKey -> Bool # (<=) :: NodeKey -> NodeKey -> Bool # (>) :: NodeKey -> NodeKey -> Bool # (>=) :: NodeKey -> NodeKey -> Bool # max :: NodeKey -> NodeKey -> NodeKey # min :: NodeKey -> NodeKey -> NodeKey #

data ModuleGraphNode #

A 'ModuleGraphNode' is a node in the 'ModuleGraph'. Edges between nodes mark dependencies arising from module imports and dependencies arising from backpack instantiations.

Constructors

InstantiationNode UnitId InstantiatedUnit	Instantiation nodes track the instantiation of other units (backpack dependencies) with the holes (signatures) of the current package.
ModuleNode [NodeKey] ModSummary	There is a module summary node for each module, signature, and boot module being built.
LinkNode [NodeKey] UnitId	Link nodes are whether are are creating a linked product (ie executable/shared object etc) for a unit.

Instances

Instances details

Outputable ModuleGraphNode
Instance details Defined in GHC.Unit.Module.Graph Methods ppr :: ModuleGraphNode -> SDoc #
Eq ModuleGraphNode
Instance details Defined in GHC.Unit.Module.Graph Methods (==) :: ModuleGraphNode -> ModuleGraphNode -> Bool # (/=) :: ModuleGraphNode -> ModuleGraphNode -> Bool #
Ord ModuleGraphNode
Instance details Defined in GHC.Unit.Module.Graph Methods compare :: ModuleGraphNode -> ModuleGraphNode -> Ordering # (<) :: ModuleGraphNode -> ModuleGraphNode -> Bool # (<=) :: ModuleGraphNode -> ModuleGraphNode -> Bool # (>) :: ModuleGraphNode -> ModuleGraphNode -> Bool # (>=) :: ModuleGraphNode -> ModuleGraphNode -> Bool # max :: ModuleGraphNode -> ModuleGraphNode -> ModuleGraphNode # min :: ModuleGraphNode -> ModuleGraphNode -> ModuleGraphNode #

data PromotionErr #

Constructors

TyConPE
ClassPE
FamDataConPE
ConstrainedDataConPE PredType
PatSynPE
RecDataConPE
TermVariablePE
NoDataKindsDC

Instances

Instances details

Outputable PromotionErr
Instance details Defined in GHC.Tc.Errors.Types Methods ppr :: PromotionErr -> SDoc #

data TcRnMessage #

An error which might arise during typechecking/renaming.

Instances

Instances details

Generic TcRnMessage
Instance details Defined in GHC.Tc.Errors.Types Associated Types type Rep TcRnMessage :: Type -> Type # Methods from :: TcRnMessage -> Rep TcRnMessage x # to :: Rep TcRnMessage x -> TcRnMessage #
type Rep TcRnMessage
Instance details Defined in GHC.Tc.Errors.Types type Rep TcRnMessage = D1 ('MetaData "TcRnMessage" "GHC.Tc.Errors.Types" "ghc" 'False) (((((((C1 ('MetaCons "TcRnUnknownMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnknownDiagnostic)) :+: C1 ('MetaCons "TcRnMessageWithInfo" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 UnitState) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TcRnMessageDetailed))) :+: (C1 ('MetaCons "TcRnWithHsDocContext" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HsDocContext) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TcRnMessage)) :+: (C1 ('MetaCons "TcRnSolverReport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SolverReportWithCtxt) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DiagnosticReason) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GhcHint]))) :+: C1 ('MetaCons "TcRnRedundantConstraints" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Id]) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (SkolemInfoAnon, Bool)))))) :+: ((C1 ('MetaCons "TcRnInaccessibleCode" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Implication) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SolverReportWithCtxt)) :+: (C1 ('MetaCons "TcRnTypeDoesNotHaveFixedRuntimeRep" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 FixedRuntimeRepProvenance) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ErrInfo))) :+: C1 ('MetaCons "TcRnImplicitLift" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ErrInfo)))) :+: (C1 ('MetaCons "TcRnUnusedPatternBinds" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsBind GhcRn))) :+: (C1 ('MetaCons "TcRnDodgyImports" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RdrName)) :+: C1 ('MetaCons "TcRnDodgyExports" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)))))) :+: (((C1 ('MetaCons "TcRnMissingImportList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs))) :+: (C1 ('MetaCons "TcRnUnsafeDueToPlugin" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnModMissingRealSrcSpan" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Module)))) :+: (C1 ('MetaCons "TcRnIdNotExportedFromModuleSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Module)) :+: (C1 ('MetaCons "TcRnIdNotExportedFromLocalSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "TcRnShadowedName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 OccName) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ShadowedNameProvenance))))) :+: ((C1 ('MetaCons "TcRnDuplicateWarningDecls" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LocatedN RdrName)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RdrName)) :+: (C1 ('MetaCons "TcRnSimplifierTooManyIterations" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Cts) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 IntWithInf) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 WantedConstraints))) :+: C1 ('MetaCons "TcRnIllegalPatSynDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LIdP GhcPs))))) :+: (C1 ('MetaCons "TcRnLinearPatSyn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnEmptyRecordUpdate" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnIllegalFieldPunning" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Located RdrName)))))))) :+: ((((C1 ('MetaCons "TcRnIllegalWildcardsInRecord" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RecordFieldPart)) :+: (C1 ('MetaCons "TcRnIllegalWildcardInType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Name)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 BadAnonWildcardContext)) :+: C1 ('MetaCons "TcRnDuplicateFieldName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RecordFieldPart) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty RdrName))))) :+: (C1 ('MetaCons "TcRnIllegalViewPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Pat GhcPs))) :+: (C1 ('MetaCons "TcRnCharLiteralOutOfRange" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedUnpack) (Rec0 Char)) :+: C1 ('MetaCons "TcRnIllegalWildcardsInConstructor" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name))))) :+: ((C1 ('MetaCons "TcRnIgnoringAnnotations" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LAnnDecl GhcRn])) :+: (C1 ('MetaCons "TcRnAnnotationInSafeHaskell" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnInvalidTypeApplication" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LHsWcType GhcRn))))) :+: (C1 ('MetaCons "TcRnTagToEnumMissingValArg" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TcRnTagToEnumUnspecifiedResTy" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "TcRnTagToEnumResTyNotAnEnum" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)))))) :+: (((C1 ('MetaCons "TcRnTagToEnumResTyTypeData" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnArrowIfThenElsePredDependsOnResultTy" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnIllegalHsBootFileDecl" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "TcRnRecursivePatternSynonym" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LHsBinds GhcRn))) :+: (C1 ('MetaCons "TcRnPartialTypeSigTyVarMismatch" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LHsSigWcType GhcRn)))) :+: C1 ('MetaCons "TcRnPartialTypeSigBadQuantifier" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Type)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LHsSigWcType GhcRn))))))) :+: ((C1 ('MetaCons "TcRnMissingSignature" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 MissingSignature) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Exported) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :+: (C1 ('MetaCons "TcRnPolymorphicBinderMissingSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: C1 ('MetaCons "TcRnOverloadedSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TcIdSigInfo)))) :+: (C1 ('MetaCons "TcRnTupleConstraintInst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Class)) :+: (C1 ('MetaCons "TcRnAbstractClassInst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Class)) :+: C1 ('MetaCons "TcRnNoClassInstHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)))))))) :+: (((((C1 ('MetaCons "TcRnUserTypeError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnConstraintInKind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type))) :+: (C1 ('MetaCons "TcRnUnboxedTupleOrSumTypeFuncArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnboxedTupleOrSum) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnLinearFuncInKind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnForAllEscapeError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Kind))))) :+: ((C1 ('MetaCons "TcRnVDQInTermType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe Type))) :+: (C1 ('MetaCons "TcRnBadQuantPredHead" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnIllegalTupleConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)))) :+: (C1 ('MetaCons "TcRnNonTypeVarArgInConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnIllegalImplicitParam" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnIllegalConstraintSynonymOfKind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)))))) :+: (((C1 ('MetaCons "TcRnIllegalClassInst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TyConFlavour)) :+: (C1 ('MetaCons "TcRnOversaturatedVisibleKindArg" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnBadAssociatedType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)))) :+: (C1 ('MetaCons "TcRnForAllRankErr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Rank) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnMonomorphicBindings" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name])) :+: C1 ('MetaCons "TcRnOrphanInstance" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ClsInst))))) :+: ((C1 ('MetaCons "TcRnFunDepConflict" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 UnitState) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ClsInst))) :+: (C1 ('MetaCons "TcRnDupInstanceDecls" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 UnitState) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty ClsInst))) :+: C1 ('MetaCons "TcRnConflictingFamInstDecls" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty FamInst))))) :+: (C1 ('MetaCons "TcRnFamInstNotInjective" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 InjectivityErrReason) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty CoAxBranch)))) :+: (C1 ('MetaCons "TcRnBangOnUnliftedType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnLazyBangOnUnliftedType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type))))))) :+: ((((C1 ('MetaCons "TcRnMultipleDefaultDeclarations" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LDefaultDecl GhcRn])) :+: (C1 ('MetaCons "TcRnBadDefaultType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Class])) :+: C1 ('MetaCons "TcRnPatSynBundledWithNonDataCon" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "TcRnPatSynBundledWithWrongType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnDupeModuleExport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: C1 ('MetaCons "TcRnExportedModNotImported" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName))))) :+: ((C1 ('MetaCons "TcRnNullExportedModule" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: (C1 ('MetaCons "TcRnMissingExportList" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName)) :+: C1 ('MetaCons "TcRnExportHiddenComponents" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs))))) :+: (C1 ('MetaCons "TcRnDuplicateExport" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GreName) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs)))) :+: (C1 ('MetaCons "TcRnExportedParentChildMismatch" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyThing)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GreName) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Name]))) :+: C1 ('MetaCons "TcRnConflictingExports" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 OccName) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GreName) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GlobalRdrElt))) :: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GreName)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 GlobalRdrElt) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (IE GhcPs))))))))) :+: (((C1 ('MetaCons "TcRnAmbiguousField" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsExpr GhcRn)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon)) :+: (C1 ('MetaCons "TcRnMissingFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConLike) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(FieldLabelString, TcType)])) :+: C1 ('MetaCons "TcRnFieldUpdateInvalidType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(FieldLabelString, TcType)])))) :+: (C1 ('MetaCons "TcRnNoConstructorHasAllFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FieldLabelString])) :+: (C1 ('MetaCons "TcRnMixedSelectors" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Id])) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Id]))) :+: C1 ('MetaCons "TcRnMissingStrictFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConLike) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [(FieldLabelString, TcType)]))))) :+: ((C1 ('MetaCons "TcRnNoPossibleParentForFields" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LHsRecUpdField GhcRn])) :+: (C1 ('MetaCons "TcRnBadOverloadedRecordUpdate" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [LHsRecUpdField GhcRn])) :+: C1 ('MetaCons "TcRnStaticFormNotClosed" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NotClosedReason)))) :+: (C1 ('MetaCons "TcRnSpecialClassInst" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Class) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool)) :+: (C1 ('MetaCons "TcRnUselessTypeable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnDerivingDefaults" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Class))))))))) :+: ((((((C1 ('MetaCons "TcRnNonUnaryTypeclassConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LHsSigType GhcRn))) :+: C1 ('MetaCons "TcRnPartialTypeSignatures" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 SuggestPartialTypeSignatures) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ThetaType))) :+: (C1 ('MetaCons "TcRnCannotDeriveInstance" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Class) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Type])) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe (DerivStrategy GhcTc))) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 UsingGeneralizedNewtypeDeriving) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DeriveInstanceErrReason)))) :+: (C1 ('MetaCons "TcRnLazyGADTPattern" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnArrowProcGADTPattern" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: ((C1 ('MetaCons "TcRnForallIdentifier" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RdrName)) :+: (C1 ('MetaCons "TcRnTypeEqualityOutOfScope" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnTypeEqualityRequiresOperators" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "TcRnIllegalTypeOperator" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 SDoc) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RdrName)) :+: (C1 ('MetaCons "TcRnIllegalTypeOperatorDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RdrName)) :+: C1 ('MetaCons "TcRnGADTMonoLocalBinds" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "TcRnNotInScope" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 NotInScopeError) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RdrName)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [ImportError]) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [GhcHint]))) :+: (C1 ('MetaCons "TcRnUntickedPromotedThing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UntickedPromotedThing)) :+: C1 ('MetaCons "TcRnIllegalBuiltinSyntax" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 SDoc) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 RdrName)))) :+: (C1 ('MetaCons "TcRnWarnDefaulting" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Ct]) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe TyVar)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Type))) :+: (C1 ('MetaCons "TcRnIncorrectNameSpace" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool)) :+: C1 ('MetaCons "TcRnForeignImportPrimExtNotSet" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForeignImport GhcRn)))))) :+: ((C1 ('MetaCons "TcRnForeignImportPrimSafeAnn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForeignImport GhcRn))) :+: (C1 ('MetaCons "TcRnForeignFunctionImportAsValue" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForeignImport GhcRn))) :+: C1 ('MetaCons "TcRnFunPtrImportWithoutAmpersand" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (ForeignImport GhcRn))))) :+: (C1 ('MetaCons "TcRnIllegalForeignDeclBackend" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Either (ForeignExport GhcRn) (ForeignImport GhcRn))) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Backend) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ExpectedBackends))) :+: (C1 ('MetaCons "TcRnUnsupportedCallConv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Either (ForeignExport GhcRn) (ForeignImport GhcRn))) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnsupportedCallConvention)) :+: C1 ('MetaCons "TcRnIllegalForeignType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe ArgOrResult)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 IllegalForeignTypeReason))))))) :+: ((((C1 ('MetaCons "TcRnInvalidCIdentifier" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 CLabelString)) :+: (C1 ('MetaCons "TcRnExpectedValueId" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TcTyThing)) :+: C1 ('MetaCons "TcRnNotARecordSelector" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)))) :+: (C1 ('MetaCons "TcRnRecSelectorEscapedTyVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 OccName)) :+: (C1 ('MetaCons "TcRnPatSynNotBidirectional" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: C1 ('MetaCons "TcRnSplicePolymorphicLocalVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Id))))) :+: ((C1 ('MetaCons "TcRnIllegalDerivingItem" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LHsSigType GhcRn))) :+: (C1 ('MetaCons "TcRnUnexpectedAnnotation" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HsType GhcRn)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 HsSrcBang)) :+: C1 ('MetaCons "TcRnIllegalRecordSyntax" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HsType GhcRn))))) :+: (C1 ('MetaCons "TcRnUnexpectedTypeSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HsType GhcRn))) :+: (C1 ('MetaCons "TcRnInvalidVisibleKindArgument" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LHsType GhcRn)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: C1 ('MetaCons "TcRnTooManyBinders" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Kind) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 [LHsTyVarBndr () GhcRn])))))) :+: (((C1 ('MetaCons "TcRnDifferentNamesForTyVar" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: (C1 ('MetaCons "TcRnInvalidReturnKind" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DataSort) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 AllowedDataResKind)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Kind) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe SuggestUnliftedTypes)))) :+: C1 ('MetaCons "TcRnClassKindNotConstraint" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Kind)))) :+: (C1 ('MetaCons "TcRnUnpromotableThing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 PromotionErr)) :+: (C1 ('MetaCons "TcRnMatchesHaveDiffNumArgs" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HsMatchContext GhcTc)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 MatchArgBadMatches)) :+: C1 ('MetaCons "TcRnCannotBindScopedTyVarInPatSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (Name, TcTyVar))))))) :+: ((C1 ('MetaCons "TcRnCannotBindTyVarsInPatBind" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (Name, TcTyVar)))) :+: (C1 ('MetaCons "TcRnTooManyTyArgsInConPattern" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ConLike) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedUnpack) (Rec0 Int) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedUnpack) (Rec0 Int))) :+: C1 ('MetaCons "TcRnMultipleInlinePragmas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Id) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LocatedA InlinePragma)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (LocatedA InlinePragma))))))) :+: (C1 ('MetaCons "TcRnUnexpectedPragmas" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Id) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (LSig GhcRn)))) :+: (C1 ('MetaCons "TcRnNonOverloadedSpecialisePragma" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LIdP GhcRn))) :+: C1 ('MetaCons "TcRnSpecialiseNotVisible" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)))))))) :+: (((((C1 ('MetaCons "TcRnNameByTemplateHaskellQuote" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RdrName)) :+: (C1 ('MetaCons "TcRnIllegalBindingOfBuiltIn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 OccName)) :+: C1 ('MetaCons "TcRnPragmaWarning" 'PrefixI 'True) ((S1 ('MetaSel ('Just "pragma_warning_occ") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 OccName) :: S1 ('MetaSel ('Just "pragma_warning_msg") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (WarningTxt GhcRn))) :: (S1 ('MetaSel ('Just "pragma_warning_import_mod") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName) :: S1 ('MetaSel ('Just "pragma_warning_defined_mod") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ModuleName))))) :+: (C1 ('MetaCons "TcRnIllegalHsigDefaultMethods" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty (LHsBind GhcRn)))) :+: (C1 ('MetaCons "TcRnBadGenericMethod" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: C1 ('MetaCons "TcRnWarningMinimalDefIncomplete" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ClassMinimalDef))))) :+: ((C1 ('MetaCons "TcRnDefaultMethodForPragmaLacksBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Id) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Sig GhcRn))) :+: (C1 ('MetaCons "TcRnIgnoreSpecialisePragmaOnDefMethod" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: C1 ('MetaCons "TcRnBadMethodErr" 'PrefixI 'True) (S1 ('MetaSel ('Just "badMethodErrClassName") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Just "badMethodErrMethodName") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)))) :+: (C1 ('MetaCons "TcRnNoExplicitAssocTypeOrDefaultDeclaration" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: (C1 ('MetaCons "TcRnIllegalNewtype" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DataCon) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 IllegalNewtypeReason))) :+: C1 ('MetaCons "TcRnIllegalTypeData" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "TcRnTypeDataForbids" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TypeDataForbids)) :+: (C1 ('MetaCons "TcRnTypedTHWithPolyType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TcType)) :+: C1 ('MetaCons "TcRnSpliceThrewException" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 SplicePhase) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 SomeException)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 String) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (LHsExpr GhcTc)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool)))))) :+: (C1 ('MetaCons "TcRnInvalidTopDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (HsDecl GhcPs))) :+: (C1 ('MetaCons "TcRnNonExactName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RdrName)) :+: C1 ('MetaCons "TcRnAddInvalidCorePlugin" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 String))))) :+: ((C1 ('MetaCons "TcRnAddDocToNonLocalDefn" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 DocLoc)) :+: (C1 ('MetaCons "TcRnFailedToLookupThInstName" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 LookupTHInstNameErrReason)) :+: C1 ('MetaCons "TcRnCannotReifyInstance" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)))) :+: (C1 ('MetaCons "TcRnCannotReifyOutOfScopeThing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: (C1 ('MetaCons "TcRnCannotReifyThingNotInTypeEnv" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name)) :+: C1 ('MetaCons "TcRnNoRolesAssociatedWithThing" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TcTyThing))))))) :+: ((((C1 ('MetaCons "TcRnCannotRepresentType" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 UnrepresentableTypeDescr) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Type)) :+: (C1 ('MetaCons "TcRnRunSpliceFailure" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe String)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 RunSpliceFailReason)) :+: C1 ('MetaCons "TcRnReportCustomQuasiError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Bool) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 String)))) :+: (C1 ('MetaCons "TcRnInterfaceLookupError" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 SDoc)) :+: (C1 ('MetaCons "TcRnUnsatisfiedMinimalDef" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ClassMinimalDef)) :+: C1 ('MetaCons "TcRnMisplacedInstSig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (LHsSigType GhcRn)))))) :+: ((C1 ('MetaCons "TcRnBadBootFamInstDecl" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TcRnIllegalFamilyInstance" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon)) :+: C1 ('MetaCons "TcRnMissingClassAssoc" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon)))) :+: (C1 ('MetaCons "TcRnBadFamInstDecl" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon)) :+: (C1 ('MetaCons "TcRnNotOpenFamily" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TyCon)) :+: C1 ('MetaCons "TcRnNoRebindableSyntaxRecordDot" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: (((C1 ('MetaCons "TcRnNoFieldPunsRecordDot" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TcRnIllegalStaticExpression" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsExpr GhcPs))) :+: C1 ('MetaCons "TcRnIllegalStaticFormInSplice" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsExpr GhcPs))))) :+: (C1 ('MetaCons "TcRnListComprehensionDuplicateBinding" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: (C1 ('MetaCons "TcRnEmptyStmtsGroup" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 EmptyStatementGroupErrReason)) :+: C1 ('MetaCons "TcRnLastStmtNotExpr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsStmtContext GhcRn)) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnexpectedStatement))))) :+: ((C1 ('MetaCons "TcRnUnexpectedStatementInContext" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsStmtContext GhcRn)) :: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnexpectedStatement) :: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Maybe Extension)))) :+: (C1 ('MetaCons "TcRnIllegalTupleSection" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TcRnIllegalImplicitParameterBindings" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Either (HsLocalBindsLR GhcPs GhcPs) (HsLocalBindsLR GhcRn GhcPs)))))) :+: (C1 ('MetaCons "TcRnSectionWithoutParentheses" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HsExpr GhcPs))) :+: (C1 ('MetaCons "TcRnLoopySuperclassSolve" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 CtLoc) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PredType)) :+: C1 ('MetaCons "TcRnCannotDefaultConcrete" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 FixedRuntimeRepOrigin))))))))))
type DiagnosticOpts TcRnMessage
Instance details Defined in GHC.Tc.Errors.Ppr type DiagnosticOpts TcRnMessage = TcRnMessageOpts

data GhcMessage where #

The umbrella type that encompasses all the different messages that GHC might output during the different compilation stages. See Note [GhcMessage].

Constructors

GhcPsMessage :: PsMessage -> GhcMessage	A message from the parsing phase.
GhcTcRnMessage :: TcRnMessage -> GhcMessage	A message from typecheck/renaming phase.
GhcDsMessage :: DsMessage -> GhcMessage	A message from the desugaring (HsToCore) phase.
GhcDriverMessage :: DriverMessage -> GhcMessage	A message from the driver.
GhcUnknownMessage :: UnknownDiagnostic -> GhcMessage	An "escape" hatch which can be used when we don't know the source of the message or if the message is not one of the typed ones. The `Diagnostic` and `Typeable` constraints ensure that if we know, at pattern-matching time, the originating type, we can attempt a cast and access the fully-structured error. This would be the case for a GHC plugin that offers a domain-specific error type but that doesn't want to place the burden on IDEs/application code to "know" it. The `Diagnostic` constraint ensures that worst case scenario we can still render this into something which can be eventually converted into a `DecoratedSDoc`.

Instances

Instances details

Generic GhcMessage
Instance details Defined in GHC.Driver.Errors.Types Associated Types type Rep GhcMessage :: Type -> Type # Methods from :: GhcMessage -> Rep GhcMessage x # to :: Rep GhcMessage x -> GhcMessage #
type Rep GhcMessage
Instance details Defined in GHC.Driver.Errors.Types type Rep GhcMessage = D1 ('MetaData "GhcMessage" "GHC.Driver.Errors.Types" "ghc" 'False) ((C1 ('MetaCons "GhcPsMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 PsMessage)) :+: C1 ('MetaCons "GhcTcRnMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 TcRnMessage))) :+: (C1 ('MetaCons "GhcDsMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DsMessage)) :+: (C1 ('MetaCons "GhcDriverMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 DriverMessage)) :+: C1 ('MetaCons "GhcUnknownMessage" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 UnknownDiagnostic)))))
type DiagnosticOpts GhcMessage
Instance details Defined in GHC.Driver.Errors.Ppr type DiagnosticOpts GhcMessage = GhcMessageOpts

data HscEnv #

HscEnv is like Session, except that some of the fields are immutable. An HscEnv is used to compile a single module from plain Haskell source code (after preprocessing) to either C, assembly or C--. It's also used to store the dynamic linker state to allow for multiple linkers in the same address space. Things like the module graph don't change during a single compilation.

Historical note: "hsc" used to be the name of the compiler binary, when there was a separate driver and compiler. To compile a single module, the driver would invoke hsc on the source code... so nowadays we think of hsc as the layer of the compiler that deals with compiling a single module.

Instances

Instances details

ContainsDynFlags HscEnv
Instance details Defined in GHC.Driver.Env.Types Methods extractDynFlags :: HscEnv -> DynFlags #

data Ghc a #

A minimal implementation of a GhcMonad. If you need a custom monad, e.g., to maintain additional state consider wrapping this monad or using GhcT.

Instances

Instances details

MonadFail Ghc
Instance details Defined in GHC.Driver.Monad Methods fail :: String -> Ghc a #
MonadFix Ghc
Instance details Defined in GHC.Driver.Monad Methods mfix :: (a -> Ghc a) -> Ghc a #
MonadIO Ghc
Instance details Defined in GHC.Driver.Monad Methods liftIO :: IO a -> Ghc a #
Applicative Ghc
Instance details Defined in GHC.Driver.Monad Methods pure :: a -> Ghc a # (<>) :: Ghc (a -> b) -> Ghc a -> Ghc b # liftA2 :: (a -> b -> c) -> Ghc a -> Ghc b -> Ghc c # (>) :: Ghc a -> Ghc b -> Ghc b # (<*) :: Ghc a -> Ghc b -> Ghc a #
Functor Ghc
Instance details Defined in GHC.Driver.Monad Methods fmap :: (a -> b) -> Ghc a -> Ghc b # (<$) :: a -> Ghc b -> Ghc a #
Monad Ghc
Instance details Defined in GHC.Driver.Monad Methods (>>=) :: Ghc a -> (a -> Ghc b) -> Ghc b # (>>) :: Ghc a -> Ghc b -> Ghc b # return :: a -> Ghc a #
MonadCatch Ghc
Instance details Defined in GHC.Driver.Monad Methods catch :: (HasCallStack, Exception e) => Ghc a -> (e -> Ghc a) -> Ghc a #
MonadMask Ghc
Instance details Defined in GHC.Driver.Monad Methods mask :: HasCallStack => ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b # uninterruptibleMask :: HasCallStack => ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b # generalBracket :: HasCallStack => Ghc a -> (a -> ExitCase b -> Ghc c) -> (a -> Ghc b) -> Ghc (b, c) #
MonadThrow Ghc
Instance details Defined in GHC.Driver.Monad Methods throwM :: (HasCallStack, Exception e) => e -> Ghc a #
GhcMonad Ghc
Instance details Defined in GHC.Driver.Monad Methods getSession :: Ghc HscEnv # setSession :: HscEnv -> Ghc () #
HasDynFlags Ghc
Instance details Defined in GHC.Driver.Monad Methods getDynFlags :: Ghc DynFlags #
HasLogger Ghc
Instance details Defined in GHC.Driver.Monad Methods getLogger :: Ghc Logger #

class (Functor m, ExceptionMonad m, HasDynFlags m, HasLogger m) => GhcMonad (m :: Type -> Type) where #

A monad that has all the features needed by GHC API calls.

In short, a GHC monad

allows embedding of IO actions,
can log warnings,
allows handling of (extensible) exceptions, and
maintains a current session.

If you do not use Ghc or GhcT, make sure to call initGhcMonad before any call to the GHC API functions can occur.

Minimal complete definition

getSession, setSession

Methods

getSession :: m HscEnv #

Instances

Instances details

GhcMonad Ghc
Instance details Defined in GHC.Driver.Monad Methods getSession :: Ghc HscEnv # setSession :: HscEnv -> Ghc () #
ExceptionMonad m => GhcMonad (GhcT m)
Instance details Defined in GHC.Driver.Monad Methods getSession :: GhcT m HscEnv # setSession :: HscEnv -> GhcT m () #

type MetaHook (f :: Type -> Type) = MetaRequest -> LHsExpr GhcTc -> f MetaResult #

data MetaRequest #

The supported metaprogramming result types

Constructors

MetaE (LHsExpr GhcPs -> MetaResult)
MetaP (LPat GhcPs -> MetaResult)
MetaT (LHsType GhcPs -> MetaResult)
MetaD ([LHsDecl GhcPs] -> MetaResult)
MetaAW (Serialized -> MetaResult)

type THDocs = Map DocLoc (HsDoc GhcRn) #

The current collection of docs that Template Haskell has built up via putDoc.

data DocLoc #

This is a mirror of Template Haskell's DocLoc, but the TH names are resolved to GHC names.

Constructors

DeclDoc Name
ArgDoc Name Int
InstDoc Name
ModuleDoc

Instances

Instances details

Eq DocLoc
Instance details Defined in GHC.Tc.Types Methods (==) :: DocLoc -> DocLoc -> Bool # (/=) :: DocLoc -> DocLoc -> Bool #
Ord DocLoc
Instance details Defined in GHC.Tc.Types Methods compare :: DocLoc -> DocLoc -> Ordering # (<) :: DocLoc -> DocLoc -> Bool # (<=) :: DocLoc -> DocLoc -> Bool # (>) :: DocLoc -> DocLoc -> Bool # (>=) :: DocLoc -> DocLoc -> Bool # max :: DocLoc -> DocLoc -> DocLoc # min :: DocLoc -> DocLoc -> DocLoc #

type RoleAnnotEnv = NameEnv (LRoleAnnotDecl GhcRn) #

data DefaultingPlugin #

A plugin for controlling defaulting.

Constructors

DefaultingPlugin
Fields dePluginInit :: TcPluginM s Initialize plugin, when entering type-checker. dePluginRun :: s -> FillDefaulting Default some types dePluginStop :: s -> TcPluginM () Clean up after the plugin, when exiting the type-checker.

type FillDefaulting = WantedConstraints -> TcPluginM [DefaultingProposal] #

type DefaultingPluginResult = [DefaultingProposal] #

data DefaultingProposal #

A collection of candidate default types for a type variable.

Constructors

DefaultingProposal
Fields deProposalTyVar :: TcTyVar The type variable to default. deProposalCandidates :: [Type] Candidate types to default the type variable to. deProposalCts :: [Ct] The constraints against which defaults are checked.

Instances

Instances details

Outputable DefaultingProposal
Instance details Defined in GHC.Tc.Types Methods ppr :: DefaultingProposal -> SDoc #

data TcPluginRewriteResult #

Constructors

TcPluginNoRewrite

The plugin does not rewrite the type family application.

TcPluginRewriteTo

The plugin rewrites the type family application providing a rewriting together with evidence: a Reduction, which contains the rewritten type together with a Coercion whose right-hand-side type is the rewritten type.

The plugin can also emit additional Wanted constraints.

Fields

tcPluginReduction :: !Reduction
tcRewriterNewWanteds :: [Ct]

data TcPluginSolveResult #

Result of running a solver plugin.

Constructors

TcPluginSolveResult

Fields

tcPluginInsolubleCts :: [Ct]
Insoluble constraints found by the plugin.
These constraints will be added to the inert set, and reported as insoluble to the user.
tcPluginSolvedCts :: [(EvTerm, Ct)]
Solved constraints, together with their evidence.
These are removed from the inert set, and the evidence for them is recorded.
tcPluginNewCts :: [Ct]
New constraints that the plugin wishes to emit.
These will be added to the work list.

Bundled Patterns

pattern TcPluginOk :: [(EvTerm, Ct)] -> [Ct] -> TcPluginSolveResult

The plugin has not found any contradictions,

The first field is for constraints that were solved. The second field contains new work, that should be processed by the constraint solver.

pattern TcPluginContradiction :: [Ct] -> TcPluginSolveResult

The plugin found a contradiction. The returned constraints are removed from the inert set, and recorded as insoluble.

The returned list of constraints should never be empty.

data TcPlugin #

Constructors

TcPlugin

Fields

tcPluginInit :: TcPluginM s
Initialize plugin, when entering type-checker.
tcPluginSolve :: s -> TcPluginSolver
Solve some constraints.
This function will be invoked at two points in the constraint solving process: once to simplify Given constraints, and once to solve Wanted constraints. In the first case (and only in the first case), no Wanted constraints will be passed to the plugin.
The plugin can either return a contradiction, or specify that it has solved some constraints (with evidence), and possibly emit additional constraints. These returned constraints must be Givens in the first case, and Wanteds in the second.
Use \ _ _ _ _ _ -> pure $ TcPluginOK [] [] if your plugin does not provide this functionality.
tcPluginRewrite :: s -> UniqFM TyCon TcPluginRewriter
Rewrite saturated type family applications.
The plugin is expected to supply a mapping from type family names to rewriting functions. For each type family TyCon, the plugin should provide a function which takes in the given constraints and arguments of a saturated type family application, and return a possible rewriting. See TcPluginRewriter for the expected shape of such a function.
Use \ _ -> emptyUFM if your plugin does not provide this functionality.
tcPluginStop :: s -> TcPluginM ()
Clean up after the plugin, when exiting the type-checker.

data TcPluginM a #

TcPluginM is the monad in which type-checking plugins operate.

Instances

Instances details

MonadFail TcPluginM
Instance details Defined in GHC.Tc.Types Methods fail :: String -> TcPluginM a #
Applicative TcPluginM
Instance details Defined in GHC.Tc.Types Methods pure :: a -> TcPluginM a # (<>) :: TcPluginM (a -> b) -> TcPluginM a -> TcPluginM b # liftA2 :: (a -> b -> c) -> TcPluginM a -> TcPluginM b -> TcPluginM c # (>) :: TcPluginM a -> TcPluginM b -> TcPluginM b # (<*) :: TcPluginM a -> TcPluginM b -> TcPluginM a #
Functor TcPluginM
Instance details Defined in GHC.Tc.Types Methods fmap :: (a -> b) -> TcPluginM a -> TcPluginM b # (<$) :: a -> TcPluginM b -> TcPluginM a #
Monad TcPluginM
Instance details Defined in GHC.Tc.Types Methods (>>=) :: TcPluginM a -> (a -> TcPluginM b) -> TcPluginM b # (>>) :: TcPluginM a -> TcPluginM b -> TcPluginM b # return :: a -> TcPluginM a #

type TcPluginRewriter #

Arguments

= RewriteEnv	Rewriter environment
-> [Ct]	Givens
-> [TcType]	type family arguments
-> TcPluginM TcPluginRewriteResult

For rewriting type family applications, a type-checking plugin provides a function of this type for each type family TyCon.

The function is provided with the current set of Given constraints, together with the arguments to the type family. The type family application will always be fully saturated.

type TcPluginSolver #

Arguments

= EvBindsVar
-> [Ct]	Givens
-> [Ct]	Wanteds
-> TcPluginM TcPluginSolveResult

The solve function of a type-checking plugin takes in Given and Wanted constraints, and should return a TcPluginSolveResult indicating which Wanted constraints it could solve, or whether any are insoluble.

data TcPatSynInfo #

Constructors

TPSI
Fields patsig_name :: Name patsig_implicit_bndrs :: [InvisTVBinder] patsig_univ_bndrs :: [InvisTVBinder] patsig_req :: TcThetaType patsig_ex_bndrs :: [InvisTVBinder] patsig_prov :: TcThetaType patsig_body_ty :: TcSigmaType

Instances

Instances details

Outputable TcPatSynInfo
Instance details Defined in GHC.Tc.Types Methods ppr :: TcPatSynInfo -> SDoc #

data TcIdSigInst #

Constructors

TISI
Fields sig_inst_sig :: TcIdSigInfo sig_inst_skols :: [(Name, InvisTVBinder)] sig_inst_theta :: TcThetaType sig_inst_tau :: TcSigmaType sig_inst_wcs :: [(Name, TcTyVar)] sig_inst_wcx :: Maybe TcType

Instances

Instances details

Outputable TcIdSigInst
Instance details Defined in GHC.Tc.Types Methods ppr :: TcIdSigInst -> SDoc #

data TcSigInfo #

Constructors

TcIdSig TcIdSigInfo
TcPatSynSig TcPatSynInfo

Instances

Instances details

Outputable TcSigInfo
Instance details Defined in GHC.Tc.Types Methods ppr :: TcSigInfo -> SDoc #

type TcSigFun = Name -> Maybe TcSigInfo #

data WhereFrom #

Constructors

ImportByUser IsBootInterface
ImportBySystem
ImportByPlugin

Instances

Instances details

Outputable WhereFrom
Instance details Defined in GHC.Tc.Types Methods ppr :: WhereFrom -> SDoc #

type ClosedTypeId = Bool #

type RhsNames = NameSet #

data IsGroupClosed #

IsGroupClosed describes a group of mutually-recursive bindings

Constructors

IsGroupClosed (NameEnv RhsNames) ClosedTypeId

data IdBindingInfo #

IdBindingInfo describes how an Id is bound.

It is used for the following purposes: a) for static forms in checkClosedInStaticForm and b) to figure out when a nested binding can be generalised, in decideGeneralisationPlan.

Constructors

NotLetBound
ClosedLet
NonClosedLet RhsNames ClosedTypeId

Instances

Instances details

Outputable IdBindingInfo
Instance details Defined in GHC.Tc.Types Methods ppr :: IdBindingInfo -> SDoc #

data ArrowCtxt #

Constructors

NoArrowCtxt
ArrowCtxt LocalRdrEnv (TcRef WantedConstraints)

type ThLevel = Int #

data PendingStuff #

Constructors

RnPendingUntyped (TcRef [PendingRnSplice])
RnPendingTyped
TcPending (TcRef [PendingTcSplice]) (TcRef WantedConstraints) QuoteWrapper

data ThStage #

Constructors

Splice SpliceType
RunSplice (TcRef [ForeignRef (Q ())])
Comp
Brack ThStage PendingStuff

Instances

Instances details

Outputable ThStage
Instance details Defined in GHC.Tc.Types Methods ppr :: ThStage -> SDoc #

data SpliceType #

Constructors

Typed
Untyped

data TcBinder #

Constructors

TcIdBndr TcId TopLevelFlag
TcIdBndr_ExpType Name ExpType TopLevelFlag
TcTvBndr Name TyVar

Instances

Instances details

HasOccName TcBinder
Instance details Defined in GHC.Tc.Types Methods occName :: TcBinder -> OccName #
Outputable TcBinder
Instance details Defined in GHC.Tc.Types Methods ppr :: TcBinder -> SDoc #

type TcBinderStack = [TcBinder] #

type TcIdSet = IdSet #

type TcId = Id #

type TcRef a = IORef a #

Type alias for IORef; the convention is we'll use this for mutable bits of data in TcGblEnv which are updated during typechecking and returned at the end.

type ThBindEnv = NameEnv (TopLevelFlag, ThLevel) #

type TcTypeEnv = NameEnv TcTyThing #

type ErrCtxt = (Bool, TidyEnv -> TcM (TidyEnv, SDoc)) #

type RecFieldEnv = NameEnv [FieldLabel] #

data FrontendResult #

FrontendResult describes the result of running the frontend of a Haskell module. Currently one always gets a FrontendTypecheck, since running the frontend involves typechecking a program. hs-sig merges are not handled here.

This data type really should be in GHC.Driver.Env, but it needs to have a TcGblEnv which is only defined here.

Constructors

FrontendTypecheck TcGblEnv

data IfLclEnv #

Constructors

IfLclEnv
Fields if_mod :: !Module if_boot :: IsBootInterface if_loc :: SDoc if_nsubst :: Maybe NameShape if_implicits_env :: Maybe TypeEnv if_tv_env :: FastStringEnv TyVar if_id_env :: FastStringEnv Id

data IfGblEnv #

Constructors

IfGblEnv
Fields if_doc :: SDoc if_rec_types :: KnotVars (IfG TypeEnv)

data RewriteEnv #

A RewriteEnv carries the necessary context for performing rewrites (i.e. type family reductions and following filled-in metavariables) in the solver.

Constructors

RE

Fields

re_loc :: !CtLoc
In which context are we rewriting?
Type-checking plugins might want to use this location information when emitting new Wanted constraints when rewriting type family applications. This ensures that such Wanted constraints will, when unsolved, give rise to error messages with the correct source location.
re_flavour :: !CtFlavour
re_eq_rel :: !EqRel
At what role are we rewriting?
See Note [Rewriter EqRels] in GHC.Tc.Solver.Rewrite
re_rewriters :: !(TcRef RewriterSet)
See Note [Wanteds rewrite Wanteds]

type TcM = TcRn #

Historical "type-checking monad" (now it's just TcRn).

type RnM = TcRn #

Historical "renaming monad" (now it's just TcRn).

type IfL = IfM IfLclEnv #

type IfG = IfM () #

type IfM lcl = TcRnIf IfGblEnv lcl #

type TcRn = TcRnIf TcGblEnv TcLclEnv #

type TcRnIf a b = IOEnv (Env a b) #

data NameShape #

A NameShape is a substitution on Names that can be used to refine the identities of a hole while we are renaming interfaces (see GHC.Iface.Rename). Specifically, a NameShape for ns_module_name A, defines a mapping from {A.T} (for some OccName T) to some arbitrary other Name.

The most intriguing thing about a NameShape, however, is how it's constructed. A NameShape is *implied* by the exported AvailInfos of the implementor of an interface: if an implementor of signature <H> exports M.T, you implicitly define a substitution from {H.T} to M.T. So a NameShape is computed from the list of AvailInfos that are exported by the implementation of a module, or successively merged together by the export lists of signatures which are joining together.

It's not the most obvious way to go about doing this, but it does seem to work!

NB: Can't boot this and put it in NameShape because then we start pulling in too many DynFlags things.

Constructors

NameShape
Fields ns_mod_name :: ModuleName ns_exports :: [AvailInfo] ns_map :: OccEnv Name

type CommandLineOption = String #

Command line options gathered from the -PModule.Name:stuff syntax are given to you as this type

class Monad m => MonadP (m :: Type -> Type) where #

An mtl-style class for monads that support parsing-related operations. For example, sometimes we make a second pass over the parsing results to validate, disambiguate, or rearrange them, and we do so in the PV monad which cannot consume input but can report parsing errors, check for extension bits, and accumulate parsing annotations. Both P and PV are instances of MonadP.

MonadP grants us convenient overloading. The other option is to have separate operations for each monad: addErrorP vs addErrorPV, getBitP vs getBitPV, and so on.

Methods

addError :: MsgEnvelope PsMessage -> m () #

Add a non-fatal error. Use this when the parser can produce a result despite the error.

For example, when GHC encounters a forall in a type, but -XExplicitForAll is disabled, the parser constructs ForAllTy as if -XExplicitForAll was enabled, adding a non-fatal error to the accumulator.

Control flow wise, non-fatal errors act like warnings: they are added to the accumulator and parsing continues. This allows GHC to report more than one parse error per file.

addWarning :: MsgEnvelope PsMessage -> m () #

Add a warning to the accumulator. Use getPsMessages to get the accumulated warnings.

addFatalError :: MsgEnvelope PsMessage -> m a #

Add a fatal error. This will be the last error reported by the parser, and the parser will not produce any result, ending in a PFailed state.

getBit :: ExtBits -> m Bool #

Check if a given flag is currently set in the bitmap.

allocateCommentsP :: RealSrcSpan -> m EpAnnComments #

Go through the comment_q in PState and remove all comments that belong within the given span

allocatePriorCommentsP :: RealSrcSpan -> m EpAnnComments #

Go through the comment_q in PState and remove all comments that come before or within the given span

allocateFinalCommentsP :: RealSrcSpan -> m EpAnnComments #

Go through the comment_q in PState and remove all comments that come after the given span

Instances

Instances details

MonadP P
Instance details Defined in GHC.Parser.Lexer Methods addError :: MsgEnvelope PsMessage -> P () # addWarning :: MsgEnvelope PsMessage -> P () # addFatalError :: MsgEnvelope PsMessage -> P a # getBit :: ExtBits -> P Bool # allocateCommentsP :: RealSrcSpan -> P EpAnnComments # allocatePriorCommentsP :: RealSrcSpan -> P EpAnnComments # allocateFinalCommentsP :: RealSrcSpan -> P EpAnnComments #
MonadP PV
Instance details Defined in GHC.Parser.PostProcess Methods addError :: MsgEnvelope PsMessage -> PV () # addWarning :: MsgEnvelope PsMessage -> PV () # addFatalError :: MsgEnvelope PsMessage -> PV a # getBit :: ExtBits -> PV Bool # allocateCommentsP :: RealSrcSpan -> PV EpAnnComments # allocatePriorCommentsP :: RealSrcSpan -> PV EpAnnComments # allocateFinalCommentsP :: RealSrcSpan -> PV EpAnnComments #

data ExtBits #

Various boolean flags, mostly language extensions, that impact lexing and parsing. Note that a handful of these can change during lexing/parsing.

Constructors

FfiBit
InterruptibleFfiBit
CApiFfiBit
ArrowsBit
ThBit
ThQuotesBit
IpBit
OverloadedLabelsBit
ExplicitForallBit
BangPatBit
PatternSynonymsBit
HaddockBit
MagicHashBit
RecursiveDoBit
QualifiedDoBit
UnicodeSyntaxBit
UnboxedParensBit
DatatypeContextsBit
MonadComprehensionsBit
TransformComprehensionsBit
QqBit
RawTokenStreamBit
AlternativeLayoutRuleBit
ALRTransitionalBit
RelaxedLayoutBit
NondecreasingIndentationBit
SafeHaskellBit
TraditionalRecordSyntaxBit
ExplicitNamespacesBit
LambdaCaseBit
BinaryLiteralsBit
NegativeLiteralsBit
HexFloatLiteralsBit
StaticPointersBit
NumericUnderscoresBit
StarIsTypeBit
BlockArgumentsBit
NPlusKPatternsBit
DoAndIfThenElseBit
MultiWayIfBit
GadtSyntaxBit
ImportQualifiedPostBit
LinearTypesBit
NoLexicalNegationBit
OverloadedRecordDotBit
OverloadedRecordUpdateBit
InRulePragBit
InNestedCommentBit
UsePosPragsBit	If this is enabled, '{-# LINE ... -#}' and '{-# COLUMN ... #-}' update the internal position. Otherwise, those pragmas are lexed as tokens of their own.

Instances

Instances details

Enum ExtBits
Instance details Defined in GHC.Parser.Lexer Methods succ :: ExtBits -> ExtBits # pred :: ExtBits -> ExtBits # toEnum :: Int -> ExtBits # fromEnum :: ExtBits -> Int # enumFrom :: ExtBits -> [ExtBits] # enumFromThen :: ExtBits -> ExtBits -> [ExtBits] # enumFromTo :: ExtBits -> ExtBits -> [ExtBits] # enumFromThenTo :: ExtBits -> ExtBits -> ExtBits -> [ExtBits] #

data PState #

Constructors

PState

Fields

buffer :: StringBuffer
options :: ParserOpts
warnings :: Messages PsMessage
errors :: Messages PsMessage
tab_first :: Maybe RealSrcSpan
tab_count :: !Word
last_tk :: Maybe (PsLocated Token)
prev_loc :: PsSpan
prev_loc2 :: PsSpan
last_loc :: PsSpan
last_len :: !Int
loc :: PsLoc
context :: [LayoutContext]
lex_state :: [Int]
srcfiles :: [FastString]
alr_pending_implicit_tokens :: [PsLocated Token]
alr_next_token :: Maybe (PsLocated Token)
alr_last_loc :: PsSpan
alr_context :: [ALRContext]
alr_expecting_ocurly :: Maybe ALRLayout
alr_justClosedExplicitLetBlock :: Bool
eof_pos :: Maybe (Pair RealSrcSpan RealSrcSpan)
header_comments :: Maybe [LEpaComment]
comment_q :: [LEpaComment]
hdk_comments :: OrdList (PsLocated HdkComment)

data HdkComment #

Haddock comment as produced by the lexer. These are accumulated in PState and then processed in GHC.Parser.PostProcess.Haddock. The location of the HsDocStrings spans over the contents of the docstring - i.e. it does not include the decorator ("-- |", "{-|" etc.)

Constructors

HdkCommentNext HsDocString
HdkCommentPrev HsDocString
HdkCommentNamed String HsDocString
HdkCommentSection Int HsDocString

Instances

Instances details

Show HdkComment
Instance details Defined in GHC.Parser.Lexer Methods showsPrec :: Int -> HdkComment -> ShowS # show :: HdkComment -> String # showList :: [HdkComment] -> ShowS #

data ParserOpts #

Parser options.

See mkParserOpts to construct this.

Constructors

ParserOpts
Fields pExtsBitmap :: !ExtsBitmap bitmap of permitted extensions pDiagOpts :: !DiagOpts Options to construct diagnostic messages. pSupportedExts :: [String] supported extensions (only used for suggestions in error messages)

data ParseResult a :: TYPE ('SumRep '['TupleRep '[LiftedRep, LiftedRep], LiftedRep]) where #

The result of running a parser.

Bundled Patterns

pattern PFailed :: PState -> ParseResult a

The parser has consumed a (possibly empty) prefix of the input and failed.

The carried parsing state can be used to resume parsing. It is the state right before failure, including the fatal parse error. getPsMessages and getPsErrorMessages must return a non-empty bag of errors.

pattern POk :: PState -> a -> ParseResult a

The parser has consumed a (possibly empty) prefix of the input and produced a result. Use getPsMessages to check for accumulated warnings and non-fatal errors.

The carried parsing state can be used to resume parsing.

type DsM = TcRnIf DsGblEnv DsLclEnv #

Desugaring monad. See also TcM.

data DsMetaVal #

Constructors

DsBound Id
DsSplice (HsExpr GhcTc)

type DsMetaEnv = NameEnv DsMetaVal #

data IsExtraConstraint #

Constructors

YesExtraConstraint
NoExtraConstraint

Instances

Instances details

Outputable IsExtraConstraint
Instance details Defined in GHC.Tc.Utils.Monad Methods ppr :: IsExtraConstraint -> SDoc #

type DsWarning = (SrcSpan, SDoc) #

data MatchResult a #

This is a value of type a with potentially a CoreExpr-shaped hole in it. This is used to deal with cases where we are potentially handling pattern match failure, and want to later specify how failure is handled.

Constructors

MR_Infallible (DsM a)	We represent the case where there is no hole without a function from `CoreExpr`, like this, because sometimes we have nothing to put in the hole and so want to be sure there is in fact no hole.
MR_Fallible (CoreExpr -> DsM a)

Instances

Instances details

Applicative MatchResult	Product is an "or" on fallibility---the combined match result is infallible only if the left and right argument match results both were. This is useful for combining a bunch of alternatives together and then getting the overall fallibility of the entire group. See `mkDataConCase` for an example.
Instance details Defined in GHC.HsToCore.Monad Methods pure :: a -> MatchResult a # (<>) :: MatchResult (a -> b) -> MatchResult a -> MatchResult b # liftA2 :: (a -> b -> c) -> MatchResult a -> MatchResult b -> MatchResult c # (>) :: MatchResult a -> MatchResult b -> MatchResult b # (<*) :: MatchResult a -> MatchResult b -> MatchResult a #
Functor MatchResult
Instance details Defined in GHC.HsToCore.Monad Methods fmap :: (a -> b) -> MatchResult a -> MatchResult b # (<$) :: a -> MatchResult b -> MatchResult a #

type DsWrapper = CoreExpr -> CoreExpr #

data EquationInfo #

Constructors

EqnInfo

Fields

eqn_pats :: [Pat GhcTc]
The patterns for an equation
NB: We have already applied decideBangHood to these patterns. See Note [decideBangHood] in GHC.HsToCore.Utils
eqn_orig :: Origin
Was this equation present in the user source?
This helps us avoid warnings on patterns that GHC elaborated.
For instance, the pattern -1 :: Word gets desugared into W# -1## :: Word, but we shouldn't warn about an overflowed literal for both of these cases.
eqn_rhs :: MatchResult CoreExpr
What to do after match

Instances

Instances details

Outputable EquationInfo
Instance details Defined in GHC.HsToCore.Monad Methods ppr :: EquationInfo -> SDoc #

data DsMatchContext #

Constructors

DsMatchContext (HsMatchContext GhcRn) SrcSpan

Instances

Instances details

Outputable DsMatchContext
Instance details Defined in GHC.HsToCore.Monad Methods ppr :: DsMatchContext -> SDoc #

data RecompReason #

Instances

Instances details

Outputable RecompReason
Instance details Defined in GHC.Iface.Recomp Methods ppr :: RecompReason -> SDoc #
Eq RecompReason
Instance details Defined in GHC.Iface.Recomp Methods (==) :: RecompReason -> RecompReason -> Bool # (/=) :: RecompReason -> RecompReason -> Bool #

data CompileReason #

Constructors

MustCompile	The .hs file has been touched, or the .o/.hi file does not exist
RecompBecause !RecompReason	The .o/.hi files are up to date, but something else has changed to force recompilation; the String says what (one-line summary)

Instances

Instances details

Outputable CompileReason
Instance details Defined in GHC.Iface.Recomp Methods ppr :: CompileReason -> SDoc #
Eq CompileReason
Instance details Defined in GHC.Iface.Recomp Methods (==) :: CompileReason -> CompileReason -> Bool # (/=) :: CompileReason -> CompileReason -> Bool #

data MaybeValidated a #

Constructors

UpToDateItem a	The item contained is validated to be up to date
OutOfDateItem	The item is are absent altogether or out of date, for the reason given.
Fields !CompileReason the reason we need to recompile. (Maybe a) The old item, if it exists

Instances

Instances details

Functor MaybeValidated
Instance details Defined in GHC.Iface.Recomp Methods fmap :: (a -> b) -> MaybeValidated a -> MaybeValidated b # (<$) :: a -> MaybeValidated b -> MaybeValidated a #
Outputable a => Outputable (MaybeValidated a)
Instance details Defined in GHC.Iface.Recomp Methods ppr :: MaybeValidated a -> SDoc #

data RecompileRequired #

Constructors

UpToDate	everything is up to date, recompilation is not required
NeedsRecompile !CompileReason	Need to compile the module

Instances

Instances details

Monoid RecompileRequired
Instance details Defined in GHC.Iface.Recomp Methods mempty :: RecompileRequired # mappend :: RecompileRequired -> RecompileRequired -> RecompileRequired # mconcat :: [RecompileRequired] -> RecompileRequired #
Semigroup RecompileRequired
Instance details Defined in GHC.Iface.Recomp Methods (<>) :: RecompileRequired -> RecompileRequired -> RecompileRequired # sconcat :: NonEmpty RecompileRequired -> RecompileRequired # stimes :: Integral b => b -> RecompileRequired -> RecompileRequired #
Outputable RecompileRequired
Instance details Defined in GHC.Iface.Recomp Methods ppr :: RecompileRequired -> SDoc #
Eq RecompileRequired
Instance details Defined in GHC.Iface.Recomp Methods (==) :: RecompileRequired -> RecompileRequired -> Bool # (/=) :: RecompileRequired -> RecompileRequired -> Bool #

data InstBindings a #

Constructors

InstBindings
Fields ib_tyvars :: [Name] ib_binds :: LHsBinds a ib_pragmas :: [LSig a] ib_extensions :: [Extension] ib_derived :: Bool

data InstInfo a #

Constructors

InstInfo
Fields iSpec :: ClsInst iBinds :: InstBindings a

Instances

Instances details

OutputableBndrId a => Outputable (InstInfo (GhcPass a))
Instance details Defined in GHC.Tc.Utils.Env Methods ppr :: InstInfo (GhcPass a) -> SDoc #

type ImportDeclUsage = (LImportDecl GhcRn, [GlobalRdrElt], [Name]) #

data SpliceInfo #

The splice data to be logged

Constructors

SpliceInfo
Fields spliceDescription :: String spliceSource :: Maybe (LHsExpr GhcRn) spliceIsDecl :: Bool spliceGenerated :: SDoc

type RenamedStuff = Maybe (HsGroup GhcRn, [LImportDecl GhcRn], Maybe [(LIE GhcRn, Avails)], Maybe (LHsDoc GhcRn)) #

data TcRnExprMode #

How should we infer a type? See Note [TcRnExprMode]

Constructors

TM_Inst	Instantiate inferred quantifiers only (:type)
TM_Default	Instantiate all quantifiers, and do eager defaulting (:type +d)

data CoreModule #

A CoreModule consists of just the fields of a ModGuts that are needed for the compileToCoreModule interface.

Constructors

CoreModule
Fields cm_module :: !Module Module name cm_types :: !TypeEnv Type environment for types declared in this module cm_binds :: CoreProgram Declarations cm_safe :: SafeHaskellMode Safe Haskell mode

Instances

Instances details

Show CoreModule Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods showsPrec :: Int -> CoreModule -> ShowS # show :: CoreModule -> String # showList :: [CoreModule] -> ShowS #
NFData CoreModule Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: CoreModule -> () #
Outputable CoreModule
Instance details Defined in GHC Methods ppr :: CoreModule -> SDoc #

type TypecheckedSource = LHsBinds GhcTc #

type RenamedSource = (HsGroup GhcRn, [LImportDecl GhcRn], Maybe [(LIE GhcRn, Avails)], Maybe (LHsDoc GhcRn)) #

type ParsedSource = Located (HsModule GhcPs) #

data Extension #

The language extensions known to GHC.

Note that there is an orphan Binary instance for this type supplied by the GHC.LanguageExtensions module provided by ghc-boot. We can't provide here as this would require adding transitive dependencies to the template-haskell package, which must have a minimal dependency set.

Constructors

OverlappingInstances
UndecidableInstances
IncoherentInstances
UndecidableSuperClasses
MonomorphismRestriction
MonoLocalBinds
DeepSubsumption
RelaxedPolyRec
ExtendedDefaultRules
ForeignFunctionInterface
UnliftedFFITypes
InterruptibleFFI
CApiFFI
GHCForeignImportPrim
JavaScriptFFI
ParallelArrays
Arrows
TemplateHaskell
TemplateHaskellQuotes
QualifiedDo
QuasiQuotes
ImplicitParams
ImplicitPrelude
ScopedTypeVariables
AllowAmbiguousTypes
UnboxedTuples
UnboxedSums
UnliftedNewtypes
UnliftedDatatypes
BangPatterns
TypeFamilies
TypeFamilyDependencies
TypeInType
OverloadedStrings
OverloadedLists
NumDecimals
DisambiguateRecordFields
RecordWildCards
NamedFieldPuns
ViewPatterns
GADTs
GADTSyntax
NPlusKPatterns
DoAndIfThenElse
BlockArguments
RebindableSyntax
ConstraintKinds
PolyKinds
DataKinds
TypeData
InstanceSigs
ApplicativeDo
LinearTypes
StandaloneDeriving
DeriveDataTypeable
AutoDeriveTypeable
DeriveFunctor
DeriveTraversable
DeriveFoldable
DeriveGeneric
DefaultSignatures
DeriveAnyClass
DeriveLift
DerivingStrategies
DerivingVia
TypeSynonymInstances
FlexibleContexts
FlexibleInstances
ConstrainedClassMethods
MultiParamTypeClasses
NullaryTypeClasses
FunctionalDependencies
UnicodeSyntax
ExistentialQuantification
MagicHash
EmptyDataDecls
KindSignatures
RoleAnnotations
ParallelListComp
TransformListComp
MonadComprehensions
GeneralizedNewtypeDeriving
RecursiveDo
PostfixOperators
TupleSections
PatternGuards
LiberalTypeSynonyms
RankNTypes
ImpredicativeTypes
TypeOperators
ExplicitNamespaces
PackageImports
ExplicitForAll
AlternativeLayoutRule
AlternativeLayoutRuleTransitional
DatatypeContexts
NondecreasingIndentation
RelaxedLayout
TraditionalRecordSyntax
LambdaCase
MultiWayIf
BinaryLiterals
NegativeLiterals
HexFloatLiterals
DuplicateRecordFields
OverloadedLabels
EmptyCase
PatternSynonyms
PartialTypeSignatures
NamedWildCards
StaticPointers
TypeApplications
Strict
StrictData
EmptyDataDeriving
NumericUnderscores
QuantifiedConstraints
StarIsType
ImportQualifiedPost
CUSKs
StandaloneKindSignatures
LexicalNegation
FieldSelectors
OverloadedRecordDot
OverloadedRecordUpdate

Instances

Instances details

Bounded Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods minBound :: Extension # maxBound :: Extension #
Enum Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods succ :: Extension -> Extension # pred :: Extension -> Extension # toEnum :: Int -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #
Generic Extension
Instance details Defined in GHC.LanguageExtensions.Type Associated Types type Rep Extension :: Type -> Type # Methods from :: Extension -> Rep Extension x # to :: Rep Extension x -> Extension #
Show Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods showsPrec :: Int -> Extension -> ShowS # show :: Extension -> String # showList :: [Extension] -> ShowS #
NFData Extension Source #
Instance details Defined in Development.IDE.GHC.Orphans Methods rnf :: Extension -> () #
Outputable Extension
Instance details Defined in GHC.Utils.Outputable Methods ppr :: Extension -> SDoc #
Eq Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods (==) :: Extension -> Extension -> Bool # (/=) :: Extension -> Extension -> Bool #
Ord Extension
Instance details Defined in GHC.LanguageExtensions.Type Methods compare :: Extension -> Extension -> Ordering # (<) :: Extension -> Extension -> Bool # (<=) :: Extension -> Extension -> Bool # (>) :: Extension -> Extension -> Bool # (>=) :: Extension -> Extension -> Bool # max :: Extension -> Extension -> Extension # min :: Extension -> Extension -> Extension #
type Rep Extension
Instance details Defined in GHC.LanguageExtensions.Type type Rep Extension = D1 ('MetaData "Extension" "GHC.LanguageExtensions.Type" "ghc-boot-th-9.6.3" 'False) ((((((C1 ('MetaCons "Cpp" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "OverlappingInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UndecidableInstances" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "IncoherentInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UndecidableSuperClasses" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "MonomorphismRestriction" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MonoLocalBinds" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "DeepSubsumption" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RelaxedPolyRec" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ExtendedDefaultRules" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ForeignFunctionInterface" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnliftedFFITypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InterruptibleFFI" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CApiFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GHCForeignImportPrim" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "JavaScriptFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ParallelArrays" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Arrows" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TemplateHaskell" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TemplateHaskellQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "QualifiedDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "QuasiQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImplicitParams" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "ImplicitPrelude" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ScopedTypeVariables" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "AllowAmbiguousTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnboxedTuples" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnboxedSums" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnliftedNewtypes" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "UnliftedDatatypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "BangPatterns" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: (((((C1 ('MetaCons "TypeFamilies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeFamilyDependencies" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeInType" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedStrings" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "OverloadedLists" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NumDecimals" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DisambiguateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RecordWildCards" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "NamedFieldPuns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ViewPatterns" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "GADTs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GADTSyntax" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "NPlusKPatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DoAndIfThenElse" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "BlockArguments" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RebindableSyntax" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "ConstraintKinds" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PolyKinds" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DataKinds" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeData" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "InstanceSigs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ApplicativeDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LinearTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StandaloneDeriving" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "DeriveDataTypeable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AutoDeriveTypeable" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DeriveFunctor" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveTraversable" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "DeriveFoldable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveGeneric" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DefaultSignatures" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveAnyClass" 'PrefixI 'False) (U1 :: Type -> Type))))))) :+: (((((C1 ('MetaCons "DeriveLift" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DerivingStrategies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DerivingVia" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TypeSynonymInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FlexibleContexts" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "FlexibleInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ConstrainedClassMethods" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "MultiParamTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NullaryTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "FunctionalDependencies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnicodeSyntax" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ExistentialQuantification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MagicHash" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "EmptyDataDecls" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "KindSignatures" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "RoleAnnotations" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ParallelListComp" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TransformListComp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MonadComprehensions" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "GeneralizedNewtypeDeriving" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RecursiveDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PostfixOperators" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TupleSections" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "PatternGuards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LiberalTypeSynonyms" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RankNTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImpredicativeTypes" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TypeOperators" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplicitNamespaces" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PackageImports" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplicitForAll" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: (((((C1 ('MetaCons "AlternativeLayoutRule" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AlternativeLayoutRuleTransitional" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DatatypeContexts" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NondecreasingIndentation" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "RelaxedLayout" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TraditionalRecordSyntax" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LambdaCase" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MultiWayIf" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "BinaryLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NegativeLiterals" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "HexFloatLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DuplicateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "OverloadedLabels" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyCase" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PatternSynonyms" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PartialTypeSignatures" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "NamedWildCards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StaticPointers" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeApplications" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Strict" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "StrictData" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyDataDeriving" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NumericUnderscores" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "QuantifiedConstraints" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "StarIsType" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImportQualifiedPost" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CUSKs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StandaloneKindSignatures" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "LexicalNegation" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FieldSelectors" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OverloadedRecordDot" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedRecordUpdate" 'PrefixI 'False) (U1 :: Type -> Type))))))))

class HasSrcSpan a where Source #

Methods

getLoc :: a -> SrcSpan Source #

Instances

Instances details

HasSrcSpan SrcSpan Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: SrcSpan -> SrcSpan Source #
HasSrcSpan (SrcSpanAnn' ann) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: SrcSpanAnn' ann -> SrcSpan Source #
HasSrcSpan (GenLocated (SrcSpanAnn' ann) a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan Source #
HasSrcSpan (GenLocated SrcSpan a) Source #
Instance details Defined in Development.IDE.GHC.Compat.Core Methods getLoc :: GenLocated SrcSpan a -> SrcSpan Source #

pattern RealSrcSpan :: RealSrcSpan -> Maybe BufSpan -> SrcSpan Source #

pattern RealSrcLoc :: RealSrcLoc -> Maybe BufPos -> SrcLoc Source #

pattern AvailTC :: Name -> [Name] -> [FieldLabel] -> AvailInfo Source #

pattern GRE :: Name -> Parent -> Bool -> [ImportSpec] -> GlobalRdrElt Source #

pattern FunTy :: FunTyFlag -> Type -> Type -> Type Source #

pattern ManyTy :: Mult #

pattern OneTy :: Mult #

pattern XFunDep :: !(XXFunDep pass) -> FunDep pass #

pattern ExposePackage :: String -> PackageArg -> ModRenaming -> PackageFlag Source #

pattern AvailFL :: FieldLabel -> AvailInfo Source #

pattern AvailName :: Name -> AvailInfo Source #

pattern ConPatIn :: Located (ConLikeP GhcPs) -> HsConPatDetails GhcPs -> Pat GhcPs Source #

succeeded :: SuccessFlag -> Bool #

failed :: SuccessFlag -> Bool #

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #

An infix synonym for fmap.

The name of this operator is an allusion to $. Note the similarities between their types:

 ($)  ::              (a -> b) ->   a ->   b
(<$>) :: Functor f => (a -> b) -> f a -> f b

Whereas $ is function application, <$> is function application lifted over a Functor.

Examples

Expand

Convert from a Maybe Int to a Maybe String using show:

>>> show <$> Nothing
Nothing
>>> show <$> Just 3
Just "3"

Convert from an Either Int Int to an Either Int String using show:

>>> show <$> Left 17
Left 17
>>> show <$> Right 17
Right "17"

Double each element of a list:

>>> (*2) <$> [1,2,3]
[2,4,6]

Apply even to the second element of a pair:

>>> even <$> (2,2)
(2,True)

isTyVar :: Var -> Bool #

Is this a type-level (i.e., computationally irrelevant, thus erasable) variable? Satisfies isTyVar = not . isId.

newName :: OccName -> TcM Name #

try :: Exception e => IO a -> IO (Either e a) #

Similar to catch, but returns an Either result which is (Right a) if no exception of type e was raised, or (Left ex) if an exception of type e was raised and its value is ex. If any other type of exception is raised then it will be propagated up to the next enclosing exception handler.

 try a = catch (Right `liftM` a) (return . Left)

mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

Examples

Expand

mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

throwTo :: Exception e => ThreadId -> e -> IO () #

throwTo raises an arbitrary exception in the target thread (GHC only).

Exception delivery synchronizes between the source and target thread: throwTo does not return until the exception has been raised in the target thread. The calling thread can thus be certain that the target thread has received the exception. Exception delivery is also atomic with respect to other exceptions. Atomicity is a useful property to have when dealing with race conditions: e.g. if there are two threads that can kill each other, it is guaranteed that only one of the threads will get to kill the other.

Whatever work the target thread was doing when the exception was raised is not lost: the computation is suspended until required by another thread.

If the target thread is currently making a foreign call, then the exception will not be raised (and hence throwTo will not return) until the call has completed. This is the case regardless of whether the call is inside a mask or not. However, in GHC a foreign call can be annotated as interruptible, in which case a throwTo will cause the RTS to attempt to cause the call to return; see the GHC documentation for more details.

Important note: the behaviour of throwTo differs from that described in the paper "Asynchronous exceptions in Haskell" (http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm). In the paper, throwTo is non-blocking; but the library implementation adopts a more synchronous design in which throwTo does not return until the exception is received by the target thread. The trade-off is discussed in Section 9 of the paper. Like any blocking operation, throwTo is therefore interruptible (see Section 5.3 of the paper). Unlike other interruptible operations, however, throwTo is always interruptible, even if it does not actually block.

There is no guarantee that the exception will be delivered promptly, although the runtime will endeavour to ensure that arbitrary delays don't occur. In GHC, an exception can only be raised when a thread reaches a safe point, where a safe point is where memory allocation occurs. Some loops do not perform any memory allocation inside the loop and therefore cannot be interrupted by a throwTo.

If the target of throwTo is the calling thread, then the behaviour is the same as throwIO, except that the exception is thrown as an asynchronous exception. This means that if there is an enclosing pure computation, which would be the case if the current IO operation is inside unsafePerformIO or unsafeInterleaveIO, that computation is not permanently replaced by the exception, but is suspended as if it had received an asynchronous exception.

Note that if throwTo is called with the current thread as the target, the exception will be thrown even if the thread is currently inside mask or uninterruptibleMask.

getEnv :: IOEnv env env #

setEnv :: env' -> IOEnv env' a -> IOEnv env a #

Perform a computation with a different environment

srcLocFile :: RealSrcLoc -> FastString #

Gives the filename of the RealSrcLoc

appPrec :: PprPrec #

infinity :: IntWithInf #

A representation of infinity

foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b #

Right-to-left monadic fold over the elements of a structure.

Given a structure t with elements (a, b, c, ..., x, y), the result of a fold with an operator function f is equivalent to:

foldrM f z t = do
    yy <- f y z
    xx <- f x yy
    ...
    bb <- f b cc
    aa <- f a bb
    return aa -- Just @return z@ when the structure is empty

For a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c, their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:

(f1 >=> f2) a = f1 a >>= f2

Another way of thinking about foldrM is that it amounts to an application to z of a Kleisli composition:

foldrM f z t = f y >=> f x >=> ... >=> f b >=> f a $ z

The monadic effects of foldrM are sequenced from right to left, and e.g. folds of infinite lists will diverge.

If at some step the bind operator (>>=) short-circuits (as with, e.g., mzero in a MonadPlus), the evaluated effects will be from a tail of the element sequence. If you want to evaluate the monadic effects in left-to-right order, or perhaps be able to short-circuit after an initial sequence of elements, you'll need to use foldlM instead.

If the monadic effects don't short-circuit, the outermost application of f is to the leftmost element a, so that, ignoring effects, the result looks like a right fold:

a `f` (b `f` (c `f` (... (x `f` (y `f` z))))).

Examples

Expand

Basic usage:

>>> let f i acc = do { print i ; return $ i : acc }
>>> foldrM f [] [0..3]
3
2
1
0
[0,1,2,3]

foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b #

Left-to-right monadic fold over the elements of a structure.

Given a structure t with elements (a, b, ..., w, x, y), the result of a fold with an operator function f is equivalent to:

foldlM f z t = do
    aa <- f z a
    bb <- f aa b
    ...
    xx <- f ww x
    yy <- f xx y
    return yy -- Just @return z@ when the structure is empty

For a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c, their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:

(f1 >=> f2) a = f1 a >>= f2

Another way of thinking about foldlM is that it amounts to an application to z of a Kleisli composition:

foldlM f z t =
    flip f a >=> flip f b >=> ... >=> flip f x >=> flip f y $ z

The monadic effects of foldlM are sequenced from left to right.

If at some step the bind operator (>>=) short-circuits (as with, e.g., mzero in a MonadPlus), the evaluated effects will be from an initial segment of the element sequence. If you want to evaluate the monadic effects in right-to-left order, or perhaps be able to short-circuit after processing a tail of the sequence of elements, you'll need to use foldrM instead.

If the monadic effects don't short-circuit, the outermost application of f is to the rightmost element y, so that, ignoring effects, the result looks like a left fold:

((((z `f` a) `f` b) ... `f` w) `f` x) `f` y

Examples

Expand

Basic usage:

>>> let f a e = do { print e ; return $ e : a }
>>> foldlM f [] [0..3]
0
1
2
3
[3,2,1,0]

funResultTy :: HasDebugCallStack => Type -> Type #

Extract the function result type and panic if that is not possible

mkFunTy :: HasDebugCallStack => FunTyFlag -> Mult -> Type -> Type -> Type infixr 3 #

splitTyConApp :: Type -> (TyCon, [Type]) #

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor. Panics if that is not possible. See also splitTyConApp_maybe

mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) #

The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

newUnique :: TcRnIf gbl lcl Unique #

isAlgType :: Type -> Bool #

See Type for what an algebraic type is. Should only be applied to types, as opposed to e.g. partially saturated type constructors

newMutVar :: a -> IOEnv env (IORef a) #

readMutVar :: IORef a -> IOEnv env a #

writeMutVar :: IORef a -> a -> IOEnv env () #

orM :: Monad m => m Bool -> m Bool -> m Bool #

Monadic version of or

showException :: Exception e => e -> String #

Show an exception as a string.

partitionM :: Monad m => (a -> m Bool) -> [a] -> m ([a], [a]) #

Monadic version of partition

whenM :: Monad m => m Bool -> m () -> m () #

Monadic version of when, taking the condition in the monad

unlessM :: Monad m => m Bool -> m () -> m () #

Monadic version of unless, taking the condition in the monad

parsePattern :: P (GenLocated SrcSpanAnnA (Pat GhcPs)) #

putIfaceTopBndr :: BinHandle -> IfaceTopBndr -> IO () #

getIfaceTopBndr :: BinHandle -> IO IfaceTopBndr #

mkTyConTy :: TyCon -> Type #

(mkTyConTy tc) returns (TyConApp tc []) but arranges to share that TyConApp among all calls See Note [Sharing nullary TyConApps] So it's just an alias for tyConNullaryTy!

runGhc #

Arguments

:: Maybe FilePath	See argument to `initGhcMonad`.
-> Ghc a	The action to perform.
-> IO a

Run function for the Ghc monad.

It initialises the GHC session and warnings via initGhcMonad. Each call to this function will create a new session which should not be shared among several threads.

Any errors not handled inside the Ghc action are propagated as IO exceptions.

typeLevity_maybe :: HasDebugCallStack => Type -> Maybe Levity #

Tries to compute the PromDataConInfo of the given type. Returns either a definite PromDataConInfo, or Nothing if we aren't sure (e.g. the type is representation-polymorphic).

Panics if the kind does not have the shape TYPE r.

expandTypeSynonyms :: Type -> Type #

Expand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.

expandTypeSynonyms only expands out type synonyms mentioned in the type, not in the kinds of any TyCon or TyVar mentioned in the type.

Keep this synchronized with synonymTyConsOfType

newFamInst :: FamFlavor -> CoAxiom Unbranched -> TcM FamInst #

panic :: HasCallStack => String -> a #

Panics and asserts.

sorry :: HasCallStack => String -> a #

Panics and asserts.

pgmError :: HasCallStack => String -> a #

Panics and asserts.

cmdLineError :: String -> a #

cmdLineErrorIO :: String -> IO a #

assertPanic :: String -> Int -> a #

Throw a failed assertion exception for a given filename and line number.

isBoxed :: Boxity -> Bool #

noExtField :: NoExtField #

Used when constructing a term with an unused extension point.

dataConCantHappen :: DataConCantHappen -> a #

Eliminate a DataConCantHappen. See Note [Constructor cannot occur].

stableModuleNameCmp :: ModuleName -> ModuleName -> Ordering #

Compares module names lexically, rather than by their Uniques

moduleNameFS :: ModuleName -> FastString #

moduleNameString :: ModuleName -> String #

mkModuleName :: String -> ModuleName #

mkModuleNameFS :: FastString -> ModuleName #

moduleNameSlashes :: ModuleName -> String #

Returns the string version of the module name, with dots replaced by slashes.

moduleNameColons :: ModuleName -> String #

Returns the string version of the module name, with dots replaced by colons.

parseModuleName :: ReadP ModuleName #

mkVarOccFS :: FastString -> OccName #

mkRecFldSelOcc :: FastString -> OccName #

safeShowException :: Exception e => e -> IO String #

Show an exception which can possibly throw other exceptions. Used when displaying exception thrown within TH code.

showGhcExceptionUnsafe :: GhcException -> ShowS #

Append a description of the given exception to this string.

Note that this uses defaultSDocContext, which doesn't use the options set by the user via DynFlags.

showGhcException :: SDocContext -> GhcException -> ShowS #

Append a description of the given exception to this string.

throwGhcException :: GhcException -> a #

throwGhcExceptionIO :: GhcException -> IO a #

handleGhcException :: ExceptionMonad m => (GhcException -> m a) -> m a -> m a #

pprPanic :: HasCallStack => String -> SDoc -> a #

Throw an exception saying "bug in GHC" with a callstack

panicDoc :: String -> SDoc -> a #

Throw an exception saying "bug in GHC"

sorryDoc :: String -> SDoc -> a #

Throw an exception saying "this isn't finished yet"

pgmErrorDoc :: String -> SDoc -> a #

Throw an exception saying "bug in pgm being compiled" (used for unusual program errors)

tryMost :: IO a -> IO (Either SomeException a) #

Like try, but pass through UserInterrupt and Panic exceptions. Used when we want soft failures when reading interface files, for example. TODO: I'm not entirely sure if this is catching what we really want to catch

withSignalHandlers :: ExceptionMonad m => m a -> m a #

Temporarily install standard signal handlers for catching ^C, which just throw an exception in the current thread.

callStackDoc :: HasCallStack => SDoc #

prettyCallStackDoc :: CallStack -> SDoc #

assertPprPanic :: HasCallStack => SDoc -> a #

Panic with an assertion failure, recording the given file and line number. Should typically be accessed with the ASSERT family of macros

assertPpr :: HasCallStack => Bool -> SDoc -> a -> a #

assertPprMaybe :: HasCallStack => Maybe SDoc -> a -> a #

massertPpr :: (HasCallStack, Applicative m) => Bool -> SDoc -> m () #

assertPprM :: (HasCallStack, Monad m) => m Bool -> SDoc -> m () #

getKey :: Unique -> Int #

hasKey :: Uniquable a => a -> Unique -> Bool #

tidyNameOcc :: Name -> OccName -> Name #

nameOccName :: Name -> OccName #

setNameUnique :: Name -> Unique -> Name #

nameUnique :: Name -> Unique #

idName :: Id -> Name #

mkPrelTyConRepName :: Name -> TyConRepName #

Make a Name for the Typeable representation of the given wired-in type

tyConRepName_maybe :: TyCon -> Maybe TyConRepName #

isUnboxedTupleTyCon :: TyCon -> Bool #

Is this the TyCon for an unboxed tuple?

isTupleTyCon :: TyCon -> Bool #

Does this TyCon represent a tuple?

NB: when compiling Data.Tuple, the tycons won't reply True to isTupleTyCon, because they are built as AlgTyCons. However they get spat into the interface file as tuple tycons, so I don't think it matters.

mkAnId :: Id -> TyThing #

mkATyCon :: TyCon -> TyThing #

mkForAllTy :: ForAllTyBinder -> Type -> Type #

Like mkTyCoForAllTy, but does not check the occurrence of the binder See Note [Unused coercion variable in ForAllTy]

scaledThing :: Scaled a -> a #

pprTyVar :: TyVar -> SDoc #

pprTyLit :: TyLit -> SDoc #

pprCo :: Coercion -> SDoc #

pprKind :: Kind -> SDoc #

debugPprType :: Type -> SDoc #

debugPprType is a simple pretty printer that prints a type without going through IfaceType. It does not format as prettily as the normal route, but it's much more direct, and that can be useful for debugging. E.g. with -dppr-debug it prints the kind on type-variable occurrences which the normal route fundamentally cannot do.

pprType :: Type -> SDoc #

noFreeVarsOfType :: Type -> Bool #

emptyUFM :: UniqFM key elt #

isNullUFM :: UniqFM key elt -> Bool #

unitUFM :: Uniquable key => key -> elt -> UniqFM key elt #

unitDirectlyUFM :: Unique -> elt -> UniqFM key elt #

zipToUFM :: Uniquable key => [key] -> [elt] -> UniqFM key elt #

listToUFM :: Uniquable key => [(key, elt)] -> UniqFM key elt #

listToUFM_Directly :: [(Unique, elt)] -> UniqFM key elt #

listToIdentityUFM :: Uniquable key => [key] -> UniqFM key key #

listToUFM_C :: Uniquable key => (elt -> elt -> elt) -> [(key, elt)] -> UniqFM key elt #

addToUFM :: Uniquable key => UniqFM key elt -> key -> elt -> UniqFM key elt #

addListToUFM :: Uniquable key => UniqFM key elt -> [(key, elt)] -> UniqFM key elt #

addListToUFM_Directly :: UniqFM key elt -> [(Unique, elt)] -> UniqFM key elt #

addToUFM_Directly :: UniqFM key elt -> Unique -> elt -> UniqFM key elt #

addToUFM_C :: Uniquable key => (elt -> elt -> elt) -> UniqFM key elt -> key -> elt -> UniqFM key elt #

addToUFM_Acc :: Uniquable key => (elt -> elts -> elts) -> (elt -> elts) -> UniqFM key elts -> key -> elt -> UniqFM key elts #

addToUFM_L :: Uniquable key => (key -> elt -> elt -> elt) -> key -> elt -> UniqFM key elt -> (Maybe elt, UniqFM key elt) #

Add an element, returns previous lookup result and new map. If old element doesn't exist, add the passed element directly, otherwise compute the element to add using the passed function.

alterUFM :: Uniquable key => (Maybe elt -> Maybe elt) -> UniqFM key elt -> key -> UniqFM key elt #

addListToUFM_C :: Uniquable key => (elt -> elt -> elt) -> UniqFM key elt -> [(key, elt)] -> UniqFM key elt #

Add elements to the map, combining existing values with inserted ones using the given function.

adjustUFM :: Uniquable key => (elt -> elt) -> UniqFM key elt -> key -> UniqFM key elt #

adjustUFM_Directly :: (elt -> elt) -> UniqFM key elt -> Unique -> UniqFM key elt #

delFromUFM :: Uniquable key => UniqFM key elt -> key -> UniqFM key elt #

delListFromUFM :: Uniquable key => UniqFM key elt -> [key] -> UniqFM key elt #

delListFromUFM_Directly :: UniqFM key elt -> [Unique] -> UniqFM key elt #

delFromUFM_Directly :: UniqFM key elt -> Unique -> UniqFM key elt #

plusUFM :: UniqFM key elt -> UniqFM key elt -> UniqFM key elt #

plusUFM_C :: (elt -> elt -> elt) -> UniqFM key elt -> UniqFM key elt -> UniqFM key elt #

plusUFM_CD :: (elta -> eltb -> eltc) -> UniqFM key elta -> elta -> UniqFM key eltb -> eltb -> UniqFM key eltc #

`plusUFM_CD f m1 d1 m2 d2` merges the maps using f as the combinding function and d1 resp. d2 as the default value if there is no entry in m1 reps. m2. The domain is the union of the domains of m1 and m2.

IMPORTANT NOTE: This function strictly applies the modification function and forces the result unlike most the other functions in this module.

Representative example:

plusUFM_CD f {A: 1, B: 2} 23 {B: 3, C: 4} 42
   == {A: f 1 42, B: f 2 3, C: f 23 4 }

plusUFM_CD2 :: (Maybe elta -> Maybe eltb -> eltc) -> UniqFM key elta -> UniqFM key eltb -> UniqFM key eltc #

`plusUFM_CD2 f m1 m2` merges the maps using f as the combining function. Unlike plusUFM_CD, a missing value is not defaulted: it is instead passed as Nothing to f. f can never have both its arguments be Nothing.

IMPORTANT NOTE: This function strictly applies the modification function and forces the result.

`plusUFM_CD2 f m1 m2` is the same as `plusUFM_CD f (mapUFM Just m1) Nothing (mapUFM Just m2) Nothing`.

mergeUFM :: (elta -> eltb -> Maybe eltc) -> (UniqFM key elta -> UniqFM key eltc) -> (UniqFM key eltb -> UniqFM key eltc) -> UniqFM key elta -> UniqFM key eltb -> UniqFM key eltc #

plusMaybeUFM_C :: (elt -> elt -> Maybe elt) -> UniqFM key elt -> UniqFM key elt -> UniqFM key elt #

plusUFMList :: [UniqFM key elt] -> UniqFM key elt #

sequenceUFMList :: [UniqFM key elt] -> UniqFM key [elt] #

minusUFM :: UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt1 #

minusUFM_C :: (elt1 -> elt2 -> Maybe elt1) -> UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt1 #

minusUFC_C f map1 map2 returns map1, except that every mapping key |-> value1 in map1 that shares a key with a mapping key |-> value2 in map2 is altered by f: value1 is replaced by f value1 value2, where Just means that the new value is used and Nothing means that the mapping is deleted.

intersectUFM :: UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt1 #

intersectUFM_C :: (elt1 -> elt2 -> elt3) -> UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt3 #

disjointUFM :: UniqFM key elt1 -> UniqFM key elt2 -> Bool #

foldUFM :: (elt -> a -> a) -> a -> UniqFM key elt -> a #

mapUFM :: (elt1 -> elt2) -> UniqFM key elt1 -> UniqFM key elt2 #

mapMaybeUFM :: (elt1 -> Maybe elt2) -> UniqFM key elt1 -> UniqFM key elt2 #

mapUFM_Directly :: (Unique -> elt1 -> elt2) -> UniqFM key elt1 -> UniqFM key elt2 #

filterUFM :: (elt -> Bool) -> UniqFM key elt -> UniqFM key elt #

filterUFM_Directly :: (Unique -> elt -> Bool) -> UniqFM key elt -> UniqFM key elt #

partitionUFM :: (elt -> Bool) -> UniqFM key elt -> (UniqFM key elt, UniqFM key elt) #

sizeUFM :: UniqFM key elt -> Int #

elemUFM :: Uniquable key => key -> UniqFM key elt -> Bool #

elemUFM_Directly :: Unique -> UniqFM key elt -> Bool #

lookupUFM :: Uniquable key => UniqFM key elt -> key -> Maybe elt #

lookupUFM_Directly :: UniqFM key elt -> Unique -> Maybe elt #

lookupWithDefaultUFM :: Uniquable key => UniqFM key elt -> elt -> key -> elt #

lookupWithDefaultUFM_Directly :: UniqFM key elt -> elt -> Unique -> elt #

ufmToSet_Directly :: UniqFM key elt -> IntSet #

anyUFM :: (elt -> Bool) -> UniqFM key elt -> Bool #

allUFM :: (elt -> Bool) -> UniqFM key elt -> Bool #

seqEltsUFM :: (elt -> ()) -> UniqFM key elt -> () #

nonDetEltsUFM :: UniqFM key elt -> [elt] #

nonDetKeysUFM :: UniqFM key elt -> [Unique] #

nonDetStrictFoldUFM :: (elt -> a -> a) -> a -> UniqFM key elt -> a #

nonDetStrictFoldUFM_DirectlyM :: Monad m => (Unique -> b -> elt -> m b) -> b -> UniqFM key elt -> m b #

In essence foldM See Note [Deterministic UniqFM] to learn about nondeterminism. If you use this please provide a justification why it doesn't introduce nondeterminism.

nonDetStrictFoldUFM_Directly :: (Unique -> elt -> a -> a) -> a -> UniqFM key elt -> a #

nonDetUFMToList :: UniqFM key elt -> [(Unique, elt)] #

ufmToIntMap :: UniqFM key elt -> IntMap elt #

unsafeIntMapToUFM :: IntMap elt -> UniqFM key elt #

unsafeCastUFMKey :: UniqFM key1 elt -> UniqFM key2 elt #

Cast the key domain of a UniqFM.

As long as the domains don't overlap in their uniques this is safe.

equalKeysUFM :: UniqFM key a -> UniqFM key b -> Bool #

pprUniqFM :: (a -> SDoc) -> UniqFM key a -> SDoc #

pprUFM #

Arguments

:: UniqFM key a	The things to be pretty printed
-> ([a] -> SDoc)	The pretty printing function to use on the elements
-> SDoc	`SDoc` where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM.

pprUFMWithKeys #

Arguments

:: UniqFM key a	The things to be pretty printed
-> ([(Unique, a)] -> SDoc)	The pretty printing function to use on the elements
-> SDoc	`SDoc` where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetUFMToList.

pluralUFM :: UniqFM key a -> SDoc #

Determines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.

zipWith3M :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m [d] #

zipWith3M_ :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m () #

zipWith4M :: Monad m => (a -> b -> c -> d -> m e) -> [a] -> [b] -> [c] -> [d] -> m [e] #

zipWithAndUnzipM :: Monad m => (a -> b -> m (c, d)) -> [a] -> [b] -> m ([c], [d]) #

mapAndUnzip3M :: Monad m => (a -> m (b, c, d)) -> [a] -> m ([b], [c], [d]) #

mapAndUnzipM for triples

mapAndUnzip4M :: Monad m => (a -> m (b, c, d, e)) -> [a] -> m ([b], [c], [d], [e]) #

mapAndUnzip5M :: Monad m => (a -> m (b, c, d, e, f)) -> [a] -> m ([b], [c], [d], [e], [f]) #

mapAccumLM #

Arguments

:: (Monad m, Traversable t)
=> (acc -> x -> m (acc, y))	combining function
-> acc	initial state
-> t x	inputs
-> m (acc, t y)	final state, outputs

Monadic version of mapAccumL

mapSndM :: (Applicative m, Traversable f) => (b -> m c) -> f (a, b) -> m (f (a, c)) #

Monadic version of mapSnd

foldlM_ :: (Monad m, Foldable t) => (a -> b -> m a) -> a -> t b -> m () #

Monadic version of foldl that discards its result

filterOutM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #

Like filterM, only it reverses the sense of the test.

mkSplitUniqSupply :: Char -> IO UniqSupply #

Create a unique supply out of thin air. The "mask" (Char) supplied is purely cosmetic, making it easier to figure out where a Unique was born. See Note [Uniques and masks].

The payload part of the Uniques allocated from this UniqSupply are guaranteed distinct wrt all other supplies, regardless of their "mask". This is achieved by allocating the payload part from a single source of Uniques, namely genSym, shared across all UniqSupply's.

initUniqSupply :: Word -> Int -> IO () #

uniqFromMask :: Char -> IO Unique #

splitUniqSupply :: UniqSupply -> (UniqSupply, UniqSupply) #

Build two UniqSupply from a single one, each of which can supply its own Unique.

listSplitUniqSupply :: UniqSupply -> [UniqSupply] #

Create an infinite list of UniqSupply from a single one

uniqFromSupply :: UniqSupply -> Unique #

Obtain the Unique from this particular UniqSupply

uniqsFromSupply :: UniqSupply -> [Unique] #

Obtain an infinite list of Unique that can be generated by constant splitting of the supply

takeUniqFromSupply :: UniqSupply -> (Unique, UniqSupply) #

Obtain the Unique from this particular UniqSupply, and a new supply

initUs :: UniqSupply -> UniqSM a -> (a, UniqSupply) #

Run the UniqSM action, returning the final UniqSupply

initUs_ :: UniqSupply -> UniqSM a -> a #

Run the UniqSM action, discarding the final UniqSupply

mkRealSrcLoc :: FastString -> Int -> Int -> RealSrcLoc #

noSrcLoc :: SrcLoc #

Built-in "bad" RealSrcLoc values for particular locations

srcLocLine :: RealSrcLoc -> Int #

Raises an error when used on a "bad" RealSrcLoc

srcLocCol :: RealSrcLoc -> Int #

Raises an error when used on a "bad" RealSrcLoc

noSrcSpan :: SrcSpan #

Built-in "bad" SrcSpans for common sources of location uncertainty

wiredInSrcSpan :: SrcSpan #

Built-in "bad" SrcSpans for common sources of location uncertainty

mkGeneralSrcSpan :: FastString -> SrcSpan #

Create a "bad" SrcSpan that has not location information

realSrcLocSpan :: RealSrcLoc -> RealSrcSpan #

mkRealSrcSpan :: RealSrcLoc -> RealSrcLoc -> RealSrcSpan #

Create a SrcSpan between two points in a file

mkSrcSpan :: SrcLoc -> SrcLoc -> SrcSpan #

Create a SrcSpan between two points in a file

containsSpan :: RealSrcSpan -> RealSrcSpan -> Bool #

Tests whether the first span "contains" the other span, meaning that it covers at least as much source code. True where spans are equal.

srcSpanStartLine :: RealSrcSpan -> Int #

srcSpanEndLine :: RealSrcSpan -> Int #

srcSpanStartCol :: RealSrcSpan -> Int #

srcSpanEndCol :: RealSrcSpan -> Int #

srcSpanStart :: SrcSpan -> SrcLoc #

Returns the location at the start of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanEnd :: SrcSpan -> SrcLoc #

Returns the location at the end of the SrcSpan or a "bad" SrcSpan if that is unavailable

realSrcSpanStart :: RealSrcSpan -> RealSrcLoc #

realSrcSpanEnd :: RealSrcSpan -> RealSrcLoc #

unLoc :: GenLocated l e -> e #

noLoc :: e -> Located e #

leftmost_smallest :: SrcSpan -> SrcSpan -> Ordering #

Strategies for ordering SrcSpans

isSubspanOf #

Arguments

:: SrcSpan	The span that may be enclosed by the other
-> SrcSpan	The span it may be enclosed by
-> Bool

Determines whether a span is enclosed by another one

getRealSrcSpan :: RealLocated a -> RealSrcSpan #

emptyFsEnv :: FastStringEnv a #

extendFsEnv :: FastStringEnv a -> FastString -> a -> FastStringEnv a #

lookupFsEnv :: FastStringEnv a -> FastString -> Maybe a #

mkFsEnv :: [(FastString, a)] -> FastStringEnv a #

pprWithSourceText :: SourceText -> SDoc -> SDoc #

Special combinator for showing string literals.

mkIntegralLit :: Integral a => a -> IntegralLit #

negateIntegralLit :: IntegralLit -> IntegralLit #

mkFractionalLit :: SourceText -> Bool -> Rational -> Integer -> FractionalExponentBase -> FractionalLit #

fractionalLitFromRational :: Rational -> FractionalLit #

rationalFromFractionalLit :: FractionalLit -> Rational #

mkTHFractionalLit :: Rational -> FractionalLit #

negateFractionalLit :: FractionalLit -> FractionalLit #

integralFractionalLit :: Bool -> Integer -> FractionalLit #

The integer should already be negated if it's negative.

mkSourceFractionalLit :: String -> Bool -> Integer -> Integer -> FractionalExponentBase -> FractionalLit #

The arguments should already be negated if they are negative.

defaultFixity :: Fixity #

pprWithDocString :: HsDocString -> SDoc -> SDoc #

Annotate a pretty printed thing with its doc The docstring comes after if is HsDocStringPrevious Otherwise it comes before. Note - we convert MultiLineDocString HsDocStringPrevious to HsDocStringNext because we can't control if something else will be pretty printed on the same line

mkHsDocStringChunk :: String -> HsDocStringChunk #

mkHsDocStringChunkUtf8ByteString :: ByteString -> HsDocStringChunk #

Create a HsDocString from a UTF8-encoded ByteString.

unpackHDSC :: HsDocStringChunk -> String #

mkGeneratedHsDocString :: String -> HsDocString #

isEmptyDocString :: HsDocString -> Bool #

docStringChunks :: HsDocString -> [LHsDocStringChunk] #

pprHsDocString :: HsDocString -> SDoc #

Pretty print with decorators, exactly as the user wrote it

pprHsDocStrings :: [HsDocString] -> SDoc #

exactPrintHsDocString :: HsDocString -> String #

Pretty print with decorators, exactly as the user wrote it

renderHsDocString :: HsDocString -> String #

Just get the docstring, without any decorators

renderHsDocStrings :: [HsDocString] -> String #

Just get the docstring, without any decorators Separates docstrings using "nn", which is how haddock likes to render them

emptyUniqMap :: UniqMap k a #

isNullUniqMap :: UniqMap k a -> Bool #

unitUniqMap :: Uniquable k => k -> a -> UniqMap k a #

listToUniqMap :: Uniquable k => [(k, a)] -> UniqMap k a #

listToUniqMap_C :: Uniquable k => (a -> a -> a) -> [(k, a)] -> UniqMap k a #

addToUniqMap :: Uniquable k => UniqMap k a -> k -> a -> UniqMap k a #

addListToUniqMap :: Uniquable k => UniqMap k a -> [(k, a)] -> UniqMap k a #

addToUniqMap_C :: Uniquable k => (a -> a -> a) -> UniqMap k a -> k -> a -> UniqMap k a #

addToUniqMap_Acc :: Uniquable k => (b -> a -> a) -> (b -> a) -> UniqMap k a -> k -> b -> UniqMap k a #

addToUniqMap_L :: Uniquable k => (k -> a -> a -> a) -> k -> a -> UniqMap k a -> (Maybe a, UniqMap k a) #

Add an element, returns previous lookup result and new map. If old element doesn't exist, add the passed element directly, otherwise compute the element to add using the passed function.

alterUniqMap :: Uniquable k => (Maybe a -> Maybe a) -> UniqMap k a -> k -> UniqMap k a #

addListToUniqMap_C :: Uniquable k => (a -> a -> a) -> UniqMap k a -> [(k, a)] -> UniqMap k a #

adjustUniqMap :: Uniquable k => (a -> a) -> UniqMap k a -> k -> UniqMap k a #

delFromUniqMap :: Uniquable k => UniqMap k a -> k -> UniqMap k a #

delListFromUniqMap :: Uniquable k => UniqMap k a -> [k] -> UniqMap k a #

plusUniqMap :: UniqMap k a -> UniqMap k a -> UniqMap k a #

plusUniqMap_C :: (a -> a -> a) -> UniqMap k a -> UniqMap k a -> UniqMap k a #

plusMaybeUniqMap_C :: (a -> a -> Maybe a) -> UniqMap k a -> UniqMap k a -> UniqMap k a #

plusUniqMapList :: [UniqMap k a] -> UniqMap k a #

minusUniqMap :: UniqMap k a -> UniqMap k b -> UniqMap k a #

intersectUniqMap :: UniqMap k a -> UniqMap k b -> UniqMap k a #

intersectUniqMap_C :: (a -> b -> c) -> UniqMap k a -> UniqMap k b -> UniqMap k c #

Intersection with a combining function.

disjointUniqMap :: UniqMap k a -> UniqMap k b -> Bool #

mapUniqMap :: (a -> b) -> UniqMap k a -> UniqMap k b #

filterUniqMap :: (a -> Bool) -> UniqMap k a -> UniqMap k a #

partitionUniqMap :: (a -> Bool) -> UniqMap k a -> (UniqMap k a, UniqMap k a) #

sizeUniqMap :: UniqMap k a -> Int #

elemUniqMap :: Uniquable k => k -> UniqMap k a -> Bool #

lookupUniqMap :: Uniquable k => UniqMap k a -> k -> Maybe a #

lookupWithDefaultUniqMap :: Uniquable k => UniqMap k a -> a -> k -> a #

anyUniqMap :: (a -> Bool) -> UniqMap k a -> Bool #

allUniqMap :: (a -> Bool) -> UniqMap k a -> Bool #

nonDetEltsUniqMap :: UniqMap k a -> [(k, a)] #

nonDetFoldUniqMap :: ((k, a) -> b -> b) -> b -> UniqMap k a -> b #

unitIdFS :: UnitId -> FastString #

The full hashed unit identifier, including the component id and the hash.

mkModule :: u -> ModuleName -> GenModule u #

pprModule :: IsLine doc => Module -> doc #

pprInstantiatedModule :: InstantiatedModule -> SDoc #

isHoleUnit :: GenUnit u -> Bool #

stableUnitCmp :: Unit -> Unit -> Ordering #

Compares unit ids lexically, rather than by their Uniques

pprUnit :: IsLine doc => Unit -> doc #

unitFreeModuleHoles :: GenUnit u -> UniqDSet ModuleName #

Retrieve the set of free module holes of a Unit.

moduleFreeHoles :: GenModule (GenUnit u) -> UniqDSet ModuleName #

Calculate the free holes of a GenModule. If this set is non-empty, this module was defined in an indefinite library that had required signatures.

If a module has free holes, that means that substitutions can operate on it; if it has no free holes, substituting over a module has no effect.

mkInstantiatedUnit :: IsUnitId u => u -> GenInstantiations u -> GenInstantiatedUnit u #

Create a new GenInstantiatedUnit given an explicit module substitution.

mkVirtUnit :: IsUnitId u => u -> [(ModuleName, GenModule (GenUnit u))] -> GenUnit u #

Smart constructor for instantiated GenUnit

mkInstantiatedUnitHash :: IsUnitId u => u -> [(ModuleName, GenModule (GenUnit u))] -> FastString #

Generate a uniquely identifying hash (internal unit-id) for an instantiated unit.

This is a one-way function. If the indefinite unit has not been instantiated at all, we return its unit-id.

This hash is completely internal to GHC and is not used for symbol names or file paths. It is different from the hash Cabal would produce for the same instantiated unit.

fsToUnit :: FastString -> Unit #

Create a new simple unit identifier from a FastString. Internally, this is primarily used to specify wired-in unit identifiers.

unitString :: IsUnitId u => u -> String #

stringToUnit :: String -> Unit #

mapGenUnit :: IsUnitId v => (u -> v) -> GenUnit u -> GenUnit v #

Map over the unit type of a GenUnit

mapInstantiations :: IsUnitId v => (u -> v) -> GenInstantiations u -> GenInstantiations v #

Map over the unit identifier of unit instantiations.

virtualUnitId :: InstantiatedUnit -> UnitId #

Return the virtual UnitId of an on-the-fly instantiated unit.

unitIsDefinite :: Unit -> Bool #

A Unit is definite if it has no free holes.

unitIdString :: UnitId -> String #

stringToUnitId :: String -> UnitId #

primUnitId :: UnitId #

bignumUnitId :: UnitId #

baseUnitId :: UnitId #

rtsUnitId :: UnitId #

thisGhcUnitId :: UnitId #

interactiveUnitId :: UnitId #

thUnitId :: UnitId #

thUnit :: Unit #

primUnit :: Unit #

bignumUnit :: Unit #

baseUnit :: Unit #

rtsUnit :: Unit #

thisGhcUnit :: Unit #

interactiveUnit :: Unit #

mainUnitId :: UnitId #

This is the package Id for the current program. It is the default package Id if you don't specify a package name. We don't add this prefix to symbol names, since there can be only one main package per program.

mainUnit :: Unit #

isInteractiveModule :: Module -> Bool #

wiredInUnitIds :: [UnitId] #

addBootSuffix :: FilePath -> FilePath #

Add the -boot suffix to .hs, .hi and .o files

removeBootSuffix :: FilePath -> FilePath #

Remove the -boot suffix to .hs, .hi and .o files

addBootSuffix_maybe :: IsBootInterface -> FilePath -> FilePath #

Add the -boot suffix if the Bool argument is True

addBootSuffixLocn_maybe :: IsBootInterface -> ModLocation -> ModLocation #

addBootSuffixLocn :: ModLocation -> ModLocation #

Add the -boot suffix to all file paths associated with the module

addBootSuffixLocnOut :: ModLocation -> ModLocation #

Add the -boot suffix to all output file paths associated with the module, not including the input file itself

filterModuleEnv :: (Module -> a -> Bool) -> ModuleEnv a -> ModuleEnv a #

mapMaybeModuleEnv :: (Module -> a -> Maybe b) -> ModuleEnv a -> ModuleEnv b #

elemModuleEnv :: Module -> ModuleEnv a -> Bool #

extendModuleEnv :: ModuleEnv a -> Module -> a -> ModuleEnv a #

extendModuleEnvWith :: (a -> a -> a) -> ModuleEnv a -> Module -> a -> ModuleEnv a #

extendModuleEnvList :: ModuleEnv a -> [(Module, a)] -> ModuleEnv a #

extendModuleEnvList_C :: (a -> a -> a) -> ModuleEnv a -> [(Module, a)] -> ModuleEnv a #

plusModuleEnv_C :: (a -> a -> a) -> ModuleEnv a -> ModuleEnv a -> ModuleEnv a #

delModuleEnvList :: ModuleEnv a -> [Module] -> ModuleEnv a #

delModuleEnv :: ModuleEnv a -> Module -> ModuleEnv a #

plusModuleEnv :: ModuleEnv a -> ModuleEnv a -> ModuleEnv a #

lookupModuleEnv :: ModuleEnv a -> Module -> Maybe a #

lookupWithDefaultModuleEnv :: ModuleEnv a -> a -> Module -> a #

mapModuleEnv :: (a -> b) -> ModuleEnv a -> ModuleEnv b #

partitionModuleEnv :: (a -> Bool) -> ModuleEnv a -> (ModuleEnv a, ModuleEnv a) #

mkModuleEnv :: [(Module, a)] -> ModuleEnv a #

emptyModuleEnv :: ModuleEnv a #

moduleEnvKeys :: ModuleEnv a -> [Module] #

moduleEnvElts :: ModuleEnv a -> [a] #

moduleEnvToList :: ModuleEnv a -> [(Module, a)] #

unitModuleEnv :: Module -> a -> ModuleEnv a #

isEmptyModuleEnv :: ModuleEnv a -> Bool #

mkModuleSet :: [Module] -> ModuleSet #

extendModuleSet :: ModuleSet -> Module -> ModuleSet #

extendModuleSetList :: ModuleSet -> [Module] -> ModuleSet #

emptyModuleSet :: ModuleSet #

isEmptyModuleSet :: ModuleSet -> Bool #

moduleSetElts :: ModuleSet -> [Module] #

elemModuleSet :: Module -> ModuleSet -> Bool #

intersectModuleSet :: ModuleSet -> ModuleSet -> ModuleSet #

minusModuleSet :: ModuleSet -> ModuleSet -> ModuleSet #

delModuleSet :: ModuleSet -> Module -> ModuleSet #

unionModuleSet :: ModuleSet -> ModuleSet -> ModuleSet #

unionManyModuleSets :: [ModuleSet] -> ModuleSet #

unitModuleSet :: Module -> ModuleSet #

emptyInstalledModuleEnv :: InstalledModuleEnv a #

lookupInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> Maybe a #

extendInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> a -> InstalledModuleEnv a #

filterInstalledModuleEnv :: (InstalledModule -> a -> Bool) -> InstalledModuleEnv a -> InstalledModuleEnv a #

delInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> InstalledModuleEnv a #

installedModuleEnvElts :: InstalledModuleEnv a -> [(InstalledModule, a)] #

mergeInstalledModuleEnv :: (elta -> eltb -> Maybe eltc) -> (InstalledModuleEnv elta -> InstalledModuleEnv eltc) -> (InstalledModuleEnv eltb -> InstalledModuleEnv eltc) -> InstalledModuleEnv elta -> InstalledModuleEnv eltb -> InstalledModuleEnv eltc #

plusInstalledModuleEnv :: (elt -> elt -> elt) -> InstalledModuleEnv elt -> InstalledModuleEnv elt -> InstalledModuleEnv elt #

moduleIsDefinite :: Module -> Bool #

A GenModule is definite if it has no free holes.

moduleStableString :: Module -> String #

Get a string representation of a GenModule that's unique and stable across recompilations. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal"

stableModuleCmp :: Module -> Module -> Ordering #

This gives a stable ordering, as opposed to the Ord instance which gives an ordering based on the Uniques of the components, which may not be stable from run to run of the compiler.

installedModuleEq :: InstalledModule -> Module -> Bool #

Test if a GenModule corresponds to a given InstalledModule, modulo instantiation.

getModuleInstantiation :: Module -> (InstalledModule, Maybe InstantiatedModule) #

Given a possibly on-the-fly instantiated module, split it into a GenModule that we definitely can find on-disk, as well as an instantiation if we need to instantiate it on the fly. If the instantiation is Nothing no on-the-fly renaming is needed.

getUnitInstantiations :: Unit -> (UnitId, Maybe InstantiatedUnit) #

Return the unit-id this unit is an instance of and the module instantiations (if any).

uninstantiateInstantiatedUnit :: InstantiatedUnit -> InstantiatedUnit #

Remove instantiations of the given instantiated unit

uninstantiateInstantiatedModule :: InstantiatedModule -> InstantiatedModule #

Remove instantiations of the given module instantiated unit

isHoleModule :: GenModule (GenUnit u) -> Bool #

Test if a Module is not instantiated

mkHoleModule :: ModuleName -> GenModule (GenUnit u) #

Create a hole Module

emptyKnotVars :: KnotVars a #

knotVarsFromModuleEnv :: ModuleEnv a -> KnotVars a #

knotVarElems :: KnotVars a -> [a] #

lookupKnotVars :: KnotVars a -> Module -> Maybe a #

knotVarsWithout :: Module -> KnotVars a -> KnotVars a #

isPromoted :: PromotionFlag -> Bool #

pickLR :: LeftOrRight -> (a, a) -> a #

fIRST_TAG :: ConTag #

Tags are allocated from here for real constructors or for superclass selectors

mkAlignment :: Int -> Alignment #

alignmentOf :: Int -> Alignment #

noOneShotInfo :: OneShotInfo #

It is always safe to assume that an Id has no lambda-bound variable information

isOneShotInfo :: OneShotInfo -> Bool #

hasNoOneShotInfo :: OneShotInfo -> Bool #

worstOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo #

bestOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo #

flipSwap :: SwapFlag -> SwapFlag #

isSwapped :: SwapFlag -> Bool #

unSwap :: SwapFlag -> (a -> a -> b) -> a -> a -> b #

pprRuleName :: RuleName -> SDoc #

isNotTopLevel :: TopLevelFlag -> Bool #

isTopLevel :: TopLevelFlag -> Bool #

isMarkedCbv :: CbvMark -> Bool #

isRec :: RecFlag -> Bool #

isNonRec :: RecFlag -> Bool #

boolToRecFlag :: Bool -> RecFlag #

isGenerated :: Origin -> Bool #

setOverlapModeMaybe :: OverlapFlag -> Maybe OverlapMode -> OverlapFlag #

hasIncoherentFlag :: OverlapMode -> Bool #

hasOverlappableFlag :: OverlapMode -> Bool #

hasOverlappingFlag :: OverlapMode -> Bool #

topPrec :: PprPrec #

sigPrec :: PprPrec #

funPrec :: PprPrec #

opPrec :: PprPrec #

starPrec :: PprPrec #

maxPrec :: PprPrec #

maybeParen :: PprPrec -> PprPrec -> SDoc -> SDoc #

tupleSortBoxity :: TupleSort -> Boxity #

boxityTupleSort :: Boxity -> TupleSort #

tupleParens :: TupleSort -> SDoc -> SDoc #

sumParens :: SDoc -> SDoc #

pprAlternative #

Arguments

:: (a -> SDoc)	The pretty printing function to use
-> a	The things to be pretty printed
-> ConTag	Alternative (one-based)
-> Arity	Arity
-> SDoc	`SDoc` where the alternative havs been pretty printed and finally packed into a paragraph.

Pretty print an alternative in an unboxed sum e.g. "| a | |".

unboxedTupleOrSumExtension :: UnboxedTupleOrSum -> Extension #

oneBranch :: BranchCount #

noOccInfo :: OccInfo #

isNoOccInfo :: OccInfo -> Bool #

isManyOccs :: OccInfo -> Bool #

seqOccInfo :: OccInfo -> () #

tailCallInfo :: OccInfo -> TailCallInfo #

zapOccTailCallInfo :: OccInfo -> OccInfo #

isAlwaysTailCalled :: OccInfo -> Bool #

strongLoopBreaker :: OccInfo #

weakLoopBreaker :: OccInfo #

isWeakLoopBreaker :: OccInfo -> Bool #

isStrongLoopBreaker :: OccInfo -> Bool #

isDeadOcc :: OccInfo -> Bool #

isOneOcc :: OccInfo -> Bool #

zapFragileOcc :: OccInfo -> OccInfo #

successIf :: Bool -> SuccessFlag #

beginPhase :: Activation -> CompilerPhase #

activeAfter :: CompilerPhase -> Activation #

nextPhase :: CompilerPhase -> CompilerPhase #

laterPhase :: CompilerPhase -> CompilerPhase -> CompilerPhase #

activateAfterInitial :: Activation #

activateDuringFinal :: Activation #

isActive :: CompilerPhase -> Activation -> Bool #

activeInFinalPhase :: Activation -> Bool #

isNeverActive :: Activation -> Bool #

isAlwaysActive :: Activation -> Bool #

competesWith :: Activation -> Activation -> Bool #

isConLike :: RuleMatchInfo -> Bool #

isFunLike :: RuleMatchInfo -> Bool #

noUserInlineSpec :: InlineSpec -> Bool #

defaultInlinePragma :: InlinePragma #

alwaysInlinePragma :: InlinePragma #

neverInlinePragma :: InlinePragma #

alwaysInlineConLikePragma :: InlinePragma #

inlinePragmaSpec :: InlinePragma -> InlineSpec #

inlinePragmaSource :: InlinePragma -> SourceText #

inlineSpecSource :: InlineSpec -> SourceText #

dfunInlinePragma :: InlinePragma #

isDefaultInlinePragma :: InlinePragma -> Bool #

isInlinePragma :: InlinePragma -> Bool #

isInlinablePragma :: InlinePragma -> Bool #

isNoInlinePragma :: InlinePragma -> Bool #

isAnyInlinePragma :: InlinePragma -> Bool #

isOpaquePragma :: InlinePragma -> Bool #

inlinePragmaSat :: InlinePragma -> Maybe Arity #

inlinePragmaActivation :: InlinePragma -> Activation #

inlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo #

setInlinePragmaActivation :: InlinePragma -> Activation -> InlinePragma #

setInlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo -> InlinePragma #

inlinePragmaName :: InlineSpec -> SDoc #

Outputs string for pragma name for any of INLINEINLINABLENOINLINE. This differs from the Outputable instance for the InlineSpec type where the pragma name string as well as the accompanying SourceText (if any) is printed.

pprInline :: InlinePragma -> SDoc #

Pretty-print without displaying the user-specified InlineSpec.

pprInlineDebug :: InlinePragma -> SDoc #

Pretty-print including the user-specified InlineSpec.

isStableUserSource :: UnfoldingSource -> Bool #

isStableSystemSource :: UnfoldingSource -> Bool #

isCompulsorySource :: UnfoldingSource -> Bool #

isStableSource :: UnfoldingSource -> Bool #

intGtLimit :: Int -> IntWithInf -> Bool #

subWithInf :: IntWithInf -> Int -> IntWithInf #

Subtract an IntWithInf from an IntWithInf

treatZeroAsInf :: Int -> IntWithInf #

Turn a positive number into an IntWithInf, where 0 represents infinity

mkIntWithInf :: Int -> IntWithInf #

Inject any integer into an IntWithInf

isTypeLevel :: TypeOrKind -> Bool #

isKindLevel :: TypeOrKind -> Bool #

mightBeLifted :: Maybe Levity -> Bool #

mightBeUnlifted :: Maybe Levity -> Bool #

defaultNonStandardTyVars :: DefaultingStrategy -> Bool #

promoteDataCon :: DataCon -> TyCon #

dataConWrapId :: DataCon -> Id #

Returns an Id which looks like the Haskell-source constructor by using the wrapper if it exists (see dataConWrapId_maybe) and failing over to the worker (see dataConWorkId)

isTypeDataCon :: DataCon -> Bool #

Is this data constructor in a "type data" declaration? See Note [Type data declarations] in GHC.Rename.Module.

isUnboxedSumDataCon :: DataCon -> Bool #

dataConFullSig :: DataCon -> ([TyVar], [TyCoVar], [EqSpec], ThetaType, [Scaled Type], Type) #

The "full signature" of the DataCon returns, in order:

1) The result of dataConUnivTyVars

2) The result of dataConExTyCoVars

3) The non-dependent GADT equalities. Dependent GADT equalities are implied by coercion variables in return value (2).

4) The other constraints of the data constructor type, excluding GADT equalities

5) The original argument types to the DataCon (i.e. before any change of the representation of the type) with linearity annotations

6) The original result type of the DataCon

dataConStupidTheta :: DataCon -> ThetaType #

The "stupid theta" of the DataCon, such as data Eq a in:

data Eq a => T a = ...

See Note [The stupid context].

dataConInstOrigArgTys :: DataCon -> [Type] -> [Scaled Type] #

Returns just the instantiated value argument types of a DataCon, (excluding dictionary args)

dataConFieldLabels :: DataCon -> [FieldLabel] #

The labels for the fields of this particular DataCon

dataConSourceArity :: DataCon -> Arity #

Source-level arity of the data constructor

dataConUserTyVarBinders :: DataCon -> [InvisTVBinder] #

InvisTVBinders for the type variables of the constructor, in the order the user wrote them

dataConUserTyVars :: DataCon -> [TyVar] #

The type variables of the constructor, in the order the user wrote them

dataConExTyCoVars :: DataCon -> [TyCoVar] #

The existentially-quantified type/coercion variables of the constructor including dependent (kind-) GADT equalities

dataConTyCon :: DataCon -> TyCon #

The type constructor that we are building via this data constructor

dataConWorkId :: DataCon -> Id #

Get the Id of the DataCon worker: a function that is the "actual" constructor and has no top level binding in the program. The type may be different from the obvious one written in the source program. Panics if there is no such Id for this DataCon

dataConName :: DataCon -> Name #

The Name of the DataCon, giving it a unique, rooted identification

sumTyCon :: Arity -> TyCon #

Type constructor for n-ary unboxed sum.

sumDataCon :: ConTag -> Arity -> DataCon #

Data constructor for i-th alternative of a n-ary unboxed sum.

cTupleSelIdName :: ConTag -> Arity -> Name #

cTupleTyConName :: Arity -> Name #

cTupleDataConName :: Arity -> Name #

cTupleDataCon :: Arity -> DataCon #

tupleTyCon :: Boxity -> Arity -> TyCon #

tupleDataCon :: Boxity -> Arity -> DataCon #

promotedTupleDataCon :: Boxity -> Arity -> TyCon #

integerTy :: Type #

naturalTy :: Type #

tupleDataConName :: Boxity -> Arity -> Name #

tupleTyConName :: TupleSort -> Arity -> Name #

multMulTyCon :: TyCon #

unrestrictedFunTyCon :: TyCon #

manyDataConTyCon :: TyCon #

manyDataConTy :: Type #

oneDataConTyCon :: TyCon #

oneDataConTy :: Type #

multiplicityTy :: Type #

multiplicityTyCon :: TyCon #

unboxedTupleKind :: [Type] -> Kind #

Specialization of unboxedTupleSumKind for tuples

anyTypeOfKind :: Kind -> Type #

int8ElemRepDataConTy :: Type #

int16ElemRepDataConTy :: Type #

int32ElemRepDataConTy :: Type #

int64ElemRepDataConTy :: Type #

word8ElemRepDataConTy :: Type #

word16ElemRepDataConTy :: Type #

word32ElemRepDataConTy :: Type #

word64ElemRepDataConTy :: Type #

floatElemRepDataConTy :: Type #

doubleElemRepDataConTy :: Type #

vec2DataConTy :: Type #

vec4DataConTy :: Type #

vec8DataConTy :: Type #

vec16DataConTy :: Type #

vec32DataConTy :: Type #

vec64DataConTy :: Type #

intRepDataConTy :: RuntimeRepType #

int8RepDataConTy :: RuntimeRepType #

int16RepDataConTy :: RuntimeRepType #

int32RepDataConTy :: RuntimeRepType #

int64RepDataConTy :: RuntimeRepType #

wordRepDataConTy :: RuntimeRepType #

word8RepDataConTy :: RuntimeRepType #

word16RepDataConTy :: RuntimeRepType #

word32RepDataConTy :: RuntimeRepType #

word64RepDataConTy :: RuntimeRepType #

addrRepDataConTy :: RuntimeRepType #

floatRepDataConTy :: RuntimeRepType #

doubleRepDataConTy :: RuntimeRepType #

liftedDataConTy :: Type #

unliftedDataConTy :: Type #

liftedRepTy :: RuntimeRepType #

unliftedRepTy :: RuntimeRepType #

zeroBitRepTy :: RuntimeRepType #

vecRepDataConTyCon :: TyCon #

tupleRepDataConTyCon :: TyCon #

boxedRepDataConTyCon :: TyCon #

liftedDataConTyCon :: TyCon #

runtimeRepTy :: Type #

levityTy :: Type #

runtimeRepTyCon :: TyCon #

levityTyCon :: TyCon #

vecCountTyCon :: TyCon #

vecElemTyCon :: TyCon #

constraintKind :: Kind #

liftedRepTyCon :: TyCon #

type LiftedRep = 'BoxedRep 'Lifted

unliftedRepTyCon :: TyCon #

type UnliftedRep = 'BoxedRep 'Unlifted

liftedTypeKindTyCon :: TyCon #

unliftedTypeKindTyCon :: TyCon #

liftedTypeKind :: Type #

unliftedTypeKind :: Type #

zeroBitTypeKind :: Type #

constraintKindTyConName :: Name #

liftedTypeKindTyConName :: Name #

unitTy :: Type #

coercibleTyCon :: TyCon #

heqTyCon :: TyCon #

mkBoxedTupleTy :: [Type] -> Type #

Build the type of a small tuple that holds the specified type of thing Flattens 1-tuples. See Note [One-tuples].

charTy :: Type #

typeSymbolKind :: Kind #

listTyCon :: TyCon #

tcName :: NameSpace #

clsName :: NameSpace #

tcClsName :: NameSpace #

dataName :: NameSpace #

srcDataName :: NameSpace #

tvName :: NameSpace #

isDataConNameSpace :: NameSpace -> Bool #

isTcClsNameSpace :: NameSpace -> Bool #

isTvNameSpace :: NameSpace -> Bool #

isVarNameSpace :: NameSpace -> Bool #

isValNameSpace :: NameSpace -> Bool #

pprNameSpace :: NameSpace -> SDoc #

pprNonVarNameSpace :: NameSpace -> SDoc #

pprNameSpaceBrief :: IsLine doc => NameSpace -> doc #

pprOccName :: IsLine doc => OccName -> doc #

mkOccName :: NameSpace -> String -> OccName #

mkOccNameFS :: NameSpace -> FastString -> OccName #

mkVarOcc :: String -> OccName #

mkDataOcc :: String -> OccName #

mkDataOccFS :: FastString -> OccName #

mkTyVarOcc :: String -> OccName #

mkTyVarOccFS :: FastString -> OccName #

mkTcOcc :: String -> OccName #

mkTcOccFS :: FastString -> OccName #

mkClsOcc :: String -> OccName #

mkClsOccFS :: FastString -> OccName #

demoteOccName :: OccName -> Maybe OccName #

promoteOccName :: OccName -> Maybe OccName #

emptyOccEnv :: OccEnv a #

unitOccEnv :: OccName -> a -> OccEnv a #

extendOccEnv :: OccEnv a -> OccName -> a -> OccEnv a #

extendOccEnvList :: OccEnv a -> [(OccName, a)] -> OccEnv a #

lookupOccEnv :: OccEnv a -> OccName -> Maybe a #

mkOccEnv :: [(OccName, a)] -> OccEnv a #

elemOccEnv :: OccName -> OccEnv a -> Bool #

foldOccEnv :: (a -> b -> b) -> b -> OccEnv a -> b #

nonDetOccEnvElts :: OccEnv a -> [a] #

plusOccEnv :: OccEnv a -> OccEnv a -> OccEnv a #

plusOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccEnv a -> OccEnv a #

extendOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccName -> a -> OccEnv a #

extendOccEnv_Acc :: (a -> b -> b) -> (a -> b) -> OccEnv b -> OccName -> a -> OccEnv b #

mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b #

mkOccEnv_C :: (a -> a -> a) -> [(OccName, a)] -> OccEnv a #

delFromOccEnv :: OccEnv a -> OccName -> OccEnv a #

delListFromOccEnv :: OccEnv a -> [OccName] -> OccEnv a #

filterOccEnv :: (elt -> Bool) -> OccEnv elt -> OccEnv elt #

alterOccEnv :: (Maybe elt -> Maybe elt) -> OccEnv elt -> OccName -> OccEnv elt #

minusOccEnv :: OccEnv a -> OccEnv b -> OccEnv a #

minusOccEnv_C :: (a -> b -> Maybe a) -> OccEnv a -> OccEnv b -> OccEnv a #

Alters (replaces or removes) those elements of the map that are mentioned in the second map

pprOccEnv :: (a -> SDoc) -> OccEnv a -> SDoc #

emptyOccSet :: OccSet #

unitOccSet :: OccName -> OccSet #

mkOccSet :: [OccName] -> OccSet #

extendOccSet :: OccSet -> OccName -> OccSet #

extendOccSetList :: OccSet -> [OccName] -> OccSet #

unionOccSets :: OccSet -> OccSet -> OccSet #

unionManyOccSets :: [OccSet] -> OccSet #

minusOccSet :: OccSet -> OccSet -> OccSet #

elemOccSet :: OccName -> OccSet -> Bool #

isEmptyOccSet :: OccSet -> Bool #

intersectOccSet :: OccSet -> OccSet -> OccSet #

filterOccSet :: (OccName -> Bool) -> OccSet -> OccSet #

occSetToEnv :: OccSet -> OccEnv OccName #

Converts an OccSet to an OccEnv (operationally the identity)

occNameString :: OccName -> String #

setOccNameSpace :: NameSpace -> OccName -> OccName #

isVarOcc :: OccName -> Bool #

isTvOcc :: OccName -> Bool #

isTcOcc :: OccName -> Bool #

isValOcc :: OccName -> Bool #

Value OccNamess are those that are either in the variable or data constructor namespaces

isDataOcc :: OccName -> Bool #

isDataSymOcc :: OccName -> Bool #

Test if the OccName is a data constructor that starts with a symbol (e.g. :, or [])

isSymOcc :: OccName -> Bool #

Test if the OccName is that for any operator (whether it is a data constructor or variable or whatever)

parenSymOcc :: OccName -> SDoc -> SDoc #

Wrap parens around an operator

startsWithUnderscore :: OccName -> Bool #

Haskell 98 encourages compilers to suppress warnings about unused names in a pattern if they start with _: this implements that test

isDerivedOccName :: OccName -> Bool #

Test for definitions internally generated by GHC. This predicate is used to suppress printing of internal definitions in some debug prints

isDefaultMethodOcc :: OccName -> Bool #

isTypeableBindOcc :: OccName -> Bool #

Is an OccName one of a Typeable TyCon or Module binding? This is needed as these bindings are renamed differently. See Note [Grand plan for Typeable] in GHC.Tc.Instance.Typeable.

mkDataConWrapperOcc :: OccName -> OccName #

mkWorkerOcc :: OccName -> OccName #

mkMatcherOcc :: OccName -> OccName #

mkBuilderOcc :: OccName -> OccName #

mkDefaultMethodOcc :: OccName -> OccName #

mkClassOpAuxOcc :: OccName -> OccName #

mkDictOcc :: OccName -> OccName #

mkIPOcc :: OccName -> OccName #

mkSpecOcc :: OccName -> OccName #

mkForeignExportOcc :: OccName -> OccName #

mkRepEqOcc :: OccName -> OccName #

mkClassDataConOcc :: OccName -> OccName #

mkNewTyCoOcc :: OccName -> OccName #

mkInstTyCoOcc :: OccName -> OccName #

mkEqPredCoOcc :: OccName -> OccName #

mkCon2TagOcc :: OccName -> OccName #

mkTag2ConOcc :: OccName -> OccName #

mkMaxTagOcc :: OccName -> OccName #

mkDataTOcc :: OccName -> OccName #

mkDataCOcc :: OccName -> OccName #

mkTyConRepOcc :: OccName -> OccName #

mkGenR :: OccName -> OccName #

mkGen1R :: OccName -> OccName #

mkDataConWorkerOcc :: OccName -> OccName #

mkSuperDictAuxOcc :: Int -> OccName -> OccName #

mkSuperDictSelOcc #

Arguments

:: Int	Index of superclass, e.g. 3
-> OccName	Class, e.g. `Ord`
-> OccName	Derived `Occname`, e.g. `$p3Ord`

mkLocalOcc #

Arguments

:: Unique	Unique to combine with the `OccName`
-> OccName	Local name, e.g. `sat`
-> OccName	Nice unique version, e.g. `$L23sat`

mkInstTyTcOcc #

Arguments

:: String	Family name, e.g. `Map`
-> OccSet	avoid these Occs
-> OccName	R:Map

Derive a name for the representation type constructor of a data/newtype instance.

mkDFunOcc #

Arguments

:: String	Typically the class and type glommed together e.g. `OrdMaybe`. Only used in debug mode, for extra clarity
-> Bool	Is this a hs-boot instance DFun?
-> OccSet	avoid these Occs
-> OccName	E.g. `$f3OrdMaybe`

mkMethodOcc :: OccName -> OccName #

emptyTidyOccEnv :: TidyOccEnv #

initTidyOccEnv :: [OccName] -> TidyOccEnv #

delTidyOccEnvList :: TidyOccEnv -> [FastString] -> TidyOccEnv #

avoidClashesOccEnv :: TidyOccEnv -> [OccName] -> TidyOccEnv #

tidyOccName :: TidyOccEnv -> OccName -> (TidyOccEnv, OccName) #

nameNameSpace :: Name -> NameSpace #

nameSrcLoc :: Name -> SrcLoc #

nameSrcSpan :: Name -> SrcSpan #

isWiredInName :: Name -> Bool #

isWiredIn :: NamedThing thing => thing -> Bool #

wiredInNameTyThing_maybe :: Name -> Maybe TyThing #

isBuiltInSyntax :: Name -> Bool #

isExternalName :: Name -> Bool #

isInternalName :: Name -> Bool #

isHoleName :: Name -> Bool #

isDynLinkName :: Platform -> Module -> Name -> Bool #

Will the Name come from a dynamically linked package?

nameModule :: HasDebugCallStack => Name -> Module #

nameModule_maybe :: Name -> Maybe Module #

namePun_maybe :: Name -> Maybe FastString #

nameIsLocalOrFrom :: Module -> Name -> Bool #

Returns True if the name is (a) Internal (b) External but from the specified module (c) External but from the interactive package

The key idea is that False means: the entity is defined in some other module you can find the details (type, fixity, instances) in some interface file those details will be stored in the EPT or HPT

True means: the entity is defined in this module or earlier in the GHCi session you can find details (type, fixity, instances) in the TcGblEnv or TcLclEnv

The isInteractiveModule part is because successive interactions of a GHCi session each give rise to a fresh module (Ghci1, Ghci2, etc), but they all come from the magic interactive package; and all the details are kept in the TcLclEnv, TcGblEnv, NOT in the HPT or EPT. See Note [The interactive package] in GHC.Runtime.Context

nameIsExternalOrFrom :: Module -> Name -> Bool #

Returns True if the name is external or from the interactive package See documentation of nameIsLocalOrFrom function

nameIsHomePackage :: Module -> Name -> Bool #

nameIsHomePackageImport :: Module -> Name -> Bool #

nameIsFromExternalPackage :: HomeUnit -> Name -> Bool #

Returns True if the Name comes from some other package: neither this package nor the interactive package.

isTyVarName :: Name -> Bool #

isTyConName :: Name -> Bool #

isDataConName :: Name -> Bool #

isValName :: Name -> Bool #

isVarName :: Name -> Bool #

isSystemName :: Name -> Bool #

mkInternalName :: Unique -> OccName -> SrcSpan -> Name #

Create a name which is (for now at least) local to the current module and hence does not need a GenModule to disambiguate it from other Names

mkClonedInternalName :: Unique -> Name -> Name #

mkDerivedInternalName :: (OccName -> OccName) -> Unique -> Name -> Name #

mkExternalName :: Unique -> Module -> OccName -> SrcSpan -> Name #

Create a name which definitely originates in the given module

mkWiredInName :: Module -> OccName -> Unique -> TyThing -> BuiltInSyntax -> Name #

Create a name which is actually defined by the compiler itself

mkSystemName :: Unique -> OccName -> Name #

Create a name brought into being by the compiler

mkSystemNameAt :: Unique -> OccName -> SrcSpan -> Name #

mkSystemVarName :: Unique -> FastString -> Name #

mkSysTvName :: Unique -> FastString -> Name #

mkFCallName :: Unique -> FastString -> Name #

Make a name for a foreign call

setNameLoc :: Name -> SrcSpan -> Name #

localiseName :: Name -> Name #

Make the Name into an internal name, regardless of what it was to begin with

stableNameCmp :: Name -> Name -> Ordering #

Compare Names lexicographically This only works for Names that originate in the source code or have been tidied.

pprName :: IsLine doc => Name -> doc #

pprFullName :: Module -> Name -> SDoc #

Print fully qualified name (with unit-id, module and unique)

pprTickyName :: Module -> Name -> SDoc #

Print a ticky ticky styled name

Module argument is the module to use for internal and system names. When printing the name in a ticky profile, the module name is included even for local things. However, ticky uses the format "x (M)" rather than "M.x". Hence, this function provides a separation from normal styling.

pprNameUnqualified :: Name -> SDoc #

Print the string of Name unqualifiedly directly.

pprModulePrefix :: IsLine doc => PprStyle -> Module -> OccName -> doc #

pprDefinedAt :: Name -> SDoc #

pprNameDefnLoc :: Name -> SDoc #

nameStableString :: Name -> String #

Get a string representation of a Name that's unique and stable across recompilations. Used for deterministic generation of binds for derived instances. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal$String"

getSrcLoc :: NamedThing a => a -> SrcLoc #

getSrcSpan :: NamedThing a => a -> SrcSpan #

getOccString :: NamedThing a => a -> String #

getOccFS :: NamedThing a => a -> FastString #

pprInfixName :: (Outputable a, NamedThing a) => a -> SDoc #

pprPrefixName :: NamedThing a => a -> SDoc #

setVarUnique :: Var -> Unique -> Var #

isVisibleForAllTyFlag :: ForAllTyFlag -> Bool #

Does this ForAllTyFlag classify an argument that is written in Haskell?

isInvisibleForAllTyFlag :: ForAllTyFlag -> Bool #

Does this ForAllTyFlag classify an argument that is not written in Haskell?

isVisibleFunArg :: FunTyFlag -> Bool Source #

tyVarSpecToBinders :: [VarBndr a Specificity] -> [VarBndr a ForAllTyFlag] #

binderVar :: VarBndr tv argf -> tv #

binderVars :: [VarBndr tv argf] -> [tv] #

binderFlag :: VarBndr tv argf -> argf #

binderFlags :: [VarBndr tv argf] -> [argf] #

binderType :: VarBndr TyCoVar argf -> Type #

mkForAllTyBinder :: vis -> TyCoVar -> VarBndr TyCoVar vis #

Make a named binder

mkTyVarBinder :: vis -> TyVar -> VarBndr TyVar vis #

Make a named binder var should be a type variable

mkForAllTyBinders :: vis -> [TyCoVar] -> [VarBndr TyCoVar vis] #

Make many named binders

mkTyVarBinders :: vis -> [TyVar] -> [VarBndr TyVar vis] #

Make many named binders Input vars should be type variables

isInvisiblePiTyBinder :: PiTyBinder -> Bool #

Does this binder bind an invisible argument?

isVisiblePiTyBinder :: PiTyBinder -> Bool #

Does this binder bind a visible argument?

isNamedPiTyBinder :: PiTyBinder -> Bool #

namedPiTyBinder_maybe :: PiTyBinder -> Maybe TyCoVar #

isAnonPiTyBinder :: PiTyBinder -> Bool #

Does this binder bind a variable that is not erased? Returns True for anonymous binders.

anonPiTyBinderType_maybe :: PiTyBinder -> Maybe Type #

Extract a relevant type, if there is one.

piTyBinderType :: PiTyBinder -> Type #

tyVarKind :: TyVar -> Kind #

setTyVarUnique :: TyVar -> Unique -> TyVar #

idInfo :: HasDebugCallStack => Id -> IdInfo #

idDetails :: Id -> IdDetails #

mkCoVar :: Name -> Type -> CoVar #

lazySetIdInfo :: Id -> IdInfo -> Id #

globaliseId :: Id -> Id #

If it's a local, make it global

setIdExported :: Id -> Id #

setIdNotExported :: Id -> Id #

updateIdTypeButNotMult :: (Type -> Type) -> Id -> Id #

updateIdTypeAndMult :: (Type -> Type) -> Id -> Id #

updateIdTypeAndMultM :: Monad m => (Type -> m Type) -> Id -> m Id #

setIdMult :: Id -> Mult -> Id #

isId :: Var -> Bool #

Is this a value-level (i.e., computationally relevant) Varentifier? Satisfies isId = not . isTyVar.

isCoVar :: Var -> Bool #

Is this a coercion variable? Satisfies isId v ==> isCoVar v == not (isNonCoVarId v).

isLocalId :: Var -> Bool #

isGlobalId :: Var -> Bool #

isExportedId :: Var -> Bool #

isExportedIdVar means "don't throw this away"

chooseFunTyFlag :: HasDebugCallStack => Type -> Type -> FunTyFlag #

See GHC.Types.Var Note [FunTyFlag]

partitionInvisibleTypes :: TyCon -> [Type] -> ([Type], [Type]) #

Given a TyCon and a list of argument types, partition the arguments into:

Inferred or Specified (i.e., invisible) arguments and
Required (i.e., visible) arguments

getLevity :: HasDebugCallStack => Type -> Type #

Extract the PromDataConInfo of a type. For example, getLevity Int = Lifted, or getLevity (Array# Int) = Unlifted.

Panics if this is not possible. Does not look through type family applications.

getTyVar_maybe :: Type -> Maybe TyVar #

Attempts to obtain the type variable underlying a Type

tyConAppTyCon_maybe :: Type -> Maybe TyCon #

The same as fst . splitTyConApp We can short-cut the FunTy case

splitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type]) #

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor

isLiftedTypeKind :: Kind -> Bool #

Returns True if the argument is (lifted) Type or Constraint See Note [TYPE and CONSTRAINT] in GHC.Builtin.Types.Prim

isMultiplicityTy :: Type -> Bool #

Is this the type Multiplicity?

isLevityTy :: Type -> Bool #

Is this the type PromDataConInfo?

isRuntimeRepTy :: Type -> Bool #

Is this the type RuntimeRep?

coreView :: Type -> Maybe Type #

This function strips off the top layer only of a type synonym application (if any) its underlying representation type. Returns Nothing if there is nothing to look through.

This function does not look through type family applications.

By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doing

typeTypeOrConstraint :: HasDebugCallStack => Type -> TypeOrConstraint #

typeKind :: HasDebugCallStack => Type -> Kind #

piResultTy :: HasDebugCallStack => Type -> Type -> Type #

mkCoercionTy :: Coercion -> Type #

mkTyConApp :: TyCon -> [Type] -> Type #

A key function: builds a TyConApp or FunTy as appropriate to its arguments. Applies its arguments to the constructor from left to right.

mkCastTy :: Type -> Coercion -> Type #

Make a CastTy. The Coercion must be nominal. Checks the Coercion for reflexivity, dropping it if it's reflexive. See Note [Respecting definitional equality] in GHC.Core.TyCo.Rep

mkAppTy :: Type -> Type -> Type #

Applies a type to another, as in e.g. k a

isCoercionTy :: Type -> Bool #

isPredTy :: HasDebugCallStack => Type -> Bool #

unitFV :: Name -> FreeVars #

delFV :: Name -> FreeVars -> FreeVars #

delFVs :: [Name] -> FreeVars -> FreeVars #

mkFVs :: [Name] -> FreeVars #

isEmptyNameSet :: NameSet -> Bool #

emptyNameSet :: NameSet #

unitNameSet :: Name -> NameSet #

mkNameSet :: [Name] -> NameSet #

extendNameSetList :: NameSet -> [Name] -> NameSet #

extendNameSet :: NameSet -> Name -> NameSet #

unionNameSet :: NameSet -> NameSet -> NameSet #

unionNameSets :: [NameSet] -> NameSet #

minusNameSet :: NameSet -> NameSet -> NameSet #

elemNameSet :: Name -> NameSet -> Bool #

delFromNameSet :: NameSet -> Name -> NameSet #

filterNameSet :: (Name -> Bool) -> NameSet -> NameSet #

intersectNameSet :: NameSet -> NameSet -> NameSet #

disjointNameSet :: NameSet -> NameSet -> Bool #

True if there is a non-empty intersection. s1 intersectsNameSet s2 doesn't compute s2 if s1 is empty

delListFromNameSet :: NameSet -> [Name] -> NameSet #

intersectsNameSet :: NameSet -> NameSet -> Bool #

nameSetAny :: (Name -> Bool) -> NameSet -> Bool #

nameSetAll :: (Name -> Bool) -> NameSet -> Bool #

nameSetElemsStable :: NameSet -> [Name] #

Get the elements of a NameSet with some stable ordering. This only works for Names that originate in the source code or have been tidied. See Note [Deterministic UniqFM] to learn about nondeterminism

isEmptyFVs :: NameSet -> Bool #

emptyFVs :: FreeVars #

plusFVs :: [FreeVars] -> FreeVars #

plusFV :: FreeVars -> FreeVars -> FreeVars #

addOneFV :: FreeVars -> Name -> FreeVars #

intersectFVs :: FreeVars -> FreeVars -> FreeVars #

emptyDUs :: DefUses #

usesOnly :: Uses -> DefUses #

mkDUs :: [(Defs, Uses)] -> DefUses #

plusDU :: DefUses -> DefUses -> DefUses #

duDefs :: DefUses -> Defs #

allUses :: DefUses -> Uses #

Just like duUses, but Defs are not eliminated from the Uses returned

duUses :: DefUses -> Uses #

Collect all Uses, regardless of whether the group is itself used, but remove Defs on the way

findUses :: DefUses -> Uses -> Uses #

Given some DefUses and some Uses, find all the uses, transitively. The result is a superset of the input Uses; and includes things defined in the input DefUses (but only if they are used)

depAnal :: (node -> [Name]) -> (node -> [Name]) -> [node] -> [SCC node] #

nonDetNameEnvElts :: NameEnv a -> [a] #

emptyNameEnv :: NameEnv a #

isEmptyNameEnv :: NameEnv a -> Bool #

unitNameEnv :: Name -> a -> NameEnv a #

extendNameEnv :: NameEnv a -> Name -> a -> NameEnv a #

extendNameEnvList :: NameEnv a -> [(Name, a)] -> NameEnv a #

lookupNameEnv :: NameEnv a -> Name -> Maybe a #

alterNameEnv :: (Maybe a -> Maybe a) -> NameEnv a -> Name -> NameEnv a #

mkNameEnv :: [(Name, a)] -> NameEnv a #

mkNameEnvWith :: (a -> Name) -> [a] -> NameEnv a #

elemNameEnv :: Name -> NameEnv a -> Bool #

plusNameEnv :: NameEnv a -> NameEnv a -> NameEnv a #

plusNameEnv_C :: (a -> a -> a) -> NameEnv a -> NameEnv a -> NameEnv a #

plusNameEnv_CD :: (a -> a -> a) -> NameEnv a -> a -> NameEnv a -> a -> NameEnv a #

plusNameEnv_CD2 :: (Maybe a -> Maybe a -> a) -> NameEnv a -> NameEnv a -> NameEnv a #

extendNameEnv_C :: (a -> a -> a) -> NameEnv a -> Name -> a -> NameEnv a #

mapNameEnv :: (elt1 -> elt2) -> NameEnv elt1 -> NameEnv elt2 #

extendNameEnv_Acc :: (a -> b -> b) -> (a -> b) -> NameEnv b -> Name -> a -> NameEnv b #

extendNameEnvList_C :: (a -> a -> a) -> NameEnv a -> [(Name, a)] -> NameEnv a #

delFromNameEnv :: NameEnv a -> Name -> NameEnv a #

delListFromNameEnv :: NameEnv a -> [Name] -> NameEnv a #

filterNameEnv :: (elt -> Bool) -> NameEnv elt -> NameEnv elt #

mapMaybeNameEnv :: (a -> Maybe b) -> NameEnv a -> NameEnv b #

anyNameEnv :: (elt -> Bool) -> NameEnv elt -> Bool #

disjointNameEnv :: NameEnv a -> NameEnv a -> Bool #

seqEltsNameEnv :: (elt -> ()) -> NameEnv elt -> () #

lookupNameEnv_NF :: NameEnv a -> Name -> a #

emptyDNameEnv :: DNameEnv a #

isEmptyDNameEnv :: DNameEnv a -> Bool #

lookupDNameEnv :: DNameEnv a -> Name -> Maybe a #

delFromDNameEnv :: DNameEnv a -> Name -> DNameEnv a #

filterDNameEnv :: (a -> Bool) -> DNameEnv a -> DNameEnv a #

mapDNameEnv :: (a -> b) -> DNameEnv a -> DNameEnv b #

adjustDNameEnv :: (a -> a) -> DNameEnv a -> Name -> DNameEnv a #

alterDNameEnv :: (Maybe a -> Maybe a) -> DNameEnv a -> Name -> DNameEnv a #

extendDNameEnv :: DNameEnv a -> Name -> a -> DNameEnv a #

extendDNameEnv_C :: (a -> a -> a) -> DNameEnv a -> Name -> a -> DNameEnv a #

eltsDNameEnv :: DNameEnv a -> [a] #

foldDNameEnv :: (a -> b -> b) -> b -> DNameEnv a -> b #

plusDNameEnv_C :: (elt -> elt -> elt) -> DNameEnv elt -> DNameEnv elt -> DNameEnv elt #

nonDetStrictFoldDNameEnv :: (a -> b -> b) -> b -> DNameEnv a -> b #

availsToNameSet :: [AvailInfo] -> NameSet #

availName :: AvailInfo -> Name #

Just the main name made available, i.e. not the available pieces of type or class brought into scope by the AvailInfo

availNames :: AvailInfo -> [Name] #

All names made available by the availability information (excluding overloaded selectors)

availNamesWithSelectors :: AvailInfo -> [Name] #

All names made available by the availability information (including overloaded selectors)

greNamePrintableName :: GreName -> Name #

A Name suitable for output to the user. For fields, the OccName will be the field label. See Note [GreNames] in GHC.Types.Name.Reader.

greNameSrcSpan :: GreName -> SrcSpan #

gre_name :: GlobalRdrElt -> Name Source #

gre_par :: GlobalRdrElt -> Parent Source #

gre_lcl :: GlobalRdrElt -> Bool Source #

gre_imp :: GlobalRdrElt -> [ImportSpec] Source #

rdrNameOcc :: RdrName -> OccName #

rdrNameSpace :: RdrName -> NameSpace #

demoteRdrName :: RdrName -> Maybe RdrName #

promoteRdrName :: RdrName -> Maybe RdrName #

mkRdrUnqual :: OccName -> RdrName #

mkRdrQual :: ModuleName -> OccName -> RdrName #

mkOrig :: Module -> OccName -> RdrName #

mkUnqual :: NameSpace -> FastString -> RdrName #

mkVarUnqual :: FastString -> RdrName #

mkQual :: NameSpace -> (FastString, FastString) -> RdrName #

Make a qualified RdrName in the given namespace and where the ModuleName and the OccName are taken from the first and second elements of the tuple respectively

getRdrName :: NamedThing thing => thing -> RdrName #

nameRdrName :: Name -> RdrName #

isRdrDataCon :: RdrName -> Bool #

isRdrTyVar :: RdrName -> Bool #

isRdrTc :: RdrName -> Bool #

isSrcRdrName :: RdrName -> Bool #

isUnqual :: RdrName -> Bool #

isQual :: RdrName -> Bool #

isQual_maybe :: RdrName -> Maybe (ModuleName, OccName) #

isOrig :: RdrName -> Bool #

isOrig_maybe :: RdrName -> Maybe (Module, OccName) #

isExact :: RdrName -> Bool #

isExact_maybe :: RdrName -> Maybe Name #

emptyLocalRdrEnv :: LocalRdrEnv #

extendLocalRdrEnv :: LocalRdrEnv -> Name -> LocalRdrEnv #

extendLocalRdrEnvList :: LocalRdrEnv -> [Name] -> LocalRdrEnv #

lookupLocalRdrEnv :: LocalRdrEnv -> RdrName -> Maybe Name #

lookupLocalRdrOcc :: LocalRdrEnv -> OccName -> Maybe Name #

elemLocalRdrEnv :: RdrName -> LocalRdrEnv -> Bool #

localRdrEnvElts :: LocalRdrEnv -> [Name] #

inLocalRdrEnvScope :: Name -> LocalRdrEnv -> Bool #

minusLocalRdrEnv :: LocalRdrEnv -> OccEnv a -> LocalRdrEnv #

gresFromAvails :: Maybe ImportSpec -> [AvailInfo] -> [GlobalRdrElt] #

make a GlobalRdrEnv where all the elements point to the same Provenance (useful for "hiding" imports, or imports with no details).

localGREsFromAvail :: AvailInfo -> [GlobalRdrElt] #

gresFromAvail :: (Name -> Maybe ImportSpec) -> AvailInfo -> [GlobalRdrElt] #

greOccName :: GlobalRdrElt -> OccName #

See Note [GreNames]

greMangledName :: GlobalRdrElt -> Name #

A Name for the GRE for internal use. Careful: the OccName of this Name is not necessarily the same as the greOccName (see Note [GreNames]).

grePrintableName :: GlobalRdrElt -> Name #

A Name for the GRE suitable for output to the user. Its OccName will be the greOccName (see Note [GreNames]).

greDefinitionSrcSpan :: GlobalRdrElt -> SrcSpan #

The SrcSpan of the name pointed to by the GRE.

greDefinitionModule :: GlobalRdrElt -> Maybe Module #

The module in which the name pointed to by the GRE is defined.

greQualModName :: GlobalRdrElt -> ModuleName #

greRdrNames :: GlobalRdrElt -> [RdrName] #

greSrcSpan :: GlobalRdrElt -> SrcSpan #

greParent_maybe :: GlobalRdrElt -> Maybe Name #

gresToAvailInfo :: [GlobalRdrElt] -> [AvailInfo] #

Takes a list of distinct GREs and folds them into AvailInfos. This is more efficient than mapping each individual GRE to an AvailInfo and the folding using plusAvail but needs the uniqueness assumption.

availFromGRE :: GlobalRdrElt -> AvailInfo #

emptyGlobalRdrEnv :: GlobalRdrEnv #

globalRdrEnvElts :: GlobalRdrEnv -> [GlobalRdrElt] #

pprGlobalRdrEnv :: Bool -> GlobalRdrEnv -> SDoc #

lookupGlobalRdrEnv :: GlobalRdrEnv -> OccName -> [GlobalRdrElt] #

lookupGRE_RdrName :: RdrName -> GlobalRdrEnv -> [GlobalRdrElt] #

Look for this RdrName in the global environment. Omits record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).

lookupGRE_RdrName' :: RdrName -> GlobalRdrEnv -> [GlobalRdrElt] #

Look for this RdrName in the global environment. Includes record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).

lookupGRE_Name :: GlobalRdrEnv -> Name -> Maybe GlobalRdrElt #

Look for precisely this Name in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same OccName.

lookupGRE_GreName :: GlobalRdrEnv -> GreName -> Maybe GlobalRdrElt #

Look for precisely this GreName in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same OccName.

lookupGRE_FieldLabel :: GlobalRdrEnv -> FieldLabel -> Maybe GlobalRdrElt #

Look for a particular record field selector in the environment, where the selector name and field label may be different: the GlobalRdrEnv is keyed on the label. See Note [GreNames] for why this happens.

lookupGRE_Name_OccName :: GlobalRdrEnv -> Name -> OccName -> Maybe GlobalRdrElt #

Look for precisely this Name in the environment, but with an OccName that might differ from that of the Name. See lookupGRE_FieldLabel and Note [GreNames].

getGRE_NameQualifier_maybes :: GlobalRdrEnv -> Name -> [Maybe [ModuleName]] #

isLocalGRE :: GlobalRdrElt -> Bool #

isRecFldGRE :: GlobalRdrElt -> Bool #

isDuplicateRecFldGRE :: GlobalRdrElt -> Bool #

Is this a record field defined with DuplicateRecordFields? (See Note [GreNames])

isNoFieldSelectorGRE :: GlobalRdrElt -> Bool #

Is this a record field defined with NoFieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)

isFieldSelectorGRE :: GlobalRdrElt -> Bool #

Is this a record field defined with FieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)

greFieldLabel :: GlobalRdrElt -> Maybe FieldLabel #

Returns the field label of this GRE, if it has one

unQualOK :: GlobalRdrElt -> Bool #

Test if an unqualified version of this thing would be in scope

pickGREs :: RdrName -> [GlobalRdrElt] -> [GlobalRdrElt] #

Takes a list of GREs which have the right OccName x Pick those GREs that are in scope * Qualified, as x if want_qual is Qual M _ * Unqualified, as x if want_unqual is Unqual _

Return each such GRE, with its ImportSpecs filtered, to reflect how it is in scope qualified or unqualified respectively. See Note [GRE filtering]

pickGREsModExp :: ModuleName -> [GlobalRdrElt] -> [(GlobalRdrElt, GlobalRdrElt)] #

Pick GREs that are in scope *both* qualified *and* unqualified Return each GRE that is, as a pair (qual_gre, unqual_gre) These two GREs are the original GRE with imports filtered to express how it is in scope qualified an unqualified respectively

Used only for the 'module M' item in export list; see exports_from_avail

plusGlobalRdrEnv :: GlobalRdrEnv -> GlobalRdrEnv -> GlobalRdrEnv #

mkGlobalRdrEnv :: [GlobalRdrElt] -> GlobalRdrEnv #

transformGREs :: (GlobalRdrElt -> GlobalRdrElt) -> [OccName] -> GlobalRdrEnv -> GlobalRdrEnv #

Apply a transformation function to the GREs for these OccNames

extendGlobalRdrEnv :: GlobalRdrEnv -> GlobalRdrElt -> GlobalRdrEnv #

shadowNames :: GlobalRdrEnv -> OccEnv a -> GlobalRdrEnv #

bestImport :: [ImportSpec] -> ImportSpec #

unQualSpecOK :: ImportSpec -> Bool #

Is in scope unqualified?

qualSpecOK :: ModuleName -> ImportSpec -> Bool #

Is in scope qualified with the given module?

importSpecLoc :: ImportSpec -> SrcSpan #

importSpecModule :: ImportSpec -> ModuleName #

isExplicitItem :: ImpItemSpec -> Bool #

pprNameProvenance :: GlobalRdrElt -> SDoc #

Print out one place where the name was define/imported (With -dppr-debug, print them all)

opIsAt :: RdrName -> Bool #

Indicate if the given name is the "@" operator

importedByUser :: [ImportedBy] -> [ImportedModsVal] #

getLocA :: GenLocated (SrcSpanAnn' a) e -> SrcSpan #

noLocA :: a -> LocatedAn an a #

pprIfPs :: forall (p :: Pass). IsPass p => (p ~ 'Parsed => SDoc) -> SDoc #

pprIfRn :: forall (p :: Pass). IsPass p => (p ~ 'Renamed => SDoc) -> SDoc #

pprIfTc :: forall (p :: Pass). IsPass p => (p ~ 'Typechecked => SDoc) -> SDoc #

noHsTok :: forall (tok :: Symbol). GenLocated TokenLocation (HsToken tok) #

noHsUniTok :: forall (tok :: Symbol) (utok :: Symbol). GenLocated TokenLocation (HsUniToken tok utok) #

hsDocIds :: WithHsDocIdentifiers a GhcRn -> NameSet #

Extract a mapping from the lexed identifiers to the names they may correspond to.

pprWithDoc :: LHsDoc name -> SDoc -> SDoc #

Pretty print a thing with its doc The docstring will include the comment decorators '-- |', '{-|' etc and will come either before or after depending on how it was written i.e it will come after the thing if it is a '-- ^' or '{-^' and before otherwise.

pprMaybeWithDoc :: Maybe (LHsDoc name) -> SDoc -> SDoc #

See pprWithHsDoc

pprHsDocDebug :: Outputable (IdP name) => HsDoc name -> SDoc #

Print a doc with its identifiers, useful for debugging

emptyDocs :: Docs #

allNameStrings :: Infinite String #

allNameStringList :: [String] #

itName :: Unique -> SrcSpan -> Name #

mkUnboundName :: OccName -> Name #

isUnboundName :: Name -> Bool #

basicKnownKeyNames :: [Name] #

genericTyConNames :: [Name] #

pRELUDE :: Module #

gHC_PRIM :: Module #

gHC_PRIM_PANIC :: Module #

gHC_TYPES :: Module #

gHC_MAGIC :: Module #

gHC_MAGIC_DICT :: Module #

gHC_CSTRING :: Module #

gHC_CLASSES :: Module #

gHC_PRIMOPWRAPPERS :: Module #

gHC_BASE :: Module #

gHC_ENUM :: Module #

gHC_GHCI :: Module #

gHC_GHCI_HELPERS :: Module #

gHC_SHOW :: Module #

gHC_READ :: Module #

gHC_NUM :: Module #

gHC_MAYBE :: Module #

gHC_NUM_INTEGER :: Module #

gHC_NUM_NATURAL :: Module #

gHC_NUM_BIGNAT :: Module #

gHC_LIST :: Module #

gHC_TUPLE :: Module #

gHC_TUPLE_PRIM :: Module #

dATA_EITHER :: Module #

dATA_LIST :: Module #

dATA_STRING :: Module #

dATA_FOLDABLE :: Module #

dATA_TRAVERSABLE :: Module #

gHC_CONC :: Module #

gHC_IO :: Module #

gHC_IO_Exception :: Module #

gHC_ST :: Module #

gHC_IX :: Module #

gHC_STABLE :: Module #

gHC_PTR :: Module #

gHC_ERR :: Module #

gHC_REAL :: Module #

gHC_FLOAT :: Module #

gHC_TOP_HANDLER :: Module #

sYSTEM_IO :: Module #

dYNAMIC :: Module #

tYPEABLE :: Module #

tYPEABLE_INTERNAL :: Module #

gENERICS :: Module #

rEAD_PREC :: Module #

lEX :: Module #

gHC_INT :: Module #

gHC_WORD :: Module #

mONAD :: Module #

mONAD_FIX :: Module #

mONAD_ZIP :: Module #

mONAD_FAIL :: Module #

aRROW :: Module #

gHC_DESUGAR :: Module #

rANDOM :: Module #

gHC_EXTS :: Module #

gHC_IS_LIST :: Module #

cONTROL_EXCEPTION_BASE :: Module #

gHC_GENERICS :: Module #

gHC_TYPEERROR :: Module #

gHC_TYPELITS :: Module #

gHC_TYPELITS_INTERNAL :: Module #

gHC_TYPENATS :: Module #

gHC_TYPENATS_INTERNAL :: Module #

dATA_COERCE :: Module #

dEBUG_TRACE :: Module #

uNSAFE_COERCE :: Module #

fOREIGN_C_CONSTPTR :: Module #

gHC_SRCLOC :: Module #

gHC_STACK :: Module #

gHC_STACK_TYPES :: Module #

gHC_STATICPTR :: Module #

gHC_STATICPTR_INTERNAL :: Module #

gHC_FINGERPRINT_TYPE :: Module #

gHC_OVER_LABELS :: Module #

gHC_RECORDS :: Module #

rOOT_MAIN :: Module #

mkInteractiveModule :: Int -> Module #

pRELUDE_NAME :: ModuleName #

mAIN_NAME :: ModuleName #

mkPrimModule :: FastString -> Module #

mkBignumModule :: FastString -> Module #

mkBaseModule :: FastString -> Module #

mkBaseModule_ :: ModuleName -> Module #

mkThisGhcModule :: FastString -> Module #

mkThisGhcModule_ :: ModuleName -> Module #

mkMainModule :: FastString -> Module #

mkMainModule_ :: ModuleName -> Module #

main_RDR_Unqual :: RdrName #

eq_RDR :: RdrName #

ge_RDR :: RdrName #

le_RDR :: RdrName #

lt_RDR :: RdrName #

gt_RDR :: RdrName #

compare_RDR :: RdrName #

ltTag_RDR :: RdrName #

eqTag_RDR :: RdrName #

gtTag_RDR :: RdrName #

eqClass_RDR :: RdrName #

numClass_RDR :: RdrName #

ordClass_RDR :: RdrName #

enumClass_RDR :: RdrName #

monadClass_RDR :: RdrName #

map_RDR :: RdrName #

append_RDR :: RdrName #

foldr_RDR :: RdrName #

build_RDR :: RdrName #

returnM_RDR :: RdrName #

bindM_RDR :: RdrName #

failM_RDR :: RdrName #

left_RDR :: RdrName #

right_RDR :: RdrName #

fromEnum_RDR :: RdrName #

toEnum_RDR :: RdrName #

enumFrom_RDR :: RdrName #

enumFromTo_RDR :: RdrName #

enumFromThen_RDR :: RdrName #

enumFromThenTo_RDR :: RdrName #

ratioDataCon_RDR :: RdrName #

integerAdd_RDR :: RdrName #

integerMul_RDR :: RdrName #

ioDataCon_RDR :: RdrName #

newStablePtr_RDR :: RdrName #

bindIO_RDR :: RdrName #

returnIO_RDR :: RdrName #

fromInteger_RDR :: RdrName #

fromRational_RDR :: RdrName #

minus_RDR :: RdrName #

times_RDR :: RdrName #

plus_RDR :: RdrName #

toInteger_RDR :: RdrName #

toRational_RDR :: RdrName #

fromIntegral_RDR :: RdrName #

fromString_RDR :: RdrName #

fromList_RDR :: RdrName #

fromListN_RDR :: RdrName #

toList_RDR :: RdrName #

compose_RDR :: RdrName #

and_RDR :: RdrName #

not_RDR :: RdrName #

dataToTag_RDR :: RdrName #

succ_RDR :: RdrName #

pred_RDR :: RdrName #

minBound_RDR :: RdrName #

maxBound_RDR :: RdrName #

range_RDR :: RdrName #

inRange_RDR :: RdrName #

index_RDR :: RdrName #

unsafeIndex_RDR :: RdrName #

unsafeRangeSize_RDR :: RdrName #

readList_RDR :: RdrName #

readListDefault_RDR :: RdrName #

readListPrec_RDR :: RdrName #

readListPrecDefault_RDR :: RdrName #

readPrec_RDR :: RdrName #

parens_RDR :: RdrName #

choose_RDR :: RdrName #

lexP_RDR :: RdrName #

expectP_RDR :: RdrName #

readField_RDR :: RdrName #

readFieldHash_RDR :: RdrName #

readSymField_RDR :: RdrName #

punc_RDR :: RdrName #

ident_RDR :: RdrName #

symbol_RDR :: RdrName #

step_RDR :: RdrName #

alt_RDR :: RdrName #

reset_RDR :: RdrName #

prec_RDR :: RdrName #

pfail_RDR :: RdrName #

showsPrec_RDR :: RdrName #

shows_RDR :: RdrName #

showString_RDR :: RdrName #

showSpace_RDR :: RdrName #

showCommaSpace_RDR :: RdrName #

showParen_RDR :: RdrName #

error_RDR :: RdrName #

u1DataCon_RDR :: RdrName #

par1DataCon_RDR :: RdrName #

rec1DataCon_RDR :: RdrName #

k1DataCon_RDR :: RdrName #

m1DataCon_RDR :: RdrName #

l1DataCon_RDR :: RdrName #

r1DataCon_RDR :: RdrName #

prodDataCon_RDR :: RdrName #

comp1DataCon_RDR :: RdrName #

unPar1_RDR :: RdrName #

unRec1_RDR :: RdrName #

unK1_RDR :: RdrName #

unComp1_RDR :: RdrName #

from_RDR :: RdrName #

from1_RDR :: RdrName #

to_RDR :: RdrName #

to1_RDR :: RdrName #

datatypeName_RDR :: RdrName #

moduleName_RDR :: RdrName #

packageName_RDR :: RdrName #

isNewtypeName_RDR :: RdrName #

selName_RDR :: RdrName #

conName_RDR :: RdrName #

conFixity_RDR :: RdrName #

conIsRecord_RDR :: RdrName #

prefixDataCon_RDR :: RdrName #

infixDataCon_RDR :: RdrName #

leftAssocDataCon_RDR :: RdrName #

rightAssocDataCon_RDR :: RdrName #

notAssocDataCon_RDR :: RdrName #

uAddrDataCon_RDR :: RdrName #

uCharDataCon_RDR :: RdrName #

uDoubleDataCon_RDR :: RdrName #

uFloatDataCon_RDR :: RdrName #

uIntDataCon_RDR :: RdrName #

uWordDataCon_RDR :: RdrName #

uAddrHash_RDR :: RdrName #

uCharHash_RDR :: RdrName #

uDoubleHash_RDR :: RdrName #

uFloatHash_RDR :: RdrName #

uIntHash_RDR :: RdrName #

uWordHash_RDR :: RdrName #

fmap_RDR :: RdrName #

replace_RDR :: RdrName #

pure_RDR :: RdrName #

ap_RDR :: RdrName #

liftA2_RDR :: RdrName #

foldable_foldr_RDR :: RdrName #

foldMap_RDR :: RdrName #

null_RDR :: RdrName #

all_RDR :: RdrName #

traverse_RDR :: RdrName #

mempty_RDR :: RdrName #

mappend_RDR :: RdrName #

varQual_RDR :: Module -> FastString -> RdrName #

tcQual_RDR :: Module -> FastString -> RdrName #

clsQual_RDR :: Module -> FastString -> RdrName #

dataQual_RDR :: Module -> FastString -> RdrName #

wildCardName :: Name #

runMainIOName :: Name #

runRWName :: Name #

orderingTyConName :: Name #

ordLTDataConName :: Name #

ordEQDataConName :: Name #

ordGTDataConName :: Name #

specTyConName :: Name #

eitherTyConName :: Name #

leftDataConName :: Name #

rightDataConName :: Name #

voidTyConName :: Name #

v1TyConName :: Name #

u1TyConName :: Name #

par1TyConName :: Name #

rec1TyConName :: Name #

k1TyConName :: Name #

m1TyConName :: Name #

sumTyConName :: Name #

prodTyConName :: Name #

compTyConName :: Name #

rTyConName :: Name #

dTyConName :: Name #

cTyConName :: Name #

sTyConName :: Name #

rec0TyConName :: Name #

d1TyConName :: Name #

c1TyConName :: Name #

s1TyConName :: Name #

repTyConName :: Name #

rep1TyConName :: Name #

uRecTyConName :: Name #

uAddrTyConName :: Name #

uCharTyConName :: Name #

uDoubleTyConName :: Name #

uFloatTyConName :: Name #

uIntTyConName :: Name #

uWordTyConName :: Name #

prefixIDataConName :: Name #

infixIDataConName :: Name #

leftAssociativeDataConName :: Name #

rightAssociativeDataConName :: Name #

notAssociativeDataConName :: Name #

sourceUnpackDataConName :: Name #

sourceNoUnpackDataConName :: Name #

noSourceUnpackednessDataConName :: Name #

sourceLazyDataConName :: Name #

sourceStrictDataConName :: Name #

noSourceStrictnessDataConName :: Name #

decidedLazyDataConName :: Name #

decidedStrictDataConName :: Name #

decidedUnpackDataConName :: Name #

metaDataDataConName :: Name #

metaConsDataConName :: Name #

metaSelDataConName :: Name #

divIntName :: Name #

modIntName :: Name #

cstringLengthName :: Name #

eqStringName :: Name #

unpackCStringName :: Name #

unpackCStringAppendName :: Name #

unpackCStringFoldrName :: Name #

unpackCStringUtf8Name :: Name #

unpackCStringAppendUtf8Name :: Name #

unpackCStringFoldrUtf8Name :: Name #

inlineIdName :: Name #

eqClassName :: Name #

eqName :: Name #

ordClassName :: Name #

geName :: Name #

functorClassName :: Name #

fmapName :: Name #

monadClassName :: Name #

thenMName :: Name #

bindMName :: Name #

returnMName :: Name #

monadFailClassName :: Name #

failMName :: Name #

applicativeClassName :: Name #

apAName :: Name #

pureAName :: Name #

thenAName :: Name #

foldableClassName :: Name #

traversableClassName :: Name #

semigroupClassName :: Name #

sappendName :: Name #

monoidClassName :: Name #

memptyName :: Name #

mappendName :: Name #

mconcatName :: Name #

joinMName :: Name #

alternativeClassName :: Name #

joinMIdKey :: Unique #

apAClassOpKey :: Unique #

pureAClassOpKey :: Unique #

thenAClassOpKey :: Unique #

alternativeClassKey :: Unique #

considerAccessibleName :: Name #

dollarName :: Name #

otherwiseIdName :: Name #

foldrName :: Name #

buildName :: Name #

augmentName :: Name #

mapName :: Name #

appendName :: Name #

assertName :: Name #

fromStringName :: Name #

numClassName :: Name #

fromIntegerName :: Name #

minusName :: Name #

negateName :: Name #

bnbVarQual :: String -> Unique -> Name #

bnnVarQual :: String -> Unique -> Name #

bniVarQual :: String -> Unique -> Name #

bignatFromWordListName :: Name #

bignatEqName :: Name #

bignatCompareName :: Name #

bignatCompareWordName :: Name #

naturalToWordName :: Name #

naturalPopCountName :: Name #

naturalShiftRName :: Name #

naturalShiftLName :: Name #

naturalAddName :: Name #

naturalSubName :: Name #

naturalSubThrowName :: Name #

naturalSubUnsafeName :: Name #

naturalMulName :: Name #

naturalQuotRemName :: Name #

naturalQuotName :: Name #

naturalRemName :: Name #

naturalAndName :: Name #

naturalAndNotName :: Name #

naturalOrName :: Name #

naturalXorName :: Name #

naturalTestBitName :: Name #

naturalBitName :: Name #

naturalGcdName :: Name #

naturalLcmName :: Name #

naturalLog2Name :: Name #

naturalLogBaseWordName :: Name #

naturalLogBaseName :: Name #

naturalPowModName :: Name #

naturalSizeInBaseName :: Name #

integerFromNaturalName :: Name #

integerToNaturalClampName :: Name #

integerToNaturalThrowName :: Name #

integerToNaturalName :: Name #

integerToWordName :: Name #

integerToIntName :: Name #

integerToWord64Name :: Name #

integerToInt64Name :: Name #

integerFromWordName :: Name #

integerFromWord64Name :: Name #

integerFromInt64Name :: Name #

integerAddName :: Name #

integerMulName :: Name #

integerSubName :: Name #

integerNegateName :: Name #

integerAbsName :: Name #

integerPopCountName :: Name #

integerQuotName :: Name #

integerRemName :: Name #

integerDivName :: Name #

integerModName :: Name #

integerDivModName :: Name #

integerQuotRemName :: Name #

integerEncodeFloatName :: Name #

integerEncodeDoubleName :: Name #

integerGcdName :: Name #

integerLcmName :: Name #

integerAndName :: Name #

integerOrName :: Name #

integerXorName :: Name #

integerComplementName :: Name #

integerBitName :: Name #

integerTestBitName :: Name #

integerShiftLName :: Name #

integerShiftRName :: Name #

rationalTyConName :: Name #

ratioTyConName :: Name #

ratioDataConName :: Name #

realClassName :: Name #

integralClassName :: Name #

realFracClassName :: Name #

fractionalClassName :: Name #

fromRationalName :: Name #

toIntegerName :: Name #

toRationalName :: Name #

fromIntegralName :: Name #

realToFracName :: Name #

mkRationalBase2Name :: Name #

mkRationalBase10Name :: Name #

floatingClassName :: Name #

realFloatClassName :: Name #

integerToFloatName :: Name #

integerToDoubleName :: Name #

naturalToFloatName :: Name #

naturalToDoubleName :: Name #

rationalToFloatName :: Name #

rationalToDoubleName :: Name #

ixClassName :: Name #

trModuleTyConName :: Name #

trModuleDataConName :: Name #

trNameTyConName :: Name #

trNameSDataConName :: Name #

trNameDDataConName :: Name #

trTyConTyConName :: Name #

trTyConDataConName :: Name #

kindRepTyConName :: Name #

kindRepTyConAppDataConName :: Name #

kindRepVarDataConName :: Name #

kindRepAppDataConName :: Name #

kindRepFunDataConName :: Name #

kindRepTYPEDataConName :: Name #

kindRepTypeLitSDataConName :: Name #

kindRepTypeLitDDataConName :: Name #

typeLitSortTyConName :: Name #

typeLitSymbolDataConName :: Name #

typeLitNatDataConName :: Name #

typeLitCharDataConName :: Name #

typeableClassName :: Name #

typeRepTyConName :: Name #

someTypeRepTyConName :: Name #

someTypeRepDataConName :: Name #

typeRepIdName :: Name #

mkTrTypeName :: Name #

mkTrConName :: Name #

mkTrAppName :: Name #

mkTrFunName :: Name #

typeNatTypeRepName :: Name #

typeSymbolTypeRepName :: Name #

typeCharTypeRepName :: Name #

trGhcPrimModuleName :: Name #

starKindRepName :: Name #

starArrStarKindRepName :: Name #

starArrStarArrStarKindRepName :: Name #

constraintKindRepName :: Name #

withDictClassName :: Name #

nonEmptyTyConName :: Name #

errorMessageTypeErrorFamName :: Name #

typeErrorTextDataConName :: Name #

typeErrorAppendDataConName :: Name #

typeErrorVAppendDataConName :: Name #

typeErrorShowTypeDataConName :: Name #

unsafeEqualityProofName :: Name #

unsafeEqualityTyConName :: Name #

unsafeReflDataConName :: Name #

unsafeCoercePrimName :: Name #

toDynName :: Name #

dataClassName :: Name #

assertErrorName :: Name #

traceName :: Name #

enumClassName :: Name #

enumFromName :: Name #

enumFromToName :: Name #

enumFromThenName :: Name #

enumFromThenToName :: Name #

boundedClassName :: Name #

concatName :: Name #

filterName :: Name #

zipName :: Name #

isListClassName :: Name #

fromListName :: Name #

fromListNName :: Name #

toListName :: Name #

getFieldName :: Name #

setFieldName :: Name #

showClassName :: Name #

readClassName :: Name #

genClassName :: Name #

gen1ClassName :: Name #

datatypeClassName :: Name #

constructorClassName :: Name #

selectorClassName :: Name #

genericClassNames :: [Name] #

ghciIoClassName :: Name #

ghciStepIoMName :: Name #

ioTyConName :: Name #

ioDataConName :: Name #

thenIOName :: Name #

bindIOName :: Name #

returnIOName :: Name #

failIOName :: Name #

int8TyConName :: Name #

int16TyConName :: Name #

int32TyConName :: Name #

int64TyConName :: Name #

word8TyConName :: Name #

word16TyConName :: Name #

word32TyConName :: Name #

word64TyConName :: Name #

ptrTyConName :: Name #

funPtrTyConName :: Name #

stablePtrTyConName :: Name #

newStablePtrName :: Name #

monadFixClassName :: Name #

mfixName :: Name #

arrAName :: Name #

composeAName :: Name #

firstAName :: Name #

appAName :: Name #

choiceAName :: Name #

loopAName :: Name #

guardMName :: Name #

liftMName :: Name #

mzipName :: Name #

toAnnotationWrapperName :: Name #

monadPlusClassName :: Name #

isStringClassName :: Name #

knownNatClassName :: Name #

knownSymbolClassName :: Name #

knownCharClassName :: Name #

fromLabelClassOpName :: Name #

ipClassName :: Name #

hasFieldClassName :: Name #

callStackTyConName :: Name #

emptyCallStackName :: Name #

pushCallStackName :: Name #

srcLocDataConName :: Name #

pLUGINS :: Module #

pluginTyConName :: Name #

frontendPluginTyConName :: Name #

makeStaticName :: Name #

staticPtrInfoTyConName :: Name #

staticPtrInfoDataConName :: Name #

staticPtrTyConName :: Name #

staticPtrDataConName :: Name #

fromStaticPtrName :: Name #

fingerprintDataConName :: Name #

constPtrConName :: Name #

varQual :: Module -> FastString -> Unique -> Name #

tcQual :: Module -> FastString -> Unique -> Name #

clsQual :: Module -> FastString -> Unique -> Name #

dcQual :: Module -> FastString -> Unique -> Name #

mk_known_key_name :: NameSpace -> Module -> FastString -> Unique -> Name #

boundedClassKey :: Unique #

enumClassKey :: Unique #

eqClassKey :: Unique #

floatingClassKey :: Unique #

fractionalClassKey :: Unique #

integralClassKey :: Unique #

monadClassKey :: Unique #

dataClassKey :: Unique #

functorClassKey :: Unique #

numClassKey :: Unique #

ordClassKey :: Unique #

readClassKey :: Unique #

realClassKey :: Unique #

realFloatClassKey :: Unique #

realFracClassKey :: Unique #

showClassKey :: Unique #

ixClassKey :: Unique #

typeableClassKey :: Unique #

withDictClassKey :: Unique #

monadFixClassKey :: Unique #

monadFailClassKey :: Unique #

monadPlusClassKey :: Unique #

randomClassKey :: Unique #

randomGenClassKey :: Unique #

isStringClassKey :: Unique #

applicativeClassKey :: Unique #

foldableClassKey :: Unique #

traversableClassKey :: Unique #

genClassKey :: Unique #

gen1ClassKey :: Unique #

datatypeClassKey :: Unique #

constructorClassKey :: Unique #

selectorClassKey :: Unique #

knownNatClassNameKey :: Unique #

knownSymbolClassNameKey :: Unique #

knownCharClassNameKey :: Unique #

ghciIoClassKey :: Unique #

semigroupClassKey :: Unique #

monoidClassKey :: Unique #

ipClassKey :: Unique #

hasFieldClassNameKey :: Unique #

addrPrimTyConKey :: Unique #

arrayPrimTyConKey :: Unique #

boolTyConKey :: Unique #

byteArrayPrimTyConKey :: Unique #

stringTyConKey :: Unique #

charPrimTyConKey :: Unique #

charTyConKey :: Unique #

doublePrimTyConKey :: Unique #

doubleTyConKey :: Unique #

floatPrimTyConKey :: Unique #

floatTyConKey :: Unique #

fUNTyConKey :: Unique #

intPrimTyConKey :: Unique #

intTyConKey :: Unique #

int8PrimTyConKey :: Unique #

int8TyConKey :: Unique #

int16PrimTyConKey :: Unique #

int16TyConKey :: Unique #

int32PrimTyConKey :: Unique #

int32TyConKey :: Unique #

int64PrimTyConKey :: Unique #

int64TyConKey :: Unique #

integerTyConKey :: Unique #

naturalTyConKey :: Unique #

listTyConKey :: Unique #

foreignObjPrimTyConKey :: Unique #

maybeTyConKey :: Unique #

weakPrimTyConKey :: Unique #

mutableArrayPrimTyConKey :: Unique #

mutableByteArrayPrimTyConKey :: Unique #

orderingTyConKey :: Unique #

mVarPrimTyConKey :: Unique #

ioPortPrimTyConKey :: Unique #

ratioTyConKey :: Unique #

rationalTyConKey :: Unique #

realWorldTyConKey :: Unique #

stablePtrPrimTyConKey :: Unique #

stablePtrTyConKey :: Unique #

eqTyConKey :: Unique #

heqTyConKey :: Unique #

ctArrowTyConKey :: Unique #

ccArrowTyConKey :: Unique #

tcArrowTyConKey :: Unique #

statePrimTyConKey :: Unique #

stableNamePrimTyConKey :: Unique #

stableNameTyConKey :: Unique #

eqPrimTyConKey :: Unique #

eqReprPrimTyConKey :: Unique #

eqPhantPrimTyConKey :: Unique #

mutVarPrimTyConKey :: Unique #

ioTyConKey :: Unique #

wordPrimTyConKey :: Unique #

wordTyConKey :: Unique #

word8PrimTyConKey :: Unique #

word8TyConKey :: Unique #

word16PrimTyConKey :: Unique #

word16TyConKey :: Unique #

word32PrimTyConKey :: Unique #

word32TyConKey :: Unique #

word64PrimTyConKey :: Unique #

word64TyConKey :: Unique #

kindConKey :: Unique #

boxityConKey :: Unique #

typeConKey :: Unique #

threadIdPrimTyConKey :: Unique #

bcoPrimTyConKey :: Unique #

ptrTyConKey :: Unique #

funPtrTyConKey :: Unique #

tVarPrimTyConKey :: Unique #

compactPrimTyConKey :: Unique #

stackSnapshotPrimTyConKey :: Unique #

promptTagPrimTyConKey :: Unique #

eitherTyConKey :: Unique #

voidTyConKey :: Unique #

nonEmptyTyConKey :: Unique #

dictTyConKey :: Unique #

liftedTypeKindTyConKey :: Unique #

unliftedTypeKindTyConKey :: Unique #

tYPETyConKey :: Unique #

cONSTRAINTTyConKey :: Unique #

constraintKindTyConKey :: Unique #

levityTyConKey :: Unique #

runtimeRepTyConKey :: Unique #

vecCountTyConKey :: Unique #

vecElemTyConKey :: Unique #

liftedRepTyConKey :: Unique #

unliftedRepTyConKey :: Unique #

zeroBitRepTyConKey :: Unique #

zeroBitTypeTyConKey :: Unique #

pluginTyConKey :: Unique #

frontendPluginTyConKey :: Unique #

trTyConTyConKey :: Unique #

trModuleTyConKey :: Unique #

trNameTyConKey :: Unique #

kindRepTyConKey :: Unique #

typeLitSortTyConKey :: Unique #

v1TyConKey :: Unique #

u1TyConKey :: Unique #

par1TyConKey :: Unique #

rec1TyConKey :: Unique #

k1TyConKey :: Unique #

m1TyConKey :: Unique #

sumTyConKey :: Unique #

prodTyConKey :: Unique #

compTyConKey :: Unique #

rTyConKey :: Unique #

dTyConKey :: Unique #

cTyConKey :: Unique #

sTyConKey :: Unique #

rec0TyConKey :: Unique #

d1TyConKey :: Unique #

c1TyConKey :: Unique #

s1TyConKey :: Unique #

repTyConKey :: Unique #

rep1TyConKey :: Unique #

uRecTyConKey :: Unique #

uAddrTyConKey :: Unique #

uCharTyConKey :: Unique #

uDoubleTyConKey :: Unique #

uFloatTyConKey :: Unique #

uIntTyConKey :: Unique #

uWordTyConKey :: Unique #

errorMessageTypeErrorFamKey :: Unique #

coercibleTyConKey :: Unique #

proxyPrimTyConKey :: Unique #

specTyConKey :: Unique #

anyTyConKey :: Unique #

smallArrayPrimTyConKey :: Unique #

smallMutableArrayPrimTyConKey :: Unique #

staticPtrTyConKey :: Unique #

staticPtrInfoTyConKey :: Unique #

callStackTyConKey :: Unique #

typeRepTyConKey :: Unique #

someTypeRepTyConKey :: Unique #

someTypeRepDataConKey :: Unique #

typeSymbolAppendFamNameKey :: Unique #

unsafeEqualityTyConKey :: Unique #

multiplicityTyConKey :: Unique #

unrestrictedFunTyConKey :: Unique #

multMulTyConKey :: Unique #

int8X16PrimTyConKey :: Unique #

int16X8PrimTyConKey :: Unique #

int32X4PrimTyConKey :: Unique #

int64X2PrimTyConKey :: Unique #

int8X32PrimTyConKey :: Unique #

int16X16PrimTyConKey :: Unique #

int32X8PrimTyConKey :: Unique #

int64X4PrimTyConKey :: Unique #

int8X64PrimTyConKey :: Unique #

int16X32PrimTyConKey :: Unique #

int32X16PrimTyConKey :: Unique #

int64X8PrimTyConKey :: Unique #

word8X16PrimTyConKey :: Unique #

word16X8PrimTyConKey :: Unique #

word32X4PrimTyConKey :: Unique #

word64X2PrimTyConKey :: Unique #

word8X32PrimTyConKey :: Unique #

word16X16PrimTyConKey :: Unique #

word32X8PrimTyConKey :: Unique #

word64X4PrimTyConKey :: Unique #

word8X64PrimTyConKey :: Unique #

word16X32PrimTyConKey :: Unique #

word32X16PrimTyConKey :: Unique #

word64X8PrimTyConKey :: Unique #

floatX4PrimTyConKey :: Unique #

doubleX2PrimTyConKey :: Unique #

floatX8PrimTyConKey :: Unique #

doubleX4PrimTyConKey :: Unique #

floatX16PrimTyConKey :: Unique #

doubleX8PrimTyConKey :: Unique #

typeSymbolKindConNameKey :: Unique #

typeCharKindConNameKey :: Unique #

typeNatAddTyFamNameKey :: Unique #

typeNatMulTyFamNameKey :: Unique #

typeNatExpTyFamNameKey :: Unique #

typeNatSubTyFamNameKey :: Unique #

typeSymbolCmpTyFamNameKey :: Unique #

typeNatCmpTyFamNameKey :: Unique #

typeCharCmpTyFamNameKey :: Unique #

typeLeqCharTyFamNameKey :: Unique #

typeNatDivTyFamNameKey :: Unique #

typeNatModTyFamNameKey :: Unique #

typeNatLogTyFamNameKey :: Unique #

typeConsSymbolTyFamNameKey :: Unique #

typeUnconsSymbolTyFamNameKey :: Unique #

typeCharToNatTyFamNameKey :: Unique #

typeNatToCharTyFamNameKey :: Unique #

constPtrTyConKey :: Unique #

charDataConKey :: Unique #

consDataConKey :: Unique #

doubleDataConKey :: Unique #

falseDataConKey :: Unique #

floatDataConKey :: Unique #

intDataConKey :: Unique #

nothingDataConKey :: Unique #

justDataConKey :: Unique #

eqDataConKey :: Unique #

nilDataConKey :: Unique #

ratioDataConKey :: Unique #

word8DataConKey :: Unique #

stableNameDataConKey :: Unique #

trueDataConKey :: Unique #

wordDataConKey :: Unique #

ioDataConKey :: Unique #

heqDataConKey :: Unique #

crossDataConKey :: Unique #

inlDataConKey :: Unique #

inrDataConKey :: Unique #

genUnitDataConKey :: Unique #

leftDataConKey :: Unique #

rightDataConKey :: Unique #

ordLTDataConKey :: Unique #

ordEQDataConKey :: Unique #

ordGTDataConKey :: Unique #

mkDictDataConKey :: Unique #

coercibleDataConKey :: Unique #

staticPtrDataConKey :: Unique #

staticPtrInfoDataConKey :: Unique #

fingerprintDataConKey :: Unique #

srcLocDataConKey :: Unique #

trTyConDataConKey :: Unique #

trModuleDataConKey :: Unique #

trNameSDataConKey :: Unique #

trNameDDataConKey :: Unique #

trGhcPrimModuleKey :: Unique #

typeErrorTextDataConKey :: Unique #

typeErrorAppendDataConKey :: Unique #

typeErrorVAppendDataConKey :: Unique #

typeErrorShowTypeDataConKey :: Unique #

prefixIDataConKey :: Unique #

infixIDataConKey :: Unique #

leftAssociativeDataConKey :: Unique #

rightAssociativeDataConKey :: Unique #

notAssociativeDataConKey :: Unique #

sourceUnpackDataConKey :: Unique #

sourceNoUnpackDataConKey :: Unique #

noSourceUnpackednessDataConKey :: Unique #

sourceLazyDataConKey :: Unique #

sourceStrictDataConKey :: Unique #

noSourceStrictnessDataConKey :: Unique #

decidedLazyDataConKey :: Unique #

decidedStrictDataConKey :: Unique #

decidedUnpackDataConKey :: Unique #

metaDataDataConKey :: Unique #

metaConsDataConKey :: Unique #

metaSelDataConKey :: Unique #

vecRepDataConKey :: Unique #

tupleRepDataConKey :: Unique #

sumRepDataConKey :: Unique #

boxedRepDataConKey :: Unique #

boxedRepDataConTyConKey :: Unique #

tupleRepDataConTyConKey :: Unique #

runtimeRepSimpleDataConKeys :: [Unique] #

liftedDataConKey :: Unique #

unliftedDataConKey :: Unique #

vecCountDataConKeys :: [Unique] #

vecElemDataConKeys :: [Unique] #

kindRepTyConAppDataConKey :: Unique #

kindRepVarDataConKey :: Unique #

kindRepAppDataConKey :: Unique #

kindRepFunDataConKey :: Unique #

kindRepTYPEDataConKey :: Unique #

kindRepTypeLitSDataConKey :: Unique #

kindRepTypeLitDDataConKey :: Unique #

typeLitSymbolDataConKey :: Unique #

typeLitNatDataConKey :: Unique #

typeLitCharDataConKey :: Unique #

unsafeReflDataConKey :: Unique #

oneDataConKey :: Unique #

manyDataConKey :: Unique #

integerISDataConKey :: Unique #

integerINDataConKey :: Unique #

integerIPDataConKey :: Unique #

naturalNSDataConKey :: Unique #

naturalNBDataConKey :: Unique #

wildCardKey :: Unique #

absentErrorIdKey :: Unique #

absentConstraintErrorIdKey :: Unique #

augmentIdKey :: Unique #

appendIdKey :: Unique #

buildIdKey :: Unique #

foldrIdKey :: Unique #

recSelErrorIdKey :: Unique #

seqIdKey :: Unique #

absentSumFieldErrorIdKey :: Unique #

eqStringIdKey :: Unique #

noMethodBindingErrorIdKey :: Unique #

nonExhaustiveGuardsErrorIdKey :: Unique #

impossibleErrorIdKey :: Unique #

impossibleConstraintErrorIdKey :: Unique #

patErrorIdKey :: Unique #

realWorldPrimIdKey :: Unique #

recConErrorIdKey :: Unique #

unpackCStringUtf8IdKey :: Unique #

unpackCStringAppendUtf8IdKey :: Unique #

unpackCStringFoldrUtf8IdKey :: Unique #

unpackCStringIdKey :: Unique #

unpackCStringAppendIdKey :: Unique #

unpackCStringFoldrIdKey :: Unique #

voidPrimIdKey :: Unique #

typeErrorIdKey :: Unique #

divIntIdKey :: Unique #

modIntIdKey :: Unique #

cstringLengthIdKey :: Unique #

concatIdKey :: Unique #

filterIdKey :: Unique #

zipIdKey :: Unique #

bindIOIdKey :: Unique #

returnIOIdKey :: Unique #

newStablePtrIdKey :: Unique #

printIdKey :: Unique #

failIOIdKey :: Unique #

nullAddrIdKey :: Unique #

voidArgIdKey :: Unique #

otherwiseIdKey :: Unique #

assertIdKey :: Unique #

leftSectionKey :: Unique #

rightSectionKey :: Unique #

rootMainKey :: Unique #

runMainKey :: Unique #

thenIOIdKey :: Unique #

lazyIdKey :: Unique #

assertErrorIdKey :: Unique #

oneShotKey :: Unique #

runRWKey :: Unique #

traceKey :: Unique #

nospecIdKey :: Unique #

inlineIdKey :: Unique #

mapIdKey :: Unique #

dollarIdKey :: Unique #

coercionTokenIdKey :: Unique #

considerAccessibleIdKey :: Unique #

noinlineIdKey :: Unique #

noinlineConstraintIdKey :: Unique #

integerToFloatIdKey :: Unique #

integerToDoubleIdKey :: Unique #

naturalToFloatIdKey :: Unique #

naturalToDoubleIdKey :: Unique #

rationalToFloatIdKey :: Unique #

rationalToDoubleIdKey :: Unique #

coerceKey :: Unique #

unboundKey :: Unique #

fromIntegerClassOpKey :: Unique #

minusClassOpKey :: Unique #

fromRationalClassOpKey :: Unique #

enumFromClassOpKey :: Unique #

enumFromThenClassOpKey :: Unique #

enumFromToClassOpKey :: Unique #

enumFromThenToClassOpKey :: Unique #

eqClassOpKey :: Unique #

geClassOpKey :: Unique #

negateClassOpKey :: Unique #

bindMClassOpKey :: Unique #

thenMClassOpKey :: Unique #

fmapClassOpKey :: Unique #

returnMClassOpKey :: Unique #

mfixIdKey :: Unique #

failMClassOpKey :: Unique #

fromLabelClassOpKey :: Unique #

arrAIdKey :: Unique #

composeAIdKey :: Unique #

firstAIdKey :: Unique #

appAIdKey :: Unique #

choiceAIdKey :: Unique #

loopAIdKey :: Unique #

fromStringClassOpKey :: Unique #

toAnnotationWrapperIdKey :: Unique #

fromIntegralIdKey :: Unique #

realToFracIdKey :: Unique #

toIntegerClassOpKey :: Unique #

toRationalClassOpKey :: Unique #

guardMIdKey :: Unique #

liftMIdKey :: Unique #

mzipIdKey :: Unique #

ghciStepIoMClassOpKey :: Unique #

isListClassKey :: Unique #

fromListClassOpKey :: Unique #

fromListNClassOpKey :: Unique #

toListClassOpKey :: Unique #

proxyHashKey :: Unique #

mkTyConKey :: Unique #

mkTrTypeKey :: Unique #

mkTrConKey :: Unique #

mkTrAppKey :: Unique #

typeNatTypeRepKey :: Unique #

typeSymbolTypeRepKey :: Unique #

typeCharTypeRepKey :: Unique #

typeRepIdKey :: Unique #

mkTrFunKey :: Unique #

trTYPEKey :: Unique #

trTYPE'PtrRepLiftedKey :: Unique #

trRuntimeRepKey :: Unique #

tr'PtrRepLiftedKey :: Unique #

trLiftedRepKey :: Unique #

starKindRepKey :: Unique #

starArrStarKindRepKey :: Unique #

starArrStarArrStarKindRepKey :: Unique #

constraintKindRepKey :: Unique #

toDynIdKey :: Unique #

bitIntegerIdKey :: Unique #

eqSCSelIdKey :: Unique #

heqSCSelIdKey :: Unique #

coercibleSCSelIdKey :: Unique #

sappendClassOpKey :: Unique #

memptyClassOpKey :: Unique #

mappendClassOpKey :: Unique #

mconcatClassOpKey :: Unique #

emptyCallStackKey :: Unique #

pushCallStackKey :: Unique #

fromStaticPtrClassOpKey :: Unique #

makeStaticKey :: Unique #

unsafeEqualityProofIdKey :: Unique #

unsafeCoercePrimIdKey :: Unique #

getFieldClassOpKey :: Unique #

setFieldClassOpKey :: Unique #

integerFromNaturalIdKey :: Unique #

integerToNaturalClampIdKey :: Unique #

integerToNaturalThrowIdKey :: Unique #

integerToNaturalIdKey :: Unique #

integerToWordIdKey :: Unique #

integerToIntIdKey :: Unique #

integerToWord64IdKey :: Unique #

integerToInt64IdKey :: Unique #

integerAddIdKey :: Unique #

integerMulIdKey :: Unique #

integerSubIdKey :: Unique #

integerNegateIdKey :: Unique #

integerAbsIdKey :: Unique #

integerPopCountIdKey :: Unique #

integerQuotIdKey :: Unique #

integerRemIdKey :: Unique #

integerDivIdKey :: Unique #

integerModIdKey :: Unique #

integerDivModIdKey :: Unique #

integerQuotRemIdKey :: Unique #

integerEncodeFloatIdKey :: Unique #

integerEncodeDoubleIdKey :: Unique #

integerGcdIdKey :: Unique #

integerLcmIdKey :: Unique #

integerAndIdKey :: Unique #

integerOrIdKey :: Unique #

integerXorIdKey :: Unique #

integerComplementIdKey :: Unique #

integerBitIdKey :: Unique #

integerTestBitIdKey :: Unique #

integerShiftLIdKey :: Unique #

integerShiftRIdKey :: Unique #

integerFromWordIdKey :: Unique #

integerFromWord64IdKey :: Unique #

integerFromInt64IdKey :: Unique #

naturalToWordIdKey :: Unique #

naturalPopCountIdKey :: Unique #

naturalShiftRIdKey :: Unique #

naturalShiftLIdKey :: Unique #

naturalAddIdKey :: Unique #

naturalSubIdKey :: Unique #

naturalSubThrowIdKey :: Unique #

naturalSubUnsafeIdKey :: Unique #

naturalMulIdKey :: Unique #

naturalQuotRemIdKey :: Unique #

naturalQuotIdKey :: Unique #

naturalRemIdKey :: Unique #

naturalAndIdKey :: Unique #

naturalAndNotIdKey :: Unique #

naturalOrIdKey :: Unique #

naturalXorIdKey :: Unique #

naturalTestBitIdKey :: Unique #

naturalBitIdKey :: Unique #

naturalGcdIdKey :: Unique #

naturalLcmIdKey :: Unique #

naturalLog2IdKey :: Unique #

naturalLogBaseWordIdKey :: Unique #

naturalLogBaseIdKey :: Unique #

naturalPowModIdKey :: Unique #

naturalSizeInBaseIdKey :: Unique #

bignatFromWordListIdKey :: Unique #

bignatEqIdKey :: Unique #

bignatCompareIdKey :: Unique #

bignatCompareWordIdKey :: Unique #

mkRationalBase2IdKey :: Unique #

mkRationalBase10IdKey :: Unique #

numericClassKeys :: [Unique] #

fractionalClassKeys :: [Unique] #

standardClassKeys :: [Unique] #

derivableClassKeys :: [Unique] #

interactiveClassNames :: [Name] #

interactiveClassKeys :: [Unique] #

pretendNameIsInScope :: Name -> Bool #

Should this name be considered in-scope, even though it technically isn't?

This ensures that we don't filter out information because, e.g., Data.Kind.Type isn't imported.

See Note [pretendNameIsInScope].

importDeclQualifiedStyle :: Maybe EpaLocation -> Maybe EpaLocation -> (Maybe EpaLocation, ImportDeclQualifiedStyle) #

Given two possible located qualified tokens, compute a style (in a conforming Haskell program only one of the two can be not Nothing). This is called from GHC.Parser.

isImportDeclQualified :: ImportDeclQualifiedStyle -> Bool #

Convenience function to answer the question if an import decl. is qualified.

simpleImportDecl :: ModuleName -> ImportDecl GhcPs #

ieName :: forall (p :: Pass). IE (GhcPass p) -> IdP (GhcPass p) #

ieNames :: forall (p :: Pass). IE (GhcPass p) -> [IdP (GhcPass p)] #

ieWrappedLName :: forall (p :: Pass). IEWrappedName (GhcPass p) -> LIdP (GhcPass p) #

ieWrappedName :: forall (p :: Pass). IEWrappedName (GhcPass p) -> IdP (GhcPass p) #

lieWrappedName :: forall (p :: Pass). LIEWrappedName (GhcPass p) -> IdP (GhcPass p) #

ieLWrappedName :: forall (p :: Pass). LIEWrappedName (GhcPass p) -> LIdP (GhcPass p) #

replaceWrappedName :: IEWrappedName GhcPs -> IdP GhcRn -> IEWrappedName GhcRn #

replaceLWrappedName :: LIEWrappedName GhcPs -> IdP GhcRn -> LIEWrappedName GhcRn #

pprImpExp :: (HasOccName name, OutputableBndr name) => name -> SDoc #

wayGeneralFlags :: Platform -> Way -> [GeneralFlag] #

Turn these flags on when enabling this way

wayUnsetGeneralFlags :: Platform -> Way -> [GeneralFlag] #

Turn these flags off when enabling this way

sPgm_F :: Settings -> String #

stopPhaseToPhase :: StopPhase -> Phase #

isStopLn :: Phase -> Bool #

eqPhase :: Phase -> Phase -> Bool #

happensBefore :: Platform -> Phase -> Phase -> Bool #

startPhase :: String -> Phase #

phaseInputExt :: Phase -> String #

isHaskellishSuffix :: String -> Bool #

isBackpackishSuffix :: String -> Bool #

isHaskellSigSuffix :: String -> Bool #

isHaskellSrcSuffix :: String -> Bool #

isCishSuffix :: String -> Bool #

isHaskellUserSrcSuffix :: String -> Bool #

isObjectSuffix :: Platform -> String -> Bool #

isDynLibSuffix :: Platform -> String -> Bool #

isSourceSuffix :: String -> Bool #

isHaskellishTarget :: (String, Maybe Phase) -> Bool #

When we are given files (modified by -x arguments) we need to determine if they are Haskellish or not to figure out how we should try to compile it. The rules are:

If no -x flag was specified, we check to see if the file looks like a module name, has no extension, or has a Haskell source extension.
If an -x flag was specified, we just make sure the specified suffix is a Haskell one.

isHaskellishFilename :: FilePath -> Bool #

isHaskellSrcFilename :: FilePath -> Bool #

isCishFilename :: FilePath -> Bool #

isHaskellUserSrcFilename :: FilePath -> Bool #

isSourceFilename :: FilePath -> Bool #

isHaskellSigFilename :: FilePath -> Bool #

isObjectFilename :: Platform -> FilePath -> Bool #

isDynLibFilename :: Platform -> FilePath -> Bool #

phaseForeignLanguage :: Phase -> Maybe ForeignSrcLang #

Foreign language of the phase if the phase deals with a foreign code

topNormaliseNewType_maybe :: Type -> Maybe (Coercion, Type) #

Sometimes we want to look through a newtype and get its associated coercion. This function strips off newtype layers enough to reveal something that isn't a newtype. Specifically, here's the invariant:

topNormaliseNewType_maybe rec_nts ty = Just (co, ty')

then (a) co : ty ~R ty'. (b) ty' is not a newtype.

The function returns Nothing for non-newtypes, or unsaturated applications

This function does *not* look through type families, because it has no access to the type family environment. If you do have that at hand, consider to use topNormaliseType_maybe, which should be a drop-in replacement for topNormaliseNewType_maybe If topNormliseNewType_maybe ty = Just (co, ty'), then co : ty ~R ty'

coercionType :: Coercion -> Type #

coercionRKind :: Coercion -> Type #

coercionLKind :: Coercion -> Type #

coercionKind :: Coercion -> Pair Type #

If it is the case that

c :: (t1 ~ t2)

i.e. the kind of c relates t1 and t2, then coercionKind c = Pair t1 t2.

seqCo :: Coercion -> () #

liftCoSubst :: HasDebugCallStack => Role -> LiftingContext -> Type -> Coercion #

liftCoSubst role lc ty produces a coercion (at role role) that coerces between lc_left(ty) and lc_right(ty), where lc_left is a substitution mapping type variables to the left-hand types of the mapped coercions in lc, and similar for lc_right.

mkCoercionType :: Role -> Type -> Type -> Type #

Makes a coercion type from two types: the types whose equality is proven by the relevant Coercion

coVarRole :: CoVar -> Role #

coVarKindsTypesRole :: HasDebugCallStack => CoVar -> (Kind, Kind, Type, Type, Role) #

decomposePiCos :: HasDebugCallStack => CoercionN -> Pair Type -> [Type] -> ([CoercionN], CoercionN) #

isReflexiveCo :: Coercion -> Bool #

Slowly checks if the coercion is reflexive. Don't call this in a loop, as it walks over the entire coercion.

isReflCo :: Coercion -> Bool #

Tests if this coercion is obviously reflexive. Guaranteed to work very quickly. Sometimes a coercion can be reflexive, but not obviously so. c.f. isReflexiveCo

isGReflCo :: Coercion -> Bool #

Tests if this coercion is obviously a generalized reflexive coercion. Guaranteed to work very quickly.

mkAxiomRuleCo :: CoAxiomRule -> [Coercion] -> Coercion #

mkProofIrrelCo #

Arguments

:: Role	role of the created coercion, "r"
-> CoercionN	:: phi1 ~N phi2
-> Coercion	g1 :: phi1
-> Coercion	g2 :: phi2
-> Coercion	:: g1 ~r g2

Make a "coercion between coercions".

mkSubCo :: HasDebugCallStack => Coercion -> Coercion #

mkKindCo :: Coercion -> Coercion #

Given co :: (a :: k) ~ (b :: k') produce co' :: k ~ k'.

mkNomReflCo :: Type -> Coercion #

Make a nominal reflexive coercion

mkGReflCo :: Role -> Type -> MCoercionN -> Coercion #

Make a generalized reflexive coercion

mkInstCo :: Coercion -> CoercionN -> Coercion #

Instantiates a Coercion.

mkLRCo :: LeftOrRight -> Coercion -> Coercion #

mkSelCo :: HasDebugCallStack => CoSel -> Coercion -> Coercion #

mkTransCo :: Coercion -> Coercion -> Coercion #

Create a new Coercion by composing the two given Coercions transitively. (co1 ; co2)

mkSymCo :: Coercion -> Coercion #

Create a symmetric version of the given Coercion that asserts equality between the same types but in the other "direction", so a kind of t1 ~ t2 becomes the kind t2 ~ t1.

mkUnivCo #

Arguments

:: UnivCoProvenance
-> Role	role of the built coercion, "r"
-> Type	t1 :: k1
-> Type	t2 :: k2
-> Coercion	:: t1 ~r t2

Make a universal coercion between two arbitrary types.

mkPhantomCo :: Coercion -> Type -> Type -> Coercion #

Make a phantom coercion between two types. The coercion passed in must be a nominal coercion between the kinds of the types.

mkAxiomInstCo :: CoAxiom Branched -> BranchIndex -> [Coercion] -> Coercion #

mkCoVarCo :: CoVar -> Coercion #

mkFunCo2 :: HasDebugCallStack => Role -> FunTyFlag -> FunTyFlag -> CoercionN -> Coercion -> Coercion -> Coercion #

mkNakedFunCo1 :: Role -> FunTyFlag -> CoercionN -> Coercion -> Coercion -> Coercion #

mkFunCo1 :: HasDebugCallStack => Role -> FunTyFlag -> CoercionN -> Coercion -> Coercion -> Coercion #

Build a function Coercion from two other Coercions. That is, given co1 :: a ~ b and co2 :: x ~ y produce co :: (a -> x) ~ (b -> y) or (a => x) ~ (b => y), depending on the kind of a/b. This (most common) version takes a single FunTyFlag, which is used for both fco_afl and ftf_afr of the FunCo

mkForAllCo :: TyCoVar -> CoercionN -> Coercion -> Coercion #

Make a Coercion from a tycovar, a kind coercion, and a body coercion. The kind of the tycovar should be the left-hand kind of the kind coercion. See Note [Unused coercion variable in ForAllCo]

mkAppCo #

Arguments

:: Coercion	:: t1 ~r t2
-> Coercion	:: s1 ~N s2, where s1 :: k1, s2 :: k2
-> Coercion	:: t1 s1 ~r t2 s2

Apply a Coercion to another Coercion. The second coercion must be Nominal, unless the first is Phantom. If the first is Phantom, then the second can be either Phantom or Nominal.

mkTyConAppCo :: HasDebugCallStack => Role -> TyCon -> [Coercion] -> Coercion #

Apply a type constructor to a list of coercions. It is the caller's responsibility to get the roles correct on argument coercions.

mkReflCo :: Role -> Type -> Coercion #

Make a reflexive coercion

classMinimalDef :: Class -> ClassMinimalDef #

mkClass :: Name -> [TyVar] -> [FunDep TyVar] -> [PredType] -> [Id] -> [ClassATItem] -> [ClassOpItem] -> ClassMinimalDef -> TyCon -> Class #

mkAbstractClass :: Name -> [TyVar] -> [FunDep TyVar] -> TyCon -> Class #

classArity :: Class -> Arity #

classAllSelIds :: Class -> [Id] #

classSCSelIds :: Class -> [Id] #

classSCSelId :: Class -> Int -> Id #

classMethods :: Class -> [Id] #

classOpItems :: Class -> [ClassOpItem] #

classATs :: Class -> [TyCon] #

classATItems :: Class -> [ClassATItem] #

classSCTheta :: Class -> [PredType] #

classTvsFds :: Class -> ([TyVar], [FunDep TyVar]) #

classHasFds :: Class -> Bool #

classBigSig :: Class -> ([TyVar], [PredType], [Id], [ClassOpItem]) #

classExtraBigSig :: Class -> ([TyVar], [FunDep TyVar], [PredType], [Id], [ClassATItem], [ClassOpItem]) #

isAbstractClass :: Class -> Bool #

pprDefMethInfo :: DefMethInfo -> SDoc #

pprFundeps :: Outputable a => [FunDep a] -> SDoc #

pprFunDep :: Outputable a => FunDep a -> SDoc #

algTcFields :: TyConDetails -> FieldLabelEnv #

Maps a label to information about the field

mkAnonTyConBinder :: TyVar -> TyConBinder #

mkAnonTyConBinders :: [TyVar] -> [TyConBinder] #

mkInvisAnonTyConBinder :: TyVar -> TyConBinder #

mkNamedTyConBinder :: ForAllTyFlag -> TyVar -> TyConBinder #

mkNamedTyConBinders :: ForAllTyFlag -> [TyVar] -> [TyConBinder] #

mkRequiredTyConBinder :: TyCoVarSet -> TyVar -> TyConBinder #

Make a Required TyConBinder. It chooses between NamedTCB and AnonTCB based on whether the tv is mentioned in the dependent set

tyConBinderForAllTyFlag :: TyConBinder -> ForAllTyFlag #

tyConBndrVisForAllTyFlag :: TyConBndrVis -> ForAllTyFlag #

isNamedTyConBinder :: TyConBinder -> Bool #

isVisibleTyConBinder :: VarBndr tv TyConBndrVis -> Bool #

isVisibleTcbVis :: TyConBndrVis -> Bool #

isInvisibleTyConBinder :: VarBndr tv TyConBndrVis -> Bool #

mkTyConKind :: [TyConBinder] -> Kind -> Kind #

tyConInvisTVBinders :: [TyConBinder] -> [InvisTVBinder] #

tyConVisibleTyVars :: TyCon -> [TyVar] #

mkLevPolyDataTyConRhs #

Arguments

:: Bool	whether the `DataCon` has a fixed levity
-> Bool	True if this is a "type data" declaration See Note [Type data declarations] in GHC.Rename.Module
-> [DataCon]
-> AlgTyConRhs

Create an AlgTyConRhs from the data constructors, for a potentially levity-polymorphic datatype (with UnliftedDatatypes).

mkDataTyConRhs :: [DataCon] -> AlgTyConRhs #

Create an AlgTyConRhs from the data constructors.

Use mkLevPolyDataConRhs if the datatype can be levity-polymorphic or if it comes from a "data type" declaration

visibleDataCons :: AlgTyConRhs -> [DataCon] #

Extract those DataCons that we are able to learn about. Note that visibility in this sense does not correspond to visibility in the context of any particular user program!

isNoParent :: AlgTyConFlav -> Bool #

tyConRepModOcc :: Module -> OccName -> (Module, OccName) #

The name (and defining module) for the Typeable representation (TyCon) of a type constructor.

See Note [Grand plan for Typeable] in GHC.Tc.Instance.Typeable.

isVoidRep :: PrimRep -> Bool #

isGcPtrRep :: PrimRep -> Bool #

primRepCompatible :: Platform -> PrimRep -> PrimRep -> Bool #

primRepsCompatible :: Platform -> [PrimRep] -> [PrimRep] -> Bool #

primRepSizeB :: Platform -> PrimRep -> Int #

The size of a PrimRep in bytes.

This applies also when used in a constructor, where we allow packing the fields. For instance, in data Foo = Foo Float# Float# the two fields will take only 8 bytes, which for 64-bit arch will be equal to 1 word. See also mkVirtHeapOffsetsWithPadding for details of how data fields are laid out.

primElemRepSizeB :: Platform -> PrimElemRep -> Int #

primElemRepToPrimRep :: PrimElemRep -> PrimRep #

primRepIsFloat :: PrimRep -> Maybe Bool #

Return if Rep stands for floating type, returns Nothing for vector types.

primRepIsWord :: PrimRep -> Bool #

primRepIsInt :: PrimRep -> Bool #

tyConFieldLabels :: TyCon -> [FieldLabel] #

The labels for the fields of this particular TyCon

lookupTyConFieldLabel :: FieldLabelString -> TyCon -> Maybe FieldLabel #

Look up a field label belonging to this TyCon

mkAlgTyCon #

Arguments

:: Name
-> [TyConBinder]	Binders of the `TyCon`
-> Kind	Result kind
-> [Role]	The roles for each TyVar
-> Maybe CType	The C type this type corresponds to when using the CAPI FFI
-> [PredType]	Stupid theta: see `algTcStupidTheta`
-> AlgTyConRhs	Information about data constructors
-> AlgTyConFlav	What flavour is it? (e.g. vanilla, type family)
-> Bool	Was the `TyCon` declared with GADT syntax?
-> TyCon

This is the making of an algebraic TyCon.

mkClassTyCon :: Name -> [TyConBinder] -> [Role] -> AlgTyConRhs -> Class -> Name -> TyCon #

Simpler specialization of mkAlgTyCon for classes

mkTupleTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	Result kind of the `TyCon`
-> DataCon
-> TupleSort	Whether the tuple is boxed or unboxed
-> AlgTyConFlav
-> TyCon

mkSumTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	Kind of the resulting `TyCon`
-> [DataCon]
-> AlgTyConFlav
-> TyCon

mkTcTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	result kind only
-> [(Name, TcTyVar)]	Scoped type variables; see Note [How TcTyCons work] in GHC.Tc.TyCl
-> Bool	Is this TcTyCon generalised already?
-> TyConFlavour	What sort of `TyCon` this represents
-> TyCon

Makes a tycon suitable for use during type-checking. It stores a variety of details about the definition of the TyCon, but no right-hand side. It lives only during the type-checking of a mutually-recursive group of tycons; it is then zonked to a proper TyCon in zonkTcTyCon. See also Note [Kind checking recursive type and class declarations] in GHC.Tc.TyCl.

noTcTyConScopedTyVars :: [(Name, TcTyVar)] #

No scoped type variables (to be used with mkTcTyCon).

mkPrimTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	result kind Must answer `True` to `isFixedRuntimeRepKind` (i.e., no representation polymorphism). (If you need a representation-polymorphic PrimTyCon, change tcHasFixedRuntimeRep, marshalablePrimTyCon, reifyTyCon for PrimTyCons.)
-> [Role]
-> TyCon

Create an primitive TyCon, such as Int#, Type or RealWorld# Primitive TyCons are marshalable iff not lifted. If you'd like to change this, modify marshalablePrimTyCon.

mkSynonymTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	result kind
-> [Role]
-> Type
-> Bool
-> Bool
-> Bool
-> TyCon

Create a type synonym TyCon

mkFamilyTyCon #

Arguments

:: Name
-> [TyConBinder]
-> Kind	result kind
-> Maybe Name
-> FamTyConFlav
-> Maybe Class
-> Injectivity
-> TyCon

Create a type family TyCon

mkPromotedDataCon :: DataCon -> Name -> TyConRepName -> [TyConPiTyBinder] -> Kind -> [Role] -> PromDataConInfo -> TyCon #

Create a promoted data constructor TyCon Somewhat dodgily, we give it the same Name as the data constructor itself; when we pretty-print the TyCon we add a quote; see the Outputable TyCon instance

isAbstractTyCon :: TyCon -> Bool #

Test if the TyCon is algebraic but abstract (invisible data constructors)

isPrimTyCon :: TyCon -> Bool #

Does this TyCon represent something that cannot be defined in Haskell?

isAlgTyCon :: TyCon -> Bool #

Returns True if the supplied TyCon resulted from either a data or newtype declaration

isVanillaAlgTyCon :: TyCon -> Bool #

Returns True for vanilla AlgTyCons -- that is, those created with a data or newtype declaration.

isDataTyCon :: TyCon -> Bool #

Returns True for data types that are definitely represented by heap-allocated constructors. These are scrutinised by Core-level case expressions, and they get info tables allocated for them.

Generally, the function will be true for all data types and false for newtypes, unboxed tuples, unboxed sums and type family TyCons. But it is not guaranteed to return True in all cases that it could.

NB: for a data type family, only the instance TyCons get an info table. The family declaration TyCon does not

isTypeDataTyCon :: TyCon -> Bool #

Was this TyCon declared as "type data"? See Note [Type data declarations] in GHC.Rename.Module.

isInjectiveTyCon :: TyCon -> Role -> Bool #

isInjectiveTyCon is true of TyCons for which this property holds (where r is the role passed in): If (T a1 b1 c1) ~r (T a2 b2 c2), then (a1 ~r1 a2), (b1 ~r2 b2), and (c1 ~r3 c2) (where r1, r2, and r3, are the roles given by tyConRolesX tc r) See also Note [Decomposing TyConApp equalities] in GHC.Tc.Solver.Canonical

isGenerativeTyCon :: TyCon -> Role -> Bool #

isGenerativeTyCon is true of TyCons for which this property holds (where r is the role passed in): If (T tys ~r t), then (t's head ~r T). See also Note [Decomposing TyConApp equalities] in GHC.Tc.Solver.Canonical

isGenInjAlgRhs :: AlgTyConRhs -> Bool #

Is this an AlgTyConRhs of a TyCon that is generative and injective with respect to representational equality?

isNewTyCon :: TyCon -> Bool #

Is this TyCon that for a newtype

unwrapNewTyCon_maybe :: TyCon -> Maybe ([TyVar], Type, CoAxiom Unbranched) #

Take a TyCon apart into the TyVars it scopes over, the Type it expands into, and (possibly) a coercion from the representation type to the newtype. Returns Nothing if this is not possible.

unwrapNewTyConEtad_maybe :: TyCon -> Maybe ([TyVar], Type, CoAxiom Unbranched) #

isTypeSynonymTyCon :: TyCon -> Bool #

Is this a TyCon representing a regular H98 type synonym (type)?

isTauTyCon :: TyCon -> Bool #

isFamFreeTyCon :: TyCon -> Bool #

Is this tycon neither a type family nor a synonym that expands to a type family?

isForgetfulSynTyCon :: TyCon -> Bool #

Is this a forgetful type synonym? If this is a type synonym whose RHS does not mention one (or more) of its bound variables, returns True. Thus, False means that all bound variables appear on the RHS; True may not mean anything, as the test to set this flag is conservative.

tyConMustBeSaturated :: TyCon -> Bool #

True iff we can decompose (T a b c) into ((T a b) c) I.e. is it injective and generative w.r.t nominal equality? That is, if (T a b) ~N d e f, is it always the case that (T ~N d), (a ~N e) and (b ~N f)? Specifically NOT true of synonyms (open and otherwise)

It'd be unusual to call tyConMustBeSaturated on a regular H98 type synonym, because you should probably have expanded it first But regardless, it's not decomposable

isGadtSyntaxTyCon :: TyCon -> Bool #

Is this an algebraic TyCon declared with the GADT syntax?

isEnumerationTyCon :: TyCon -> Bool #

Is this an algebraic TyCon which is just an enumeration of values?

isFamilyTyCon :: TyCon -> Bool #

Is this a TyCon, synonym or otherwise, that defines a family?

isOpenFamilyTyCon :: TyCon -> Bool #

Is this a TyCon, synonym or otherwise, that defines a family with instances?

isTypeFamilyTyCon :: TyCon -> Bool #

Is this a synonym TyCon that can have may have further instances appear?

isDataFamilyTyCon :: TyCon -> Bool #

Is this a synonym TyCon that can have may have further instances appear?

isOpenTypeFamilyTyCon :: TyCon -> Bool #

Is this an open type family TyCon?

isClosedSynFamilyTyConWithAxiom_maybe :: TyCon -> Maybe (CoAxiom Branched) #

Is this a non-empty closed type family? Returns Nothing for abstract or empty closed families.

isBuiltInSynFamTyCon_maybe :: TyCon -> Maybe BuiltInSynFamily #

tyConFamilyResVar_maybe :: TyCon -> Maybe Name #

Extract type variable naming the result of injective type family

tyConInjectivityInfo :: TyCon -> Injectivity #

tyConInjectivityInfo tc returns Injective is if tc is an injective tycon (where is states for which tyConBinders tc is injective), or NotInjective otherwise.

isTyConAssoc :: TyCon -> Bool #

Is this TyCon for an associated type?

tyConAssoc_maybe :: TyCon -> Maybe TyCon #

Get the enclosing class TyCon (if there is one) for the given TyCon.

tyConFlavourAssoc_maybe :: TyConFlavour -> Maybe TyCon #

Get the enclosing class TyCon (if there is one) for the given TyConFlavour

tyConTuple_maybe :: TyCon -> Maybe TupleSort #

isBoxedTupleTyCon :: TyCon -> Bool #

Is this the TyCon for a boxed tuple?

isUnboxedSumTyCon :: TyCon -> Bool #

Is this the TyCon for an unboxed sum?

isLiftedAlgTyCon :: TyCon -> Bool #

isPromotedDataCon_maybe :: TyCon -> Maybe DataCon #

Retrieves the promoted DataCon if this is a PromotedDataCon;

isPromotedTupleTyCon :: TyCon -> Bool #

Is this the TyCon for a promoted tuple?

isPromotedDataCon :: TyCon -> Bool #

Is this a PromotedDataCon?

isDataKindsPromotedDataCon :: TyCon -> Bool #

This function identifies PromotedDataCon's from data constructors in `data T = K1 | K2`, promoted by -XDataKinds. These type constructors are printed with a tick mark 'K1 and 'K2, and similarly have a tick mark added to their OccName's.

In contrast, constructors in `type data T = K1 | K2` are printed and represented with their original undecorated names. See Note [Type data declarations] in GHC.Rename.Module

isKindTyCon :: TyCon -> Bool #

Is this tycon really meant for use at the kind level? That is, should it be permitted without -XDataKinds?

isLiftedTypeKindTyConName :: Name -> Bool #

isImplicitTyCon :: TyCon -> Bool #

Identifies implicit tycons that, in particular, do not go into interface files (because they are implicitly reconstructed when the interface is read).

Note that:

Associated families are implicit, as they are re-constructed from the class declaration in which they reside, and
Family instances are not implicit as they represent the instance body (similar to a dfun does that for a class instance).
Tuples are implicit iff they have a wired-in name (namely: boxed and unboxed tuples are wired-in and implicit, but constraint tuples are not)

tyConCType_maybe :: TyCon -> Maybe CType #

tcHasFixedRuntimeRep :: TyCon -> Bool #

Does this TyCon have a syntactically fixed RuntimeRep when fully applied, as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete?

False is safe. True means we're sure. Does only a quick check, based on the TyCon's category.

See Note [Representation-polymorphic TyCons]

isConcreteTyCon :: TyCon -> Bool #

Is this TyCon concrete (i.e. not a synonym/type family)?

Used for representation polymorphism checks.

isTcTyCon :: TyCon -> Bool #

Is this a TcTyCon? (That is, one only used during type-checking?)

setTcTyConKind :: TyCon -> Kind -> TyCon #

isMonoTcTyCon :: TyCon -> Bool #

tcTyConScopedTyVars :: TyCon -> [(Name, TcTyVar)] #

expandSynTyCon_maybe #

Arguments

:: TyCon
-> [tyco]	Arguments to `TyCon`
-> ExpandSynResult tyco	Returns a `TyVar` substitution, the body type of the synonym (not yet substituted) and any arguments remaining from the application ^ Expand a type synonym application Return Nothing if the TyCon is not a synonym, or if not enough arguments are supplied

isTyConWithSrcDataCons :: TyCon -> Bool #

Check if the tycon actually refers to a proper `data` or `newtype` with user defined constructors rather than one from a class or other construction.

tyConDataCons :: TyCon -> [DataCon] #

As tyConDataCons_maybe, but returns the empty list of constructors if no constructors could be found

tyConDataCons_maybe :: TyCon -> Maybe [DataCon] #

Determine the DataCons originating from the given TyCon, if the TyCon is the sort that can have any constructors (note: this does not include abstract algebraic types)

tyConSingleDataCon_maybe :: TyCon -> Maybe DataCon #

If the given TyCon has a single data constructor, i.e. it is a data type with one alternative, a tuple type or a newtype then that constructor is returned. If the TyCon has more than one constructor, or represents a primitive or function type constructor then Nothing is returned.

tyConSingleDataCon :: TyCon -> DataCon #

Like tyConSingleDataCon_maybe, but panics if Nothing.

tyConSingleAlgDataCon_maybe :: TyCon -> Maybe DataCon #

Like tyConSingleDataCon_maybe, but returns Nothing for newtypes.

tyConAlgDataCons_maybe :: TyCon -> Maybe [DataCon] #

Returns Just dcs if the given TyCon is a data type, a tuple type or a sum type with data constructors dcs. If the TyCon has more than one constructor, or represents a primitive or function type constructor then Nothing is returned.

Like tyConDataCons_maybe, but returns Nothing for newtypes.

tyConFamilySize :: TyCon -> Int #

Determine the number of value constructors a TyCon has. Panics if the TyCon is not algebraic or a tuple

algTyConRhs :: TyCon -> AlgTyConRhs #

Extract an AlgTyConRhs with information about data constructors from an algebraic or tuple TyCon. Panics for any other sort of TyCon

newTyConRhs :: TyCon -> ([TyVar], Type) #

Extract the bound type variables and type expansion of a type synonym TyCon. Panics if the TyCon is not a synonym

newTyConEtadArity :: TyCon -> Int #

The number of type parameters that need to be passed to a newtype to resolve it. May be less than in the definition if it can be eta-contracted.

newTyConEtadRhs :: TyCon -> ([TyVar], Type) #

Extract the bound type variables and type expansion of an eta-contracted type synonym TyCon. Panics if the TyCon is not a synonym

newTyConCo_maybe :: TyCon -> Maybe (CoAxiom Unbranched) #

Extracts the newtype coercion from such a TyCon, which can be used to construct something with the newtypes type from its representation type (right hand side). If the supplied TyCon is not a newtype, returns Nothing

newTyConCo :: TyCon -> CoAxiom Unbranched #

newTyConDataCon_maybe :: TyCon -> Maybe DataCon #

tyConStupidTheta :: TyCon -> [PredType] #

Find the "stupid theta" of the TyCon. A "stupid theta" is the context to the left of an algebraic type declaration, e.g. Eq a in the declaration data Eq a => T a .... See Note [The stupid context] in GHC.Core.DataCon.

synTyConDefn_maybe :: TyCon -> Maybe ([TyVar], Type) #

Extract the TyVars bound by a vanilla type synonym and the corresponding (unsubstituted) right hand side.

synTyConRhs_maybe :: TyCon -> Maybe Type #

Extract the information pertaining to the right hand side of a type synonym (type) declaration.

famTyConFlav_maybe :: TyCon -> Maybe FamTyConFlav #

Extract the flavour of a type family (with all the extra information that it carries)

isClassTyCon :: TyCon -> Bool #

Is this TyCon that for a class instance?

tyConClass_maybe :: TyCon -> Maybe Class #

If this TyCon is that for a class instance, return the class it is for. Otherwise returns Nothing

tyConATs :: TyCon -> [TyCon] #

Return the associated types of the TyCon, if any

isFamInstTyCon :: TyCon -> Bool #

Is this TyCon that for a data family instance?

tyConFamInstSig_maybe :: TyCon -> Maybe (TyCon, [Type], CoAxiom Unbranched) #

tyConFamInst_maybe :: TyCon -> Maybe (TyCon, [Type]) #

If this TyCon is that of a data family instance, return the family in question and the instance types. Otherwise, return Nothing

tyConFamilyCoercion_maybe :: TyCon -> Maybe (CoAxiom Unbranched) #

If this TyCon is that of a data family instance, return a TyCon which represents a coercion identifying the representation type with the type instance family. Otherwise, return Nothing

tyConPromDataConInfo :: TyCon -> PromDataConInfo #

Extract any RuntimeRepInfo from this TyCon

mkTyConTagMap :: TyCon -> NameEnv ConTag #

tyConFlavour :: TyCon -> TyConFlavour #

tcFlavourIsOpen :: TyConFlavour -> Bool #

Is this flavour of TyCon an open type family or a data family?

pprPromotionQuote :: TyCon -> SDoc #

tyConSkolem :: TyCon -> Bool #

Returns whether or not this TyCon is definite, or a hole that may be filled in at some later point. See Note [Skolem abstract data]

mkTyVarTy :: TyVar -> Type #

mkTyVarTys :: [TyVar] -> [Type] #

mkInvisFunTy :: HasDebugCallStack => Type -> Type -> Type infixr 3 #

mkInvisFunTys :: HasDebugCallStack => [Type] -> Type -> Type #

tcMkVisFunTy :: Mult -> Type -> Type -> Type #

tcMkInvisFunTy :: TypeOrConstraint -> Type -> Type -> Type #

mkVisFunTy :: HasDebugCallStack => Mult -> Type -> Type -> Type #

mkVisFunTyMany :: HasDebugCallStack => Type -> Type -> Type infixr 3 #

Make nested arrow types | Special, common, case: Arrow type with mult Many

mkVisFunTysMany :: [Type] -> Type -> Type #

mkScaledFunTys :: HasDebugCallStack => [Scaled Type] -> Type -> Type #

tcMkScaledFunTys :: [Scaled Type] -> Type -> Type #

mkForAllTys :: [ForAllTyBinder] -> Type -> Type #

Wraps foralls over the type using the provided TyCoVars from left to right

mkInvisForAllTys :: [InvisTVBinder] -> Type -> Type #

Wraps foralls over the type using the provided InvisTVBinders from left to right

mkPiTy :: PiTyBinder -> Type -> Type #

mkPiTys :: [PiTyBinder] -> Type -> Type #

coHoleCoVar :: CoercionHole -> CoVar #

setCoHoleCoVar :: CoercionHole -> CoVar -> CoercionHole #

foldTyCo :: Monoid a => TyCoFolder env a -> env -> (Type -> a, [Type] -> a, Coercion -> a, [Coercion] -> a) #

noView :: Type -> Maybe Type #

A view function that looks through nothing.

typeSize :: Type -> Int #

coercionSize :: Coercion -> Int #

primTyCons :: [TyCon] #

unexposedPrimTyCons :: [TyCon] #

Primitive TyCons that are defined in GHC.Prim but not "exposed". See Note [Unexposed TyCons]

exposedPrimTyCons :: [TyCon] #

Primitive TyCons that are defined in, and exported from, GHC.Prim.

charPrimTyConName :: Name #

intPrimTyConName :: Name #

int8PrimTyConName :: Name #

int16PrimTyConName :: Name #

int32PrimTyConName :: Name #

int64PrimTyConName :: Name #

wordPrimTyConName :: Name #

word8PrimTyConName :: Name #

word16PrimTyConName :: Name #

word32PrimTyConName :: Name #

word64PrimTyConName :: Name #

addrPrimTyConName :: Name #

floatPrimTyConName :: Name #

doublePrimTyConName :: Name #

mkTemplateKindVar :: Kind -> TyVar #

mkTemplateKindVars :: [Kind] -> [TyVar] #

mkTemplateTyVarsFrom :: Int -> [Kind] -> [TyVar] #

mkTemplateTyVars :: [Kind] -> [TyVar] #

mkTemplateTyConBinders :: [Kind] -> ([Kind] -> [Kind]) -> [TyConBinder] #

mkTemplateKiTyVars :: [Kind] -> ([Kind] -> [Kind]) -> [TyVar] #

mkTemplateKiTyVar :: Kind -> (Kind -> [Kind]) -> [TyVar] #

mkTemplateKindTyConBinders :: [Kind] -> [TyConBinder] #

mkTemplateAnonTyConBinders :: [Kind] -> [TyConBinder] #

alphaTyVars :: [TyVar] #

alphaTyVar :: TyVar #

betaTyVar :: TyVar #

gammaTyVar :: TyVar #

deltaTyVar :: TyVar #

alphaTyVarSpec :: TyVarBinder #

betaTyVarSpec :: TyVarBinder #

gammaTyVarSpec :: TyVarBinder #

deltaTyVarSpec :: TyVarBinder #

alphaConstraintTyVar :: TyVar #

alphaConstraintTy :: Type #

alphaTys :: [Type] #

alphaTy :: Type #

betaTy :: Type #

gammaTy :: Type #

deltaTy :: Type #

alphaTyVarsUnliftedRep :: [TyVar] #

alphaTyVarUnliftedRep :: TyVar #

alphaTysUnliftedRep :: [Type] #

alphaTyUnliftedRep :: Type #

runtimeRep1TyVar :: TyVar #

runtimeRep2TyVar :: TyVar #

runtimeRep3TyVar :: TyVar #

runtimeRep1TyVarInf :: TyVarBinder #

runtimeRep2TyVarInf :: TyVarBinder #

runtimeRep1Ty :: RuntimeRepType #

runtimeRep2Ty :: RuntimeRepType #

runtimeRep3Ty :: RuntimeRepType #

openAlphaTyVar :: TyVar #

openBetaTyVar :: TyVar #

openGammaTyVar :: TyVar #

openAlphaTyVarSpec :: TyVarBinder #

openBetaTyVarSpec :: TyVarBinder #

openGammaTyVarSpec :: TyVarBinder #

openAlphaTy :: Type #

openBetaTy :: Type #

openGammaTy :: Type #

levity2TyVar :: TyVar #

levity1TyVar :: TyVar #

levity1TyVarInf :: TyVarBinder #

levity2TyVarInf :: TyVarBinder #

levity1Ty :: Type #

levity2Ty :: Type #

levPolyAlphaTyVar :: TyVar #

levPolyBetaTyVar :: TyVar #

levPolyAlphaTyVarSpec :: TyVarBinder #

levPolyBetaTyVarSpec :: TyVarBinder #

levPolyAlphaTy :: Type #

levPolyBetaTy :: Type #

multiplicityTyVar1 :: TyVar #

multiplicityTyVar2 :: TyVar #

funTyFlagTyCon :: FunTyFlag -> TyCon #

isArrowTyCon :: TyCon -> Bool #

fUNTyConName :: Name #

ctArrowTyConName :: Name #

ccArrowTyConName :: Name #

tcArrowTyConName :: Name #

fUNTyCon :: TyCon #

The FUN type constructor.

FUN :: forall (m :: Multiplicity) ->
       forall {rep1 :: RuntimeRep} {rep2 :: RuntimeRep}.
       TYPE rep1 -> TYPE rep2 -> Type

The runtime representations quantification is left inferred. This means they cannot be specified with -XTypeApplications.

This is a deliberate choice to allow future extensions to the function arrow.

ctArrowTyCon :: TyCon #

ccArrowTyCon :: TyCon #

tcArrowTyCon :: TyCon #

tYPETyCon :: TyCon #

tYPETyConName :: Name #

tYPEKind :: Type #

cONSTRAINTTyCon :: TyCon #

cONSTRAINTTyConName :: Name #

cONSTRAINTKind :: Type #

charPrimTy :: Type #

charPrimTyCon :: TyCon #

intPrimTy :: Type #

intPrimTyCon :: TyCon #

int8PrimTy :: Type #

int8PrimTyCon :: TyCon #

int16PrimTy :: Type #

int16PrimTyCon :: TyCon #

int32PrimTy :: Type #

int32PrimTyCon :: TyCon #

int64PrimTy :: Type #

int64PrimTyCon :: TyCon #

wordPrimTy :: Type #

wordPrimTyCon :: TyCon #

word8PrimTy :: Type #

word8PrimTyCon :: TyCon #

word16PrimTy :: Type #

word16PrimTyCon :: TyCon #

word32PrimTy :: Type #

word32PrimTyCon :: TyCon #

word64PrimTy :: Type #

word64PrimTyCon :: TyCon #

addrPrimTy :: Type #

addrPrimTyCon :: TyCon #

floatPrimTy :: Type #

floatPrimTyCon :: TyCon #

doublePrimTy :: Type #

doublePrimTyCon :: TyCon #

mkStatePrimTy :: Type -> Type #

statePrimTyCon :: TyCon #

realWorldTyCon :: TyCon #

realWorldTy :: Type #

realWorldStatePrimTy :: Type #

mkProxyPrimTy :: Type -> Type -> Type #

proxyPrimTyCon :: TyCon #

eqPrimTyCon :: TyCon #

eqReprPrimTyCon :: TyCon #

eqPhantPrimTyCon :: TyCon #

equalityTyCon :: Role -> TyCon #

Given a Role, what TyCon is the type of equality predicates at that role?

arrayPrimTyCon :: TyCon #

mutableArrayPrimTyCon :: TyCon #

mutableByteArrayPrimTyCon :: TyCon #

byteArrayPrimTyCon :: TyCon #

smallArrayPrimTyCon :: TyCon #

smallMutableArrayPrimTyCon :: TyCon #

mkArrayPrimTy :: Type -> Type #

byteArrayPrimTy :: Type #

mkSmallArrayPrimTy :: Type -> Type #

mkMutableArrayPrimTy :: Type -> Type -> Type #

mkMutableByteArrayPrimTy :: Type -> Type #

mkSmallMutableArrayPrimTy :: Type -> Type -> Type #

mutVarPrimTyCon :: TyCon #

mkMutVarPrimTy :: Type -> Type -> Type #

ioPortPrimTyCon :: TyCon #

mkIOPortPrimTy :: Type -> Type -> Type #

mVarPrimTyCon :: TyCon #

mkMVarPrimTy :: Type -> Type -> Type #

tVarPrimTyCon :: TyCon #

mkTVarPrimTy :: Type -> Type -> Type #

stablePtrPrimTyCon :: TyCon #

mkStablePtrPrimTy :: Type -> Type #

stableNamePrimTyCon :: TyCon #

mkStableNamePrimTy :: Type -> Type #

compactPrimTyCon :: TyCon #

compactPrimTy :: Type #

stackSnapshotPrimTyCon :: TyCon #

stackSnapshotPrimTy :: Type #

bcoPrimTy :: Type #

bcoPrimTyCon :: TyCon #

weakPrimTyCon :: TyCon #

mkWeakPrimTy :: Type -> Type #

threadIdPrimTy :: Type #

threadIdPrimTyCon :: TyCon #

promptTagPrimTyCon :: TyCon #

mkPromptTagPrimTy :: Type -> Type #

int8X16PrimTy :: Type #

int8X16PrimTyCon :: TyCon #

int16X8PrimTy :: Type #

int16X8PrimTyCon :: TyCon #

int32X4PrimTy :: Type #

int32X4PrimTyCon :: TyCon #

int64X2PrimTy :: Type #

int64X2PrimTyCon :: TyCon #

int8X32PrimTy :: Type #

int8X32PrimTyCon :: TyCon #

int16X16PrimTy :: Type #

int16X16PrimTyCon :: TyCon #

int32X8PrimTy :: Type #

int32X8PrimTyCon :: TyCon #

int64X4PrimTy :: Type #

int64X4PrimTyCon :: TyCon #

int8X64PrimTy :: Type #

int8X64PrimTyCon :: TyCon #

int16X32PrimTy :: Type #

int16X32PrimTyCon :: TyCon #

int32X16PrimTy :: Type #

int32X16PrimTyCon :: TyCon #

int64X8PrimTy :: Type #

int64X8PrimTyCon :: TyCon #

word8X16PrimTy :: Type #

word8X16PrimTyCon :: TyCon #

word16X8PrimTy :: Type #

word16X8PrimTyCon :: TyCon #

word32X4PrimTy :: Type #

word32X4PrimTyCon :: TyCon #

word64X2PrimTy :: Type #

word64X2PrimTyCon :: TyCon #

word8X32PrimTy :: Type #

word8X32PrimTyCon :: TyCon #

word16X16PrimTy :: Type #

word16X16PrimTyCon :: TyCon #

word32X8PrimTy :: Type #

word32X8PrimTyCon :: TyCon #

word64X4PrimTy :: Type #

word64X4PrimTyCon :: TyCon #

word8X64PrimTy :: Type #

word8X64PrimTyCon :: TyCon #

word16X32PrimTy :: Type #

word16X32PrimTyCon :: TyCon #

word32X16PrimTy :: Type #

word32X16PrimTyCon :: TyCon #

word64X8PrimTy :: Type #

word64X8PrimTyCon :: TyCon #

floatX4PrimTy :: Type #

floatX4PrimTyCon :: TyCon #

doubleX2PrimTy :: Type #

doubleX2PrimTyCon :: TyCon #

floatX8PrimTy :: Type #

floatX8PrimTyCon :: TyCon #

doubleX4PrimTy :: Type #

doubleX4PrimTyCon :: TyCon #

floatX16PrimTy :: Type #

floatX16PrimTyCon :: TyCon #

doubleX8PrimTy :: Type #

doubleX8PrimTyCon :: TyCon #

tyCoVarsOfType :: Type -> TyCoVarSet #

tyCoVarsOfTypes :: [Type] -> TyCoVarSet #

tyCoVarsOfCo :: Coercion -> TyCoVarSet #

tyCoVarsOfCos :: [Coercion] -> TyCoVarSet #

coVarsOfType :: Type -> CoVarSet #

coVarsOfTypes :: [Type] -> CoVarSet #

coVarsOfCo :: Coercion -> CoVarSet #

closeOverKinds :: TyCoVarSet -> TyCoVarSet #

closeOverKindsList :: [TyVar] -> [TyVar] #

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministically ordered list.

closeOverKindsDSet :: DTyVarSet -> DTyVarSet #

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministic set.

tyCoVarsOfTypeDSet :: Type -> DTyCoVarSet #

tyCoFVsOfType that returns free variables of a type in a deterministic set. For explanation of why using VarSet is not deterministic see Note [Deterministic FV] in GHC.Utils.FV.

tyCoFVsOfType :: Type -> FV #

The worker for tyCoFVsOfType and tyCoFVsOfTypeList. The previous implementation used unionVarSet which is O(n+m) and can make the function quadratic. It's exported, so that it can be composed with other functions that compute free variables. See Note [FV naming conventions] in GHC.Utils.FV.

Eta-expanded because that makes it run faster (apparently) See Note [FV eta expansion] in GHC.Utils.FV for explanation.

tyCoFVsBndr :: ForAllTyBinder -> FV -> FV #

tyCoFVsVarBndrs :: [Var] -> FV -> FV #

tyCoFVsVarBndr :: Var -> FV -> FV #

tyCoVarsOfCoDSet :: Coercion -> DTyCoVarSet #

Get a deterministic set of the vars free in a coercion

tyCoFVsOfCo :: Coercion -> FV #

tyCoFVsOfCos :: [Coercion] -> FV #

anyFreeVarsOfType :: (TyCoVar -> Bool) -> Type -> Bool #

anyFreeVarsOfTypes :: (TyCoVar -> Bool) -> [Type] -> Bool #

anyFreeVarsOfCo :: (TyCoVar -> Bool) -> Coercion -> Bool #

scopedSort :: [TyCoVar] -> [TyCoVar] #

Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ]

This is a deterministic sorting operation (that is, doesn't depend on Uniques).

It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in GHC.Rename.HsType

tyCoVarsOfTypeWellScoped :: Type -> [TyVar] #

Get the free vars of a type in scoped order

tyCoVarsOfTypesWellScoped :: [Type] -> [TyVar] #

Get the free vars of types in scoped order

tyConsOfType :: Type -> UniqSet TyCon #

All type constructors occurring in the type; looking through type synonyms, but not newtypes. When it finds a Class, it returns the class TyCon.

occCheckExpand :: [Var] -> Type -> Maybe Type #

emptyTvSubstEnv :: TvSubstEnv #

emptyCvSubstEnv :: CvSubstEnv #

composeTCvSubst :: Subst -> Subst -> Subst #

Composes two substitutions, applying the second one provided first, like in function composition. This function leaves IdSubstEnv untouched because IdSubstEnv is not used during substitution for types.

emptySubst :: Subst #

mkEmptySubst :: InScopeSet -> Subst #

isEmptySubst :: Subst -> Bool #

isEmptyTCvSubst :: Subst -> Bool #

Checks whether the tyvar and covar environments are empty. This function should be used over isEmptySubst when substituting for types, because types currently do not contain expressions; we can safely disregard the expression environment when deciding whether to skip a substitution. Using isEmptyTCvSubst gives us a non-trivial performance boost (up to 70% less allocation for T18223)

mkSubst :: InScopeSet -> TvSubstEnv -> CvSubstEnv -> IdSubstEnv -> Subst #

getTvSubstEnv :: Subst -> TvSubstEnv #

getCvSubstEnv :: Subst -> CvSubstEnv #

getSubstInScope :: Subst -> InScopeSet #

Find the in-scope set: see Note [The substitution invariant]

setInScope :: Subst -> InScopeSet -> Subst #

getSubstRangeTyCoFVs :: Subst -> VarSet #

Returns the free variables of the types in the range of a substitution as a non-deterministic set.

isInScope :: Var -> Subst -> Bool #

notElemSubst :: Var -> Subst -> Bool #

zapSubst :: Subst -> Subst #

Remove all substitutions that might have been built up while preserving the in-scope set originally called zapSubstEnv

extendSubstInScope :: Subst -> Var -> Subst #

Add the Var to the in-scope set

extendSubstInScopeList :: Subst -> [Var] -> Subst #

Add the Vars to the in-scope set: see also extendInScope

extendSubstInScopeSet :: Subst -> VarSet -> Subst #

Add the Vars to the in-scope set: see also extendInScope

extendTCvSubst :: Subst -> TyCoVar -> Type -> Subst #

extendTCvSubstWithClone :: Subst -> TyCoVar -> TyCoVar -> Subst #

extendTvSubst :: Subst -> TyVar -> Type -> Subst #

Add a substitution for a TyVar to the Subst The TyVar *must* be a real TyVar, and not a CoVar You must ensure that the in-scope set is such that Note [The substitution invariant] holds after extending the substitution like this.

extendTvSubstBinderAndInScope :: Subst -> PiTyBinder -> Type -> Subst #

extendTvSubstWithClone :: Subst -> TyVar -> TyVar -> Subst #

extendCvSubst :: Subst -> CoVar -> Coercion -> Subst #

Add a substitution from a CoVar to a Coercion to the Subst: you must ensure that the in-scope set satisfies Note [The substitution invariant] after extending the substitution like this

extendTvSubstAndInScope :: Subst -> TyVar -> Type -> Subst #

extendTvSubstList :: Subst -> [(TyVar, Type)] -> Subst #

Adds multiple TyVar substitutions to the Subst: see also extendTvSubst

extendTCvSubstList :: Subst -> [Var] -> [Type] -> Subst #

unionSubst :: Subst -> Subst -> Subst #

zipTvSubst :: HasDebugCallStack => [TyVar] -> [Type] -> Subst #

Generates the in-scope set for the Subst from the types in the incoming environment. No CoVars or Ids, please!

zipTCvSubst :: HasDebugCallStack => [TyCoVar] -> [Type] -> Subst #

mkTvSubstPrs :: [(TyVar, Type)] -> Subst #

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please! The InScopeSet is just a thunk so with a bit of luck it'll never be evaluated

zipTyEnv :: HasDebugCallStack => [TyVar] -> [Type] -> TvSubstEnv #

The InScopeSet is just a thunk so with a bit of luck it'll never be evaluated

zipCoEnv :: HasDebugCallStack => [CoVar] -> [Coercion] -> CvSubstEnv #

substTyWith :: HasDebugCallStack => [TyVar] -> [Type] -> Type -> Type #

Type substitution, see zipTvSubst

substTyWithUnchecked :: [TyVar] -> [Type] -> Type -> Type #

Type substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substCoWith :: HasDebugCallStack => [TyVar] -> [Type] -> Coercion -> Coercion #

Coercion substitution, see zipTvSubst

substCoWithUnchecked :: [TyVar] -> [Type] -> Coercion -> Coercion #

Coercion substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

substTysWith :: [TyVar] -> [Type] -> [Type] -> [Type] #

Type substitution, see zipTvSubst

substTyAddInScope :: Subst -> Type -> Type #

Substitute within a Type after adding the free variables of the type to the in-scope set. This is useful for the case when the free variables aren't already in the in-scope set or easily available. See also Note [The substitution invariant].

substTy :: HasDebugCallStack => Subst -> Type -> Type #

Substitute within a Type The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyUnchecked :: Subst -> Type -> Type #

Substitute within a Type disabling the sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substScaledTy :: HasDebugCallStack => Subst -> Scaled Type -> Scaled Type #

substScaledTyUnchecked :: HasDebugCallStack => Subst -> Scaled Type -> Scaled Type #

substTys :: HasDebugCallStack => Subst -> [Type] -> [Type] #

Substitute within several Types The substitution has to satisfy the invariants described in Note [The substitution invariant].

substScaledTys :: HasDebugCallStack => Subst -> [Scaled Type] -> [Scaled Type] #

substTysUnchecked :: Subst -> [Type] -> [Type] #

Substitute within several Types disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTysUnchecked to substTys and remove this function. Please don't use in new code.

substScaledTysUnchecked :: Subst -> [Scaled Type] -> [Scaled Type] #

substTheta :: HasDebugCallStack => Subst -> ThetaType -> ThetaType #

Substitute within a ThetaType The substitution has to satisfy the invariants described in Note [The substitution invariant].

substThetaUnchecked :: Subst -> ThetaType -> ThetaType #

Substitute within a ThetaType disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substThetaUnchecked to substTheta and remove this function. Please don't use in new code.

substTyVar :: Subst -> TyVar -> Type #

substTyVarToTyVar :: HasDebugCallStack => Subst -> TyVar -> TyVar #

substTyVars :: Subst -> [TyVar] -> [Type] #

lookupTyVar :: Subst -> TyVar -> Maybe Type #

substCo :: HasDebugCallStack => Subst -> Coercion -> Coercion #

Substitute within a Coercion The substitution has to satisfy the invariants described in Note [The substitution invariant].

substCoUnchecked :: Subst -> Coercion -> Coercion #

Substitute within a Coercion disabling sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

substCos :: HasDebugCallStack => Subst -> [Coercion] -> [Coercion] #

Substitute within several Coercions The substitution has to satisfy the invariants described in Note [The substitution invariant].

substCoVar :: Subst -> CoVar -> Coercion #

substCoVars :: Subst -> [CoVar] -> [Coercion] #

lookupCoVar :: Subst -> Var -> Maybe Coercion #

substTyVarBndr :: HasDebugCallStack => Subst -> TyVar -> (Subst, TyVar) #

substTyVarBndrs :: HasDebugCallStack => Subst -> [TyVar] -> (Subst, [TyVar]) #

substVarBndr :: HasDebugCallStack => Subst -> TyCoVar -> (Subst, TyCoVar) #

substVarBndrs :: HasDebugCallStack => Subst -> [TyCoVar] -> (Subst, [TyCoVar]) #

substCoVarBndr :: HasDebugCallStack => Subst -> CoVar -> (Subst, CoVar) #

cloneTyVarBndr :: Subst -> TyVar -> Unique -> (Subst, TyVar) #

cloneTyVarBndrs :: Subst -> [TyVar] -> UniqSupply -> (Subst, [TyVar]) #

substTyCoBndr :: Subst -> PiTyBinder -> (Subst, PiTyBinder) #

tidyVarBndrs :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar]) #

This tidies up a type for printing in an error message, or in an interface file.

It doesn't change the uniques at all, just the print names.

tidyVarBndr :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar) #

tidyForAllTyBinder :: TidyEnv -> VarBndr TyCoVar vis -> (TidyEnv, VarBndr TyCoVar vis) #

tidyForAllTyBinders :: TidyEnv -> [VarBndr TyCoVar vis] -> (TidyEnv, [VarBndr TyCoVar vis]) #

tidyFreeTyCoVars :: TidyEnv -> [TyCoVar] -> TidyEnv #

Add the free TyVars to the env in tidy form, so that we can tidy the type they are free in

tidyOpenTyCoVars :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar]) #

tidyOpenTyCoVar :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar) #

Treat a new TyCoVar as a binder, and give it a fresh tidy name using the environment if one has not already been allocated. See also tidyVarBndr

tidyTyCoVarOcc :: TidyEnv -> TyCoVar -> TyCoVar #

tidyTypes :: TidyEnv -> [Type] -> [Type] #

Tidy a list of Types

See Note [Strictness in tidyType and friends]

tidyType :: TidyEnv -> Type -> Type #

Tidy a Type

See Note [Strictness in tidyType and friends]

tidyOpenTypes :: TidyEnv -> [Type] -> (TidyEnv, [Type]) #

Grabs the free type variables, tidies them and then uses tidyType to work over the type itself

tidyOpenType :: TidyEnv -> Type -> (TidyEnv, Type) #

tidyTopType :: Type -> Type #

Calls tidyType on a top-level type (i.e. with an empty tidying environment)

tidyCo :: TidyEnv -> Coercion -> Coercion #

Tidy a Coercion

See Note [Strictness in tidyType and friends]

tidyCos :: TidyEnv -> [Coercion] -> [Coercion] #

kindRep :: HasDebugCallStack => Kind -> RuntimeRepType #

Extract the RuntimeRep classifier of a type from its kind. For example, kindRep * = LiftedRep; Panics if this is not possible. Treats * and Constraint as the same

kindRep_maybe :: HasDebugCallStack => Kind -> Maybe RuntimeRepType #

Given a kind (TYPE rr) or (CONSTRAINT rr), extract its RuntimeRep classifier rr. For example, kindRep_maybe * = Just LiftedRep Returns Nothing if the kind is not of form (TYPE rr)

isUnliftedTypeKind :: Kind -> Bool #

Returns True if the kind classifies unlifted types (like 'Int#') and False otherwise. Note that this returns False for representation-polymorphic kinds, which may be specialized to a kind that classifies unlifted types.

pickyIsLiftedTypeKind :: Kind -> Bool #

kindBoxedRepLevity_maybe :: Type -> Maybe Levity #

Check whether a kind is of the form `TYPE (BoxedRep Lifted)` or `TYPE (BoxedRep Unlifted)`.

Returns:

`Just Lifted` for `TYPE (BoxedRep Lifted)` and Type,
`Just Unlifted` for `TYPE (BoxedRep Unlifted)` and UnliftedType,
Nothing for anything else, e.g. `TYPE IntRep`, `TYPE (BoxedRep l)`, etc.

isLiftedRuntimeRep :: RuntimeRepType -> Bool #

Check whether a type of kind RuntimeRep is lifted.

isLiftedRuntimeRep is:

True of LiftedRep :: RuntimeRep
False of type variables, type family applications, and of other reps such as IntRep :: RuntimeRep.

isUnliftedRuntimeRep :: RuntimeRepType -> Bool #

Check whether a type of kind RuntimeRep is unlifted.

True of definitely unlifted RuntimeReps such as UnliftedRep, IntRep, FloatRep, ...
False of LiftedRep,
False for type variables and type family applications.

isLiftedLevity :: Type -> Bool #

isUnliftedLevity :: Type -> Bool #

isRuntimeRepVar :: TyVar -> Bool #

Is a tyvar of type RuntimeRep?

isLevityVar :: TyVar -> Bool #

Is a tyvar of type PromDataConInfo?

isMultiplicityVar :: TyVar -> Bool #

Is a tyvar of type Multiplicity?

splitRuntimeRep_maybe :: RuntimeRepType -> Maybe (TyCon, [Type]) #

(splitRuntimeRep_maybe rr) takes a Type rr :: RuntimeRep, and returns the (TyCon,[Type]) for the RuntimeRep, if possible, where the TyCon is one of the promoted DataCons of RuntimeRep. Remember: the unique on TyCon that is a a promoted DataCon is the same as the unique on the DataCon See Note [Promoted data constructors] in GHC.Core.TyCon May not be possible if rr is a type variable or type family application

isBoxedRuntimeRep :: RuntimeRepType -> Bool #

See isBoxedRuntimeRep_maybe.

runtimeRepLevity_maybe :: RuntimeRepType -> Maybe Levity #

Check whether a type of kind RuntimeRep is lifted, unlifted, or unknown.

`isLiftedRuntimeRep rr` returns:

`Just Lifted` if rr is `LiftedRep :: RuntimeRep`
`Just Unlifted` if rr is definitely unlifted, e.g. IntRep
Nothing if not known (e.g. it's a type variable or a type family application).

levityType_maybe :: LevityType -> Maybe Levity #

levity_maybe takes a Type of kind Levity, and returns its levity May not be possible for a type variable or type family application

mapTyCo :: Monad m => TyCoMapper () m -> (Type -> m Type, [Type] -> m [Type], Coercion -> m Coercion, [Coercion] -> m [Coercion]) #

mapTyCoX :: Monad m => TyCoMapper env m -> (env -> Type -> m Type, env -> [Type] -> m [Type], env -> Coercion -> m Coercion, env -> [Coercion] -> m [Coercion]) #

getTyVar :: HasDebugCallStack => Type -> TyVar #

Attempts to obtain the type variable underlying a Type, and panics with the given message if this is not a type variable type. See also getTyVar_maybe

repGetTyVar_maybe :: Type -> Maybe TyVar #

Attempts to obtain the type variable underlying a Type, without any expansion

isTyVarTy :: Type -> Bool #

getCastedTyVar_maybe :: Type -> Maybe (TyVar, CoercionN) #

If the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind ty

mkAppTys :: Type -> [Type] -> Type #

splitAppTy_maybe :: Type -> Maybe (Type, Type) #

Attempt to take a type application apart, whether it is a function, type constructor, or plain type application. Note that type family applications are NEVER unsaturated by this!

splitAppTy :: Type -> (Type, Type) #

Attempts to take a type application apart, as in splitAppTy_maybe, and panics if this is not possible

splitAppTyNoView_maybe :: HasDebugCallStack => Type -> Maybe (Type, Type) #

Does the AppTy split as in splitAppTy_maybe, but assumes that any coreView stuff is already done

tcSplitAppTyNoView_maybe :: Type -> Maybe (Type, Type) #

Just like splitAppTyNoView_maybe, but does not split (c => t) See Note [Decomposing fat arrow c=>t]

splitAppTys :: Type -> (Type, [Type]) #

Recursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.

splitAppTysNoView :: HasDebugCallStack => Type -> (Type, [Type]) #

Like splitAppTys, but doesn't look through type synonyms

mkNumLitTy :: Integer -> Type #

isNumLitTy :: Type -> Maybe Integer #

Is this a numeric literal. We also look through type synonyms.

mkStrLitTy :: FastString -> Type #

isStrLitTy :: Type -> Maybe FastString #

Is this a symbol literal. We also look through type synonyms.

mkCharLitTy :: Char -> Type #

isCharLitTy :: Type -> Maybe Char #

Is this a char literal? We also look through type synonyms.

isLitTy :: Type -> Maybe TyLit #

Is this a type literal (symbol, numeric, or char)?

userTypeError_maybe :: Type -> Maybe Type #

Is this type a custom user error? If so, give us the kind and the error message.

pprUserTypeErrorTy :: Type -> SDoc #

Render a type corresponding to a user type error into a SDoc.

funTyConAppTy_maybe :: FunTyFlag -> Type -> Type -> Type -> Maybe (TyCon, [Type]) #

Given the components of a FunTy figure out the corresponding TyConApp.

tyConAppFunTy_maybe :: HasDebugCallStack => TyCon -> [Type] -> Maybe Type #

Return Just if this TyConApp should be represented as a FunTy

tyConAppFunCo_maybe :: HasDebugCallStack => Role -> TyCon -> [Coercion] -> Maybe Coercion #

Return Just if this TyConAppCo should be represented as a FunCo

mkFunctionType :: HasDebugCallStack => Mult -> Type -> Type -> Type #

This one works out the FunTyFlag from the argument type See GHC.Types.Var Note [FunTyFlag]

mkScaledFunctionTys :: [Scaled Type] -> Type -> Type #

Like mkFunctionType, compute the FunTyFlag from the arguments

splitFunTy :: Type -> (Mult, Type, Type) #

Attempts to extract the multiplicity, argument and result types from a type, and panics if that is not possible. See also splitFunTy_maybe

splitFunTy_maybe :: Type -> Maybe (FunTyFlag, Mult, Type, Type) #

Attempts to extract the multiplicity, argument and result types from a type

splitFunTys :: Type -> ([Scaled Type], Type) #

funArgTy :: Type -> Type #

Just like piResultTys but for a single argument Try not to iterate piResultTy, because it's inefficient to substitute one variable at a time; instead use 'piResultTys"

Extract the function argument type and panic if that is not possible

piResultTys :: HasDebugCallStack => Type -> [Type] -> Type #

(piResultTys f_ty [ty1, .., tyn]) gives the type of (f ty1 .. tyn) where f :: f_ty piResultTys is interesting because: 1. f_ty may have more for-alls than there are args 2. Less obviously, it may have fewer for-alls For case 2. think of: piResultTys (forall a.a) [forall b.b, Int] This really can happen, but only (I think) in situations involving undefined. For example: undefined :: forall a. a Term: undefined (forall b. b->b) Int This term should have type (Int -> Int), but notice that there are more type args than foralls in undefineds type.

applyTysX :: HasDebugCallStack => [TyVar] -> Type -> [Type] -> Type #

tyConAppTyConPicky_maybe :: Type -> Maybe TyCon #

Retrieve the tycon heading this type, if there is one. Does not look through synonyms.

tyConAppTyCon :: HasDebugCallStack => Type -> TyCon #

tyConAppArgs_maybe :: Type -> Maybe [Type] #

The same as snd . splitTyConApp

tyConAppArgs :: HasCallStack => Type -> [Type] #

splitTyConAppNoView_maybe :: Type -> Maybe (TyCon, [Type]) #

tcSplitTyConApp_maybe :: HasCallStack => Type -> Maybe (TyCon, [Type]) #

tcSplitTyConApp_maybe splits a type constructor application into its type constructor and applied types.

Differs from splitTyConApp_maybe in that it does *not* split types headed with (=>), as that's not a TyCon in the type-checker.

Note that this may fail (in funTyConAppTy_maybe) in the case of a FunTy with an argument of unknown kind FunTy (e.g. `FunTy (a :: k) Int`, since the kind of a isn't of the form `TYPE rep`. This isn't usually a problem but may be temporarily the cas during canonicalization: see Note [Decomposing FunTy] in GHC.Tc.Solver.Canonical and Note [The Purely Kinded Type Invariant (PKTI)] in GHC.Tc.Gen.HsType, Wrinkle around FunTy

Consequently, you may need to zonk your type before using this function.

tcSplitTyConApp :: Type -> (TyCon, [Type]) #

newTyConInstRhs :: TyCon -> [Type] -> Type #

Unwrap one layer of newtype on a type constructor and its arguments, using an eta-reduced version of the newtype if possible. This requires tys to have at least newTyConInstArity tycon elements.

splitCastTy_maybe :: Type -> Maybe (Type, Coercion) #

isCoercionTy_maybe :: Type -> Maybe Coercion #

stripCoercionTy :: Type -> Coercion #

tyConBindersPiTyBinders :: [TyConBinder] -> [PiTyBinder] #

mkTyCoInvForAllTy :: TyCoVar -> Type -> Type #

Make a dependent forall over an Inferred variable

mkInfForAllTy :: TyVar -> Type -> Type #

Like mkTyCoInvForAllTy, but tv should be a tyvar

mkTyCoInvForAllTys :: [TyCoVar] -> Type -> Type #

Like mkForAllTys, but assumes all variables are dependent and Inferred, a common case

mkInfForAllTys :: [TyVar] -> Type -> Type #

Like mkTyCoInvForAllTys, but tvs should be a list of tyvar

mkSpecForAllTy :: TyVar -> Type -> Type #

Like mkForAllTy, but assumes the variable is dependent and Specified, a common case

mkSpecForAllTys :: [TyVar] -> Type -> Type #

Like mkForAllTys, but assumes all variables are dependent and Specified, a common case

mkVisForAllTys :: [TyVar] -> Type -> Type #

Like mkForAllTys, but assumes all variables are dependent and visible

mkTyConBindersPreferAnon #

Arguments

:: [TyVar]	binders
-> TyCoVarSet	free variables of result
-> [TyConBinder]

Given a list of type-level vars and the free vars of a result kind, makes PiTyBinders, preferring anonymous binders if the variable is, in fact, not dependent. e.g. mkTyConBindersPreferAnon (k:*),(b:k),(c:k) We want (k:*) Named, (b:k) Anon, (c:k) Anon

All non-coercion binders are visible.

splitForAllForAllTyBinders :: Type -> ([ForAllTyBinder], Type) #

Take a ForAllTy apart, returning the binders and result type

splitForAllTyCoVars :: Type -> ([TyCoVar], Type) #

Take a ForAllTy apart, returning the list of tycovars and the result type. This always succeeds, even if it returns only an empty list. Note that the result type returned may have free variables that were bound by a forall.

splitForAllTyVars :: Type -> ([TyVar], Type) #

Like splitForAllTyCoVars, but split only for tyvars. This always succeeds, even if it returns only an empty list. Note that the result type returned may have free variables that were bound by a forall.

splitForAllReqTyBinders :: Type -> ([ReqTyBinder], Type) #

Like splitForAllTyCoVars, but only splits ForAllTys with Required type variable binders. Furthermore, each returned tyvar is annotated with ().

splitForAllInvisTyBinders :: Type -> ([InvisTyBinder], Type) #

Like splitForAllTyCoVars, but only splits ForAllTys with Invisible type variable binders. Furthermore, each returned tyvar is annotated with its Specificity.

isForAllTy :: Type -> Bool #

Checks whether this is a proper forall (with a named binder)

isForAllTy_ty :: Type -> Bool #

Like isForAllTy, but returns True only if it is a tyvar binder

isForAllTy_co :: Type -> Bool #

Like isForAllTy, but returns True only if it is a covar binder

isPiTy :: Type -> Bool #

Is this a function or forall?

isFunTy :: Type -> Bool #

Is this a function?

splitForAllTyCoVar :: Type -> (TyCoVar, Type) #

Take a forall type apart, or panics if that is not possible.

dropForAlls :: Type -> Type #

Drops all ForAllTys

splitForAllTyCoVar_maybe :: Type -> Maybe (TyCoVar, Type) #

Attempts to take a forall type apart, but only if it's a proper forall, with a named binder

splitForAllTyVar_maybe :: Type -> Maybe (TyVar, Type) #

Like splitForAllTyCoVar_maybe, but only returns Just if it is a tyvar binder.

splitForAllCoVar_maybe :: Type -> Maybe (CoVar, Type) #

Like splitForAllTyCoVar_maybe, but only returns Just if it is a covar binder.

splitPiTy_maybe :: Type -> Maybe (PiTyBinder, Type) #

Attempts to take a forall type apart; works with proper foralls and functions

splitPiTy :: Type -> (PiTyBinder, Type) #

Takes a forall type apart, or panics

splitPiTys :: Type -> ([PiTyBinder], Type) #

Split off all PiTyBinders to a type, splitting both proper foralls and functions

getRuntimeArgTys :: Type -> [(Scaled Type, FunTyFlag)] #

Extracts a list of run-time arguments from a function type, looking through newtypes to the right of arrows.

Examples:

   newtype Identity a = I a

   getRuntimeArgTys (Int -> Bool -> Double) == [(Int, FTF_T_T), (Bool, FTF_T_T)]
   getRuntimeArgTys (Identity Int -> Bool -> Double) == [(Identity Int, FTF_T_T), (Bool, FTF_T_T)]
   getRuntimeArgTys (Int -> Identity (Bool -> Identity Double)) == [(Int, FTF_T_T), (Bool, FTF_T_T)]
   getRuntimeArgTys (forall a. Show a => Identity a -> a -> Int -> Bool)
            == [(Show a, FTF_C_T), (Identity a, FTF_T_T),(a, FTF_T_T),(Int, FTF_T_T)]

Note that, in the last case, the returned types might mention an out-of-scope type variable. This function is used only when we really care about the kinds of the returned types, so this is OK.

*Warning**: this function can return an infinite list. For example:

  newtype N a = MkN (a -> N a)
  getRuntimeArgTys (N a) == repeat (a, FTF_T_T)

invisibleTyBndrCount :: Type -> Int #

splitInvisPiTys :: Type -> ([PiTyBinder], Type) #

Like splitPiTys, but returns only *invisible* binders, including constraints. Stops at the first visible binder.

splitInvisPiTysN :: Int -> Type -> ([PiTyBinder], Type) #

Same as splitInvisPiTys, but stop when - you have found n PiTyBinders, - or you run out of invisible binders

filterOutInvisibleTypes :: TyCon -> [Type] -> [Type] #

Given a TyCon and a list of argument types, filter out any invisible (i.e., Inferred or Specified) arguments.

filterOutInferredTypes :: TyCon -> [Type] -> [Type] #

Given a TyCon and a list of argument types, filter out any Inferred arguments.

partitionInvisibles :: [(a, ForAllTyFlag)] -> ([a], [a]) #

Given a list of things paired with their visibilities, partition the things into (invisible things, visible things).

tyConForAllTyFlags :: TyCon -> [Type] -> [ForAllTyFlag] #

Given a TyCon and a list of argument types to which the TyCon is applied, determine each argument's visibility (Inferred, Specified, or Required).

Wrinkle: consider the following scenario:

T :: forall k. k -> k
tyConForAllTyFlags T [forall m. m -> m -> m, S, R, Q]

After substituting, we get

T (forall m. m -> m -> m) :: (forall m. m -> m -> m) -> forall n. n -> n -> n

Thus, the first argument is invisible, S is visible, R is invisible again, and Q is visible.

appTyForAllTyFlags :: Type -> [Type] -> [ForAllTyFlag] #

Given a Type and a list of argument types to which the Type is applied, determine each argument's visibility (Inferred, Specified, or Required).

Most of the time, the arguments will be Required, but not always. Consider f :: forall a. a -> Type. In f Type Bool, the first argument (Type) is Specified and the second argument (Bool) is Required. It is precisely this sort of higher-rank situation in which appTyForAllTyFlags comes in handy, since f Type Bool would be represented in Core using AppTys. (See also #15792).

isTauTy :: Type -> Bool #

isAtomicTy :: Type -> Bool #

mkFamilyTyConApp :: TyCon -> [Type] -> Type #

Given a family instance TyCon and its arg types, return the corresponding family type. E.g:

data family T a
data instance T (Maybe b) = MkT b

Where the instance tycon is :RTL, so:

mkFamilyTyConApp :RTL Int  =  T (Maybe Int)

coAxNthLHS :: forall (br :: BranchFlag). CoAxiom br -> Int -> Type #

Get the type on the LHS of a coercion induced by a type/data family instance.

isFamFreeTy :: Type -> Bool #

isCoVarType :: Type -> Bool #

Does this type classify a core (unlifted) Coercion? At either role nominal or representational (t1 ~# t2) or (t1 ~R# t2) See Note [Types for coercions, predicates, and evidence] in GHC.Core.TyCo.Rep

buildSynTyCon #

Arguments

:: Name
-> [KnotTied TyConBinder]
-> Kind	result kind
-> [Role]
-> KnotTied Type
-> TyCon

isUnliftedType :: HasDebugCallStack => Type -> Bool #

Is the given type definitely unlifted? See Type for what an unlifted type is.

Panics on representation-polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of representation polymorphism.

mightBeLiftedType :: Type -> Bool #

Returns:

False if the type is guaranteed unlifted or
True if it lifted, OR we aren't sure (e.g. in a representation-polymorphic case)

mightBeUnliftedType :: Type -> Bool #

Returns:

False if the type is guaranteed lifted or
True if it is unlifted, OR we aren't sure (e.g. in a representation-polymorphic case)

isBoxedType :: Type -> Bool #

See Type for what a boxed type is. Panics on representation-polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of representation polymorphism.

isRuntimeRepKindedTy :: Type -> Bool #

Is this a type of kind RuntimeRep? (e.g. LiftedRep)

dropRuntimeRepArgs :: [Type] -> [Type] #

Drops prefix of RuntimeRep constructors in TyConApps. Useful for e.g. dropping 'LiftedRep arguments of unboxed tuple TyCon applications:

dropRuntimeRepArgs [ 'LiftedRep, 'IntRep , String, Int# ] == [String, Int#]

getRuntimeRep :: HasDebugCallStack => Type -> RuntimeRepType #

Extract the RuntimeRep classifier of a type. For instance, getRuntimeRep_maybe Int = LiftedRep. Panics if this is not possible.

isUnboxedTupleType :: Type -> Bool #

isUnboxedSumType :: Type -> Bool #

isDataFamilyAppType :: Type -> Bool #

Check whether a type is a data family type

isStrictType :: HasDebugCallStack => Type -> Bool #

Computes whether an argument (or let right hand side) should be computed strictly or lazily, based only on its type. Currently, it's just isUnliftedType. Panics on representation-polymorphic types.

isPrimitiveType :: Type -> Bool #

Returns true of types that are opaque to Haskell.

isValidJoinPointType :: JoinArity -> Type -> Bool #

Determine whether a type could be the type of a join point of given total arity, according to the polymorphism rule. A join point cannot be polymorphic in its return type, since given join j a b x y z = e1 in e2, the types of e1 and e2 must be the same, and a and b are not in scope for e2. (See Note [The polymorphism rule of join points] in GHC.Core.) Returns False also if the type simply doesn't have enough arguments.

Note that we need to know how many arguments (type *and* value) the putative join point takes; for instance, if j :: forall a. a -> Int then j could be a binary join point returning an Int, but it could *not* be a unary join point returning a -> Int.

TODO: See Note [Excess polymorphism and join points]

seqType :: Type -> () #

seqTypes :: [Type] -> () #

sORTKind_maybe :: Kind -> Maybe (TypeOrConstraint, Type) #

isTYPEorCONSTRAINT :: Kind -> Bool #

Does this classify a type allowed to have values? Responds True to things like *, TYPE Lifted, TYPE IntRep, TYPE v, Constraint.

True of a kind `TYPE _` or `CONSTRAINT _`

tyConIsTYPEorCONSTRAINT :: TyCon -> Bool #

isConstraintLikeKind :: Kind -> Bool #

isConstraintKind :: Kind -> Bool #

tcIsLiftedTypeKind :: Kind -> Bool #

Is this kind equivalent to Type i.e. TYPE LiftedRep?

tcIsBoxedTypeKind :: Kind -> Bool #

Is this kind equivalent to TYPE (BoxedRep l) for some l :: Levity?

isTypeLikeKind :: Kind -> Bool #

Is this kind equivalent to TYPE r (for some unknown r)?

This considers Constraint to be distinct from *.

returnsConstraintKind :: Kind -> Bool #

typeHasFixedRuntimeRep :: HasDebugCallStack => Type -> Bool #

Returns True if a type has a syntactically fixed runtime rep, as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.

This function is equivalent to `isFixedRuntimeRepKind . typeKind` but much faster.

Precondition: The type has kind (TYPE blah)

argsHaveFixedRuntimeRep :: Type -> Bool #

True if the argument types of this function type all have a fixed-runtime-rep

isFixedRuntimeRepKind :: HasDebugCallStack => Kind -> Bool #

Checks that a kind of the form Type, Constraint or 'TYPE r is concrete. See isConcrete.

Precondition: The type has kind `TYPE blah` or `CONSTRAINT blah`

isConcrete :: Type -> Bool #

Tests whether the given type is concrete, i.e. it whether it consists only of concrete type constructors, concrete type variables, and applications.

See Note [Concrete types] in GHC.Tc.Utils.Concrete.

tyConAppNeedsKindSig #

Arguments

:: Bool	Should specified binders count towards injective positions in the kind of the TyCon? (If you're using visible kind applications, then you want True here.
-> TyCon
-> Int	The number of args the `TyCon` is applied to.
-> Bool	Does `T t_1 ... t_n` need a kind signature? (Where `n` is the number of arguments)

Does a TyCon (that is applied to some number of arguments) need to be ascribed with an explicit kind signature to resolve ambiguity if rendered as a source-syntax type? (See Note [When does a tycon application need an explicit kind signature?] for a full explanation of what this function checks for.)

unrestricted :: a -> Scaled a #

Scale a payload by Many

linear :: a -> Scaled a #

Scale a payload by One

tymult :: a -> Scaled a #

Scale a payload by Many; used for type arguments in core

irrelevantMult :: Scaled a -> a #

mkScaled :: Mult -> a -> Scaled a #

scaledSet :: Scaled a -> b -> Scaled b #

isManyTy :: Mult -> Bool #

isOneTy :: Mult -> Bool #

isLinearType :: Type -> Bool #

isLinear t returns True of a if t is a type of (curried) function where at least one argument is linear (or otherwise non-unrestricted). We use this function to check whether it is safe to eta reduce an Id in CorePrep. It is always safe to return True, because True deactivates the optimisation.

mkTYPEapp :: RuntimeRepType -> Type #

mkTYPEapp_maybe :: RuntimeRepType -> Maybe Type #

Given a RuntimeRep, applies TYPE to it. On the fly it rewrites TYPE LiftedRep --> liftedTypeKind (a synonym) TYPE UnliftedRep --> unliftedTypeKind (ditto) TYPE ZeroBitRep --> zeroBitTypeKind (ditto) NB: no need to check for TYPE (BoxedRep Lifted), TYPE (BoxedRep Unlifted) because those inner types should already have been rewritten to LiftedRep and UnliftedRep respectively, by mkTyConApp

see Note [TYPE and CONSTRAINT] in GHC.Builtin.Types.Prim. See Note [Using synonyms to compress types] in GHC.Core.Type

mkCONSTRAINTapp :: RuntimeRepType -> Type #

Just like mkTYPEapp

mkCONSTRAINTapp_maybe :: RuntimeRepType -> Maybe Type #

Just like mkTYPEapp_maybe

mkBoxedRepApp_maybe :: LevityType -> Maybe Type #

Given a PromDataConInfo, apply BoxedRep to it On the fly, rewrite BoxedRep Lifted --> liftedRepTy (a synonym) BoxedRep Unlifted --> unliftedRepTy (ditto) See Note [TYPE and CONSTRAINT] in GHC.Builtin.Types.Prim. See Note [Using synonyms to compress types] in GHC.Core.Type

mkTupleRepApp_maybe :: Type -> Maybe Type #

Given a `[RuntimeRep]`, apply TupleRep to it On the fly, rewrite TupleRep [] -> zeroBitRepTy (a synonym) See Note [TYPE and CONSTRAINT] in GHC.Builtin.Types.Prim. See Note [Using synonyms to compress types] in GHC.Core.Type

typeOrConstraintKind :: TypeOrConstraint -> RuntimeRepType -> Kind #

negateOverLitVal :: OverLitVal -> OverLitVal #

ifaceBndrName :: IfaceBndr -> IfLclName #

mkIfaceForAllTvBndr :: ForAllTyFlag -> IfaceTvBndr -> IfaceForAllBndr #

Make an IfaceForAllBndr from an IfaceTvBndr.

mkIfaceTyConKind :: [IfaceTyConBinder] -> IfaceKind -> IfaceKind #

Build the tyConKind from the binders and the result kind. Keep in sync with mkTyConKind in GHC.Core.TyCon.

ifaceForAllSpecToBndrs :: [IfaceForAllSpecBndr] -> [IfaceForAllBndr] #

ifaceForAllSpecToBndr :: IfaceForAllSpecBndr -> IfaceForAllBndr #

mkIfaceTyConInfo :: PromotionFlag -> IfaceTyConSort -> IfaceTyConInfo #

isIfaceLiftedTypeKind :: IfaceKind -> Bool #

Returns true for Type or (TYPE LiftedRep)

splitIfaceSigmaTy :: IfaceType -> ([IfaceForAllBndr], [IfacePredType], IfaceType) #

suppressIfaceInvisibles :: PrintExplicitKinds -> [IfaceTyConBinder] -> [a] -> [a] #

stripIfaceInvisVars :: PrintExplicitKinds -> [IfaceTyConBinder] -> [IfaceTyConBinder] #

ifForAllBndrVar :: IfaceForAllBndr -> IfaceBndr #

Extract an IfaceBndr from an IfaceForAllBndr.

ifForAllBndrName :: IfaceForAllBndr -> IfLclName #

Extract the variable name from an IfaceForAllBndr.

ifTyConBinderVar :: IfaceTyConBinder -> IfaceBndr #

Extract an IfaceBndr from an IfaceTyConBinder.

ifTyConBinderName :: IfaceTyConBinder -> IfLclName #

Extract the variable name from an IfaceTyConBinder.

mkIfaceTySubst :: [(IfLclName, IfaceType)] -> IfaceTySubst #

inDomIfaceTySubst :: IfaceTySubst -> IfaceTvBndr -> Bool #

substIfaceAppArgs :: IfaceTySubst -> IfaceAppArgs -> IfaceAppArgs #

substIfaceTyVar :: IfaceTySubst -> IfLclName -> IfaceType #

stripInvisArgs :: PrintExplicitKinds -> IfaceAppArgs -> IfaceAppArgs #

appArgsIfaceTypes :: IfaceAppArgs -> [IfaceType] #

appArgsIfaceTypesForAllTyFlags :: IfaceAppArgs -> [(IfaceType, ForAllTyFlag)] #

pprIfacePrefixApp :: PprPrec -> SDoc -> [SDoc] -> SDoc #

isIfaceRhoType :: IfaceType -> Bool #

pprIfaceBndrs :: [IfaceBndr] -> SDoc #

pprIfaceLamBndr :: IfaceLamBndr -> SDoc #

pprIfaceIdBndr :: IfaceIdBndr -> SDoc #

pprIfaceTvBndr :: IfaceTvBndr -> SuppressBndrSig -> UseBndrParens -> SDoc #

pprIfaceTyConBinders :: SuppressBndrSig -> [IfaceTyConBinder] -> SDoc #

pprIfaceType :: IfaceType -> SDoc #

pprParendIfaceType :: IfaceType -> SDoc #

pprPrecIfaceType :: PprPrec -> IfaceType -> SDoc #

pprTypeArrow :: FunTyFlag -> IfaceMult -> SDoc #

many_ty :: IfaceType #

The type 'Many :: Multiplicity'.

pprIfaceAppArgs :: IfaceAppArgs -> SDoc #

pprParendIfaceAppArgs :: IfaceAppArgs -> SDoc #

pprIfaceForAllPart :: [IfaceForAllBndr] -> [IfacePredType] -> SDoc -> SDoc #

pprIfaceForAllPartMust :: [IfaceForAllBndr] -> [IfacePredType] -> SDoc -> SDoc #

Like pprIfaceForAllPart, but always uses an explicit forall.

pprIfaceForAll :: [IfaceForAllBndr] -> SDoc #

Render the "forall ... ." or "forall ... ->" bit of a type.

pprIfaceSigmaType :: ShowForAllFlag -> IfaceType -> SDoc #

pprUserIfaceForAll :: [IfaceForAllBndr] -> SDoc #

pprIfaceTypeApp :: PprPrec -> IfaceTyCon -> IfaceAppArgs -> SDoc #

pprTyTcApp :: PprPrec -> IfaceTyCon -> IfaceAppArgs -> SDoc #

pprIfaceCoTcApp :: PprPrec -> IfaceTyCon -> [IfaceCoercion] -> SDoc #

pprIfaceTyLit :: IfaceTyLit -> SDoc #

pprIfaceCoercion :: IfaceCoercion -> SDoc #

pprParendIfaceCoercion :: IfaceCoercion -> SDoc #

pprIfaceContextArr :: [IfacePredType] -> SDoc #

Prints "(C a, D b) =>", including the arrow. Used when we want to print a context in a type, so we use funPrec to decide whether to parenthesise a singleton predicate; e.g. Num a => a -> a

pprIfaceContext :: PprPrec -> [IfacePredType] -> SDoc #

Prints a context or () if empty You give it the context precedence

instanceCantMatch :: [RoughMatchTc] -> [RoughMatchTc] -> Bool #

roughMatchTcs :: [Type] -> [RoughMatchTc] #

pprParendType :: Type -> SDoc #

pprTidiedType :: Type -> SDoc #

pprPrecType :: PprPrec -> Type -> SDoc #

pprPrecTypeX :: TidyEnv -> PprPrec -> Type -> SDoc #

pprParendKind :: Kind -> SDoc #

pprParendCo :: Coercion -> SDoc #

pprClassPred :: Class -> [Type] -> SDoc #

pprTheta :: ThetaType -> SDoc #

pprParendTheta :: ThetaType -> SDoc #

pprThetaArrowTy :: ThetaType -> SDoc #

pprSigmaType :: Type -> SDoc #

pprForAll :: [ForAllTyBinder] -> SDoc #

pprUserForAll :: [ForAllTyBinder] -> SDoc #

Print a user-level forall; see Note [When to print foralls] in GHC.Iface.Type.

pprTCvBndrs :: [ForAllTyBinder] -> SDoc #

pprTCvBndr :: ForAllTyBinder -> SDoc #

pprTyVars :: [TyVar] -> SDoc #

pprDataCons :: TyCon -> SDoc #

pprTypeApp :: TyCon -> [Type] -> SDoc #

pprWithExplicitKindsWhen :: Bool -> SDoc -> SDoc #

Display all kind information (with -fprint-explicit-kinds) when the provided Bool argument is True. See Note [Kind arguments in error messages] in GHC.Tc.Errors.

pprWithTYPE :: Type -> SDoc #

This variant preserves any use of TYPE in a type, effectively locally setting -fprint-explicit-runtime-reps.

pprSourceTyCon :: TyCon -> SDoc #

Pretty prints a TyCon, using the family instance in case of a representation tycon. For example:

data T [a] = ...

In that case we want to print T [a], where T is the family TyCon

coVarName :: CoVar -> Name #

setCoVarUnique :: CoVar -> Unique -> CoVar #

setCoVarName :: CoVar -> Name -> CoVar #

etaExpandCoAxBranch :: CoAxBranch -> ([TyVar], [Type], Type) #

pprCoAxiom :: forall (br :: BranchFlag). CoAxiom br -> SDoc #

pprCoAxBranchUser :: TyCon -> CoAxBranch -> SDoc #

pprCoAxBranchLHS :: TyCon -> CoAxBranch -> SDoc #

pprCoAxBranch :: TyCon -> CoAxBranch -> SDoc #

tidyCoAxBndrsForUser :: TidyEnv -> [Var] -> (TidyEnv, [Var]) #

coToMCo :: Coercion -> MCoercion #

checkReflexiveMCo :: MCoercion -> MCoercion #

isGReflMCo :: MCoercion -> Bool #

Tests if this MCoercion is obviously generalized reflexive Guaranteed to work very quickly.

mkTransMCo :: MCoercion -> MCoercion -> MCoercion #

Compose two MCoercions via transitivity

mkTransMCoL :: MCoercion -> Coercion -> MCoercion #

mkTransMCoR :: Coercion -> MCoercion -> MCoercion #

mkSymMCo :: MCoercion -> MCoercion #

Get the reverse of an MCoercion

mkCastTyMCo :: Type -> MCoercion -> Type #

Cast a type by an MCoercion

mkHomoForAllMCo :: TyCoVar -> MCoercion -> MCoercion #

mkPiMCos :: [Var] -> MCoercion -> MCoercion #

mkFunResMCo :: Id -> MCoercionR -> MCoercionR #

mkGReflLeftMCo :: Role -> Type -> MCoercionN -> Coercion #

mkGReflRightMCo :: Role -> Type -> MCoercionN -> Coercion #

mkCoherenceRightMCo :: Role -> Type -> MCoercionN -> Coercion -> Coercion #

Like mkCoherenceRightCo, but with an MCoercion

isReflMCo :: MCoercion -> Bool #

decomposeCo :: Arity -> Coercion -> Infinite Role -> [Coercion] #

This breaks a Coercion with type T A B C ~ T D E F into a list of Coercions of kinds A ~ D, B ~ E and E ~ F. Hence:

decomposeCo 3 c [r1, r2, r3] = [nth r1 0 c, nth r2 1 c, nth r3 2 c]

decomposeFunCo :: HasDebugCallStack => Coercion -> (CoercionN, Coercion, Coercion) #

getCoVar_maybe :: Coercion -> Maybe CoVar #

Extract a covar, if possible. This check is dirty. Be ashamed of yourself. (It's dirty because it cares about the structure of a coercion, which is morally reprehensible.)

multToCo :: Mult -> Coercion #

splitAppCo_maybe :: Coercion -> Maybe (Coercion, Coercion) #

Attempt to take a coercion application apart.

splitFunCo_maybe :: Coercion -> Maybe (Coercion, Coercion) #

splitForAllCo_maybe :: Coercion -> Maybe (TyCoVar, Coercion, Coercion) #

splitForAllCo_ty_maybe :: Coercion -> Maybe (TyVar, Coercion, Coercion) #

Like splitForAllCo_maybe, but only returns Just for tyvar binder

splitForAllCo_co_maybe :: Coercion -> Maybe (CoVar, Coercion, Coercion) #

Like splitForAllCo_maybe, but only returns Just for covar binder

coVarLType :: HasDebugCallStack => CoVar -> Type #

coVarRType :: HasDebugCallStack => CoVar -> Type #

coVarTypes :: HasDebugCallStack => CoVar -> Pair Type #

coVarKind :: CoVar -> Type #

mkRuntimeRepCo :: HasDebugCallStack => Coercion -> Coercion #

Given a coercion `co :: (t1 :: TYPE r1) ~ (t2 :: TYPE r2)` produce a coercion `rep_co :: r1 ~ r2` But actually it is possible that co :: (t1 :: CONSTRAINT r1) ~ (t2 :: CONSTRAINT r2) or co :: (t1 :: TYPE r1) ~ (t2 :: CONSTRAINT r2) or co :: (t1 :: CONSTRAINT r1) ~ (t2 :: TYPE r2) See Note [mkRuntimeRepCo]

isReflCoVar_maybe :: Var -> Maybe Coercion #

isGReflCo_maybe :: Coercion -> Maybe (Type, Role) #

Returns the type coerced if this coercion is a generalized reflexive coercion. Guaranteed to work very quickly.

isReflCo_maybe :: Coercion -> Maybe (Type, Role) #

Returns the type coerced if this coercion is reflexive. Guaranteed to work very quickly. Sometimes a coercion can be reflexive, but not obviously so. c.f. isReflexiveCo_maybe

isReflexiveCo_maybe :: Coercion -> Maybe (Type, Role) #

Extracts the coerced type from a reflexive coercion. This potentially walks over the entire coercion, so avoid doing this in a loop.

mkRepReflCo :: Type -> Coercion #

Make a representational reflexive coercion

mkFunCoNoFTF :: HasDebugCallStack => Role -> CoercionN -> Coercion -> Coercion -> Coercion #

mkNakedFunCo2 :: Role -> FunTyFlag -> FunTyFlag -> CoercionN -> Coercion -> Coercion -> Coercion #

mkAppCos :: Coercion -> [Coercion] -> Coercion #

Applies multiple Coercions to another Coercion, from left to right. See also mkAppCo.

mkForAllCos :: [(TyCoVar, CoercionN)] -> Coercion -> Coercion #

Make nested ForAllCos

mkHomoForAllCos :: [TyCoVar] -> Coercion -> Coercion #

Make a Coercion quantified over a type/coercion variable; the variable has the same type in both sides of the coercion

mkCoVarCos :: [CoVar] -> [Coercion] #

mkAxInstCo :: forall (br :: BranchFlag). Role -> CoAxiom br -> BranchIndex -> [Type] -> [Coercion] -> Coercion #

mkUnbranchedAxInstCo :: Role -> CoAxiom Unbranched -> [Type] -> [Coercion] -> Coercion #

mkAxInstRHS :: forall (br :: BranchFlag). CoAxiom br -> BranchIndex -> [Type] -> [Coercion] -> Type #

mkUnbranchedAxInstRHS :: CoAxiom Unbranched -> [Type] -> [Coercion] -> Type #

mkAxInstLHS :: forall (br :: BranchFlag). CoAxiom br -> BranchIndex -> [Type] -> [Coercion] -> Type #

Return the left-hand type of the axiom, when the axiom is instantiated at the types given.

mkUnbranchedAxInstLHS :: CoAxiom Unbranched -> [Type] -> [Coercion] -> Type #

Instantiate the left-hand side of an unbranched axiom

mkHoleCo :: CoercionHole -> Coercion #

Make a coercion from a coercion hole

getNthFun #

Arguments

:: FunSel
-> a	multiplicity
-> a	argument
-> a	result
-> a	One of the above three

Extract the nth field of a FunCo

mkGReflRightCo :: Role -> Type -> CoercionN -> Coercion #

Given ty :: k1, co :: k1 ~ k2, produces co' :: ty ~r (ty |> co)

mkGReflLeftCo :: Role -> Type -> CoercionN -> Coercion #

Given r, ty :: k1, and co :: k1 ~N k2, produces co' :: (ty |> co) ~r ty

mkCoherenceLeftCo :: Role -> Type -> CoercionN -> Coercion -> Coercion #

Given ty :: k1, co :: k1 ~ k2, co2:: ty ~r ty', produces @co' :: (ty |> co) ~r ty' It is not only a utility function, but it saves allocation when co is a GRefl coercion.

mkCoherenceRightCo :: Role -> Type -> CoercionN -> Coercion -> Coercion #

Given ty :: k1, co :: k1 ~ k2, co2:: ty' ~r ty, produces @co' :: ty' ~r (ty |> co) It is not only a utility function, but it saves allocation when co is a GRefl coercion.

downgradeRole :: Role -> Role -> Coercion -> Coercion #

Like downgradeRole_maybe, but panics if the change isn't a downgrade. See Note [Role twiddling functions]

setNominalRole_maybe :: Role -> Coercion -> Maybe CoercionN #

Converts a coercion to be nominal, if possible. See Note [Role twiddling functions]

tyConRolesX :: Role -> TyCon -> Infinite Role #

tyConRoleListX :: Role -> TyCon -> [Role] #

tyConRolesRepresentational :: TyCon -> Infinite Role #

tyConRoleListRepresentational :: TyCon -> [Role] #

tyConRole :: Role -> TyCon -> Int -> Role #

funRole :: Role -> FunSel -> Role #

ltRole :: Role -> Role -> Bool #

promoteCoercion :: Coercion -> CoercionN #

like mkKindCo, but aggressively & recursively optimizes to avoid using a KindCo constructor. The output role is nominal.

castCoercionKind2 :: Coercion -> Role -> Type -> Type -> CoercionN -> CoercionN -> Coercion #

Creates a new coercion with both of its types casted by different casts castCoercionKind2 g r t1 t2 h1 h2, where g :: t1 ~r t2, has type (t1 |> h1) ~r (t2 |> h2). h1 and h2 must be nominal.

castCoercionKind1 :: Coercion -> Role -> Type -> Type -> CoercionN -> Coercion #

castCoercionKind1 g r t1 t2 h = coercionKind g r t1 t2 h h That is, it's a specialised form of castCoercionKind, where the two kind coercions are identical castCoercionKind1 g r t1 t2 h, where g :: t1 ~r t2, has type (t1 |> h) ~r (t2 |> h). h must be nominal. See Note [castCoercionKind1]

castCoercionKind :: Coercion -> CoercionN -> CoercionN -> Coercion #

Creates a new coercion with both of its types casted by different casts castCoercionKind g h1 h2, where g :: t1 ~r t2, has type (t1 |> h1) ~r (t2 |> h2). h1 and h2 must be nominal. It calls coercionKindRole, so it's quite inefficient (which I stands for) Use castCoercionKind2 instead if t1, t2, and r are known beforehand.

mkPiCos :: Role -> [Var] -> Coercion -> Coercion #

mkPiCo :: Role -> Var -> Coercion -> Coercion #

Make a forall Coercion, where both types related by the coercion are quantified over the same variable.

mkFunResCo :: Role -> Id -> Coercion -> Coercion #

mkCoCast :: Coercion -> CoercionR -> Coercion #

instNewTyCon_maybe :: TyCon -> [Type] -> Maybe (Type, Coercion) #

If `instNewTyCon_maybe T ts = Just (rep_ty, co)` then `co :: T ts ~R# rep_ty`

Checks for a newtype, and for being saturated

composeSteppers :: NormaliseStepper ev -> NormaliseStepper ev -> NormaliseStepper ev #

Try one stepper and then try the next, if the first doesn't make progress. So if it returns NS_Done, it means that both steppers are satisfied

unwrapNewTypeStepper :: NormaliseStepper Coercion #

A NormaliseStepper that unwraps newtypes, careful not to fall into a loop. If it would fall into a loop, it produces NS_Abort.

topNormaliseTypeX :: NormaliseStepper ev -> (ev -> ev -> ev) -> Type -> Maybe (ev, Type) #

A general function for normalising the top-level of a type. It continues to use the provided NormaliseStepper until that function fails, and then this function returns. The roles of the coercions produced by the NormaliseStepper must all be the same, which is the role returned from the call to topNormaliseTypeX.

Typically ev is Coercion.

If topNormaliseTypeX step plus ty = Just (ev, ty') then ty ~ev1~ t1 ~ev2~ t2 ... ~evn~ ty' and ev = ev1 plus ev2 plus ... plus evn If it returns Nothing then no newtype unwrapping could happen

eqCoercion :: Coercion -> Coercion -> Bool #

Syntactic equality of coercions

eqCoercionX :: RnEnv2 -> Coercion -> Coercion -> Bool #

Compare two Coercions, with respect to an RnEnv2

liftCoSubstWithEx :: Role -> [TyVar] -> [Coercion] -> [TyCoVar] -> [Type] -> (Type -> Coercion, [Type]) #

liftCoSubstWith :: Role -> [TyCoVar] -> [Coercion] -> Type -> Coercion #

emptyLiftingContext :: InScopeSet -> LiftingContext #

mkSubstLiftingContext :: Subst -> LiftingContext #

extendLiftingContext #

Arguments

:: LiftingContext	original LC
-> TyCoVar	new variable to map...
-> Coercion	...to this lifted version
-> LiftingContext

Extend a lifting context with a new mapping.

extendLiftingContextAndInScope #

Arguments

:: LiftingContext	Original LC
-> TyCoVar	new variable to map...
-> Coercion	to this coercion
-> LiftingContext

Extend a lifting context with a new mapping, and extend the in-scope set

zapLiftingContext :: LiftingContext -> LiftingContext #

Erase the environments in a lifting context

substForAllCoBndrUsingLC :: Bool -> (Coercion -> Coercion) -> LiftingContext -> TyCoVar -> Coercion -> (LiftingContext, TyCoVar, Coercion) #

Like substForAllCoBndr, but works on a lifting context

liftCoSubstTyVar :: LiftingContext -> Role -> TyVar -> Maybe Coercion #

liftCoSubstVarBndrUsing #

Arguments

:: (r -> CoercionN)	coercion getter
-> (LiftingContext -> Type -> r)	callback
-> LiftingContext
-> TyCoVar
-> (LiftingContext, TyCoVar, r)

isMappedByLC :: TyCoVar -> LiftingContext -> Bool #

Is a var in the domain of a lifting context?

substLeftCo :: LiftingContext -> Coercion -> Coercion #

substRightCo :: LiftingContext -> Coercion -> Coercion #

swapLiftCoEnv :: LiftCoEnv -> LiftCoEnv #

Apply "sym" to all coercions in a LiftCoEnv

lcSubstLeft :: LiftingContext -> Subst #

lcSubstRight :: LiftingContext -> Subst #

liftEnvSubstLeft :: Subst -> LiftCoEnv -> Subst #

liftEnvSubstRight :: Subst -> LiftCoEnv -> Subst #

lcSubst :: LiftingContext -> Subst #

Extract the underlying substitution from the LiftingContext

lcInScopeSet :: LiftingContext -> InScopeSet #

Get the InScopeSet from a LiftingContext

coercionKinds :: [Coercion] -> Pair [Type] #

Apply coercionKind to multiple Coercions

coercionKindRole :: Coercion -> (Pair Type, Role) #

Get a coercion's kind and role.

getNthFromType :: HasDebugCallStack => CoSel -> Type -> Type #

coercionRole :: Coercion -> Role #

Retrieve the role from a coercion.

mkPrimEqPred :: Type -> Type -> Type #

Creates a primitive type equality predicate. Invariant: the types are not Coercions

mkPrimEqPredRole :: Role -> Type -> Type -> PredType #

Makes a lifted equality predicate at the given role

mkHeteroPrimEqPred :: Kind -> Kind -> Type -> Type -> Type #

Creates a primitive type equality predicate with explicit kinds

mkHeteroReprPrimEqPred :: Kind -> Kind -> Type -> Type -> Type #

Creates a primitive representational type equality predicate with explicit kinds

mkReprPrimEqPred :: Type -> Type -> Type #

buildCoercion :: Type -> Type -> CoercionN #

Assuming that two types are the same, ignoring coercions, find a nominal coercion between the types. This is useful when optimizing transitivity over coercion applications, where splitting two AppCos might yield different kinds. See Note [EtaAppCo] in GHC.Core.Coercion.Opt.

hasCoercionHoleTy :: Type -> Bool #

Is there a coercion hole in this type?

hasCoercionHoleCo :: Coercion -> Bool #

Is there a coercion hole in this coercion?

hasThisCoercionHoleTy :: Type -> CoercionHole -> Bool #

setCoHoleType :: CoercionHole -> Type -> CoercionHole #

Set the type of a CoercionHole

emptyMessages :: Messages e #

emptyPathsToClean :: PathsToClean #

An empty PathsToClean

initTmpFs :: IO TmpFs #

Initialise an empty TmpFs

forkTmpFsFrom :: TmpFs -> IO TmpFs #

Initialise an empty TmpFs sharing unique numbers and per-process temporary directories with the given TmpFs

It's not safe to use the subdirs created by the original TmpFs with the forked one. Use newTempSubDir to create new subdirs instead.

mergeTmpFsInto :: TmpFs -> TmpFs -> IO () #

Merge the first TmpFs into the second.

The first TmpFs is returned emptied.

cleanTempDirs :: Logger -> TmpFs -> IO () #

cleanTempFiles :: Logger -> TmpFs -> IO () #

Delete all paths in tmp_files_to_clean and tmp_subdirs_to_clean.

keepCurrentModuleTempFiles :: HasCallStack => Logger -> TmpFs -> IO () #

Keep all the paths in tmp_files_to_clean and tmp_subdirs_to_clean that have lifetime TFL_CurrentModule. This function is used when `-keep-tmp-files` is used in an OPTIONS_GHC pragma. This function removes the temporary file from the TmpFs so we no longer remove it at the env when cleanTempFiles is called.

cleanCurrentModuleTempFiles :: Logger -> TmpFs -> IO () #

Delete all paths in tmp_files_to_clean and tmp_subdirs_to_clean That have lifetime TFL_CurrentModule. If a file must be cleaned eventually, but must survive a cleanCurrentModuleTempFiles, ensure it has lifetime TFL_GhcSession.

addFilesToClean :: TmpFs -> TempFileLifetime -> [FilePath] -> IO () #

Ensure that new_files are cleaned on the next call of cleanTempFiles or cleanCurrentModuleTempFiles, depending on lifetime. If any of new_files are already tracked, they will have their lifetime updated.

changeTempFilesLifetime :: TmpFs -> TempFileLifetime -> [FilePath] -> IO () #

Update the lifetime of files already being tracked. If any files are not being tracked they will be discarded.

newTempName :: Logger -> TmpFs -> TempDir -> TempFileLifetime -> Suffix -> IO FilePath #

newTempSubDir :: Logger -> TmpFs -> TempDir -> IO FilePath #

Create a new temporary subdirectory that doesn't already exist The temporary subdirectory is automatically removed at the end of the GHC session, but its contents aren't. Make sure to leave the directory empty before the end of the session, either by removing content directly or by using addFilesToClean.

If the created subdirectory is not empty, it will not be removed (along with its parent temporary directory) and a warning message will be printed at verbosity 2 and higher.

newTempLibName :: Logger -> TmpFs -> TempDir -> TempFileLifetime -> Suffix -> IO (FilePath, FilePath, String) #

withSystemTempDirectory #

Arguments

:: String	Directory name template. See `openTempFile`.
-> (FilePath -> IO a)	Callback that can use the directory
-> IO a

Create and use a temporary directory in the system standard temporary directory.

Behaves exactly the same as withTempDirectory, except that the parent temporary directory will be that returned by getTemporaryDirectory.

withTempDirectory #

Arguments

:: FilePath	Temp directory to create the directory in
-> String	Directory name template. See `openTempFile`.
-> (FilePath -> IO a)	Callback that can use the directory
-> IO a

Create and use a temporary directory.

Creates a new temporary directory inside the given directory, making use of the template. The temp directory is deleted after use. For example:

withTempDirectory "src" "sdist." $ \tmpDir -> do ...

The tmpDir will be a new subdirectory of the given directory, e.g. src/sdist.342.

addErr :: TcRnMessage -> TcRn () #

tcMatchTy :: Type -> Type -> Maybe Subst #

tcMatchTy t1 t2 produces a substitution (over fvs(t1)) s such that s(t1) equals t2. The returned substitution might bind coercion variables, if the variable is an argument to a GADT constructor.

Precondition: typeKind ty1 eqType typeKind ty2

We don't pass in a set of "template variables" to be bound by the match, because tcMatchTy (and similar functions) are always used on top-level types, so we can bind any of the free variables of the LHS. See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTyX_BM :: BindFun -> Subst -> Type -> Type -> Maybe Subst #

tcMatchTyKi :: Type -> Type -> Maybe Subst #

Like tcMatchTy, but allows the kinds of the types to differ, and thus matches them as well. See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTyX #

Arguments

:: Subst	Substitution to extend
-> Type	Template
-> Type	Target
-> Maybe Subst

This is similar to tcMatchTy, but extends a substitution See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTys #

Arguments

:: [Type]	Template
-> [Type]	Target
-> Maybe Subst	One-shot; in principle the template variables could be free in the target

Like tcMatchTy but over a list of types. See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTyKis #

Arguments

:: [Type]	Template
-> [Type]	Target
-> Maybe Subst	One-shot substitution

Like tcMatchTyKi but over a list of types. See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTysX #

Arguments

:: Subst	Substitution to extend
-> [Type]	Template
-> [Type]	Target
-> Maybe Subst	One-shot substitution

Like tcMatchTys, but extending a substitution See also Note [tcMatchTy vs tcMatchTyKi]

tcMatchTyKisX #

Arguments

:: Subst	Substitution to extend
-> [Type]	Template
-> [Type]	Target
-> Maybe Subst	One-shot substitution

Like tcMatchTyKis, but extending a substitution See also Note [tcMatchTy vs tcMatchTyKi]

ruleMatchTyKiX #

Arguments

:: TyCoVarSet	template variables
-> RnEnv2
-> TvSubstEnv	type substitution to extend
-> Type	Template
-> Type	Target
-> Maybe TvSubstEnv

This one is called from the expression matcher, which already has a MatchEnv in hand

matchBindFun :: TyCoVarSet -> BindFun #

Allow binding only for any variable in the set. Variables may be bound to any type. Used when doing simple matching; e.g. can we find a substitution

S = [a :-> t1, b :-> t2] such that
    S( Maybe (a, b->Int )  =   Maybe (Bool, Char -> Int)

alwaysBindFun :: BindFun #

Allow the binding of any variable to any type

typesCantMatch :: [(Type, Type)] -> Bool #

Given a list of pairs of types, are any two members of a pair surely apart, even after arbitrary type function evaluation and substitution?

typesAreApart :: Type -> Type -> Bool #

tcUnifyTy :: Type -> Type -> Maybe Subst #

Simple unification of two types; all type variables are bindable Precondition: the kinds are already equal

tcUnifyTyKi :: Type -> Type -> Maybe Subst #

Like tcUnifyTy, but also unifies the kinds

tcUnifyTyWithTFs #

Arguments

:: Bool	True = do two-way unification; False = do one-way matching. See end of sec 5.2 from the paper
-> InScopeSet
-> Type
-> Type
-> Maybe Subst

Unify two types, treating type family applications as possibly unifying with anything and looking through injective type family applications. Precondition: kinds are the same

tcUnifyTys #

Arguments

:: BindFun
-> [Type]
-> [Type]
-> Maybe Subst	A regular one-shot (idempotent) substitution that unifies the erased types. See comments for `tcUnifyTysFG`

tcUnifyTyKis :: BindFun -> [Type] -> [Type] -> Maybe Subst #

Like tcUnifyTys but also unifies the kinds

tcUnifyTysFG :: BindFun -> [Type] -> [Type] -> UnifyResult #

tcUnifyTysFG bind_tv tys1 tys2 attempts to find a substitution s (whose domain elements all respond BindMe to bind_tv) such that s(tys1) and that of s(tys2) are equal, as witnessed by the returned Coercions. This version requires that the kinds of the types are the same, if you unify left-to-right.

liftCoMatch :: TyCoVarSet -> Type -> Coercion -> Maybe LiftingContext #

liftCoMatch is sort of inverse to liftCoSubst. In particular, if liftCoMatch vars ty co == Just s, then liftCoSubst s ty == co, where == there means that the result of liftCoSubst has the same type as the original co; but may be different under the hood. That is, it matches a type against a coercion of the same "shape", and returns a lifting substitution which could have been used to produce the given coercion from the given type. Note that this function is incomplete -- it might return Nothing when there does indeed exist a possible lifting context.

This function is incomplete in that it doesn't respect the equality in eqType. That is, it's possible that this will succeed for t1 and fail for t2, even when t1 eqType t2. That's because it depends on there being a very similar structure between the type and the coercion. This incompleteness shouldn't be all that surprising, especially because it depends on the structure of the coercion, which is a silly thing to do.

The lifting context produced doesn't have to be exacting in the roles of the mappings. This is because any use of the lifting context will also require a desired role. Thus, this algorithm prefers mapping to nominal coercions where it can do so.

flattenTys :: InScopeSet -> [Type] -> [Type] #

flattenTysX :: InScopeSet -> [Type] -> ([Type], TyVarEnv (TyCon, [Type])) #

classifyPredType :: PredType -> Pred #

mkClassPred :: Class -> [Type] -> PredType #

isDictTy :: Type -> Bool #

typeDeterminesValue :: Type -> Bool #

getClassPredTys :: HasDebugCallStack => PredType -> (Class, [Type]) #

getClassPredTys_maybe :: PredType -> Maybe (Class, [Type]) #

classMethodTy :: Id -> Type #

classMethodInstTy :: Id -> [Type] -> Type #

eqRelRole :: EqRel -> Role #

getEqPredTys :: PredType -> (Type, Type) #

getEqPredTys_maybe :: PredType -> Maybe (Role, Type, Type) #

getEqPredRole :: PredType -> Role #

predTypeEqRel :: PredType -> EqRel #

Get the equality relation relevant for a pred type.

isEvVarType :: Type -> Bool #

isEqPredClass :: Class -> Bool #

isClassPred :: PredType -> Bool #

isEqPred :: PredType -> Bool #

isEqPrimPred :: PredType -> Bool #

isCTupleClass :: Class -> Bool #

isIPTyCon :: TyCon -> Bool #

isIPClass :: Class -> Bool #

isIPLikePred :: Type -> Bool #

hasIPSuperClasses :: Class -> [Type] -> Bool #

isCallStackPredTy :: Type -> Bool #

isCallStackPred :: Class -> [Type] -> Maybe FastString #

Is a PredType a CallStack implicit parameter?

If so, return the name of the parameter.

isCallStackTy :: Type -> Bool #

Is a type a CallStack?

isIPPred_maybe :: Type -> Maybe (FastString, Type) #

Decomposes a predicate if it is an implicit parameter. Does not look in superclasses. See also [Local implicit parameters].

isEvVar :: Var -> Bool #

isDictId :: Id -> Bool #

mkEqSpec :: TyVar -> Type -> EqSpec #

Make a non-dependent EqSpec

eqSpecTyVar :: EqSpec -> TyVar #

eqSpecType :: EqSpec -> Type #

eqSpecPair :: EqSpec -> (TyVar, Type) #

eqSpecPreds :: [EqSpec] -> ThetaType #

eqHsBang :: HsImplBang -> HsImplBang -> Bool #

Compare strictness annotations

isBanged :: HsImplBang -> Bool #

isSrcStrict :: SrcStrictness -> Bool #

isSrcUnpacked :: SrcUnpackedness -> Bool #

isMarkedStrict :: StrictnessMark -> Bool #

cbvFromStrictMark :: StrictnessMark -> CbvMark #

mkDataCon #

Arguments

:: Name
-> Bool	Is the constructor declared infix?
-> TyConRepName	TyConRepName for the promoted TyCon
-> [HsSrcBang]	Strictness/unpack annotations, from user
-> [FieldLabel]	Field labels for the constructor, if it is a record, otherwise empty
-> [TyVar]	Universals.
-> [TyCoVar]	Existentials.
-> [InvisTVBinder]	User-written `TyVarBinder`s. These must be Inferred/Specified. See `Note [TyVarBinders in DataCons]`
-> [EqSpec]	GADT equalities
-> KnotTied ThetaType	Theta-type occurring before the arguments proper
-> [KnotTied (Scaled Type)]	Original argument types
-> KnotTied Type	Original result type
-> PromDataConInfo	See comments on `PromDataConInfo`
-> KnotTied TyCon	Representation type constructor
-> ConTag	Constructor tag
-> ThetaType	The "stupid theta", context of the data declaration e.g. `data Eq a => T a ...`
-> Id	Worker Id
-> DataConRep	Representation
-> DataCon

Build a new data constructor

dataConTag :: DataCon -> ConTag #

The tag used for ordering DataCons

dataConTagZ :: DataCon -> ConTagZ #

dataConOrigTyCon :: DataCon -> TyCon #

The original type constructor used in the definition of this data constructor. In case of a data family instance, that will be the family type constructor.

dataConRepType :: DataCon -> Type #

The representation type of the data constructor, i.e. the sort type that will represent values of this type at runtime

dataConIsInfix :: DataCon -> Bool #

Should the DataCon be presented infix?

dataConUnivTyVars :: DataCon -> [TyVar] #

The universally-quantified type variables of the constructor

dataConUnivAndExTyCoVars :: DataCon -> [TyCoVar] #

Both the universal and existential type/coercion variables of the constructor

dataConTheta :: DataCon -> ThetaType #

The *full* constraints on the constructor type, including dependent GADT equalities.

dataConWrapId_maybe :: DataCon -> Maybe Id #

Get the Id of the DataCon wrapper: a function that wraps the "actual" constructor so it has the type visible in the source program: c.f. dataConWorkId. Returns Nothing if there is no wrapper, which occurs for an algebraic data constructor and also for a newtype (whose constructor is inlined compulsorily)

dataConImplicitTyThings :: DataCon -> [TyThing] #

Find all the Ids implicitly brought into scope by the data constructor. Currently, the union of the dataConWorkId and the dataConWrapId

dataConFieldType :: DataCon -> FieldLabelString -> Type #

Extract the type for any given labelled field of the DataCon

dataConFieldType_maybe :: DataCon -> FieldLabelString -> Maybe (FieldLabel, Type) #

Extract the label and type for any given labelled field of the DataCon, or return Nothing if the field does not belong to it

dataConSrcBangs :: DataCon -> [HsSrcBang] #

Strictness/unpack annotations, from user; or, for imported DataCons, from the interface file The list is in one-to-one correspondence with the arity of the DataCon

dataConRepArity :: DataCon -> Arity #

Gives the number of value arguments (including zero-width coercions) stored by the given DataCon's worker in its Core representation. This may differ from the number of arguments that appear in the source code; see also Note [DataCon arities]

isNullarySrcDataCon :: DataCon -> Bool #

Return whether there are any argument types for this DataCons original source type See Note [DataCon arities]

isNullaryRepDataCon :: DataCon -> Bool #

Return whether this DataCon's worker, in its Core representation, takes any value arguments.

In particular, remember that we include coercion arguments in the arity of the Core representation of the DataCon -- both lifted and unlifted coercions, despite the latter having zero-width runtime representation.

Extras that rely on compat modules

SysTools

data Option #

When invoking external tools as part of the compilation pipeline, we pass these a sequence of options on the command-line. Rather than just using a list of Strings, we use a type that allows us to distinguish between filepaths and 'other stuff'. The reason for this is that this type gives us a handle on transforming filenames, and filenames only, to whatever format they're expected to be on a particular platform.

Constructors

FileOption String String
Option String

Instances

Instances details

Eq Option
Instance details Defined in GHC.Utils.CliOption Methods (==) :: Option -> Option -> Bool # (/=) :: Option -> Option -> Bool #

runUnlit :: Logger -> DynFlags -> [Option] -> IO () #

runPp :: Logger -> DynFlags -> [Option] -> IO () #

Recompilation avoidance

hscCompileCoreExprHook :: Hooks -> Maybe (HscEnv -> SrcSpan -> CoreExpr -> IO (ForeignHValue, [Linkable], PkgsLoaded)) #

type CoreExpr = Expr CoreBndr #

Expressions where binders are CoreBndrs

simplifyExpr :: DynFlags -> HscEnv -> CoreExpr -> IO CoreExpr Source #

tidyExpr :: TidyEnv -> CoreExpr -> CoreExpr #

emptyTidyEnv :: TidyEnv #

corePrepExpr :: DynFlags -> HscEnv -> CoreExpr -> IO CoreExpr Source #

corePrepPgm :: Logger -> CorePrepConfig -> CorePrepPgmConfig -> Module -> ModLocation -> CoreProgram -> [TyCon] -> IO CoreProgram #

lintInteractiveExpr #

Arguments

:: SDoc	The source of the linted expression
-> HscEnv
-> CoreExpr
-> IO ()

icInteractiveModule :: InteractiveContext -> Module #

type HomePackageTable = DModuleNameEnv HomeModInfo #

Helps us find information about modules in the home package

lookupHpt :: HomePackageTable -> ModuleName -> Maybe HomeModInfo #

loadModulesHome :: [HomeModInfo] -> HscEnv -> HscEnv Source #

Load modules, quickly. Input doesn't need to be desugared. A module must be loaded before dependent modules can be typechecked. This variant of loadModuleHome will *never* cause recompilation, it just modifies the session. The order modules are loaded is important when there are hs-boot files. In particular you should make sure to load the .hs version of a file after the .hs-boot version.

data Dependencies #

Dependency information about ALL modules and packages below this one in the import hierarchy. This is the serialisable version of ImportAvails.

Invariant: the dependencies of a module M never includes M.

Invariant: none of the lists contain duplicates.

Invariant: lists are ordered canonically (e.g. using stableModuleCmp)

See Note [Transitive Information in Dependencies]

Instances

Instances details

Binary Dependencies
Instance details Defined in GHC.Unit.Module.Deps Methods put_ :: BinHandle -> Dependencies -> IO () # put :: BinHandle -> Dependencies -> IO (Bin Dependencies) # get :: BinHandle -> IO Dependencies #
Eq Dependencies
Instance details Defined in GHC.Unit.Module.Deps Methods (==) :: Dependencies -> Dependencies -> Bool # (/=) :: Dependencies -> Dependencies -> Bool #

bcoFreeNames :: UnlinkedBCO -> UniqDSet Name #

Finds external references. Remember to remove the names defined by this group of BCOs themselves

type ModIfaceAnnotation = Annotation Source #

pattern Annotation :: CoreAnnTarget -> AnnPayload -> Annotation #

data AnnTarget name #

An annotation target

Constructors

ModuleTarget Module

We are annotating a particular module

Instances

Instances details

Functor AnnTarget
Instance details Defined in GHC.Types.Annotations Methods fmap :: (a -> b) -> AnnTarget a -> AnnTarget b # (<$) :: a -> AnnTarget b -> AnnTarget a #
Binary name => Binary (AnnTarget name)
Instance details Defined in GHC.Types.Annotations Methods put_ :: BinHandle -> AnnTarget name -> IO () # put :: BinHandle -> AnnTarget name -> IO (Bin (AnnTarget name)) # get :: BinHandle -> IO (AnnTarget name) #
Outputable name => Outputable (AnnTarget name)
Instance details Defined in GHC.Types.Annotations Methods ppr :: AnnTarget name -> SDoc #

extendAnnEnvList :: AnnEnv -> [Annotation] -> AnnEnv #

Add the given annotation to the environment.

module GHC.Types.Unique.DSet

module GHC.Types.Unique.Set

module GHC.Types.Unique.DFM

getDependentMods :: ModIface -> [ModuleName] Source #

flattenBinds :: [Bind b] -> [(b, Expr b)] #

Collapse all the bindings in the supplied groups into a single list of lhs/rhs pairs suitable for binding in a Rec binding group

mkRnEnv2 :: InScopeSet -> RnEnv2 #

emptyInScopeSet :: InScopeSet #

data Unfolding #

Records the unfolding of an identifier, which is approximately the form the identifier would have if we substituted its definition in for the identifier. This type should be treated as abstract everywhere except in GHC.Core.Unfold

Constructors

NoUnfolding	We have no information about the unfolding.
BootUnfolding	We have no information about the unfolding, because this `Id` came from an `hi-boot` file. See Note [Inlining and hs-boot files] in GHC.CoreToIface for what this is used for.
OtherCon [AltCon]	It ain't one of these constructors. `OtherCon xs` also indicates that something has been evaluated and hence there's no point in re-evaluating it. `OtherCon []` is used even for non-data-type values to indicated evaluated-ness. Notably: data C = C !(Int -> Int) case x of { C f -> ... } Here, `f` gets an `OtherCon []` unfolding.
DFunUnfolding
Fields df_bndrs :: [Var] df_con :: DataCon df_args :: [CoreExpr]
CoreUnfolding	An unfolding with redundant cached information. Parameters: uf_tmpl: Template used to perform unfolding; NB: Occurrence info is guaranteed correct: see Note [OccInfo in unfoldings and rules] uf_is_top: Is this a top level binding? uf_is_value: `exprIsHNF` template (cached); it is ok to discard a `seq` on this variable uf_is_work_free: Does this waste only a little work if we expand it inside an inlining? Basically this is a cached version of `exprIsWorkFree` uf_guidance: Tells us about the size of the unfolding template
Fields uf_tmpl :: CoreExpr uf_src :: UnfoldingSource uf_is_top :: Bool uf_cache :: UnfoldingCache uf_guidance :: UnfoldingGuidance

noUnfolding :: Unfolding #

There is no known Unfolding

loadExpr :: Interp -> HscEnv -> SrcSpan -> UnlinkedBCO -> IO ForeignHValue #

Load a single expression, including first loading packages and modules that this expression depends on.

Raises an IO exception (ProgramError) if it can't find a compiled version of the dependents to load.

byteCodeGen :: HscEnv -> Module -> [CgStgTopBinding] -> [TyCon] -> Maybe ModBreaks -> IO CompiledByteCode #

bc_bcos :: CompiledByteCode -> [UnlinkedBCO] #

loadDecls :: Interp -> HscEnv -> SrcSpan -> CompiledByteCode -> IO ([(Name, ForeignHValue)], [Linkable], PkgsLoaded) #

hscInterp :: HscEnv -> Interp #

Retrieve the target code interpreter

Fails if no target code interpreter is available

expectJust :: HasCallStack => String -> Maybe a -> a #

extract_cons :: DataDefnCons a -> [a] Source #

recDotDot :: HsRecFields (GhcPass p) arg -> Maybe Int Source #

data XModulePs #

Haskell Module extension point: GHC specific

Constructors

XModulePs

Fields

hsmodAnn :: EpAnn AnnsModule
hsmodLayout :: LayoutInfo GhcPs
Layout info for the module. For incomplete modules (e.g. the output of parseHeader), it is NoLayoutInfo.
hsmodDeprecMessage :: Maybe (LocatedP (WarningTxt GhcPs))
reason/explanation for warning/deprecation of this module
- AnnKeywordIds : AnnOpen ,AnnClose
hsmodHaddockModHeader :: Maybe (LHsDoc GhcPs)
Haddock module info and description, unparsed
- AnnKeywordIds : AnnOpen ,AnnClose

Instances

Instances details

Data XModulePs

Instance details

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XModulePs -> c XModulePs #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c XModulePs #

toConstr :: XModulePs -> Constr #

dataTypeOf :: XModulePs -> DataType #

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

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

gmapT :: (forall b. Data b => b -> b) -> XModulePs -> XModulePs #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XModulePs -> r #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XModulePs -> r #

gmapQ :: (forall d. Data d => d -> u) -> XModulePs -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> XModulePs -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> XModulePs -> m XModulePs #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XModulePs -> m XModulePs #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XModulePs -> m XModulePs #

IfaceReflCo IfaceType
IfaceGReflCo Role IfaceType IfaceMCoercion
IfaceFunCo Role IfaceCoercion IfaceCoercion IfaceCoercion
IfaceTyConAppCo Role IfaceTyCon [IfaceCoercion]
IfaceAppCo IfaceCoercion IfaceCoercion
IfaceForAllCo IfaceBndr IfaceCoercion IfaceCoercion
IfaceCoVarCo IfLclName
IfaceAxiomInstCo IfExtName BranchIndex [IfaceCoercion]
IfaceAxiomRuleCo IfLclName [IfaceCoercion]
IfaceUnivCo IfaceUnivCoProv Role IfaceType IfaceType
IfaceSymCo IfaceCoercion
IfaceTransCo IfaceCoercion IfaceCoercion
IfaceSelCo CoSel IfaceCoercion
IfaceLRCo LeftOrRight IfaceCoercion
IfaceInstCo IfaceCoercion IfaceCoercion
IfaceKindCo IfaceCoercion
IfaceSubCo IfaceCoercion
IfaceFreeCoVar CoVar
IfaceHoleCo CoVar	See Note [Holes in IfaceCoercion]

IfaceFreeTyVar TyVar
IfaceTyVar IfLclName
IfaceLitTy IfaceTyLit
IfaceAppTy IfaceType IfaceAppArgs
IfaceFunTy FunTyFlag IfaceMult IfaceType IfaceType
IfaceForAllTy IfaceForAllBndr IfaceType
IfaceTyConApp IfaceTyCon IfaceAppArgs
IfaceCastTy IfaceType IfaceCoercion
IfaceCoercionTy IfaceCoercion
IfaceTupleTy TupleSort PromotionFlag IfaceAppArgs

IfaceLcl IfLclName
IfaceExt IfExtName
IfaceType IfaceType
IfaceCo IfaceCoercion
IfaceTuple TupleSort [IfaceExpr]
IfaceLam IfaceLamBndr IfaceExpr
IfaceApp IfaceExpr IfaceExpr
IfaceCase IfaceExpr IfLclName [IfaceAlt]
IfaceECase IfaceExpr IfaceType
IfaceLet (IfaceBinding IfaceLetBndr) IfaceExpr
IfaceCast IfaceExpr IfaceCoercion
IfaceLit Literal
IfaceLitRubbish TypeOrConstraint IfaceType
IfaceFCall ForeignCall IfaceType
IfaceTick IfaceTickish IfaceExpr

WpHole
WpCompose HsWrapper HsWrapper
WpFun HsWrapper HsWrapper (Scaled TcTypeFRR)
WpCast TcCoercionR
WpEvLam EvVar
WpEvApp EvTerm
WpTyLam TyVar
WpTyApp KindOrType
WpLet TcEvBinds
WpMultCoercion Coercion

UnitDepRemoved UnitId
ModulePackageChanged FastString
SourceFileChanged
ThisUnitIdChanged
ImpurePlugin
PluginsChanged
PluginFingerprintChanged
ModuleInstChanged
HieMissing
HieOutdated
SigsMergeChanged
ModuleChanged ModuleName
ModuleRemoved (UnitId, ModuleName)
ModuleAdded (UnitId, ModuleName)
ModuleChangedRaw ModuleName
ModuleChangedIface ModuleName
FileChanged FilePath
CustomReason String
FlagsChanged
OptimFlagsChanged
HpcFlagsChanged
MissingBytecode
MissingObjectFile
MissingDynObjectFile
MissingDynHiFile
MismatchedDynHiFile
ObjectsChanged
LibraryChanged

:: DataCon	A datacon with no existentials or equality constraints However, it can have a dcTheta (notably it can be a class dictionary, with superclasses)
-> [Type]	Instantiated at these types
-> [Scaled Type]

:: Type	A product type, perhaps
-> Maybe (TyCon, [Type], DataCon, [Scaled Type])

:: Name
-> Bool	Is the pattern synonym declared infix?
-> ([InvisTVBinder], ThetaType)	Universally-quantified type variables and required dicts
-> ([InvisTVBinder], ThetaType)	Existentially-quantified type variables and provided dicts
-> [FRRType]	Original arguments
-> Type	Original result type
-> PatSynMatcher	Matcher
-> PatSynBuilder	Builder
-> [FieldLabel]	Names of fields for a record pattern synonym
-> PatSyn

:: [Type]	flattened target arguments. Make sure they're flattened! See Note [Flattening type-family applications when matching instances] in GHC.Core.Unify.
-> CoAxBranch	the candidate equation we wish to use Precondition: this matches the target
-> Bool	True = equation can fire

:: AltCon	Case alternative constructor
-> [CoreBndr]	Things bound by the pattern match
-> [Type]	The type arguments to the case alternative
-> CoreExpr

:: TyCon	Type constructor of scrutinee's type (used to prune possibilities)
-> [Type]	And its type arguments
-> [AltCon]	`imposs_cons`: constructors known to be impossible due to the form of the scrutinee
-> [Alt b]	Alternatives
-> ([AltCon], [Alt b])

:: [Unique]	Uniques for constructing new binders
-> Mult	Multiplicity annotation of the case expression
-> TyCon	Type constructor of scrutinee's type
-> [Type]	Type arguments of scrutinee's type
-> [AltCon]	Constructors that cannot match the DEFAULT (if any)
-> [CoreAlt]
-> (Bool, [CoreAlt])	`True`, if a default alt was replaced with a `DataAlt`

:: MonadIO m
=> DynFlags
-> [Located String]
-> m (DynFlags, [Located String], [Warn])	Updated `DynFlags`, left-over arguments, and list of warnings.

:: HsWrapper
-> HsWrapper
-> Scaled TcTypeFRR	the "from" type of the first wrapper MUST have a fixed RuntimeRep
-> TcType	Either "from" type or "to" type of the second wrapper (used only when the second wrapper is the identity)
-> HsWrapper

:: Name	the name of the class
-> [RoughMatchTc]	the rough match signature of the instance
-> Name	the `Name` of the dictionary binding
-> DFunId	the `Id` of the dictionary.
-> OverlapFlag	may this instance overlap?
-> IsOrphan	is this instance an orphan?
-> ClsInst

:: EnumSet Extension	permitted language extensions enabled
-> DiagOpts	diagnostic options
-> [String]	Supported Languages and Extensions
-> Bool	are safe imports on?
-> Bool	keeping Haddock comment tokens
-> Bool	keep regular comment tokens
-> Bool	If this is enabled, '{-# LINE ... -#}' and '{-# COLUMN ... #-}' update the internal position kept by the parser. Otherwise, those pragmas are lexed as `ITline_prag` and `ITcolumn_prag` tokens.
-> ParserOpts

:: MonadIO m
=> DynFlags
-> TcGblEnv
-> m (Maybe Docs)	Module header Docs on top level declarations Docs on arguments

:: Module	The current module
-> ImportAvails	Imports
-> Maybe [(LIE GhcRn, Avails)]	Explicit export list
-> HsGroup GhcRn
-> [AvailInfo]	All exports
-> OccEnv Name	Default Methods
-> DocStructure

:: OccEnv Name	The default method environment
-> [AvailInfo]	All exports, unordered
-> HsGroup GhcRn
-> DocStructure

:: forall (pass :: Pass). Bool	Do we have an explicit export list?
-> HsGroup (GhcPass pass)
-> Map String (HsDoc (GhcPass pass))

:: OccEnv Name	Default method environment for this module. See Note [default method Name] in GHC.Iface.Recomp
-> HsDecl GhcRn
-> [Name]

:: OccEnv Name	The default method environment
-> Map RealSrcSpan Name
-> HsDecl GhcRn
-> [(Name, [HsDoc GhcRn], IntMap (HsDoc GhcRn))]

:: ParserOpts
-> FilePath	Input file
-> IO (Messages PsMessage, [Located String])	Parsed options, if any.

:: ParserOpts
-> StringBuffer	Input Buffer
-> FilePath	Source filename. Used for location info.
-> (Messages PsMessage, [Located String])	warnings and parsed options.

:: Bool	True = an hs-boot file (could also be a sig)
-> TyThing
-> TyThing
-> TcM ()

:: Char	Mask for unique supply
-> HscEnv
-> gbl
-> lcl
-> TcRnIf gbl lcl a
-> IO a

:: String	header
-> SDoc	information to output
-> CoreExpr	expression
-> DsM CoreExpr

:: forall (br :: BranchFlag). DynFlags
-> CoAxiom br	Type family for which we generate errors
-> CoAxBranch	Currently checked equation (represented by axiom)
-> [Bool]	Injectivity annotation
-> TcM ()

:: HscEnv
-> CgGuts
-> ModLocation
-> FilePath
-> IO (FilePath, Maybe FilePath, [(ForeignSrcLang, FilePath)], Maybe StgCgInfos, Maybe CmmCgInfos)	`Just f` = _stub.c is f