Internal.GhcFacade

Documentation

class Monad m => MonadFix (m :: Type -> Type) where

Monads having fixed points with a 'knot-tying' semantics. Instances of MonadFix should satisfy the following laws:

Purity

mfix (return . h) = return (fix h)

Left shrinking (or Tightening)

mfix (\x -> a >>= \y -> f x y) = a >>= \y -> mfix (\x -> f x y)

Sliding

mfix (liftM h . f) = liftM h (mfix (f . h)), for strict h.

Nesting

mfix (\x -> mfix (\y -> f x y)) = mfix (\x -> f x x)

This class is used in the translation of the recursive do notation supported by GHC and Hugs.

Methods

mfix :: (a -> m a) -> m a

The fixed point of a monadic computation. mfix f executes the action f only once, with the eventual output fed back as the input. Hence f should not be strict, for then mfix f would diverge.

Instances

MonadFix Identity

Since: base-4.8.0.0

Defined in Data.Functor.Identity

Methods

mfix :: (a -> Identity a) -> Identity a

MonadFix First

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> First a) -> First a

MonadFix Last

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Last a) -> Last a

MonadFix Down

Since: base-4.12.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Down a) -> Down a

MonadFix Dual

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Dual a) -> Dual a

MonadFix Product

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Product a) -> Product a

MonadFix Sum

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Sum a) -> Sum a

MonadFix Par1

Since: base-4.9.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Par1 a) -> Par1 a

MonadFix Ghc

Defined in GHC.Driver.Monad

Methods

mfix :: (a -> Ghc a) -> Ghc a

MonadFix UniqSM

Defined in GHC.Types.Unique.Supply

Methods

mfix :: (a -> UniqSM a) -> UniqSM a

MonadFix IO

Since: base-2.1

Defined in Control.Monad.Fix

Methods

mfix :: (a -> IO a) -> IO a

MonadFix Q

If the function passed to mfix inspects its argument, the resulting action will throw a FixIOException.

Since: template-haskell-2.17.0.0

Defined in Language.Haskell.TH.Syntax

Methods

mfix :: (a -> Q a) -> Q a

MonadFix NonEmpty

Since: base-4.9.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> NonEmpty a) -> NonEmpty a

MonadFix Maybe

Since: base-2.1

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Maybe a) -> Maybe a

MonadFix Solo

Since: base-4.15

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Solo a) -> Solo a

MonadFix []

Since: base-2.1

Defined in Control.Monad.Fix

Methods

mfix :: (a -> [a]) -> [a]

MonadFix (Either e)

Since: base-4.3.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Either e a) -> Either e a

MonadFix (ST s)

Since: base-2.1

Defined in Control.Monad.Fix

Methods

mfix :: (a -> ST s a) -> ST s a

MonadFix (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mfix :: (a -> IOEnv env a) -> IOEnv env a

MonadFix f => MonadFix (Ap f)

Since: base-4.12.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Ap f a) -> Ap f a

MonadFix f => MonadFix (Alt f)

Since: base-4.8.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Alt f a) -> Alt f a

MonadFix f => MonadFix (Rec1 f)

Since: base-4.9.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Rec1 f a) -> Rec1 f a

(MonadFix m, Error e) => MonadFix (ErrorT e m)

Defined in Control.Monad.Trans.Error

Methods

mfix :: (a -> ErrorT e m a) -> ErrorT e m a

MonadFix m => MonadFix (StateT s m)

Defined in Control.Monad.Trans.State.Lazy

Methods

mfix :: (a -> StateT s m a) -> StateT s m a

(MonadFix f, MonadFix g) => MonadFix (f :*: g)

Since: base-4.9.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> (f :*: g) a) -> (f :*: g) a

MonadFix ((->) r)

Since: base-2.1

Defined in Control.Monad.Fix

Methods

mfix :: (a -> r -> a) -> r -> a

MonadFix f => MonadFix (M1 i c f)

Since: base-4.9.0.0

Defined in Control.Monad.Fix

Methods

mfix :: (a -> M1 i c f a) -> M1 i c f a

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

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

>>> 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

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

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

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 Identity

Since: base-4.8.0.0

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

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

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

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 Dual

Since: base-4.8.0.0

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

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

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 Par1

Since: base-4.9.0.0

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

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

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 Put

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 NormM

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

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

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 Pair

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 Hsc

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

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 falliblity---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 falliblity of the entire group. See mkDataConCase for an example.

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 P

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

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 TcPluginM

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

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

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 Q

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 NonEmpty

Since: base-4.9.0.0

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 Maybe

Since: base-2.1

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

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 []

Since: base-2.1

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]

Monad m => Applicative (WrappedMonad m)

Since: base-2.1

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

Applicative (Either e)

Since: base-3.0

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

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

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 (U1 :: Type -> Type)

Since: base-4.9.0.0

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

Applicative (SetM s)

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

Applicative (IOEnv m)

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 (CmdLineP s)

Defined in GHC.Driver.CmdLine

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

Monad m => Applicative (EwM m)

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)

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

Monoid a => Applicative ((,) a)

For tuples, the Monoid constraint on a determines how the first values merge. For example, Strings concatenate:

("hello ", (+15)) <*> ("world!", 2002)
("hello world!",2017)

Since: base-2.1

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

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

Monoid m => Applicative (Const m :: Type -> Type)

Since: base-2.0.1

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

Applicative f => Applicative (Ap f)

Since: base-4.12.0.0

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

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

Applicative f => Applicative (Rec1 f)

Since: base-4.9.0.0

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

(Applicative f, Monad f) => Applicative (WhenMissing f x)

Equivalent to ReaderT k (ReaderT x (MaybeT f)).

Since: containers-0.5.9

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

(Functor m, Monad m) => Applicative (ErrorT e m)

Defined in Control.Monad.Trans.Error

Methods

pure :: a -> ErrorT e m a

(<*>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b

liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c

(*>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b

(<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a

(Functor m, Monad m) => Applicative (StateT s m)

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

(Monoid a, Monoid b) => Applicative ((,,) a b)

Since: base-4.14.0.0

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 (f :*: g)

Since: base-4.9.0.0

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

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

(Monad f, Applicative f) => Applicative (WhenMatched f x y)

Equivalent to ReaderT Key (ReaderT x (ReaderT y (MaybeT f)))

Since: containers-0.5.9

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

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

(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c)

Since: base-4.14.0.0

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

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 (f :.: g)

Since: base-4.9.0.0

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

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

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

data Plugin

Plugin is the compiler plugin data type. Try to avoid constructing one of these directly, and just modify some fields of defaultPlugin instead: this is to try and preserve source-code compatibility when we add fields to this.

Nonetheless, this API is preliminary and highly likely to change in the future.

Constructors

Plugin

Fields

• installCoreToDos :: CorePlugin

  Modify the Core pipeline that will be used for compilation. This is called as the Core pipeline is built for every module being compiled, and plugins get the opportunity to modify the pipeline in a nondeterministic order.

• tcPlugin :: TcPlugin

  An optional typechecker plugin, which may modify the behaviour of the constraint solver.

• holeFitPlugin :: HoleFitPlugin

  An optional plugin to handle hole fits, which may re-order or change the list of valid hole fits and refinement hole fits.

• driverPlugin :: [CommandLineOption] -> HscEnv -> IO HscEnv

  An optional plugin to update HscEnv, right after plugin loading. This can be used to register hooks or tweak any field of DynFlags before doing actual work on a module.

  Since: ghc-8.10.1

• pluginRecompile :: [CommandLineOption] -> IO PluginRecompile

  Specify how the plugin should affect recompilation.

• parsedResultAction :: [CommandLineOption] -> ModSummary -> HsParsedModule -> Hsc HsParsedModule

  Modify the module when it is parsed. This is called by GHC.Driver.Main when the parsing is successful.

• renamedResultAction :: [CommandLineOption] -> TcGblEnv -> HsGroup GhcRn -> TcM (TcGblEnv, HsGroup GhcRn)

  Modify each group after it is renamed. This is called after each HsGroup has been renamed.

• typeCheckResultAction :: [CommandLineOption] -> ModSummary -> TcGblEnv -> TcM TcGblEnv

  Modify the module when it is type checked. This is called at the very end of typechecking.

• spliceRunAction :: [CommandLineOption] -> LHsExpr GhcTc -> TcM (LHsExpr GhcTc)

  Modify the TH splice or quasiqoute before it is run.

• interfaceLoadAction :: forall lcl. [CommandLineOption] -> ModIface -> IfM lcl ModIface

  Modify an interface that have been loaded. This is called by GHC.Iface.Load when an interface is successfully loaded. Not applied to the loading of the plugin interface. Tools that rely on information from modules other than the currently compiled one should implement this function.

data FrontendPlugin

Constructors

FrontendPlugin

Fields

• frontend :: FrontendPluginAction

class Monad m => MonadIO (m :: Type -> Type) where

Monads in which IO computations may be embedded. Any monad built by applying a sequence of monad transformers to the IO monad will be an instance of this class.

Instances should satisfy the following laws, which state that liftIO is a transformer of monads:

• liftIO . return = return

• liftIO (m >>= f) = liftIO m >>= (liftIO . f)

Methods

liftIO :: IO a -> m a

Lift a computation from the IO monad. This allows us to run IO computations in any monadic stack, so long as it supports these kinds of operations (i.e. IO is the base monad for the stack).

Example

import Control.Monad.Trans.State -- from the "transformers" library

printState :: Show s => StateT s IO ()
printState = do
  state <- get
  liftIO $ print state

Had we omitted liftIO, we would have ended up with this error:

• Couldn't match type ‘IO’ with ‘StateT s IO’
 Expected type: StateT s IO ()
   Actual type: IO ()

The important part here is the mismatch between StateT s IO () and IO ().

Luckily, we know of a function that takes an IO a and returns an (m a): liftIO, enabling us to run the program and see the expected results:

> evalStateT printState "hello"
"hello"

> evalStateT printState 3
3

Instances

MonadIO Hsc

Defined in GHC.Driver.Env.Types

Methods

liftIO :: IO a -> Hsc a

MonadIO Ghc

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> Ghc a

MonadIO IO

Since: base-4.9.0.0

Defined in Control.Monad.IO.Class

Methods

liftIO :: IO a -> IO a

MonadIO Q

Defined in Language.Haskell.TH.Syntax

Methods

liftIO :: IO a -> Q a

MonadIO (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

liftIO :: IO a -> IOEnv env a

MonadIO m => MonadIO (GhcT m)

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> GhcT m a

(Error e, MonadIO m) => MonadIO (ErrorT e m)

Defined in Control.Monad.Trans.Error

Methods

liftIO :: IO a -> ErrorT e m a

MonadIO m => MonadIO (StateT s m)

Defined in Control.Monad.Trans.State.Lazy

Methods

liftIO :: IO a -> StateT s m a

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.

data IORef a

A mutable variable in the IO monad

Instances

Eq (IORef a)

Pointer equality.

Since: base-4.0.0.0

Defined in GHC.IORef

Methods

(==) :: IORef a -> IORef a -> Bool

(/=) :: IORef a -> IORef a -> Bool

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

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

Basic usage:

>>> let f a e = do { print e ; return $ e : a }
>>> foldlM f [] [0..3]
0
1
2
3
[3,2,1,0]

(<$>) :: 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

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)

type TypecheckedSource = LHsBinds GhcTc

data TypecheckedModule

The result of successful typechecking. It also contains the parser result.

Constructors

TypecheckedModule

Fields

• tm_parsed_module :: ParsedModule
• tm_renamed_source :: Maybe RenamedSource
• tm_typechecked_source :: TypecheckedSource
• tm_checked_module_info :: ModuleInfo
• tm_internals_ :: (TcGblEnv, ModDetails)

Instances

ParsedMod TypecheckedModule

Defined in GHC

Methods

modSummary :: TypecheckedModule -> ModSummary

parsedSource :: TypecheckedModule -> ParsedSource

TypecheckedMod TypecheckedModule

Defined in GHC

Methods

renamedSource :: TypecheckedModule -> Maybe RenamedSource

typecheckedSource :: TypecheckedModule -> TypecheckedSource

moduleInfo :: TypecheckedModule -> ModuleInfo

tm_internals :: TypecheckedModule -> (TcGblEnv, ModDetails)

class ParsedMod m => TypecheckedMod m where

Minimal complete definition

renamedSource, typecheckedSource, moduleInfo, tm_internals

Methods

renamedSource :: m -> Maybe RenamedSource

typecheckedSource :: m -> TypecheckedSource

moduleInfo :: m -> ModuleInfo

Instances

TypecheckedMod DesugaredModule

Defined in GHC

Methods

renamedSource :: DesugaredModule -> Maybe RenamedSource

typecheckedSource :: DesugaredModule -> TypecheckedSource

moduleInfo :: DesugaredModule -> ModuleInfo

tm_internals :: DesugaredModule -> (TcGblEnv, ModDetails)

TypecheckedMod TypecheckedModule

Defined in GHC

Methods

renamedSource :: TypecheckedModule -> Maybe RenamedSource

typecheckedSource :: TypecheckedModule -> TypecheckedSource

moduleInfo :: TypecheckedModule -> ModuleInfo

tm_internals :: TypecheckedModule -> (TcGblEnv, ModDetails)

type RenamedSource = (HsGroup GhcRn, [LImportDecl GhcRn], Maybe [(LIE GhcRn, Avails)], Maybe LHsDocString)

type ParsedSource = Located HsModule

data ParsedModule

The result of successful parsing.

Constructors

ParsedModule

Fields

• pm_mod_summary :: ModSummary
• pm_parsed_source :: ParsedSource
• pm_extra_src_files :: [FilePath]

Instances

ParsedMod ParsedModule

Defined in GHC

Methods

modSummary :: ParsedModule -> ModSummary

parsedSource :: ParsedModule -> ParsedSource

class ParsedMod m where

Minimal complete definition

modSummary, parsedSource

Methods

parsedSource :: m -> ParsedSource

Instances

ParsedMod DesugaredModule

Defined in GHC

Methods

modSummary :: DesugaredModule -> ModSummary

parsedSource :: DesugaredModule -> ParsedSource

ParsedMod ParsedModule

Defined in GHC

Methods

modSummary :: ParsedModule -> ModSummary

parsedSource :: ParsedModule -> ParsedSource

ParsedMod TypecheckedModule

Defined in GHC

Methods

modSummary :: TypecheckedModule -> ModSummary

parsedSource :: TypecheckedModule -> ParsedSource

data ModuleInfo

Container for information about a Module.

newtype GhcApiError

An error thrown if the GHC API is used in an incorrect fashion.

Constructors

GhcApiError String

Instances

Exception GhcApiError

Defined in GHC

Methods

toException :: GhcApiError -> SomeException

fromException :: SomeException -> Maybe GhcApiError

displayException :: GhcApiError -> String

Show GhcApiError

Defined in GHC

Methods

showsPrec :: Int -> GhcApiError -> ShowS

show :: GhcApiError -> String

showList :: [GhcApiError] -> ShowS

data DesugaredModule

The result of successful desugaring (i.e., translation to core). Also contains all the information of a typechecked module.

Constructors

DesugaredModule

Fields

• dm_typechecked_module :: TypecheckedModule
• dm_core_module :: ModGuts

Instances

DesugaredMod DesugaredModule

Defined in GHC

Methods

coreModule :: DesugaredModule -> ModGuts

ParsedMod DesugaredModule

Defined in GHC

Methods

modSummary :: DesugaredModule -> ModSummary

parsedSource :: DesugaredModule -> ParsedSource

TypecheckedMod DesugaredModule

Defined in GHC

Methods

renamedSource :: DesugaredModule -> Maybe RenamedSource

typecheckedSource :: DesugaredModule -> TypecheckedSource

moduleInfo :: DesugaredModule -> ModuleInfo

tm_internals :: DesugaredModule -> (TcGblEnv, ModDetails)

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

Outputable CoreModule

Defined in GHC

Methods

ppr :: CoreModule -> SDoc

workingDirectoryChanged :: GhcMonad m => m ()

Inform GHC that the working directory has changed. GHC will flush its cache of module locations, since it may no longer be valid.

Note: Before changing the working directory make sure all threads running in the same session have stopped. If you change the working directory, you should also unload the current program (set targets to empty, followed by load).

withCleanupSession :: GhcMonad m => m a -> m a

typecheckModule :: GhcMonad m => ParsedModule -> m TypecheckedModule

Typecheck and rename a parsed module.

Throws a SourceError if either fails.

showRichTokenStream :: [(Located Token, String)] -> String

Take a rich token stream such as produced from getRichTokenStream and return source code almost identical to the original code (except for insignificant whitespace.)

setTargets :: GhcMonad m => [Target] -> m ()

Sets the targets for this session. Each target may be a module name or a filename. The targets correspond to the set of root modules for the program/library. Unloading the current program is achieved by setting the current set of targets to be empty, followed by load.

setSessionDynFlags :: GhcMonad m => DynFlags -> m ()

Updates both the interactive and program DynFlags in a Session. This also reads the package database (unless it has already been read), and prepares the compilers knowledge about packages. It can be called again to load new packages: just add new package flags to (packageFlags dflags).

setProgramDynFlags :: GhcMonad m => DynFlags -> m Bool

Sets the program DynFlags. Note: this invalidates the internal cached module graph, causing more work to be done the next time load is called.

Returns a boolean indicating if preload units have changed and need to be reloaded.

setInteractiveDynFlags :: GhcMonad m => DynFlags -> m ()

Set the DynFlags used to evaluate interactive expressions. Also initialise (load) plugins.

Note: this cannot be used for changes to packages. Use setSessionDynFlags, or setProgramDynFlags and then copy the unitState into the interactive DynFlags.

setGHCiMonad :: GhcMonad m => String -> m ()

Set the monad GHCi lifts user statements into.

Checks that a type (in string form) is an instance of the GHC.GHCi.GHCiSandboxIO type class. Sets it to be the GHCi monad if it is, throws an error otherwise.

runGhcT

Arguments

:: ExceptionMonad m

=> Maybe FilePath

See argument to initGhcMonad.

-> GhcT m a

The action to perform.

-> m a

Run function for GhcT monad transformer.

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.

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.

removeTarget :: GhcMonad m => TargetId -> m ()

Remove a target

pprParenSymName :: NamedThing a => a -> SDoc

print a NamedThing, adding parentheses if the name is an operator.

parser

Arguments

:: String

Haskell module source text (full Unicode is supported)

-> DynFlags

the flags

-> FilePath

the filename (for source locations)

-> (WarningMessages, Either ErrorMessages (Located HsModule))

A pure interface to the module parser.

parseTargetFiles :: DynFlags -> [String] -> (DynFlags, [(String, Maybe Phase)], [String])

Parse command line arguments that look like files. First normalises its arguments and then splits them into source files and object files. A source file can be turned into a Target via guessTarget

parseModule :: GhcMonad m => ModSummary -> m ParsedModule

Parse a module.

Throws a SourceError on parse error.

parseDynamicFlags :: MonadIO m => Logger -> DynFlags -> [Located String] -> m (DynFlags, [Located String], [Warn])

obtainTermFromVal :: GhcMonad m => Int -> Bool -> Type -> a -> m Term

obtainTermFromId :: GhcMonad m => Int -> Bool -> Id -> m Term

moduleTrustReqs :: GhcMonad m => Module -> m (Bool, Set UnitId)

Return if a module is trusted and the pkgs it depends on to be trusted.

modInfoTyThings :: ModuleInfo -> [TyThing]

The list of top-level entities defined in a module

modInfoTopLevelScope :: ModuleInfo -> Maybe [Name]

modInfoSafe :: ModuleInfo -> SafeHaskellMode

Retrieve module safe haskell mode

modInfoRdrEnv :: ModuleInfo -> Maybe GlobalRdrEnv

modInfoModBreaks :: ModuleInfo -> ModBreaks

modInfoLookupName :: GhcMonad m => ModuleInfo -> Name -> m (Maybe TyThing)

modInfoIsExportedName :: ModuleInfo -> Name -> Bool

modInfoInstances :: ModuleInfo -> [ClsInst]

Returns the instances defined by the specified module. Warning: currently unimplemented for package modules.

modInfoIface :: ModuleInfo -> Maybe ModIface

modInfoExportsWithSelectors :: ModuleInfo -> [Name]

modInfoExports :: ModuleInfo -> [Name]

mkPrintUnqualifiedForModule :: GhcMonad m => ModuleInfo -> m (Maybe PrintUnqualified)

lookupName :: GhcMonad m => Name -> m (Maybe TyThing)

Returns the TyThing for a Name. The Name may refer to any entity known to GHC, including Names defined using runStmt.

lookupModule :: GhcMonad m => ModuleName -> Maybe FastString -> m Module

Like findModule, but differs slightly when the module refers to a source file, and the file has not been loaded via load. In this case, findModule will throw an error (module not loaded), but lookupModule will check to see whether the module can also be found in a package, and if so, that package Module will be returned. If not, the usual module-not-found error will be thrown.

lookupGlobalName :: GhcMonad m => Name -> m (Maybe TyThing)

Looks up a global name: that is, any top-level name in any visible module. Unlike lookupName, lookupGlobalName does not use the interactive context, and therefore does not require a preceding setContext.

loadModule :: (TypecheckedMod mod, GhcMonad m) => mod -> m mod

Load a module. Input doesn't need to be desugared.

A module must be loaded before dependent modules can be typechecked. This always includes generating a ModIface_ and, depending on the DynFlags's backend, may also include code generation.

This function will always cause recompilation and will always overwrite previous compilation results (potentially files on disk).

isModuleTrusted :: GhcMonad m => Module -> m Bool

Check that a module is safe to import (according to Safe Haskell).

We return True to indicate the import is safe and False otherwise although in the False case an error may be thrown first.

isLoaded :: GhcMonad m => ModuleName -> m Bool

Return True <==> module is loaded.

isDictonaryId :: Id -> Bool

interpretPackageEnv :: Logger -> DynFlags -> IO DynFlags

Find the package environment (if one exists)

We interpret the package environment as a set of package flags; to be specific, if we find a package environment file like

clear-package-db
global-package-db
package-db blah/package.conf.d
package-id id1
package-id id2

we interpret this as

[ -hide-all-packages
, -clear-package-db
, -global-package-db
, -package-db blah/package.conf.d
, -package-id id1
, -package-id id2
]

There's also an older syntax alias for package-id, which is just an unadorned package id

id1
id2

initGhcMonad :: GhcMonad m => Maybe FilePath -> m ()

Initialise a GHC session.

If you implement a custom GhcMonad you must call this function in the monad run function. It will initialise the session variable and clear all warnings.

The first argument should point to the directory where GHC's library files reside. More precisely, this should be the output of ghc --print-libdir of the version of GHC the module using this API is compiled with. For portability, you should use the ghc-paths package, available at http://hackage.haskell.org/package/ghc-paths.

guessTarget :: GhcMonad m => String -> Maybe Phase -> m Target

Attempts to guess what Target a string refers to. This function implements the --make/GHCi command-line syntax for filenames:

• if the string looks like a Haskell source filename, then interpret it as such
• if adding a .hs or .lhs suffix yields the name of an existing file, then use that
• otherwise interpret the string as a module name

getTokenStream :: GhcMonad m => Module -> m [Located Token]

Return module source as token stream, including comments.

The module must be in the module graph and its source must be available. Throws a SourceError on parse error.

getTargets :: GhcMonad m => m [Target]

Returns the current set of targets

getRichTokenStream :: GhcMonad m => Module -> m [(Located Token, String)]

Give even more information on the source than getTokenStream This function allows reconstructing the source completely with showRichTokenStream.

getProgramDynFlags :: GhcMonad m => m DynFlags

Returns the program DynFlags.

getPrintUnqual :: GhcMonad m => m PrintUnqualified

getNameToInstancesIndex

Arguments

:: GhcMonad m

=> [Module]

visible modules. An orphan instance will be returned if it is visible from at least one module in the list.

-> Maybe [Module]

modules to load. If this is not specified, we load modules for everything that is in scope unqualified.

-> m (Messages DecoratedSDoc, Maybe (NameEnv ([ClsInst], [FamInst])))

Retrieve all type and family instances in the environment, indexed by Name. Each name's lists will contain every instance in which that name is mentioned in the instance head.

getModuleInfo :: GhcMonad m => Module -> m (Maybe ModuleInfo)

Request information about a loaded Module

getModuleGraph :: GhcMonad m => m ModuleGraph

Get the module dependency graph.

getModSummary :: GhcMonad m => ModuleName -> m ModSummary

Return the ModSummary of a module with the given name.

The module must be part of the module graph (see hsc_mod_graph and ModuleGraph). If this is not the case, this function will throw a GhcApiError.

This function ignores boot modules and requires that there is only one non-boot module with the given name.

getInteractiveDynFlags :: GhcMonad m => m DynFlags

Get the DynFlags used to evaluate interactive expressions.

getInsts :: GhcMonad m => m ([ClsInst], [FamInst])

Return the instances for the current interactive session.

getHistorySpan :: GhcMonad m => History -> m SrcSpan

getGRE :: GhcMonad m => m GlobalRdrEnv

get the GlobalRdrEnv for a session

getGHCiMonad :: GhcMonad m => m Name

Get the monad GHCi lifts user statements into.

getBindings :: GhcMonad m => m [TyThing]

Return the bindings for the current interactive session.

findModule :: GhcMonad m => ModuleName -> Maybe FastString -> m Module

Takes a ModuleName and possibly a UnitId, and consults the filesystem and package database to find the corresponding Module, using the algorithm that is used for an import declaration.

findGlobalAnns :: (GhcMonad m, Typeable a) => ([Word8] -> a) -> AnnTarget Name -> m [a]

desugarModule :: GhcMonad m => TypecheckedModule -> m DesugaredModule

Desugar a typechecked module.

defaultErrorHandler :: ExceptionMonad m => FatalMessager -> FlushOut -> m a -> m a

Install some default exception handlers and run the inner computation. Unless you want to handle exceptions yourself, you should wrap this around the top level of your program. The default handlers output the error message(s) to stderr and exit cleanly.

defaultCleanupHandler :: ExceptionMonad m => DynFlags -> m a -> m a

This function is no longer necessary, cleanup is now done by runGhc/runGhcT.

dataConType :: DataCon -> Type

compileToCoreSimplified :: GhcMonad m => FilePath -> m CoreModule

Like compileToCoreModule, but invokes the simplifier, so as to return simplified and tidied Core.

compileToCoreModule :: GhcMonad m => FilePath -> m CoreModule

This is the way to get access to the Core bindings corresponding to a module. compileToCore parses, typechecks, and desugars the module, then returns the resulting Core module (consisting of the module name, type declarations, and function declarations) if successful.

addTarget :: GhcMonad m => Target -> m ()

Add another target.

addSourceToTokens :: RealSrcLoc -> StringBuffer -> [Located Token] -> [(Located Token, String)]

Given a source location and a StringBuffer corresponding to this location, return a rich token stream with the source associated to the tokens.

data LoadHowMuch

Describes which modules of the module graph need to be loaded.

Constructors

LoadAllTargets

Load all targets and its dependencies.

LoadUpTo ModuleName

Load only the given module and its dependencies.

LoadDependenciesOf ModuleName

Load only the dependencies of the given module, but not the module itself.

topSortModuleGraph

Arguments

:: Bool

Drop hi-boot nodes? (see below)

-> ModuleGraph

-> Maybe ModuleName

Root module name. If Nothing, use the full graph.

-> [SCC ModuleGraphNode]

Topological sort of the module graph

Calculate SCCs of the module graph, possibly dropping the hi-boot nodes The resulting list of strongly-connected-components is in topologically sorted order, starting with the module(s) at the bottom of the dependency graph (ie compile them first) and ending with the ones at the top.

Drop hi-boot nodes (first boolean arg)?

• False: treat the hi-boot summaries as nodes of the graph, so the graph must be acyclic
• True: eliminate the hi-boot nodes, and instead pretend the a source-import of Foo is an import of Foo The resulting graph has no hi-boot nodes, but can be cyclic

load :: GhcMonad m => LoadHowMuch -> m SuccessFlag

Try to load the program. See LoadHowMuch for the different modes.

This function implements the core of GHC's --make mode. It preprocesses, compiles and loads the specified modules, avoiding re-compilation wherever possible. Depending on the backend (see backend field) compiling and loading may result in files being created on disk.

Calls the defaultWarnErrLogger after each compiling each module, whether successful or not.

If errors are encountered during dependency analysis, the module depanalE returns together with the errors an empty ModuleGraph. After processing this empty ModuleGraph, the errors of depanalE are thrown. All other errors are reported using the defaultWarnErrLogger.

depanalE

Arguments

:: GhcMonad m

=> [ModuleName]

excluded modules

-> Bool

allow duplicate roots

-> m (ErrorMessages, ModuleGraph)

Perform dependency analysis like in depanal. In case of errors, the errors and an empty module graph are returned.

depanal

Arguments

:: GhcMonad m

=> [ModuleName]

excluded modules

-> Bool

allow duplicate roots

-> m ModuleGraph

Perform a dependency analysis starting from the current targets and update the session with the new module graph.

Dependency analysis entails parsing the import directives and may therefore require running certain preprocessors.

Note that each ModSummary in the module graph caches its DynFlags. These DynFlags are determined by the current session DynFlags and the OPTIONS and LANGUAGE pragmas of the parsed module. Thus if you want changes to the DynFlags to take effect you need to call this function again. In case of errors, just throw them.

cyclicModuleErr :: [ModuleGraphNode] -> SDoc

data GetDocsFailure

Failure modes for getDocs.

Constructors

NameHasNoModule Name

nameModule_maybe returned Nothing.

NoDocsInIface

This is probably because the module was loaded without -haddock, but it's also possible that the entire module contains no documentation.

Fields

• Module
• Bool

  True: The module was compiled. False: The module was :loaded.

InteractiveName

The Name was defined interactively.

Instances

Outputable GetDocsFailure

Defined in GHC.Runtime.Eval

Methods

ppr :: GetDocsFailure -> SDoc

typeKind :: GhcMonad m => Bool -> String -> m (Type, Kind)

Get the kind of a type

showModule :: GhcMonad m => ModSummary -> m String

setupBreakpoint :: GhcMonad m => HscEnv -> BreakInfo -> Int -> m ()

setContext :: GhcMonad m => [InteractiveImport] -> m ()

Set the interactive evaluation context.

(setContext imports) sets the ic_imports field (which in turn determines what is in scope at the prompt) to imports, and constructs the ic_rn_glb_env environment to reflect it.

We retain in scope all the things defined at the prompt, and kept in ic_tythings. (Indeed, they shadow stuff from ic_imports.)

runParsedDecls :: GhcMonad m => [LHsDecl GhcPs] -> m [Name]

Like runDeclsWithLocation, but takes parsed declarations as argument. Useful when doing preprocessing on the AST before execution, e.g. in GHCi (see GHCi.UI.runStmt).

runDeclsWithLocation :: GhcMonad m => String -> Int -> String -> m [Name]

Run some declarations and return any user-visible names that were brought into scope.

runDecls :: GhcMonad m => String -> m [Name]

resumeExec :: GhcMonad m => (SrcSpan -> Bool) -> SingleStep -> Maybe Int -> m ExecResult

reconstructType :: HscEnv -> Int -> Id -> IO (Maybe Type)

parseName :: GhcMonad m => String -> m [Name]

Parses a string as an identifier, and returns the list of Names that the identifier can refer to in the current interactive context.

parseInstanceHead :: GhcMonad m => String -> m Type

parseImportDecl :: GhcMonad m => String -> m (ImportDecl GhcPs)

parseExpr :: GhcMonad m => String -> m (LHsExpr GhcPs)

Parse an expression, the parsed expression can be further processed and passed to compileParsedExpr.

moduleIsInterpreted :: GhcMonad m => Module -> m Bool

Returns True if the specified module is interpreted, and hence has its full top-level scope available.

moduleIsBootOrNotObjectLinkable :: GhcMonad m => ModSummary -> m Bool

getResumeContext :: GhcMonad m => m [Resume]

getRdrNamesInScope :: GhcMonad m => m [RdrName]

Returns all RdrNames in scope in the current interactive context, excluding any that are internally-generated.

getNamesInScope :: GhcMonad m => m [Name]

Returns all names in scope in the current interactive context

getInstancesForType :: GhcMonad m => Type -> m [ClsInst]

getInfo :: GhcMonad m => Bool -> Name -> m (Maybe (TyThing, Fixity, [ClsInst], [FamInst], SDoc))

Looks up an identifier in the current interactive context (for :info) Filter the instances by the ones whose tycons (or clases resp) are in scope (qualified or otherwise). Otherwise we list a whole lot too many! The exact choice of which ones to show, and which to hide, is a judgement call. (see #1581)

getHistoryModule :: History -> Module

getDocs :: GhcMonad m => Name -> m (Either GetDocsFailure (Maybe HsDocString, IntMap HsDocString))

getContext :: GhcMonad m => m [InteractiveImport]

Get the interactive evaluation context, consisting of a pair of the set of modules from which we take the full top-level scope, and the set of modules from which we take just the exports respectively.

forward :: GhcMonad m => Int -> m ([Name], Int, SrcSpan, String)

exprType :: GhcMonad m => TcRnExprMode -> String -> m Type

Get the type of an expression Returns the type as described by TcRnExprMode

execStmt' :: GhcMonad m => GhciLStmt GhcPs -> String -> ExecOptions -> m ExecResult

Like execStmt, but takes a parsed statement as argument. Useful when doing preprocessing on the AST before execution, e.g. in GHCi (see GHCi.UI.runStmt).

execStmt

Arguments

:: GhcMonad m

=> String

a statement (bind or expression)

-> ExecOptions

-> m ExecResult

Run a statement in the current interactive context.

execOptions :: ExecOptions

default ExecOptions

dynCompileExpr :: GhcMonad m => String -> m Dynamic

Compile an expression, run it and return the result as a Dynamic.

compileParsedExprRemote :: GhcMonad m => LHsExpr GhcPs -> m ForeignHValue

Compile a parsed expression (before renaming), run it, and deliver the resulting HValue.

compileParsedExpr :: GhcMonad m => LHsExpr GhcPs -> m HValue

compileExprRemote :: GhcMonad m => String -> m ForeignHValue

Compile an expression, run it, and deliver the resulting HValue.

compileExpr :: GhcMonad m => String -> m HValue

Compile an expression, run it, and deliver the resulting HValue.

back :: GhcMonad m => Int -> m ([Name], Int, SrcSpan, String)

abandonAll :: GhcMonad m => m Bool

abandon :: GhcMonad m => m Bool

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)

runTcInteractive :: HscEnv -> TcRn a -> IO (Messages DecoratedSDoc, Maybe a)

isStmt :: ParserOpts -> String -> Bool

Returns True if passed string is a statement.

isImport :: ParserOpts -> String -> Bool

Returns True if passed string is an import declaration.

isDecl :: ParserOpts -> String -> Bool

Returns True if passed string is a declaration but not a splice.

hasImport :: ParserOpts -> String -> Bool

Returns True if passed string has an import declaration.

pprFamInst :: FamInst -> SDoc

Pretty-prints a FamInst (type/data family instance) with its defining location.

zonkTcType :: TcType -> TcPluginM TcType

zonkCt :: Ct -> TcPluginM Ct

tcPluginTrace :: String -> SDoc -> TcPluginM ()

Output useful for debugging the compiler.

tcPluginIO :: IO a -> TcPluginM a

Perform some IO, typically to interact with an external tool.

tcLookupTyCon :: Name -> TcPluginM TyCon

tcLookupId :: Name -> TcPluginM Id

tcLookupGlobal :: Name -> TcPluginM TyThing

tcLookupDataCon :: Name -> TcPluginM DataCon

tcLookupClass :: Name -> TcPluginM Class

tcLookup :: Name -> TcPluginM TcTyThing

setEvBind :: EvBind -> TcPluginM ()

Bind an evidence variable. This must not be invoked from tcPluginInit or tcPluginStop, or it will panic.

newWanted :: CtLoc -> PredType -> TcPluginM CtEvidence

Create a new wanted constraint.

newUnique :: TcPluginM Unique

newGiven :: CtLoc -> PredType -> EvExpr -> TcPluginM CtEvidence

Create a new given constraint, with the supplied evidence. This must not be invoked from tcPluginInit or tcPluginStop, or it will panic.

newFlexiTyVar :: Kind -> TcPluginM TcTyVar

newEvVar :: PredType -> TcPluginM EvVar

Create a fresh evidence variable.

newDerived :: CtLoc -> PredType -> TcPluginM CtEvidence

Create a new derived constraint.

newCoercionHole :: PredType -> TcPluginM CoercionHole

Create a fresh coercion hole.

matchFam :: TyCon -> [Type] -> TcPluginM (Maybe (TcCoercion, TcType))

lookupOrig :: Module -> OccName -> TcPluginM Name

isTouchableTcPluginM :: TcTyVar -> TcPluginM Bool

getTopEnv :: TcPluginM HscEnv

getInstEnvs :: TcPluginM InstEnvs

getFamInstEnvs :: TcPluginM (FamInstEnv, FamInstEnv)

getEnvs :: TcPluginM (TcGblEnv, TcLclEnv)

findImportedModule :: ModuleName -> Maybe FastString -> TcPluginM FindResult

data PluginWithArgs

Constructors

PluginWithArgs

Fields

• paPlugin :: Plugin

  the actual callable plugin

• paArguments :: [CommandLineOption]

  command line arguments for the plugin

data PluginRecompile

Constructors

ForceRecompile

NoForceRecompile

MaybeRecompile Fingerprint

Instances

Monoid PluginRecompile

Defined in GHC.Driver.Plugins

Methods

mempty :: PluginRecompile

mappend :: PluginRecompile -> PluginRecompile -> PluginRecompile

mconcat :: [PluginRecompile] -> PluginRecompile

Semigroup PluginRecompile

Defined in GHC.Driver.Plugins

Methods

(<>) :: PluginRecompile -> PluginRecompile -> PluginRecompile

sconcat :: NonEmpty PluginRecompile -> PluginRecompile

stimes :: Integral b => b -> PluginRecompile -> PluginRecompile

Outputable PluginRecompile

Defined in GHC.Driver.Plugins

Methods

ppr :: PluginRecompile -> SDoc

type FrontendPluginAction = [String] -> [(String, Maybe Phase)] -> Ghc ()

type CorePlugin = [CommandLineOption] -> [CoreToDo] -> CoreM [CoreToDo]

type CommandLineOption = String

Command line options gathered from the -PModule.Name:stuff syntax are given to you as this type

withPlugins_ :: Monad m => HscEnv -> ConstPluginOperation m a -> a -> m ()

Perform a constant operation by using all of the plugins in turn.

withPlugins :: Monad m => HscEnv -> PluginOperation m a -> a -> m a

Perform an operation by using all of the plugins in turn.

purePlugin :: [CommandLineOption] -> IO PluginRecompile

plugins :: HscEnv -> [PluginWithArgs]

pluginRecompile' :: PluginWithArgs -> IO PluginRecompile

mapPlugins :: HscEnv -> (Plugin -> [CommandLineOption] -> a) -> [a]

lpModuleName :: LoadedPlugin -> ModuleName

keepRenamedSource :: [CommandLineOption] -> TcGblEnv -> HsGroup GhcRn -> TcM (TcGblEnv, HsGroup GhcRn)

A renamer plugin which mades the renamed source available in a typechecker plugin.

impurePlugin :: [CommandLineOption] -> IO PluginRecompile

flagRecompile :: [CommandLineOption] -> IO PluginRecompile

defaultPlugin :: Plugin

Default plugin: does nothing at all, except for marking that safe inference has failed unless -fplugin-trustworthy is passed. For compatibility reason you should base all your plugin definitions on this default value.

defaultFrontendPlugin :: FrontendPlugin

data HoleFitPluginR

HoleFitPluginR adds a TcRef to hole fit plugins so that plugins can track internal state. Note the existential quantification, ensuring that the state cannot be modified from outside the plugin.

data WhereFrom

Constructors

ImportByUser IsBootInterface

ImportBySystem

ImportByPlugin

Instances

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

data ThStage

Constructors

Splice SpliceType

RunSplice (TcRef [ForeignRef (Q ())])

Comp

Brack ThStage PendingStuff

Instances

Outputable ThStage

Defined in GHC.Tc.Types

Methods

ppr :: ThStage -> SDoc

type ThLevel = Int

type TcTypeEnv = NameEnv TcTyThing

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

Outputable TcTyThing

Defined in GHC.Tc.Types

Methods

ppr :: TcTyThing -> SDoc

data TcSigInfo

Constructors

TcIdSig TcIdSigInfo

TcPatSynSig TcPatSynInfo

Instances

Outputable TcSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcSigInfo -> SDoc

type TcSigFun = Name -> Maybe TcSigInfo

type TcRnIf a b = IOEnv (Env a b)

type TcRn = TcRnIf TcGblEnv TcLclEnv

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 TcPluginSolver = [Ct] -> [Ct] -> [Ct] -> TcPluginM TcPluginResult

data TcPluginResult

Constructors

TcPluginContradiction [Ct]

The plugin found a contradiction. The returned constraints are removed from the inert set, and recorded as insoluble.

TcPluginOk [(EvTerm, Ct)] [Ct]

The first field is for constraints that were solved. These are removed from the inert set, and the evidence for them is recorded. The second field contains new work, that should be processed by the constraint solver.

data TcPluginM a

Instances

MonadFail TcPluginM

Defined in GHC.Tc.Types

Methods

fail :: String -> TcPluginM a

Applicative TcPluginM

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

Defined in GHC.Tc.Types

Methods

fmap :: (a -> b) -> TcPluginM a -> TcPluginM b

(<$) :: a -> TcPluginM b -> TcPluginM a

Monad TcPluginM

Defined in GHC.Tc.Types

Methods

(>>=) :: TcPluginM a -> (a -> TcPluginM b) -> TcPluginM b

(>>) :: TcPluginM a -> TcPluginM b -> TcPluginM b

return :: a -> TcPluginM a

data TcPlugin

Constructors

TcPlugin

Fields

• tcPluginInit :: TcPluginM s

  Initialize plugin, when entering type-checker.

• tcPluginSolve :: s -> TcPluginSolver

  Solve some constraints. TODO: WRITE MORE DETAILS ON HOW THIS WORKS.

• tcPluginStop :: s -> TcPluginM ()

  Clean up after the plugin, when exiting the type-checker.

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

Outputable TcPatSynInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcPatSynInfo -> SDoc

type TcM = TcRn

Historical "type-checking monad" (now it's just TcRn).

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

Outputable TcIdSigInst

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInst -> 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

Outputable TcIdSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInfo -> SDoc

type TcIdSet = IdSet

type TcId = Id

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 :: TcRef 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_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
• 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 LHsDocString

  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_safeInfer :: TcRef (Bool, WarningMessages)

  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_tc_plugins :: [TcPluginSolver]

  A list of user-defined plugins for the constraint solver.

• 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

Instances

ContainsModule TcGblEnv

Defined in GHC.Tc.Types

Methods

extractModule :: TcGblEnv -> Module

type TcBinderStack = [TcBinder]

data TcBinder

Constructors

TcIdBndr TcId TopLevelFlag

TcIdBndr_ExpType Name ExpType TopLevelFlag

TcTvBndr Name TyVar

Instances

HasOccName TcBinder

Defined in GHC.Tc.Types

Methods

occName :: TcBinder -> OccName

Outputable TcBinder

Defined in GHC.Tc.Types

Methods

ppr :: TcBinder -> SDoc

type THDocs = Map DocLoc String

The current collection of docs that Template Haskell has built up via putDoc.

data SpliceType

Constructors

Typed

Untyped

data SelfBootInfo

Constructors

NoSelfBoot

SelfBoot

Fields

• sb_mds :: ModDetails
• sb_tcs :: NameSet

type RoleAnnotEnv = NameEnv (LRoleAnnotDecl GhcRn)

type RnM = TcRn

Historical "renaming monad" (now it's just TcRn).

type RhsNames = NameSet

type RecFieldEnv = NameEnv [FieldLabel]

data PromotionErr

Constructors

TyConPE

ClassPE

FamDataConPE

ConstrainedDataConPE PredType

PatSynPE

RecDataConPE

NoDataKindsTC

NoDataKindsDC

Instances

Outputable PromotionErr

Defined in GHC.Tc.Types

Methods

ppr :: PromotionErr -> SDoc

data PendingStuff

Constructors

RnPendingUntyped (TcRef [PendingRnSplice])

RnPendingTyped

TcPending (TcRef [PendingTcSplice]) (TcRef WantedConstraints) QuoteWrapper

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 intruiging 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

data IsGroupClosed

IsGroupClosed describes a group of mutually-recursive bindings

Constructors

IsGroupClosed (NameEnv RhsNames) ClosedTypeId

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_dep_mods :: ModuleNameEnv ModuleNameWithIsBoot

  Home-package modules needed by the module being compiled

  It doesn't matter whether any of these dependencies are actually used when compiling the module; they are listed if they are below it at all. For example, suppose M imports A which imports X. Then compiling M might not need to consult X.hi, but X is still listed in M's dependencies.

• imp_dep_pkgs :: Set UnitId

  Packages needed by the module being compiled, whether directly, or via other modules in this package, or via modules imported from other packages.

• imp_trust_pkgs :: Set UnitId

  This is strictly a subset of imp_dep_pkgs and 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. While perhaps making imp_dep_pkgs a tuple of (UnitId, Bool) where True for the bool indicates the package is required to be trusted is the more logical design, doing so complicates a lot of code not concerned with Safe Haskell. See Note [Tracking Trust Transitively] in GHC.Rename.Names

• 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_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)

type IfM lcl = TcRnIf IfGblEnv lcl

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

type IfL = IfM IfLclEnv

data IfGblEnv

Constructors

IfGblEnv

Fields

• if_doc :: SDoc
• if_rec_types :: Maybe (Module, IfG TypeEnv)

type IfG = IfM ()

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

Outputable IdBindingInfo

Defined in GHC.Tc.Types

Methods

ppr :: IdBindingInfo -> SDoc

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

type ErrCtxt = (Bool, TidyEnv -> TcM (TidyEnv, SDoc))

data Env gbl lcl

Constructors

Env

Fields

• env_top :: !HscEnv
• env_um :: !Char
• env_gbl :: gbl
• env_lcl :: lcl

Instances

ContainsHooks (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractHooks :: Env gbl lcl -> Hooks

ContainsDynFlags (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractDynFlags :: Env gbl lcl -> DynFlags

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractModule :: Env gbl lcl -> Module

ContainsLogger (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractLogger :: Env gbl lcl -> Logger

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

Eq DocLoc

Defined in GHC.Tc.Types

Methods

(==) :: DocLoc -> DocLoc -> Bool

(/=) :: DocLoc -> DocLoc -> Bool

Ord DocLoc

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 ClosedTypeId = Bool

data ArrowCtxt

Constructors

NoArrowCtxt

ArrowCtxt LocalRdrEnv (TcRef WantedConstraints)

unsafeTcPluginTcM :: TcM a -> TcPluginM a

This function provides an escape for direct access to the TcM monad. It should not be used lightly, and the provided TcPluginM API should be favoured instead.

topStage :: ThStage

topSpliceStage :: ThStage

topAnnStage :: ThStage

thLevel :: ThStage -> ThLevel

tcVisibleOrphanMods :: TcGblEnv -> ModuleSet

tcTyThingCategory :: TcTyThing -> String

runTcPluginM :: TcPluginM a -> EvBindsVar -> TcM a

removeBindingShadowing :: HasOccName a => [a] -> [a]

pushErrCtxtSameOrigin :: ErrCtxt -> CtLoc -> CtLoc

pushErrCtxt :: CtOrigin -> ErrCtxt -> CtLoc -> CtLoc

pprTcTyThingCategory :: TcTyThing -> SDoc

pprPECategory :: PromotionErr -> SDoc

plusImportAvails :: ImportAvails -> ImportAvails -> ImportAvails

Union two ImportAvails

This function is a key part of Import handling, basically for each import we create a separate ImportAvails structure and then union them all together with this function.

peCategory :: PromotionErr -> String

outerLevel :: ThLevel

modDepsElts :: ModuleNameEnv ModuleNameWithIsBoot -> [ModuleNameWithIsBoot]

mkRoleAnnotEnv :: [LRoleAnnotDecl GhcRn] -> RoleAnnotEnv

mkModDeps :: [ModuleNameWithIsBoot] -> ModuleNameEnv ModuleNameWithIsBoot

lookupRoleAnnot :: RoleAnnotEnv -> Name -> Maybe (LRoleAnnotDecl GhcRn)

lintGblEnv :: Logger -> DynFlags -> TcGblEnv -> TcM ()

Check the TcGblEnv for consistency. Currently, only checks axioms, but should check other aspects, too.

isPartialSig :: TcIdSigInst -> Bool

impLevel :: ThLevel

hasCompleteSig :: TcSigFun -> Name -> Bool

No signature or a partial signature

getRoleAnnots :: [Name] -> RoleAnnotEnv -> [LRoleAnnotDecl GhcRn]

getPlatform :: TcM Platform

Get target platform

getEvBindsTcPluginM :: TcPluginM EvBindsVar

Access the EvBindsVar carried by the TcPluginM during constraint solving. Returns Nothing if invoked during tcPluginInit or tcPluginStop.

emptyRoleAnnotEnv :: RoleAnnotEnv

emptyImportAvails :: ImportAvails

type WarnErrLogger = forall (m :: Type -> Type). GhcMonad m => Maybe SourceError -> m ()

A function called to log warnings and errors.

data GhcT (m :: Type -> Type) a

A monad transformer to add GHC specific features to another monad.

Note that the wrapped monad must support IO and handling of exceptions.

Instances

MonadIO m => MonadIO (GhcT m)

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> GhcT m a

Applicative m => Applicative (GhcT m)

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

Functor m => Functor (GhcT m)

Defined in GHC.Driver.Monad

Methods

fmap :: (a -> b) -> GhcT m a -> GhcT m b

(<$) :: a -> GhcT m b -> GhcT m a

Monad m => Monad (GhcT m)

Defined in GHC.Driver.Monad

Methods

(>>=) :: GhcT m a -> (a -> GhcT m b) -> GhcT m b

(>>) :: GhcT m a -> GhcT m b -> GhcT m b

return :: a -> GhcT m a

MonadCatch m => MonadCatch (GhcT m)

Defined in GHC.Driver.Monad

Methods

catch :: Exception e => GhcT m a -> (e -> GhcT m a) -> GhcT m a

MonadMask m => MonadMask (GhcT m)

Defined in GHC.Driver.Monad

Methods

mask :: ((forall a. GhcT m a -> GhcT m a) -> GhcT m b) -> GhcT m b

uninterruptibleMask :: ((forall a. GhcT m a -> GhcT m a) -> GhcT m b) -> GhcT m b

generalBracket :: GhcT m a -> (a -> ExitCase b -> GhcT m c) -> (a -> GhcT m b) -> GhcT m (b, c)

MonadThrow m => MonadThrow (GhcT m)

Defined in GHC.Driver.Monad

Methods

throwM :: Exception e => e -> GhcT m a

ExceptionMonad m => GhcMonad (GhcT m)

Defined in GHC.Driver.Monad

Methods

getSession :: GhcT m HscEnv

setSession :: HscEnv -> GhcT m ()

MonadIO m => HasDynFlags (GhcT m)

Defined in GHC.Driver.Monad

Methods

getDynFlags :: GhcT m DynFlags

MonadIO m => HasLogger (GhcT m)

Defined in GHC.Driver.Monad

Methods

getLogger :: GhcT m 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.

Methods

getSession :: m HscEnv

setSession :: HscEnv -> m ()

Instances

GhcMonad Ghc

Defined in GHC.Driver.Monad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

ExceptionMonad m => GhcMonad (GhcT m)

Defined in GHC.Driver.Monad

Methods

getSession :: GhcT m HscEnv

setSession :: HscEnv -> GhcT m ()

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

MonadFix Ghc

Defined in GHC.Driver.Monad

Methods

mfix :: (a -> Ghc a) -> Ghc a

MonadIO Ghc

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> Ghc a

Applicative Ghc

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

Defined in GHC.Driver.Monad

Methods

fmap :: (a -> b) -> Ghc a -> Ghc b

(<$) :: a -> Ghc b -> Ghc a

Monad Ghc

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

Defined in GHC.Driver.Monad

Methods

catch :: Exception e => Ghc a -> (e -> Ghc a) -> Ghc a

MonadMask Ghc

Defined in GHC.Driver.Monad

Methods

mask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

uninterruptibleMask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

generalBracket :: Ghc a -> (a -> ExitCase b -> Ghc c) -> (a -> Ghc b) -> Ghc (b, c)

MonadThrow Ghc

Defined in GHC.Driver.Monad

Methods

throwM :: Exception e => e -> Ghc a

GhcMonad Ghc

Defined in GHC.Driver.Monad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

HasDynFlags Ghc

Defined in GHC.Driver.Monad

Methods

getDynFlags :: Ghc DynFlags

HasLogger Ghc

Defined in GHC.Driver.Monad

Methods

getLogger :: Ghc Logger

putMsgM :: GhcMonad m => SDoc -> m ()

Put a log message

putLogMsgM :: GhcMonad m => WarnReason -> Severity -> SrcSpan -> SDoc -> m ()

Put a log message

pushLogHookM :: GhcMonad m => (LogAction -> LogAction) -> m ()

Push a log hook on the stack

printException :: GhcMonad m => SourceError -> m ()

Print the error message and all warnings. Useful inside exception handlers. Clears warnings after printing.

popLogHookM :: GhcMonad m => m ()

Pop a log hook from the stack

modifyLogger :: GhcMonad m => (Logger -> Logger) -> m ()

Modify the logger

getSessionDynFlags :: GhcMonad m => m DynFlags

Grabs the DynFlags from the Session

defaultWarnErrLogger :: WarnErrLogger

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.

Constructors

HscEnv

Fields

• hsc_dflags :: DynFlags

  The dynamic flag settings

• hsc_targets :: [Target]

  The targets (or roots) of the current session

• hsc_mod_graph :: ModuleGraph

  The module graph of the current session

• hsc_IC :: InteractiveContext

  The context for evaluating interactive statements

• hsc_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 hsc_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.)

  hsc_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.)

• hsc_EPS :: !(IORef ExternalPackageState)

  Information about the currently loaded external packages. This is mutable because packages will be demand-loaded during a compilation run as required.

• hsc_NC :: !(IORef NameCache)

  As with hsc_EPS, this is side-effected by compiling to reflect sucking in interface files. They cache the state of external interface files, in effect.

• hsc_FC :: !(IORef FinderCache)

  The cached result of performing finding in the file system

• hsc_type_env_var :: Maybe (Module, IORef TypeEnv)

  Used for one-shot compilation only, to initialise the IfGblEnv. See tcg_type_env_var for TcGblEnv. See also Note [hsc_type_env_var hack]

• hsc_interp :: Maybe Interp

  target code interpreter (if any) to use for TH and GHCi. See Note [Target code interpreter]

• hsc_plugins :: ![LoadedPlugin]

  plugins dynamically loaded after processing arguments. What will be loaded here is directed by DynFlags.pluginModNames. Arguments are loaded from DynFlags.pluginModNameOpts.

  The purpose of this field is to cache the plugins so they don't have to be loaded each time they are needed. See initializePlugins.

• hsc_static_plugins :: ![StaticPlugin]

  static plugins which do not need dynamic loading. These plugins are intended to be added by GHC API users directly to this list.

  To add dynamically loaded plugins through the GHC API see addPluginModuleName instead.

• hsc_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!

• hsc_unit_env :: UnitEnv

  Unit environment (unit state, home unit, etc.).

  Initialized from the databases cached in hsc_unit_dbs and from the DynFlags.

• hsc_logger :: !Logger

  Logger

• hsc_hooks :: !Hooks

  Hooks

• hsc_tmpfs :: !TmpFs

  Temporary files

newtype Hsc a

The Hsc monad: Passing an environment and warning state

Constructors

Hsc (HscEnv -> WarningMessages -> IO (a, WarningMessages))

Instances

MonadIO Hsc

Defined in GHC.Driver.Env.Types

Methods

liftIO :: IO a -> Hsc a

Applicative Hsc

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

Functor Hsc

Defined in GHC.Driver.Env.Types

Methods

fmap :: (a -> b) -> Hsc a -> Hsc b

(<$) :: a -> Hsc b -> Hsc a

Monad Hsc

Defined in GHC.Driver.Env.Types

Methods

(>>=) :: Hsc a -> (a -> Hsc b) -> Hsc b

(>>) :: Hsc a -> Hsc b -> Hsc b

return :: a -> Hsc a

HasDynFlags Hsc

Defined in GHC.Driver.Env.Types

Methods

getDynFlags :: Hsc DynFlags

HasLogger Hsc

Defined in GHC.Driver.Env.Types

Methods

getLogger :: Hsc Logger

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

Outputable InteractiveImport

Defined in GHC.Runtime.Context

Methods

ppr :: InteractiveImport -> SDoc

type Xi = TcType

A Xi-type is one that has been fully rewritten with respect to the inert set; that is, it has been rewritten by the algorithm in GHC.Tc.Solver.Rewrite. (Historical note: Xi, for years and years, meant that a type was type-family-free. It does *not* mean this any more.)

data WantedConstraints

Constructors

WC

Fields

• wc_simple :: Cts
• wc_impl :: Bag Implication
• wc_holes :: Bag Hole

Instances

Outputable WantedConstraints

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: WantedConstraints -> SDoc

data TcEvDest

A place for type-checking evidence to go after it is generated. Wanted equalities are always HoleDest; other wanteds are always EvVarDest.

Constructors

EvVarDest EvVar

bind this var to the evidence EvVarDest is always used for non-type-equalities e.g. class constraints

HoleDest CoercionHole

fill in this hole with the evidence HoleDest is always used for type-equalities See Note [Coercion holes] in GHC.Core.TyCo.Rep

Instances

Outputable TcEvDest

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: TcEvDest -> SDoc

data SubGoalDepth

See Note [SubGoalDepth]

Instances

Outputable SubGoalDepth

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: SubGoalDepth -> SDoc

Eq SubGoalDepth

Defined in GHC.Tc.Types.Constraint

Methods

(==) :: SubGoalDepth -> SubGoalDepth -> Bool

(/=) :: SubGoalDepth -> SubGoalDepth -> Bool

Ord SubGoalDepth

Defined in GHC.Tc.Types.Constraint

Methods

compare :: SubGoalDepth -> SubGoalDepth -> Ordering

(<) :: SubGoalDepth -> SubGoalDepth -> Bool

(<=) :: SubGoalDepth -> SubGoalDepth -> Bool

(>) :: SubGoalDepth -> SubGoalDepth -> Bool

(>=) :: SubGoalDepth -> SubGoalDepth -> Bool

max :: SubGoalDepth -> SubGoalDepth -> SubGoalDepth

min :: SubGoalDepth -> SubGoalDepth -> SubGoalDepth

data ShadowInfo

Constructors

WDeriv

WOnly

Instances

Eq ShadowInfo

Defined in GHC.Tc.Types.Constraint

Methods

(==) :: ShadowInfo -> ShadowInfo -> Bool

(/=) :: ShadowInfo -> ShadowInfo -> Bool

data QCInst

Constructors

QCI

Fields

• qci_ev :: CtEvidence
• qci_tvs :: [TcTyVar]
• qci_pred :: TcPredType
• qci_pend_sc :: Bool

Instances

Outputable QCInst

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: QCInst -> SDoc

data Implication

Constructors

Implic

Fields

• ic_tclvl :: TcLevel
• ic_skols :: [TcTyVar]
• ic_info :: SkolemInfo
• ic_given :: [EvVar]
• ic_given_eqs :: HasGivenEqs
• ic_warn_inaccessible :: Bool
• ic_env :: TcLclEnv
• ic_wanted :: WantedConstraints
• ic_binds :: EvBindsVar
• ic_need_inner :: VarSet
• ic_need_outer :: VarSet
• ic_status :: ImplicStatus

Instances

Outputable Implication

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Implication -> SDoc

data ImplicStatus

Constructors

IC_Solved

Fields

• ics_dead :: [EvVar]

IC_Insoluble

IC_BadTelescope

IC_Unsolved

Instances

Outputable ImplicStatus

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: ImplicStatus -> SDoc

data HoleSort

Used to indicate which sort of hole we have.

Constructors

ExprHole HoleExprRef

Either an out-of-scope variable or a "true" hole in an expression (TypedHoles). The HoleExprRef says where to write the the erroring expression for -fdefer-type-errors.

TypeHole

A hole in a type (PartialTypeSignatures)

ConstraintHole

A hole in a constraint, like @f :: (_, Eq a) => ... Differentiated from TypeHole because a ConstraintHole is simplified differently. See Note [Do not simplify ConstraintHoles] in GHC.Tc.Solver.

Instances

Outputable HoleSort

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HoleSort -> SDoc

data Hole

A hole stores the information needed to report diagnostics about holes in terms (unbound identifiers or underscores) or in types (also called wildcards, as used in partial type signatures). See Note [Holes].

Constructors

Hole

Fields

• hole_sort :: HoleSort

  What flavour of hole is this?

• hole_occ :: OccName

  The name of this hole

• hole_ty :: TcType

  Type to be printed to the user For expression holes: type of expr For type holes: the missing type

• hole_loc :: CtLoc

  Where hole was written

Instances

Outputable Hole

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Hole -> SDoc

data HasGivenEqs

Constructors

NoGivenEqs

LocalGivenEqs

MaybeGivenEqs

Instances

Monoid HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

mempty :: HasGivenEqs

mappend :: HasGivenEqs -> HasGivenEqs -> HasGivenEqs

mconcat :: [HasGivenEqs] -> HasGivenEqs

Semigroup HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

(<>) :: HasGivenEqs -> HasGivenEqs -> HasGivenEqs

sconcat :: NonEmpty HasGivenEqs -> HasGivenEqs

stimes :: Integral b => b -> HasGivenEqs -> HasGivenEqs

Outputable HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HasGivenEqs -> SDoc

Eq HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

(==) :: HasGivenEqs -> HasGivenEqs -> Bool

(/=) :: HasGivenEqs -> HasGivenEqs -> Bool

type Cts = Bag Ct

data CtLoc

Constructors

CtLoc

Fields

• ctl_origin :: CtOrigin
• ctl_env :: TcLclEnv
• ctl_t_or_k :: Maybe TypeOrKind
• ctl_depth :: !SubGoalDepth

data CtIrredReason

Used to indicate extra information about why a CIrredCan is irreducible

Constructors

IrredShapeReason

this constraint has a non-canonical shape (e.g. c Int, for a variable c)

HoleBlockerReason HoleSet

this constraint is blocked on the coercion hole(s) listed See Note [Equalities with incompatible kinds] in GHC.Tc.Solver.Canonical Wrinkle (4a). Why store the HoleSet? See Wrinkle (2) of that same Note. INVARIANT: A HoleBlockerReason constraint is a homogeneous equality whose left hand side can fit in a CanEqLHS.

NonCanonicalReason CheckTyEqResult

an equality where some invariant other than (TyEq:H) of CEqCan is not satisfied; the CheckTyEqResult states exactly why INVARIANT: the CheckTyEqResult has some bit set other than cteHoleBlocker

ReprEqReason

an equality that cannot be decomposed because it is representational. Example: a b ~R# Int. These might still be solved later. INVARIANT: The constraint is a representational equality constraint

ShapeMismatchReason

a nominal equality that relates two wholly different types, like Int ~# Bool or a b ~# 3. INVARIANT: The constraint is a nominal equality constraint

AbstractTyConReason

an equality like T a b c ~ Q d e where either T or Q is an abstract type constructor. See Note [Skolem abstract data] in GHC.Core.TyCon. INVARIANT: The constraint is an equality constraint between two TyConApps

Instances

Outputable CtIrredReason

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtIrredReason -> SDoc

type CtFlavourRole = (CtFlavour, EqRel)

Whether or not one Ct can rewrite another is determined by its flavour and its equality relation. See also Note [Flavours with roles] in GHC.Tc.Solver.Monad

data CtFlavour

Constructors

Given

Wanted ShadowInfo

Derived

Instances

Outputable CtFlavour

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtFlavour -> SDoc

Eq CtFlavour

Defined in GHC.Tc.Types.Constraint

Methods

(==) :: CtFlavour -> CtFlavour -> Bool

(/=) :: CtFlavour -> CtFlavour -> Bool

data CtEvidence

Constructors

CtGiven

Fields

• ctev_pred :: TcPredType
• ctev_evar :: EvVar
• ctev_loc :: CtLoc

CtWanted

Fields

• ctev_pred :: TcPredType
• ctev_dest :: TcEvDest
• ctev_nosh :: ShadowInfo
• ctev_loc :: CtLoc

CtDerived

Fields

• ctev_pred :: TcPredType
• ctev_loc :: CtLoc

Instances

Outputable CtEvidence

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtEvidence -> SDoc

data Ct

Constructors

CDictCan

Fields

• cc_ev :: CtEvidence
• cc_class :: Class
• cc_tyargs :: [Xi]
• cc_pend_sc :: Bool

CIrredCan

Fields

• cc_ev :: CtEvidence
• cc_reason :: CtIrredReason

CEqCan

Fields

• cc_ev :: CtEvidence
• cc_lhs :: CanEqLHS
• cc_rhs :: Xi
• cc_eq_rel :: EqRel

CNonCanonical

Fields

• cc_ev :: CtEvidence

CQuantCan QCInst

Instances

Outputable Ct

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Ct -> SDoc

data CheckTyEqResult

A set of problems in checking the validity of a type equality. See checkTypeEq.

Instances

Monoid CheckTyEqResult

Defined in GHC.Tc.Types.Constraint

Methods

mempty :: CheckTyEqResult

mappend :: CheckTyEqResult -> CheckTyEqResult -> CheckTyEqResult

mconcat :: [CheckTyEqResult] -> CheckTyEqResult

Semigroup CheckTyEqResult

Defined in GHC.Tc.Types.Constraint

Methods

(<>) :: CheckTyEqResult -> CheckTyEqResult -> CheckTyEqResult

sconcat :: NonEmpty CheckTyEqResult -> CheckTyEqResult

stimes :: Integral b => b -> CheckTyEqResult -> CheckTyEqResult

Outputable CheckTyEqResult

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CheckTyEqResult -> SDoc

data CheckTyEqProblem

An individual problem that might be logged in a CheckTyEqResult

data CanEqLHS

A CanEqLHS is a type that can appear on the left of a canonical equality: a type variable or exactly-saturated type family application.

Constructors

TyVarLHS TcTyVar

TyFamLHS

Fields

• TyCon

  of the family

• [Xi]

  exactly saturating the family

Instances

Outputable CanEqLHS

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CanEqLHS -> SDoc

wrapType :: Type -> [TyVar] -> [PredType] -> Type

updateCtLocOrigin :: CtLoc -> (CtOrigin -> CtOrigin) -> CtLoc

unionsWC :: [WantedConstraints] -> WantedConstraints

tyCoVarsOfWCList :: WantedConstraints -> [TyCoVar]

Returns free variables of WantedConstraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfWC :: WantedConstraints -> TyCoVarSet

Returns free variables of WantedConstraints as a non-deterministic set. See Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfCtsList :: Cts -> [TcTyCoVar]

Returns free variables of a bag of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfCts :: Cts -> TcTyCoVarSet

Returns free variables of a bag of constraints as a non-deterministic set. See Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfCtList :: Ct -> [TcTyCoVar]

Returns free variables of constraints as a deterministically ordered. list. See Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfCt :: Ct -> TcTyCoVarSet

Returns free variables of constraints as a non-deterministic set

toKindLoc :: CtLoc -> CtLoc

Take a CtLoc and moves it to the kind level

superClassesMightHelp :: WantedConstraints -> Bool

True if taking superclasses of givens, or of wanteds (to perhaps expose more equalities or functional dependencies) might help to solve this constraint. See Note [When superclasses help]

subGoalDepthExceeded :: DynFlags -> SubGoalDepth -> Bool

snocCts :: Cts -> Ct -> Cts

singleCt :: Ct -> Cts

setCtLocSpan :: CtLoc -> RealSrcSpan -> CtLoc

setCtLocOrigin :: CtLoc -> CtOrigin -> CtLoc

setCtLocEnv :: CtLoc -> TcLclEnv -> CtLoc

setCtLoc :: Ct -> CtLoc -> Ct

pprEvVars :: [EvVar] -> SDoc

pprEvVarWithType :: EvVar -> SDoc

pprEvVarTheta :: [EvVar] -> SDoc

pprCts :: Cts -> SDoc

pprCtLoc :: CtLoc -> SDoc

mkTcEqPredLikeEv :: CtEvidence -> TcType -> TcType -> TcType

Makes a new equality predicate with the same role as the given evidence.

mkSimpleWC :: [CtEvidence] -> WantedConstraints

mkNonCanonicalCt :: Ct -> Ct

mkNonCanonical :: CtEvidence -> Ct

mkKindLoc :: TcType -> TcType -> CtLoc -> CtLoc

mkIrredCt :: CtIrredReason -> CtEvidence -> Ct

mkImplicWC :: Bag Implication -> WantedConstraints

mkGivens :: CtLoc -> [EvId] -> [Ct]

mkGivenLoc :: TcLevel -> SkolemInfo -> TcLclEnv -> CtLoc

maxSubGoalDepth :: SubGoalDepth -> SubGoalDepth -> SubGoalDepth

listToCts :: [Ct] -> Cts

isWantedCt :: Ct -> Bool

isWanted :: CtEvidence -> Bool

isUserTypeErrorCt :: Ct -> Bool

isSolvedWC :: WantedConstraints -> Bool

Checks whether a the given wanted constraints are solved, i.e. that there are no simple constraints left and all the implications are solved.

isSolvedStatus :: ImplicStatus -> Bool

isPendingScInst :: QCInst -> Maybe QCInst

isPendingScDict :: Ct -> Maybe Ct

isOutOfScopeHole :: Hole -> Bool

Does this hole represent an "out of scope" error? See Note [Insoluble holes]

isInsolubleStatus :: ImplicStatus -> Bool

isInsolubleReason :: CtIrredReason -> Bool

Are we sure that more solving will never solve this constraint?

isGivenLoc :: CtLoc -> Bool

isGivenCt :: Ct -> Bool

isGiven :: CtEvidence -> Bool

isEmptyWC :: WantedConstraints -> Bool

isEmptyCts :: Cts -> Bool

isDroppableCt :: Ct -> Bool

isDerivedCt :: Ct -> Bool

isDerived :: CtEvidence -> Bool

insolubleWC :: WantedConstraints -> Bool

insolubleImplic :: Implication -> Bool

insolubleEqCt :: Ct -> Bool

insolubleCt :: Ct -> Bool

initialSubGoalDepth :: SubGoalDepth

implicationPrototype :: Implication

getUserTypeErrorMsg :: Ct -> Maybe Type

A constraint is considered to be a custom type error, if it contains custom type errors anywhere in it. See Note [Custom type errors in constraints]

getPendingWantedScs :: Cts -> ([Ct], Cts)

extendCtsList :: Cts -> [Ct] -> Cts

eqMayRewriteFR :: CtFlavourRole -> CtFlavourRole -> Bool

eqCanRewriteFR :: CtFlavourRole -> CtFlavourRole -> Bool

eqCanRewrite :: EqRel -> EqRel -> Bool

eqCanEqLHS :: CanEqLHS -> CanEqLHS -> Bool

Are two CanEqLHSs equal?

eqCanDischargeFR :: CtFlavourRole -> CtFlavourRole -> Bool

emptyWC :: WantedConstraints

emptyCts :: Cts

dropMisleading :: WantedConstraints -> WantedConstraints

dropDerivedWC :: WantedConstraints -> WantedConstraints

dropDerivedSimples :: Cts -> Cts

ctsElts :: Cts -> [Ct]

cterSetOccursCheckSoluble :: CheckTyEqResult -> CheckTyEqResult

Mark a CheckTyEqResult as not having an insoluble occurs-check: any occurs check under a type family or in a representation equality is soluble.

cterRemoveProblem :: CheckTyEqResult -> CheckTyEqProblem -> CheckTyEqResult

cterHasProblem :: CheckTyEqResult -> CheckTyEqProblem -> Bool

Check whether a CheckTyEqResult has a CheckTyEqProblem

cterHasOnlyProblem :: CheckTyEqResult -> CheckTyEqProblem -> Bool

Check whether a CheckTyEqResult has one CheckTyEqProblem and no other

cterHasOccursCheck :: CheckTyEqResult -> Bool

cterHasNoProblem :: CheckTyEqResult -> Bool

Check whether a CheckTyEqResult is marked successful.

cterFromKind :: CheckTyEqResult -> CheckTyEqResult

Retain only information about occurs-check failures, because only that matters after recurring into a kind.

cterClearOccursCheck :: CheckTyEqResult -> CheckTyEqResult

cteTypeFamily :: CheckTyEqProblem

cteSolubleOccurs :: CheckTyEqProblem

cteProblem :: CheckTyEqProblem -> CheckTyEqResult

cteOK :: CheckTyEqResult

No problems in checking the validity of a type equality.

cteInsolubleOccurs :: CheckTyEqProblem

cteImpredicative :: CheckTyEqProblem

cteHoleBlocker :: CheckTyEqProblem

ctPred :: Ct -> PredType

ctOrigin :: Ct -> CtOrigin

ctLocTypeOrKind_maybe :: CtLoc -> Maybe TypeOrKind

ctLocSpan :: CtLoc -> RealSrcSpan

ctLocOrigin :: CtLoc -> CtOrigin

ctLocLevel :: CtLoc -> TcLevel

ctLocEnv :: CtLoc -> TcLclEnv

ctLocDepth :: CtLoc -> SubGoalDepth

ctLoc :: Ct -> CtLoc

ctFlavourRole :: Ct -> CtFlavourRole

Extract the flavour and role from a Ct

ctFlavourContainsDerived :: CtFlavour -> Bool

Does this CtFlavour subsumed Derived? True of [WD] and [D].

ctFlavour :: Ct -> CtFlavour

Get the flavour of the given Ct

ctEvidence :: Ct -> CtEvidence

ctEvTerm :: CtEvidence -> EvTerm

ctEvRole :: CtEvidence -> Role

Get the role relevant for a CtEvidence

ctEvPred :: CtEvidence -> TcPredType

ctEvOrigin :: CtEvidence -> CtOrigin

ctEvLoc :: CtEvidence -> CtLoc

ctEvId :: Ct -> EvVar

ctEvFlavourRole :: CtEvidence -> CtFlavourRole

Extract the flavour, role, and boxity from a CtEvidence

ctEvFlavour :: CtEvidence -> CtFlavour

ctEvExpr :: CtEvidence -> EvExpr

ctEvEvId :: CtEvidence -> EvVar

ctEvEqRel :: CtEvidence -> EqRel

Get the equality relation relevant for a CtEvidence

ctEvCoercion :: HasDebugCallStack => CtEvidence -> TcCoercion

ctEqRel :: Ct -> EqRel

Get the equality relation for the given Ct

consCts :: Ct -> Cts -> Cts

checkTelescopeSkol :: SkolemInfo -> Bool

canEqLHS_maybe :: Xi -> Maybe CanEqLHS

Is a type a canonical LHS? That is, is it a tyvar or an exactly-saturated type family application? Does not look through type synonyms.

canEqLHSType :: CanEqLHS -> TcType

Convert a CanEqLHS back into a Expr

canEqLHSKind :: CanEqLHS -> TcKind

Retrieve the kind of a CanEqLHS

bumpSubGoalDepth :: SubGoalDepth -> SubGoalDepth

bumpCtLocDepth :: CtLoc -> CtLoc

arisesFromGivens :: Ct -> Bool

andWC :: WantedConstraints -> WantedConstraints -> WantedConstraints

andManyCts :: [Cts] -> Cts

andCts :: Cts -> Cts -> Cts

addSimples :: WantedConstraints -> Bag Ct -> WantedConstraints

addInsols :: WantedConstraints -> Bag Ct -> WantedConstraints

addImplics :: WantedConstraints -> Bag Implication -> WantedConstraints

addHoles :: WantedConstraints -> Bag Hole -> WantedConstraints

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.

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

  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_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_doc_hdr :: Maybe HsDocString

  Module header.

• mi_decl_docs :: DeclDocMap

  Docs on declarations.

• mi_arg_docs :: ArgDocMap

  Docs on arguments.

• 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.

Instances

Binary ModIface

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)

Defined in GHC.Unit.Module.ModIface

Methods

rnf :: ModIface_ phase -> ()

type ModIface = ModIface_ 'ModIfaceFinal

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.

needsTemplateHaskellOrQQ :: ModuleGraph -> Bool

Determines whether a set of modules requires Template Haskell or Quasi Quotes

Note that if the session's DynFlags enabled Template Haskell when depanal was called, then each module in the returned module graph will have Template Haskell enabled whether it is actually needed or not.

mkModuleGraph :: [ExtendedModSummary] -> ModuleGraph

mgModSummaries :: ModuleGraph -> [ModSummary]

mgLookupModule :: ModuleGraph -> Module -> Maybe ModSummary

Look up a ModSummary in the ModuleGraph

mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph

Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.

emptyMG :: ModuleGraph

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_date :: UTCTime

  Timestamp of source file

• ms_obj_date :: Maybe UTCTime

  Timestamp of object, if we have one

• ms_iface_date :: Maybe UTCTime

  Timestamp of hi file, if we *only* are typechecking (it is Nothing otherwise. See Note [Recompilation checking in -fno-code mode] and #9243

• ms_hie_date :: Maybe UTCTime

  Timestamp of hie file, if we have one

• ms_srcimps :: [(Maybe FastString, Located ModuleName)]

  Source imports of the module

• ms_textual_imps :: [(Maybe FastString, Located ModuleName)]

  Non-source imports of the module from the module *text*

• 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

Outputable ModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ModSummary -> SDoc

ms_mod_name :: ModSummary -> ModuleName

data HsParsedModule

Constructors

HsParsedModule

Fields

• hpm_module :: Located HsModule
• hpm_src_files :: [FilePath]

  extra source files (e.g. from #includes). The lexer collects these from '# file line' pragmas, which the C preprocessor leaves behind. These files and their timestamps are stored in the .hi file, so that we can force recompilation if any of them change (#3589)

data HsModule

Haskell Module

All we actually declare here is the top-level structure for a module.

Constructors

HsModule

Fields

• hsmodAnn :: EpAnn AnnsModule
• hsmodLayout :: LayoutInfo

  Layout info for the module. For incomplete modules (e.g. the output of parseHeader), it is NoLayoutInfo.

• hsmodName :: Maybe (LocatedA ModuleName)

  Nothing: "module X where" is omitted (in which case the next field is Nothing too)

• hsmodExports :: Maybe (LocatedL [LIE GhcPs])

  Export list

  • Nothing: export list omitted, so export everything
  • Just []: export nothing
  • Just [...]: as you would expect...
  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodImports :: [LImportDecl GhcPs]

  We snaffle interesting stuff out of the imported interfaces early on, adding that info to TyDecls/etc; so this list is often empty, downstream.

• hsmodDecls :: [LHsDecl GhcPs]

  Type, class, value, and interface signature decls

• hsmodDeprecMessage :: Maybe (LocatedP WarningTxt)

  reason/explanation for warning/deprecation of this module

  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodHaddockModHeader :: Maybe LHsDocString

  Haddock module info and description, unparsed

  • AnnKeywordIds : AnnOpen ,AnnClose

Instances

Data HsModule

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsModule -> c HsModule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsModule

toConstr :: HsModule -> Constr

dataTypeOf :: HsModule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsModule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsModule)

gmapT :: (forall b. Data b => b -> b) -> HsModule -> HsModule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQ :: (forall d. Data d => d -> u) -> HsModule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsModule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

data AnnsModule

Constructors

AnnsModule

Fields

• am_main :: [AddEpAnn]
• am_decls :: AnnList

Instances

Data AnnsModule

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnsModule -> c AnnsModule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnsModule

toConstr :: AnnsModule -> Constr

dataTypeOf :: AnnsModule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnsModule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnsModule)

gmapT :: (forall b. Data b => b -> b) -> AnnsModule -> AnnsModule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnsModule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnsModule -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnsModule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnsModule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnsModule -> m AnnsModule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsModule -> m AnnsModule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsModule -> m AnnsModule

Eq AnnsModule

Defined in GHC.Hs

Methods

(==) :: AnnsModule -> AnnsModule -> Bool

(/=) :: AnnsModule -> AnnsModule -> Bool

data FloatBind

Constructors

FloatLet CoreBind

FloatCase CoreExpr Id AltCon [Var]

Instances

Outputable FloatBind

Defined in GHC.Core.Make

Methods

ppr :: FloatBind -> SDoc

wrapFloats :: [FloatBind] -> CoreExpr -> CoreExpr

Applies the floats from right to left. That is wrapFloats [b1, b2, …, bn] u = let b1 in let b2 in … in let bn in u

wrapFloat :: FloatBind -> CoreExpr -> CoreExpr

unitExpr :: CoreExpr

The unit expression

tYPE_ERROR_ID :: Id

sortQuantVars :: [Var] -> [Var]

rUNTIME_ERROR_ID :: Id

rEC_SEL_ERROR_ID :: Id

rEC_CON_ERROR_ID :: Id

pAT_ERROR_ID :: Id

nO_METHOD_BINDING_ERROR_ID :: Id

nON_EXHAUSTIVE_GUARDS_ERROR_ID :: Id

mkWordExpr :: Platform -> Integer -> CoreExpr

Create a CoreExpr which will evaluate to the a Word with the given value

mkWildValBinder :: Mult -> Type -> Id

Make a wildcard binder. This is typically used when you need a binder that you expect to use only at a *binding* site. Do not use it at occurrence sites because it has a single, fixed unique, and it's very easy to get into difficulties with shadowing. That's why it is used so little. See Note [WildCard binders] in GHC.Core.Opt.Simplify.Env

mkWildEvBinder :: PredType -> EvVar

mkWildCase :: CoreExpr -> Scaled Type -> Type -> [CoreAlt] -> CoreExpr

mkUncheckedIntExpr :: Integer -> CoreExpr

Create a CoreExpr which will evaluate to the given Int. Don't check that the number is in the range of the target platform Int

mkTupleSelector1

Arguments

:: [Id]

The Ids to pattern match the tuple against

-> Id

The Id to select

-> Id

A variable of the same type as the scrutinee

-> CoreExpr

Scrutinee

-> CoreExpr

Selector expression

Builds a selector which scrutises the given expression and extracts the one name from the list given. If you want the no-shadowing rule to apply, the caller is responsible for making sure that none of these names are in scope.

If there is just one Id in the tuple, then the selector is just the identity.

If necessary, we pattern match on a "big" tuple.

A tuple selector is not linear in its argument. Consequently, the case expression built by mkTupleSelector must consume its scrutinee Many times. And all the argument variables must have multiplicity Many.

mkTupleSelector

Arguments

:: [Id]

The Ids to pattern match the tuple against

-> Id

The Id to select

-> Id

A variable of the same type as the scrutinee

-> CoreExpr

Scrutinee

-> CoreExpr

Selector expression

mkTupleSelector1 is like mkTupleSelector but one-tuples are NOT flattened (see Note [Flattening one-tuples])

Builds a selector which scrutises the given expression and extracts the one name from the list given. If you want the no-shadowing rule to apply, the caller is responsible for making sure that none of these names are in scope.

If there is just one Id in the tuple, then the selector is just the identity.

If necessary, we pattern match on a "big" tuple.

A tuple selector is not linear in its argument. Consequently, the case expression built by mkTupleSelector must consume its scrutinee Many times. And all the argument variables must have multiplicity Many.

mkTupleCase

Arguments

:: UniqSupply

For inventing names of intermediate variables

-> [Id]

The tuple identifiers to pattern match on

-> CoreExpr

Body of the case

-> Id

A variable of the same type as the scrutinee

-> CoreExpr

Scrutinee

-> CoreExpr

A generalization of mkTupleSelector, allowing the body of the case to be an arbitrary expression.

To avoid shadowing, we use uniques to invent new variables.

If necessary we pattern match on a "big" tuple.

mkStringExprFSWith :: Monad m => (Name -> m Id) -> FastString -> m CoreExpr

mkStringExprFS :: MonadThings m => FastString -> m CoreExpr

Create a CoreExpr which will evaluate to a string morally equivalent to the given FastString

mkStringExpr :: MonadThings m => String -> m CoreExpr

Create a CoreExpr which will evaluate to the given String

mkSmallTupleSelector :: [Id] -> Id -> Id -> CoreExpr -> CoreExpr

mkSmallTupleSelector1 is like mkSmallTupleSelector but one-tuples are NOT flattened (see Note [Flattening one-tuples])

Like mkTupleSelector but for tuples that are guaranteed never to be "big".

mkSmallTupleSelector [x] x v e = [| e |]
mkSmallTupleSelector [x,y,z] x v e = [| case e of v { (x,y,z) -> x } |]

mkSmallTupleCase

Arguments

:: [Id]

The tuple args

-> CoreExpr

Body of the case

-> Id

A variable of the same type as the scrutinee

-> CoreExpr

Scrutinee

-> CoreExpr

As mkTupleCase, but for a tuple that is small enough to be guaranteed not to need nesting.

mkRuntimeErrorApp :: Id -> Type -> String -> CoreExpr

mkNothingExpr :: Type -> CoreExpr

Makes a Nothing for the specified type

mkNonEmptyListExpr :: Type -> CoreExpr -> [CoreExpr] -> CoreExpr

mkNilExpr :: Type -> CoreExpr

Makes a list [] for lists of the specified type

mkNaturalExpr :: Integer -> CoreExpr

Create a CoreExpr which will evaluate to the given Natural

mkListExpr :: Type -> [CoreExpr] -> CoreExpr

Make a list containing the given expressions, where the list has the given type

mkJustExpr :: Type -> CoreExpr -> CoreExpr

Makes a Just from a value of the specified type

mkIntegerExpr :: Integer -> CoreExpr

Create a CoreExpr which will evaluate to the given Integer

mkIntExprInt :: Platform -> Int -> CoreExpr

Create a CoreExpr which will evaluate to the given Int

mkIntExpr :: Platform -> Integer -> CoreExpr

Create a CoreExpr which will evaluate to the given Int

mkImpossibleExpr :: Type -> CoreExpr

mkIfThenElse :: CoreExpr -> CoreExpr -> CoreExpr -> CoreExpr

mkFoldrExpr

Arguments

:: MonadThings m

=> Type

Element type of the list

-> Type

Fold result type

-> CoreExpr

Cons function expression for the fold

-> CoreExpr

Nil expression for the fold

-> CoreExpr

List expression being folded acress

-> m CoreExpr

Make a fully applied foldr expression

mkFloatExpr :: Float -> CoreExpr

Create a CoreExpr which will evaluate to the given Float

mkDoubleExpr :: Double -> CoreExpr

Create a CoreExpr which will evaluate to the given Double

mkCoreVarTupTy :: [Id] -> Type

Build the type of a small tuple that holds the specified variables One-tuples are flattened; see Note [Flattening one-tuples]

mkCoreUbxTup :: [Type] -> [CoreExpr] -> CoreExpr

Build a small unboxed tuple holding the specified expressions, with the given types. The types must be the types of the expressions. Do not include the RuntimeRep specifiers; this function calculates them for you. Does not flatten one-tuples; see Note [Flattening one-tuples]

mkCoreUbxSum :: Int -> Int -> [Type] -> CoreExpr -> CoreExpr

Build an unboxed sum.

Alternative number ("alt") starts from 1.

mkCoreTupBoxity :: Boxity -> [CoreExpr] -> CoreExpr

Make a core tuple of the given boxity; don't flatten 1-tuples

mkCoreTup :: [CoreExpr] -> CoreExpr

Build a small tuple holding the specified expressions One-tuples are flattened; see Note [Flattening one-tuples]

mkCoreLets :: [CoreBind] -> CoreExpr -> CoreExpr

Bind a list of binding groups over an expression. The leftmost binding group becomes the outermost group in the resulting expression

mkCoreLet :: CoreBind -> CoreExpr -> CoreExpr

Bind a binding group over an expression, using a let or case as appropriate (see GHC.Core)

mkCoreLams :: [CoreBndr] -> CoreExpr -> CoreExpr

Create a lambda where the given expression has a number of variables bound over it. The leftmost binder is that bound by the outermost lambda in the result

mkCoreConApps :: DataCon -> [CoreExpr] -> CoreExpr

Construct an expression which represents the application of a number of expressions to that of a data constructor expression. The leftmost expression in the list is applied first

mkCoreApps :: CoreExpr -> [CoreExpr] -> CoreExpr infixl 4

Construct an expression which represents the application of a number of expressions to another. The leftmost expression in the list is applied first Respects the let/app invariant by building a case expression where necessary See Note [Core let/app invariant] in GHC.Core

mkCoreApp :: SDoc -> CoreExpr -> CoreExpr -> CoreExpr infixl 4

Construct an expression which represents the application of one expression to the other Respects the let/app invariant by building a case expression where necessary See Note [Core let/app invariant] in GHC.Core

mkConsExpr :: Type -> CoreExpr -> CoreExpr -> CoreExpr

Makes a list (:) for lists of the specified type

mkCharExpr :: Char -> CoreExpr

Create a CoreExpr which will evaluate to the given Char

mkBuildExpr

Arguments

:: (MonadFail m, MonadThings m, MonadUnique m)

=> Type

Type of list elements to be built

-> ((Id, Type) -> (Id, Type) -> m CoreExpr)

Function that, given information about the Ids of the binders for the build worker function, returns the body of that worker

-> m CoreExpr

Make a build expression applied to a locally-bound worker function

mkBigCoreVarTupTy :: [Id] -> Type

Build the type of a big tuple that holds the specified variables One-tuples are flattened; see Note [Flattening one-tuples]

mkBigCoreVarTup1 :: [Id] -> CoreExpr

mkBigCoreVarTup :: [Id] -> CoreExpr

Build a big tuple holding the specified variables One-tuples are flattened; see Note [Flattening one-tuples]

mkBigCoreTupTy :: [Type] -> Type

Build the type of a big tuple that holds the specified type of thing One-tuples are flattened; see Note [Flattening one-tuples]

mkBigCoreTup :: [CoreExpr] -> CoreExpr

Build a big tuple holding the specified expressions One-tuples are flattened; see Note [Flattening one-tuples]

mkAbsentErrorApp :: Type -> String -> CoreExpr

floatBindings :: FloatBind -> [Var]

errorIds :: [Id]

castBottomExpr :: CoreExpr -> Type -> CoreExpr

aBSENT_SUM_FIELD_ERROR_ID :: Id

aBSENT_ERROR_ID :: Id

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 :: Proxy p -> CollectFlag p -> XXPat p -> [IdP p] -> [IdP p]

Instances

IsPass p => CollectPass (GhcPass p)

Defined in GHC.Hs.Utils

Methods

collectXXPat :: Proxy (GhcPass p) -> CollectFlag (GhcPass p) -> XXPat (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

unitRecStmtTc :: RecStmtTc

unguardedRHS :: forall (p :: Pass) body. Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan => EpAnn GrhsAnn -> SrcSpan -> LocatedA (body (GhcPass p)) -> [LGRHS (GhcPass p) (LocatedA (body (GhcPass p)))]

unguardedGRHSs :: forall (p :: Pass) body. Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan => SrcSpan -> LocatedA (body (GhcPass p)) -> EpAnn GrhsAnn -> GRHSs (GhcPass p) (LocatedA (body (GhcPass p)))

spanHsLocaLBinds :: forall (p :: Pass). Data (HsLocalBinds (GhcPass p)) => HsLocalBinds (GhcPass p) -> SrcSpan

Return the SrcSpan encompassing the contents of any enclosed binds

nl_HsVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> HsExpr (GhcPass p)

nlWildPatName :: LPat GhcRn

Wildcard pattern - after renaming

nlWildPat :: LPat GhcPs

Wildcard pattern - after parsing

nlWildConPat :: DataCon -> LPat GhcPs

nlVarPat :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LPat (GhcPass p)

nlTuplePat :: [LPat GhcPs] -> Boxity -> LPat GhcPs

nlParPat :: forall (name :: Pass). LPat (GhcPass name) -> LPat (GhcPass name)

nlNullaryConPat :: RdrName -> LPat GhcPs

nlLitPat :: HsLit GhcPs -> LPat GhcPs

nlList :: [LHsExpr GhcPs] -> LHsExpr GhcPs

nlInfixConPat :: RdrName -> LPat GhcPs -> LPat GhcPs -> LPat GhcPs

nlHsVarApps :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> [IdP (GhcPass p)] -> LHsExpr (GhcPass p)

nlHsVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsExpr (GhcPass p)

nlHsTyVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsType (GhcPass p)

nlHsTyConApp :: forall (p :: Pass) a. IsSrcSpanAnn p a => LexicalFixity -> IdP (GhcPass p) -> [LHsTypeArg (GhcPass p)] -> LHsType (GhcPass p)

nlHsTyApps :: Id -> [Type] -> [LHsExpr GhcTc] -> LHsExpr GhcTc

nlHsTyApp :: Id -> [Type] -> LHsExpr GhcTc

nlHsSyntaxApps :: SyntaxExprTc -> [LHsExpr GhcTc] -> LHsExpr GhcTc

nlHsParTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsPar :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

nlHsOpApp :: LHsExpr GhcPs -> IdP GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs

nlHsLit :: forall (p :: Pass). HsLit (GhcPass p) -> LHsExpr (GhcPass p)

nlHsLam :: LMatch GhcPs (LHsExpr GhcPs) -> LHsExpr GhcPs

nlHsIntLit :: forall (p :: Pass). Integer -> LHsExpr (GhcPass p)

nlHsIf :: LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs

nlHsFunTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsDo :: HsStmtContext GhcRn -> [LStmt GhcPs (LHsExpr GhcPs)] -> LHsExpr GhcPs

nlHsDataCon :: DataCon -> LHsExpr GhcTc

NB: Only for LHsExpr Id.

nlHsCase :: LHsExpr GhcPs -> [LMatch GhcPs (LHsExpr GhcPs)] -> LHsExpr GhcPs

nlHsApps :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> [LHsExpr (GhcPass p)] -> LHsExpr (GhcPass p)

nlHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsAppKindTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsKind (GhcPass p) -> LHsType (GhcPass p)

nlHsApp :: forall (id :: Pass). IsPass id => LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

nlConVarPatName :: Name -> [Name] -> LPat GhcRn

nlConVarPat :: RdrName -> [RdrName] -> LPat GhcPs

nlConPatName :: Name -> [LPat GhcRn] -> LPat GhcRn

nlConPat :: RdrName -> [LPat GhcPs] -> LPat GhcPs

mkVarBind :: forall (p :: Pass). IdP (GhcPass p) -> LHsExpr (GhcPass p) -> LHsBind (GhcPass p)

mkUntypedSplice :: EpAnn [AddEpAnn] -> SpliceDecoration -> LHsExpr GhcPs -> HsSplice GhcPs

mkTypedSplice :: EpAnn [AddEpAnn] -> SpliceDecoration -> LHsExpr GhcPs -> HsSplice GhcPs

mkTransformStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkTransformByStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkTopFunBind :: Origin -> LocatedN Name -> [LMatch GhcRn (LHsExpr GhcRn)] -> HsBind GhcRn

In Name-land, with empty bind_fvs

mkTcBindStmt :: LPat GhcTc -> LocatedA (bodyR GhcTc) -> StmtLR GhcTc GhcTc (LocatedA (bodyR GhcTc))

mkSimpleMatch :: forall (p :: Pass) body. (Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA, Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan) => HsMatchContext (NoGhcTc (GhcPass p)) -> [LPat (GhcPass p)] -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p)))

mkSimpleGeneratedFunBind :: SrcSpan -> RdrName -> [LPat GhcPs] -> LHsExpr GhcPs -> LHsBind GhcPs

Convenience function using mkFunBind. This is for generated bindings only, do not use for user-written code.

mkRnBindStmt :: LPat GhcRn -> LocatedA (bodyR GhcRn) -> StmtLR GhcRn GhcRn (LocatedA (bodyR GhcRn))

mkRecStmt :: forall (idL :: Pass) bodyR. Anno [GenLocated (Anno (StmtLR (GhcPass idL) GhcPs bodyR)) (StmtLR (GhcPass idL) GhcPs bodyR)] ~ SrcSpanAnnL => EpAnn AnnList -> LocatedL [LStmtLR (GhcPass idL) GhcPs bodyR] -> StmtLR (GhcPass idL) GhcPs bodyR

mkPsBindStmt :: EpAnn [AddEpAnn] -> LPat GhcPs -> LocatedA (bodyR GhcPs) -> StmtLR GhcPs GhcPs (LocatedA (bodyR GhcPs))

mkPrefixFunRhs :: LIdP p -> HsMatchContext p

Make a prefix, non-strict function HsMatchContext

mkPatSynBind :: LocatedN RdrName -> HsPatSynDetails GhcPs -> LPat GhcPs -> HsPatSynDir GhcPs -> EpAnn [AddEpAnn] -> HsBind GhcPs

mkParPat :: forall (p :: Pass). IsPass p => LPat (GhcPass p) -> LPat (GhcPass p)

mkNPlusKPat :: LocatedN RdrName -> Located (HsOverLit GhcPs) -> EpAnn EpaLocation -> Pat GhcPs

mkNPat :: Located (HsOverLit GhcPs) -> Maybe (SyntaxExpr GhcPs) -> EpAnn [AddEpAnn] -> Pat GhcPs

mkMatchGroup :: forall (p :: Pass) body. AnnoBody p body => Origin -> LocatedL [LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p))))] -> MatchGroup (GhcPass p) (LocatedA (body (GhcPass p)))

mkMatch :: forall (p :: Pass). IsPass p => HsMatchContext (NoGhcTc (GhcPass p)) -> [LPat (GhcPass p)] -> LHsExpr (GhcPass p) -> HsLocalBinds (GhcPass p) -> LMatch (GhcPass p) (LHsExpr (GhcPass p))

mkLocatedList :: Semigroup a => [GenLocated (SrcAnn a) e2] -> LocatedAn an [GenLocated (SrcAnn a) e2]

mkLetStmt :: EpAnn [AddEpAnn] -> HsLocalBinds GhcPs -> StmtLR GhcPs GhcPs (LocatedA b)

mkLastStmt :: forall (idR :: Pass) bodyR (idL :: Pass). IsPass idR => LocatedA (bodyR (GhcPass idR)) -> StmtLR (GhcPass idL) (GhcPass idR) (LocatedA (bodyR (GhcPass idR)))

mkLHsWrapCo :: TcCoercionN -> LHsExpr GhcTc -> LHsExpr GhcTc

mkLHsWrap :: HsWrapper -> LHsExpr GhcTc -> LHsExpr GhcTc

mkLHsVarTuple :: forall (p :: Pass) a. IsSrcSpanAnn p a => [IdP (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

mkLHsTupleExpr :: forall (p :: Pass). [LHsExpr (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

mkLHsPar :: forall (id :: Pass). IsPass id => LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

Wrap in parens if hsExprNeedsParens appPrec says it needs them So f x becomes (f x), but 3 stays as 3.

mkLHsCmdWrap :: HsWrapper -> LHsCmd GhcTc -> LHsCmd GhcTc

mkHsWrapPatCo :: TcCoercionN -> Pat GhcTc -> Type -> Pat GhcTc

mkHsWrapPat :: HsWrapper -> Pat GhcTc -> Type -> Pat GhcTc

mkHsWrapCoR :: TcCoercionR -> HsExpr GhcTc -> HsExpr GhcTc

mkHsWrapCo :: TcCoercionN -> HsExpr GhcTc -> HsExpr GhcTc

mkHsWrap :: HsWrapper -> HsExpr GhcTc -> HsExpr GhcTc

Avoid HsWrap co1 (HsWrap co2 _) and HsWrap co1 (HsPar _ _) See Note [Detecting forced eta expansion] in GHC.HsToCore.Expr

mkHsVarBind :: SrcSpan -> RdrName -> LHsExpr GhcPs -> LHsBind GhcPs

mkHsStringPrimLit :: forall (p :: Pass). FastString -> HsLit (GhcPass p)

mkHsString :: forall (p :: Pass). String -> HsLit (GhcPass p)

mkHsSigEnv :: (LSig GhcRn -> Maybe ([LocatedN Name], a)) -> [LSig GhcRn] -> NameEnv a

mkHsQuasiQuote :: RdrName -> SrcSpan -> FastString -> HsSplice GhcPs

mkHsPar :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

e => (e)

mkHsOpApp :: LHsExpr GhcPs -> IdP GhcPs -> LHsExpr GhcPs -> HsExpr GhcPs

A useful function for building OpApps. The operator is always a variable, and we don't know the fixity yet.

mkHsLams :: [TyVar] -> [EvVar] -> LHsExpr GhcTc -> LHsExpr GhcTc

mkHsLam :: forall (p :: Pass). (IsPass p, XMG (GhcPass p) (LHsExpr (GhcPass p)) ~ NoExtField) => [LPat (GhcPass p)] -> LHsExpr (GhcPass p) -> LHsExpr (GhcPass p)

mkHsIsString :: SourceText -> FastString -> HsOverLit GhcPs

mkHsIntegral :: IntegralLit -> HsOverLit GhcPs

mkHsIf :: LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs -> EpAnn AnnsIf -> HsExpr GhcPs

mkHsFractional :: FractionalLit -> HsOverLit GhcPs

mkHsDoAnns :: HsStmtContext GhcRn -> LocatedL [ExprLStmt GhcPs] -> EpAnn AnnList -> HsExpr GhcPs

mkHsDo :: HsStmtContext GhcRn -> LocatedL [ExprLStmt GhcPs] -> HsExpr GhcPs

mkHsDictLet :: TcEvBinds -> LHsExpr GhcTc -> LHsExpr GhcTc

mkHsCompAnns :: HsStmtContext GhcRn -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> EpAnn AnnList -> HsExpr GhcPs

mkHsComp :: HsStmtContext GhcRn -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> HsExpr GhcPs

mkHsCmdWrap :: HsWrapper -> HsCmd GhcTc -> HsCmd GhcTc

mkHsCmdIf :: LHsExpr GhcPs -> LHsCmd GhcPs -> LHsCmd GhcPs -> EpAnn AnnsIf -> HsCmd GhcPs

mkHsCharPrimLit :: forall (p :: Pass). Char -> HsLit (GhcPass p)

mkHsCaseAlt :: forall (p :: Pass) body. (Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan, Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA) => LPat (GhcPass p) -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p)))

A simple case alternative with a single pattern, no binds, no guards; pre-typechecking

mkHsAppsWith :: forall (id :: Pass). (LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> HsExpr (GhcPass id) -> LHsExpr (GhcPass id)) -> LHsExpr (GhcPass id) -> [LHsExpr (GhcPass id)] -> LHsExpr (GhcPass id)

mkHsApps :: forall (id :: Pass). LHsExpr (GhcPass id) -> [LHsExpr (GhcPass id)] -> LHsExpr (GhcPass id)

mkHsAppWith :: forall (id :: Pass). (LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> HsExpr (GhcPass id) -> LHsExpr (GhcPass id)) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

mkHsAppTypes :: LHsExpr GhcRn -> [LHsWcType GhcRn] -> LHsExpr GhcRn

mkHsAppType :: LHsExpr GhcRn -> LHsWcType GhcRn -> LHsExpr GhcRn

mkHsApp :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

mkGroupUsingStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkGroupByUsingStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkFunBind :: Origin -> LocatedN RdrName -> [LMatch GhcPs (LHsExpr GhcPs)] -> HsBind GhcPs

Not infix, with place holders for coercion and free vars

mkClassOpSigs :: [LSig GhcPs] -> [LSig GhcPs]

Convert TypeSig to ClassOpSig. The former is what is parsed, but the latter is what we need in class/instance declarations

mkChunkified

Arguments

:: ([a] -> a)

"Small" constructor function, of maximum input arity mAX_TUPLE_SIZE

-> [a]

Possible "big" list of things to construct from

-> a

Constructed thing made possible by recursive decomposition

Lifts a "small" constructor into a "big" constructor by recursive decomposition

mkBodyStmt :: forall bodyR (idL :: Pass). LocatedA (bodyR GhcPs) -> StmtLR (GhcPass idL) GhcPs (LocatedA (bodyR GhcPs))

mkBigLHsVarTup :: forall (p :: Pass) a. IsSrcSpanAnn p a => [IdP (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

The Big equivalents for the source tuple expressions

mkBigLHsVarPatTup :: [IdP GhcRn] -> LPat GhcRn

The Big equivalents for the source tuple patterns

mkBigLHsTup :: forall (id :: Pass). [LHsExpr (GhcPass id)] -> XExplicitTuple (GhcPass id) -> LHsExpr (GhcPass id)

mkBigLHsPatTup :: [LPat GhcRn] -> LPat GhcRn

missingTupArg :: EpAnn EpaLocation -> HsTupArg GhcPs

lStmtsImplicits :: forall (idR :: Pass) (body :: Type -> Type). [LStmtLR GhcRn (GhcPass idR) (LocatedA (body (GhcPass idR)))] -> [(SrcSpan, [Name])]

lPatImplicits :: LPat GhcRn -> [(SrcSpan, [Name])]

isUnliftedHsBind :: HsBind GhcTc -> Bool

Should we treat this as an unlifted bind? This will be true for any bind that binds an unlifted variable, but we must be careful around AbsBinds. See Note [Unlifted id check in isUnliftedHsBind]. For usage information, see Note [Strict binds checks] is GHC.HsToCore.Binds.

isInfixFunBind :: forall id1 id2. UnXRec id2 => HsBindLR id1 id2 -> Bool

If any of the matches in the FunBind are infix, the FunBind is considered infix.

isBangedHsBind :: HsBind GhcTc -> Bool

Is a binding a strict variable or pattern bind (e.g. !x = ...)?

hsValBindsImplicits :: forall (idR :: Pass). HsValBindsLR GhcRn (GhcPass idR) -> [(SrcSpan, [Name])]

hsTypeToHsSigWcType :: LHsType GhcPs -> LHsSigWcType GhcPs

Convert an LHsType to an LHsSigWcType.

hsTypeToHsSigType :: LHsType GhcPs -> LHsSigType GhcPs

Convert an LHsType to an LHsSigType.

hsTyClForeignBinders :: [TyClGroup GhcRn] -> [LForeignDecl GhcRn] -> [Name]

hsPatSynSelectors :: forall (p :: Pass). IsPass p => HsValBinds (GhcPass p) -> [FieldOcc (GhcPass p)]

Collects record pattern-synonym selectors only; the pattern synonym names are collected by collectHsValBinders.

hsLTyClDeclBinders :: forall (p :: Pass). IsPass p => LocatedA (TyClDecl (GhcPass p)) -> ([LocatedA (IdP (GhcPass p))], [LFieldOcc (GhcPass p)])

Returns all the binding names of the decl. The first one is guaranteed to be the name of the decl. The first component represents all binding names except record fields; the second represents field occurrences. For record fields mentioned in multiple constructors, the SrcLoc will be from the first occurrence.

Each returned (Located name) has a SrcSpan for the whole declaration. See Note [SrcSpan for binders]

hsGroupBinders :: HsGroup GhcRn -> [Name]

hsForeignDeclsBinders :: forall (p :: Pass) a. (UnXRec (GhcPass p), IsSrcSpanAnn p a) => [LForeignDecl (GhcPass p)] -> [LIdP (GhcPass p)]

See Note [SrcSpan for binders]

hsDataFamInstBinders :: forall (p :: Pass). IsPass p => DataFamInstDecl (GhcPass p) -> ([LocatedA (IdP (GhcPass p))], [LFieldOcc (GhcPass p)])

the SrcLoc returned are for the whole declarations, not just the names

getPatSynBinds :: UnXRec id => [(RecFlag, LHsBinds id)] -> [PatSynBind id id]

emptyTransStmt :: EpAnn [AddEpAnn] -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

emptyRecStmtName :: Anno [GenLocated (Anno (StmtLR GhcRn GhcRn bodyR)) (StmtLR GhcRn GhcRn bodyR)] ~ SrcSpanAnnL => StmtLR GhcRn GhcRn bodyR

emptyRecStmtId :: Stmt GhcTc (LocatedA (HsCmd GhcTc))

emptyRecStmt :: forall (idL :: Pass) bodyR. Anno [GenLocated (Anno (StmtLR (GhcPass idL) GhcPs bodyR)) (StmtLR (GhcPass idL) GhcPs bodyR)] ~ SrcSpanAnnL => StmtLR (GhcPass idL) GhcPs bodyR

collectStmtsBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> [StmtLR (GhcPass idL) (GhcPass idR) body] -> [IdP (GhcPass idL)]

collectStmtBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> StmtLR (GhcPass idL) (GhcPass idR) body -> [IdP (GhcPass idL)]

collectPatsBinders :: CollectPass p => CollectFlag p -> [LPat p] -> [IdP p]

collectPatBinders :: CollectPass p => CollectFlag p -> LPat p -> [IdP p]

collectMethodBinders :: UnXRec idL => LHsBindsLR idL idR -> [LIdP idL]

Used exclusively for the bindings of an instance decl which are all FunBinds

collectLocalBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsLocalBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

collectLStmtsBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> [LStmtLR (GhcPass idL) (GhcPass idR) body] -> [IdP (GhcPass idL)]

collectLStmtBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> LStmtLR (GhcPass idL) (GhcPass idR) body -> [IdP (GhcPass idL)]

collectHsValBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsValBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

collectHsIdBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsValBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

Collect Id binders only, or Ids + pattern synonyms, respectively

collectHsBindsBinders :: CollectPass p => CollectFlag p -> LHsBindsLR p idR -> [IdP p]

collectHsBindListBinders :: CollectPass p => CollectFlag p -> [LHsBindLR p idR] -> [IdP p]

Same as collectHsBindsBinders, but works over a list of bindings

collectHsBindBinders :: CollectPass p => CollectFlag p -> HsBindLR p idR -> [IdP p]

Collect both Ids and pattern-synonym binders

chunkify :: [a] -> [[a]]

Split a list into lists that are small enough to have a corresponding tuple arity. The sub-lists of the result all have length <= mAX_TUPLE_SIZE But there may be more than mAX_TUPLE_SIZE sub-lists

data Token

Instances

Show Token

Defined in GHC.Parser.Lexer

Methods

showsPrec :: Int -> Token -> ShowS

show :: Token -> String

showList :: [Token] -> ShowS

Outputable Token

Defined in GHC.Parser.Lexer

Methods

ppr :: Token -> SDoc

data XXExprGhcTc

Constructors

WrapExpr !(HsWrap HsExpr)

ExpansionExpr !(HsExpansion (HsExpr GhcRn) (HsExpr GhcTc))

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 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

Outputable SyntaxExprTc

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

Outputable SyntaxExprRn

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

data RecordUpdTc

Extra data fields for a RecordUpd, added by the type checker

Constructors

RecordUpdTc

Fields

• rupd_cons :: [ConLike]
• rupd_in_tys :: [Type]
• rupd_out_tys :: [Type]
• rupd_wrap :: HsWrapper

data RecStmtTc

Constructors

RecStmtTc

Fields

• recS_bind_ty :: Type
• recS_later_rets :: [PostTcExpr]
• recS_rec_rets :: [PostTcExpr]
• recS_ret_ty :: Type

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

data PendingTcSplice

Pending Type-checker Splice

Constructors

PendingTcSplice SplicePointName (LHsExpr GhcTc)

Instances

Outputable PendingTcSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingTcSplice -> SDoc

data PendingRnSplice

Pending Renamer Splice

Constructors

PendingRnSplice UntypedSpliceFlavour SplicePointName (LHsExpr GhcRn)

Instances

Outputable PendingRnSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingRnSplice -> SDoc

data HsWrap (hs_syn :: Type -> Type)

HsWrap appears only in typechecker output Invariant: The contained Expr is *NOT* itself an HsWrap. See Note [Detecting forced eta expansion] in GHC.HsToCore.Expr. This invariant is maintained by mkHsWrap. hs_syn is something like HsExpr or HsCmd

Constructors

HsWrap HsWrapper (hs_syn GhcTc)

Instances

(Data (hs_syn GhcTc), Typeable hs_syn) => Data (HsWrap hs_syn)

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)

newtype HsSplicedT

Constructors

HsSplicedT DelayedSplice

Instances

Data HsSplicedT

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsSplicedT -> c HsSplicedT

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsSplicedT

toConstr :: HsSplicedT -> Constr

dataTypeOf :: HsSplicedT -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsSplicedT)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsSplicedT)

gmapT :: (forall b. Data b => b -> b) -> HsSplicedT -> HsSplicedT

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsSplicedT -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsSplicedT -> r

gmapQ :: (forall d. Data d => d -> u) -> HsSplicedT -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsSplicedT -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsSplicedT -> m HsSplicedT

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSplicedT -> m HsSplicedT

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSplicedT -> m HsSplicedT

data HsExpansion a b

Constructors

HsExpanded a b

Instances

(Data a, Data b) => Data (HsExpansion a b)

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> HsExpansion a b -> c (HsExpansion a b)

gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsExpansion a b)

toConstr :: HsExpansion a b -> Constr

dataTypeOf :: HsExpansion a b -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsExpansion a b))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsExpansion a b))

gmapT :: (forall b0. Data b0 => b0 -> b0) -> HsExpansion a b -> HsExpansion a b

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsExpansion a b -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsExpansion a b -> r

gmapQ :: (forall d. Data d => d -> u) -> HsExpansion a b -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsExpansion a b -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsExpansion a b -> m (HsExpansion a b)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsExpansion a b -> m (HsExpansion a b)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsExpansion a b -> m (HsExpansion a b)

(Outputable a, Outputable b) => Outputable (HsExpansion a b)

Just print the original expression (the a).

Defined in GHC.Hs.Expr

Methods

ppr :: HsExpansion a b -> SDoc

data GrhsAnn

Constructors

GrhsAnn

Fields

• ga_vbar :: Maybe EpaLocation
• ga_sep :: AddEpAnn

  Match separator location

Instances

Data GrhsAnn

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

Defined in GHC.Hs.Expr

Methods

ppr :: GrhsAnn -> SDoc

data EpAnnUnboundVar

Constructors

EpAnnUnboundVar

Fields

• hsUnboundBackquotes :: (EpaLocation, EpaLocation)
• hsUnboundHole :: EpaLocation

Instances

Data EpAnnUnboundVar

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

Data EpAnnHsCase

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 DelayedSplice

Constructors

DelayedSplice TcLclEnv (LHsExpr GhcRn) TcType (LHsExpr GhcTc)

Instances

Data DelayedSplice

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 CmdTopTc

Constructors

CmdTopTc Type Type (CmdSyntaxTable GhcTc)

data AnnsLet

Constructors

AnnsLet

Fields

• alLet :: EpaLocation
• alIn :: EpaLocation

Instances

Data AnnsLet

Defined in GHC.Hs.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnsLet -> c AnnsLet

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnsLet

toConstr :: AnnsLet -> Constr

dataTypeOf :: AnnsLet -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnsLet)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnsLet)

gmapT :: (forall b. Data b => b -> b) -> AnnsLet -> AnnsLet

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnsLet -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnsLet -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnsLet -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnsLet -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnsLet -> m AnnsLet

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsLet -> m AnnsLet

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnsLet -> m AnnsLet

data AnnsIf

Constructors

AnnsIf

Fields

• aiIf :: EpaLocation
• aiThen :: EpaLocation
• aiElse :: EpaLocation
• aiThenSemi :: Maybe EpaLocation
• aiElseSemi :: Maybe EpaLocation

Instances

Data AnnsIf

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

Data AnnProjection

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

Data AnnFieldLabel

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

Data AnnExplicitSum

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

tupArgPresent :: forall (p :: Pass). HsTupArg (GhcPass p) -> Bool

thTyBrackets :: SDoc -> SDoc

thBrackets :: SDoc -> SDoc -> SDoc

stripParensLHsExpr :: forall (p :: Pass). LHsExpr (GhcPass p) -> LHsExpr (GhcPass p)

stripParensHsExpr :: forall (p :: Pass). HsExpr (GhcPass p) -> HsExpr (GhcPass p)

ppr_splice_decl :: forall (p :: Pass). OutputableBndrId p => HsSplice (GhcPass p) -> SDoc

ppr_splice :: forall (p :: Pass). OutputableBndrId p => SDoc -> IdP (GhcPass p) -> LHsExpr (GhcPass p) -> SDoc -> SDoc

ppr_quasi :: OutputableBndr p => p -> p -> FastString -> SDoc

ppr_module_name_prefix :: Maybe ModuleName -> SDoc

ppr_lexpr :: forall (p :: Pass). OutputableBndrId p => LHsExpr (GhcPass p) -> SDoc

ppr_lcmd :: forall (p :: Pass). OutputableBndrId p => LHsCmd (GhcPass p) -> SDoc

ppr_infix_expr :: forall (p :: Pass). OutputableBndrId p => HsExpr (GhcPass p) -> Maybe SDoc

ppr_expr :: forall (p :: Pass). OutputableBndrId p => HsExpr (GhcPass p) -> SDoc

ppr_do_stmts :: forall (idL :: Pass) (idR :: Pass) body. (OutputableBndrId idL, OutputableBndrId idR, Anno (StmtLR (GhcPass idL) (GhcPass idR) body) ~ SrcSpanAnnA, Outputable body) => [LStmtLR (GhcPass idL) (GhcPass idR) body] -> SDoc

ppr_cmd :: forall (p :: Pass). OutputableBndrId p => HsCmd (GhcPass p) -> SDoc

ppr_apps :: forall (p :: Pass). OutputableBndrId p => HsExpr (GhcPass p) -> [Either (LHsExpr (GhcPass p)) (LHsWcType (NoGhcTc (GhcPass p)))] -> SDoc

pprTransformStmt :: forall (p :: Pass). OutputableBndrId p => [IdP (GhcPass p)] -> LHsExpr (GhcPass p) -> Maybe (LHsExpr (GhcPass p)) -> SDoc

pprTransStmt :: Outputable body => Maybe body -> body -> TransForm -> SDoc

pprStmtInCtxt :: forall (idL :: Pass) (idR :: Pass) body. (OutputableBndrId idL, OutputableBndrId idR, Outputable body, Anno (StmtLR (GhcPass idL) (GhcPass idR) body) ~ SrcSpanAnnA) => HsStmtContext (GhcPass idL) -> StmtLR (GhcPass idL) (GhcPass idR) body -> SDoc

pprStmt :: forall (idL :: Pass) (idR :: Pass) body. (OutputableBndrId idL, OutputableBndrId idR, Anno (StmtLR (GhcPass idL) (GhcPass idR) body) ~ SrcSpanAnnA, Outputable body) => StmtLR (GhcPass idL) (GhcPass idR) body -> SDoc

pprQuals :: forall (p :: Pass) body. (OutputableBndrId p, Outputable body, Anno (StmtLR (GhcPass p) (GhcPass p) body) ~ SrcSpanAnnA) => [LStmt (GhcPass p) body] -> SDoc

pprPendingSplice :: forall (p :: Pass). OutputableBndrId p => SplicePointName -> LHsExpr (GhcPass p) -> SDoc

pprParendLExpr :: forall (p :: Pass). OutputableBndrId p => PprPrec -> LHsExpr (GhcPass p) -> SDoc

pprParendExpr :: forall (p :: Pass). OutputableBndrId p => PprPrec -> HsExpr (GhcPass p) -> SDoc

pprMatches :: forall (idR :: Pass) body. (OutputableBndrId idR, Outputable body) => MatchGroup (GhcPass idR) body -> SDoc

pprMatchInCtxt :: forall (idR :: Pass) body. (OutputableBndrId idR, Outputable body) => Match (GhcPass idR) body -> SDoc

pprMatch :: forall (idR :: Pass) body. (OutputableBndrId idR, Outputable body) => Match (GhcPass idR) body -> SDoc

pprLCmd :: forall (p :: Pass). OutputableBndrId p => LHsCmd (GhcPass p) -> SDoc

pprHsBracket :: forall (p :: Pass). OutputableBndrId p => HsBracket (GhcPass p) -> SDoc

pprGRHSs :: forall (idR :: Pass) body passL. (OutputableBndrId idR, Outputable body) => HsMatchContext passL -> GRHSs (GhcPass idR) body -> SDoc

pprGRHS :: forall (idR :: Pass) body passL. (OutputableBndrId idR, Outputable body) => HsMatchContext passL -> GRHS (GhcPass idR) body -> SDoc

pprDo :: forall (p :: Pass) body any. (OutputableBndrId p, Outputable body, Anno (StmtLR (GhcPass p) (GhcPass p) body) ~ SrcSpanAnnA) => HsStmtContext any -> [LStmt (GhcPass p) body] -> SDoc

pprDebugParendExpr :: forall (p :: Pass). OutputableBndrId p => PprPrec -> LHsExpr (GhcPass p) -> SDoc

pprComp :: forall (p :: Pass) body. (OutputableBndrId p, Outputable body, Anno (StmtLR (GhcPass p) (GhcPass p) body) ~ SrcSpanAnnA) => [LStmt (GhcPass p) body] -> SDoc

pprCmdArg :: forall (p :: Pass). OutputableBndrId p => HsCmdTop (GhcPass p) -> SDoc

pprCmd :: forall (p :: Pass). OutputableBndrId p => HsCmd (GhcPass p) -> SDoc

pprBy :: Outputable body => Maybe body -> SDoc

pprBinds :: forall (idL :: Pass) (idR :: Pass). (OutputableBndrId idL, OutputableBndrId idR) => HsLocalBindsLR (GhcPass idL) (GhcPass idR) -> SDoc

pprBindStmt :: (Outputable pat, Outputable expr) => pat -> expr -> SDoc

pprArg :: forall (idL :: Pass). OutputableBndrId idL => ApplicativeArg (GhcPass idL) -> SDoc

pp_rhs :: Outputable body => HsMatchContext passL -> body -> SDoc

pp_dotdot :: SDoc

parenthesizeHsExpr :: forall (p :: Pass). IsPass p => PprPrec -> LHsExpr (GhcPass p) -> LHsExpr (GhcPass p)

parenthesizeHsExpr p e checks if hsExprNeedsParens p e is true, and if so, surrounds e with an HsPar. Otherwise, it simply returns e.

noSyntaxExpr :: forall (p :: Pass). IsPass p => SyntaxExpr (GhcPass p)

noExpr :: forall (p :: Pass). HsExpr (GhcPass p)

This is used for rebindable-syntax pieces that are too polymorphic for tcSyntaxOp (trS_fmap and the mzip in ParStmt)

mkSyntaxExpr :: HsExpr GhcRn -> SyntaxExprRn

Make a 'SyntaxExpr GhcRn' from an expression Used only in getMonadFailOp. See Note [Monad fail : Rebindable syntax, overloaded strings] in GHC.Rename.Expr

mkRnSyntaxExpr :: Name -> SyntaxExprRn

Make a SyntaxExpr from a Name (the "rn" is because this is used in the renamer).

matchGroupArity :: forall (id :: Pass) body. MatchGroup (GhcPass id) body -> Arity

matchContextErrString :: forall (p :: Pass). OutputableBndrId p => HsMatchContext (GhcPass p) -> SDoc

matchArrowContextErrString :: HsArrowMatchContext -> SDoc

isSingletonMatchGroup :: forall (p :: Pass) body. [LMatch (GhcPass p) body] -> Bool

Is there only one RHS in this list of matches?

isQuietHsExpr :: HsExpr id -> Bool

isQuietHsCmd :: HsCmd id -> Bool

isEmptyMatchGroup :: forall (p :: Pass) body. MatchGroup (GhcPass p) body -> Bool

isAtomicHsExpr :: forall (p :: Pass). IsPass p => HsExpr (GhcPass p) -> Bool

hsLMatchPats :: forall (id :: Pass) body. LMatch (GhcPass id) body -> [LPat (GhcPass id)]

hsExprNeedsParens :: forall (p :: Pass). IsPass p => PprPrec -> HsExpr (GhcPass p) -> Bool

hsExprNeedsParens p e returns True if the expression e needs parentheses under precedence p.

data XViaStrategyPs

Constructors

XViaStrategyPs (EpAnn [AddEpAnn]) (LHsSigType GhcPs)

Instances

Outputable XViaStrategyPs

Defined in GHC.Hs.Decls

Methods

ppr :: XViaStrategyPs -> SDoc

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

Data HsRuleAnn

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

Defined in GHC.Hs.Decls

Methods

(==) :: HsRuleAnn -> HsRuleAnn -> Bool

(/=) :: HsRuleAnn -> HsRuleAnn -> Bool

tyFamInstDeclName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyFamInstDecl (GhcPass p) -> IdP (GhcPass p)

tyFamInstDeclLName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyFamInstDecl (GhcPass p) -> LocatedN (IdP (GhcPass p))

tyClDeclLName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyClDecl (GhcPass p) -> LocatedN (IdP (GhcPass p))

tcdName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyClDecl (GhcPass p) -> IdP (GhcPass p)

standaloneKindSigName :: forall (p :: Pass). StandaloneKindSig (GhcPass p) -> IdP (GhcPass p)

roleAnnotDeclName :: forall (p :: Pass). RoleAnnotDecl (GhcPass p) -> IdP (GhcPass p)

resultVariableName :: forall (a :: Pass). FamilyResultSig (GhcPass a) -> Maybe (IdP (GhcPass a))

Maybe return name of the result type variable

pprTyFamInstDecl :: forall (p :: Pass). OutputableBndrId p => TopLevelFlag -> TyFamInstDecl (GhcPass p) -> SDoc

pprTyClDeclFlavour :: forall (p :: Pass). TyClDecl (GhcPass p) -> SDoc

pprHsFamInstLHS :: forall (p :: Pass). OutputableBndrId p => IdP (GhcPass p) -> HsOuterFamEqnTyVarBndrs (GhcPass p) -> HsTyPats (GhcPass p) -> LexicalFixity -> Maybe (LHsContext (GhcPass p)) -> SDoc

pprDataFamInstFlavour :: forall (p :: Pass). DataFamInstDecl (GhcPass p) -> SDoc

partitionBindsAndSigs :: [LHsDecl GhcPs] -> (LHsBinds GhcPs, [LSig GhcPs], [LFamilyDecl GhcPs], [LTyFamInstDecl GhcPs], [LDataFamInstDecl GhcPs], [LDocDecl GhcPs])

Partition a list of HsDecls into function/pattern bindings, signatures, type family declarations, type family instances, and documentation comments.

Panics when given a declaration that cannot be put into any of the output groups.

The primary use of this function is to implement cvBindsAndSigs.

mapDerivStrategy :: forall p (pass :: Pass). p ~ GhcPass pass => (XViaStrategy p -> XViaStrategy p) -> DerivStrategy p -> DerivStrategy p

Map over the via type if dealing with ViaStrategy. Otherwise, return the DerivStrategy unchanged.

instDeclDataFamInsts :: forall (p :: Pass). [LInstDecl (GhcPass p)] -> [DataFamInstDecl (GhcPass p)]

hsGroupTopLevelFixitySigs :: forall (p :: Pass). HsGroup (GhcPass p) -> [LFixitySig (GhcPass p)]

The fixity signatures for each top-level declaration and class method in an HsGroup. See Note [Top-level fixity signatures in an HsGroup]

hsDeclHasCusk :: TyClDecl GhcRn -> Bool

Does this declaration have a complete, user-supplied kind signature? See Note [CUSKs: complete user-supplied kind signatures]

hsConDeclTheta :: forall (p :: Pass). Maybe (LHsContext (GhcPass p)) -> [LHsType (GhcPass p)]

getRecConArgs_maybe :: ConDecl GhcRn -> Maybe (LocatedL [LConDeclField GhcRn])

Return Just fields if a data constructor declaration uses record syntax (i.e., RecCon), where fields are the field selectors. Otherwise, return Nothing.

getConNames :: ConDecl GhcRn -> [LocatedN Name]

foldDerivStrategy :: forall p (pass :: Pass) r. p ~ GhcPass pass => r -> (XViaStrategy p -> r) -> DerivStrategy p -> r

Eliminate a DerivStrategy.

flattenRuleDecls :: forall (p :: Pass). [LRuleDecls (GhcPass p)] -> [LRuleDecl (GhcPass p)]

familyDeclName :: forall (p :: Pass). FamilyDecl (GhcPass p) -> IdP (GhcPass p)

familyDeclLName :: forall (p :: Pass). FamilyDecl (GhcPass p) -> XRec (GhcPass p) (IdP (GhcPass p))

famResultKindSignature :: forall (p :: Pass). FamilyResultSig (GhcPass p) -> Maybe (LHsKind (GhcPass p))

emptyRnGroup :: forall (p :: Pass). HsGroup (GhcPass p)

emptyRdrGroup :: forall (p :: Pass). HsGroup (GhcPass p)

appendGroups :: forall (p :: Pass). HsGroup (GhcPass p) -> HsGroup (GhcPass p) -> HsGroup (GhcPass p)

data ListPatTc

Constructors

ListPatTc Type (Maybe (Type, SyntaxExpr GhcTc))

data EpAnnSumPat

Constructors

EpAnnSumPat

Fields

• sumPatParens :: [AddEpAnn]
• sumPatVbarsBefore :: [EpaLocation]
• sumPatVbarsAfter :: [EpaLocation]

Instances

Data EpAnnSumPat

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 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

data 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.

Constructors

CoPat

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

pprParendLPat :: forall (p :: Pass). OutputableBndrId p => PprPrec -> LPat (GhcPass p) -> SDoc

pprConArgs :: forall (p :: Pass). (OutputableBndrId p, Outputable (Anno (IdGhcP p))) => HsConPatDetails (GhcPass p) -> SDoc

patNeedsParens :: forall (p :: Pass). IsPass p => PprPrec -> Pat (GhcPass p) -> Bool

patNeedsParens p pat returns True if the pattern pat needs parentheses under precedence p.

parenthesizePat :: forall (p :: Pass). IsPass p => PprPrec -> LPat (GhcPass p) -> LPat (GhcPass p)

parenthesizePat p pat checks if patNeedsParens p pat is true, and if so, surrounds pat with a ParPat. Otherwise, it simply returns pat.

mkPrefixConPat :: DataCon -> [LPat GhcTc] -> [Type] -> LPat GhcTc

mkNilPat :: Type -> LPat GhcTc

mkCharLitPat :: SourceText -> Char -> LPat GhcTc

looksLazyPatBind :: forall (p :: Pass). HsBind (GhcPass p) -> Bool

isSimplePat :: forall (x :: Pass). LPat (GhcPass x) -> Maybe (IdP (GhcPass x))

Is the pattern any of combination of:

• (pat)
• pat :: Type
• ~pat
• !pat
• x (variable)

isIrrefutableHsPat :: forall (p :: Pass). OutputableBndrId p => DynFlags -> LPat (GhcPass p) -> Bool

isBangedLPat :: forall (p :: Pass). LPat (GhcPass p) -> Bool

hsRecUpdFieldRdr :: forall (p :: Pass). HsRecUpdField (GhcPass p) -> Located RdrName

hsRecUpdFieldOcc :: HsRecField' (AmbiguousFieldOcc GhcTc) arg -> LFieldOcc GhcTc

hsRecUpdFieldId :: HsRecField' (AmbiguousFieldOcc GhcTc) arg -> Located Id

hsRecFieldId :: HsRecField GhcTc arg -> Located Id

collectEvVarsPats :: [Pat GhcTc] -> Bag EvVar

collectEvVarsPat :: Pat GhcTc -> Bag EvVar

data NHsValBindsLR idL

Constructors

NValBinds [(RecFlag, LHsBinds idL)] [LSig GhcRn]

data AnnSig

Constructors

AnnSig

Fields

• asDcolon :: AddEpAnn
• asRest :: [AddEpAnn]

Instances

Data AnnSig

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

pragSrcBrackets :: SourceText -> String -> SDoc -> SDoc

Using SourceText in case the pragma was spelled differently or used mixed case

pragBrackets :: SDoc -> SDoc

ppr_sig :: forall (p :: Pass). OutputableBndrId p => Sig (GhcPass p) -> SDoc

ppr_monobind :: forall (idL :: Pass) (idR :: Pass). (OutputableBndrId idL, OutputableBndrId idR) => HsBindLR (GhcPass idL) (GhcPass idR) -> SDoc

pprVarSig :: OutputableBndr id => [id] -> SDoc -> SDoc

pprTicks :: SDoc -> SDoc -> SDoc

pprTcSpecPrags :: TcSpecPrags -> SDoc

pprSpec :: OutputableBndr id => id -> SDoc -> InlinePragma -> SDoc

pprMinimalSig :: OutputableBndr name => LBooleanFormula (GenLocated l name) -> SDoc

pprLHsBindsForUser :: forall (idL :: Pass) (idR :: Pass) (id2 :: Pass). (OutputableBndrId idL, OutputableBndrId idR, OutputableBndrId id2) => LHsBindsLR (GhcPass idL) (GhcPass idR) -> [LSig (GhcPass id2)] -> [SDoc]

pprLHsBinds :: forall (idL :: Pass) (idR :: Pass). (OutputableBndrId idL, OutputableBndrId idR) => LHsBindsLR (GhcPass idL) (GhcPass idR) -> SDoc

pprDeclList :: [SDoc] -> SDoc

plusHsValBinds :: forall (a :: Pass). HsValBinds (GhcPass a) -> HsValBinds (GhcPass a) -> HsValBinds (GhcPass a)

isEmptyValBinds :: forall (a :: Pass) (b :: Pass). HsValBindsLR (GhcPass a) (GhcPass b) -> Bool

isEmptyLHsBinds :: forall (idL :: Pass) idR. LHsBindsLR (GhcPass idL) idR -> Bool

isEmptyIPBindsTc :: HsIPBinds GhcTc -> Bool

isEmptyIPBindsPR :: forall (p :: Pass). HsIPBinds (GhcPass p) -> Bool

eqEmptyLocalBinds :: HsLocalBindsLR a b -> Bool

emptyValBindsOut :: forall (a :: Pass) (b :: Pass). HsValBindsLR (GhcPass a) (GhcPass b)

emptyValBindsIn :: forall (a :: Pass) (b :: Pass). HsValBindsLR (GhcPass a) (GhcPass b)

emptyLocalBinds :: forall (a :: Pass) (b :: Pass). HsLocalBindsLR (GhcPass a) (GhcPass b)

emptyLHsBinds :: forall (idL :: Pass) idR. LHsBindsLR (GhcPass idL) idR

class OutputableBndrFlag flag (p :: Pass)

Minimal complete definition

pprTyVarBndr

Instances

OutputableBndrFlag Specificity p

Defined in GHC.Hs.Type

Methods

pprTyVarBndr :: HsTyVarBndr Specificity (GhcPass p) -> SDoc

OutputableBndrFlag () p

Defined in GHC.Hs.Type

Methods

pprTyVarBndr :: HsTyVarBndr () (GhcPass p) -> SDoc

type EpAnnForallTy

Arguments

 = EpAnn (AddEpAnn, AddEpAnn)

Location of forall and -> for HsForAllVis Location of forall and . for HsForAllInvis

unambiguousFieldOcc :: AmbiguousFieldOcc GhcTc -> FieldOcc GhcTc

splitLHsSigmaTyInvis :: forall (p :: Pass). LHsType (GhcPass p) -> ([LHsTyVarBndr Specificity (GhcPass p)], Maybe (LHsContext (GhcPass p)), LHsType (GhcPass p))

Decompose a sigma type (of the form forall tvs. context => body) into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g., forall a., with a dot).

This function is used to split apart certain types, such as instance declaration types, which disallow visible foralls. For instance, if GHC split apart the forall in instance forall a -> Show (Blah a), then that declaration would mistakenly be accepted!

Note that this function looks through parentheses, so it will work on types such as (forall a. ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.

splitLHsQualTy :: forall (pass :: Pass). LHsType (GhcPass pass) -> (Maybe (LHsContext (GhcPass pass)), LHsType (GhcPass pass))

Decompose a type of the form context => body into its constituent parts.

Note that this function looks through parentheses, so it will work on types such as (context => ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.

splitLHsPatSynTy :: forall (p :: Pass). LHsSigType (GhcPass p) -> ([LHsTyVarBndr Specificity (GhcPass (NoGhcTcPass p))], Maybe (LHsContext (GhcPass p)), [LHsTyVarBndr Specificity (GhcPass p)], Maybe (LHsContext (GhcPass p)), LHsType (GhcPass p))

Decompose a pattern synonym type signature into its constituent parts.

Note that this function looks through parentheses, so it will work on types such as (forall a. ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.

splitLHsInstDeclTy :: LHsSigType GhcRn -> ([Name], Maybe (LHsContext GhcRn), LHsType GhcRn)

Decompose a type class instance type (of the form forall tvs. context => instance_head) into its constituent parts. Note that the [Name]s returned correspond to either:

• The implicitly bound type variables (if the type lacks an outermost forall), or
• The explicitly bound type variables (if the type has an outermost forall).

This function is careful not to look through parentheses. See Note [No nested foralls or contexts in instance types] for why this is important.

splitLHsGadtTy :: LHsSigType GhcPs -> (HsOuterSigTyVarBndrs GhcPs, Maybe (LHsContext GhcPs), LHsType GhcPs)

Decompose a GADT type into its constituent parts. Returns (outer_bndrs, mb_ctxt, body), where:

• outer_bndrs are HsOuterExplicit if the type has explicit, outermost type variable binders. Otherwise, they are HsOuterImplicit.
• mb_ctxt is Just the context, if it is provided. Otherwise, it is Nothing.
• body is the body of the type after the optional foralls and context.

This function is careful not to look through parentheses. See Note [GADT abstract syntax] (Wrinkle: No nested foralls or contexts) GHC.Hs.Decls for why this is important.

splitLHsForAllTyInvis_KP :: forall (pass :: Pass). LHsType (GhcPass pass) -> (Maybe (EpAnnForallTy, [LHsTyVarBndr Specificity (GhcPass pass)]), LHsType (GhcPass pass))

Decompose a type of the form forall tvs. body into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g., forall a., with a dot).

This function is used to split apart certain types, such as instance declaration types, which disallow visible foralls. For instance, if GHC split apart the forall in instance forall a -> Show (Blah a), then that declaration would mistakenly be accepted!

Unlike splitLHsForAllTyInvis, this function does not look through parentheses, hence the suffix _KP (short for "Keep Parentheses").

splitLHsForAllTyInvis :: forall (pass :: Pass). LHsType (GhcPass pass) -> ((EpAnnForallTy, [LHsTyVarBndr Specificity (GhcPass pass)]), LHsType (GhcPass pass))

Decompose a type of the form forall tvs. body into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g., forall a., with a dot).

This function is used to split apart certain types, such as instance declaration types, which disallow visible foralls. For instance, if GHC split apart the forall in instance forall a -> Show (Blah a), then that declaration would mistakenly be accepted!

Note that this function looks through parentheses, so it will work on types such as (forall a. ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them. Unlike splitLHsSigmaTyInvis, this function does not look through parentheses, hence the suffix _KP (short for "Keep Parentheses").

splitHsFunType :: forall (p :: Pass). LHsType (GhcPass p) -> ([AddEpAnn], EpAnnComments, [HsScaled (GhcPass p) (LHsType (GhcPass p))], LHsType (GhcPass p))

setHsTyVarBndrFlag :: forall flag flag' (pass :: Pass). flag -> HsTyVarBndr flag' (GhcPass pass) -> HsTyVarBndr flag (GhcPass pass)

Set the attached flag

selectorAmbiguousFieldOcc :: AmbiguousFieldOcc GhcTc -> Id

rdrNameAmbiguousFieldOcc :: forall (p :: Pass). AmbiguousFieldOcc (GhcPass p) -> RdrName

pprLHsContext :: forall (p :: Pass). OutputableBndrId p => Maybe (LHsContext (GhcPass p)) -> SDoc

pprHsType :: forall (p :: Pass). OutputableBndrId p => HsType (GhcPass p) -> SDoc

pprHsOuterSigTyVarBndrs :: forall (p :: Pass). OutputableBndrId p => HsOuterSigTyVarBndrs (GhcPass p) -> SDoc

Prints the outermost forall in a type signature if one is written. If there is no outermost forall, nothing is printed.

pprHsOuterFamEqnTyVarBndrs :: forall (p :: Pass). OutputableBndrId p => HsOuterFamEqnTyVarBndrs (GhcPass p) -> SDoc

Prints the explicit forall in a type family equation if one is written. If there is no explicit forall, nothing is printed.

pprHsForAll :: forall (p :: Pass). OutputableBndrId p => HsForAllTelescope (GhcPass p) -> Maybe (LHsContext (GhcPass p)) -> SDoc

Prints a forall; When passed an empty list, prints forall ./forall -> only when -dppr-debug is enabled.

pprConDeclFields :: forall (p :: Pass). OutputableBndrId p => [LConDeclField (GhcPass p)] -> SDoc

pprAnonWildCard :: SDoc

parenthesizeHsType :: forall (p :: Pass). PprPrec -> LHsType (GhcPass p) -> LHsType (GhcPass p)

parenthesizeHsType p ty checks if hsTypeNeedsParens p ty is true, and if so, surrounds ty with an HsParTy. Otherwise, it simply returns ty.

parenthesizeHsContext :: forall (p :: Pass). PprPrec -> LHsContext (GhcPass p) -> LHsContext (GhcPass p)

parenthesizeHsContext p ctxt checks if ctxt is a single constraint c such that hsTypeNeedsParens p c is true, and if so, surrounds c with an HsParTy to form a parenthesized ctxt. Otherwise, it simply returns ctxt unchanged.

mkHsWildCardBndrs :: thing -> HsWildCardBndrs GhcPs thing

mkHsQTvs :: [LHsTyVarBndr () GhcPs] -> LHsQTyVars GhcPs

mkHsPatSigType :: EpAnn EpaLocation -> LHsType GhcPs -> HsPatSigType GhcPs

mkHsOuterImplicit :: HsOuterTyVarBndrs flag GhcPs

mkHsOuterExplicit :: EpAnnForallTy -> [LHsTyVarBndr flag GhcPs] -> HsOuterTyVarBndrs flag GhcPs

mkHsOpTy :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => LHsType (GhcPass p) -> LocatedN (IdP (GhcPass p)) -> LHsType (GhcPass p) -> HsType (GhcPass p)

mkHsImplicitSigType :: LHsType GhcPs -> HsSigType GhcPs

mkHsForAllVisTele :: forall (p :: Pass). EpAnnForallTy -> [LHsTyVarBndr () (GhcPass p)] -> HsForAllTelescope (GhcPass p)

mkHsForAllInvisTele :: forall (p :: Pass). EpAnnForallTy -> [LHsTyVarBndr Specificity (GhcPass p)] -> HsForAllTelescope (GhcPass p)

mkHsExplicitSigType :: EpAnnForallTy -> [LHsTyVarBndr Specificity GhcPs] -> LHsType GhcPs -> HsSigType GhcPs

mkHsAppTys :: forall (p :: Pass). LHsType (GhcPass p) -> [LHsType (GhcPass p)] -> LHsType (GhcPass p)

mkHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

mkHsAppKindTy :: forall (p :: Pass). XAppKindTy (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

mkFieldOcc :: LocatedN RdrName -> FieldOcc GhcPs

mkEmptyWildCardBndrs :: thing -> HsWildCardBndrs GhcRn thing

mkAnonWildCardTy :: HsType GhcPs

mkAmbiguousFieldOcc :: LocatedN RdrName -> AmbiguousFieldOcc GhcPs

lhsTypeArgSrcSpan :: forall (pass :: Pass). LHsTypeArg (GhcPass pass) -> SrcSpan

Compute the SrcSpan associated with an LHsTypeArg.

isUnrestricted :: HsArrow GhcRn -> Bool

ignoreParens :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p)

hsWcScopedTvs :: LHsSigWcType GhcRn -> [Name]

hsTypeNeedsParens :: forall (p :: Pass). PprPrec -> HsType (GhcPass p) -> Bool

hsTypeNeedsParens p t returns True if the type t needs parentheses under precedence p.

hsTyVarName :: forall flag (p :: Pass). HsTyVarBndr flag (GhcPass p) -> IdP (GhcPass p)

hsTyVarBndrFlag :: forall flag (pass :: Pass). HsTyVarBndr flag (GhcPass pass) -> flag

Return the attached flag

hsTyKindSig :: forall (p :: Pass). LHsType (GhcPass p) -> Maybe (LHsKind (GhcPass p))

Get the kind signature of a type, ignoring parentheses:

hsTyKindSig `Maybe ` = Nothing hsTyKindSig `Maybe :: Type -> Type ` = Just `Type -> Type` hsTyKindSig `Maybe :: ((Type -> Type))` = Just `Type -> Type`

This is used to extract the result kind of type synonyms with a CUSK:

type S = (F :: res_kind) ^^^^^^^^

hsTyGetAppHead_maybe :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => LHsType (GhcPass p) -> Maybe (LocatedN (IdP (GhcPass p)))

Retrieve the name of the "head" of a nested type application. This is somewhat like GHC.Tc.Gen.HsType.splitHsAppTys, but a little more thorough. The purpose of this function is to examine instance heads, so it doesn't handle *all* cases (like lists, tuples, (~), etc.).

hsTvbAllKinded :: forall (p :: Pass). LHsQTyVars (GhcPass p) -> Bool

Do all type variables in this LHsQTyVars come with kind annotations?

hsSigWcType :: UnXRec p => LHsSigWcType p -> LHsType p

hsScopedTvs :: LHsSigType GhcRn -> [Name]

hsOuterTyVarNames :: HsOuterTyVarBndrs flag GhcRn -> [Name]

hsOuterExplicitBndrs :: forall flag (p :: Pass). HsOuterTyVarBndrs flag (GhcPass p) -> [LHsTyVarBndr flag (NoGhcTc (GhcPass p))]

hsLTyVarNames :: forall flag (p :: Pass). [LHsTyVarBndr flag (GhcPass p)] -> [IdP (GhcPass p)]

hsLTyVarName :: forall flag (p :: Pass). LHsTyVarBndr flag (GhcPass p) -> IdP (GhcPass p)

hsLTyVarLocNames :: forall (p :: Pass). LHsQTyVars (GhcPass p) -> [LocatedN (IdP (GhcPass p))]

hsLTyVarLocName :: forall flag (p :: Pass). LHsTyVarBndr flag (GhcPass p) -> LocatedN (IdP (GhcPass p))

hsExplicitLTyVarNames :: forall (p :: Pass). LHsQTyVars (GhcPass p) -> [IdP (GhcPass p)]

hsAllLTyVarNames :: LHsQTyVars GhcRn -> [Name]

getLHsInstDeclHead :: forall (p :: Pass). LHsSigType (GhcPass p) -> LHsType (GhcPass p)

Decompose a type class instance type (of the form forall tvs. context => instance_head) into the instance_head.

getLHsInstDeclClass_maybe :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => LHsSigType (GhcPass p) -> Maybe (LocatedN (IdP (GhcPass p)))

Decompose a type class instance type (of the form forall tvs. context => instance_head) into the instance_head and retrieve the underlying class type constructor (if it exists).

getBangType :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p)

getBangStrictness :: forall (p :: Pass). LHsType (GhcPass p) -> HsSrcBang

fromMaybeContext :: forall (p :: Pass). Maybe (LHsContext (GhcPass p)) -> HsContext (GhcPass p)

emptyLHsQTvs :: LHsQTyVars GhcRn

dropWildCards :: LHsSigWcType pass -> LHsSigType pass

arrowToHsType :: HsArrow GhcRn -> LHsType GhcRn

Convert an arrow into its corresponding multiplicity. In essence this erases the information of whether the programmer wrote an explicit multiplicity or a shorthand.

ambiguousFieldOcc :: FieldOcc GhcTc -> AmbiguousFieldOcc GhcTc

data OverLitTc

Constructors

OverLitTc

Fields

• ol_rebindable :: Bool
• ol_type :: Type

Instances

Data OverLitTc

Defined in GHC.Hs.Lit

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OverLitTc -> c OverLitTc

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OverLitTc

toConstr :: OverLitTc -> Constr

dataTypeOf :: OverLitTc -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OverLitTc)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OverLitTc)

gmapT :: (forall b. Data b => b -> b) -> OverLitTc -> OverLitTc

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OverLitTc -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OverLitTc -> r

gmapQ :: (forall d. Data d => d -> u) -> OverLitTc -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OverLitTc -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OverLitTc -> m OverLitTc

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitTc -> m OverLitTc

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitTc -> m OverLitTc

pp_st_suffix :: SourceText -> SDoc -> SDoc -> SDoc

pmPprHsLit :: forall (x :: Pass). HsLit (GhcPass x) -> SDoc

pmPprHsLit pretty prints literals and is used when pretty printing pattern match warnings. All are printed the same (i.e., without hashes if they are primitive and not wrapped in constructors if they are boxed). This happens mainly for too reasons: * We do not want to expose their internal representation * The warnings become too messy

overLitType :: HsOverLit GhcTc -> Type

convertLit :: forall (p1 :: Pass) (p2 :: Pass). HsLit (GhcPass p1) -> HsLit (GhcPass p2)

Convert a literal from one index type to another

pprSpliceDecl :: forall (p :: Pass). OutputableBndrId p => HsSplice (GhcPass p) -> SpliceExplicitFlag -> SDoc

pprSplice :: forall (p :: Pass). OutputableBndrId p => HsSplice (GhcPass p) -> SDoc

pprPatBind :: forall (bndr :: Pass) (p :: Pass). (OutputableBndrId bndr, OutputableBndrId p) => LPat (GhcPass bndr) -> GRHSs (GhcPass p) (LHsExpr (GhcPass p)) -> SDoc

pprLExpr :: forall (p :: Pass). OutputableBndrId p => LHsExpr (GhcPass p) -> SDoc

pprFunBind :: forall (idR :: Pass). OutputableBndrId idR => MatchGroup (GhcPass idR) (LHsExpr (GhcPass idR)) -> SDoc

pprExpr :: forall (p :: Pass). OutputableBndrId p => HsExpr (GhcPass p) -> SDoc

data UntypedSpliceFlavour

Constructors

UntypedExpSplice

UntypedPatSplice

UntypedTypeSplice

UntypedDeclSplice

Instances

Data UntypedSpliceFlavour

Defined in Language.Haskell.Syntax.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 TransForm

Constructors

ThenForm

GroupForm

Instances

Data TransForm

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

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

Data ThModFinalizers

Defined in Language.Haskell.Syntax.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

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

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type Stmt id body = StmtLR id id body

do block Statement

type SplicePointName = Name

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 or $$splice

BareSplice

bare splice

Instances

Data SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

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

Defined in Language.Haskell.Syntax.Expr

Methods

showsPrec :: Int -> SpliceDecoration -> ShowS

show :: SpliceDecoration -> String

showList :: [SpliceDecoration] -> ShowS

Outputable SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: SpliceDecoration -> SDoc

Eq SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

(==) :: SpliceDecoration -> SpliceDecoration -> Bool

(/=) :: SpliceDecoration -> SpliceDecoration -> Bool

type RecUpdProj p = RecProj p (LHsExpr p)

type RecProj p arg = HsRecField' (FieldLabelStrings p) arg

type family PendingTcSplice' p

Instances

type PendingTcSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingTcSplice' (GhcPass _1) = PendingTcSplice

type family PendingRnSplice' p

Instances

type PendingRnSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingRnSplice' (GhcPass _1) = PendingRnSplice

data ParStmtBlock idL idR

Parenthesised Statement Block

Constructors

ParStmtBlock (XParStmtBlock idL idR) [ExprLStmt idL] [IdP idR] (SyntaxExpr idR)

XParStmtBlock !(XXParStmtBlock idL idR)

data MatchGroupTc

Constructors

MatchGroupTc

Fields

• mg_arg_tys :: [Scaled Type]
• mg_res_ty :: Type

Instances

Data MatchGroupTc

Defined in Language.Haskell.Syntax.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 Match p body

Constructors

Match

Fields

• m_ext :: XCMatch p body
• m_ctxt :: HsMatchContext (NoGhcTc p)
• m_pats :: [LPat p]
• m_grhss :: GRHSs p body

XMatch !(XXMatch p body)

Instances

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

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

type LMatch id body = XRec id (Match id body)

Located Match

May have AnnKeywordId : AnnSemi when in a list

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

type LHsRecUpdProj p = XRec p (RecUpdProj p)

type LHsRecProj p arg = XRec p (RecProj p arg)

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

type LHsCmd id = XRec id (HsCmd id)

Located Haskell Command (for arrow syntax)

type LGRHS id body = XRec id (GRHS id body)

Located Guarded Right-Hand Side

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)

Note [Trees that Grow] extension point

data HsStmtContext p

Haskell Statement Context.

Constructors

ListComp

MonadComp

DoExpr (Maybe ModuleName)

ModuleName.

do { ... }

MDoExpr (Maybe ModuleName)

ModuleName.

mdo { ... } ie recursive do-expression

ArrowExpr

do-notation in an arrow-command context

GhciStmtCtxt

A command-line Stmt in GHCi pat <- rhs

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

data HsSplicedThing id

Haskell Spliced Thing

Values that can result from running a splice.

Constructors

HsSplicedExpr (HsExpr id)

Haskell Spliced Expression

HsSplicedTy (HsType id)

Haskell Spliced Type

HsSplicedPat (Pat id)

Haskell Spliced Pattern

type HsRecordBinds p = HsRecFields p (LHsExpr p)

Haskell Record Bindings

data HsPragE p

A pragma, written as {-# ... #-}, that may appear within an expression.

Constructors

HsPragSCC (XSCC p) SourceText StringLiteral

XHsPragE !(XXPragE p)

• AnnKeywordId : AnnOpen, AnnOpen '{-# GENERATED', AnnVal,AnnVal, AnnColon,AnnVal, AnnMinus, AnnVal,AnnColon, AnnVal, AnnClose '#-}'

data HsMatchContext p

Haskell Match Context

Context of a pattern match. This is more subtle than it would seem. See Note [Varieties of pattern matches].

Constructors

FunRhs

Fields

• mc_fun :: LIdP p

  function binder of f

• 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 on a case alternative

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

data HsFieldLabel p

Constructors

HsFieldLabel

Fields

• hflExt :: XCHsFieldLabel p
• hflLabel :: Located FieldLabelString

XHsFieldLabel !(XXHsFieldLabel p)

Instances

Outputable (HsFieldLabel p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: HsFieldLabel p -> SDoc

type family HsDoRn p

The AST used to hard-refer to GhcPass, which was a layer violation. For now, we paper it over with this new extension point.

Instances

type HsDoRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsDoRn (GhcPass _1) = GhcRn

data HsCmdTop p

Haskell Top-level Command

Constructors

HsCmdTop (XCmdTop p) (LHsCmd p)

XCmdTop !(XXCmdTop p)

Instances

type Anno (HsCmdTop (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmdTop (GhcPass p)) = SrcSpan

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) (LHsCmd id)

• AnnKeywordId : AnnOpen '(', AnnClose ')'

HsCmdCase (XCmdCase id) (LHsExpr id) (MatchGroup id (LHsCmd id))

• AnnKeywordId : AnnCase, AnnOf,AnnOpen '{', AnnClose '}'

HsCmdLamCase (XCmdLamCase id) (MatchGroup id (LHsCmd id))

• AnnKeywordId : AnnLam, AnnCase,AnnOpen '{', AnnClose '}'

HsCmdIf (XCmdIf id) (SyntaxExpr id) (LHsExpr id) (LHsCmd id) (LHsCmd id)

• AnnKeywordId : AnnIf, AnnSemi, AnnThen,AnnSemi, AnnElse,

HsCmdLet (XCmdLet id) (HsLocalBinds 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

DisambECP (HsCmd GhcPs)

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 [Located (HsFieldLabel 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 -> HsLocalBinds GhcPs -> LocatedA (HsCmd GhcPs) -> AnnsLet -> 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 -> 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) -> SrcSpan -> 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 -> LocatedA (HsCmd GhcPs) -> AnnParen -> PV (LocatedA (HsCmd GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsCmd GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (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 (HsSplice 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 -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> 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)

Defined in GHC.Parser.PostProcess

type Body (HsCmd GhcPs) = HsCmd

type FunArg (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsCmd GhcPs) = HsExpr GhcPs

type InfixOp (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsCmd GhcPs) = HsExpr GhcPs

type Anno (HsCmd (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

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

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

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

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

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type family HsBracketRn p

Instances

type HsBracketRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsBracketRn (GhcPass _1) = GhcRn

data HsBracket p

Haskell Bracket

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)

TExpBr (XTExpBr p) (LHsExpr p)

XBracket !(XXBracket p)

data HsArrowMatchContext

Haskell arrow match context.

Constructors

ProcExpr

A proc expression

ArrowCaseAlt

A case alternative inside arrow notation

KappaExpr

An arrow kappa abstraction

data HsArrAppType

Haskell Array Application Type

Constructors

HsHigherOrderApp

HsFirstOrderApp

Instances

Data HsArrAppType

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

type GuardStmt id = Stmt id (LHsExpr id)

Guard Statement

type GuardLStmt id = LStmt id (LHsExpr id)

Guard Located Statement

type GhciStmt id = Stmt id (LHsExpr id)

Ghci Statement

type GhciLStmt id = LStmt id (LHsExpr id)

Ghci Located Statement

data GRHS p body

Guarded Right Hand Side.

Constructors

GRHS (XCGRHS p body) [GuardLStmt p] body

XGRHS !(XXGRHS p body)

Instances

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

newtype FieldLabelStrings p

RecordDotSyntax field updates

Constructors

FieldLabelStrings [Located (HsFieldLabel p)]

Instances

Outputable (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: FieldLabelStrings p -> SDoc

OutputableBndr (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

pprBndr :: BindingSite -> FieldLabelStrings p -> SDoc

pprPrefixOcc :: FieldLabelStrings p -> SDoc

pprInfixOcc :: FieldLabelStrings p -> SDoc

bndrIsJoin_maybe :: FieldLabelStrings p -> Maybe Int

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.

type ExprStmt id = Stmt id (LHsExpr id)

Expression Statement

type ExprLStmt id = LStmt id (LHsExpr id)

Expression Located Statement

type CmdSyntaxTable p = [(Name, HsExpr p)]

Command Syntax Table (for Arrow syntax)

type CmdStmt id = Stmt id (LHsCmd id)

Command Statement

type CmdLStmt id = LStmt id (LHsCmd id)

Command Located Statement

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)

type family ApplicativeArgStmCtxPass idL

Instances

type ApplicativeArgStmCtxPass _1

Defined in GHC.Hs.Expr

type ApplicativeArgStmCtxPass _1 = GhcRn

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 :: HsStmtContext (ApplicativeArgStmCtxPass idL)

  context of the do expression, used in pprArg

XApplicativeArg !(XXApplicativeArg idL)

qualifiedDoModuleName_maybe :: HsStmtContext p -> Maybe ModuleName

prependQualified :: Maybe ModuleName -> SDoc -> SDoc

pprStmtContext :: (Outputable (IdP p), UnXRec p) => HsStmtContext p -> SDoc

pprMatchContextNoun :: (Outputable (IdP p), UnXRec p) => HsMatchContext p -> SDoc

pprMatchContext :: (Outputable (IdP p), UnXRec p) => HsMatchContext p -> SDoc

pprFieldLabelStrings :: FieldLabelStrings p -> SDoc

pprExternalSrcLoc :: (StringLiteral, (Int, Int), (Int, Int)) -> SDoc

pprArrowMatchContextNoun :: HsArrowMatchContext -> SDoc

pprAStmtContext :: (Outputable (IdP p), UnXRec p) => HsStmtContext p -> SDoc

matchSeparator :: HsMatchContext p -> SDoc

isTypedSplice :: HsSplice id -> Bool

isTypedBracket :: HsBracket id -> Bool

isPatSynCtxt :: HsMatchContext p -> Bool

isMonadStmtContext :: HsStmtContext id -> Bool

Is this a monadic context?

isMonadCompContext :: HsStmtContext id -> Bool

isInfixMatch :: Match id body -> Bool

isComprehensionContext :: HsStmtContext id -> Bool

data WarnDecls pass

Warning pragma Declarations

Constructors

Warnings

Fields

• wd_ext :: XWarnings pass
• wd_src :: SourceText
• wd_warnings :: [LWarnDecl pass]

XWarnDecls !(XXWarnDecls pass)

Instances

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

data WarnDecl pass

Warning pragma Declaration

Constructors

Warning (XWarning pass) [LIdP pass] WarningTxt

XWarnDecl !(XXWarnDecl pass)

Instances

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type TyFamInstEqn pass = FamEqn pass (LHsType pass)

Type Family Instance Equation

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

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type TyFamDefltDecl = TyFamInstDecl

Type family default declarations. A convenient synonym for TyFamInstDecl. See Note [Type family instance declarations in HsSyn].

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)

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 renameer, 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

Fields

• tcdCExt :: XClassDecl pass

  Post renamer, FVs

• 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

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

data StandaloneKindSig pass

Constructors

StandaloneKindSig (XStandaloneKindSig pass) (LIdP pass) (LHsSigType pass)

XStandaloneKindSig !(XXStandaloneKindSig pass)

Instances

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

data SpliceDecl p

Splice Declaration

Constructors

SpliceDecl (XSpliceDecl p) (XRec p (HsSplice p)) SpliceExplicitFlag

XSpliceDecl !(XXSpliceDecl p)

Instances

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

data RuleDecls pass

Rule Declarations

Constructors

HsRules

Fields

• rds_ext :: XCRuleDecls pass
• rds_src :: SourceText
• rds_rules :: [LRuleDecl pass]

XRuleDecls !(XXRuleDecls pass)

Instances

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

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 (SourceText, 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

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

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

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

data RoleAnnotDecl pass

Role Annotation Declaration

Constructors

RoleAnnotDecl (XCRoleAnnotDecl pass) (LIdP pass) [XRec pass (Maybe Role)]

• AnnKeywordId : AnnType, AnnRole

XRoleAnnotDecl !(XXRoleAnnotDecl pass)

Instances

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

data NewOrData

Constructors

NewType

newtype Blah ...

DataType

data Blah ...

Instances

Data NewOrData

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

Outputable NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: NewOrData -> SDoc

Eq NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

(==) :: NewOrData -> NewOrData -> Bool

(/=) :: NewOrData -> NewOrData -> Bool

type LWarnDecls pass = XRec pass (WarnDecls pass)

Located Warning Declarations

type LWarnDecl pass = XRec pass (WarnDecl pass)

Located Warning pragma Declaration

type LTyFamInstEqn pass

Arguments

 = XRec pass (TyFamInstEqn pass)

May have AnnKeywordId : AnnSemi when in a list

Located Type Family Instance Equation

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 LTyClDecl pass = XRec pass (TyClDecl pass)

Located Declaration of a Type or Class

type LStandaloneKindSig pass = XRec pass (StandaloneKindSig pass)

Located Standalone Kind Signature

type LSpliceDecl pass = XRec pass (SpliceDecl pass)

Located Splice Declaration

type LRuleDecls pass = XRec pass (RuleDecls pass)

Located Rule Declarations

type LRuleDecl pass = XRec pass (RuleDecl pass)

Located Rule Declaration

type LRuleBndr pass = XRec pass (RuleBndr pass)

Located Rule Binder

type LRoleAnnotDecl pass = XRec pass (RoleAnnotDecl pass)

Located Role Annotation Declaration

type LInstDecl pass = XRec pass (InstDecl pass)

Located Instance Declaration

type LInjectivityAnn pass = XRec pass (InjectivityAnn pass)

Located Injectivity Annotation

type LHsFunDep pass = XRec pass (FunDep pass)

type LHsDerivingClause pass = XRec pass (HsDerivingClause pass)

type LHsDecl p

Arguments

 = XRec p (HsDecl p)

When in a list this may have

• AnnKeywordId : AnnSemi

type LForeignDecl pass = XRec pass (ForeignDecl pass)

Located Foreign Declaration

type LFamilyResultSig pass = XRec pass (FamilyResultSig pass)

Located type Family Result Signature

type LFamilyDecl pass = XRec pass (FamilyDecl pass)

Located type Family Declaration

type LDocDecl pass = XRec pass DocDecl

Located Documentation comment Declaration

type LDerivStrategy pass = XRec pass (DerivStrategy pass)

A Located DerivStrategy.

type LDerivDecl pass = XRec pass (DerivDecl pass)

Located stand-alone 'deriving instance' declaration

type LDerivClauseTys pass = XRec pass (DerivClauseTys pass)

type LDefaultDecl pass = XRec pass (DefaultDecl pass)

Located Default Declaration

type LDataFamInstDecl pass = XRec pass (DataFamInstDecl pass)

Located Data Family Instance Declaration

type LConDecl pass

Arguments

 = XRec pass (ConDecl pass)

May have AnnKeywordId : AnnSemi when in a GADT constructor list

Located data Constructor Declaration

type LClsInstDecl pass = XRec pass (ClsInstDecl pass)

Located Class Instance Declaration

type LAnnDecl pass = XRec pass (AnnDecl pass)

Located Annotation 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

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

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

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type HsTyPats pass = [LHsTypeArg pass]

Haskell Type Patterns

data HsRuleRn

Constructors

HsRuleRn NameSet NameSet

Instances

Data HsRuleRn

Defined in Language.Haskell.Syntax.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 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 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

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

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 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

Documentation comment declaration

RoleAnnotD (XRoleAnnotD p) (RoleAnnotDecl p)

Role annotation declaration

XHsDecl !(XXHsDecl p)

Instances

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

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_ND :: NewOrData
• 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 :: [LConDecl pass]

  Data constructors

  For data T a = T1 | T2 a the LConDecls 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)

type HsConDeclH98Details pass = HsConDetails Void (HsScaled pass (LBangType pass)) (XRec pass [LConDeclField pass])

The arguments in a Haskell98-style data constructor.

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

pattern XFunDep :: !(XXFunDep pass) -> FunDep pass

data ForeignImport

Constructors

CImport (Located CCallConv) (Located Safety) (Maybe Header) CImportSpec (Located SourceText)

Instances

Data ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignImport -> c ForeignImport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignImport

toConstr :: ForeignImport -> Constr

dataTypeOf :: ForeignImport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignImport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignImport)

gmapT :: (forall b. Data b => b -> b) -> ForeignImport -> ForeignImport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignImport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignImport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

Outputable ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignImport -> SDoc

data ForeignExport

Constructors

CExport (Located CExportSpec) (Located SourceText)

Instances

Data ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignExport -> c ForeignExport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignExport

toConstr :: ForeignExport -> Constr

dataTypeOf :: ForeignExport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignExport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignExport)

gmapT :: (forall b. Data b => b -> b) -> ForeignExport -> ForeignExport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignExport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignExport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

Outputable ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignExport -> SDoc

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

ForeignExport

• AnnKeywordId : AnnForeign, AnnImport,AnnExport, AnnDcolon

Fields

• fd_e_ext :: XForeignExport pass
• fd_name :: LIdP pass
• fd_sig_ty :: LHsSigType pass
• fd_fe :: ForeignExport

XForeignDecl !(XXForeignDecl pass)

Instances

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

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

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

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

Outputable (FamilyInfo pass)

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: FamilyInfo pass -> SDoc

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

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

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

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data DocDecl

Documentation comment Declaration

Constructors

DocCommentNext HsDocString

DocCommentPrev HsDocString

DocCommentNamed String HsDocString

DocGroup Int HsDocString

Instances

Data DocDecl

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 -> c DocDecl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DocDecl

toConstr :: DocDecl -> Constr

dataTypeOf :: DocDecl -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DocDecl)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DocDecl)

gmapT :: (forall b. Data b => b -> b) -> DocDecl -> DocDecl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQ :: (forall d. Data d => d -> u) -> DocDecl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DocDecl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

Outputable DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: DocDecl -> SDoc

type Anno DocDecl

Defined in GHC.Hs.Decls

type Anno DocDecl = SrcSpanAnnA

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

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

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

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

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

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

data DefaultDecl pass

Default Declaration

Constructors

DefaultDecl (XCDefaultDecl pass) [LHsType pass]

• AnnKeywordIds : AnnDefault, AnnOpen,AnnClose

XDefaultDecl !(XXDefaultDecl pass)

Instances

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass 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

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

data DataDeclRn

Constructors

DataDeclRn

Fields

• tcdDataCusk :: Bool

  does this have a CUSK? See Note [CUSKs: complete user-supplied kind signatures]

• tcdFVs :: NameSet

Instances

Data DataDeclRn

Defined in Language.Haskell.Syntax.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 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 :: [LIdP 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 LHsDocString

  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 LHsDocString

  A possible Haddock comment.

XConDecl !(XXConDecl pass)

Instances

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

data ClsInstDecl pass

Class Instance Declaration

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

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

data CImportSpec

Constructors

CLabel CLabelString

CFunction CCallTarget

CWrapper

Instances

Data CImportSpec

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 AnnProvenance pass

Annotation Provenance

Constructors

ValueAnnProvenance (LIdP pass)

TypeAnnProvenance (LIdP pass)

ModuleAnnProvenance

data AnnDecl pass

Annotation Declaration

Constructors

HsAnnotation (XHsAnnotation pass) SourceText (AnnProvenance pass) (XRec pass (HsExpr pass))

• AnnKeywordId : AnnOpen, AnnType AnnModule AnnClose

XAnnDecl !(XXAnnDecl pass)

Instances

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

tyClGroupTyClDecls :: [TyClGroup pass] -> [LTyClDecl pass]

tyClGroupRoleDecls :: [TyClGroup pass] -> [LRoleAnnotDecl pass]

tyClGroupKindSigs :: [TyClGroup pass] -> [LStandaloneKindSig pass]

tyClGroupInstDecls :: [TyClGroup pass] -> [LInstDecl pass]

tyClDeclTyVars :: TyClDecl pass -> LHsQTyVars pass

pprFullRuleName :: Located (SourceText, RuleName) -> SDoc

pprFlavour :: FamilyInfo pass -> SDoc

newOrDataToFlavour :: NewOrData -> TyConFlavour

Convert a NewOrData to a TyConFlavour

isTypeFamilyDecl :: TyClDecl pass -> Bool

type family declaration

isSynDecl :: TyClDecl pass -> Bool

type or type instance declaration

isOpenTypeFamilyInfo :: FamilyInfo pass -> Bool

open type family info

isFamilyDecl :: TyClDecl pass -> Bool

type/data family declaration

isDataFamilyDecl :: TyClDecl pass -> Bool

data family declaration

isDataDecl :: TyClDecl pass -> Bool

True = argument is a data/newtype declaration.

isClosedTypeFamilyInfo :: FamilyInfo pass -> Bool

closed type family info

isClassDecl :: TyClDecl pass -> Bool

type class

hsGroupInstDecls :: HsGroup id -> [LInstDecl id]

docDeclDoc :: DocDecl -> HsDocString

derivStrategyName :: DerivStrategy a -> SDoc

A short description of a DerivStrategy'.

countTyClDecls :: [TyClDecl pass] -> (Int, Int, Int, Int, Int)

collectRuleBndrSigTys :: [RuleBndr pass] -> [HsPatSigType pass]

annProvenanceName_maybe :: UnXRec p => AnnProvenance p -> Maybe (IdP p)

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

Data TcSpecPrags

Defined in Language.Haskell.Syntax.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 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

Data TcSpecPrag

Defined in Language.Haskell.Syntax.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

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

IdSig (XIdSig pass) Id

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

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) SourceText (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) SourceText (LBooleanFormula (LIdP pass))

A minimal complete definition pragma

{-# MINIMAL a | (b, c | (d | e)) #-}

• AnnKeywordId : AnnOpen, AnnVbar,AnnComma, AnnClose

SCCFunSig (XSCCFunSig pass) SourceText (LIdP pass) (Maybe (XRec pass StringLiteral))

A "set cost centre" pragma for declarations

{-# SCC funName #-}

or

{-# SCC funName "cost_centre_name" #-}

CompleteMatchSig (XCompleteMatchSig pass) SourceText (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

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

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

Outputable (RecordPatSynField a)

Defined in Language.Haskell.Syntax.Binds

Methods

ppr :: RecordPatSynField a -> SDoc

data PatSynBind idL idR

• AnnKeywordId : AnnPattern, AnnEqual,AnnLarrow, AnnWhere,AnnOpen '{', AnnClose '}',

Pattern Synonym binding

Constructors

PSB

Fields

• psb_ext :: XPSB idL idR

  Post renaming, FVs. See Note [Bind free vars]

• 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)

type LTcSpecPrag = Located TcSpecPrag

Located Type checker Specification Pragmas

type LSig pass = XRec pass (Sig pass)

Located Signature

type LIPBind id = XRec id (IPBind id)

Located Implicit Parameter Binding

May have AnnKeywordId : AnnSemi when in a list

type LHsLocalBindsLR idL idR = XRec idL (HsLocalBindsLR idL idR)

type LHsLocalBinds id = XRec id (HsLocalBinds id)

Located Haskell local bindings

type LHsBindsLR idL idR = Bag (LHsBindLR idL idR)

Located Haskell Bindings with separate Left and Right identifier types

type LHsBinds id = LHsBindsLR id id

Located Haskell Bindings

type LHsBindLR idL idR = XRec idL (HsBindLR idL idR)

Located Haskell Binding with separate Left and Right identifier types

type LHsBind id = LHsBindLR id id

Located Haskell Binding

type LFixitySig pass = XRec pass (FixitySig pass)

Located Fixity Signature

data IPBind id

Implicit parameter bindings.

These bindings start off as (Left "x") in the parser and stay that way until after type-checking when they are replaced with (Right d), where "d" is the name of the dictionary holding the evidence for the implicit parameter.

• AnnKeywordId : AnnEqual

Constructors

IPBind (XCIPBind id) (Either (XRec id HsIPName) (IdP id)) (LHsExpr id)

XIPBind !(XXIPBind id)

Instances

type Anno (IPBind (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

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.

type HsValBinds id = HsValBindsLR id id

Haskell Value Bindings

data HsPatSynDir id

Haskell Pattern Synonym Direction

Constructors

Unidirectional

ImplicitBidirectional

ExplicitBidirectional (MatchGroup id (LHsExpr id))

type HsPatSynDetails pass = HsConDetails Void (LIdP pass) [RecordPatSynField pass]

Haskell Pattern Synonym Details

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)

type HsLocalBinds id = HsLocalBindsLR id id

Haskell Local Bindings

data HsIPBinds id

Haskell Implicit Parameter Bindings

Constructors

IPBinds (XIPBinds id) [LIPBind id]

XHsIPBinds !(XXHsIPBinds id)

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.

AnnKeywordIds

• AnnFunId, attached to each element of fun_matches
• AnnEqual,AnnWhere, AnnOpen,AnnClose,

Fields

• fun_ext :: XFunBind idL idR

  After the renamer (but before the type-checker), this contains the locally-bound free variables of this defn. See Note [Bind free vars]

  After the type-checker, this contains 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'.

• fun_id :: LIdP idL
• fun_matches :: MatchGroup idR (LHsExpr idR)

  The payload

• fun_tick :: [CoreTickish]

  Ticks to put on the rhs, if any

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

  See Note [Bind free vars]

• pat_lhs :: LPat idL
• pat_rhs :: GRHSs idR (LHsExpr idR)
• pat_ticks :: ([CoreTickish], [[CoreTickish]])

  Ticks to put on the rhs, if any, and ticks to put on the bound variables.

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

AbsBinds

Abstraction Bindings

Fields

• abs_ext :: XAbsBinds idL idR
• abs_tvs :: [TyVar]
• abs_ev_vars :: [EvVar]

  Includes equality constraints

• abs_exports :: [ABExport idL]

  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 idL

  Typechecked user bindings

• abs_sig :: Bool

PatSynBind

Patterns Synonym Binding

Fields

• (XPatSynBind idL idR)
• (PatSynBind idL idR)
  • AnnKeywordId : AnnPattern, AnnLarrow,AnnEqual, AnnWhere AnnOpen '{',AnnClose '}'

XHsBindsLR !(XXHsBindsLR idL idR)

Instances

type Anno (HsBindLR (GhcPass idL) (GhcPass idR))

Defined in GHC.Hs.Binds

type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type HsBind id = HsBindLR id id

Haskell Binding

data FixitySig pass

Fixity Signature

Constructors

FixitySig (XFixitySig pass) [LIdP pass] Fixity

XFixitySig !(XXFixitySig pass)

Instances

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

data ABExport p

Abstraction Bindings Export

Constructors

ABE

Fields

• abe_ext :: XABE p
• abe_poly :: IdP p

  Any INLINE pragma is attached to this Id

• abe_mono :: IdP p
• abe_wrap :: HsWrapper

  See Note [ABExport wrapper] Shape: (forall abs_tvs. abs_ev_vars => abe_mono) ~ abe_poly

• abe_prags :: TcSpecPrags

  SPECIALISE pragmas

XABExport !(XXABExport p)

noSpecPrags :: TcSpecPrags

isTypeLSig :: UnXRec p => LSig p -> Bool

isSpecLSig :: UnXRec p => LSig p -> Bool

isSpecInstLSig :: UnXRec p => LSig p -> Bool

isSCCFunSig :: UnXRec p => LSig p -> Bool

isPragLSig :: UnXRec p => LSig p -> Bool

isMinimalLSig :: UnXRec p => LSig p -> Bool

isInlineLSig :: UnXRec p => LSig p -> Bool

isFixityLSig :: UnXRec p => LSig p -> Bool

isDefaultMethod :: TcSpecPrags -> Bool

isCompleteMatchSig :: UnXRec p => LSig p -> Bool

hsSigDoc :: Sig name -> SDoc

hasSpecPrags :: TcSpecPrags -> Bool

pprLPat :: forall (p :: Pass). OutputableBndrId p => LPat (GhcPass p) -> SDoc

type LHsRecUpdField p = XRec p (HsRecUpdField p)

Located Haskell Record Update Field

type LHsRecField' p id arg = XRec p (HsRecField' id arg)

Located Haskell Record Field

type LHsRecField p arg = XRec p (HsRecField p arg)

Located Haskell Record Field

type HsRecUpdField p = HsRecField' (AmbiguousFieldOcc p) (LHsExpr p)

Haskell Record Update Field

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 (Located Int)

Instances

(Outputable arg, Outputable (XRec p (HsRecField p arg))) => Outputable (HsRecFields p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecFields p arg -> SDoc

data HsRecField' id arg

Haskell Record Field

• AnnKeywordId : AnnEqual,

For details on above see note [exact print annotations] in GHC.Parser.Annotation

Constructors

HsRecField

Fields

• hsRecFieldAnn :: XHsRecField id
• hsRecFieldLbl :: Located id
• hsRecFieldArg :: arg

  Filled in by renamer when punning

• hsRecPun :: Bool

  Note [Punning]

Instances

Foldable (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

fold :: Monoid m => HsRecField' id m -> m

foldMap :: Monoid m => (a -> m) -> HsRecField' id a -> m

foldMap' :: Monoid m => (a -> m) -> HsRecField' id a -> m

foldr :: (a -> b -> b) -> b -> HsRecField' id a -> b

foldr' :: (a -> b -> b) -> b -> HsRecField' id a -> b

foldl :: (b -> a -> b) -> b -> HsRecField' id a -> b

foldl' :: (b -> a -> b) -> b -> HsRecField' id a -> b

foldr1 :: (a -> a -> a) -> HsRecField' id a -> a

foldl1 :: (a -> a -> a) -> HsRecField' id a -> a

toList :: HsRecField' id a -> [a]

null :: HsRecField' id a -> Bool

length :: HsRecField' id a -> Int

elem :: Eq a => a -> HsRecField' id a -> Bool

maximum :: Ord a => HsRecField' id a -> a

minimum :: Ord a => HsRecField' id a -> a

sum :: Num a => HsRecField' id a -> a

product :: Num a => HsRecField' id a -> a

Traversable (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

traverse :: Applicative f => (a -> f b) -> HsRecField' id a -> f (HsRecField' id b)

sequenceA :: Applicative f => HsRecField' id (f a) -> f (HsRecField' id a)

mapM :: Monad m => (a -> m b) -> HsRecField' id a -> m (HsRecField' id b)

sequence :: Monad m => HsRecField' id (m a) -> m (HsRecField' id a)

Functor (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

fmap :: (a -> b) -> HsRecField' id a -> HsRecField' id b

(<$) :: a -> HsRecField' id b -> HsRecField' id a

(Outputable p, OutputableBndr p, Outputable arg) => Outputable (HsRecField' p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecField' p arg -> SDoc

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (HsRecField' p arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField' p arg) = SrcSpanAnnA

type HsRecField p arg = HsRecField' (FieldOcc p) arg

Haskell Record Field

type HsConPatDetails p = HsConDetails (HsPatSigType (NoGhcTc p)) (LPat p) (HsRecFields p (LPat p))

Haskell Constructor Pattern Details

type family ConLikeP x

Instances

type ConLikeP GhcPs

Defined in GHC.Hs.Pat

type ConLikeP GhcPs = RdrName

type ConLikeP GhcRn

Defined in GHC.Hs.Pat

type ConLikeP GhcRn = Name

type ConLikeP GhcTc

Defined in GHC.Hs.Pat

type ConLikeP GhcTc = ConLike

hsRecFieldsArgs :: UnXRec p => HsRecFields p arg -> [arg]

hsRecFields :: UnXRec p => HsRecFields p arg -> [XCFieldOcc p]

hsRecFieldSel :: HsRecField pass arg -> Located (XCFieldOcc pass)

hsConPatArgs :: UnXRec p => HsConPatDetails p -> [LPat p]

type LHsWcType pass = HsWildCardBndrs pass (LHsType pass)

Located Haskell Wildcard Type

type LHsTypeArg p = HsArg (LHsType p) (LHsKind p)

type LHsType pass

Arguments

 = XRec pass (HsType pass)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Type

type LHsTyVarBndr flag pass = XRec pass (HsTyVarBndr flag pass)

Located Haskell Type Variable Binder

type LHsSigWcType pass = HsWildCardBndrs pass (LHsSigType pass)

Located Haskell Signature Wildcard Type

type LHsSigType pass = XRec pass (HsSigType pass)

Located Haskell Signature Type

data LHsQTyVars pass

Located Haskell Quantified Type Variables

Constructors

HsQTvs

Fields

• hsq_ext :: XHsQTvs pass
• hsq_explicit :: [LHsTyVarBndr () pass]

XLHsQTyVars !(XXLHsQTyVars pass)

type LHsKind pass

Arguments

 = XRec pass (HsKind pass)

AnnKeywordId : AnnDcolon

Located Haskell Kind

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 LFieldOcc pass = XRec pass (FieldOcc pass)

Located Field Occurrence

type LConDeclField pass

Arguments

 = XRec pass (ConDeclField pass)

May have AnnKeywordId : AnnComma when in a list

Located Constructor Declaration Field

type LBangType pass = XRec pass (BangType pass)

Located Bang Type

data HsWildCardBndrs pass thing

Haskell Wildcard Binders

Constructors

HsWC

Fields

• hswc_ext :: XHsWC pass thing
• hswc_body :: thing

XHsWildCardBndrs !(XXHsWildCardBndrs pass thing)

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 :: Maybe (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) (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) (HsSplice pass)

• AnnKeywordId : AnnOpen '$(', AnnClose ')'

HsDocTy (XDocTy pass) (LHsType pass) LHsDocString

• 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

• AnnKeywordId : None

HsWildCardTy (XWildCardTy pass)

• AnnKeywordId : None

XHsType !(XXType pass)

Instances

DisambTD (HsType GhcPs)

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 :: 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))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno (FamEqn p (LocatedA (HsType p)))

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

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

data HsTyLit

Haskell Type Literal

Constructors

HsNumTy SourceText Integer

HsStrTy SourceText FastString

HsCharTy SourceText Char

Instances

Data HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsTyLit -> c HsTyLit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsTyLit

toConstr :: HsTyLit -> Constr

dataTypeOf :: HsTyLit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsTyLit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsTyLit)

gmapT :: (forall b. Data b => b -> b) -> HsTyLit -> HsTyLit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsTyLit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsTyLit -> r

gmapQ :: (forall d. Data d => d -> u) -> HsTyLit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsTyLit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

Outputable HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsTyLit -> SDoc

data HsTupleSort

Haskell Tuple Sort

Constructors

HsUnboxedTuple

HsBoxedOrConstraintTuple

Instances

Data HsTupleSort

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 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

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

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

Outputable a => Outputable (HsScaled pass a)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsScaled pass a -> SDoc

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)

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

Data HsPSRn

Defined in Language.Haskell.Syntax.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

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

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

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.

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 HsKind pass = HsType pass

Haskell Kind

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

Data HsIPName

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

Outputable HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsIPName -> SDoc

OutputableBndr HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> HsIPName -> SDoc

pprPrefixOcc :: HsIPName -> SDoc

pprInfixOcc :: HsIPName -> SDoc

bndrIsJoin_maybe :: HsIPName -> Maybe Int

Eq HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

(==) :: HsIPName -> HsIPName -> Bool

(/=) :: HsIPName -> HsIPName -> Bool

type Anno HsIPName

Defined in GHC.Hs.Type

type Anno HsIPName = SrcSpan

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 HsCoreTy = Type

type HsContext pass = [LHsType pass]

Haskell Context

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

(Data tyarg, Data arg, Data rec) => Data (HsConDetails tyarg arg rec)

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)

(Outputable tyarg, Outputable arg, Outputable rec) => Outputable (HsConDetails tyarg arg rec)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsConDetails tyarg arg rec -> SDoc

data HsArrow pass

Denotes the type of arrows in the surface language

Constructors

HsUnrestrictedArrow IsUnicodeSyntax

a -> b or a → b

HsLinearArrow IsUnicodeSyntax (Maybe AddEpAnn)

a %1 -> b or a %1 → b, or a ⊸ b

HsExplicitMult IsUnicodeSyntax (Maybe AddEpAnn) (LHsType 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 HsArg tm ty

Constructors

HsValArg tm

HsTypeArg SrcSpan ty

HsArgPar SrcSpan

Instances

(Outputable tm, Outputable ty) => Outputable (HsArg tm ty)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsArg tm ty -> SDoc

data FieldOcc pass

Field Occurrence

Represents an *occurrence* of an unambiguous 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, the selector function.

Constructors

FieldOcc

Fields

• extFieldOcc :: XCFieldOcc pass
• rdrNameFieldOcc :: LocatedN RdrName

  See Note [Located RdrNames] in GHC.Hs.Expr

XFieldOcc !(XXFieldOcc pass)

Instances

Outputable (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: FieldOcc pass -> SDoc

OutputableBndr (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> FieldOcc pass -> SDoc

pprPrefixOcc :: FieldOcc pass -> SDoc

pprInfixOcc :: FieldOcc pass -> SDoc

bndrIsJoin_maybe :: FieldOcc pass -> Maybe Int

(Eq (XCFieldOcc pass), Eq (XXFieldOcc pass)) => Eq (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

(==) :: FieldOcc pass -> FieldOcc pass -> Bool

(/=) :: FieldOcc pass -> FieldOcc pass -> Bool

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

type Anno (FieldOcc (GhcPass p))

Defined in GHC.Hs.Type

type Anno (FieldOcc (GhcPass p)) = SrcSpan

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

data ConDeclField pass

Constructor Declaration Field

Constructors

ConDeclField

Fields

• cd_fld_ext :: XConDeclField pass
• cd_fld_names :: [LFieldOcc pass]

  See Note [ConDeclField passs]

• cd_fld_type :: LBangType pass
• cd_fld_doc :: Maybe LHsDocString
  • AnnKeywordId : AnnDcolon

XConDeclField !(XXConDeclField pass)

Instances

type Anno (ConDeclField (GhcPass p))

Defined in GHC.Hs.Type

type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

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.

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 and Note [Disambiguating record fields] in GHC.Tc.Gen.Head. See Note [Located RdrNames] in GHC.Hs.Expr

Constructors

Unambiguous (XUnambiguous pass) (LocatedN RdrName)

Ambiguous (XAmbiguous pass) (LocatedN RdrName)

XAmbiguousFieldOcc !(XXAmbiguousFieldOcc pass)

Instances

type Anno (AmbiguousFieldOcc GhcTc)

Defined in GHC.Hs.Pat

type Anno (AmbiguousFieldOcc GhcTc) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

numVisibleArgs :: [HsArg tm ty] -> Arity

noTypeArgs :: [Void]

An empty list that can be used to indicate that there are no type arguments allowed in cases where HsConDetails is applied to Void.

mapHsOuterImplicit :: (XHsOuterImplicit pass -> XHsOuterImplicit pass) -> HsOuterTyVarBndrs flag pass -> HsOuterTyVarBndrs flag pass

isHsKindedTyVar :: HsTyVarBndr flag pass -> Bool

Does this HsTyVarBndr come with an explicit kind annotation?

hsUnrestricted :: a -> HsScaled pass a

When creating syntax we use the shorthands. It's better for printing, also, the shorthands work trivially at each pass.

hsScaledThing :: HsScaled pass a -> a

hsQTvExplicit :: LHsQTyVars pass -> [LHsTyVarBndr () pass]

hsPatSigType :: HsPatSigType pass -> LHsType pass

hsMult :: HsScaled pass a -> HsArrow pass

hsLinear :: a -> HsScaled pass a

When creating syntax we use the shorthands. It's better for printing, also, the shorthands work trivially at each pass.

hsIPNameFS :: HsIPName -> FastString

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) (LPat p)

As pattern ^ - AnnKeywordId : AnnAt

ParPat (XParPat p) (LPat p)

Parenthesised pattern See Note [Parens in HsSyn] in GHC.Hs.Expr ^ - 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 Arity

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)
• (HsSplice 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)

Trees that Grow extension point for new constructors

Instances

type Anno (Pat (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (Pat (GhcPass p)) = SrcSpanAnnA

type LPat p = XRec p (Pat p)

data OverLitVal

Overloaded Literal Value

Constructors

HsIntegral !IntegralLit

Integer-looking literals;

HsFractional !FractionalLit

Frac-looking literals

HsIsString !SourceText !FastString

String-looking literals

Instances

Data OverLitVal

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

Outputable OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

ppr :: OverLitVal -> SDoc

Eq OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: OverLitVal -> OverLitVal -> Bool

(/=) :: OverLitVal -> OverLitVal -> Bool

Ord OverLitVal

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
• ol_witness :: HsExpr p

XOverLit !(XXOverLit p)

Instances

Eq (XXOverLit p) => Eq (HsOverLit p)

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: HsOverLit p -> HsOverLit p -> Bool

(/=) :: HsOverLit p -> HsOverLit p -> Bool

Ord (XXOverLit p) => Ord (HsOverLit p)

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

Defined in GHC.Hs.Pat

type Anno (HsOverLit (GhcPass p)) = SrcSpan

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

Eq (HsLit x)

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: HsLit x -> HsLit x -> Bool

(/=) :: HsLit x -> HsLit x -> Bool

negateOverLitVal :: OverLitVal -> OverLitVal

hsOverLitNeedsParens :: PprPrec -> HsOverLit x -> Bool

hsOverLitNeedsParens p ol returns True if an overloaded literal ol needs to be parenthesized under precedence p.

hsLitNeedsParens :: PprPrec -> HsLit x -> Bool

hsLitNeedsParens p l returns True if a literal l needs to be parenthesized under precedence p.

type LImportDecl pass

Arguments

 = XRec pass (ImportDecl pass)

When in a list this may have

• AnnKeywordId : AnnSemi

Located Import Declaration

type LIEWrappedName name = LocatedA (IEWrappedName name)

Located name with possible adornment - AnnKeywordIds : AnnType, AnnPattern

type LIE pass

Arguments

 = XRec pass (IE pass)

When in a list this may have

• AnnKeywordId : AnnComma

Located Import or Export

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

Data ImportDeclQualifiedStyle

Defined in GHC.Hs.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

Defined in GHC.Hs.ImpExp

Methods

(==) :: ImportDeclQualifiedStyle -> ImportDeclQualifiedStyle -> Bool

(/=) :: ImportDeclQualifiedStyle -> ImportDeclQualifiedStyle -> Bool

data ImportDecl pass

Import Declaration

A single Haskell import declaration.

Constructors

ImportDecl

Fields

• ideclExt :: XCImportDecl pass
• ideclSourceSrc :: SourceText
• ideclName :: XRec pass ModuleName

  Module name.

• ideclPkgQual :: Maybe StringLiteral

  Package qualifier.

• ideclSource :: IsBootInterface

  IsBoot = {-# SOURCE #-} import

• ideclSafe :: Bool

  True => safe import

• ideclQualified :: ImportDeclQualifiedStyle

  If/how the import is qualified.

• ideclImplicit :: Bool

  True => implicit import (of Prelude)

• ideclAs :: Maybe (XRec pass ModuleName)

  as Module

• ideclHiding :: Maybe (Bool, XRec pass [LIE pass])

  (True => hiding, names)

XImportDecl !(XXImportDecl pass)

AnnKeywordIds

• AnnImport
• AnnOpen, AnnClose for ideclSource
• AnnSafe,AnnQualified, AnnPackageName,AnnAs, AnnVal
• AnnHiding,AnnOpen, AnnClose attached to location in ideclHiding

Instances

(OutputableBndrId p, Outputable (Anno (IE (GhcPass p)))) => Outputable (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: ImportDecl (GhcPass p) -> SDoc

type Anno (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA

data IEWrappedName name

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 (LocatedN name)

no extra

IEPattern EpaLocation (LocatedN name)

pattern X

IEType EpaLocation (LocatedN name)

type (:+:)

Instances

Data name => Data (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IEWrappedName name -> c (IEWrappedName name)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IEWrappedName name)

toConstr :: IEWrappedName name -> Constr

dataTypeOf :: IEWrappedName name -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IEWrappedName name))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IEWrappedName name))

gmapT :: (forall b. Data b => b -> b) -> IEWrappedName name -> IEWrappedName name

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IEWrappedName name -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IEWrappedName name -> r

gmapQ :: (forall d. Data d => d -> u) -> IEWrappedName name -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IEWrappedName name -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IEWrappedName name -> m (IEWrappedName name)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IEWrappedName name -> m (IEWrappedName name)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IEWrappedName name -> m (IEWrappedName name)

HasOccName name => HasOccName (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

occName :: IEWrappedName name -> OccName

OutputableBndr name => Outputable (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

ppr :: IEWrappedName name -> SDoc

OutputableBndr name => OutputableBndr (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

pprBndr :: BindingSite -> IEWrappedName name -> SDoc

pprPrefixOcc :: IEWrappedName name -> SDoc

pprInfixOcc :: IEWrappedName name -> SDoc

bndrIsJoin_maybe :: IEWrappedName name -> Maybe Int

Eq name => Eq (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

(==) :: IEWrappedName name -> IEWrappedName name -> Bool

(/=) :: IEWrappedName name -> IEWrappedName name -> Bool

data IEWildcard

Imported or Exported Wildcard

Constructors

NoIEWildcard

IEWildcard Int

Instances

Data IEWildcard

Defined in GHC.Hs.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

Defined in GHC.Hs.ImpExp

Methods

(==) :: IEWildcard -> IEWildcard -> Bool

(/=) :: IEWildcard -> IEWildcard -> Bool

data IE pass

Imported or exported entity.

Constructors

IEVar (XIEVar pass) (LIEWrappedName (IdP pass))

Imported or Exported Variable

IEThingAbs (XIEThingAbs pass) (LIEWrappedName (IdP pass))

Imported or exported Thing with Absent list

The thing is a Class/Type (can't tell) - AnnKeywordIds : AnnPattern, AnnType,AnnVal

IEThingAll (XIEThingAll pass) (LIEWrappedName (IdP pass))

Imported or exported Thing with All imported or exported

The thing is a ClassType and the All refers to methodsconstructors

• AnnKeywordIds : AnnOpen, AnnDotdot,AnnClose, AnnType

IEThingWith (XIEThingWith pass) (LIEWrappedName (IdP pass)) IEWildcard [LIEWrappedName (IdP 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] - AnnKeywordIds : AnnOpen, AnnClose, AnnComma, AnnType

IEModuleContents (XIEModuleContents pass) (XRec pass ModuleName)

Imported or exported module contents

(Export Only)

• AnnKeywordIds : AnnModule

IEGroup (XIEGroup pass) Int HsDocString

Doc section heading

IEDoc (XIEDoc pass) HsDocString

Some documentation

IEDocNamed (XIEDocNamed pass) String

Reference to named doc

XIE !(XXIE pass)

Instances

OutputableBndrId p => Outputable (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: IE (GhcPass p) -> SDoc

type Anno (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (IE (GhcPass p)) = SrcSpanAnnA

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

data EpAnnImportDecl

Constructors

EpAnnImportDecl

Fields

• importDeclAnnImport :: EpaLocation
• importDeclAnnPragma :: Maybe (EpaLocation, EpaLocation)
• importDeclAnnSafe :: Maybe EpaLocation
• importDeclAnnQualified :: Maybe EpaLocation
• importDeclAnnPackage :: Maybe EpaLocation
• importDeclAnnAs :: Maybe EpaLocation

Instances

Data EpAnnImportDecl

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

simpleImportDecl :: ModuleName -> ImportDecl GhcPs

replaceWrappedName :: IEWrappedName name1 -> name2 -> IEWrappedName name2

replaceLWrappedName :: LIEWrappedName name1 -> name2 -> LIEWrappedName name2

pprImpExp :: (HasOccName name, OutputableBndr name) => name -> SDoc

lieWrappedName :: LIEWrappedName name -> name

isImportDeclQualified :: ImportDeclQualifiedStyle -> Bool

Convenience function to answer the question if an import decl. is qualified.

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.

ieWrappedName :: IEWrappedName name -> name

ieWrappedLName :: IEWrappedName name -> LocatedN name

ieNames :: forall (p :: Pass). IE (GhcPass p) -> [IdP (GhcPass p)]

ieName :: forall (p :: Pass). IE (GhcPass p) -> IdP (GhcPass p)

ieLWrappedName :: LIEWrappedName name -> LocatedN name

data Pass

Constructors

Parsed

Renamed

Typechecked

Instances

Data Pass

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

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 IsSrcSpanAnn (p :: Pass) a = (Anno (IdGhcP p) ~ SrcSpanAnn' (EpAnn a), IsPass p)

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

IsPass 'Parsed

Defined in GHC.Hs.Extension

Methods

ghcPass :: GhcPass 'Parsed

IsPass 'Renamed

Defined in GHC.Hs.Extension

Methods

ghcPass :: GhcPass 'Renamed

IsPass 'Typechecked

Defined in GHC.Hs.Extension

Methods

ghcPass :: GhcPass 'Typechecked

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

type GhcTc = GhcPass 'Typechecked

type GhcRn = GhcPass 'Renamed

type GhcPs = GhcPass 'Parsed

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

Typeable p => Data (GhcPass p)

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)

IsPass p => CollectPass (GhcPass p)

Defined in GHC.Hs.Utils

Methods

collectXXPat :: Proxy (GhcPass p) -> CollectFlag (GhcPass p) -> XXPat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)]

DisambECP (PatBuilder GhcPs)

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 [Located (HsFieldLabel 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 -> HsLocalBinds GhcPs -> LocatedA (PatBuilder GhcPs) -> AnnsLet -> 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 -> 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) -> SrcSpan -> 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 -> LocatedA (PatBuilder GhcPs) -> AnnParen -> PV (LocatedA (PatBuilder GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (PatBuilder GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (PatBuilder GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (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 (HsSplice 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 -> LocatedA (PatBuilder GhcPs) -> [AddEpAnn] -> 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)

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 [Located (HsFieldLabel 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 -> HsLocalBinds GhcPs -> LocatedA (HsCmd GhcPs) -> AnnsLet -> 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 -> 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) -> SrcSpan -> 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 -> LocatedA (HsCmd GhcPs) -> AnnParen -> PV (LocatedA (HsCmd GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsCmd GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (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 (HsSplice 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 -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> 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)

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 [Located (HsFieldLabel 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 -> HsLocalBinds GhcPs -> LocatedA (HsExpr GhcPs) -> AnnsLet -> 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 -> 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) -> SrcSpan -> 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 -> LocatedA (HsExpr GhcPs) -> AnnParen -> PV (LocatedA (HsExpr GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (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 (HsSplice 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 -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> 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)

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)

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 :: LHsType GhcPs -> LocatedN RdrName -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkUnpackednessPV :: Located UnpackednessPragma -> LocatedA (HsType GhcPs) -> PV (LocatedA (HsType GhcPs))

OutputableBndrId p => Outputable (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: IE (GhcPass p) -> SDoc

(OutputableBndrId p, Outputable (Anno (IE (GhcPass p)))) => Outputable (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: ImportDecl (GhcPass p) -> SDoc

OutputableBndrId a => Outputable (InstInfo (GhcPass a))

Defined in GHC.Tc.Utils.Env

Methods

ppr :: InstInfo (GhcPass a) -> SDoc

MapXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

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

UnXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

unXRec :: XRec (GhcPass p) a -> a

type XAmbiguous GhcPs

Defined in GHC.Hs.Type

type XAmbiguous GhcPs = NoExtField

type XAmbiguous GhcRn

Defined in GHC.Hs.Type

type XAmbiguous GhcRn = NoExtField

type XAmbiguous GhcTc

Defined in GHC.Hs.Type

type XAmbiguous GhcTc = Id

type XAnyClassStrategy GhcPs

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcPs = EpAnn [AddEpAnn]

type XAnyClassStrategy GhcRn

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcRn = NoExtField

type XAnyClassStrategy GhcTc

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcTc = NoExtField

type XAppTypeE GhcPs

Defined in GHC.Hs.Expr

type XAppTypeE GhcPs = SrcSpan

type XAppTypeE GhcRn

Defined in GHC.Hs.Expr

type XAppTypeE GhcRn = NoExtField

type XAppTypeE GhcTc

Defined in GHC.Hs.Expr

type XAppTypeE GhcTc = Type

type XApplicativeArgOne GhcPs

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcPs = NoExtField

type XApplicativeArgOne GhcRn

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcRn = FailOperator GhcRn

type XApplicativeArgOne GhcTc

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcTc = FailOperator GhcTc

type XArithSeq GhcPs

Defined in GHC.Hs.Expr

type XArithSeq GhcPs = EpAnn [AddEpAnn]

type XArithSeq GhcRn

Defined in GHC.Hs.Expr

type XArithSeq GhcRn = NoExtField

type XArithSeq GhcTc

Defined in GHC.Hs.Expr

type XArithSeq GhcTc = PostTcExpr

type XAsPat GhcPs

Defined in GHC.Hs.Pat

type XAsPat GhcPs = EpAnn [AddEpAnn]

type XAsPat GhcRn

Defined in GHC.Hs.Pat

type XAsPat GhcRn = NoExtField

type XAsPat GhcTc

Defined in GHC.Hs.Pat

type XAsPat GhcTc = NoExtField

type XBangPat GhcPs

Defined in GHC.Hs.Pat

type XBangPat GhcPs = EpAnn [AddEpAnn]

type XBangPat GhcRn

Defined in GHC.Hs.Pat

type XBangPat GhcRn = NoExtField

type XBangPat GhcTc

Defined in GHC.Hs.Pat

type XBangPat GhcTc = NoExtField

type XCClsInstDecl GhcPs

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)

type XCClsInstDecl GhcRn

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcRn = NoExtField

type XCClsInstDecl GhcTc

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcTc = NoExtField

type XCDefaultDecl GhcPs

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcPs = EpAnn [AddEpAnn]

type XCDefaultDecl GhcRn

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcRn = NoExtField

type XCDefaultDecl GhcTc

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcTc = NoExtField

type XCFieldOcc GhcPs

Defined in GHC.Hs.Type

type XCFieldOcc GhcPs = NoExtField

type XCFieldOcc GhcRn

Defined in GHC.Hs.Type

type XCFieldOcc GhcRn = Name

type XCFieldOcc GhcTc

Defined in GHC.Hs.Type

type XCFieldOcc GhcTc = Id

type XCImportDecl GhcPs

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcPs = EpAnn EpAnnImportDecl

type XCImportDecl GhcRn

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcRn = NoExtField

type XCImportDecl GhcTc

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcTc = NoExtField

type XCRoleAnnotDecl GhcPs

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcPs = EpAnn [AddEpAnn]

type XCRoleAnnotDecl GhcRn

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcRn = NoExtField

type XCRoleAnnotDecl GhcTc

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcTc = NoExtField

type XCRuleDecls GhcPs

Defined in GHC.Hs.Decls

type XCRuleDecls GhcPs = EpAnn [AddEpAnn]

type XCRuleDecls GhcRn

Defined in GHC.Hs.Decls

type XCRuleDecls GhcRn = NoExtField

type XCRuleDecls GhcTc

Defined in GHC.Hs.Decls

type XCRuleDecls GhcTc = NoExtField

type XCase GhcPs

Defined in GHC.Hs.Expr

type XCase GhcPs = EpAnn EpAnnHsCase

type XCase GhcRn

Defined in GHC.Hs.Expr

type XCase GhcRn = NoExtField

type XCase GhcTc

Defined in GHC.Hs.Expr

type XCase GhcTc = NoExtField

type XClassDecl GhcPs

Defined in GHC.Hs.Decls

type XClassDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey, LayoutInfo)

type XClassDecl GhcRn

Defined in GHC.Hs.Decls

type XClassDecl GhcRn = NameSet

type XClassDecl GhcTc

Defined in GHC.Hs.Decls

type XClassDecl GhcTc = NameSet

type XCmdArrApp GhcPs

Defined in GHC.Hs.Expr

type XCmdArrApp GhcPs = EpAnn AddEpAnn

type XCmdArrApp GhcRn

Defined in GHC.Hs.Expr

type XCmdArrApp GhcRn = NoExtField

type XCmdArrApp GhcTc

Defined in GHC.Hs.Expr

type XCmdArrApp GhcTc = Type

type XCmdArrForm GhcPs

Defined in GHC.Hs.Expr

type XCmdArrForm GhcPs = EpAnn AnnList

type XCmdArrForm GhcRn

Defined in GHC.Hs.Expr

type XCmdArrForm GhcRn = NoExtField

type XCmdArrForm GhcTc

Defined in GHC.Hs.Expr

type XCmdArrForm GhcTc = NoExtField

type XCmdCase GhcPs

Defined in GHC.Hs.Expr

type XCmdCase GhcPs = EpAnn EpAnnHsCase

type XCmdCase GhcRn

Defined in GHC.Hs.Expr

type XCmdCase GhcRn = NoExtField

type XCmdCase GhcTc

Defined in GHC.Hs.Expr

type XCmdCase GhcTc = NoExtField

type XCmdDo GhcPs

Defined in GHC.Hs.Expr

type XCmdDo GhcPs = EpAnn AnnList

type XCmdDo GhcRn

Defined in GHC.Hs.Expr

type XCmdDo GhcRn = NoExtField

type XCmdDo GhcTc

Defined in GHC.Hs.Expr

type XCmdDo GhcTc = Type

type XCmdIf GhcPs

Defined in GHC.Hs.Expr

type XCmdIf GhcPs = EpAnn AnnsIf

type XCmdIf GhcRn

Defined in GHC.Hs.Expr

type XCmdIf GhcRn = NoExtField

type XCmdIf GhcTc

Defined in GHC.Hs.Expr

type XCmdIf GhcTc = NoExtField

type XCmdLet GhcPs

Defined in GHC.Hs.Expr

type XCmdLet GhcPs = EpAnn AnnsLet

type XCmdLet GhcRn

Defined in GHC.Hs.Expr

type XCmdLet GhcRn = NoExtField

type XCmdLet GhcTc

Defined in GHC.Hs.Expr

type XCmdLet GhcTc = NoExtField

type XCmdTop GhcPs

Defined in GHC.Hs.Expr

type XCmdTop GhcPs = NoExtField

type XCmdTop GhcRn

Defined in GHC.Hs.Expr

type XCmdTop GhcRn = CmdSyntaxTable GhcRn

type XCmdTop GhcTc

Defined in GHC.Hs.Expr

type XCmdTop GhcTc = CmdTopTc

type XConPat GhcPs

Defined in GHC.Hs.Pat

type XConPat GhcPs = EpAnn [AddEpAnn]

type XConPat GhcRn

Defined in GHC.Hs.Pat

type XConPat GhcRn = NoExtField

type XConPat GhcTc

Defined in GHC.Hs.Pat

type XConPat GhcTc = ConPatTc

type XDataDecl GhcPs

Defined in GHC.Hs.Decls

type XDataDecl GhcPs = EpAnn [AddEpAnn]

type XDataDecl GhcRn

Defined in GHC.Hs.Decls

type XDataDecl GhcRn = DataDeclRn

type XDataDecl GhcTc

Defined in GHC.Hs.Decls

type XDataDecl GhcTc = DataDeclRn

type XDataFamInstD GhcPs

Defined in GHC.Hs.Decls

type XDataFamInstD GhcPs = EpAnn [AddEpAnn]

type XDataFamInstD GhcRn

Defined in GHC.Hs.Decls

type XDataFamInstD GhcRn = NoExtField

type XDataFamInstD GhcTc

Defined in GHC.Hs.Decls

type XDataFamInstD GhcTc = NoExtField

type XDo GhcPs

Defined in GHC.Hs.Expr

type XDo GhcPs = EpAnn AnnList

type XDo GhcRn

Defined in GHC.Hs.Expr

type XDo GhcRn = NoExtField

type XDo GhcTc

Defined in GHC.Hs.Expr

type XDo GhcTc = Type

type XExplicitList GhcPs

Defined in GHC.Hs.Expr

type XExplicitList GhcPs = EpAnn AnnList

type XExplicitList GhcRn

Defined in GHC.Hs.Expr

type XExplicitList GhcRn = NoExtField

type XExplicitList GhcTc

Defined in GHC.Hs.Expr

type XExplicitList GhcTc = Type

type XExplicitListTy GhcPs

Defined in GHC.Hs.Type

type XExplicitListTy GhcPs = EpAnn [AddEpAnn]

type XExplicitListTy GhcRn

Defined in GHC.Hs.Type

type XExplicitListTy GhcRn = NoExtField

type XExplicitListTy GhcTc

Defined in GHC.Hs.Type

type XExplicitListTy GhcTc = Kind

type XExplicitSum GhcPs

Defined in GHC.Hs.Expr

type XExplicitSum GhcPs = EpAnn AnnExplicitSum

type XExplicitSum GhcRn

Defined in GHC.Hs.Expr

type XExplicitSum GhcRn = NoExtField

type XExplicitSum GhcTc

Defined in GHC.Hs.Expr

type XExplicitSum GhcTc = [Type]

type XExplicitTuple GhcPs

Defined in GHC.Hs.Expr

type XExplicitTuple GhcPs = EpAnn [AddEpAnn]

type XExplicitTuple GhcRn

Defined in GHC.Hs.Expr

type XExplicitTuple GhcRn = NoExtField

type XExplicitTuple GhcTc

Defined in GHC.Hs.Expr

type XExplicitTuple GhcTc = NoExtField

type XExplicitTupleTy GhcPs

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcPs = EpAnn [AddEpAnn]

type XExplicitTupleTy GhcRn

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcRn = NoExtField

type XExplicitTupleTy GhcTc

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcTc = [Kind]

type XExprWithTySig GhcPs

Defined in GHC.Hs.Expr

type XExprWithTySig GhcPs = EpAnn [AddEpAnn]

type XExprWithTySig GhcRn

Defined in GHC.Hs.Expr

type XExprWithTySig GhcRn = NoExtField

type XExprWithTySig GhcTc

Defined in GHC.Hs.Expr

type XExprWithTySig GhcTc = NoExtField

type XForeignExport GhcPs

Defined in GHC.Hs.Decls

type XForeignExport GhcPs = EpAnn [AddEpAnn]

type XForeignExport GhcRn

Defined in GHC.Hs.Decls

type XForeignExport GhcRn = NoExtField

type XForeignExport GhcTc

Defined in GHC.Hs.Decls

type XForeignExport GhcTc = Coercion

type XForeignImport GhcPs

Defined in GHC.Hs.Decls

type XForeignImport GhcPs = EpAnn [AddEpAnn]

type XForeignImport GhcRn

Defined in GHC.Hs.Decls

type XForeignImport GhcRn = NoExtField

type XForeignImport GhcTc

Defined in GHC.Hs.Decls

type XForeignImport GhcTc = Coercion

type XGetField GhcPs

Defined in GHC.Hs.Expr

type XGetField GhcPs = EpAnnCO

type XGetField GhcRn

Defined in GHC.Hs.Expr

type XGetField GhcRn = NoExtField

type XGetField GhcTc

Defined in GHC.Hs.Expr

type XGetField GhcTc = Void

type XHsOuterImplicit GhcPs

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcPs = NoExtField

type XHsOuterImplicit GhcRn

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcRn = [Name]

type XHsOuterImplicit GhcTc

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcTc = [TyVar]

type XHsPS GhcPs

Defined in GHC.Hs.Type

type XHsPS GhcPs = EpAnn EpaLocation

type XHsPS GhcRn

Defined in GHC.Hs.Type

type XHsPS GhcRn = HsPSRn

type XHsPS GhcTc

Defined in GHC.Hs.Type

type XHsPS GhcTc = HsPSRn

type XHsQTvs GhcPs

Defined in GHC.Hs.Type

type XHsQTvs GhcPs = NoExtField

type XHsQTvs GhcRn

Defined in GHC.Hs.Type

type XHsQTvs GhcRn = HsQTvsRn

type XHsQTvs GhcTc

Defined in GHC.Hs.Type

type XHsQTvs GhcTc = HsQTvsRn

type XHsRule GhcPs

Defined in GHC.Hs.Decls

type XHsRule GhcPs = EpAnn HsRuleAnn

type XHsRule GhcRn

Defined in GHC.Hs.Decls

type XHsRule GhcRn = HsRuleRn

type XHsRule GhcTc

Defined in GHC.Hs.Decls

type XHsRule GhcTc = HsRuleRn

type XIEModuleContents GhcPs

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcPs = EpAnn [AddEpAnn]

type XIEModuleContents GhcRn

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcRn = NoExtField

type XIEModuleContents GhcTc

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcTc = NoExtField

type XIEVar GhcPs

Defined in GHC.Hs.ImpExp

type XIEVar GhcPs = NoExtField

type XIEVar GhcRn

Defined in GHC.Hs.ImpExp

type XIEVar GhcRn = NoExtField

type XIEVar GhcTc

Defined in GHC.Hs.ImpExp

type XIEVar GhcTc = NoExtField

type XIPBinds GhcPs

Defined in GHC.Hs.Binds

type XIPBinds GhcPs = NoExtField

type XIPBinds GhcRn

Defined in GHC.Hs.Binds

type XIPBinds GhcRn = NoExtField

type XIPBinds GhcTc

Defined in GHC.Hs.Binds

type XIPBinds GhcTc = TcEvBinds

type XIf GhcPs

Defined in GHC.Hs.Expr

type XIf GhcPs = EpAnn AnnsIf

type XIf GhcRn

Defined in GHC.Hs.Expr

type XIf GhcRn = NoExtField

type XIf GhcTc

Defined in GHC.Hs.Expr

type XIf GhcTc = NoExtField

type XLazyPat GhcPs

Defined in GHC.Hs.Pat

type XLazyPat GhcPs = EpAnn [AddEpAnn]

type XLazyPat GhcRn

Defined in GHC.Hs.Pat

type XLazyPat GhcRn = NoExtField

type XLazyPat GhcTc

Defined in GHC.Hs.Pat

type XLazyPat GhcTc = NoExtField

type XLet GhcPs

Defined in GHC.Hs.Expr

type XLet GhcPs = EpAnn AnnsLet

type XLet GhcRn

Defined in GHC.Hs.Expr

type XLet GhcRn = NoExtField

type XLet GhcTc

Defined in GHC.Hs.Expr

type XLet GhcTc = NoExtField

type XListPat GhcPs

Defined in GHC.Hs.Pat

type XListPat GhcPs = EpAnn AnnList

type XListPat GhcRn

Defined in GHC.Hs.Pat

type XListPat GhcRn = Maybe (SyntaxExpr GhcRn)

type XListPat GhcTc

Defined in GHC.Hs.Pat

type XListPat GhcTc = ListPatTc

type XMissing GhcPs

Defined in GHC.Hs.Expr

type XMissing GhcPs = EpAnn EpaLocation

type XMissing GhcRn

Defined in GHC.Hs.Expr

type XMissing GhcRn = NoExtField

type XMissing GhcTc

Defined in GHC.Hs.Expr

type XMissing GhcTc = Scaled Type

type XMultiIf GhcPs

Defined in GHC.Hs.Expr

type XMultiIf GhcPs = EpAnn [AddEpAnn]

type XMultiIf GhcRn

Defined in GHC.Hs.Expr

type XMultiIf GhcRn = NoExtField

type XMultiIf GhcTc

Defined in GHC.Hs.Expr

type XMultiIf GhcTc = Type

type XNPat GhcPs

Defined in GHC.Hs.Pat

type XNPat GhcPs = EpAnn [AddEpAnn]

type XNPat GhcRn

Defined in GHC.Hs.Pat

type XNPat GhcRn = EpAnn [AddEpAnn]

type XNPat GhcTc

Defined in GHC.Hs.Pat

type XNPat GhcTc = Type

type XNPlusKPat GhcPs

Defined in GHC.Hs.Pat

type XNPlusKPat GhcPs = EpAnn EpaLocation

type XNPlusKPat GhcRn

Defined in GHC.Hs.Pat

type XNPlusKPat GhcRn = NoExtField

type XNPlusKPat GhcTc

Defined in GHC.Hs.Pat

type XNPlusKPat GhcTc = Type

type XNegApp GhcPs

Defined in GHC.Hs.Expr

type XNegApp GhcPs = EpAnn [AddEpAnn]

type XNegApp GhcRn

Defined in GHC.Hs.Expr

type XNegApp GhcRn = NoExtField

type XNegApp GhcTc

Defined in GHC.Hs.Expr

type XNegApp GhcTc = NoExtField

type XNewtypeStrategy GhcPs

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcPs = EpAnn [AddEpAnn]

type XNewtypeStrategy GhcRn

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcRn = NoExtField

type XNewtypeStrategy GhcTc

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcTc = NoExtField

type XOpApp GhcPs

Defined in GHC.Hs.Expr

type XOpApp GhcPs = EpAnn [AddEpAnn]

type XOpApp GhcRn

Defined in GHC.Hs.Expr

type XOpApp GhcRn = Fixity

type XOpApp GhcTc

Defined in GHC.Hs.Expr

type XOpApp GhcTc = Void

type XOverLabel GhcPs

Defined in GHC.Hs.Expr

type XOverLabel GhcPs = EpAnnCO

type XOverLabel GhcRn

Defined in GHC.Hs.Expr

type XOverLabel GhcRn = EpAnnCO

type XOverLabel GhcTc

Defined in GHC.Hs.Expr

type XOverLabel GhcTc = Void

type XOverLit GhcPs

Defined in GHC.Hs.Lit

type XOverLit GhcPs = NoExtField

type XOverLit GhcRn

Defined in GHC.Hs.Lit

type XOverLit GhcRn = Bool

type XOverLit GhcTc

Defined in GHC.Hs.Lit

type XOverLit GhcTc = OverLitTc

type XProjection GhcPs

Defined in GHC.Hs.Expr

type XProjection GhcPs = EpAnn AnnProjection

type XProjection GhcRn

Defined in GHC.Hs.Expr

type XProjection GhcRn = NoExtField

type XProjection GhcTc

Defined in GHC.Hs.Expr

type XProjection GhcTc = Void

type XRecTy GhcPs

Defined in GHC.Hs.Type

type XRecTy GhcPs = EpAnn AnnList

type XRecTy GhcRn

Defined in GHC.Hs.Type

type XRecTy GhcRn = NoExtField

type XRecTy GhcTc

Defined in GHC.Hs.Type

type XRecTy GhcTc = NoExtField

type XRecordCon GhcPs

Defined in GHC.Hs.Expr

type XRecordCon GhcPs = EpAnn [AddEpAnn]

type XRecordCon GhcRn

Defined in GHC.Hs.Expr

type XRecordCon GhcRn = NoExtField

type XRecordCon GhcTc

Defined in GHC.Hs.Expr

type XRecordCon GhcTc = PostTcExpr

type XRecordUpd GhcPs

Defined in GHC.Hs.Expr

type XRecordUpd GhcPs = EpAnn [AddEpAnn]

type XRecordUpd GhcRn

Defined in GHC.Hs.Expr

type XRecordUpd GhcRn = NoExtField

type XRecordUpd GhcTc

Defined in GHC.Hs.Expr

type XRecordUpd GhcTc = RecordUpdTc

type XSectionL GhcPs

Defined in GHC.Hs.Expr

type XSectionL GhcPs = EpAnnCO

type XSectionL GhcRn

Defined in GHC.Hs.Expr

type XSectionL GhcRn = EpAnnCO

type XSectionL GhcTc

Defined in GHC.Hs.Expr

type XSectionL GhcTc = Void

type XSectionR GhcPs

Defined in GHC.Hs.Expr

type XSectionR GhcPs = EpAnnCO

type XSectionR GhcRn

Defined in GHC.Hs.Expr

type XSectionR GhcRn = EpAnnCO

type XSectionR GhcTc

Defined in GHC.Hs.Expr

type XSectionR GhcTc = Void

type XSigPat GhcPs

Defined in GHC.Hs.Pat

type XSigPat GhcPs = EpAnn [AddEpAnn]

type XSigPat GhcRn

Defined in GHC.Hs.Pat

type XSigPat GhcRn = NoExtField

type XSigPat GhcTc

Defined in GHC.Hs.Pat

type XSigPat GhcTc = Type

type XSpliceTy GhcPs

Defined in GHC.Hs.Type

type XSpliceTy GhcPs = NoExtField

type XSpliceTy GhcRn

Defined in GHC.Hs.Type

type XSpliceTy GhcRn = NoExtField

type XSpliceTy GhcTc

Defined in GHC.Hs.Type

type XSpliceTy GhcTc = Kind

type XStandaloneKindSig GhcPs

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcPs = EpAnn [AddEpAnn]

type XStandaloneKindSig GhcRn

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcRn = NoExtField

type XStandaloneKindSig GhcTc

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcTc = NoExtField

type XStatic GhcPs

Defined in GHC.Hs.Expr

type XStatic GhcPs = EpAnn [AddEpAnn]

type XStatic GhcRn

Defined in GHC.Hs.Expr

type XStatic GhcRn = NameSet

type XStatic GhcTc

Defined in GHC.Hs.Expr

type XStatic GhcTc = NameSet

type XStockStrategy GhcPs

Defined in GHC.Hs.Decls

type XStockStrategy GhcPs = EpAnn [AddEpAnn]

type XStockStrategy GhcRn

Defined in GHC.Hs.Decls

type XStockStrategy GhcRn = NoExtField

type XStockStrategy GhcTc

Defined in GHC.Hs.Decls

type XStockStrategy GhcTc = NoExtField

type XSumPat GhcPs

Defined in GHC.Hs.Pat

type XSumPat GhcPs = EpAnn EpAnnSumPat

type XSumPat GhcRn

Defined in GHC.Hs.Pat

type XSumPat GhcRn = NoExtField

type XSumPat GhcTc

Defined in GHC.Hs.Pat

type XSumPat GhcTc = [Type]

type XSynDecl GhcPs

Defined in GHC.Hs.Decls

type XSynDecl GhcPs = EpAnn [AddEpAnn]

type XSynDecl GhcRn

Defined in GHC.Hs.Decls

type XSynDecl GhcRn = NameSet

type XSynDecl GhcTc

Defined in GHC.Hs.Decls

type XSynDecl GhcTc = NameSet

type XTuplePat GhcPs

Defined in GHC.Hs.Pat

type XTuplePat GhcPs = EpAnn [AddEpAnn]

type XTuplePat GhcRn

Defined in GHC.Hs.Pat

type XTuplePat GhcRn = NoExtField

type XTuplePat GhcTc

Defined in GHC.Hs.Pat

type XTuplePat GhcTc = [Type]

type XTyFamInstD GhcPs

Defined in GHC.Hs.Decls

type XTyFamInstD GhcPs = NoExtField

type XTyFamInstD GhcRn

Defined in GHC.Hs.Decls

type XTyFamInstD GhcRn = NoExtField

type XTyFamInstD GhcTc

Defined in GHC.Hs.Decls

type XTyFamInstD GhcTc = NoExtField

type XUnambiguous GhcPs

Defined in GHC.Hs.Type

type XUnambiguous GhcPs = NoExtField

type XUnambiguous GhcRn

Defined in GHC.Hs.Type

type XUnambiguous GhcRn = Name

type XUnambiguous GhcTc

Defined in GHC.Hs.Type

type XUnambiguous GhcTc = Id

type XUnboundVar GhcPs

Defined in GHC.Hs.Expr

type XUnboundVar GhcPs = EpAnn EpAnnUnboundVar

type XUnboundVar GhcRn

Defined in GHC.Hs.Expr

type XUnboundVar GhcRn = NoExtField

type XUnboundVar GhcTc

Defined in GHC.Hs.Expr

type XUnboundVar GhcTc = HoleExprRef

type XViaStrategy GhcPs

Defined in GHC.Hs.Decls

type XViaStrategy GhcPs = XViaStrategyPs

type XViaStrategy GhcRn

Defined in GHC.Hs.Decls

type XViaStrategy GhcRn = LHsSigType GhcRn

type XViaStrategy GhcTc

Defined in GHC.Hs.Decls

type XViaStrategy GhcTc = Type

type XViewPat GhcPs

Defined in GHC.Hs.Pat

type XViewPat GhcPs = EpAnn [AddEpAnn]

type XViewPat GhcRn

Defined in GHC.Hs.Pat

type XViewPat GhcRn = NoExtField

type XViewPat GhcTc

Defined in GHC.Hs.Pat

type XViewPat GhcTc = Type

type XWarnings GhcPs

Defined in GHC.Hs.Decls

type XWarnings GhcPs = EpAnn [AddEpAnn]

type XWarnings GhcRn

Defined in GHC.Hs.Decls

type XWarnings GhcRn = NoExtField

type XWarnings GhcTc

Defined in GHC.Hs.Decls

type XWarnings GhcTc = NoExtField

type XWildPat GhcPs

Defined in GHC.Hs.Pat

type XWildPat GhcPs = NoExtField

type XWildPat GhcRn

Defined in GHC.Hs.Pat

type XWildPat GhcRn = NoExtField

type XWildPat GhcTc

Defined in GHC.Hs.Pat

type XWildPat GhcTc = Type

type XXCmd GhcPs

Defined in GHC.Hs.Expr

type XXCmd GhcPs = NoExtCon

type XXCmd GhcRn

Defined in GHC.Hs.Expr

type XXCmd GhcRn = NoExtCon

type XXCmd GhcTc

Defined in GHC.Hs.Expr

type XXCmd GhcTc = HsWrap HsCmd

type XXExpr GhcPs

Defined in GHC.Hs.Expr

type XXExpr GhcPs = NoExtCon

type XXExpr GhcRn

Defined in GHC.Hs.Expr

type XXExpr GhcRn = HsExpansion (HsExpr GhcRn) (HsExpr GhcRn)

type XXExpr GhcTc

Defined in GHC.Hs.Expr

type XXExpr GhcTc = XXExprGhcTc

type XXPat GhcPs

Defined in GHC.Hs.Pat

type XXPat GhcPs = NoExtCon

type XXPat GhcRn

Defined in GHC.Hs.Pat

type XXPat GhcRn = NoExtCon

type XXPat GhcTc

Defined in GHC.Hs.Pat

type XXPat GhcTc = CoPat

type XXSplice GhcPs

Defined in GHC.Hs.Expr

type XXSplice GhcPs = NoExtCon

type XXSplice GhcRn

Defined in GHC.Hs.Expr

type XXSplice GhcRn = NoExtCon

type XXSplice GhcTc

Defined in GHC.Hs.Expr

type XXSplice GhcTc = HsSplicedT

type ConLikeP GhcPs

Defined in GHC.Hs.Pat

type ConLikeP GhcPs = RdrName

type ConLikeP GhcRn

Defined in GHC.Hs.Pat

type ConLikeP GhcRn = Name

type ConLikeP GhcTc

Defined in GHC.Hs.Pat

type ConLikeP GhcTc = ConLike

type XHsOuterExplicit GhcPs _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcPs _1 = EpAnnForallTy

type XHsOuterExplicit GhcRn _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcRn _1 = NoExtField

type XHsOuterExplicit GhcTc flag

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcTc flag = [VarBndr TyVar flag]

type XHsWC GhcPs b

Defined in GHC.Hs.Type

type XHsWC GhcPs b = NoExtField

type XHsWC GhcRn b

Defined in GHC.Hs.Type

type XHsWC GhcRn b = [Name]

type XHsWC GhcTc b

Defined in GHC.Hs.Type

type XHsWC GhcTc b = [Name]

type XMG GhcPs b

Defined in GHC.Hs.Expr

type XMG GhcPs b = NoExtField

type XMG GhcRn b

Defined in GHC.Hs.Expr

type XMG GhcRn b = NoExtField

type XMG GhcTc b

Defined in GHC.Hs.Expr

type XMG GhcTc b = MatchGroupTc

type XPatBind GhcPs (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcPs (GhcPass pR) = EpAnn [AddEpAnn]

type XPatBind GhcRn (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcRn (GhcPass pR) = NameSet

type XPatBind GhcTc (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcTc (GhcPass pR) = Type

type Body (PatBuilder GhcPs)

Defined in GHC.Parser.PostProcess

type Body (PatBuilder GhcPs) = PatBuilder

type Body (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type Body (HsCmd GhcPs) = HsCmd

type Body (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type Body (HsExpr GhcPs) = HsExpr

type FunArg (PatBuilder GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (PatBuilder GhcPs) = PatBuilder GhcPs

type FunArg (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsCmd GhcPs) = HsExpr GhcPs

type FunArg (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsExpr GhcPs) = HsExpr GhcPs

type InfixOp (PatBuilder GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (PatBuilder GhcPs) = RdrName

type InfixOp (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsCmd GhcPs) = HsExpr GhcPs

type InfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsExpr GhcPs) = HsExpr GhcPs

type HsBracketRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsBracketRn (GhcPass _1) = GhcRn

type HsDoRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsDoRn (GhcPass _1) = GhcRn

type PendingRnSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingRnSplice' (GhcPass _1) = PendingRnSplice

type PendingTcSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingTcSplice' (GhcPass _1) = PendingTcSplice

type SyntaxExpr (GhcPass p)

Defined in GHC.Hs.Expr

type SyntaxExpr (GhcPass p) = SyntaxExprGhc p

type Anno (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (IE (GhcPass p)) = SrcSpanAnnA

type Anno (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

type Anno (IPBind (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FunDep (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FunDep (GhcPass p)) = SrcSpanAnnA

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmd (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmdTop (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmdTop (GhcPass p)) = SrcSpan

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno (HsSplice (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsSplice (GhcPass p)) = SrcSpanAnnA

type Anno (HsOverLit (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (HsOverLit (GhcPass p)) = SrcSpan

type Anno (Pat (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (Pat (GhcPass p)) = SrcSpanAnnA

type Anno (AmbiguousFieldOcc GhcTc)

Defined in GHC.Hs.Pat

type Anno (AmbiguousFieldOcc GhcTc) = SrcSpanAnnA

type Anno (BangType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (ConDeclField (GhcPass p))

Defined in GHC.Hs.Type

type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA

type Anno (FieldOcc (GhcPass p))

Defined in GHC.Hs.Type

type Anno (FieldOcc (GhcPass p)) = SrcSpan

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type IdP (GhcPass p)

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]

Defined in GHC.Hs.Extension

type NoGhcTc (GhcPass pass) = GhcPass (NoGhcTcPass pass)

type XABE (GhcPass p)

Defined in GHC.Hs.Binds

type XABE (GhcPass p) = NoExtField

type XAnnD (GhcPass _1)

Defined in GHC.Hs.Decls

type XAnnD (GhcPass _1) = NoExtField

type XApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XApp (GhcPass _1) = EpAnnCO

type XAppKindTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppKindTy (GhcPass _1) = SrcSpan

type XAppTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppTy (GhcPass _1) = NoExtField

type XApplicativeArgMany (GhcPass _1)

Defined in GHC.Hs.Expr

type XApplicativeArgMany (GhcPass _1) = NoExtField

type XBangTy (GhcPass _1)

Defined in GHC.Hs.Type

type XBangTy (GhcPass _1) = EpAnn [AddEpAnn]

type XBinTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XBinTick (GhcPass _1) = NoExtField

type XBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XBracket (GhcPass _1) = EpAnn [AddEpAnn]

type XCDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCDerivDecl (GhcPass _1) = EpAnn [AddEpAnn]

type XCFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFamilyDecl (GhcPass _1) = EpAnn [AddEpAnn]

type XCFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFunDep (GhcPass _1) = EpAnn [AddEpAnn]

type XCHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDataDefn (GhcPass _1) = NoExtField

type XCHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDerivingClause (GhcPass _1) = EpAnn [AddEpAnn]

type XCHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XCHsFieldLabel (GhcPass _1) = EpAnn AnnFieldLabel

type XCHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsGroup (GhcPass _1) = NoExtField

type XCIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XCIPBind (GhcPass p) = EpAnn [AddEpAnn]

type XCInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCInjectivityAnn (GhcPass _1) = EpAnn [AddEpAnn]

type XCKindSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XCKindSig (GhcPass _1) = NoExtField

type XCRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XCRuleBndr (GhcPass _1) = EpAnn [AddEpAnn]

type XCTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyClGroup (GhcPass _1) = NoExtField

type XCTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyFamInstDecl (GhcPass _1) = EpAnn [AddEpAnn]

type XClassOpSig (GhcPass p)

Defined in GHC.Hs.Binds

type XClassOpSig (GhcPass p) = EpAnn AnnSig

type XClsInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XClsInstD (GhcPass _1) = NoExtField

type XCmdApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdApp (GhcPass _1) = EpAnnCO

type XCmdLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLam (GhcPass _1) = NoExtField

type XCmdLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type XCmdPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdPar (GhcPass _1) = EpAnn AnnParen

type XCmdWrap (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdWrap (GhcPass _1) = NoExtField

type XCompleteMatchSig (GhcPass p)

Defined in GHC.Hs.Binds

type XCompleteMatchSig (GhcPass p) = EpAnn [AddEpAnn]

type XConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XConDeclField (GhcPass _1) = EpAnn [AddEpAnn]

type XConDeclGADT (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclGADT (GhcPass _1) = EpAnn [AddEpAnn]

type XConDeclH98 (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclH98 (GhcPass _1) = EpAnn [AddEpAnn]

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type XDctMulti (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctMulti (GhcPass _1) = NoExtField

type XDctSingle (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctSingle (GhcPass _1) = NoExtField

type XDecBrG (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrG (GhcPass _1) = NoExtField

type XDecBrL (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrL (GhcPass _1) = NoExtField

type XDefD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDefD (GhcPass _1) = NoExtField

type XDerivD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDerivD (GhcPass _1) = NoExtField

type XDocD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDocD (GhcPass _1) = NoExtField

type XDocTy (GhcPass _1)

Defined in GHC.Hs.Type

type XDocTy (GhcPass _1) = EpAnn [AddEpAnn]

type XExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XExpBr (GhcPass _1) = NoExtField

type XFamDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XFamDecl (GhcPass _1) = NoExtField

type XFixSig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixSig (GhcPass p) = EpAnn [AddEpAnn]

type XFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixitySig (GhcPass p) = NoExtField

type XForAllTy (GhcPass _1)

Defined in GHC.Hs.Type

type XForAllTy (GhcPass _1) = NoExtField

type XForD (GhcPass _1)

Defined in GHC.Hs.Decls

type XForD (GhcPass _1) = NoExtField

type XFunTy (GhcPass _1)

Defined in GHC.Hs.Type

type XFunTy (GhcPass _1) = EpAnn TrailingAnn

type XHsAnnotation (GhcPass _1)

Defined in GHC.Hs.Decls

type XHsAnnotation (GhcPass _1) = EpAnn AnnPragma

type XHsChar (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsChar (GhcPass _1) = SourceText

type XHsCharPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsCharPrim (GhcPass _1) = SourceText

type XHsDoublePrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsDoublePrim (GhcPass _1) = NoExtField

type XHsFloatPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsFloatPrim (GhcPass _1) = NoExtField

type XHsForAllInvis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllInvis (GhcPass _1) = EpAnnForallTy

type XHsForAllVis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllVis (GhcPass _1) = EpAnnForallTy

type XHsInt (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt (GhcPass _1) = NoExtField

type XHsInt64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt64Prim (GhcPass _1) = SourceText

type XHsIntPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsIntPrim (GhcPass _1) = SourceText

type XHsInteger (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInteger (GhcPass _1) = SourceText

type XHsRat (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsRat (GhcPass _1) = NoExtField

type XHsSig (GhcPass _1)

Defined in GHC.Hs.Type

type XHsSig (GhcPass _1) = NoExtField

type XHsString (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsString (GhcPass _1) = SourceText

type XHsStringPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsStringPrim (GhcPass _1) = SourceText

type XHsWord64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWord64Prim (GhcPass _1) = SourceText

type XHsWordPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWordPrim (GhcPass _1) = SourceText

type XIEDoc (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDoc (GhcPass _1) = NoExtField

type XIEDocNamed (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDocNamed (GhcPass _1) = NoExtField

type XIEGroup (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEGroup (GhcPass _1) = NoExtField

type XIEThingAbs (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAbs (GhcPass _1) = EpAnn [AddEpAnn]

type XIEThingAll (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAll (GhcPass _1) = EpAnn [AddEpAnn]

type XIEThingWith (GhcPass 'Parsed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Parsed) = EpAnn [AddEpAnn]

type XIEThingWith (GhcPass 'Renamed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Renamed) = [Located FieldLabel]

type XIEThingWith (GhcPass 'Typechecked)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Typechecked) = NoExtField

type XIPVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XIPVar (GhcPass _1) = EpAnnCO

type XIParamTy (GhcPass _1)

Defined in GHC.Hs.Type

type XIParamTy (GhcPass _1) = EpAnn [AddEpAnn]

type XIdSig (GhcPass p)

Defined in GHC.Hs.Binds

type XIdSig (GhcPass p) = NoExtField

type XInlineSig (GhcPass p)

Defined in GHC.Hs.Binds

type XInlineSig (GhcPass p) = EpAnn [AddEpAnn]

type XInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XInstD (GhcPass _1) = NoExtField

type XKindSig (GhcPass _1)

Defined in GHC.Hs.Type

type XKindSig (GhcPass _1) = EpAnn [AddEpAnn]

type XKindSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XKindSigD (GhcPass _1) = NoExtField

type XKindedTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XKindedTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type XLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type XListTy (GhcPass _1)

Defined in GHC.Hs.Type

type XListTy (GhcPass _1) = EpAnn AnnParen

type XLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XLitE (GhcPass _1) = EpAnnCO

type XLitPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XLitPat (GhcPass _1) = NoExtField

type XMinimalSig (GhcPass p)

Defined in GHC.Hs.Binds

type XMinimalSig (GhcPass p) = EpAnn [AddEpAnn]

type XNoSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XNoSig (GhcPass _1) = NoExtField

type XOpTy (GhcPass _1)

Defined in GHC.Hs.Type

type XOpTy (GhcPass _1) = NoExtField

type XOverLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XOverLitE (GhcPass _1) = EpAnnCO

type XPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XPar (GhcPass _1) = EpAnn AnnParen

type XParPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XParPat (GhcPass _1) = EpAnn AnnParen

type XParTy (GhcPass _1)

Defined in GHC.Hs.Type

type XParTy (GhcPass _1) = EpAnn AnnParen

type XPatBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XPatBr (GhcPass _1) = NoExtField

type XPatSynSig (GhcPass p)

Defined in GHC.Hs.Binds

type XPatSynSig (GhcPass p) = EpAnn AnnSig

type XPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XPragE (GhcPass _1) = NoExtField

type XPresent (GhcPass _1)

Defined in GHC.Hs.Expr

type XPresent (GhcPass _1) = EpAnn [AddEpAnn]

type XProc (GhcPass _1)

Defined in GHC.Hs.Expr

type XProc (GhcPass _1) = EpAnn [AddEpAnn]

type XQualTy (GhcPass _1)

Defined in GHC.Hs.Type

type XQualTy (GhcPass _1) = NoExtField

type XQuasiQuote (GhcPass _1)

Defined in GHC.Hs.Expr

type XQuasiQuote (GhcPass _1) = NoExtField

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

type XRnBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XRnBracketOut (GhcPass _1) = NoExtField

type XRoleAnnotD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRoleAnnotD (GhcPass _1) = NoExtField

type XRuleBndrSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleBndrSig (GhcPass _1) = EpAnn [AddEpAnn]

type XRuleD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleD (GhcPass _1) = NoExtField

type XSCC (GhcPass _1)

Defined in GHC.Hs.Expr

type XSCC (GhcPass _1) = EpAnn AnnPragma

type XSCCFunSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSCCFunSig (GhcPass p) = EpAnn [AddEpAnn]

type XSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSigD (GhcPass _1) = NoExtField

type XSpecInstSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecInstSig (GhcPass p) = EpAnn [AddEpAnn]

type XSpecSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecSig (GhcPass p) = EpAnn [AddEpAnn]

type XSpliceD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceD (GhcPass _1) = NoExtField

type XSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceDecl (GhcPass _1) = NoExtField

type XSpliceE (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliceE (GhcPass _1) = EpAnnCO

type XSplicePat (GhcPass _1)

Defined in GHC.Hs.Pat

type XSplicePat (GhcPass _1) = NoExtField

type XSpliced (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliced (GhcPass _1) = NoExtField

type XStarTy (GhcPass _1)

Defined in GHC.Hs.Type

type XStarTy (GhcPass _1) = NoExtField

type XSumTy (GhcPass _1)

Defined in GHC.Hs.Type

type XSumTy (GhcPass _1) = EpAnn AnnParen

type XTExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTExpBr (GhcPass _1) = NoExtField

type XTcBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XTcBracketOut (GhcPass _1) = NoExtField

type XTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XTick (GhcPass _1) = NoExtField

type XTupleTy (GhcPass _1)

Defined in GHC.Hs.Type

type XTupleTy (GhcPass _1) = EpAnn AnnParen

type XTyClD (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyClD (GhcPass _1) = NoExtField

type XTyLit (GhcPass _1)

Defined in GHC.Hs.Type

type XTyLit (GhcPass _1) = NoExtField

type XTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type XTyVarSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyVarSig (GhcPass _1) = NoExtField

type XTypBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypBr (GhcPass _1) = NoExtField

type XTypeSig (GhcPass p)

Defined in GHC.Hs.Binds

type XTypeSig (GhcPass p) = EpAnn AnnSig

type XTypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type XUntypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XUntypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type XUserTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XUserTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type XValD (GhcPass _1)

Defined in GHC.Hs.Decls

type XValD (GhcPass _1) = NoExtField

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type XVarBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XVarBr (GhcPass _1) = NoExtField

type XVarPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XVarPat (GhcPass _1) = NoExtField

type XWarning (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarning (GhcPass _1) = EpAnn [AddEpAnn]

type XWarningD (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarningD (GhcPass _1) = NoExtField

type XWildCardTy (GhcPass _1)

Defined in GHC.Hs.Type

type XWildCardTy (GhcPass _1) = NoExtField

type XXABExport (GhcPass p)

Defined in GHC.Hs.Binds

type XXABExport (GhcPass p) = NoExtCon

type XXAmbiguousFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXAmbiguousFieldOcc (GhcPass _1) = NoExtCon

type XXAnnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXAnnDecl (GhcPass _1) = NoExtCon

type XXApplicativeArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXApplicativeArg (GhcPass _1) = NoExtCon

type XXBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XXBracket (GhcPass _1) = NoExtCon

type XXClsInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXClsInstDecl (GhcPass _1) = NoExtCon

type XXCmdTop (GhcPass _1)

Defined in GHC.Hs.Expr

type XXCmdTop (GhcPass _1) = NoExtCon

type XXConDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXConDecl (GhcPass _1) = NoExtCon

type XXConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XXConDeclField (GhcPass _1) = NoExtCon

type XXDefaultDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDefaultDecl (GhcPass _1) = NoExtCon

type XXDerivClauseTys (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivClauseTys (GhcPass _1) = NoExtCon

type XXDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivDecl (GhcPass _1) = NoExtCon

type XXFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyDecl (GhcPass _1) = NoExtCon

type XXFamilyResultSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyResultSig (GhcPass _1) = NoExtCon

type XXFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXFieldOcc (GhcPass _1) = NoExtCon

type XXFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XXFixitySig (GhcPass p) = NoExtCon

type XXForeignDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXForeignDecl (GhcPass _1) = NoExtCon

type XXFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFunDep (GhcPass _1) = NoExtCon

type XXHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDataDefn (GhcPass _1) = NoExtCon

type XXHsDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDecl (GhcPass _1) = NoExtCon

type XXHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDerivingClause (GhcPass _1) = NoExtCon

type XXHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XXHsFieldLabel (GhcPass _1) = NoExtCon

type XXHsForAllTelescope (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsForAllTelescope (GhcPass _1) = NoExtCon

type XXHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsGroup (GhcPass _1) = NoExtCon

type XXHsIPBinds (GhcPass p)

Defined in GHC.Hs.Binds

type XXHsIPBinds (GhcPass p) = NoExtCon

type XXHsOuterTyVarBndrs (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsOuterTyVarBndrs (GhcPass _1) = NoExtCon

type XXHsPatSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsPatSigType (GhcPass _1) = NoExtCon

type XXHsSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsSigType (GhcPass _1) = NoExtCon

type XXIE (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXIE (GhcPass _1) = NoExtCon

type XXIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XXIPBind (GhcPass p) = NoExtCon

type XXImportDecl (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXImportDecl (GhcPass _1) = NoExtCon

type XXInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInjectivityAnn (GhcPass _1) = NoExtCon

type XXInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInstDecl (GhcPass _1) = NoExtCon

type XXLHsQTyVars (GhcPass _1)

Defined in GHC.Hs.Type

type XXLHsQTyVars (GhcPass _1) = NoExtCon

type XXLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXLit (GhcPass _1) = NoExtCon

type XXOverLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXOverLit (GhcPass _1) = NoExtCon

type XXPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XXPragE (GhcPass _1) = NoExtCon

type XXRoleAnnotDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRoleAnnotDecl (GhcPass _1) = NoExtCon

type XXRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleBndr (GhcPass _1) = NoExtCon

type XXRuleDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecl (GhcPass _1) = NoExtCon

type XXRuleDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecls (GhcPass _1) = NoExtCon

type XXSig (GhcPass p)

Defined in GHC.Hs.Binds

type XXSig (GhcPass p) = NoExtCon

type XXSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXSpliceDecl (GhcPass _1) = NoExtCon

type XXStandaloneKindSig (GhcPass p)

Defined in GHC.Hs.Decls

type XXStandaloneKindSig (GhcPass p) = NoExtCon

type XXTupArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXTupArg (GhcPass _1) = NoExtCon

type XXTyClDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClDecl (GhcPass _1) = NoExtCon

type XXTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClGroup (GhcPass _1) = NoExtCon

type XXTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyFamInstDecl (GhcPass _1) = NoExtCon

type XXTyVarBndr (GhcPass _1)

Defined in GHC.Hs.Type

type XXTyVarBndr (GhcPass _1) = NoExtCon

type XXType (GhcPass _1)

Defined in GHC.Hs.Type

type XXType (GhcPass _1) = HsCoreTy

type XXWarnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecl (GhcPass _1) = NoExtCon

type XXWarnDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecls (GhcPass _1) = NoExtCon

type XCFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XCFamEqn (GhcPass _1) r = EpAnn [AddEpAnn]

type XCGRHS (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHS (GhcPass _1) _2 = EpAnn GrhsAnn

type XCGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHSs (GhcPass _1) _2 = EpAnnComments

type XCMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XCMatch (GhcPass _1) b = EpAnn [AddEpAnn]

type XFunBind (GhcPass pL) GhcPs

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcPs = NoExtField

type XFunBind (GhcPass pL) GhcRn

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcRn = NameSet

type XFunBind (GhcPass pL) GhcTc

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcTc = HsWrapper

type XPSB (GhcPass idL) GhcPs

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcPs = EpAnn [AddEpAnn]

type XPSB (GhcPass idL) GhcRn

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcRn = NameSet

type XPSB (GhcPass idL) GhcTc

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcTc = NameSet

type XRec (GhcPass p) a

Defined in GHC.Hs.Extension

type XRec (GhcPass p) a = GenLocated (Anno a) a

type XXFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XXFamEqn (GhcPass _1) r = NoExtCon

type XXGRHS (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXGRHS (GhcPass _1) b = NoExtCon

type XXGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XXGRHSs (GhcPass _1) _2 = NoExtCon

type XXHsWildCardBndrs (GhcPass _1) _2

Defined in GHC.Hs.Type

type XXHsWildCardBndrs (GhcPass _1) _2 = NoExtCon

type XXMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatch (GhcPass _1) b = NoExtCon

type XXMatchGroup (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatchGroup (GhcPass _1) b = NoExtCon

type XApplicativeStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcPs b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcRn b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcTc b = Type

type XBindStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XBindStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcRn b = XBindStmtRn

type XBindStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcTc b = XBindStmtTc

type XBodyStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcPs b = NoExtField

type XBodyStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcRn b = NoExtField

type XBodyStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcTc b = Type

type XParStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcPs b = NoExtField

type XParStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcRn b = NoExtField

type XParStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcTc b = Type

type XRecStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcPs b = EpAnn AnnList

type XRecStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcRn b = NoExtField

type XRecStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcTc b = RecStmtTc

type XTransStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XTransStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcRn b = NoExtField

type XTransStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcTc b = Type

type XAbsBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XAbsBinds (GhcPass pL) (GhcPass pR) = NoExtField

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR) = NoExtField

type XHsIPBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsIPBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type XHsValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsValBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type XParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtField

type XPatSynBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatSynBind (GhcPass pL) (GhcPass pR) = NoExtField

type XValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XValBinds (GhcPass pL) (GhcPass pR) = AnnSortKey

type XVarBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XVarBind (GhcPass pL) (GhcPass pR) = NoExtField

type XXHsBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type XXParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XXParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtCon

type XXPatSynBind (GhcPass idL) (GhcPass idR)

Defined in GHC.Hs.Binds

type XXPatSynBind (GhcPass idL) (GhcPass idR) = NoExtCon

type XXValBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXValBindsLR (GhcPass pL) (GhcPass pR) = NHsValBindsLR (GhcPass pL)

type XLastStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLastStmt (GhcPass _1) (GhcPass _2) b = NoExtField

type XLetStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLetStmt (GhcPass _1) (GhcPass _2) b = EpAnn [AddEpAnn]

type XXStmtLR (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XXStmtLR (GhcPass _1) (GhcPass _2) b = NoExtCon

type Anno (HsBindLR (GhcPass idL) (GhcPass idR))

Defined in GHC.Hs.Binds

type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

pprIfTc :: forall (p :: Pass). IsPass p => (p ~ 'Typechecked => SDoc) -> SDoc

pprIfRn :: forall (p :: Pass). IsPass p => (p ~ 'Renamed => SDoc) -> SDoc

pprIfPs :: forall (p :: Pass). IsPass p => (p ~ 'Parsed => SDoc) -> SDoc

mkSingleAltCase :: CoreExpr -> Id -> AltCon -> [Var] -> CoreExpr -> CoreExpr

type TcMCoercionR = MCoercionR

type TcMCoercionN = MCoercionN

type TcMCoercion = MCoercion

data TcEvBinds

Constructors

TcEvBinds EvBindsVar

EvBinds (Bag EvBind)

Instances

Data TcEvBinds

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

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: TcEvBinds -> SDoc

type TcCoercionR = CoercionR

type TcCoercionP = CoercionP

type TcCoercionN = CoercionN

type TcCoercion = Coercion

data QuoteWrapper

Constructors

QuoteWrapper EvVar Type

Instances

Data QuoteWrapper

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 HsWrapper

Constructors

WpHole

WpCompose HsWrapper HsWrapper

WpFun HsWrapper HsWrapper (Scaled TcType) SDoc

WpCast TcCoercionR

WpEvLam EvVar

WpEvApp EvTerm

WpTyLam TyVar

WpTyApp KindOrType

WpLet TcEvBinds

WpMultCoercion Coercion

Instances

Data HsWrapper

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

Outputable HsWrapper

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HsWrapper -> SDoc

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

Data HoleExprRef

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

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HoleExprRef -> 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

Data EvTypeable

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

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTypeable -> SDoc

data EvTerm

Constructors

EvExpr EvExpr

EvTypeable Type EvTypeable

EvFun

Fields

• et_tvs :: [TyVar]
• et_given :: [EvVar]
• et_binds :: TcEvBinds
• et_body :: EvVar

Instances

Data EvTerm

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

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTerm -> SDoc

type EvExpr = CoreExpr

data EvCallStack

Evidence for CallStack implicit parameters.

Constructors

EvCsEmpty

EvCsPushCall Name RealSrcSpan EvExpr

EvCsPushCall name loc stk represents a call to name, occurring at loc, in a calling context stk.

Instances

Data EvCallStack

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

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvCallStack -> 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

Uniquable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

getUnique :: EvBindsVar -> Unique

Outputable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindsVar -> SDoc

newtype EvBindMap

Constructors

EvBindMap

Fields

• ev_bind_varenv :: DVarEnv EvBind

Instances

Outputable EvBindMap

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindMap -> SDoc

data EvBind

Constructors

EvBind

Fields

• eb_lhs :: EvVar
• eb_rhs :: EvTerm
• eb_is_given :: Bool

Instances

Outputable EvBind

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBind -> SDoc

wrapIP :: Type -> CoercionR

Create a Expr that wraps a value in an implicit-parameter dictionary. See unwrapIP.

varSetMinusEvBindMap :: VarSet -> EvBindMap -> VarSet

unwrapIP :: Type -> CoercionR

Create a Expr that unwraps an implicit-parameter or overloaded-label dictionary to expose the underlying value. We expect the Expr to have the form `IP sym ty` or `IsLabel sym ty`, and return a Expr `co :: IP sym ty ~ ty` or `co :: IsLabel sym ty ~ ty`. See also Note [Type-checking overloaded labels] in GHC.Tc.Gen.Expr.

tcDowngradeRole :: Role -> Role -> TcCoercion -> TcCoercion

tcCoercionRole :: TcCoercion -> Role

tcCoercionKind :: TcCoercion -> Pair TcType

quoteWrapperTyVarTy :: QuoteWrapper -> Type

pprHsWrapper :: HsWrapper -> (Bool -> SDoc) -> SDoc

nonDetStrictFoldEvBindMap :: (EvBind -> a -> a) -> a -> EvBindMap -> a

mkWpTyLams :: [TyVar] -> HsWrapper

mkWpTyApps :: [Type] -> HsWrapper

mkWpLet :: TcEvBinds -> HsWrapper

mkWpLams :: [Var] -> HsWrapper

mkWpFun :: HsWrapper -> HsWrapper -> Scaled TcType -> TcType -> SDoc -> HsWrapper

mkWpEvVarApps :: [EvVar] -> HsWrapper

mkWpEvApps :: [EvTerm] -> HsWrapper

mkWpCastR :: TcCoercionR -> HsWrapper

mkWpCastN :: TcCoercionN -> HsWrapper

mkWantedEvBind :: EvVar -> EvTerm -> EvBind

mkTcUnbranchedAxInstCo :: CoAxiom Unbranched -> [TcType] -> [TcCoercion] -> TcCoercionR

mkTcTyConAppCo :: Role -> TyCon -> [TcCoercion] -> TcCoercion

mkTcTransCo :: TcCoercion -> TcCoercion -> TcCoercion

mkTcSymMCo :: TcMCoercion -> TcMCoercion

mkTcSymCo :: TcCoercion -> TcCoercion

mkTcSubCo :: HasDebugCallStack => TcCoercionN -> TcCoercionR

mkTcRepReflCo :: TcType -> TcCoercionR

mkTcReflCo :: Role -> TcType -> TcCoercion

mkTcPhantomCo :: TcCoercionN -> TcType -> TcType -> TcCoercionP

mkTcNthCo :: Role -> Int -> TcCoercion -> TcCoercion

mkTcNomReflCo :: TcType -> TcCoercionN

mkTcLRCo :: LeftOrRight -> TcCoercion -> TcCoercion

mkTcKindCo :: TcCoercion -> TcCoercionN

mkTcGReflRightMCo :: Role -> TcType -> TcMCoercionN -> TcCoercion

mkTcGReflRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcGReflLeftMCo :: Role -> TcType -> TcMCoercionN -> TcCoercion

mkTcGReflLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcFunCo :: Role -> TcCoercion -> TcCoercion -> TcCoercion -> TcCoercion

mkTcForAllCos :: [(TyVar, TcCoercionN)] -> TcCoercion -> TcCoercion

mkTcForAllCo :: TyVar -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcFamilyTyConAppCo :: TyCon -> [TcCoercionN] -> TcCoercionN

mkTcCoherenceRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcCoherenceLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcCoVarCo :: CoVar -> TcCoercion

mkTcAxiomRuleCo :: CoAxiomRule -> [TcCoercion] -> TcCoercionR

mkTcAxInstCo :: forall (br :: BranchFlag). Role -> CoAxiom br -> BranchIndex -> [TcType] -> [TcCoercion] -> TcCoercion

mkTcAppCo :: TcCoercion -> TcCoercionN -> TcCoercion

mkGivenEvBind :: EvVar -> EvTerm -> EvBind

mkEvScSelectors :: Class -> [TcType] -> [(TcPredType, EvExpr)]

mkEvCast :: EvExpr -> TcCoercion -> EvTerm

maybeTcSymCo :: SwapFlag -> TcCoercion -> TcCoercion

If a SwapFlag is IsSwapped, flip the orientation of a coercion

maybeTcSubCo :: HasDebugCallStack => EqRel -> TcCoercionN -> TcCoercion

If the EqRel is ReprEq, makes a SubCo; otherwise, does nothing. Note that the input coercion should always be nominal.

lookupEvBind :: EvBindMap -> EvVar -> Maybe EvBind

isTcReflexiveCo :: TcCoercion -> Bool

This version does a slow check, calculating the related types and seeing if they are equal.

isTcReflCo :: TcCoercion -> Bool

isIdHsWrapper :: HsWrapper -> Bool

isEmptyTcEvBinds :: TcEvBinds -> Bool

isEmptyEvBindMap :: EvBindMap -> Bool

isCoEvBindsVar :: EvBindsVar -> Bool

idHsWrapper :: HsWrapper

hsWrapDictBinders :: HsWrapper -> Bag DictId

Identifies the lambda-bound dictionaries of an HsWrapper. This is used (only) to allow the pattern-match overlap checker to know what Given dictionaries are in scope.

We specifically do not collect dictionaries bound in a WpLet. These are either superclasses of lambda-bound ones, or (extremely numerous) results of binding Wanted dictionaries. We definitely don't want all those cluttering up the Given dictionaries for pattern-match overlap checking!

foldEvBindMap :: (EvBind -> a -> a) -> a -> EvBindMap -> a

findNeededEvVars :: EvBindMap -> VarSet -> VarSet

filterEvBindMap :: (EvBind -> Bool) -> EvBindMap -> EvBindMap

extendEvBinds :: EvBindMap -> EvBind -> EvBindMap

evVarsOfTerm :: EvTerm -> VarSet

evTypeable :: Type -> EvTypeable -> EvTerm

evTermCoercion_maybe :: EvTerm -> Maybe TcCoercion

evTermCoercion :: EvTerm -> TcCoercion

evSelector :: Id -> [Type] -> [EvExpr] -> EvExpr

evId :: EvId -> EvExpr

Any sort of evidence Id, including coercions

evDataConApp :: DataCon -> [Type] -> [EvExpr] -> EvTerm

evDFunApp :: DFunId -> [Type] -> [EvExpr] -> EvTerm

evCoercion :: TcCoercion -> EvTerm

evCast :: EvExpr -> TcCoercion -> EvTerm

d |> co

evBindVar :: EvBind -> EvVar

evBindMapToVarSet :: EvBindMap -> VarSet

evBindMapBinds :: EvBindMap -> Bag EvBind

emptyTcEvBinds :: TcEvBinds

emptyEvBindMap :: EvBindMap

collectHsWrapBinders :: HsWrapper -> ([Var], HsWrapper)

applyQuoteWrapper :: QuoteWrapper -> HsWrapper

Convert the QuoteWrapper into a normal HsWrapper which can be used to apply its contents.

(<.>) :: HsWrapper -> HsWrapper -> HsWrapper

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.

Instances

Data ClsInst

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

Defined in GHC.Core.InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

Outputable ClsInst

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInst -> SDoc

pprInstanceHdr :: ClsInst -> SDoc

pprInstance :: ClsInst -> SDoc

instanceDFunId :: ClsInst -> DFunId

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 DecoratedSDoc)

setLclEnvTcLevel :: TcLclEnv -> TcLevel -> TcLclEnv

setLclEnvLoc :: TcLclEnv -> RealSrcSpan -> TcLclEnv

getLclEnvTcLevel :: TcLclEnv -> TcLevel

getLclEnvLoc :: TcLclEnv -> RealSrcSpan

data ModBreaks

All the information about the breakpoints for a module

Constructors

ModBreaks

Fields

• modBreaks_flags :: ForeignRef BreakArray

  The array of flags, one per breakpoint, indicating which breakpoints are enabled.

• modBreaks_locs :: !(Array BreakIndex SrcSpan)

  An array giving the source span of each breakpoint.

• modBreaks_vars :: !(Array BreakIndex [OccName])

  An array giving the names of the free variables at each breakpoint.

• modBreaks_decls :: !(Array BreakIndex [String])

  An array giving the names of the declarations enclosing each breakpoint. See Note [Field modBreaks_decls]

• modBreaks_ccs :: !(Array BreakIndex (RemotePtr CostCentre))

  Array pointing to cost centre for each breakpoint

• modBreaks_breakInfo :: IntMap CgBreakInfo

  info about each breakpoint from the bytecode generator

type BreakIndex = Int

Breakpoint index

data SingleStep

Constructors

RunToCompletion

SingleStep

RunAndLogSteps

data Resume

Constructors

Resume

Fields

• resumeStmt :: String
• resumeContext :: ForeignRef (ResumeContext [HValueRef])
• resumeBindings :: ([TyThing], GlobalRdrEnv)
• resumeFinalIds :: [Id]
• resumeApStack :: ForeignHValue
• resumeBreakInfo :: Maybe BreakInfo
• resumeSpan :: SrcSpan
• resumeDecl :: String
• resumeCCS :: RemotePtr CostCentreStack
• resumeHistory :: [History]
• resumeHistoryIx :: Int

data History

data ExecResult

Constructors

ExecComplete

Fields

• execResult :: Either SomeException [Name]
• execAllocation :: Word64

ExecBreak

Fields

• breakNames :: [Name]
• breakInfo :: Maybe BreakInfo

data ExecOptions

Constructors

ExecOptions

Fields

• execSingleStep :: SingleStep

  stepping mode

• execSourceFile :: String

  filename (for errors)

• execLineNumber :: Int

  line number (for errors)

• execWrap :: ForeignHValue -> EvalExpr ForeignHValue

data BreakInfo

Constructors

BreakInfo

Fields

• breakInfo_module :: Module
• breakInfo_number :: Int

recordSelectorTyCon :: Id -> RecSelParent

If the Id is that for a record selector, extract the sel_tycon. Panic otherwise.

isRecordSelector :: Id -> Bool

isPrimOpId :: Id -> Bool

isImplicitId :: Id -> Bool

isImplicitId tells whether an Ids info is implied by other declarations, so we don't need to put its signature in an interface file, even if it's mentioned in some other interface unfolding.

isFCallId :: Id -> Bool

isDeadEndId :: Var -> Bool

Returns true if an application to n args diverges or throws an exception See Note [Dead ends] in GHC.Types.Demand.

isDeadBinder :: Id -> Bool

isDataConWorkId :: Id -> Bool

isClassOpId_maybe :: Id -> Maybe Class

idType :: Id -> Kind

idDataCon :: Id -> DataCon

Get from either the worker or the wrapper Id to the DataCon. Currently used only in the desugarer.

INVARIANT: idDataCon (dataConWrapId d) = d: remember, dataConWrapId can return either the wrapper or the worker

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

type SyntaxExpr (GhcPass p)

Defined in GHC.Hs.Expr

type SyntaxExpr (GhcPass p) = SyntaxExprGhc p

data MatchGroup p body

Constructors

MG

Fields

• mg_ext :: XMG p body
• mg_alts :: XRec p [LMatch p body]
• mg_origin :: Origin

XMatchGroup !(XXMatchGroup p body)

type LHsExpr p

Arguments

 = XRec p (HsExpr p)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Expression

data HsSplice id

Haskell Splice

Constructors

HsTypedSplice (XTypedSplice id) SpliceDecoration (IdP id) (LHsExpr id)

HsUntypedSplice (XUntypedSplice id) SpliceDecoration (IdP id) (LHsExpr id)

HsQuasiQuote (XQuasiQuote id) (IdP id) (IdP id) SrcSpan FastString

HsSpliced (XSpliced id) ThModFinalizers (HsSplicedThing id)

XSplice !(XXSplice id)

Instances

type Anno (HsSplice (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsSplice (GhcPass p)) = SrcSpanAnnA

data HsExpr p

A Haskell expression.

Constructors

HsVar (XVar p) (LIdP p)

Variable See Note [Located RdrNames]

HsUnboundVar (XUnboundVar p) OccName

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.

HsConLikeOut (XConLikeOut p) ConLike

After typechecker only; must be different HsVar for pretty printing

HsRecFld (XRecFld p) (AmbiguousFieldOcc p)

Variable pointing to record selector The parser produces HsVars The renamer renames record-field selectors to HsRecFld The typechecker preserves HsRecFld

HsOverLabel (XOverLabel p) FastString

Overloaded label (Note [Overloaded labels] in GHC.OverloadedLabels)

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) (MatchGroup p (LHsExpr p))

Lambda-case

• AnnKeywordId : AnnLam, AnnCase,AnnOpen, AnnClose

HsApp (XApp p) (LHsExpr p) (LHsExpr p)

Application

HsAppType (XAppTypeE p) (LHsExpr 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)
• (LHsExpr p)

  Parenthesised expr; see Note [Parens in HsSyn]

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 Arity (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) (HsLocalBinds p) (LHsExpr p)

let(rec)

• AnnKeywordId : AnnLet, AnnOpen '{', AnnClose '}',AnnIn

HsDo (XDo p) (HsStmtContext (HsDoRn p)) (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

This case only arises when the OverloadedRecordDot langauge extension is enabled.

Fields

• gf_ext :: XGetField p
• gf_expr :: LHsExpr p
• gf_field :: Located (HsFieldLabel p)

HsProjection

Record field selector. e.g. (.x) or (.x.y)

• AnnKeywordId : AnnOpenP AnnDot, AnnCloseP

This case only arises when the OverloadedRecordDot langauge extensions is enabled.

Fields

• proj_ext :: XProjection p
• proj_flds :: NonEmpty (Located (HsFieldLabel 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 ']'

HsBracket (XBracket p) (HsBracket p)

• AnnKeywordId : AnnOpen, AnnOpenE,AnnOpenEQ, AnnClose,AnnCloseQ

HsRnBracketOut (XRnBracketOut p) (HsBracket (HsBracketRn p)) [PendingRnSplice' p]

HsTcBracketOut (XTcBracketOut p) (Maybe QuoteWrapper) (HsBracket (HsBracketRn p)) [PendingTcSplice' p]

HsSpliceE (XSpliceE p) (HsSplice p)

• AnnKeywordId : AnnOpen, AnnClose

HsProc (XProc p) (LPat p) (LHsCmdTop p)

proc notation for Arrows

• AnnKeywordId : AnnProc, AnnRarrow

HsStatic (XStatic p) (LHsExpr p)

• AnnKeywordId : AnnStatic,

HsTick (XTick p) CoreTickish (LHsExpr p)

HsBinTick (XBinTick p) Int Int (LHsExpr p)

HsPragE (XPragE p) (HsPragE p) (LHsExpr p)

XExpr !(XXExpr p)

Instances

DisambECP (HsExpr GhcPs)

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 [Located (HsFieldLabel 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 -> HsLocalBinds GhcPs -> LocatedA (HsExpr GhcPs) -> AnnsLet -> 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 -> 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) -> SrcSpan -> 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 -> LocatedA (HsExpr GhcPs) -> AnnParen -> PV (LocatedA (HsExpr GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (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 (HsSplice 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 -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> 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)

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)

Defined in GHC.Parser.PostProcess

type Body (HsExpr GhcPs) = HsExpr

type FunArg (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsExpr GhcPs) = HsExpr GhcPs

type InfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsExpr GhcPs) = HsExpr GhcPs

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

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)

type family XXWarnDecls x

Instances

type XXWarnDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecls (GhcPass _1) = NoExtCon

type family XXWarnDecl x

Instances

type XXWarnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecl (GhcPass _1) = NoExtCon

type family XXValBindsLR x x'

Instances

type XXValBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXValBindsLR (GhcPass pL) (GhcPass pR) = NHsValBindsLR (GhcPass pL)

type family XXType x

Instances

type XXType (GhcPass _1)

Defined in GHC.Hs.Type

type XXType (GhcPass _1) = HsCoreTy

type family XXTyVarBndr x

Instances

type XXTyVarBndr (GhcPass _1)

Defined in GHC.Hs.Type

type XXTyVarBndr (GhcPass _1) = NoExtCon

type family XXTyFamInstDecl x

Instances

type XXTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyFamInstDecl (GhcPass _1) = NoExtCon

type family XXTyClGroup x

Instances

type XXTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClGroup (GhcPass _1) = NoExtCon

type family XXTyClDecl x

Instances

type XXTyClDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClDecl (GhcPass _1) = NoExtCon

type family XXTupArg x

Instances

type XXTupArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXTupArg (GhcPass _1) = NoExtCon

type family XXStmtLR x x' b

Instances

type XXStmtLR (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XXStmtLR (GhcPass _1) (GhcPass _2) b = NoExtCon

type family XXStandaloneKindSig x

Instances

type XXStandaloneKindSig (GhcPass p)

Defined in GHC.Hs.Decls

type XXStandaloneKindSig (GhcPass p) = NoExtCon

type family XXSpliceDecl x

Instances

type XXSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXSpliceDecl (GhcPass _1) = NoExtCon

type family XXSplice x

Instances

type XXSplice GhcPs

Defined in GHC.Hs.Expr

type XXSplice GhcPs = NoExtCon

type XXSplice GhcRn

Defined in GHC.Hs.Expr

type XXSplice GhcRn = NoExtCon

type XXSplice GhcTc

Defined in GHC.Hs.Expr

type XXSplice GhcTc = HsSplicedT

type family XXSig x

Instances

type XXSig (GhcPass p)

Defined in GHC.Hs.Binds

type XXSig (GhcPass p) = NoExtCon

type family XXRuleDecls x

Instances

type XXRuleDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecls (GhcPass _1) = NoExtCon

type family XXRuleDecl x

Instances

type XXRuleDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecl (GhcPass _1) = NoExtCon

type family XXRuleBndr x

Instances

type XXRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleBndr (GhcPass _1) = NoExtCon

type family XXRoleAnnotDecl x

Instances

type XXRoleAnnotDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRoleAnnotDecl (GhcPass _1) = NoExtCon

type family XXPragE x

Instances

type XXPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XXPragE (GhcPass _1) = NoExtCon

type family XXPatSynBind x x'

Instances

type XXPatSynBind (GhcPass idL) (GhcPass idR)

Defined in GHC.Hs.Binds

type XXPatSynBind (GhcPass idL) (GhcPass idR) = NoExtCon

type family XXPat x

Instances

type XXPat GhcPs

Defined in GHC.Hs.Pat

type XXPat GhcPs = NoExtCon

type XXPat GhcRn

Defined in GHC.Hs.Pat

type XXPat GhcRn = NoExtCon

type XXPat GhcTc

Defined in GHC.Hs.Pat

type XXPat GhcTc = CoPat

type family XXParStmtBlock x x'

Instances

type XXParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XXParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXOverLit x

Instances

type XXOverLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXOverLit (GhcPass _1) = NoExtCon

type family XXMatchGroup x b

Instances

type XXMatchGroup (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatchGroup (GhcPass _1) b = NoExtCon

type family XXMatch x b

Instances

type XXMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatch (GhcPass _1) b = NoExtCon

type family XXLit x

Instances

type XXLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXLit (GhcPass _1) = NoExtCon

type family XXLHsQTyVars x

Instances

type XXLHsQTyVars (GhcPass _1)

Defined in GHC.Hs.Type

type XXLHsQTyVars (GhcPass _1) = NoExtCon

type family XXInstDecl x

Instances

type XXInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInstDecl (GhcPass _1) = NoExtCon

type family XXInjectivityAnn x

Instances

type XXInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInjectivityAnn (GhcPass _1) = NoExtCon

type family XXImportDecl x

Instances

type XXImportDecl (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXImportDecl (GhcPass _1) = NoExtCon

type family XXIPBind x

Instances

type XXIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XXIPBind (GhcPass p) = NoExtCon

type family XXIE x

Instances

type XXIE (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXIE (GhcPass _1) = NoExtCon

type family XXHsWildCardBndrs x b

Instances

type XXHsWildCardBndrs (GhcPass _1) _2

Defined in GHC.Hs.Type

type XXHsWildCardBndrs (GhcPass _1) _2 = NoExtCon

type family XXHsSigType x

Instances

type XXHsSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsSigType (GhcPass _1) = NoExtCon

type family XXHsPatSigType x

Instances

type XXHsPatSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsPatSigType (GhcPass _1) = NoExtCon

type family XXHsOuterTyVarBndrs x

Instances

type XXHsOuterTyVarBndrs (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsOuterTyVarBndrs (GhcPass _1) = NoExtCon

type family XXHsLocalBindsLR x x'

Instances

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXHsIPBinds x

Instances

type XXHsIPBinds (GhcPass p)

Defined in GHC.Hs.Binds

type XXHsIPBinds (GhcPass p) = NoExtCon

type family XXHsGroup x

Instances

type XXHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsGroup (GhcPass _1) = NoExtCon

type family XXHsForAllTelescope x

Instances

type XXHsForAllTelescope (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsForAllTelescope (GhcPass _1) = NoExtCon

type family XXHsFieldLabel x

Instances

type XXHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XXHsFieldLabel (GhcPass _1) = NoExtCon

type family XXHsDerivingClause x

Instances

type XXHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDerivingClause (GhcPass _1) = NoExtCon

type family XXHsDecl x

Instances

type XXHsDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDecl (GhcPass _1) = NoExtCon

type family XXHsDataDefn x

Instances

type XXHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDataDefn (GhcPass _1) = NoExtCon

type family XXHsBindsLR x x'

Instances

type XXHsBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXGRHSs x b

Instances

type XXGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XXGRHSs (GhcPass _1) _2 = NoExtCon

type family XXGRHS x b

Instances

type XXGRHS (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXGRHS (GhcPass _1) b = NoExtCon

type family XXFunDep x

Instances

type XXFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFunDep (GhcPass _1) = NoExtCon

type family XXForeignDecl x

Instances

type XXForeignDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXForeignDecl (GhcPass _1) = NoExtCon

type family XXFixitySig x

Instances

type XXFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XXFixitySig (GhcPass p) = NoExtCon

type family XXFieldOcc x

Instances

type XXFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXFieldOcc (GhcPass _1) = NoExtCon

type family XXFamilyResultSig x

Instances

type XXFamilyResultSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyResultSig (GhcPass _1) = NoExtCon

type family XXFamilyDecl x

Instances

type XXFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyDecl (GhcPass _1) = NoExtCon

type family XXFamEqn x r

Instances

type XXFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XXFamEqn (GhcPass _1) r = NoExtCon

type family XXExpr x

Instances

type XXExpr GhcPs

Defined in GHC.Hs.Expr

type XXExpr GhcPs = NoExtCon

type XXExpr GhcRn

Defined in GHC.Hs.Expr

type XXExpr GhcRn = HsExpansion (HsExpr GhcRn) (HsExpr GhcRn)

type XXExpr GhcTc

Defined in GHC.Hs.Expr

type XXExpr GhcTc = XXExprGhcTc

type family XXDerivDecl x

Instances

type XXDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivDecl (GhcPass _1) = NoExtCon

type family XXDerivClauseTys x

Instances

type XXDerivClauseTys (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivClauseTys (GhcPass _1) = NoExtCon

type family XXDefaultDecl x

Instances

type XXDefaultDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDefaultDecl (GhcPass _1) = NoExtCon

type family XXConDeclField x

Instances

type XXConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XXConDeclField (GhcPass _1) = NoExtCon

type family XXConDecl x

Instances

type XXConDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXConDecl (GhcPass _1) = NoExtCon

type family XXCmdTop x

Instances

type XXCmdTop (GhcPass _1)

Defined in GHC.Hs.Expr

type XXCmdTop (GhcPass _1) = NoExtCon

type family XXCmd x

Instances

type XXCmd GhcPs

Defined in GHC.Hs.Expr

type XXCmd GhcPs = NoExtCon

type XXCmd GhcRn

Defined in GHC.Hs.Expr

type XXCmd GhcRn = NoExtCon

type XXCmd GhcTc

Defined in GHC.Hs.Expr

type XXCmd GhcTc = HsWrap HsCmd

type family XXClsInstDecl x

Instances

type XXClsInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXClsInstDecl (GhcPass _1) = NoExtCon

type family XXBracket x

Instances

type XXBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XXBracket (GhcPass _1) = NoExtCon

type family XXApplicativeArg x

Instances

type XXApplicativeArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXApplicativeArg (GhcPass _1) = NoExtCon

type family XXAnnDecl x

Instances

type XXAnnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXAnnDecl (GhcPass _1) = NoExtCon

type family XXAmbiguousFieldOcc x

Instances

type XXAmbiguousFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXAmbiguousFieldOcc (GhcPass _1) = NoExtCon

type family XXABExport x

Instances

type XXABExport (GhcPass p)

Defined in GHC.Hs.Binds

type XXABExport (GhcPass p) = NoExtCon

type family XWildPat x

Instances

type XWildPat GhcPs

Defined in GHC.Hs.Pat

type XWildPat GhcPs = NoExtField

type XWildPat GhcRn

Defined in GHC.Hs.Pat

type XWildPat GhcRn = NoExtField

type XWildPat GhcTc

Defined in GHC.Hs.Pat

type XWildPat GhcTc = Type

type family XWildCardTy x

Instances

type XWildCardTy (GhcPass _1)

Defined in GHC.Hs.Type

type XWildCardTy (GhcPass _1) = NoExtField

type family XWarnings x

Instances

type XWarnings GhcPs

Defined in GHC.Hs.Decls

type XWarnings GhcPs = EpAnn [AddEpAnn]

type XWarnings GhcRn

Defined in GHC.Hs.Decls

type XWarnings GhcRn = NoExtField

type XWarnings GhcTc

Defined in GHC.Hs.Decls

type XWarnings GhcTc = NoExtField

type family XWarningD x

Instances

type XWarningD (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarningD (GhcPass _1) = NoExtField

type family XWarning x

Instances

type XWarning (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarning (GhcPass _1) = EpAnn [AddEpAnn]

type family XViewPat x

Instances

type XViewPat GhcPs

Defined in GHC.Hs.Pat

type XViewPat GhcPs = EpAnn [AddEpAnn]

type XViewPat GhcRn

Defined in GHC.Hs.Pat

type XViewPat GhcRn = NoExtField

type XViewPat GhcTc

Defined in GHC.Hs.Pat

type XViewPat GhcTc = Type

type family XViaStrategy x

Instances

type XViaStrategy GhcPs

Defined in GHC.Hs.Decls

type XViaStrategy GhcPs = XViaStrategyPs

type XViaStrategy GhcRn

Defined in GHC.Hs.Decls

type XViaStrategy GhcRn = LHsSigType GhcRn

type XViaStrategy GhcTc

Defined in GHC.Hs.Decls

type XViaStrategy GhcTc = Type

type family XVarPat x

Instances

type XVarPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XVarPat (GhcPass _1) = NoExtField

type family XVarBr x

Instances

type XVarBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XVarBr (GhcPass _1) = NoExtField

type family XVarBind x x'

Instances

type XVarBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XVarBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XVar x

Instances

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type family XValD x

Instances

type XValD (GhcPass _1)

Defined in GHC.Hs.Decls

type XValD (GhcPass _1) = NoExtField

type family XValBinds x x'

Instances

type XValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XValBinds (GhcPass pL) (GhcPass pR) = AnnSortKey

type family XUserTyVar x

Instances

type XUserTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XUserTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XUntypedSplice x

Instances

type XUntypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XUntypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type family XUnboundVar x

Instances

type XUnboundVar GhcPs

Defined in GHC.Hs.Expr

type XUnboundVar GhcPs = EpAnn EpAnnUnboundVar

type XUnboundVar GhcRn

Defined in GHC.Hs.Expr

type XUnboundVar GhcRn = NoExtField

type XUnboundVar GhcTc

Defined in GHC.Hs.Expr

type XUnboundVar GhcTc = HoleExprRef

type family XUnambiguous x

Instances

type XUnambiguous GhcPs

Defined in GHC.Hs.Type

type XUnambiguous GhcPs = NoExtField

type XUnambiguous GhcRn

Defined in GHC.Hs.Type

type XUnambiguous GhcRn = Name

type XUnambiguous GhcTc

Defined in GHC.Hs.Type

type XUnambiguous GhcTc = Id

type family XTypedSplice x

Instances

type XTypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type family XTypeSig x

Instances

type XTypeSig (GhcPass p)

Defined in GHC.Hs.Binds

type XTypeSig (GhcPass p) = EpAnn AnnSig

type family XTypBr x

Instances

type XTypBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypBr (GhcPass _1) = NoExtField

type family XTyVarSig x

Instances

type XTyVarSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyVarSig (GhcPass _1) = NoExtField

type family XTyVar x

Instances

type XTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XTyLit x

Instances

type XTyLit (GhcPass _1)

Defined in GHC.Hs.Type

type XTyLit (GhcPass _1) = NoExtField

type family XTyFamInstD x

Instances

type XTyFamInstD GhcPs

Defined in GHC.Hs.Decls

type XTyFamInstD GhcPs = NoExtField

type XTyFamInstD GhcRn

Defined in GHC.Hs.Decls

type XTyFamInstD GhcRn = NoExtField

type XTyFamInstD GhcTc

Defined in GHC.Hs.Decls

type XTyFamInstD GhcTc = NoExtField

type family XTyClD x

Instances

type XTyClD (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyClD (GhcPass _1) = NoExtField

type family XTupleTy x

Instances

type XTupleTy (GhcPass _1)

Defined in GHC.Hs.Type

type XTupleTy (GhcPass _1) = EpAnn AnnParen

type family XTuplePat x

Instances

type XTuplePat GhcPs

Defined in GHC.Hs.Pat

type XTuplePat GhcPs = EpAnn [AddEpAnn]

type XTuplePat GhcRn

Defined in GHC.Hs.Pat

type XTuplePat GhcRn = NoExtField

type XTuplePat GhcTc

Defined in GHC.Hs.Pat

type XTuplePat GhcTc = [Type]

type family XTransStmt x x' b

Instances

type XTransStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XTransStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcRn b = NoExtField

type XTransStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcTc b = Type

type family XTick x

Instances

type XTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XTick (GhcPass _1) = NoExtField

type family XTcBracketOut x

Instances

type XTcBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XTcBracketOut (GhcPass _1) = NoExtField

type family XTExpBr x

Instances

type XTExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTExpBr (GhcPass _1) = NoExtField

type family XSynDecl x

Instances

type XSynDecl GhcPs

Defined in GHC.Hs.Decls

type XSynDecl GhcPs = EpAnn [AddEpAnn]

type XSynDecl GhcRn

Defined in GHC.Hs.Decls

type XSynDecl GhcRn = NameSet

type XSynDecl GhcTc

Defined in GHC.Hs.Decls

type XSynDecl GhcTc = NameSet

type family XSumTy x

Instances

type XSumTy (GhcPass _1)

Defined in GHC.Hs.Type

type XSumTy (GhcPass _1) = EpAnn AnnParen

type family XSumPat x

Instances

type XSumPat GhcPs

Defined in GHC.Hs.Pat

type XSumPat GhcPs = EpAnn EpAnnSumPat

type XSumPat GhcRn

Defined in GHC.Hs.Pat

type XSumPat GhcRn = NoExtField

type XSumPat GhcTc

Defined in GHC.Hs.Pat

type XSumPat GhcTc = [Type]

type family XStockStrategy x

Instances

type XStockStrategy GhcPs

Defined in GHC.Hs.Decls

type XStockStrategy GhcPs = EpAnn [AddEpAnn]

type XStockStrategy GhcRn

Defined in GHC.Hs.Decls

type XStockStrategy GhcRn = NoExtField

type XStockStrategy GhcTc

Defined in GHC.Hs.Decls

type XStockStrategy GhcTc = NoExtField

type family XStatic x

Instances

type XStatic GhcPs

Defined in GHC.Hs.Expr

type XStatic GhcPs = EpAnn [AddEpAnn]

type XStatic GhcRn

Defined in GHC.Hs.Expr

type XStatic GhcRn = NameSet

type XStatic GhcTc

Defined in GHC.Hs.Expr

type XStatic GhcTc = NameSet

type family XStarTy x

Instances

type XStarTy (GhcPass _1)

Defined in GHC.Hs.Type

type XStarTy (GhcPass _1) = NoExtField

type family XStandaloneKindSig x

Instances

type XStandaloneKindSig GhcPs

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcPs = EpAnn [AddEpAnn]

type XStandaloneKindSig GhcRn

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcRn = NoExtField

type XStandaloneKindSig GhcTc

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcTc = NoExtField

type family XSpliced x

Instances

type XSpliced (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliced (GhcPass _1) = NoExtField

type family XSpliceTy x

Instances

type XSpliceTy GhcPs

Defined in GHC.Hs.Type

type XSpliceTy GhcPs = NoExtField

type XSpliceTy GhcRn

Defined in GHC.Hs.Type

type XSpliceTy GhcRn = NoExtField

type XSpliceTy GhcTc

Defined in GHC.Hs.Type

type XSpliceTy GhcTc = Kind

type family XSplicePat x

Instances

type XSplicePat (GhcPass _1)

Defined in GHC.Hs.Pat

type XSplicePat (GhcPass _1) = NoExtField

type family XSpliceE x

Instances

type XSpliceE (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliceE (GhcPass _1) = EpAnnCO

type family XSpliceDecl x

Instances

type XSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceDecl (GhcPass _1) = NoExtField

type family XSpliceD x

Instances

type XSpliceD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceD (GhcPass _1) = NoExtField

type family XSpecSig x

Instances

type XSpecSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSpecInstSig x

Instances

type XSpecInstSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecInstSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSigPat x

Instances

type XSigPat GhcPs

Defined in GHC.Hs.Pat

type XSigPat GhcPs = EpAnn [AddEpAnn]

type XSigPat GhcRn

Defined in GHC.Hs.Pat

type XSigPat GhcRn = NoExtField

type XSigPat GhcTc

Defined in GHC.Hs.Pat

type XSigPat GhcTc = Type

type family XSigD x

Instances

type XSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSigD (GhcPass _1) = NoExtField

type family XSectionR x

Instances

type XSectionR GhcPs

Defined in GHC.Hs.Expr

type XSectionR GhcPs = EpAnnCO

type XSectionR GhcRn

Defined in GHC.Hs.Expr

type XSectionR GhcRn = EpAnnCO

type XSectionR GhcTc

Defined in GHC.Hs.Expr

type XSectionR GhcTc = Void

type family XSectionL x

Instances

type XSectionL GhcPs

Defined in GHC.Hs.Expr

type XSectionL GhcPs = EpAnnCO

type XSectionL GhcRn

Defined in GHC.Hs.Expr

type XSectionL GhcRn = EpAnnCO

type XSectionL GhcTc

Defined in GHC.Hs.Expr

type XSectionL GhcTc = Void

type family XSCCFunSig x

Instances

type XSCCFunSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSCCFunSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSCC x

Instances

type XSCC (GhcPass _1)

Defined in GHC.Hs.Expr

type XSCC (GhcPass _1) = EpAnn AnnPragma

type family XRuleD x

Instances

type XRuleD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleD (GhcPass _1) = NoExtField

type family XRuleBndrSig x

Instances

type XRuleBndrSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleBndrSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XRoleAnnotD x

Instances

type XRoleAnnotD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRoleAnnotD (GhcPass _1) = NoExtField

type family XRnBracketOut x

Instances

type XRnBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XRnBracketOut (GhcPass _1) = NoExtField

type family XRecordUpd x

Instances

type XRecordUpd GhcPs

Defined in GHC.Hs.Expr

type XRecordUpd GhcPs = EpAnn [AddEpAnn]

type XRecordUpd GhcRn

Defined in GHC.Hs.Expr

type XRecordUpd GhcRn = NoExtField

type XRecordUpd GhcTc

Defined in GHC.Hs.Expr

type XRecordUpd GhcTc = RecordUpdTc

type family XRecordCon x

Instances

type XRecordCon GhcPs

Defined in GHC.Hs.Expr

type XRecordCon GhcPs = EpAnn [AddEpAnn]

type XRecordCon GhcRn

Defined in GHC.Hs.Expr

type XRecordCon GhcRn = NoExtField

type XRecordCon GhcTc

Defined in GHC.Hs.Expr

type XRecordCon GhcTc = PostTcExpr

type family XRecTy x

Instances

type XRecTy GhcPs

Defined in GHC.Hs.Type

type XRecTy GhcPs = EpAnn AnnList

type XRecTy GhcRn

Defined in GHC.Hs.Type

type XRecTy GhcRn = NoExtField

type XRecTy GhcTc

Defined in GHC.Hs.Type

type XRecTy GhcTc = NoExtField

type family XRecStmt x x' b

Instances

type XRecStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcPs b = EpAnn AnnList

type XRecStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcRn b = NoExtField

type XRecStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcTc b = RecStmtTc

type family XRecFld x

Instances

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

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

type XRec (GhcPass p) a

Defined in GHC.Hs.Extension

type XRec (GhcPass p) a = GenLocated (Anno a) a

type family XQuasiQuote x

Instances

type XQuasiQuote (GhcPass _1)

Defined in GHC.Hs.Expr

type XQuasiQuote (GhcPass _1) = NoExtField

type family XQualTy x

Instances

type XQualTy (GhcPass _1)

Defined in GHC.Hs.Type

type XQualTy (GhcPass _1) = NoExtField

type family XProjection x

Instances

type XProjection GhcPs

Defined in GHC.Hs.Expr

type XProjection GhcPs = EpAnn AnnProjection

type XProjection GhcRn

Defined in GHC.Hs.Expr

type XProjection GhcRn = NoExtField

type XProjection GhcTc

Defined in GHC.Hs.Expr

type XProjection GhcTc = Void

type family XProc x

Instances

type XProc (GhcPass _1)

Defined in GHC.Hs.Expr

type XProc (GhcPass _1) = EpAnn [AddEpAnn]

type family XPresent x

Instances

type XPresent (GhcPass _1)

Defined in GHC.Hs.Expr

type XPresent (GhcPass _1) = EpAnn [AddEpAnn]

type family XPragE x

Instances

type XPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XPragE (GhcPass _1) = NoExtField

type family XPatSynSig x

Instances

type XPatSynSig (GhcPass p)

Defined in GHC.Hs.Binds

type XPatSynSig (GhcPass p) = EpAnn AnnSig

type family XPatSynBind x x'

Instances

type XPatSynBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatSynBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XPatBr x

Instances

type XPatBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XPatBr (GhcPass _1) = NoExtField

type family XPatBind x x'

Instances

type XPatBind GhcPs (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcPs (GhcPass pR) = EpAnn [AddEpAnn]

type XPatBind GhcRn (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcRn (GhcPass pR) = NameSet

type XPatBind GhcTc (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcTc (GhcPass pR) = Type

type family XParTy x

Instances

type XParTy (GhcPass _1)

Defined in GHC.Hs.Type

type XParTy (GhcPass _1) = EpAnn AnnParen

type family XParStmtBlock x x'

Instances

type XParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtField

type family XParStmt x x' b

Instances

type XParStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcPs b = NoExtField

type XParStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcRn b = NoExtField

type XParStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcTc b = Type

type family XParPat x

Instances

type XParPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XParPat (GhcPass _1) = EpAnn AnnParen

type family XPar x

Instances

type XPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XPar (GhcPass _1) = EpAnn AnnParen

type family XPSB x x'

Instances

type XPSB (GhcPass idL) GhcPs

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcPs = EpAnn [AddEpAnn]

type XPSB (GhcPass idL) GhcRn

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcRn = NameSet

type XPSB (GhcPass idL) GhcTc

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcTc = NameSet

type family XOverLitE x

Instances

type XOverLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XOverLitE (GhcPass _1) = EpAnnCO

type family XOverLit x

Instances

type XOverLit GhcPs

Defined in GHC.Hs.Lit

type XOverLit GhcPs = NoExtField

type XOverLit GhcRn

Defined in GHC.Hs.Lit

type XOverLit GhcRn = Bool

type XOverLit GhcTc

Defined in GHC.Hs.Lit

type XOverLit GhcTc = OverLitTc

type family XOverLabel x

Instances

type XOverLabel GhcPs

Defined in GHC.Hs.Expr

type XOverLabel GhcPs = EpAnnCO

type XOverLabel GhcRn

Defined in GHC.Hs.Expr

type XOverLabel GhcRn = EpAnnCO

type XOverLabel GhcTc

Defined in GHC.Hs.Expr

type XOverLabel GhcTc = Void

type family XOpTy x

Instances

type XOpTy (GhcPass _1)

Defined in GHC.Hs.Type

type XOpTy (GhcPass _1) = NoExtField

type family XOpApp x

Instances

type XOpApp GhcPs

Defined in GHC.Hs.Expr

type XOpApp GhcPs = EpAnn [AddEpAnn]

type XOpApp GhcRn

Defined in GHC.Hs.Expr

type XOpApp GhcRn = Fixity

type XOpApp GhcTc

Defined in GHC.Hs.Expr

type XOpApp GhcTc = Void

type family XNoSig x

Instances

type XNoSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XNoSig (GhcPass _1) = NoExtField

type family XNewtypeStrategy x

Instances

type XNewtypeStrategy GhcPs

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcPs = EpAnn [AddEpAnn]

type XNewtypeStrategy GhcRn

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcRn = NoExtField

type XNewtypeStrategy GhcTc

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcTc = NoExtField

type family XNegApp x

Instances

type XNegApp GhcPs

Defined in GHC.Hs.Expr

type XNegApp GhcPs = EpAnn [AddEpAnn]

type XNegApp GhcRn

Defined in GHC.Hs.Expr

type XNegApp GhcRn = NoExtField

type XNegApp GhcTc

Defined in GHC.Hs.Expr

type XNegApp GhcTc = NoExtField

type family XNPlusKPat x

Instances

type XNPlusKPat GhcPs

Defined in GHC.Hs.Pat

type XNPlusKPat GhcPs = EpAnn EpaLocation

type XNPlusKPat GhcRn

Defined in GHC.Hs.Pat

type XNPlusKPat GhcRn = NoExtField

type XNPlusKPat GhcTc

Defined in GHC.Hs.Pat

type XNPlusKPat GhcTc = Type

type family XNPat x

Instances

type XNPat GhcPs

Defined in GHC.Hs.Pat

type XNPat GhcPs = EpAnn [AddEpAnn]

type XNPat GhcRn

Defined in GHC.Hs.Pat

type XNPat GhcRn = EpAnn [AddEpAnn]

type XNPat GhcTc

Defined in GHC.Hs.Pat

type XNPat GhcTc = Type

type family XMultiIf x

Instances

type XMultiIf GhcPs

Defined in GHC.Hs.Expr

type XMultiIf GhcPs = EpAnn [AddEpAnn]

type XMultiIf GhcRn

Defined in GHC.Hs.Expr

type XMultiIf GhcRn = NoExtField

type XMultiIf GhcTc

Defined in GHC.Hs.Expr

type XMultiIf GhcTc = Type

type family XMissing x

Instances

type XMissing GhcPs

Defined in GHC.Hs.Expr

type XMissing GhcPs = EpAnn EpaLocation

type XMissing GhcRn

Defined in GHC.Hs.Expr

type XMissing GhcRn = NoExtField

type XMissing GhcTc

Defined in GHC.Hs.Expr

type XMissing GhcTc = Scaled Type

type family XMinimalSig x

Instances

type XMinimalSig (GhcPass p)

Defined in GHC.Hs.Binds

type XMinimalSig (GhcPass p) = EpAnn [AddEpAnn]

type family XMG x b

Instances

type XMG GhcPs b

Defined in GHC.Hs.Expr

type XMG GhcPs b = NoExtField

type XMG GhcRn b

Defined in GHC.Hs.Expr

type XMG GhcRn b = NoExtField

type XMG GhcTc b

Defined in GHC.Hs.Expr

type XMG GhcTc b = MatchGroupTc

type family XLitPat x

Instances

type XLitPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XLitPat (GhcPass _1) = NoExtField

type family XLitE x

Instances

type XLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XLitE (GhcPass _1) = EpAnnCO

type family XListTy x

Instances

type XListTy (GhcPass _1)

Defined in GHC.Hs.Type

type XListTy (GhcPass _1) = EpAnn AnnParen

type family XListPat x

Instances

type XListPat GhcPs

Defined in GHC.Hs.Pat

type XListPat GhcPs = EpAnn AnnList

type XListPat GhcRn

Defined in GHC.Hs.Pat

type XListPat GhcRn = Maybe (SyntaxExpr GhcRn)

type XListPat GhcTc

Defined in GHC.Hs.Pat

type XListPat GhcTc = ListPatTc

type family XLetStmt x x' b

Instances

type XLetStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLetStmt (GhcPass _1) (GhcPass _2) b = EpAnn [AddEpAnn]

type family XLet x

Instances

type XLet GhcPs

Defined in GHC.Hs.Expr

type XLet GhcPs = EpAnn AnnsLet

type XLet GhcRn

Defined in GHC.Hs.Expr

type XLet GhcRn = NoExtField

type XLet GhcTc

Defined in GHC.Hs.Expr

type XLet GhcTc = NoExtField

type family XLazyPat x

Instances

type XLazyPat GhcPs

Defined in GHC.Hs.Pat

type XLazyPat GhcPs = EpAnn [AddEpAnn]

type XLazyPat GhcRn

Defined in GHC.Hs.Pat

type XLazyPat GhcRn = NoExtField

type XLazyPat GhcTc

Defined in GHC.Hs.Pat

type XLazyPat GhcTc = NoExtField

type family XLastStmt x x' b

Instances

type XLastStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLastStmt (GhcPass _1) (GhcPass _2) b = NoExtField

type family XLamCase x

Instances

type XLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XLam x

Instances

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type family XKindedTyVar x

Instances

type XKindedTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XKindedTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XKindSigD x

Instances

type XKindSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XKindSigD (GhcPass _1) = NoExtField

type family XKindSig x

Instances

type XKindSig (GhcPass _1)

Defined in GHC.Hs.Type

type XKindSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XInstD x

Instances

type XInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XInstD (GhcPass _1) = NoExtField

type family XInlineSig x

Instances

type XInlineSig (GhcPass p)

Defined in GHC.Hs.Binds

type XInlineSig (GhcPass p) = EpAnn [AddEpAnn]

type family XIf x

Instances

type XIf GhcPs

Defined in GHC.Hs.Expr

type XIf GhcPs = EpAnn AnnsIf

type XIf GhcRn

Defined in GHC.Hs.Expr

type XIf GhcRn = NoExtField

type XIf GhcTc

Defined in GHC.Hs.Expr

type XIf GhcTc = NoExtField

type family XIdSig x

Instances

type XIdSig (GhcPass p)

Defined in GHC.Hs.Binds

type XIdSig (GhcPass p) = NoExtField

type family XIParamTy x

Instances

type XIParamTy (GhcPass _1)

Defined in GHC.Hs.Type

type XIParamTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XIPVar x

Instances

type XIPVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XIPVar (GhcPass _1) = EpAnnCO

type family XIPBinds x

Instances

type XIPBinds GhcPs

Defined in GHC.Hs.Binds

type XIPBinds GhcPs = NoExtField

type XIPBinds GhcRn

Defined in GHC.Hs.Binds

type XIPBinds GhcRn = NoExtField

type XIPBinds GhcTc

Defined in GHC.Hs.Binds

type XIPBinds GhcTc = TcEvBinds

type family XIEVar x

Instances

type XIEVar GhcPs

Defined in GHC.Hs.ImpExp

type XIEVar GhcPs = NoExtField

type XIEVar GhcRn

Defined in GHC.Hs.ImpExp

type XIEVar GhcRn = NoExtField

type XIEVar GhcTc

Defined in GHC.Hs.ImpExp

type XIEVar GhcTc = NoExtField

type family XIEThingWith x

Instances

type XIEThingWith (GhcPass 'Parsed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Parsed) = EpAnn [AddEpAnn]

type XIEThingWith (GhcPass 'Renamed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Renamed) = [Located FieldLabel]

type XIEThingWith (GhcPass 'Typechecked)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Typechecked) = NoExtField

type family XIEThingAll x

Instances

type XIEThingAll (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAll (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEThingAbs x

Instances

type XIEThingAbs (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAbs (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEModuleContents x

Instances

type XIEModuleContents GhcPs

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcPs = EpAnn [AddEpAnn]

type XIEModuleContents GhcRn

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcRn = NoExtField

type XIEModuleContents GhcTc

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcTc = NoExtField

type family XIEGroup x

Instances

type XIEGroup (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEGroup (GhcPass _1) = NoExtField

type family XIEDocNamed x

Instances

type XIEDocNamed (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDocNamed (GhcPass _1) = NoExtField

type family XIEDoc x

Instances

type XIEDoc (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDoc (GhcPass _1) = NoExtField

type family XHsWordPrim x

Instances

type XHsWordPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWordPrim (GhcPass _1) = SourceText

type family XHsWord64Prim x

Instances

type XHsWord64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWord64Prim (GhcPass _1) = SourceText

type family XHsWC x b

Instances

type XHsWC GhcPs b

Defined in GHC.Hs.Type

type XHsWC GhcPs b = NoExtField

type XHsWC GhcRn b

Defined in GHC.Hs.Type

type XHsWC GhcRn b = [Name]

type XHsWC GhcTc b

Defined in GHC.Hs.Type

type XHsWC GhcTc b = [Name]

type family XHsValBinds x x'

Instances

type XHsValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsValBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type family XHsStringPrim x

Instances

type XHsStringPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsStringPrim (GhcPass _1) = SourceText

type family XHsString x

Instances

type XHsString (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsString (GhcPass _1) = SourceText

type family XHsSig x

Instances

type XHsSig (GhcPass _1)

Defined in GHC.Hs.Type

type XHsSig (GhcPass _1) = NoExtField

type family XHsRule x

Instances

type XHsRule GhcPs

Defined in GHC.Hs.Decls

type XHsRule GhcPs = EpAnn HsRuleAnn

type XHsRule GhcRn

Defined in GHC.Hs.Decls

type XHsRule GhcRn = HsRuleRn

type XHsRule GhcTc

Defined in GHC.Hs.Decls

type XHsRule GhcTc = HsRuleRn

type family XHsRecField x

Instances

type XHsRecField _1

Defined in GHC.Hs.Pat

type XHsRecField _1 = EpAnn [AddEpAnn]

type family XHsRat x

Instances

type XHsRat (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsRat (GhcPass _1) = NoExtField

type family XHsQTvs x

Instances

type XHsQTvs GhcPs

Defined in GHC.Hs.Type

type XHsQTvs GhcPs = NoExtField

type XHsQTvs GhcRn

Defined in GHC.Hs.Type

type XHsQTvs GhcRn = HsQTvsRn

type XHsQTvs GhcTc

Defined in GHC.Hs.Type

type XHsQTvs GhcTc = HsQTvsRn

type family XHsPS x

Instances

type XHsPS GhcPs

Defined in GHC.Hs.Type

type XHsPS GhcPs = EpAnn EpaLocation

type XHsPS GhcRn

Defined in GHC.Hs.Type

type XHsPS GhcRn = HsPSRn

type XHsPS GhcTc

Defined in GHC.Hs.Type

type XHsPS GhcTc = HsPSRn

type family XHsOuterImplicit x

Instances

type XHsOuterImplicit GhcPs

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcPs = NoExtField

type XHsOuterImplicit GhcRn

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcRn = [Name]

type XHsOuterImplicit GhcTc

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcTc = [TyVar]

type family XHsOuterExplicit x flag

Instances

type XHsOuterExplicit GhcPs _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcPs _1 = EpAnnForallTy

type XHsOuterExplicit GhcRn _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcRn _1 = NoExtField

type XHsOuterExplicit GhcTc flag

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcTc flag = [VarBndr TyVar flag]

type family XHsInteger x

Instances

type XHsInteger (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInteger (GhcPass _1) = SourceText

type family XHsIntPrim x

Instances

type XHsIntPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsIntPrim (GhcPass _1) = SourceText

type family XHsInt64Prim x

Instances

type XHsInt64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt64Prim (GhcPass _1) = SourceText

type family XHsInt x

Instances

type XHsInt (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt (GhcPass _1) = NoExtField

type family XHsIPBinds x x'

Instances

type XHsIPBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsIPBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type family XHsForAllVis x

Instances

type XHsForAllVis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllVis (GhcPass _1) = EpAnnForallTy

type family XHsForAllInvis x

Instances

type XHsForAllInvis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllInvis (GhcPass _1) = EpAnnForallTy

type family XHsFloatPrim x

Instances

type XHsFloatPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsFloatPrim (GhcPass _1) = NoExtField

type family XHsDoublePrim x

Instances

type XHsDoublePrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsDoublePrim (GhcPass _1) = NoExtField

type family XHsCharPrim x

Instances

type XHsCharPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsCharPrim (GhcPass _1) = SourceText

type family XHsChar x

Instances

type XHsChar (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsChar (GhcPass _1) = SourceText

type family XHsAnnotation x

Instances

type XHsAnnotation (GhcPass _1)

Defined in GHC.Hs.Decls

type XHsAnnotation (GhcPass _1) = EpAnn AnnPragma

type family XGetField x

Instances

type XGetField GhcPs

Defined in GHC.Hs.Expr

type XGetField GhcPs = EpAnnCO

type XGetField GhcRn

Defined in GHC.Hs.Expr

type XGetField GhcRn = NoExtField

type XGetField GhcTc

Defined in GHC.Hs.Expr

type XGetField GhcTc = Void

type family XFunTy x

Instances

type XFunTy (GhcPass _1)

Defined in GHC.Hs.Type

type XFunTy (GhcPass _1) = EpAnn TrailingAnn

type family XFunBind x x'

Instances

type XFunBind (GhcPass pL) GhcPs

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcPs = NoExtField

type XFunBind (GhcPass pL) GhcRn

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcRn = NameSet

type XFunBind (GhcPass pL) GhcTc

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcTc = HsWrapper

type family XForeignImport x

Instances

type XForeignImport GhcPs

Defined in GHC.Hs.Decls

type XForeignImport GhcPs = EpAnn [AddEpAnn]

type XForeignImport GhcRn

Defined in GHC.Hs.Decls

type XForeignImport GhcRn = NoExtField

type XForeignImport GhcTc

Defined in GHC.Hs.Decls

type XForeignImport GhcTc = Coercion

type family XForeignExport x

Instances

type XForeignExport GhcPs

Defined in GHC.Hs.Decls

type XForeignExport GhcPs = EpAnn [AddEpAnn]

type XForeignExport GhcRn

Defined in GHC.Hs.Decls

type XForeignExport GhcRn = NoExtField

type XForeignExport GhcTc

Defined in GHC.Hs.Decls

type XForeignExport GhcTc = Coercion

type family XForD x

Instances

type XForD (GhcPass _1)

Defined in GHC.Hs.Decls

type XForD (GhcPass _1) = NoExtField

type family XForAllTy x

Instances

type XForAllTy (GhcPass _1)

Defined in GHC.Hs.Type

type XForAllTy (GhcPass _1) = NoExtField

type family XFixitySig x

Instances

type XFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixitySig (GhcPass p) = NoExtField

type family XFixSig x

Instances

type XFixSig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixSig (GhcPass p) = EpAnn [AddEpAnn]

type family XFamDecl x

Instances

type XFamDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XFamDecl (GhcPass _1) = NoExtField

type family XExprWithTySig x

Instances

type XExprWithTySig GhcPs

Defined in GHC.Hs.Expr

type XExprWithTySig GhcPs = EpAnn [AddEpAnn]

type XExprWithTySig GhcRn

Defined in GHC.Hs.Expr

type XExprWithTySig GhcRn = NoExtField

type XExprWithTySig GhcTc

Defined in GHC.Hs.Expr

type XExprWithTySig GhcTc = NoExtField

type family XExplicitTupleTy x

Instances

type XExplicitTupleTy GhcPs

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcPs = EpAnn [AddEpAnn]

type XExplicitTupleTy GhcRn

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcRn = NoExtField

type XExplicitTupleTy GhcTc

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcTc = [Kind]

type family XExplicitTuple x

Instances

type XExplicitTuple GhcPs

Defined in GHC.Hs.Expr

type XExplicitTuple GhcPs = EpAnn [AddEpAnn]

type XExplicitTuple GhcRn

Defined in GHC.Hs.Expr

type XExplicitTuple GhcRn = NoExtField

type XExplicitTuple GhcTc

Defined in GHC.Hs.Expr

type XExplicitTuple GhcTc = NoExtField

type family XExplicitSum x

Instances

type XExplicitSum GhcPs

Defined in GHC.Hs.Expr

type XExplicitSum GhcPs = EpAnn AnnExplicitSum

type XExplicitSum GhcRn

Defined in GHC.Hs.Expr

type XExplicitSum GhcRn = NoExtField

type XExplicitSum GhcTc

Defined in GHC.Hs.Expr

type XExplicitSum GhcTc = [Type]

type family XExplicitListTy x

Instances

type XExplicitListTy GhcPs

Defined in GHC.Hs.Type

type XExplicitListTy GhcPs = EpAnn [AddEpAnn]

type XExplicitListTy GhcRn

Defined in GHC.Hs.Type

type XExplicitListTy GhcRn = NoExtField

type XExplicitListTy GhcTc

Defined in GHC.Hs.Type

type XExplicitListTy GhcTc = Kind

type family XExplicitList x

Instances

type XExplicitList GhcPs

Defined in GHC.Hs.Expr

type XExplicitList GhcPs = EpAnn AnnList

type XExplicitList GhcRn

Defined in GHC.Hs.Expr

type XExplicitList GhcRn = NoExtField

type XExplicitList GhcTc

Defined in GHC.Hs.Expr

type XExplicitList GhcTc = Type

type family XExpBr x

Instances

type XExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XExpBr (GhcPass _1) = NoExtField

type family XEmptyLocalBinds x x'

Instances

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR) = NoExtField

type family XDocTy x

Instances

type XDocTy (GhcPass _1)

Defined in GHC.Hs.Type

type XDocTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XDocD x

Instances

type XDocD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDocD (GhcPass _1) = NoExtField

type family XDo x

Instances

type XDo GhcPs

Defined in GHC.Hs.Expr

type XDo GhcPs = EpAnn AnnList

type XDo GhcRn

Defined in GHC.Hs.Expr

type XDo GhcRn = NoExtField

type XDo GhcTc

Defined in GHC.Hs.Expr

type XDo GhcTc = Type

type family XDerivD x

Instances

type XDerivD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDerivD (GhcPass _1) = NoExtField

type family XDefD x

Instances

type XDefD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDefD (GhcPass _1) = NoExtField

type family XDecBrL x

Instances

type XDecBrL (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrL (GhcPass _1) = NoExtField

type family XDecBrG x

Instances

type XDecBrG (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrG (GhcPass _1) = NoExtField

type family XDctSingle x

Instances

type XDctSingle (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctSingle (GhcPass _1) = NoExtField

type family XDctMulti x

Instances

type XDctMulti (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctMulti (GhcPass _1) = NoExtField

type family XDataFamInstD x

Instances

type XDataFamInstD GhcPs

Defined in GHC.Hs.Decls

type XDataFamInstD GhcPs = EpAnn [AddEpAnn]

type XDataFamInstD GhcRn

Defined in GHC.Hs.Decls

type XDataFamInstD GhcRn = NoExtField

type XDataFamInstD GhcTc

Defined in GHC.Hs.Decls

type XDataFamInstD GhcTc = NoExtField

type family XDataDecl x

Instances

type XDataDecl GhcPs

Defined in GHC.Hs.Decls

type XDataDecl GhcPs = EpAnn [AddEpAnn]

type XDataDecl GhcRn

Defined in GHC.Hs.Decls

type XDataDecl GhcRn = DataDeclRn

type XDataDecl GhcTc

Defined in GHC.Hs.Decls

type XDataDecl GhcTc = DataDeclRn

type family XConPat x

Instances

type XConPat GhcPs

Defined in GHC.Hs.Pat

type XConPat GhcPs = EpAnn [AddEpAnn]

type XConPat GhcRn

Defined in GHC.Hs.Pat

type XConPat GhcRn = NoExtField

type XConPat GhcTc

Defined in GHC.Hs.Pat

type XConPat GhcTc = ConPatTc

type family XConLikeOut x

Instances

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type family XConDeclH98 x

Instances

type XConDeclH98 (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclH98 (GhcPass _1) = EpAnn [AddEpAnn]

type family XConDeclGADT x

Instances

type XConDeclGADT (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclGADT (GhcPass _1) = EpAnn [AddEpAnn]

type family XConDeclField x

Instances

type XConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XConDeclField (GhcPass _1) = EpAnn [AddEpAnn]

type family XCompleteMatchSig x

Instances

type XCompleteMatchSig (GhcPass p)

Defined in GHC.Hs.Binds

type XCompleteMatchSig (GhcPass p) = EpAnn [AddEpAnn]

type family XCoPat x

type family XCmdWrap x

Instances

type XCmdWrap (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdWrap (GhcPass _1) = NoExtField

type family XCmdTop x

Instances

type XCmdTop GhcPs

Defined in GHC.Hs.Expr

type XCmdTop GhcPs = NoExtField

type XCmdTop GhcRn

Defined in GHC.Hs.Expr

type XCmdTop GhcRn = CmdSyntaxTable GhcRn

type XCmdTop GhcTc

Defined in GHC.Hs.Expr

type XCmdTop GhcTc = CmdTopTc

type family XCmdPar x

Instances

type XCmdPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdPar (GhcPass _1) = EpAnn AnnParen

type family XCmdLet x

Instances

type XCmdLet GhcPs

Defined in GHC.Hs.Expr

type XCmdLet GhcPs = EpAnn AnnsLet

type XCmdLet GhcRn

Defined in GHC.Hs.Expr

type XCmdLet GhcRn = NoExtField

type XCmdLet GhcTc

Defined in GHC.Hs.Expr

type XCmdLet GhcTc = NoExtField

type family XCmdLamCase x

Instances

type XCmdLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XCmdLam x

Instances

type XCmdLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLam (GhcPass _1) = NoExtField

type family XCmdIf x

Instances

type XCmdIf GhcPs

Defined in GHC.Hs.Expr

type XCmdIf GhcPs = EpAnn AnnsIf

type XCmdIf GhcRn

Defined in GHC.Hs.Expr

type XCmdIf GhcRn = NoExtField

type XCmdIf GhcTc

Defined in GHC.Hs.Expr

type XCmdIf GhcTc = NoExtField

type family XCmdDo x

Instances

type XCmdDo GhcPs

Defined in GHC.Hs.Expr

type XCmdDo GhcPs = EpAnn AnnList

type XCmdDo GhcRn

Defined in GHC.Hs.Expr

type XCmdDo GhcRn = NoExtField

type XCmdDo GhcTc

Defined in GHC.Hs.Expr

type XCmdDo GhcTc = Type

type family XCmdCase x

Instances

type XCmdCase GhcPs

Defined in GHC.Hs.Expr

type XCmdCase GhcPs = EpAnn EpAnnHsCase

type XCmdCase GhcRn

Defined in GHC.Hs.Expr

type XCmdCase GhcRn = NoExtField

type XCmdCase GhcTc

Defined in GHC.Hs.Expr

type XCmdCase GhcTc = NoExtField

type family XCmdArrForm x

Instances

type XCmdArrForm GhcPs

Defined in GHC.Hs.Expr

type XCmdArrForm GhcPs = EpAnn AnnList

type XCmdArrForm GhcRn

Defined in GHC.Hs.Expr

type XCmdArrForm GhcRn = NoExtField

type XCmdArrForm GhcTc

Defined in GHC.Hs.Expr

type XCmdArrForm GhcTc = NoExtField

type family XCmdArrApp x

Instances

type XCmdArrApp GhcPs

Defined in GHC.Hs.Expr

type XCmdArrApp GhcPs = EpAnn AddEpAnn

type XCmdArrApp GhcRn

Defined in GHC.Hs.Expr

type XCmdArrApp GhcRn = NoExtField

type XCmdArrApp GhcTc

Defined in GHC.Hs.Expr

type XCmdArrApp GhcTc = Type

type family XCmdApp x

Instances

type XCmdApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdApp (GhcPass _1) = EpAnnCO

type family XClsInstD x

Instances

type XClsInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XClsInstD (GhcPass _1) = NoExtField

type family XClassOpSig x

Instances

type XClassOpSig (GhcPass p)

Defined in GHC.Hs.Binds

type XClassOpSig (GhcPass p) = EpAnn AnnSig

type family XClassDecl x

Instances

type XClassDecl GhcPs

Defined in GHC.Hs.Decls

type XClassDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey, LayoutInfo)

type XClassDecl GhcRn

Defined in GHC.Hs.Decls

type XClassDecl GhcRn = NameSet

type XClassDecl GhcTc

Defined in GHC.Hs.Decls

type XClassDecl GhcTc = NameSet

type family XCase x

Instances

type XCase GhcPs

Defined in GHC.Hs.Expr

type XCase GhcPs = EpAnn EpAnnHsCase

type XCase GhcRn

Defined in GHC.Hs.Expr

type XCase GhcRn = NoExtField

type XCase GhcTc

Defined in GHC.Hs.Expr

type XCase GhcTc = NoExtField

type family XCTyFamInstDecl x

Instances

type XCTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyFamInstDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCTyClGroup x

Instances

type XCTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyClGroup (GhcPass _1) = NoExtField

type family XCRuleDecls x

Instances

type XCRuleDecls GhcPs

Defined in GHC.Hs.Decls

type XCRuleDecls GhcPs = EpAnn [AddEpAnn]

type XCRuleDecls GhcRn

Defined in GHC.Hs.Decls

type XCRuleDecls GhcRn = NoExtField

type XCRuleDecls GhcTc

Defined in GHC.Hs.Decls

type XCRuleDecls GhcTc = NoExtField

type family XCRuleBndr x

Instances

type XCRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XCRuleBndr (GhcPass _1) = EpAnn [AddEpAnn]

type family XCRoleAnnotDecl x

Instances

type XCRoleAnnotDecl GhcPs

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcPs = EpAnn [AddEpAnn]

type XCRoleAnnotDecl GhcRn

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcRn = NoExtField

type XCRoleAnnotDecl GhcTc

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcTc = NoExtField

type family XCMatch x b

Instances

type XCMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XCMatch (GhcPass _1) b = EpAnn [AddEpAnn]

type family XCKindSig x

Instances

type XCKindSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XCKindSig (GhcPass _1) = NoExtField

type family XCInjectivityAnn x

Instances

type XCInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCInjectivityAnn (GhcPass _1) = EpAnn [AddEpAnn]

type family XCImportDecl x

Instances

type XCImportDecl GhcPs

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcPs = EpAnn EpAnnImportDecl

type XCImportDecl GhcRn

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcRn = NoExtField

type XCImportDecl GhcTc

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcTc = NoExtField

type family XCIPBind x

Instances

type XCIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XCIPBind (GhcPass p) = EpAnn [AddEpAnn]

type family XCHsGroup x

Instances

type XCHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsGroup (GhcPass _1) = NoExtField

type family XCHsFieldLabel x

Instances

type XCHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XCHsFieldLabel (GhcPass _1) = EpAnn AnnFieldLabel

type family XCHsDerivingClause x

Instances

type XCHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDerivingClause (GhcPass _1) = EpAnn [AddEpAnn]

type family XCHsDataDefn x

Instances

type XCHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDataDefn (GhcPass _1) = NoExtField

type family XCGRHSs x b

Instances

type XCGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHSs (GhcPass _1) _2 = EpAnnComments

type family XCGRHS x b

Instances

type XCGRHS (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHS (GhcPass _1) _2 = EpAnn GrhsAnn

type family XCFunDep x

Instances

type XCFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFunDep (GhcPass _1) = EpAnn [AddEpAnn]

type family XCFieldOcc x

Instances

type XCFieldOcc GhcPs

Defined in GHC.Hs.Type

type XCFieldOcc GhcPs = NoExtField

type XCFieldOcc GhcRn

Defined in GHC.Hs.Type

type XCFieldOcc GhcRn = Name

type XCFieldOcc GhcTc

Defined in GHC.Hs.Type

type XCFieldOcc GhcTc = Id

type family XCFamilyDecl x

Instances

type XCFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFamilyDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCFamEqn x r

Instances

type XCFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XCFamEqn (GhcPass _1) r = EpAnn [AddEpAnn]

type family XCDerivDecl x

Instances

type XCDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCDerivDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCDefaultDecl x

Instances

type XCDefaultDecl GhcPs

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcPs = EpAnn [AddEpAnn]

type XCDefaultDecl GhcRn

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcRn = NoExtField

type XCDefaultDecl GhcTc

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcTc = NoExtField

type family XCClsInstDecl x

Instances

type XCClsInstDecl GhcPs

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)

type XCClsInstDecl GhcRn

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcRn = NoExtField

type XCClsInstDecl GhcTc

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcTc = NoExtField

type family XBracket x

Instances

type XBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XBracket (GhcPass _1) = EpAnn [AddEpAnn]

type family XBodyStmt x x' b

Instances

type XBodyStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcPs b = NoExtField

type XBodyStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcRn b = NoExtField

type XBodyStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcTc b = Type

type family XBindStmt x x' b

Instances

type XBindStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XBindStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcRn b = XBindStmtRn

type XBindStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcTc b = XBindStmtTc

type family XBinTick x

Instances

type XBinTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XBinTick (GhcPass _1) = NoExtField

type family XBangTy x

Instances

type XBangTy (GhcPass _1)

Defined in GHC.Hs.Type

type XBangTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XBangPat x

Instances

type XBangPat GhcPs

Defined in GHC.Hs.Pat

type XBangPat GhcPs = EpAnn [AddEpAnn]

type XBangPat GhcRn

Defined in GHC.Hs.Pat

type XBangPat GhcRn = NoExtField

type XBangPat GhcTc

Defined in GHC.Hs.Pat

type XBangPat GhcTc = NoExtField

type family XAsPat x

Instances

type XAsPat GhcPs

Defined in GHC.Hs.Pat

type XAsPat GhcPs = EpAnn [AddEpAnn]

type XAsPat GhcRn

Defined in GHC.Hs.Pat

type XAsPat GhcRn = NoExtField

type XAsPat GhcTc

Defined in GHC.Hs.Pat

type XAsPat GhcTc = NoExtField

type family XArithSeq x

Instances

type XArithSeq GhcPs

Defined in GHC.Hs.Expr

type XArithSeq GhcPs = EpAnn [AddEpAnn]

type XArithSeq GhcRn

Defined in GHC.Hs.Expr

type XArithSeq GhcRn = NoExtField

type XArithSeq GhcTc

Defined in GHC.Hs.Expr

type XArithSeq GhcTc = PostTcExpr

type family XApplicativeStmt x x' b

Instances

type XApplicativeStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcPs b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcRn b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcTc b = Type

type family XApplicativeArgOne x

Instances

type XApplicativeArgOne GhcPs

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcPs = NoExtField

type XApplicativeArgOne GhcRn

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcRn = FailOperator GhcRn

type XApplicativeArgOne GhcTc

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcTc = FailOperator GhcTc

type family XApplicativeArgMany x

Instances

type XApplicativeArgMany (GhcPass _1)

Defined in GHC.Hs.Expr

type XApplicativeArgMany (GhcPass _1) = NoExtField

type family XAppTypeE x

Instances

type XAppTypeE GhcPs

Defined in GHC.Hs.Expr

type XAppTypeE GhcPs = SrcSpan

type XAppTypeE GhcRn

Defined in GHC.Hs.Expr

type XAppTypeE GhcRn = NoExtField

type XAppTypeE GhcTc

Defined in GHC.Hs.Expr

type XAppTypeE GhcTc = Type

type family XAppTy x

Instances

type XAppTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppTy (GhcPass _1) = NoExtField

type family XAppKindTy x

Instances

type XAppKindTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppKindTy (GhcPass _1) = SrcSpan

type family XApp x

Instances

type XApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XApp (GhcPass _1) = EpAnnCO

type family XAnyClassStrategy x

Instances

type XAnyClassStrategy GhcPs

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcPs = EpAnn [AddEpAnn]

type XAnyClassStrategy GhcRn

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcRn = NoExtField

type XAnyClassStrategy GhcTc

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcTc = NoExtField

type family XAnnD x

Instances

type XAnnD (GhcPass _1)

Defined in GHC.Hs.Decls

type XAnnD (GhcPass _1) = NoExtField

type family XAmbiguous x

Instances

type XAmbiguous GhcPs

Defined in GHC.Hs.Type

type XAmbiguous GhcPs = NoExtField

type XAmbiguous GhcRn

Defined in GHC.Hs.Type

type XAmbiguous GhcRn = NoExtField

type XAmbiguous GhcTc

Defined in GHC.Hs.Type

type XAmbiguous GhcTc = Id

type family XAbsBinds x x'

Instances

type XAbsBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XAbsBinds (GhcPass pL) (GhcPass pR) = NoExtField

type family XABE x

Instances

type XABE (GhcPass p)

Defined in GHC.Hs.Binds

type XABE (GhcPass p) = NoExtField

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 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

UnXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

unXRec :: XRec (GhcPass p) a -> a

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

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]

Defined in GHC.Hs.Extension

type NoGhcTc (GhcPass pass) = GhcPass (NoGhcTcPass pass)

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 NoExtCon, 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

Data NoExtField

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

Outputable NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtField -> SDoc

Eq NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

(==) :: NoExtField -> NoExtField -> Bool

(/=) :: NoExtField -> NoExtField -> Bool

Ord NoExtField

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

data NoExtCon

Used in TTG extension constructors that have yet to be extended with anything. If an extension constructor has NoExtCon as its field, it is not intended to ever be constructed anywhere, and any function that consumes the extension constructor can eliminate it by way of noExtCon.

This should not be confused with NoExtField, which are found in unused extension points (not constructors) and therefore can be inhabited.

Instances

Data NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NoExtCon -> c NoExtCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NoExtCon

toConstr :: NoExtCon -> Constr

dataTypeOf :: NoExtCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NoExtCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NoExtCon)

gmapT :: (forall b. Data b => b -> b) -> NoExtCon -> NoExtCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NoExtCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NoExtCon -> r

gmapQ :: (forall d. Data d => d -> u) -> NoExtCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NoExtCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

Outputable NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtCon -> SDoc

Eq NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

(==) :: NoExtCon -> NoExtCon -> Bool

(/=) :: NoExtCon -> NoExtCon -> Bool

Ord NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

compare :: NoExtCon -> NoExtCon -> Ordering

(<) :: NoExtCon -> NoExtCon -> Bool

(<=) :: NoExtCon -> NoExtCon -> Bool

(>) :: NoExtCon -> NoExtCon -> Bool

(>=) :: NoExtCon -> NoExtCon -> Bool

max :: NoExtCon -> NoExtCon -> NoExtCon

min :: NoExtCon -> NoExtCon -> NoExtCon

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

MapXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

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

type LIdP p = XRec p (IdP p)

type family IdP p

Maps the "normal" id type for a given pass

Instances

type IdP (GhcPass p)

Defined in GHC.Hs.Extension

type IdP (GhcPass p) = IdGhcP p

type family Anno a = (b :: Type)

Instances

type Anno ConLike

Defined in GHC.Hs.Pat

type Anno ConLike = SrcSpanAnnN

type Anno OverlapMode

Defined in GHC.Hs.Decls

type Anno OverlapMode = SrcSpanAnnP

type Anno OverlapMode

Defined in GHC.Hs.Decls

type Anno OverlapMode = SrcSpanAnnP

type Anno CType

Defined in GHC.Hs.Decls

type Anno CType = SrcSpanAnnP

type Anno Name

Defined in GHC.Hs.Extension

type Anno Name = SrcSpanAnnN

type Anno RdrName

Defined in GHC.Hs.Extension

type Anno RdrName = SrcSpanAnnN

type Anno StringLiteral

Defined in GHC.Hs.Binds

type Anno StringLiteral = SrcSpan

type Anno Id

Defined in GHC.Hs.Extension

type Anno Id = SrcSpanAnnN

type Anno ModuleName

Defined in GHC.Hs.ImpExp

type Anno ModuleName = SrcSpanAnnA

type Anno DocDecl

Defined in GHC.Hs.Decls

type Anno DocDecl = SrcSpanAnnA

type Anno HsIPName

Defined in GHC.Hs.Type

type Anno HsIPName = SrcSpan

type Anno Bool

Defined in GHC.Hs.Decls

type Anno Bool = SrcSpan

type Anno (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (IE (GhcPass p)) = SrcSpanAnnA

type Anno (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

type Anno (IPBind (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FunDep (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FunDep (GhcPass p)) = SrcSpanAnnA

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmd (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmdTop (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmdTop (GhcPass p)) = SrcSpan

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno (HsSplice (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsSplice (GhcPass p)) = SrcSpanAnnA

type Anno (HsOverLit (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (HsOverLit (GhcPass p)) = SrcSpan

type Anno (Pat (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (Pat (GhcPass p)) = SrcSpanAnnA

type Anno (AmbiguousFieldOcc GhcTc)

Defined in GHC.Hs.Pat

type Anno (AmbiguousFieldOcc GhcTc) = SrcSpanAnnA

type Anno (BangType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (ConDeclField (GhcPass p))

Defined in GHC.Hs.Type

type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA

type Anno (FieldOcc (GhcPass p))

Defined in GHC.Hs.Type

type Anno (FieldOcc (GhcPass p)) = SrcSpan

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (HsBindLR (GhcPass idL) (GhcPass idR))

Defined in GHC.Hs.Binds

type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (HsRecField' p arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField' p arg) = SrcSpanAnnA

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

noExtField :: NoExtField

Used when constructing a term with an unused extension point.

noExtCon :: NoExtCon -> a

Eliminate a NoExtCon. Much like absurd.

data IOEnvFailure

Constructors

IOEnvFailure

Instances

Exception IOEnvFailure

Defined in GHC.Data.IOEnv

Methods

toException :: IOEnvFailure -> SomeException

fromException :: SomeException -> Maybe IOEnvFailure

displayException :: IOEnvFailure -> String

Show IOEnvFailure

Defined in GHC.Data.IOEnv

Methods

showsPrec :: Int -> IOEnvFailure -> ShowS

show :: IOEnvFailure -> String

showList :: [IOEnvFailure] -> ShowS

data IOEnv env a

Instances

MonadFail (IOEnv m)

Defined in GHC.Data.IOEnv

Methods

fail :: String -> IOEnv m a

MonadFix (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mfix :: (a -> IOEnv env a) -> IOEnv env a

MonadIO (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

liftIO :: IO a -> IOEnv env a

Alternative (IOEnv env)

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)

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)

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)

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)

Defined in GHC.Data.IOEnv

Methods

mzero :: IOEnv env a

mplus :: IOEnv env a -> IOEnv env a -> IOEnv env a

MonadCatch (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

catch :: Exception e => IOEnv env a -> (e -> IOEnv env a) -> IOEnv env a

MonadMask (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mask :: ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b

uninterruptibleMask :: ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b

generalBracket :: IOEnv env a -> (a -> ExitCase b -> IOEnv env c) -> (a -> IOEnv env b) -> IOEnv env (b, c)

MonadThrow (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

throwM :: Exception e => e -> IOEnv env a

ContainsHooks env => HasHooks (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getHooks :: IOEnv env Hooks

ContainsDynFlags env => HasDynFlags (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getDynFlags :: IOEnv env DynFlags

ContainsModule env => HasModule (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getModule :: IOEnv env Module

ContainsLogger env => HasLogger (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getLogger :: IOEnv env Logger

writeMutVar :: IORef a -> a -> IOEnv env ()

updMutVarM :: IORef a -> (a -> IOEnv env a) -> IOEnv env ()

updMutVar :: IORef a -> (a -> a) -> IOEnv env ()

updEnv :: (env -> env') -> IOEnv env' a -> IOEnv env a

Perform a computation with an altered environment

unsafeInterleaveM :: IOEnv env a -> IOEnv env a

uninterruptibleMaskM_ :: IOEnv env a -> IOEnv env a

tryMostM :: IOEnv env r -> IOEnv env (Either SomeException r)

tryM :: IOEnv env r -> IOEnv env (Either IOEnvFailure r)

tryAllM :: IOEnv env r -> IOEnv env (Either SomeException r)

setEnv :: env' -> IOEnv env' a -> IOEnv env a

Perform a computation with a different environment

runIOEnv :: env -> IOEnv env a -> IO a

readMutVar :: IORef a -> IOEnv env a

newMutVar :: a -> IOEnv env (IORef a)

getEnv :: IOEnv env env

fixM :: (a -> IOEnv env a) -> IOEnv env a

failWithM :: String -> IOEnv env a

failM :: IOEnv env a

atomicUpdMutVar' :: IORef a -> (a -> (a, b)) -> IOEnv env b

Strict variant of atomicUpdMutVar.

atomicUpdMutVar :: IORef a -> (a -> (a, b)) -> IOEnv env b

Atomically update the reference. Does not force the evaluation of the new variable contents. For strict update, use atomicUpdMutVar'.

data FindResult

The result of searching for an imported module.

NB: FindResult manages both user source-import lookups (which can result in Module) 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 Validity

Constructors

IsValid

Everything is fine

NotValid SDoc

A problem, and some indication of why

withTimingSilent

Arguments

:: MonadIO m

=> Logger

-> DynFlags

DynFlags

-> SDoc

The name of the phase

-> (a -> ())

A function to force the result (often either const () or rnf)

-> m a

The body of the phase to be timed

-> m a

Same as withTiming, but doesn't print timings in the console (when given -vN, N >= 2 or -ddump-timings).

See Note [withTiming] for more.

withTiming

Arguments

:: MonadIO m

=> Logger

-> DynFlags

DynFlags

-> SDoc

The name of the phase

-> (a -> ())

A function to force the result (often either const () or rnf)

-> m a

The body of the phase to be timed

-> m a

Time a compilation phase.

When timings are enabled (e.g. with the -v2 flag), the allocations and CPU time used by the phase will be reported to stderr. Consider a typical usage: withTiming getDynFlags (text "simplify") force PrintTimings pass. When timings are enabled the following costs are included in the produced accounting,

• The cost of executing pass to a result r in WHNF
• The cost of evaluating force r to WHNF (e.g. ())

The choice of the force function depends upon the amount of forcing desired; the goal here is to ensure that the cost of evaluating the result is, to the greatest extent possible, included in the accounting provided by withTiming. Often the pass already sufficiently forces its result during construction; in this case const () is a reasonable choice. In other cases, it is necessary to evaluate the result to normal form, in which case something like Control.DeepSeq.rnf is appropriate.

To avoid adversely affecting compiler performance when timings are not requested, the result is only forced when timings are enabled.

See Note [withTiming] for more.

warningMsg :: Logger -> DynFlags -> SDoc -> IO ()

traceCmd :: Logger -> DynFlags -> String -> String -> IO a -> IO a

sortMsgBag :: Maybe DynFlags -> Bag (MsgEnvelope e) -> [MsgEnvelope e]

showPass :: Logger -> DynFlags -> String -> IO ()

putMsg :: Logger -> DynFlags -> SDoc -> IO ()

printOutputForUser :: Logger -> DynFlags -> PrintUnqualified -> SDoc -> IO ()

printInfoForUser :: Logger -> DynFlags -> PrintUnqualified -> SDoc -> IO ()

prettyPrintGhcErrors :: ExceptionMonad m => DynFlags -> m a -> m a

pprMsgEnvelopeBagWithLoc :: Bag (MsgEnvelope DecoratedSDoc) -> [SDoc]

pprLocMsgEnvelope :: RenderableDiagnostic e => MsgEnvelope e -> SDoc

orValid :: Validity -> Validity -> Validity

logOutput :: Logger -> DynFlags -> SDoc -> IO ()

Like logInfo but with SevOutput rather then SevInfo

logInfo :: Logger -> DynFlags -> SDoc -> IO ()

isValid :: Validity -> Bool

ghcExit :: Logger -> DynFlags -> Int -> IO ()

getInvalids :: [Validity] -> [SDoc]

formatBulleted :: SDocContext -> DecoratedSDoc -> SDoc

Formats the input list of structured document, where each element of the list gets a bullet.

fatalErrorMsg'' :: FatalMessager -> String -> IO ()

fatalErrorMsg :: Logger -> DynFlags -> SDoc -> IO ()

errorMsg :: Logger -> DynFlags -> SDoc -> IO ()

doIfSet_dyn :: DynFlags -> GeneralFlag -> IO () -> IO ()

doIfSet :: Bool -> IO () -> IO ()

debugTraceMsg :: Logger -> DynFlags -> Int -> SDoc -> IO ()

compilationProgressMsg :: Logger -> DynFlags -> SDoc -> IO ()

andValid :: Validity -> Validity -> Validity

allValid :: [Validity] -> Validity

If they aren't all valid, return the first

type TraceAction a = DynFlags -> String -> SDoc -> a -> a

data Logger

type LogAction = DynFlags -> WarnReason -> Severity -> SrcSpan -> SDoc -> IO ()

class HasLogger (m :: Type -> Type) where

Methods

getLogger :: m Logger

Instances

HasLogger Hsc

Defined in GHC.Driver.Env.Types

Methods

getLogger :: Hsc Logger

HasLogger Ghc

Defined in GHC.Driver.Monad

Methods

getLogger :: Ghc Logger

ContainsLogger env => HasLogger (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getLogger :: IOEnv env Logger

MonadIO m => HasLogger (GhcT m)

Defined in GHC.Driver.Monad

Methods

getLogger :: GhcT m Logger

data DumpFormat

Format of a dump

Dump formats are loosely defined: dumps may contain various additional headers and annotations and they may be partial. DumpFormat is mainly a hint (e.g. for syntax highlighters).

Constructors

FormatHaskell

Haskell

FormatCore

Core

FormatSTG

STG

FormatByteCode

ByteCode

FormatCMM

Cmm

FormatASM

Assembly code

FormatC

C code/header

FormatLLVM

LLVM bytecode

FormatText

Unstructured dump

Instances

Show DumpFormat

Defined in GHC.Utils.Logger

Methods

showsPrec :: Int -> DumpFormat -> ShowS

show :: DumpFormat -> String

showList :: [DumpFormat] -> ShowS

Eq DumpFormat

Defined in GHC.Utils.Logger

Methods

(==) :: DumpFormat -> DumpFormat -> Bool

(/=) :: DumpFormat -> DumpFormat -> Bool

type DumpAction = DynFlags -> PprStyle -> DumpFlag -> String -> DumpFormat -> SDoc -> IO ()

class ContainsLogger t where

Methods

extractLogger :: t -> Logger

Instances

ContainsLogger (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractLogger :: Env gbl lcl -> Logger

withDumpFileHandle :: DumpCache -> DynFlags -> DumpFlag -> (Maybe Handle -> IO ()) -> IO ()

Run an action with the handle of a DumpFlag if we are outputting to a file, otherwise Nothing.

touchDumpFile :: Logger -> DynFlags -> DumpFlag -> IO ()

Ensure that a dump file is created even if it stays empty

putTraceMsg :: Logger -> TraceAction a

Trace something

putLogMsg :: Logger -> LogAction

Log something

putDumpMsg :: Logger -> DumpAction

Dump something

pushTraceHook :: (forall a. TraceAction a -> TraceAction a) -> Logger -> Logger

Push a trace hook

pushLogHook :: (LogAction -> LogAction) -> Logger -> Logger

Push a log hook

pushDumpHook :: (DumpAction -> DumpAction) -> Logger -> Logger

Push a dump hook

popTraceHook :: Logger -> Logger

Pop a trace hook

popLogHook :: Logger -> Logger

Pop a log hook

popDumpHook :: Logger -> Logger

Pop a dump hook

makeThreadSafe :: Logger -> IO Logger

Make the logger thread-safe

jsonLogAction :: LogAction

initLogger :: IO Logger

dumpIfSet_dyn_printer :: PrintUnqualified -> Logger -> DynFlags -> DumpFlag -> String -> DumpFormat -> SDoc -> IO ()

A wrapper around putDumpMsg. First check whether the dump flag is set Do nothing if it is unset

Unlike dumpIfSet_dyn, has a printer argument

dumpIfSet_dyn :: Logger -> DynFlags -> DumpFlag -> String -> DumpFormat -> SDoc -> IO ()

A wrapper around dumpAction. First check whether the dump flag is set Do nothing if it is unset

dumpIfSet :: Logger -> DynFlags -> Bool -> String -> SDoc -> IO ()

defaultTraceAction :: TraceAction a

Default action for traceAction hook

defaultLogActionHPutStrDoc :: DynFlags -> Bool -> Handle -> SDoc -> IO ()

The boolean arguments let's the pretty printer know if it can optimize indent by writing ascii ' ' characters without going through decoding.

defaultLogActionHPrintDoc :: DynFlags -> Bool -> Handle -> SDoc -> IO ()

Like defaultLogActionHPutStrDoc but appends an extra newline.

defaultLogAction :: LogAction

defaultDumpAction :: DumpCache -> LogAction -> DumpAction

Default action for dumpAction hook

data GhcMode

The GhcMode tells us whether we're doing multi-module compilation (controlled via the GHC API) or one-shot (single-module) compilation. This makes a difference primarily to the GHC.Unit.Finder: in one-shot mode we look for interface files for imported modules, but in multi-module mode we look for source files in order to check whether they need to be recompiled.

Constructors

CompManager

--make, GHCi, etc.

OneShot

ghc -c Foo.hs

MkDepend

ghc -M, see GHC.Unit.Finder for why we need this

Instances

Outputable GhcMode

Defined in GHC.Driver.Session

Methods

ppr :: GhcMode -> SDoc

Eq GhcMode

Defined in GHC.Driver.Session

Methods

(==) :: GhcMode -> GhcMode -> Bool

(/=) :: GhcMode -> GhcMode -> Bool

data GhcLink

What to do in the link step, if there is one.

Constructors

NoLink

Don't link at all

LinkBinary

Link object code into a binary

LinkInMemory

Use the in-memory dynamic linker (works for both bytecode and object code).

LinkDynLib

Link objects into a dynamic lib (DLL on Windows, DSO on ELF platforms)

LinkStaticLib

Link objects into a static lib

Instances

Show GhcLink

Defined in GHC.Driver.Session

Methods

showsPrec :: Int -> GhcLink -> ShowS

show :: GhcLink -> String

showList :: [GhcLink] -> ShowS

Eq GhcLink

Defined in GHC.Driver.Session

Methods

(==) :: GhcLink -> GhcLink -> Bool

(/=) :: GhcLink -> GhcLink -> Bool

gopt :: GeneralFlag -> DynFlags -> Bool

Test whether a GeneralFlag is set

Note that dynamicNow (i.e., dynamic objects built with `-dynamic-too`) always implicitly enables Opt_PIC, Opt_ExternalDynamicRefs, and disables Opt_SplitSections.

handleSourceError

Arguments

:: MonadCatch m

=> (SourceError -> m a)

exception handler

-> m a

action to perform

-> m a

Perform the given action and call the exception handler if the action throws a SourceError. See SourceError for more information.

type WarningMessages = Bag (MsgEnvelope DecoratedSDoc)

type WarnMsg = MsgEnvelope DecoratedSDoc

data Severity

Constructors

SevOutput

SevFatal

SevInteractive

SevDump

Log message intended for compiler developers No file/line/column stuff

SevInfo

Log messages intended for end users. No file/line/column stuff.

SevWarning

SevError

SevWarning and SevError are used for warnings and errors o The message has a file/line/column heading, plus "warning:" or "error:", added by mkLocMessags o Output is intended for end users

Instances

Show Severity

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> Severity -> ShowS

show :: Severity -> String

showList :: [Severity] -> ShowS

ToJson Severity

Defined in GHC.Types.Error

Methods

json :: Severity -> JsonDoc

Eq Severity

Defined in GHC.Types.Error

Methods

(==) :: Severity -> Severity -> Bool

(/=) :: Severity -> Severity -> Bool

class RenderableDiagnostic a where

A class for types (typically errors and warnings) which can be "rendered" into an opaque DecoratedSDoc. For more information, see Note [Rendering Messages].

Methods

renderDiagnostic :: a -> DecoratedSDoc

Instances

RenderableDiagnostic DecoratedSDoc

Defined in GHC.Types.Error

Methods

renderDiagnostic :: DecoratedSDoc -> DecoratedSDoc

data MsgEnvelope e

An envelope for GHC's facts about a running program, parameterised over the domain-specific (i.e. parsing, typecheck-renaming, etc) diagnostics.

To say things differently, GHC emits diagnostics about the running program, each of which is wrapped into a MsgEnvelope that carries specific information like where the error happened, its severity, etc. Finally, multiple MsgEnvelopes are aggregated into Messages that are returned to the user.

Constructors

MsgEnvelope

Fields

• errMsgSpan :: SrcSpan

  The SrcSpan is used for sorting errors into line-number order

• errMsgContext :: PrintUnqualified
• errMsgDiagnostic :: e
• errMsgSeverity :: Severity
• errMsgReason :: WarnReason

Instances

Functor MsgEnvelope

Defined in GHC.Types.Error

Methods

fmap :: (a -> b) -> MsgEnvelope a -> MsgEnvelope b

(<$) :: a -> MsgEnvelope b -> MsgEnvelope a

Show (MsgEnvelope DecoratedSDoc)

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> MsgEnvelope DecoratedSDoc -> ShowS

show :: MsgEnvelope DecoratedSDoc -> String

showList :: [MsgEnvelope DecoratedSDoc] -> ShowS

data Messages e

A collection of messages emitted by GHC during error reporting. A diagnostic message is typically a warning or an error. See Note [Messages].

Instances

Functor Messages

Defined in GHC.Types.Error

Methods

fmap :: (a -> b) -> Messages a -> Messages b

(<$) :: a -> Messages b -> Messages a

type ErrorMessages = Bag (MsgEnvelope DecoratedSDoc)

data DecoratedSDoc

A DecoratedSDoc is isomorphic to a '[SDoc]' but it carries the invariant that the input '[SDoc]' needs to be rendered decorated into its final form, where the typical case would be adding bullets between each elements of the list. The type of decoration depends on the formatting function used, but in practice GHC uses the formatBulleted.

Instances

RenderableDiagnostic DecoratedSDoc

Defined in GHC.Types.Error

Methods

renderDiagnostic :: DecoratedSDoc -> DecoratedSDoc

Show (MsgEnvelope DecoratedSDoc)

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> MsgEnvelope DecoratedSDoc -> ShowS

show :: MsgEnvelope DecoratedSDoc -> String

showList :: [MsgEnvelope DecoratedSDoc] -> ShowS

unionMessages :: Messages e -> Messages e -> Messages e

Joins two collections of messages together.

pprMessageBag :: Bag SDoc -> SDoc

partitionMessages :: Messages e -> (Bag (MsgEnvelope e), Bag (MsgEnvelope e))

Partitions the Messages and returns a tuple which first element are the warnings, and the second the errors.

mkWarnMsg :: SrcSpan -> PrintUnqualified -> SDoc -> MsgEnvelope DecoratedSDoc

A short (one-line) error message

mkPlainWarnMsg :: SrcSpan -> SDoc -> MsgEnvelope DecoratedSDoc

Variant that doesn't care about qualified/unqualified names

mkPlainMsgEnvelope :: SrcSpan -> SDoc -> MsgEnvelope DecoratedSDoc

Variant that doesn't care about qualified/unqualified names

mkMsgEnvelope :: SrcSpan -> PrintUnqualified -> SDoc -> MsgEnvelope DecoratedSDoc

A short (one-line) error message

mkMessages :: Bag (MsgEnvelope e) -> Messages e

mkLongWarnMsg :: SrcSpan -> PrintUnqualified -> SDoc -> SDoc -> MsgEnvelope DecoratedSDoc

A long (multi-line) error message

mkLongMsgEnvelope :: SrcSpan -> PrintUnqualified -> SDoc -> SDoc -> MsgEnvelope DecoratedSDoc

A long (multi-line) error message

mkLocMessageAnn

Arguments

:: Maybe String

optional annotation

-> Severity

severity

-> SrcSpan

location

-> SDoc

message

-> SDoc

Make a possibly annotated error message with location info.

mkLocMessage :: Severity -> SrcSpan -> SDoc -> SDoc

Make an unannotated error message with location info.

mkErr :: SrcSpan -> PrintUnqualified -> e -> MsgEnvelope e

mkDecorated :: [SDoc] -> DecoratedSDoc

Creates a new DecoratedSDoc out of a list of SDoc.

makeIntoWarning :: WarnReason -> MsgEnvelope e -> MsgEnvelope e

isWarningMessage :: MsgEnvelope e -> Bool

isErrorMessage :: MsgEnvelope e -> Bool

isEmptyMessages :: Messages e -> Bool

getWarningMessages :: Messages e -> Bag (MsgEnvelope e)

getSeverityColour :: Severity -> Scheme -> PprColour

getErrorMessages :: Messages e -> Bag (MsgEnvelope e)

getCaretDiagnostic :: Severity -> SrcSpan -> IO SDoc

errorsFound :: Messages e -> Bool

emptyMessages :: Messages e

addMessage :: MsgEnvelope e -> Messages e -> Messages e

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

Outputable CompleteMatch

Defined in GHC.Types.CompleteMatch

Methods

ppr :: CompleteMatch -> SDoc

data StrictnessMark

Constructors

MarkedStrict

NotMarkedStrict

Instances

Outputable StrictnessMark

Defined in GHC.Core.DataCon

Methods

ppr :: StrictnessMark -> SDoc

data SrcUnpackedness

Source Unpackedness

What unpackedness the user requested

Constructors

SrcUnpack

{-# UNPACK #-} specified

SrcNoUnpack

{-# NOUNPACK #-} specified

NoSrcUnpack

no unpack pragma

Instances

Data SrcUnpackedness

Defined in GHC.Core.DataCon

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

Binary SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcUnpackedness -> IO ()

put :: BinHandle -> SrcUnpackedness -> IO (Bin SrcUnpackedness)

get :: BinHandle -> IO SrcUnpackedness

Outputable SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

Eq SrcUnpackedness

Defined in GHC.Core.DataCon

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

Data SrcStrictness

Defined in GHC.Core.DataCon

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

Binary SrcStrictness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcStrictness -> IO ()

put :: BinHandle -> SrcStrictness -> IO (Bin SrcStrictness)

get :: BinHandle -> IO SrcStrictness

Outputable SrcStrictness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcStrictness -> SDoc

Eq SrcStrictness

Defined in GHC.Core.DataCon

Methods

(==) :: SrcStrictness -> SrcStrictness -> Bool

(/=) :: SrcStrictness -> SrcStrictness -> Bool

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

Data HsSrcBang

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

Defined in GHC.Core.DataCon

Methods

ppr :: HsSrcBang -> SDoc

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

Strict but not unpacked field

HsUnpack (Maybe Coercion)

Strict and unpacked field co :: arg-ty ~ product-ty HsBang

Instances

Data HsImplBang

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

Defined in GHC.Core.DataCon

Methods

ppr :: HsImplBang -> SDoc

isVanillaDataCon :: DataCon -> Bool

Vanilla DataCons are those that are nice boring Haskell 98 constructors

isMarkedStrict :: StrictnessMark -> Bool

dataConWrapperType :: DataCon -> Type

The user-declared type of the data constructor in the nice-to-read form:

T :: forall a b. a -> b -> T [a]

rather than:

T :: forall a c. forall b. (c~[a]) => a -> b -> T c

The type variables are quantified in the order that the user wrote them. See Note [DataCon user type variable binders].

NB: If the constructor is part of a data instance, the result type mentions the family tycon, not the internal one.

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

dataConIsInfix :: DataCon -> Bool

Should the DataCon be presented infix?

data FamInst

Instances

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

Outputable FamInst

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInst -> SDoc

type HoleSet = UniqSet CoercionHole

A set of CoercionHoles

pprTypeApp :: TyCon -> [Type] -> SDoc

pprThetaArrowTy :: ThetaType -> SDoc

pprParendType :: Type -> SDoc

pprForAll :: [TyCoVarBinder] -> SDoc

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.

funResultTy :: Type -> Type

Extract the function result type and panic if that is not possible

alphaTyVars :: [TyVar]

data CoercionHole

A coercion to be filled in by the type-checker. See Note [Coercion holes]

Instances

Data CoercionHole

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

Defined in GHC.Core.TyCo.Rep

Methods

getUnique :: CoercionHole -> Unique

Outputable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: CoercionHole -> SDoc

tyConDataCons :: TyCon -> [DataCon]

As tyConDataCons_maybe, but returns the empty list of constructors if no constructors could be found

tyConClass_maybe :: TyCon -> Maybe Class

If this TyCon is that for a class instance, return the class it is for. Otherwise returns Nothing

synTyConRhs_maybe :: TyCon -> Maybe Type

Extract the information pertaining to the right hand side of a type synonym (type) declaration.

synTyConDefn_maybe :: TyCon -> Maybe ([TyVar], Type)

Extract the TyVars bound by a vanilla type synonym and the corresponding (unsubstituted) right hand side.

isTypeSynonymTyCon :: TyCon -> Bool

Is this a TyCon representing a regular H98 type synonym (type)?

isTypeFamilyTyCon :: TyCon -> Bool

Is this a synonym TyCon that can have may have further instances appear?

isPrimTyCon :: TyCon -> Bool

Does this TyCon represent something that cannot be defined in Haskell?

isOpenTypeFamilyTyCon :: TyCon -> Bool

Is this an open type family TyCon?

isOpenFamilyTyCon :: TyCon -> Bool

Is this a TyCon, synonym or otherwise, that defines a family with instances?

isNewTyCon :: TyCon -> Bool

Is this TyCon that for a newtype

isFamilyTyCon :: TyCon -> Bool

Is this a TyCon, synonym or otherwise, that defines a family?

isClassTyCon :: TyCon -> Bool

Is this TyCon that for a class instance?

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

type DefMethInfo = Maybe (Name, DefMethSpec Type)

type ClassOpItem = (Id, DefMethInfo)

type ClassMinimalDef = BooleanFormula Name

data ClassATItem

Constructors

ATI TyCon (Maybe (Type, ATValidityInfo))

data Class

Instances

Data Class

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

Defined in GHC.Core.Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

Uniquable Class

Defined in GHC.Core.Class

Methods

getUnique :: Class -> Unique

Outputable Class

Defined in GHC.Core.Class

Methods

ppr :: Class -> SDoc

Eq Class

Defined in GHC.Core.Class

Methods

(==) :: Class -> Class -> Bool

(/=) :: Class -> Class -> Bool

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]

pprFundeps :: Outputable a => [FunDep a] -> SDoc

pprFunDep :: Outputable a => FunDep a -> SDoc

pprDefMethInfo :: DefMethInfo -> SDoc

mkClass :: Name -> [TyVar] -> [FunDep TyVar] -> [PredType] -> [Id] -> [ClassATItem] -> [ClassOpItem] -> ClassMinimalDef -> TyCon -> Class

mkAbstractClass :: Name -> [TyVar] -> [FunDep TyVar] -> TyCon -> Class

isAbstractClass :: Class -> Bool

classTvsFds :: Class -> ([TyVar], [FunDep TyVar])

classSCTheta :: Class -> [PredType]

classSCSelIds :: Class -> [Id]

classSCSelId :: Class -> Int -> Id

classOpItems :: Class -> [ClassOpItem]

classMinimalDef :: Class -> ClassMinimalDef

classMethods :: Class -> [Id]

classHasFds :: Class -> Bool

classExtraBigSig :: Class -> ([TyVar], [FunDep TyVar], [PredType], [Id], [ClassATItem], [ClassOpItem])

classBigSig :: Class -> ([TyVar], [PredType], [Id], [ClassOpItem])

classArity :: Class -> Arity

classAllSelIds :: Class -> [Id]

classATs :: Class -> [TyCon]

classATItems :: Class -> [ClassATItem]

data Role

Constructors

Nominal

Representational

Phantom

Instances

Data Role

Defined in GHC.Core.Coercion.Axiom

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

Binary Role

Defined in GHC.Core.Coercion.Axiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Eq Role

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: Role -> Role -> Bool

(/=) :: Role -> Role -> Bool

Ord Role

Defined in GHC.Core.Coercion.Axiom

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)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type LHsDocString = Located HsDocString

Located Haskell Documentation String

data HsDocString

Haskell Documentation String

Internally this is a UTF8-Encoded ByteString.

Instances

Data HsDocString

Defined in GHC.Hs.Doc

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

Defined in GHC.Hs.Doc

Methods

showsPrec :: Int -> HsDocString -> ShowS

show :: HsDocString -> String

showList :: [HsDocString] -> ShowS

Binary HsDocString

Defined in GHC.Hs.Doc

Methods

put_ :: BinHandle -> HsDocString -> IO ()

put :: BinHandle -> HsDocString -> IO (Bin HsDocString)

get :: BinHandle -> IO HsDocString

Outputable HsDocString

Defined in GHC.Hs.Doc

Methods

ppr :: HsDocString -> SDoc

Eq HsDocString

Defined in GHC.Hs.Doc

Methods

(==) :: HsDocString -> HsDocString -> Bool

(/=) :: HsDocString -> HsDocString -> Bool

data ExtractedTHDocs

Maps of docs that were added via Template Haskell's putDoc.

Constructors

ExtractedTHDocs

Fields

• ethd_mod_header :: Maybe HsDocString

  The added module header documentation, if it exists.

• ethd_decl_docs :: DeclDocMap

  The documentation added to declarations.

• ethd_arg_docs :: ArgDocMap

  The documentation added to function arguments.

• ethd_inst_docs :: DeclDocMap

  The documentation added to class and family instances.

newtype DeclDocMap

Docs for declarations: functions, data types, instances, methods etc.

Constructors

DeclDocMap (Map Name HsDocString)

Instances

Binary DeclDocMap

Defined in GHC.Hs.Doc

Methods

put_ :: BinHandle -> DeclDocMap -> IO ()

put :: BinHandle -> DeclDocMap -> IO (Bin DeclDocMap)

get :: BinHandle -> IO DeclDocMap

Outputable DeclDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: DeclDocMap -> SDoc

newtype ArgDocMap

Docs for arguments. E.g. function arguments, method arguments.

Constructors

ArgDocMap (Map Name (IntMap HsDocString))

Instances

Binary ArgDocMap

Defined in GHC.Hs.Doc

Methods

put_ :: BinHandle -> ArgDocMap -> IO ()

put :: BinHandle -> ArgDocMap -> IO (Bin ArgDocMap)

get :: BinHandle -> IO ArgDocMap

Outputable ArgDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: ArgDocMap -> SDoc

unpackHDS :: HsDocString -> String

ppr_mbDoc :: Maybe LHsDocString -> SDoc

mkHsDocStringUtf8ByteString :: ByteString -> HsDocString

Create a HsDocString from a UTF8-encoded ByteString.

mkHsDocString :: String -> HsDocString

isEmptyDocString :: HsDocString -> Bool

hsDocStringToByteString :: HsDocString -> ByteString

Return the contents of a HsDocString as a UTF8-encoded ByteString.

emptyDeclDocMap :: DeclDocMap

emptyArgDocMap :: ArgDocMap

concatDocs :: [HsDocString] -> Maybe HsDocString

Concat docstrings with two newlines in between.

Empty docstrings are skipped.

If all inputs are empty, Nothing is returned.

appendDocs :: HsDocString -> HsDocString -> HsDocString

Join two docstrings.

Non-empty docstrings are joined with two newlines in between, resulting in separate paragraphs.

data TrailingAnn

Captures the location of punctuation occuring between items, normally in a list. It is captured as a trailing annotation.

Constructors

AddSemiAnn EpaLocation

Trailing ';'

AddCommaAnn EpaLocation

Trailing ','

AddVbarAnn EpaLocation

Trailing '|'

AddRarrowAnn EpaLocation

Trailing ->

AddRarrowAnnU EpaLocation

Trailing ->, unicode variant

AddLollyAnnU EpaLocation

Trailing ⊸

Instances

Data TrailingAnn

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TrailingAnn -> c TrailingAnn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TrailingAnn

toConstr :: TrailingAnn -> Constr

dataTypeOf :: TrailingAnn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TrailingAnn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TrailingAnn)

gmapT :: (forall b. Data b => b -> b) -> TrailingAnn -> TrailingAnn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TrailingAnn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TrailingAnn -> r

gmapQ :: (forall d. Data d => d -> u) -> TrailingAnn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TrailingAnn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TrailingAnn -> m TrailingAnn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TrailingAnn -> m TrailingAnn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TrailingAnn -> m TrailingAnn

Outputable TrailingAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: TrailingAnn -> SDoc

Eq TrailingAnn

Defined in GHC.Parser.Annotation

Methods

(==) :: TrailingAnn -> TrailingAnn -> Bool

(/=) :: TrailingAnn -> TrailingAnn -> Bool

Ord TrailingAnn

Defined in GHC.Parser.Annotation

Methods

compare :: TrailingAnn -> TrailingAnn -> Ordering

(<) :: TrailingAnn -> TrailingAnn -> Bool

(<=) :: TrailingAnn -> TrailingAnn -> Bool

(>) :: TrailingAnn -> TrailingAnn -> Bool

(>=) :: TrailingAnn -> TrailingAnn -> Bool

max :: TrailingAnn -> TrailingAnn -> TrailingAnn

min :: TrailingAnn -> TrailingAnn -> TrailingAnn

type SrcSpanAnnP = SrcAnn AnnPragma

type SrcSpanAnnN = SrcAnn NameAnn

type SrcSpanAnnL = SrcAnn AnnList

type SrcSpanAnnC = SrcAnn AnnContext

type SrcSpanAnnA = SrcAnn AnnListItem

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.

Constructors

SrcSpanAnn

Fields

• ann :: !a
• locA :: !SrcSpan

Instances

Data a => Data (SrcSpanAnn' a)

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)

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

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable a => Outputable (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

ppr :: SrcSpanAnn' a -> SDoc

Eq a => Eq (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

(==) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

(/=) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

NamedThing (Located a) => NamedThing (LocatedAn an a)

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)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type SrcAnn ann = SrcSpanAnn' (EpAnn ann)

We mostly use 'SrcSpanAnn'' with an 'EpAnn''

data ParenType

Detail of the "brackets" used in an AnnParen exact print annotation.

Constructors

AnnParens

'(', ')'

AnnParensHash

'(#', '#)'

AnnParensSquare

'[', ']'

Instances

Data ParenType

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ParenType -> c ParenType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ParenType

toConstr :: ParenType -> Constr

dataTypeOf :: ParenType -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ParenType)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ParenType)

gmapT :: (forall b. Data b => b -> b) -> ParenType -> ParenType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ParenType -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ParenType -> r

gmapQ :: (forall d. Data d => d -> u) -> ParenType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ParenType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ParenType -> m ParenType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ParenType -> m ParenType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ParenType -> m ParenType

Eq ParenType

Defined in GHC.Parser.Annotation

Methods

(==) :: ParenType -> ParenType -> Bool

(/=) :: ParenType -> ParenType -> Bool

Ord ParenType

Defined in GHC.Parser.Annotation

Methods

compare :: ParenType -> ParenType -> Ordering

(<) :: ParenType -> ParenType -> Bool

(<=) :: ParenType -> ParenType -> Bool

(>) :: ParenType -> ParenType -> Bool

(>=) :: ParenType -> ParenType -> Bool

max :: ParenType -> ParenType -> ParenType

min :: ParenType -> ParenType -> ParenType

data NoEpAnns

Constructors

NoEpAnns

Instances

Data NoEpAnns

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NoEpAnns -> c NoEpAnns

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NoEpAnns

toConstr :: NoEpAnns -> Constr

dataTypeOf :: NoEpAnns -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NoEpAnns)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NoEpAnns)

gmapT :: (forall b. Data b => b -> b) -> NoEpAnns -> NoEpAnns

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NoEpAnns -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NoEpAnns -> r

gmapQ :: (forall d. Data d => d -> u) -> NoEpAnns -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NoEpAnns -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NoEpAnns -> m NoEpAnns

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NoEpAnns -> m NoEpAnns

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NoEpAnns -> m NoEpAnns

Eq NoEpAnns

Defined in GHC.Parser.Annotation

Methods

(==) :: NoEpAnns -> NoEpAnns -> Bool

(/=) :: NoEpAnns -> NoEpAnns -> Bool

Ord NoEpAnns

Defined in GHC.Parser.Annotation

Methods

compare :: NoEpAnns -> NoEpAnns -> Ordering

(<) :: NoEpAnns -> NoEpAnns -> Bool

(<=) :: NoEpAnns -> NoEpAnns -> Bool

(>) :: NoEpAnns -> NoEpAnns -> Bool

(>=) :: NoEpAnns -> NoEpAnns -> Bool

max :: NoEpAnns -> NoEpAnns -> NoEpAnns

min :: NoEpAnns -> NoEpAnns -> NoEpAnns

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]

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

Data NameAnn

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

Defined in GHC.Parser.Annotation

Methods

mempty :: NameAnn

mappend :: NameAnn -> NameAnn -> NameAnn

mconcat :: [NameAnn] -> NameAnn

Semigroup NameAnn

Defined in GHC.Parser.Annotation

Methods

(<>) :: NameAnn -> NameAnn -> NameAnn

sconcat :: NonEmpty NameAnn -> NameAnn

stimes :: Integral b => b -> NameAnn -> NameAnn

Outputable NameAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAnn -> SDoc

Eq NameAnn

Defined in GHC.Parser.Annotation

Methods

(==) :: NameAnn -> NameAnn -> Bool

(/=) :: NameAnn -> NameAnn -> Bool

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

data NameAdornment

A NameAnn can capture the locations of surrounding adornments, such as parens or backquotes. This data type identifies what particular pair are being used.

Constructors

NameParens

'(' ')'

NameParensHash

'(#' '#)'

NameBackquotes

'`'

NameSquare

'[' ']'

Instances

Data NameAdornment

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NameAdornment -> c NameAdornment

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NameAdornment

toConstr :: NameAdornment -> Constr

dataTypeOf :: NameAdornment -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NameAdornment)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NameAdornment)

gmapT :: (forall b. Data b => b -> b) -> NameAdornment -> NameAdornment

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NameAdornment -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NameAdornment -> r

gmapQ :: (forall d. Data d => d -> u) -> NameAdornment -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NameAdornment -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NameAdornment -> m NameAdornment

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAdornment -> m NameAdornment

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAdornment -> m NameAdornment

Outputable NameAdornment

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAdornment -> SDoc

Eq NameAdornment

Defined in GHC.Parser.Annotation

Methods

(==) :: NameAdornment -> NameAdornment -> Bool

(/=) :: NameAdornment -> NameAdornment -> Bool

Ord NameAdornment

Defined in GHC.Parser.Annotation

Methods

compare :: NameAdornment -> NameAdornment -> Ordering

(<) :: NameAdornment -> NameAdornment -> Bool

(<=) :: NameAdornment -> NameAdornment -> Bool

(>) :: NameAdornment -> NameAdornment -> Bool

(>=) :: NameAdornment -> NameAdornment -> Bool

max :: NameAdornment -> NameAdornment -> NameAdornment

min :: NameAdornment -> NameAdornment -> NameAdornment

type LocatedP = GenLocated SrcSpanAnnP

type LocatedN = GenLocated SrcSpanAnnN

type LocatedL = GenLocated SrcSpanAnnL

type LocatedC = GenLocated SrcSpanAnnC

type LocatedAn an = GenLocated (SrcAnn an)

General representation of a GenLocated type carrying a parameterised annotation type.

type LocatedA = GenLocated SrcSpanAnnA

type LEpaComment = GenLocated Anchor EpaComment

data IsUnicodeSyntax

Certain tokens can have alternate representations when unicode syntax is enabled. This flag is attached to those tokens in the lexer so that the original source representation can be reproduced in the corresponding EpAnnotation

Constructors

UnicodeSyntax

NormalSyntax

Instances

Data IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsUnicodeSyntax -> c IsUnicodeSyntax

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsUnicodeSyntax

toConstr :: IsUnicodeSyntax -> Constr

dataTypeOf :: IsUnicodeSyntax -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsUnicodeSyntax)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsUnicodeSyntax)

gmapT :: (forall b. Data b => b -> b) -> IsUnicodeSyntax -> IsUnicodeSyntax

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsUnicodeSyntax -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsUnicodeSyntax -> r

gmapQ :: (forall d. Data d => d -> u) -> IsUnicodeSyntax -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IsUnicodeSyntax -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsUnicodeSyntax -> m IsUnicodeSyntax

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsUnicodeSyntax -> m IsUnicodeSyntax

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsUnicodeSyntax -> m IsUnicodeSyntax

Show IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> IsUnicodeSyntax -> ShowS

show :: IsUnicodeSyntax -> String

showList :: [IsUnicodeSyntax] -> ShowS

Outputable IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

ppr :: IsUnicodeSyntax -> SDoc

Eq IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

(==) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

(/=) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

Ord IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

compare :: IsUnicodeSyntax -> IsUnicodeSyntax -> Ordering

(<) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

(<=) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

(>) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

(>=) :: IsUnicodeSyntax -> IsUnicodeSyntax -> Bool

max :: IsUnicodeSyntax -> IsUnicodeSyntax -> IsUnicodeSyntax

min :: IsUnicodeSyntax -> IsUnicodeSyntax -> IsUnicodeSyntax

data HasE

Some template haskell tokens have two variants, one with an e the other not:

 [| or [e|
 [|| or [e||

This type indicates whether the e is present or not.

Constructors

HasE

NoE

Instances

Data HasE

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HasE -> c HasE

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HasE

toConstr :: HasE -> Constr

dataTypeOf :: HasE -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HasE)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HasE)

gmapT :: (forall b. Data b => b -> b) -> HasE -> HasE

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HasE -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HasE -> r

gmapQ :: (forall d. Data d => d -> u) -> HasE -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HasE -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HasE -> m HasE

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HasE -> m HasE

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HasE -> m HasE

Show HasE

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> HasE -> ShowS

show :: HasE -> String

showList :: [HasE] -> ShowS

Eq HasE

Defined in GHC.Parser.Annotation

Methods

(==) :: HasE -> HasE -> Bool

(/=) :: HasE -> HasE -> Bool

Ord HasE

Defined in GHC.Parser.Annotation

Methods

compare :: HasE -> HasE -> Ordering

(<) :: HasE -> HasE -> Bool

(<=) :: HasE -> HasE -> Bool

(>) :: HasE -> HasE -> Bool

(>=) :: HasE -> HasE -> Bool

max :: HasE -> HasE -> HasE

min :: HasE -> HasE -> HasE

data EpaLocation

The anchor for an AnnKeywordId. The Parser inserts the EpaSpan variant, giving the exact location of the original item in the parsed source. This can be replaced by the EpaDelta version, to provide a position for the item relative to the end of the previous item in the source. This is useful when editing an AST prior to exact printing the changed one. The list of comments in the EpaDelta variant captures any comments between the prior output and the thing being marked here, since we cannot otherwise sort the relative order.

Constructors

EpaSpan !RealSrcSpan

EpaDelta !DeltaPos ![LEpaComment]

Instances

Data EpaLocation

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpaLocation -> c EpaLocation

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpaLocation

toConstr :: EpaLocation -> Constr

dataTypeOf :: EpaLocation -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EpaLocation)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EpaLocation)

gmapT :: (forall b. Data b => b -> b) -> EpaLocation -> EpaLocation

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpaLocation -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpaLocation -> r

gmapQ :: (forall d. Data d => d -> u) -> EpaLocation -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpaLocation -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpaLocation -> m EpaLocation

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaLocation -> m EpaLocation

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaLocation -> m EpaLocation

Outputable EpaLocation

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaLocation -> SDoc

Eq EpaLocation

Defined in GHC.Parser.Annotation

Methods

(==) :: EpaLocation -> EpaLocation -> Bool

(/=) :: EpaLocation -> EpaLocation -> Bool

Ord EpaLocation

Defined in GHC.Parser.Annotation

Methods

compare :: EpaLocation -> EpaLocation -> Ordering

(<) :: EpaLocation -> EpaLocation -> Bool

(<=) :: EpaLocation -> EpaLocation -> Bool

(>) :: EpaLocation -> EpaLocation -> Bool

(>=) :: EpaLocation -> EpaLocation -> Bool

max :: EpaLocation -> EpaLocation -> EpaLocation

min :: EpaLocation -> EpaLocation -> EpaLocation

data EpaCommentTok

Constructors

EpaDocCommentNext String

something beginning '-- |'

EpaDocCommentPrev String

something beginning '-- ^'

EpaDocCommentNamed String

something beginning '-- $'

EpaDocSection Int String

a section heading

EpaDocOptions String

doc options (prune, ignore-exports, etc)

EpaLineComment String

comment starting by "--"

EpaBlockComment String

comment in {- -}

EpaEofComment

empty comment, capturing location of EOF

Instances

Data EpaCommentTok

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpaCommentTok -> c EpaCommentTok

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpaCommentTok

toConstr :: EpaCommentTok -> Constr

dataTypeOf :: EpaCommentTok -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EpaCommentTok)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EpaCommentTok)

gmapT :: (forall b. Data b => b -> b) -> EpaCommentTok -> EpaCommentTok

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpaCommentTok -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpaCommentTok -> r

gmapQ :: (forall d. Data d => d -> u) -> EpaCommentTok -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpaCommentTok -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpaCommentTok -> m EpaCommentTok

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaCommentTok -> m EpaCommentTok

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaCommentTok -> m EpaCommentTok

Show EpaCommentTok

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> EpaCommentTok -> ShowS

show :: EpaCommentTok -> String

showList :: [EpaCommentTok] -> ShowS

Eq EpaCommentTok

Defined in GHC.Parser.Annotation

Methods

(==) :: EpaCommentTok -> EpaCommentTok -> Bool

(/=) :: EpaCommentTok -> EpaCommentTok -> Bool

Ord EpaCommentTok

Defined in GHC.Parser.Annotation

Methods

compare :: EpaCommentTok -> EpaCommentTok -> Ordering

(<) :: EpaCommentTok -> EpaCommentTok -> Bool

(<=) :: EpaCommentTok -> EpaCommentTok -> Bool

(>) :: EpaCommentTok -> EpaCommentTok -> Bool

(>=) :: EpaCommentTok -> EpaCommentTok -> Bool

max :: EpaCommentTok -> EpaCommentTok -> EpaCommentTok

min :: EpaCommentTok -> EpaCommentTok -> EpaCommentTok

data EpaComment

Constructors

EpaComment

Fields

• ac_tok :: EpaCommentTok
• ac_prior_tok :: RealSrcSpan

  The location of the prior token, used in exact printing. The EpaComment appears as an LEpaComment containing its location. The difference between the end of the prior token and the start of this location is used for the spacing when exact printing the comment.

Instances

Data EpaComment

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpaComment -> c EpaComment

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpaComment

toConstr :: EpaComment -> Constr

dataTypeOf :: EpaComment -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EpaComment)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EpaComment)

gmapT :: (forall b. Data b => b -> b) -> EpaComment -> EpaComment

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpaComment -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpaComment -> r

gmapQ :: (forall d. Data d => d -> u) -> EpaComment -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpaComment -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpaComment -> m EpaComment

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaComment -> m EpaComment

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpaComment -> m EpaComment

Show EpaComment

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> EpaComment -> ShowS

show :: EpaComment -> String

showList :: [EpaComment] -> ShowS

Outputable EpaComment

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaComment -> SDoc

Eq EpaComment

Defined in GHC.Parser.Annotation

Methods

(==) :: EpaComment -> EpaComment -> Bool

(/=) :: EpaComment -> EpaComment -> Bool

Ord EpaComment

Defined in GHC.Parser.Annotation

Methods

compare :: EpaComment -> EpaComment -> Ordering

(<) :: EpaComment -> EpaComment -> Bool

(<=) :: EpaComment -> EpaComment -> Bool

(>) :: EpaComment -> EpaComment -> Bool

(>=) :: EpaComment -> EpaComment -> Bool

max :: EpaComment -> EpaComment -> EpaComment

min :: EpaComment -> EpaComment -> EpaComment

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

data EpAnnComments

When we are parsing we add comments that belong a particular AST element, and print them together with the element, interleaving them into the output stream. But when editing the AST to move fragments around it is useful to be able to first separate the comments into those occuring before the AST element and those following it. The EpaCommentsBalanced constructor is used to do this. The GHC parser will only insert the EpaComments form.

Constructors

EpaComments

Fields

• priorComments :: ![LEpaComment]

EpaCommentsBalanced

Fields

• priorComments :: ![LEpaComment]
• followingComments :: ![LEpaComment]

Instances

Data EpAnnComments

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnnComments -> c EpAnnComments

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EpAnnComments

toConstr :: EpAnnComments -> Constr

dataTypeOf :: EpAnnComments -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EpAnnComments)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EpAnnComments)

gmapT :: (forall b. Data b => b -> b) -> EpAnnComments -> EpAnnComments

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnComments -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnnComments -> r

gmapQ :: (forall d. Data d => d -> u) -> EpAnnComments -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnnComments -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnnComments -> m EpAnnComments

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnComments -> m EpAnnComments

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnnComments -> m EpAnnComments

Semigroup EpAnnComments

Defined in GHC.Parser.Annotation

Methods

(<>) :: EpAnnComments -> EpAnnComments -> EpAnnComments

sconcat :: NonEmpty EpAnnComments -> EpAnnComments

stimes :: Integral b => b -> EpAnnComments -> EpAnnComments

Outputable EpAnnComments

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnnComments -> SDoc

Eq EpAnnComments

Defined in GHC.Parser.Annotation

Methods

(==) :: EpAnnComments -> EpAnnComments -> Bool

(/=) :: EpAnnComments -> EpAnnComments -> Bool

type EpAnnCO

Arguments

 = EpAnn NoEpAnns

Api Annotations for comments only

data EpAnn ann

The exact print annotations (EPAs) are kept in the HsSyn AST for the GhcPs phase. We do not always have EPAs though, only for code that has been parsed as they do not exist for generated code. This type captures that they may be missing.

A goal of the annotations is that an AST can be edited, including moving subtrees from one place to another, duplicating them, and so on. This means that each fragment must be self-contained. To this end, each annotated fragment keeps track of the anchor position it was originally captured at, being simply the start span of the topmost element of the ast fragment. This gives us a way to later re-calculate all Located items in this layer of the AST, as well as any annotations captured. The comments associated with the AST fragment are also captured here.

The ann type parameter allows this general structure to be specialised to the specific set of locations of original exact print annotation elements. So for HsLet we have

type instance XLet GhcPs = EpAnn AnnsLet data AnnsLet = AnnsLet { alLet :: EpaLocation, alIn :: EpaLocation } deriving Data

The spacing between the items under the scope of a given EpAnn is normally derived from the original Anchor. But if a sub-element is not in its original position, the required spacing can be directly captured in the anchor_op field of the entry Anchor. This allows us to freely move elements around, and stitch together new AST fragments out of old ones, and have them still printed out in a precise way.

Constructors

EpAnn

Fields

• entry :: !Anchor

  Base location for the start of the syntactic element holding the annotations.

• anns :: !ann

  Annotations added by the Parser

• comments :: !EpAnnComments

  Comments enclosed in the SrcSpan of the element this EpAnn is attached to

EpAnnNotUsed

No Annotation for generated code, e.g. from TH, deriving, etc.

Instances

Functor EpAnn

Defined in GHC.Parser.Annotation

Methods

fmap :: (a -> b) -> EpAnn a -> EpAnn b

(<$) :: a -> EpAnn b -> EpAnn a

Data ann => Data (EpAnn ann)

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EpAnn ann -> c (EpAnn ann)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (EpAnn ann)

toConstr :: EpAnn ann -> Constr

dataTypeOf :: EpAnn ann -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (EpAnn ann))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (EpAnn ann))

gmapT :: (forall b. Data b => b -> b) -> EpAnn ann -> EpAnn ann

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EpAnn ann -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EpAnn ann -> r

gmapQ :: (forall d. Data d => d -> u) -> EpAnn ann -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EpAnn ann -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EpAnn ann -> m (EpAnn ann)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnn ann -> m (EpAnn ann)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EpAnn ann -> m (EpAnn ann)

Monoid a => Monoid (EpAnn a)

Defined in GHC.Parser.Annotation

Methods

mempty :: EpAnn a

mappend :: EpAnn a -> EpAnn a -> EpAnn a

mconcat :: [EpAnn a] -> EpAnn a

Semigroup a => Semigroup (EpAnn a)

Defined in GHC.Parser.Annotation

Methods

(<>) :: EpAnn a -> EpAnn a -> EpAnn a

sconcat :: NonEmpty (EpAnn a) -> EpAnn a

stimes :: Integral b => b -> EpAnn a -> EpAnn a

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable a => Outputable (EpAnn a)

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnn a -> SDoc

Eq ann => Eq (EpAnn ann)

Defined in GHC.Parser.Annotation

Methods

(==) :: EpAnn ann -> EpAnn ann -> Bool

(/=) :: EpAnn ann -> EpAnn ann -> Bool

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data DeltaPos

Spacing between output items when exact printing. It captures the spacing from the current print position on the page to the position required for the thing about to be printed. This is either on the same line in which case is is simply the number of spaces to emit, or it is some number of lines down, with a given column offset. The exact printing algorithm keeps track of the column offset pertaining to the current anchor position, so the deltaColumn is the additional spaces to add in this case. See https://gitlab.haskell.org/ghc/ghc/wikis/api-annotations for details.

Constructors

SameLine

Fields

• deltaColumn :: !Int

DifferentLine

Fields

• deltaLine :: !Int

  deltaLine should always be > 0

• deltaColumn :: !Int

Instances

Data DeltaPos

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DeltaPos -> c DeltaPos

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DeltaPos

toConstr :: DeltaPos -> Constr

dataTypeOf :: DeltaPos -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DeltaPos)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DeltaPos)

gmapT :: (forall b. Data b => b -> b) -> DeltaPos -> DeltaPos

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DeltaPos -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DeltaPos -> r

gmapQ :: (forall d. Data d => d -> u) -> DeltaPos -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DeltaPos -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DeltaPos -> m DeltaPos

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DeltaPos -> m DeltaPos

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DeltaPos -> m DeltaPos

Show DeltaPos

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> DeltaPos -> ShowS

show :: DeltaPos -> String

showList :: [DeltaPos] -> ShowS

Outputable DeltaPos

Defined in GHC.Parser.Annotation

Methods

ppr :: DeltaPos -> SDoc

Eq DeltaPos

Defined in GHC.Parser.Annotation

Methods

(==) :: DeltaPos -> DeltaPos -> Bool

(/=) :: DeltaPos -> DeltaPos -> Bool

Ord DeltaPos

Defined in GHC.Parser.Annotation

Methods

compare :: DeltaPos -> DeltaPos -> Ordering

(<) :: DeltaPos -> DeltaPos -> Bool

(<=) :: DeltaPos -> DeltaPos -> Bool

(>) :: DeltaPos -> DeltaPos -> Bool

(>=) :: DeltaPos -> DeltaPos -> Bool

max :: DeltaPos -> DeltaPos -> DeltaPos

min :: DeltaPos -> DeltaPos -> DeltaPos

data AnnSortKey

Captures the sort order of sub elements. This is needed when the sub-elements have been split (as in a HsLocalBind which holds separate binds and sigs) or for infix patterns where the order has been re-arranged. It is captured explicitly so that after the Delta phase a SrcSpan is used purely as an index into the annotations, allowing transformations of the AST including the introduction of new Located items or re-arranging existing ones.

Constructors

NoAnnSortKey

AnnSortKey [RealSrcSpan]

Instances

Data AnnSortKey

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnSortKey -> c AnnSortKey

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnSortKey

toConstr :: AnnSortKey -> Constr

dataTypeOf :: AnnSortKey -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnSortKey)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnSortKey)

gmapT :: (forall b. Data b => b -> b) -> AnnSortKey -> AnnSortKey

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnSortKey -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnSortKey -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnSortKey -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnSortKey -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnSortKey -> m AnnSortKey

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnSortKey -> m AnnSortKey

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnSortKey -> m AnnSortKey

Monoid AnnSortKey

Defined in GHC.Parser.Annotation

Methods

mempty :: AnnSortKey

mappend :: AnnSortKey -> AnnSortKey -> AnnSortKey

mconcat :: [AnnSortKey] -> AnnSortKey

Semigroup AnnSortKey

Defined in GHC.Parser.Annotation

Methods

(<>) :: AnnSortKey -> AnnSortKey -> AnnSortKey

sconcat :: NonEmpty AnnSortKey -> AnnSortKey

stimes :: Integral b => b -> AnnSortKey -> AnnSortKey

Outputable AnnSortKey

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnSortKey -> SDoc

Eq AnnSortKey

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnSortKey -> AnnSortKey -> Bool

(/=) :: AnnSortKey -> AnnSortKey -> Bool

data AnnPragma

exact print annotation used for capturing the locations of annotations in pragmas.

Constructors

AnnPragma

Fields

• apr_open :: AddEpAnn
• apr_close :: AddEpAnn
• apr_rest :: [AddEpAnn]

Instances

Data AnnPragma

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnPragma -> c AnnPragma

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnPragma

toConstr :: AnnPragma -> Constr

dataTypeOf :: AnnPragma -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnPragma)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnPragma)

gmapT :: (forall b. Data b => b -> b) -> AnnPragma -> AnnPragma

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnPragma -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnPragma -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnPragma -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnPragma -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnPragma -> m AnnPragma

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnPragma -> m AnnPragma

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnPragma -> m AnnPragma

Outputable AnnPragma

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnPragma -> SDoc

Eq AnnPragma

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnPragma -> AnnPragma -> Bool

(/=) :: AnnPragma -> AnnPragma -> Bool

data AnnParen

exact print annotation for an item having surrounding "brackets", such as tuples or lists

Constructors

AnnParen

Fields

• ap_adornment :: ParenType
• ap_open :: EpaLocation
• ap_close :: EpaLocation

Instances

Data AnnParen

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnParen -> c AnnParen

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnParen

toConstr :: AnnParen -> Constr

dataTypeOf :: AnnParen -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnParen)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnParen)

gmapT :: (forall b. Data b => b -> b) -> AnnParen -> AnnParen

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnParen -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnParen -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnParen -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnParen -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnParen -> m AnnParen

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnParen -> m AnnParen

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnParen -> m AnnParen

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

Data AnnListItem

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

Defined in GHC.Parser.Annotation

Methods

mempty :: AnnListItem

mappend :: AnnListItem -> AnnListItem -> AnnListItem

mconcat :: [AnnListItem] -> AnnListItem

Semigroup AnnListItem

Defined in GHC.Parser.Annotation

Methods

(<>) :: AnnListItem -> AnnListItem -> AnnListItem

sconcat :: NonEmpty AnnListItem -> AnnListItem

stimes :: Integral b => b -> AnnListItem -> AnnListItem

Outputable AnnListItem

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnListItem -> SDoc

Eq AnnListItem

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnListItem -> AnnListItem -> Bool

(/=) :: AnnListItem -> AnnListItem -> Bool

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data AnnList

Annotation for the "container" of a list. This captures surrounding items such as braces if present, and introductory keywords such as 'where'.

Constructors

AnnList

Fields

• al_anchor :: Maybe Anchor

  start point of a list having layout

• al_open :: Maybe AddEpAnn
• al_close :: Maybe AddEpAnn
• al_rest :: [AddEpAnn]

  context, such as 'where' keyword

• al_trailing :: [TrailingAnn]

  items appearing after the list, such as '=>' for a context

Instances

Data AnnList

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnList -> c AnnList

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnList

toConstr :: AnnList -> Constr

dataTypeOf :: AnnList -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnList)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnList)

gmapT :: (forall b. Data b => b -> b) -> AnnList -> AnnList

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnList -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnList -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnList -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnList -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnList -> m AnnList

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnList -> m AnnList

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnList -> m AnnList

Monoid AnnList

Defined in GHC.Parser.Annotation

Methods

mempty :: AnnList

mappend :: AnnList -> AnnList -> AnnList

mconcat :: [AnnList] -> AnnList

Semigroup AnnList

Defined in GHC.Parser.Annotation

Methods

(<>) :: AnnList -> AnnList -> AnnList

sconcat :: NonEmpty AnnList -> AnnList

stimes :: Integral b => b -> AnnList -> AnnList

Outputable AnnList

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnList -> SDoc

Eq AnnList

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnList -> AnnList -> Bool

(/=) :: AnnList -> AnnList -> Bool

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

data AnnKeywordId

Exact print annotations exist so that tools can perform source to source conversions of Haskell code. They are used to keep track of the various syntactic keywords that are not otherwise captured in the AST.

The wiki page describing this feature is https://gitlab.haskell.org/ghc/ghc/wikis/api-annotations https://gitlab.haskell.org/ghc/ghc/-/wikis/implementing-trees-that-grow/in-tree-api-annotations

Note: in general the names of these are taken from the corresponding token, unless otherwise noted See note [exact print annotations] above for details of the usage

Constructors

AnnAnyclass

AnnAs

AnnAt

AnnBang

!

AnnBackquote

'`'

AnnBy

AnnCase

case or lambda case

AnnClass

AnnClose

'#)' or '#-}' etc

AnnCloseB

'|)'

AnnCloseBU

'|)', unicode variant

AnnCloseC

'}'

AnnCloseQ

'|]'

AnnCloseQU

'|]', unicode variant

AnnCloseP

')'

AnnClosePH

'#)'

AnnCloseS

']'

AnnColon

AnnComma

as a list separator

AnnCommaTuple

in a RdrName for a tuple

AnnDarrow

'=>'

AnnDarrowU

'=>', unicode variant

AnnData

AnnDcolon

'::'

AnnDcolonU

'::', unicode variant

AnnDefault

AnnDeriving

AnnDo

AnnDot

.

AnnDotdot

'..'

AnnElse

AnnEqual

AnnExport

AnnFamily

AnnForall

AnnForallU

Unicode variant

AnnForeign

AnnFunId

for function name in matches where there are multiple equations for the function.

AnnGroup

AnnHeader

for CType

AnnHiding

AnnIf

AnnImport

AnnIn

AnnInfix

'infix' or 'infixl' or 'infixr'

AnnInstance

AnnLam

AnnLarrow

'<-'

AnnLarrowU

'<-', unicode variant

AnnLet

AnnLollyU

The ⊸ unicode arrow

AnnMdo

AnnMinus

-

AnnModule

AnnNewtype

AnnName

where a name loses its location in the AST, this carries it

AnnOf

AnnOpen

'{-# DEPRECATED' etc. Opening of pragmas where the capitalisation of the string can be changed by the user. The actual text used is stored in a SourceText on the relevant pragma item.

AnnOpenB

'(|'

AnnOpenBU

'(|', unicode variant

AnnOpenC

'{'

AnnOpenE

'[e|' or '[e||'

AnnOpenEQ

'[|'

AnnOpenEQU

'[|', unicode variant

AnnOpenP

'('

AnnOpenS

'['

AnnOpenPH

'(#'

AnnDollar

prefix $ -- TemplateHaskell

AnnDollarDollar

prefix $$ -- TemplateHaskell

AnnPackageName

AnnPattern

AnnPercent

% -- for HsExplicitMult

AnnPercentOne

'%1' -- for HsLinearArrow

AnnProc

AnnQualified

AnnRarrow

->

AnnRarrowU

->, unicode variant

AnnRec

AnnRole

AnnSafe

AnnSemi

';'

AnnSimpleQuote

'''

AnnSignature

AnnStatic

static

AnnStock

AnnThen

AnnThTyQuote

double '''

AnnTilde

~

AnnType

AnnUnit

() for types

AnnUsing

AnnVal

e.g. INTEGER

AnnValStr

String value, will need quotes when output

AnnVbar

'|'

AnnVia

via

AnnWhere

Annlarrowtail

-<

AnnlarrowtailU

-<, unicode variant

Annrarrowtail

->

AnnrarrowtailU

->, unicode variant

AnnLarrowtail

-<<

AnnLarrowtailU

-<<, unicode variant

AnnRarrowtail

>>-

AnnRarrowtailU

>>-, unicode variant

Instances

Data AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnKeywordId -> c AnnKeywordId

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnKeywordId

toConstr :: AnnKeywordId -> Constr

dataTypeOf :: AnnKeywordId -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnKeywordId)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnKeywordId)

gmapT :: (forall b. Data b => b -> b) -> AnnKeywordId -> AnnKeywordId

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnKeywordId -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnKeywordId -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnKeywordId -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnKeywordId -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnKeywordId -> m AnnKeywordId

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnKeywordId -> m AnnKeywordId

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnKeywordId -> m AnnKeywordId

Show AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> AnnKeywordId -> ShowS

show :: AnnKeywordId -> String

showList :: [AnnKeywordId] -> ShowS

Outputable AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnKeywordId -> SDoc

Eq AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnKeywordId -> AnnKeywordId -> Bool

(/=) :: AnnKeywordId -> AnnKeywordId -> Bool

Ord AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

compare :: AnnKeywordId -> AnnKeywordId -> Ordering

(<) :: AnnKeywordId -> AnnKeywordId -> Bool

(<=) :: AnnKeywordId -> AnnKeywordId -> Bool

(>) :: AnnKeywordId -> AnnKeywordId -> Bool

(>=) :: AnnKeywordId -> AnnKeywordId -> Bool

max :: AnnKeywordId -> AnnKeywordId -> AnnKeywordId

min :: AnnKeywordId -> AnnKeywordId -> AnnKeywordId

data AnnContext

Exact print annotation for the Context data type.

Constructors

AnnContext

Fields

• ac_darrow :: Maybe (IsUnicodeSyntax, EpaLocation)

  location and encoding of the '=>', if present.

• ac_open :: [EpaLocation]

  zero or more opening parentheses.

• ac_close :: [EpaLocation]

  zero or more closing parentheses.

Instances

Data AnnContext

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnContext -> c AnnContext

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnContext

toConstr :: AnnContext -> Constr

dataTypeOf :: AnnContext -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnContext)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnContext)

gmapT :: (forall b. Data b => b -> b) -> AnnContext -> AnnContext

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnContext -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnContext -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnContext -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnContext -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnContext -> m AnnContext

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnContext -> m AnnContext

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnContext -> m AnnContext

Outputable AnnContext

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnContext -> SDoc

data AnchorOperation

If tools modify the parsed source, the MovedAnchor variant can directly provide the spacing for this item relative to the previous one when printing. This allows AST fragments with a particular anchor to be freely moved, without worrying about recalculating the appropriate anchor span.

Constructors

UnchangedAnchor

MovedAnchor DeltaPos

Instances

Data AnchorOperation

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnchorOperation -> c AnchorOperation

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnchorOperation

toConstr :: AnchorOperation -> Constr

dataTypeOf :: AnchorOperation -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnchorOperation)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnchorOperation)

gmapT :: (forall b. Data b => b -> b) -> AnchorOperation -> AnchorOperation

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnchorOperation -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnchorOperation -> r

gmapQ :: (forall d. Data d => d -> u) -> AnchorOperation -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnchorOperation -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnchorOperation -> m AnchorOperation

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnchorOperation -> m AnchorOperation

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnchorOperation -> m AnchorOperation

Show AnchorOperation

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> AnchorOperation -> ShowS

show :: AnchorOperation -> String

showList :: [AnchorOperation] -> ShowS

Outputable AnchorOperation

Defined in GHC.Parser.Annotation

Methods

ppr :: AnchorOperation -> SDoc

Eq AnchorOperation

Defined in GHC.Parser.Annotation

Methods

(==) :: AnchorOperation -> AnchorOperation -> Bool

(/=) :: AnchorOperation -> AnchorOperation -> Bool

data Anchor

An Anchor records the base location for the start of the syntactic element holding the annotations, and is used as the point of reference for calculating delta positions for contained annotations. It is also normally used as the reference point for the spacing of the element relative to its container. If it is moved, that relationship is tracked in the anchor_op instead.

Constructors

Anchor

Fields

• anchor :: RealSrcSpan

  Base location for the start of the syntactic element holding the annotations.

• anchor_op :: AnchorOperation

Instances

Data Anchor

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Anchor -> c Anchor

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Anchor

toConstr :: Anchor -> Constr

dataTypeOf :: Anchor -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Anchor)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Anchor)

gmapT :: (forall b. Data b => b -> b) -> Anchor -> Anchor

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Anchor -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Anchor -> r

gmapQ :: (forall d. Data d => d -> u) -> Anchor -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Anchor -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Anchor -> m Anchor

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Anchor -> m Anchor

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Anchor -> m Anchor

Semigroup Anchor

Defined in GHC.Parser.Annotation

Methods

(<>) :: Anchor -> Anchor -> Anchor

sconcat :: NonEmpty Anchor -> Anchor

stimes :: Integral b => b -> Anchor -> Anchor

Show Anchor

Defined in GHC.Parser.Annotation

Methods

showsPrec :: Int -> Anchor -> ShowS

show :: Anchor -> String

showList :: [Anchor] -> ShowS

Outputable Anchor

Defined in GHC.Parser.Annotation

Methods

ppr :: Anchor -> SDoc

Eq Anchor

Defined in GHC.Parser.Annotation

Methods

(==) :: Anchor -> Anchor -> Bool

(/=) :: Anchor -> Anchor -> Bool

Ord Anchor

Defined in GHC.Parser.Annotation

Methods

compare :: Anchor -> Anchor -> Ordering

(<) :: Anchor -> Anchor -> Bool

(<=) :: Anchor -> Anchor -> Bool

(>) :: Anchor -> Anchor -> Bool

(>=) :: Anchor -> Anchor -> Bool

max :: Anchor -> Anchor -> Anchor

min :: Anchor -> Anchor -> Anchor

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

data AddEpAnn

Captures an annotation, storing the AnnKeywordId and its location. The parser only ever inserts EpaLocation fields with a RealSrcSpan being the original location of the annotation in the source file. The EpaLocation can also store a delta position if the AST has been modified and needs to be pretty printed again. The usual way an AddEpAnn is created is using the mj ("make jump") function, and then it can be inserted into the appropriate annotation.

Constructors

AddEpAnn AnnKeywordId EpaLocation

Instances

Data AddEpAnn

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AddEpAnn -> c AddEpAnn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AddEpAnn

toConstr :: AddEpAnn -> Constr

dataTypeOf :: AddEpAnn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AddEpAnn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AddEpAnn)

gmapT :: (forall b. Data b => b -> b) -> AddEpAnn -> AddEpAnn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AddEpAnn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AddEpAnn -> r

gmapQ :: (forall d. Data d => d -> u) -> AddEpAnn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AddEpAnn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AddEpAnn -> m AddEpAnn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AddEpAnn -> m AddEpAnn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AddEpAnn -> m AddEpAnn

Outputable AddEpAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: AddEpAnn -> SDoc

Eq AddEpAnn

Defined in GHC.Parser.Annotation

Methods

(==) :: AddEpAnn -> AddEpAnn -> Bool

(/=) :: AddEpAnn -> AddEpAnn -> Bool

Ord AddEpAnn

Defined in GHC.Parser.Annotation

Methods

compare :: AddEpAnn -> AddEpAnn -> Ordering

(<) :: AddEpAnn -> AddEpAnn -> Bool

(<=) :: AddEpAnn -> AddEpAnn -> Bool

(>) :: AddEpAnn -> AddEpAnn -> Bool

(>=) :: AddEpAnn -> AddEpAnn -> Bool

max :: AddEpAnn -> AddEpAnn -> AddEpAnn

min :: AddEpAnn -> AddEpAnn -> AddEpAnn

widenSpan :: SrcSpan -> [AddEpAnn] -> SrcSpan

The annotations need to all come after the anchor. Make sure this is the case.

widenLocatedAn :: SrcSpanAnn' an -> [AddEpAnn] -> SrcSpanAnn' an

widenAnchorR :: Anchor -> RealSrcSpan -> Anchor

widenAnchor :: Anchor -> [AddEpAnn] -> Anchor

unicodeAnn :: AnnKeywordId -> AnnKeywordId

Convert a normal annotation into its unicode equivalent one

transferAnnsA :: SrcSpanAnnA -> SrcSpanAnnA -> (SrcSpanAnnA, SrcSpanAnnA)

Transfer comments and trailing items from the annotations in the first SrcSpanAnnA argument to those in the second.

spanAsAnchor :: SrcSpan -> Anchor

sortLocatedA :: [GenLocated (SrcSpanAnn' a) e] -> [GenLocated (SrcSpanAnn' a) e]

setPriorComments :: EpAnnComments -> [LEpaComment] -> EpAnnComments

setFollowingComments :: EpAnnComments -> [LEpaComment] -> EpAnnComments

setCommentsSrcAnn :: Monoid ann => SrcAnn ann -> EpAnnComments -> SrcAnn ann

Replace any existing comments on a SrcAnn, used for manipulating the AST prior to exact printing the changed one.

setCommentsEpAnn :: Monoid a => SrcSpan -> EpAnn a -> EpAnnComments -> EpAnn a

Replace any existing comments, used for manipulating the AST prior to exact printing the changed one.

removeCommentsA :: SrcAnn ann -> SrcAnn ann

Remove the comments, leaving the exact print annotations payload

realSrcSpan :: SrcSpan -> RealSrcSpan

realSpanAsAnchor :: RealSrcSpan -> Anchor

reLocN :: LocatedN a -> Located a

reLocL :: LocatedN e -> LocatedA e

reLocC :: LocatedN e -> LocatedC e

reLocA :: Located e -> LocatedAn ann e

reLoc :: LocatedAn a e -> Located e

reAnnL :: ann -> EpAnnComments -> Located e -> GenLocated (SrcAnn ann) e

reAnnC :: AnnContext -> EpAnnComments -> Located a -> LocatedC a

reAnn :: [TrailingAnn] -> EpAnnComments -> Located a -> LocatedA a

placeholderRealSpan :: RealSrcSpan

parenTypeKws :: ParenType -> (AnnKeywordId, AnnKeywordId)

Maps the ParenType to the related opening and closing AnnKeywordId. Used when actually printing the item.

noSrcSpanA :: SrcAnn ann

noLocA :: a -> LocatedAn an a

noComments :: EpAnnCO

noAnnSrcSpan :: SrcSpan -> SrcAnn ann

noAnn :: EpAnn a

Short form for EpAnnNotUsed

na2la :: SrcSpanAnn' a -> SrcAnn ann

Helper function (temporary) during transition of names Discards any annotations

n2l :: LocatedN a -> LocatedA a

mapLocA :: (a -> b) -> GenLocated SrcSpan a -> GenLocated (SrcAnn ann) b

la2r :: SrcSpanAnn' a -> RealSrcSpan

la2na :: SrcSpanAnn' a -> SrcSpanAnnN

Helper function (temporary) during transition of names Discards any annotations

la2la :: LocatedAn ann1 a2 -> LocatedAn ann2 a2

Helper function (temporary) during transition of names Discards any annotations

l2n :: LocatedAn a1 a2 -> LocatedN a2

Helper function (temporary) during transition of names Discards any annotations

l2l :: SrcSpanAnn' a -> SrcAnn ann

getLocAnn :: Located a -> SrcSpanAnnA

getLocA :: GenLocated (SrcSpanAnn' a) e -> SrcSpan

getFollowingComments :: EpAnnComments -> [LEpaComment]

getDeltaLine :: DeltaPos -> Int

extraToAnnList :: AnnList -> [AddEpAnn] -> AnnList

epaLocationRealSrcSpan :: EpaLocation -> RealSrcSpan

Used in the parser only, extract the SrcSpan from an EpaLocation. The parser will never insert a DeltaPos, so the partial function is safe.

epaLocationFromSrcAnn :: SrcAnn ann -> EpaLocation

epAnnComments :: EpAnn an -> EpAnnComments

epAnnAnnsL :: EpAnn a -> [a]

epAnnAnns :: EpAnn [AddEpAnn] -> [AddEpAnn]

emptyComments :: EpAnnComments

deltaPos :: Int -> Int -> DeltaPos

Smart constructor for a DeltaPos. It preserves the invariant that for the DifferentLine constructor deltaLine is always > 0.

commentsOnlyA :: Monoid ann => SrcAnn ann -> SrcAnn ann

Remove the exact print annotations payload, leaving only the anchor and comments.

comment :: RealSrcSpan -> EpAnnComments -> EpAnnCO

combineSrcSpansA :: Semigroup a => SrcAnn a -> SrcAnn a -> SrcAnn a

combineLocsA :: Semigroup a => GenLocated (SrcAnn a) e1 -> GenLocated (SrcAnn a) e2 -> SrcAnn a

annParen2AddEpAnn :: EpAnn AnnParen -> [AddEpAnn]

addTrailingCommaToN :: SrcSpan -> EpAnn NameAnn -> EpaLocation -> EpAnn NameAnn

Helper function used in the parser to add a comma location to an existing annotation.

addTrailingAnnToL :: SrcSpan -> TrailingAnn -> EpAnnComments -> EpAnn AnnList -> EpAnn AnnList

Helper function used in the parser to add a TrailingAnn items to an existing annotation.

addTrailingAnnToA :: SrcSpan -> TrailingAnn -> EpAnnComments -> EpAnn AnnListItem -> EpAnn AnnListItem

Helper function used in the parser to add a TrailingAnn items to an existing annotation.

addCommentsToSrcAnn :: Monoid ann => SrcAnn ann -> EpAnnComments -> SrcAnn ann

Add additional comments to a SrcAnn, used for manipulating the AST prior to exact printing the changed one.

addCommentsToEpAnn :: Monoid a => SrcSpan -> EpAnn a -> EpAnnComments -> EpAnn a

Add additional comments, used for manipulating the AST prior to exact printing the changed one.

addCLocAA :: GenLocated (SrcSpanAnn' a1) e1 -> GenLocated (SrcSpanAnn' a2) e2 -> e3 -> GenLocated (SrcAnn ann) e3

addCLocA :: GenLocated (SrcSpanAnn' a) e1 -> GenLocated SrcSpan e2 -> e3 -> GenLocated (SrcAnn ann) e3

Combine locations from two Located things and add them to a third thing

addAnnsA :: SrcSpanAnnA -> [TrailingAnn] -> EpAnnComments -> SrcSpanAnnA

addAnns :: EpAnn [AddEpAnn] -> [AddEpAnn] -> EpAnnComments -> EpAnn [AddEpAnn]

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

Instances

Data RdrName

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

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

Defined in GHC.Types.Name.Reader

Methods

occName :: RdrName -> OccName

Outputable RdrName

Defined in GHC.Types.Name.Reader

Methods

ppr :: RdrName -> SDoc

OutputableBndr RdrName

Defined in GHC.Types.Name.Reader

Methods

pprBndr :: BindingSite -> RdrName -> SDoc

pprPrefixOcc :: RdrName -> SDoc

pprInfixOcc :: RdrName -> SDoc

bndrIsJoin_maybe :: RdrName -> Maybe Int

Eq RdrName

Defined in GHC.Types.Name.Reader

Methods

(==) :: RdrName -> RdrName -> Bool

(/=) :: RdrName -> RdrName -> Bool

Ord RdrName

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

Defined in GHC.Hs.Extension

type Anno RdrName = SrcSpanAnnN

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

nameSrcSpan :: Name -> SrcSpan

nameModule :: HasDebugCallStack => Name -> Module

isExternalName :: Name -> Bool

type TidyOccEnv = UniqFM FastString Int

type OccSet = UniqSet OccName

data OccEnv a

Instances

Data a => Data (OccEnv a)

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)

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccEnv a -> SDoc

data NameSpace

Instances

Binary NameSpace

Defined in GHC.Types.Name.Occurrence

Methods

put_ :: BinHandle -> NameSpace -> IO ()

put :: BinHandle -> NameSpace -> IO (Bin NameSpace)

get :: BinHandle -> IO NameSpace

Eq NameSpace

Defined in GHC.Types.Name.Occurrence

Methods

(==) :: NameSpace -> NameSpace -> Bool

(/=) :: NameSpace -> NameSpace -> Bool

Ord NameSpace

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

varName :: NameSpace

unitOccSet :: OccName -> OccSet

unitOccEnv :: OccName -> a -> OccEnv a

unionOccSets :: OccSet -> OccSet -> OccSet

unionManyOccSets :: [OccSet] -> OccSet

tvName :: NameSpace

tidyOccName :: TidyOccEnv -> OccName -> (TidyOccEnv, OccName)

tcName :: NameSpace

tcClsName :: NameSpace

startsWithUnderscore :: OccName -> Bool

Haskell 98 encourages compilers to suppress warnings about unused names in a pattern if they start with _: this implements that test

srcDataName :: NameSpace

setOccNameSpace :: NameSpace -> OccName -> OccName

promoteOccName :: OccName -> Maybe OccName

pprOccName :: OccName -> SDoc

pprOccEnv :: (a -> SDoc) -> OccEnv a -> SDoc

pprNonVarNameSpace :: NameSpace -> SDoc

pprNameSpaceBrief :: NameSpace -> SDoc

pprNameSpace :: NameSpace -> SDoc

plusOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccEnv a -> OccEnv a

plusOccEnv :: OccEnv a -> OccEnv a -> OccEnv a

parenSymOcc :: OccName -> SDoc -> SDoc

Wrap parens around an operator

occEnvElts :: OccEnv a -> [a]

nameSpacesRelated :: NameSpace -> NameSpace -> Bool

mkWorkerOcc :: OccName -> OccName

mkVarOcc :: String -> OccName

mkTyVarOccFS :: FastString -> OccName

mkTyVarOcc :: String -> OccName

mkTyConRepOcc :: OccName -> OccName

mkTcOccFS :: FastString -> OccName

mkTcOcc :: String -> OccName

mkTag2ConOcc :: OccName -> OccName

mkSuperDictSelOcc

Arguments

:: Int

Index of superclass, e.g. 3

-> OccName

Class, e.g. Ord

-> OccName

Derived Occname, e.g. $p3Ord

mkSuperDictAuxOcc :: Int -> OccName -> OccName

mkSpecOcc :: OccName -> OccName

mkRepEqOcc :: OccName -> OccName

mkOccSet :: [OccName] -> OccSet

mkOccNameFS :: NameSpace -> FastString -> OccName

mkOccName :: NameSpace -> String -> OccName

mkOccEnv_C :: (a -> a -> a) -> [(OccName, a)] -> OccEnv a

mkOccEnv :: [(OccName, a)] -> OccEnv a

mkNewTyCoOcc :: OccName -> OccName

mkMethodOcc :: OccName -> OccName

mkMaxTagOcc :: OccName -> OccName

mkMatcherOcc :: OccName -> OccName

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.

mkInstTyCoOcc :: OccName -> OccName

mkIPOcc :: OccName -> OccName

mkGenR :: OccName -> OccName

mkGen1R :: OccName -> OccName

mkForeignExportOcc :: OccName -> OccName

mkEqPredCoOcc :: OccName -> OccName

mkDictOcc :: OccName -> OccName

mkDefaultMethodOcc :: OccName -> OccName

mkDataTOcc :: OccName -> OccName

mkDataOccFS :: FastString -> OccName

mkDataOcc :: String -> OccName

mkDataConWrapperOcc :: OccName -> OccName

mkDataConWorkerOcc :: OccName -> OccName

mkDataCOcc :: OccName -> OccName

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

mkCon2TagOcc :: OccName -> OccName

mkClsOccFS :: FastString -> OccName

mkClsOcc :: String -> OccName

mkClassOpAuxOcc :: OccName -> OccName

mkClassDataConOcc :: OccName -> OccName

mkBuilderOcc :: OccName -> OccName

minusOccSet :: OccSet -> OccSet -> OccSet

mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b

lookupOccEnv :: OccEnv a -> OccName -> Maybe a

isVarOcc :: OccName -> Bool

isVarNameSpace :: NameSpace -> Bool

isValOcc :: OccName -> Bool

Value OccNamess are those that are either in the variable or data constructor namespaces

isValNameSpace :: NameSpace -> 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.

isTvOcc :: OccName -> Bool

isTvNameSpace :: NameSpace -> Bool

isTcOcc :: OccName -> Bool

isTcClsNameSpace :: NameSpace -> Bool

isSymOcc :: OccName -> Bool

Test if the OccName is that for any operator (whether it is a data constructor or variable or whatever)

isEmptyOccSet :: OccSet -> Bool

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

isDataSymOcc :: OccName -> Bool

Test if the OccName is a data constructor that starts with a symbol (e.g. :, or [])

isDataOcc :: OccName -> Bool

isDataConNameSpace :: NameSpace -> Bool

intersectOccSet :: OccSet -> OccSet -> OccSet

initTidyOccEnv :: [OccName] -> TidyOccEnv

foldOccEnv :: (a -> b -> b) -> b -> OccEnv a -> b

filterOccSet :: (OccName -> Bool) -> OccSet -> OccSet

filterOccEnv :: (elt -> Bool) -> OccEnv elt -> OccEnv elt

extendOccSetList :: OccSet -> [OccName] -> OccSet

extendOccSet :: OccSet -> OccName -> OccSet

extendOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccName -> a -> OccEnv a

extendOccEnv_Acc :: (a -> b -> b) -> (a -> b) -> OccEnv b -> OccName -> a -> OccEnv b

extendOccEnvList :: OccEnv a -> [(OccName, a)] -> OccEnv a

extendOccEnv :: OccEnv a -> OccName -> a -> OccEnv a

emptyTidyOccEnv :: TidyOccEnv

emptyOccSet :: OccSet

emptyOccEnv :: OccEnv a

elemOccSet :: OccName -> OccSet -> Bool

elemOccEnv :: OccName -> OccEnv a -> Bool

demoteOccName :: OccName -> Maybe OccName

delTidyOccEnvList :: TidyOccEnv -> [FastString] -> TidyOccEnv

delListFromOccEnv :: OccEnv a -> [OccName] -> OccEnv a

delFromOccEnv :: OccEnv a -> OccName -> OccEnv a

dataName :: NameSpace

clsName :: NameSpace

avoidClashesOccEnv :: TidyOccEnv -> [OccName] -> TidyOccEnv

alterOccEnv :: (Maybe elt -> Maybe elt) -> OccEnv elt -> OccName -> OccEnv elt

isLocalId :: Var -> Bool

isGlobalId :: Var -> Bool

isExportedId :: Var -> Bool

isExportedIdVar means "don't throw this away"

data DataCon

A data constructor

• AnnKeywordId : AnnOpen, AnnClose,AnnComma

Instances

Data DataCon

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

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

Uniquable DataCon

Defined in GHC.Core.DataCon

Methods

getUnique :: DataCon -> Unique

Outputable DataCon

Defined in GHC.Core.DataCon

Methods

ppr :: DataCon -> SDoc

OutputableBndr DataCon

Defined in GHC.Core.DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

Eq DataCon

Defined in GHC.Core.DataCon

Methods

(==) :: DataCon -> DataCon -> Bool

(/=) :: DataCon -> DataCon -> Bool

dataConTyCon :: DataCon -> TyCon

The type constructor that we are building via this data constructor

dataConFieldLabels :: DataCon -> [FieldLabel]

The labels for the fields of this particular DataCon

data Type

Instances

Data Type

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

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

type ThetaType = [PredType]

A collection of PredTypes

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.

type Kind = Type

The key type representing kinds in the compiler.

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

NamedThing TyThing

Defined in GHC.Types.TyThing

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

Outputable TyThing

Defined in GHC.Types.TyThing

Methods

ppr :: TyThing -> SDoc

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.

Instances

Data TyCon

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

Defined in GHC.Core.TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

Uniquable TyCon

Defined in GHC.Core.TyCon

Methods

getUnique :: TyCon -> Unique

Outputable TyCon

Defined in GHC.Core.TyCon

Methods

ppr :: TyCon -> SDoc

Eq TyCon

Defined in GHC.Core.TyCon

Methods

(==) :: TyCon -> TyCon -> Bool

(/=) :: TyCon -> TyCon -> Bool

isFunTyCon :: TyCon -> Bool

data Bag a

Instances

Foldable Bag

Defined in GHC.Data.Bag

Methods

fold :: Monoid m => Bag m -> m

foldMap :: Monoid m => (a -> m) -> Bag a -> m

foldMap' :: Monoid m => (a -> m) -> Bag a -> m

foldr :: (a -> b -> b) -> b -> Bag a -> b

foldr' :: (a -> b -> b) -> b -> Bag a -> b

foldl :: (b -> a -> b) -> b -> Bag a -> b

foldl' :: (b -> a -> b) -> b -> Bag a -> b

foldr1 :: (a -> a -> a) -> Bag a -> a

foldl1 :: (a -> a -> a) -> Bag a -> a

toList :: Bag a -> [a]

null :: Bag a -> Bool

length :: Bag a -> Int

elem :: Eq a => a -> Bag a -> Bool

maximum :: Ord a => Bag a -> a

minimum :: Ord a => Bag a -> a

sum :: Num a => Bag a -> a

product :: Num a => Bag a -> a

Traversable Bag

Defined in GHC.Data.Bag

Methods

traverse :: Applicative f => (a -> f b) -> Bag a -> f (Bag b)

sequenceA :: Applicative f => Bag (f a) -> f (Bag a)

mapM :: Monad m => (a -> m b) -> Bag a -> m (Bag b)

sequence :: Monad m => Bag (m a) -> m (Bag a)

Functor Bag

Defined in GHC.Data.Bag

Methods

fmap :: (a -> b) -> Bag a -> Bag b

(<$) :: a -> Bag b -> Bag a

Data a => Data (Bag a)

Defined in GHC.Data.Bag

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bag a -> c (Bag a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bag a)

toConstr :: Bag a -> Constr

dataTypeOf :: Bag a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bag a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bag a))

gmapT :: (forall b. Data b => b -> b) -> Bag a -> Bag a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r

gmapQ :: (forall d. Data d => d -> u) -> Bag a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Bag a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a)

IsList (Bag a)

Defined in GHC.Data.Bag

Associated Types

type Item (Bag a)

Methods

fromList :: [Item (Bag a)] -> Bag a

fromListN :: Int -> [Item (Bag a)] -> Bag a

toList :: Bag a -> [Item (Bag a)]

Outputable a => Outputable (Bag a)

Defined in GHC.Data.Bag

Methods

ppr :: Bag a -> SDoc

type Item (Bag a)

Defined in GHC.Data.Bag

type Item (Bag a) = a

unitBag :: a -> Bag a

unionManyBags :: [Bag a] -> Bag a

unionBags :: Bag a -> Bag a -> Bag a

snocBag :: Bag a -> a -> Bag a infixl 3

partitionBagWith :: (a -> Either b c) -> Bag a -> (Bag b, Bag c)

partitionBag :: (a -> Bool) -> Bag a -> (Bag a, Bag a)

nonEmptyToBag :: NonEmpty a -> Bag a

mapMaybeBag :: (a -> Maybe b) -> Bag a -> Bag b

mapBagM_ :: Monad m => (a -> m b) -> Bag a -> m ()

mapBagM :: Monad m => (a -> m b) -> Bag a -> m (Bag b)

mapBag :: (a -> b) -> Bag a -> Bag b

mapAndUnzipBagM :: Monad m => (a -> m (b, c)) -> Bag a -> m (Bag b, Bag c)

mapAccumBagLM

Arguments

:: Monad m

=> (acc -> x -> m (acc, y))

combining function

-> acc

initial state

-> Bag x

inputs

-> m (acc, Bag y)

final state, outputs

mapAccumBagL

Arguments

:: (acc -> x -> (acc, y))

combining function

-> acc

initial state

-> Bag x

inputs

-> (acc, Bag y)

final state, outputs

listToBag :: [a] -> Bag a

lengthBag :: Bag a -> Int

isSingletonBag :: Bag a -> Bool

isEmptyBag :: Bag a -> Bool

foldBag :: (r -> r -> r) -> (a -> r) -> r -> Bag a -> r

flatMapBagPairM :: Monad m => (a -> m (Bag b, Bag c)) -> Bag a -> m (Bag b, Bag c)

flatMapBagM :: Monad m => (a -> m (Bag b)) -> Bag a -> m (Bag b)

filterBagM :: Monad m => (a -> m Bool) -> Bag a -> m (Bag a)

filterBag :: (a -> Bool) -> Bag a -> Bag a

emptyBag :: Bag a

elemBag :: Eq a => a -> Bag a -> Bool

consBag :: a -> Bag a -> Bag a infixr 3

concatMapBagPair :: (a -> (Bag b, Bag c)) -> Bag a -> (Bag b, Bag c)

concatMapBag :: (a -> Bag b) -> Bag a -> Bag b

concatBag :: Bag (Bag a) -> Bag a

catBagMaybes :: Bag (Maybe a) -> Bag a

bagToList :: Bag a -> [a]

anyBagM :: Monad m => (a -> m Bool) -> Bag a -> m Bool

anyBag :: (a -> Bool) -> Bag a -> Bool

allBag :: (a -> Bool) -> Bag a -> Bool

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

Outputable TargetId

Defined in GHC.Types.Target

Methods

ppr :: TargetId -> SDoc

Eq TargetId

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

Constructors

Target

Fields

• targetId :: !TargetId

  module or filename

• targetAllowObjCode :: !Bool

  object code allowed?

• 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

Outputable Target

Defined in GHC.Types.Target

Methods

ppr :: Target -> SDoc

data GeneralFlag

Enumerates the simple on-or-off dynamic flags

Constructors

Opt_DumpToFile

Append dump output to files instead of stdout.

Opt_D_faststring_stats

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_WarnIsError

Opt_ShowWarnGroups

Opt_HideSourcePaths

Opt_PrintExplicitForalls

Opt_PrintExplicitKinds

Opt_PrintExplicitCoercions

Opt_PrintExplicitRuntimeReps

Opt_PrintEqualityRelations

Opt_PrintAxiomIncomps

Opt_PrintUnicodeSyntax

Opt_PrintExpandedSynonyms

Opt_PrintPotentialInstances

Opt_PrintTypecheckerElaboration

Opt_CallArity

Opt_Exitification

Opt_Strictness

Opt_LateDmdAnal

Opt_KillAbsence

Opt_KillOneShot

Opt_FullLaziness

Opt_FloatIn

Opt_LateSpecialise

Opt_Specialise

Opt_SpecialiseAggressively

Opt_CrossModuleSpecialise

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_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_SolveConstantDicts

Opt_AlignmentSanitisation

Opt_CatchBottoms

Opt_NumConstantFolding

Opt_SimplPreInlining

Opt_IgnoreInterfacePragmas

Opt_OmitInterfacePragmas

Opt_ExposeAllUnfoldings

Opt_WriteInterface

Opt_WriteHie

Opt_AutoSccsOnIndividualCafs

Opt_ProfCountEntries

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_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_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_SuppressVarKinds

Opt_SuppressModulePrefixes

Opt_SuppressTypeApplications

Opt_SuppressIdInfo

Opt_SuppressUnfoldings

Opt_SuppressTypeSignatures

Opt_SuppressUniques

Opt_SuppressStgExts

Opt_SuppressTicks

Opt_SuppressTimestamps

Suppress timestamps in dumps

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_DistrustAllPackages

Opt_PackageTrust

Opt_PluginTrustworthy

Opt_G_NoStateHack

Opt_G_NoOptCoercion

Instances

Enum GeneralFlag

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

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> GeneralFlag -> ShowS

show :: GeneralFlag -> String

showList :: [GeneralFlag] -> ShowS

Eq GeneralFlag

Defined in GHC.Driver.Flags

Methods

(==) :: GeneralFlag -> GeneralFlag -> Bool

(/=) :: GeneralFlag -> GeneralFlag -> Bool

data Phase

Instances

Show Phase

Defined in GHC.Driver.Phases

Methods

showsPrec :: Int -> Phase -> ShowS

show :: Phase -> String

showList :: [Phase] -> ShowS

Outputable Phase

Defined in GHC.Driver.Phases

Methods

ppr :: Phase -> SDoc

Eq Phase

Defined in GHC.Driver.Phases

Methods

(==) :: Phase -> Phase -> Bool

(/=) :: Phase -> Phase -> Bool

data SuccessFlag

Constructors

Succeeded

Failed

Instances

Outputable SuccessFlag

Defined in GHC.Types.Basic

Methods

ppr :: SuccessFlag -> SDoc

data SpliceExplicitFlag

Constructors

ExplicitSplice

= $(f x y)

ImplicitSplice

= f x y, i.e. a naked top level expression

Instances

Data SpliceExplicitFlag

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpliceExplicitFlag -> c SpliceExplicitFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SpliceExplicitFlag

toConstr :: SpliceExplicitFlag -> Constr

dataTypeOf :: SpliceExplicitFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SpliceExplicitFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SpliceExplicitFlag)

gmapT :: (forall b. Data b => b -> b) -> SpliceExplicitFlag -> SpliceExplicitFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> SpliceExplicitFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SpliceExplicitFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

data LeftOrRight

Constructors

CLeft

CRight

Instances

Data LeftOrRight

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

Defined in GHC.Types.Basic

Methods

put_ :: BinHandle -> LeftOrRight -> IO ()

put :: BinHandle -> LeftOrRight -> IO (Bin LeftOrRight)

get :: BinHandle -> IO LeftOrRight

Outputable LeftOrRight

Defined in GHC.Types.Basic

Methods

ppr :: LeftOrRight -> SDoc

Eq LeftOrRight

Defined in GHC.Types.Basic

Methods

(==) :: LeftOrRight -> LeftOrRight -> Bool

(/=) :: LeftOrRight -> LeftOrRight -> Bool

succeeded :: SuccessFlag -> Bool

pickLR :: LeftOrRight -> (a, a) -> a

failed :: SuccessFlag -> Bool

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

Data LexicalFixity

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

Defined in GHC.Types.Fixity

Methods

ppr :: LexicalFixity -> SDoc

Eq LexicalFixity

Defined in GHC.Types.Fixity

Methods

(==) :: LexicalFixity -> LexicalFixity -> Bool

(/=) :: LexicalFixity -> LexicalFixity -> Bool

data FixityDirection

Constructors

InfixL

InfixR

InfixN

Instances

Data FixityDirection

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FixityDirection -> c FixityDirection

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FixityDirection

toConstr :: FixityDirection -> Constr

dataTypeOf :: FixityDirection -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FixityDirection)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FixityDirection)

gmapT :: (forall b. Data b => b -> b) -> FixityDirection -> FixityDirection

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FixityDirection -> r

gmapQ :: (forall d. Data d => d -> u) -> FixityDirection -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FixityDirection -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FixityDirection -> m FixityDirection

Binary FixityDirection

Defined in GHC.Types.Fixity

Methods

put_ :: BinHandle -> FixityDirection -> IO ()

put :: BinHandle -> FixityDirection -> IO (Bin FixityDirection)

get :: BinHandle -> IO FixityDirection

Outputable FixityDirection

Defined in GHC.Types.Fixity

Methods

ppr :: FixityDirection -> SDoc

Eq FixityDirection

Defined in GHC.Types.Fixity

Methods

(==) :: FixityDirection -> FixityDirection -> Bool

(/=) :: FixityDirection -> FixityDirection -> Bool

data Fixity

Instances

Data Fixity

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

Defined in GHC.Types.Fixity

Methods

put_ :: BinHandle -> Fixity -> IO ()

put :: BinHandle -> Fixity -> IO (Bin Fixity)

get :: BinHandle -> IO Fixity

Outputable Fixity

Defined in GHC.Types.Fixity

Methods

ppr :: Fixity -> SDoc

Eq Fixity

Defined in GHC.Types.Fixity

Methods

(==) :: Fixity -> Fixity -> Bool

(/=) :: Fixity -> Fixity -> Bool

negateFixity :: Fixity

maxPrecedence :: Int

defaultFixity :: Fixity

compareFixity :: Fixity -> Fixity -> (Bool, Bool)

type TyVar = Var

Type or kind Variable

type Id = Var

Identifier

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

Show SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

showsPrec :: Int -> SafeHaskellMode -> ShowS

show :: SafeHaskellMode -> String

showList :: [SafeHaskellMode] -> ShowS

Outputable SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

ppr :: SafeHaskellMode -> SDoc

Eq SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

(==) :: SafeHaskellMode -> SafeHaskellMode -> Bool

(/=) :: SafeHaskellMode -> SafeHaskellMode -> Bool

data ModLocation

Module Location

Where a module lives on the file system: the actual locations of the .hs, .hi and .o 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.

Constructors

ModLocation

Fields

• ml_hs_file :: Maybe FilePath

  The source file, if we have one. Package modules probably don't have source files.

• ml_hi_file :: FilePath

  Where the .hi file is, whether or not it exists yet. Always of form foo.hi, even if there is an hi-boot file (we add the -boot suffix later)

• ml_obj_file :: FilePath

  Where the .o file is, whether or not it exists yet. (might not exist either because the module hasn't been compiled yet, or because it is part of a unit with a .a file)

• ml_hie_file :: FilePath

  Where the .hie file is, whether or not it exists yet.

Instances

Show ModLocation

Defined in GHC.Unit.Module.Location

Methods

showsPrec :: Int -> ModLocation -> ShowS

show :: ModLocation -> String

showList :: [ModLocation] -> ShowS

Outputable ModLocation

Defined in GHC.Unit.Module.Location

Methods

ppr :: ModLocation -> SDoc

mkModule :: u -> ModuleName -> GenModule u

moduleNameString :: ModuleName -> String

mkModuleName :: String -> ModuleName

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

NamedThing Class

Defined in GHC.Core.Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

NamedThing ConLike

Defined in GHC.Core.ConLike

Methods

getOccName :: ConLike -> OccName

getName :: ConLike -> Name

NamedThing DataCon

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

NamedThing ClsInst

Defined in GHC.Core.InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

NamedThing PatSyn

Defined in GHC.Core.PatSyn

Methods

getOccName :: PatSyn -> OccName

getName :: PatSyn -> Name

NamedThing TyCon

Defined in GHC.Core.TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

NamedThing IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceClassOp -> OccName

getName :: IfaceClassOp -> Name

NamedThing IfaceConDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceConDecl -> OccName

getName :: IfaceConDecl -> Name

NamedThing IfaceDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceDecl -> OccName

getName :: IfaceDecl -> Name

NamedThing HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

getOccName :: HoleFitCandidate -> OccName

getName :: HoleFitCandidate -> Name

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

NamedThing TyThing

Defined in GHC.Types.TyThing

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

NamedThing (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getOccName :: CoAxiom br -> OccName

getName :: CoAxiom br -> Name

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

NamedThing tv => NamedThing (VarBndr tv flag)

Defined in GHC.Types.Var

Methods

getOccName :: VarBndr tv flag -> OccName

getName :: VarBndr tv flag -> Name

data Name

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

Instances

Data Name

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

Defined in GHC.Types.Name

Methods

rnf :: Name -> ()

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

HasOccName Name

Defined in GHC.Types.Name

Methods

occName :: Name -> OccName

Uniquable Name

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 Names. See UserData for the rationale for this distinction.

Defined in GHC.Types.Name

Methods

put_ :: BinHandle -> Name -> IO ()

put :: BinHandle -> Name -> IO (Bin Name)

get :: BinHandle -> IO Name

Outputable Name

Defined in GHC.Types.Name

Methods

ppr :: Name -> SDoc

OutputableBndr Name

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.

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.

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

type Anno Name

Defined in GHC.Hs.Extension

type Anno Name = SrcSpanAnnN

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

data UnhelpfulSpanReason

Constructors

UnhelpfulNoLocationInfo

UnhelpfulWiredIn

UnhelpfulInteractive

UnhelpfulGenerated

UnhelpfulOther !FastString

Instances

Show UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> UnhelpfulSpanReason -> ShowS

show :: UnhelpfulSpanReason -> String

showList :: [UnhelpfulSpanReason] -> ShowS

Outputable UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

ppr :: UnhelpfulSpanReason -> SDoc

Eq UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

(==) :: UnhelpfulSpanReason -> UnhelpfulSpanReason -> Bool

(/=) :: UnhelpfulSpanReason -> UnhelpfulSpanReason -> Bool

data SrcSpan

Source Span

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

Constructors

RealSrcSpan !RealSrcSpan !(Maybe BufSpan)

UnhelpfulSpan !UnhelpfulSpanReason

Instances

Data SrcSpan

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

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcSpan -> ShowS

show :: SrcSpan -> String

showList :: [SrcSpan] -> ShowS

NFData SrcSpan

Defined in GHC.Types.SrcLoc

Methods

rnf :: SrcSpan -> ()

ToJson SrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: SrcSpan -> JsonDoc

Outputable SrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcSpan -> SDoc

Eq SrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcSpan -> SrcSpan -> Bool

(/=) :: SrcSpan -> SrcSpan -> Bool

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

data SrcLoc

Source Location

Constructors

RealSrcLoc !RealSrcLoc !(Maybe BufPos)

UnhelpfulLoc FastString

Instances

Show SrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcLoc -> ShowS

show :: SrcLoc -> String

showList :: [SrcLoc] -> ShowS

Outputable SrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcLoc -> SDoc

Eq SrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcLoc -> SrcLoc -> Bool

(/=) :: SrcLoc -> SrcLoc -> Bool

data RealSrcSpan

A SrcSpan 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

Data RealSrcSpan

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

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcSpan -> ShowS

show :: RealSrcSpan -> String

showList :: [RealSrcSpan] -> ShowS

ToJson RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: RealSrcSpan -> JsonDoc

Outputable RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

Eq RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcSpan -> RealSrcSpan -> Bool

(/=) :: RealSrcSpan -> RealSrcSpan -> Bool

Ord RealSrcSpan

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

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

data RealSrcLoc

Real Source Location

Represents a single point within a file

Instances

Show RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcLoc -> ShowS

show :: RealSrcLoc -> String

showList :: [RealSrcLoc] -> ShowS

Outputable RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

Eq RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcLoc -> RealSrcLoc -> Bool

(/=) :: RealSrcLoc -> RealSrcLoc -> Bool

Ord RealSrcLoc

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 RealLocated = GenLocated RealSrcSpan

data PsSpan

Constructors

PsSpan

Fields

• psRealSpan :: !RealSrcSpan
• psBufSpan :: !BufSpan

Instances

Show PsSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> PsSpan -> ShowS

show :: PsSpan -> String

showList :: [PsSpan] -> ShowS

Eq PsSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: PsSpan -> PsSpan -> Bool

(/=) :: PsSpan -> PsSpan -> Bool

Ord PsSpan

Defined in GHC.Types.SrcLoc

Methods

compare :: PsSpan -> PsSpan -> Ordering

(<) :: PsSpan -> PsSpan -> Bool

(<=) :: PsSpan -> PsSpan -> Bool

(>) :: PsSpan -> PsSpan -> Bool

(>=) :: PsSpan -> PsSpan -> Bool

max :: PsSpan -> PsSpan -> PsSpan

min :: PsSpan -> PsSpan -> PsSpan

type PsLocated = GenLocated PsSpan

data PsLoc

A location as produced by the parser. Consists of two components:

• The location in the file, adjusted for #line and {-# LINE ... #-} pragmas (RealSrcLoc)
• The location in the string buffer (BufPos) with monotonicity guarantees (see #17632)

Constructors

PsLoc

Fields

• psRealLoc :: !RealSrcLoc
• psBufPos :: !BufPos

Instances

Show PsLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> PsLoc -> ShowS

show :: PsLoc -> String

showList :: [PsLoc] -> ShowS

Eq PsLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: PsLoc -> PsLoc -> Bool

(/=) :: PsLoc -> PsLoc -> Bool

Ord PsLoc

Defined in GHC.Types.SrcLoc

Methods

compare :: PsLoc -> PsLoc -> Ordering

(<) :: PsLoc -> PsLoc -> Bool

(<=) :: PsLoc -> PsLoc -> Bool

(>) :: PsLoc -> PsLoc -> Bool

(>=) :: PsLoc -> PsLoc -> Bool

max :: PsLoc -> PsLoc -> PsLoc

min :: PsLoc -> PsLoc -> PsLoc

type Located = GenLocated SrcSpan

data LayoutInfo

Layout information for declarations.

Constructors

ExplicitBraces

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

Data LayoutInfo

Defined in GHC.Types.SrcLoc

Methods

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

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

toConstr :: LayoutInfo -> Constr

dataTypeOf :: LayoutInfo -> DataType

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

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

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

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

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

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

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

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

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

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

Show LayoutInfo

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> LayoutInfo -> ShowS

show :: LayoutInfo -> String

showList :: [LayoutInfo] -> ShowS

Eq LayoutInfo

Defined in GHC.Types.SrcLoc

Methods

(==) :: LayoutInfo -> LayoutInfo -> Bool

(/=) :: LayoutInfo -> LayoutInfo -> Bool

Ord LayoutInfo

Defined in GHC.Types.SrcLoc

Methods

compare :: LayoutInfo -> LayoutInfo -> Ordering

(<) :: LayoutInfo -> LayoutInfo -> Bool

(<=) :: LayoutInfo -> LayoutInfo -> Bool

(>) :: LayoutInfo -> LayoutInfo -> Bool

(>=) :: LayoutInfo -> LayoutInfo -> Bool

max :: LayoutInfo -> LayoutInfo -> LayoutInfo

min :: LayoutInfo -> LayoutInfo -> LayoutInfo

data GenLocated l e

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

Constructors

L l e

Instances

Foldable (GenLocated l)

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)

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)

Defined in GHC.Types.SrcLoc

Methods

fmap :: (a -> b) -> GenLocated l a -> GenLocated l b

(<$) :: a -> GenLocated l b -> GenLocated l a

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

(Data l, Data e) => Data (GenLocated l e)

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)

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

(Eq l, Eq e) => Eq (GenLocated l e)

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)

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

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

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

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

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

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

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

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 (HsExpr (GhcPass pr))))]

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

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data BufSpan

StringBuffer Source Span

Constructors

BufSpan

Fields

• bufSpanStart :: !BufPos
• bufSpanEnd :: !BufPos

Instances

Semigroup BufSpan

Defined in GHC.Types.SrcLoc

Methods

(<>) :: BufSpan -> BufSpan -> BufSpan

sconcat :: NonEmpty BufSpan -> BufSpan

stimes :: Integral b => b -> BufSpan -> BufSpan

Show BufSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> BufSpan -> ShowS

show :: BufSpan -> String

showList :: [BufSpan] -> ShowS

Eq BufSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: BufSpan -> BufSpan -> Bool

(/=) :: BufSpan -> BufSpan -> Bool

Ord BufSpan

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

newtype BufPos

0-based offset identifying the raw location in the StringBuffer.

The lexer increments the BufPos every time a character (UTF-8 code point) is read from the input buffer. As UTF-8 is a variable-length encoding and StringBuffer needs a byte offset for indexing, a BufPos cannot be used for indexing.

The parser guarantees that BufPos are monotonic. See #17632. This means that syntactic constructs that appear later in the StringBuffer are guaranteed to have a higher BufPos. Constrast that with SrcLoc, which does *not* make the analogous guarantee about higher line/column numbers.

This is due to #line and {-# LINE ... #-} pragmas that can arbitrarily modify SrcLoc. Notice how setSrcLoc and resetAlrLastLoc in GHC.Parser.Lexer update PsLoc, modifying SrcLoc but preserving BufPos.

Monotonicity makes BufPos useful to determine the order in which syntactic elements appear in the source. Consider this example (haddockA041 in the test suite):

haddockA041.hs {-# LANGUAGE CPP #-} -- | Module header documentation module Comments_and_CPP_include where #include "IncludeMe.hs"

IncludeMe.hs: -- | Comment on T data T = MkT -- ^ Comment on MkT

After the C preprocessor runs, the StringBuffer will contain a program that looks like this (unimportant lines at the beginning removed):

# 1 "haddockA041.hs" {-# LANGUAGE CPP #-} -- | Module header documentation module Comments_and_CPP_include where # 1 "IncludeMe.hs" 1 -- | Comment on T data T = MkT -- ^ Comment on MkT # 7 "haddockA041.hs" 2

The line pragmas inserted by CPP make the error messages more informative. The downside is that we can't use RealSrcLoc to determine the ordering of syntactic elements.

With RealSrcLoc, we have the following location information recorded in the AST: * The module name is located at haddockA041.hs:3:8-31 * The Haddock comment "Comment on T" is located at IncludeMe:1:1-17 * The data declaration is located at IncludeMe.hs:2:1-32

Is the Haddock comment located between the module name and the data declaration? This is impossible to tell because the locations are not comparable; they even refer to different files.

On the other hand, with BufPos, we have the following location information: * The module name is located at 846-870 * The Haddock comment "Comment on T" is located at 898-915 * The data declaration is located at 916-928

Aside: if you're wondering why the numbers are so high, try running ghc -E haddockA041.hs and see the extra fluff that CPP inserts at the start of the file.

For error messages, BufPos is not useful at all. On the other hand, this is exactly what we need to determine the order of syntactic elements: 870 < 898, therefore the Haddock comment appears *after* the module name. 915 < 916, therefore the Haddock comment appears *before* the data declaration.

We use BufPos in in GHC.Parser.PostProcess.Haddock to associate Haddock comments with parts of the AST using location information (#17544).

Constructors

BufPos

Fields

• bufPos :: Int

Instances

Show BufPos

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> BufPos -> ShowS

show :: BufPos -> String

showList :: [BufPos] -> ShowS

Eq BufPos

Defined in GHC.Types.SrcLoc

Methods

(==) :: BufPos -> BufPos -> Bool

(/=) :: BufPos -> BufPos -> Bool

Ord BufPos

Defined in GHC.Types.SrcLoc

Methods

compare :: BufPos -> BufPos -> Ordering

(<) :: BufPos -> BufPos -> Bool

(<=) :: BufPos -> BufPos -> Bool

(>) :: BufPos -> BufPos -> Bool

(>=) :: BufPos -> BufPos -> Bool

max :: BufPos -> BufPos -> BufPos

min :: BufPos -> BufPos -> BufPos

wiredInSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

unhelpfulSpanFS :: UnhelpfulSpanReason -> FastString

unRealSrcSpan :: RealLocated a -> a

unLoc :: GenLocated l e -> e

srcSpanToRealSrcSpan :: SrcSpan -> Maybe RealSrcSpan

srcSpanStartLine :: RealSrcSpan -> Int

srcSpanStartCol :: RealSrcSpan -> Int

srcSpanStart :: SrcSpan -> SrcLoc

Returns the location at the start of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanFirstCharacter :: SrcSpan -> SrcSpan

Convert a SrcSpan into one that represents only its first character

srcSpanFileName_maybe :: SrcSpan -> Maybe FastString

Obtains the filename for a SrcSpan if it is "good"

srcSpanEndLine :: RealSrcSpan -> Int

srcSpanEndCol :: RealSrcSpan -> Int

srcSpanEnd :: SrcSpan -> SrcLoc

Returns the location at the end of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcLocSpan :: SrcLoc -> SrcSpan

Create a SrcSpan corresponding to a single point

srcLocLine :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

srcLocFile :: RealSrcLoc -> FastString

Gives the filename of the SrcLoc

srcLocCol :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

spans :: SrcSpan -> (Int, Int) -> Bool

Determines whether a span encloses a given line and column index

sortRealLocated :: [RealLocated a] -> [RealLocated a]

sortLocated :: [Located a] -> [Located a]

rightmost_smallest :: SrcSpan -> SrcSpan -> Ordering

Strategies for ordering SrcSpans

realSrcSpanStart :: RealSrcSpan -> RealSrcLoc

realSrcSpanEnd :: RealSrcSpan -> RealSrcLoc

realSrcLocSpan :: RealSrcLoc -> RealSrcSpan

psSpanStart :: PsSpan -> PsLoc

psSpanEnd :: PsSpan -> PsLoc

pprUserSpan :: Bool -> SrcSpan -> SDoc

pprUserRealSpan :: Bool -> RealSrcSpan -> SDoc

pprUnhelpfulSpanReason :: UnhelpfulSpanReason -> SDoc

pprLocated :: (Outputable l, Outputable e) => GenLocated l e -> SDoc

noSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

noSrcLoc :: SrcLoc

Built-in "bad" SrcLoc values for particular locations

noLoc :: e -> Located e

mkSrcSpanPs :: PsSpan -> SrcSpan

mkSrcSpan :: SrcLoc -> SrcLoc -> SrcSpan

Create a SrcSpan between two points in a file

mkSrcLoc :: FastString -> Int -> Int -> SrcLoc

mkRealSrcSpan :: RealSrcLoc -> RealSrcLoc -> RealSrcSpan

Create a SrcSpan between two points in a file

mkRealSrcLoc :: FastString -> Int -> Int -> RealSrcLoc

mkPsSpan :: PsLoc -> PsLoc -> PsSpan

mkGeneralSrcSpan :: FastString -> SrcSpan

Create a "bad" SrcSpan that has not location information

mkGeneralSrcLoc :: FastString -> SrcLoc

Creates a "bad" SrcLoc that has no detailed information about its location

mkGeneralLocated :: String -> e -> Located e

mapLoc :: (a -> b) -> GenLocated l a -> GenLocated l b

lookupSrcSpan :: SrcSpan -> Map RealSrcSpan a -> Maybe a

lookupSrcLoc :: SrcLoc -> Map RealSrcLoc a -> Maybe a

liftL :: Monad m => (a -> m b) -> GenLocated l a -> m (GenLocated l b)

leftmost_smallest :: SrcSpan -> SrcSpan -> Ordering

Strategies for ordering SrcSpans

leftmost_largest :: SrcSpan -> SrcSpan -> Ordering

Strategies for ordering SrcSpans

leftmostColumn :: Int

Indentation level is 1-indexed, so the leftmost column is 1.

isZeroWidthSpan :: SrcSpan -> Bool

True if the span has a width of zero, as returned for "virtual" semicolons in the lexer. For "bad" SrcSpan, it returns False

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

isRealSubspanOf

Arguments

:: RealSrcSpan

The span that may be enclosed by the other

-> RealSrcSpan

The span it may be enclosed by

-> Bool

Determines whether a span is enclosed by another one

isOneLineSpan :: SrcSpan -> Bool

True if the span is known to straddle only one line. For "bad" SrcSpan, it returns False

isGoodSrcSpan :: SrcSpan -> Bool

Test if a SrcSpan is "good", i.e. has precise location information

isGeneratedSrcSpan :: SrcSpan -> Bool

interactiveSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

interactiveSrcLoc :: SrcLoc

Built-in "bad" SrcLoc values for particular locations

getRealSrcSpan :: RealLocated a -> RealSrcSpan

getLoc :: GenLocated l e -> l

getBufSpan :: SrcSpan -> Maybe BufSpan

getBufPos :: SrcLoc -> Maybe BufPos

generatedSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

generatedSrcLoc :: SrcLoc

Built-in "bad" SrcLoc values for particular locations

eqLocated :: Eq a => GenLocated l a -> GenLocated l a -> Bool

Tests whether the two located things are equal

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.

combineSrcSpans :: SrcSpan -> SrcSpan -> SrcSpan

Combines two SrcSpan into one that spans at least all the characters within both spans. Returns UnhelpfulSpan if the files differ.

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

combineLocs :: Located a -> Located b -> SrcSpan

cmpLocated :: Ord a => GenLocated l a -> GenLocated l a -> Ordering

Tests the ordering of the two located things

cmpBufSpan :: HasDebugCallStack => Located a -> Located a -> Ordering

Compare the BufSpan of two located things.

Precondition: both operands have an associated BufSpan.

advanceSrcLoc :: RealSrcLoc -> Char -> RealSrcLoc

Move the SrcLoc down by one line if the character is a newline, to the next 8-char tabstop if it is a tab, and across by one character in any other case

advancePsLoc :: PsLoc -> Char -> PsLoc

advanceBufPos :: BufPos -> BufPos

addCLoc :: Located a -> Located b -> c -> Located c

Combine locations from two Located things and add them to a third thing

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.

mkFsEnv :: [(FastString, a)] -> FastStringEnv a

lookupFsEnv :: FastStringEnv a -> FastString -> Maybe a

extendFsEnv :: FastStringEnv a -> FastString -> a -> FastStringEnv a

emptyFsEnv :: FastStringEnv a

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

Exception GhcException

Defined in GHC.Utils.Panic

Methods

toException :: GhcException -> SomeException

fromException :: SomeException -> Maybe GhcException

displayException :: GhcException -> String

Show GhcException

Defined in GHC.Utils.Panic

Methods

showsPrec :: Int -> GhcException -> ShowS

show :: GhcException -> String

showList :: [GhcException] -> ShowS

withSignalHandlers :: ExceptionMonad m => m a -> m a

Temporarily install standard signal handlers for catching ^C, which just throw an exception in the current thread.

showGhcException :: SDocContext -> GhcException -> ShowS

Append a description of the given exception to this string.

type QueryQualifyPackage = Unit -> Bool

For a given package, we need to know whether to print it with the component id to disambiguate it.

type QueryQualifyName = Module -> OccName -> QualifyName

Given a Name's Module and OccName, decide whether and how to qualify it.

type QueryQualifyModule = Module -> Bool

For a given module, we need to know whether to print it with a package name to disambiguate it.

data QualifyName

Constructors

NameUnqual

NameQual ModuleName

NameNotInScope1

NameNotInScope2

Instances

Outputable QualifyName

Defined in GHC.Utils.Outputable

Methods

ppr :: QualifyName -> SDoc

data PrintUnqualified

When printing code that contains original names, we need to map the original names back to something the user understands. This is the purpose of the triple of functions that gets passed around when rendering SDoc.

Constructors

QueryQualify

Fields

• queryQualifyName :: QueryQualifyName
• queryQualifyModule :: QueryQualifyModule
• queryQualifyPackage :: QueryQualifyPackage

newtype PDoc a

Wrapper for types having a Outputable instance when an OutputableP instance is required.

Constructors

PDoc a

Instances

Outputable a => OutputableP env (PDoc a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> PDoc a -> SDoc

class OutputableP env a where

Outputable class with an additional environment value

See Note [The OutputableP class]

Methods

pdoc :: env -> a -> SDoc

Instances

OutputableP env Alignment

Defined in GHC.Types.Basic

Methods

pdoc :: env -> Alignment -> SDoc

OutputableP env SDoc

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SDoc -> SDoc

OutputableP env a => OutputableP env (SCC a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SCC a -> SDoc

OutputableP env a => OutputableP env (Set a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Set a -> SDoc

Outputable a => OutputableP env (PDoc a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> PDoc a -> SDoc

OutputableP env a => OutputableP env (Maybe a)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Maybe a -> SDoc

OutputableP env a => OutputableP env [a]

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> [a] -> SDoc

(OutputableP env key, OutputableP env elt) => OutputableP env (Map key elt)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> Map key elt -> SDoc

(OutputableP env a, OutputableP env b) => OutputableP env (a, b)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> (a, b) -> SDoc

(OutputableP env a, OutputableP env b, OutputableP env c) => OutputableP env (a, b, c)

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> (a, b, c) -> SDoc

class Outputable a => OutputableBndr a where

When we print a binder, we often want to print its type too. The OutputableBndr class encapsulates this idea.

Minimal complete definition

pprPrefixOcc, pprInfixOcc

Methods

pprBndr :: BindingSite -> a -> SDoc

pprPrefixOcc :: a -> SDoc

pprInfixOcc :: a -> SDoc

bndrIsJoin_maybe :: a -> Maybe Int

Instances

OutputableBndr ConLike

Defined in GHC.Core.ConLike

Methods

pprBndr :: BindingSite -> ConLike -> SDoc

pprPrefixOcc :: ConLike -> SDoc

pprInfixOcc :: ConLike -> SDoc

bndrIsJoin_maybe :: ConLike -> Maybe Int

OutputableBndr DataCon

Defined in GHC.Core.DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

OutputableBndr PatSyn

Defined in GHC.Core.PatSyn

Methods

pprBndr :: BindingSite -> PatSyn -> SDoc

pprPrefixOcc :: PatSyn -> SDoc

pprInfixOcc :: PatSyn -> SDoc

bndrIsJoin_maybe :: PatSyn -> Maybe Int

OutputableBndr BinderInfo

Defined in GHC.Stg.Lift.Analysis

Methods

pprBndr :: BindingSite -> BinderInfo -> SDoc

pprPrefixOcc :: BinderInfo -> SDoc

pprInfixOcc :: BinderInfo -> SDoc

bndrIsJoin_maybe :: BinderInfo -> Maybe Int

OutputableBndr Name

Defined in GHC.Types.Name

Methods

pprBndr :: BindingSite -> Name -> SDoc

pprPrefixOcc :: Name -> SDoc

pprInfixOcc :: Name -> SDoc

bndrIsJoin_maybe :: Name -> Maybe Int

OutputableBndr OccName

Defined in GHC.Types.Name.Occurrence

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

OutputableBndr RdrName

Defined in GHC.Types.Name.Reader

Methods

pprBndr :: BindingSite -> RdrName -> SDoc

pprPrefixOcc :: RdrName -> SDoc

pprInfixOcc :: RdrName -> SDoc

bndrIsJoin_maybe :: RdrName -> Maybe Int

OutputableBndr HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> HsIPName -> SDoc

pprPrefixOcc :: HsIPName -> SDoc

pprInfixOcc :: HsIPName -> SDoc

bndrIsJoin_maybe :: HsIPName -> Maybe Int

OutputableBndr name => OutputableBndr (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

pprBndr :: BindingSite -> IEWrappedName name -> SDoc

pprPrefixOcc :: IEWrappedName name -> SDoc

pprInfixOcc :: IEWrappedName name -> SDoc

bndrIsJoin_maybe :: IEWrappedName name -> Maybe Int

OutputableBndr (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

pprBndr :: BindingSite -> FieldLabelStrings p -> SDoc

pprPrefixOcc :: FieldLabelStrings p -> SDoc

pprInfixOcc :: FieldLabelStrings p -> SDoc

bndrIsJoin_maybe :: FieldLabelStrings p -> Maybe Int

OutputableBndr (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> FieldOcc pass -> SDoc

pprPrefixOcc :: FieldOcc pass -> SDoc

pprInfixOcc :: FieldOcc pass -> SDoc

bndrIsJoin_maybe :: FieldOcc pass -> Maybe Int

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

class Outputable a where

Class designating that some type has an SDoc representation

Methods

ppr :: a -> SDoc

Instances

Outputable Fingerprint

Defined in GHC.Utils.Outputable

Methods

ppr :: Fingerprint -> SDoc

Outputable Int32

Defined in GHC.Utils.Outputable

Methods

ppr :: Int32 -> SDoc

Outputable Int64

Defined in GHC.Utils.Outputable

Methods

ppr :: Int64 -> SDoc

Outputable Word16

Defined in GHC.Utils.Outputable

Methods

ppr :: Word16 -> SDoc

Outputable Word32

Defined in GHC.Utils.Outputable

Methods

ppr :: Word32 -> SDoc

Outputable Word64

Defined in GHC.Utils.Outputable

Methods

ppr :: Word64 -> SDoc

Outputable IntSet

Defined in GHC.Utils.Outputable

Methods

ppr :: IntSet -> SDoc

Outputable CoreModule

Defined in GHC

Methods

ppr :: CoreModule -> SDoc

Outputable ByteOff

Defined in GHC.ByteCode.Types

Methods

ppr :: ByteOff -> SDoc

Outputable CgBreakInfo

Defined in GHC.ByteCode.Types

Methods

ppr :: CgBreakInfo -> SDoc

Outputable CompiledByteCode

Defined in GHC.ByteCode.Types

Methods

ppr :: CompiledByteCode -> SDoc

Outputable RegBitmap

Defined in GHC.ByteCode.Types

Methods

ppr :: RegBitmap -> SDoc

Outputable TupleInfo

Defined in GHC.ByteCode.Types

Methods

ppr :: TupleInfo -> SDoc

Outputable UnlinkedBCO

Defined in GHC.ByteCode.Types

Methods

ppr :: UnlinkedBCO -> SDoc

Outputable WordOff

Defined in GHC.ByteCode.Types

Methods

ppr :: WordOff -> SDoc

Outputable AltCon

Defined in GHC.Core

Methods

ppr :: AltCon -> SDoc

Outputable Class

Defined in GHC.Core.Class

Methods

ppr :: Class -> SDoc

Outputable LiftingContext

Defined in GHC.Core.Coercion

Methods

ppr :: LiftingContext -> SDoc

Outputable CoAxBranch

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxBranch -> SDoc

Outputable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiomRule -> SDoc

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Outputable ConLike

Defined in GHC.Core.ConLike

Methods

ppr :: ConLike -> SDoc

Outputable DataCon

Defined in GHC.Core.DataCon

Methods

ppr :: DataCon -> SDoc

Outputable EqSpec

Defined in GHC.Core.DataCon

Methods

ppr :: EqSpec -> SDoc

Outputable HsImplBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsImplBang -> SDoc

Outputable HsSrcBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsSrcBang -> SDoc

Outputable SrcStrictness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcStrictness -> SDoc

Outputable SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

Outputable StrictnessMark

Defined in GHC.Core.DataCon

Methods

ppr :: StrictnessMark -> SDoc

Outputable FamInst

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInst -> SDoc

Outputable FamInstMatch

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInstMatch -> SDoc

Outputable FamilyInstEnv

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamilyInstEnv -> SDoc

Outputable ClsInst

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInst -> SDoc

Outputable ClsInstEnv

Defined in GHC.Core.InstEnv

Methods

ppr :: ClsInstEnv -> SDoc

Outputable FloatBind

Defined in GHC.Core.Make

Methods

ppr :: FloatBind -> SDoc

Outputable CallerCcFilter

Defined in GHC.Core.Opt.CallerCC

Methods

ppr :: CallerCcFilter -> SDoc

Outputable NamePattern

Defined in GHC.Core.Opt.CallerCC

Methods

ppr :: NamePattern -> SDoc

Outputable PatSyn

Defined in GHC.Core.PatSyn

Methods

ppr :: PatSyn -> SDoc

Outputable EqRel

Defined in GHC.Core.Predicate

Methods

ppr :: EqRel -> SDoc

Outputable Coercion

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Coercion -> SDoc

Outputable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: CoercionHole -> SDoc

Outputable MCoercion

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: MCoercion -> SDoc

Outputable TyCoBinder

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyCoBinder -> SDoc

Outputable TyLit

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyLit -> SDoc

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

Outputable UnivCoProvenance

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: UnivCoProvenance -> SDoc

Outputable AlgTyConFlav

Defined in GHC.Core.TyCon

Methods

ppr :: AlgTyConFlav -> SDoc

Outputable FamTyConFlav

Defined in GHC.Core.TyCon

Methods

ppr :: FamTyConFlav -> SDoc

Outputable PrimElemRep

Defined in GHC.Core.TyCon

Methods

ppr :: PrimElemRep -> SDoc

Outputable PrimRep

Defined in GHC.Core.TyCon

Methods

ppr :: PrimRep -> SDoc

Outputable TyCon

Defined in GHC.Core.TyCon

Methods

ppr :: TyCon -> SDoc

Outputable TyConBndrVis

Defined in GHC.Core.TyCon

Methods

ppr :: TyConBndrVis -> SDoc

Outputable TyConFlavour

Defined in GHC.Core.TyCon

Methods

ppr :: TyConFlavour -> SDoc

Outputable ArgSummary

Defined in GHC.Core.Unfold

Methods

ppr :: ArgSummary -> SDoc

Outputable CallCtxt

Defined in GHC.Core.Unfold

Methods

ppr :: CallCtxt -> SDoc

Outputable ExprSize

Defined in GHC.Core.Unfold

Methods

ppr :: ExprSize -> SDoc

Outputable MaybeApartReason

Defined in GHC.Core.Unify

Methods

ppr :: MaybeApartReason -> SDoc

Outputable Usage

Defined in GHC.Core.UsageEnv

Methods

ppr :: Usage -> SDoc

Outputable UsageEnv

Defined in GHC.Core.UsageEnv

Methods

ppr :: UsageEnv -> SDoc

Outputable FastString

Defined in GHC.Utils.Outputable

Methods

ppr :: FastString -> SDoc

Outputable LexicalFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: LexicalFastString -> SDoc

Outputable NonDetFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: NonDetFastString -> SDoc

Outputable WarnReason

Defined in GHC.Driver.CmdLine

Methods

ppr :: WarnReason -> SDoc

Outputable Language

Defined in GHC.Driver.Flags

Methods

ppr :: Language -> SDoc

Outputable WarnReason

Defined in GHC.Driver.Flags

Methods

ppr :: WarnReason -> SDoc

Outputable Phase

Defined in GHC.Driver.Phases

Methods

ppr :: Phase -> SDoc

Outputable PluginRecompile

Defined in GHC.Driver.Plugins

Methods

ppr :: PluginRecompile -> SDoc

Outputable GhcMode

Defined in GHC.Driver.Session

Methods

ppr :: GhcMode -> SDoc

Outputable ModRenaming

Defined in GHC.Driver.Session

Methods

ppr :: ModRenaming -> SDoc

Outputable PackageArg

Defined in GHC.Driver.Session

Methods

ppr :: PackageArg -> SDoc

Outputable PackageFlag

Defined in GHC.Driver.Session

Methods

ppr :: PackageFlag -> SDoc

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

Outputable XViaStrategyPs

Defined in GHC.Hs.Decls

Methods

ppr :: XViaStrategyPs -> SDoc

Outputable ArgDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: ArgDocMap -> SDoc

Outputable DeclDocMap

Defined in GHC.Hs.Doc

Methods

ppr :: DeclDocMap -> SDoc

Outputable HsDocString

Defined in GHC.Hs.Doc

Methods

ppr :: HsDocString -> SDoc

Outputable GrhsAnn

Defined in GHC.Hs.Expr

Methods

ppr :: GrhsAnn -> SDoc

Outputable PendingRnSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingRnSplice -> SDoc

Outputable PendingTcSplice

Defined in GHC.Hs.Expr

Methods

ppr :: PendingTcSplice -> SDoc

Outputable SyntaxExprRn

Defined in GHC.Hs.Expr

Methods

ppr :: SyntaxExprRn -> SDoc

Outputable SyntaxExprTc

Defined in GHC.Hs.Expr

Methods

ppr :: SyntaxExprTc -> SDoc

Outputable DsMatchContext

Defined in GHC.HsToCore.Monad

Methods

ppr :: DsMatchContext -> SDoc

Outputable EquationInfo

Defined in GHC.HsToCore.Monad

Methods

ppr :: EquationInfo -> SDoc

Outputable IfaceAT

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceAT -> SDoc

Outputable IfaceAnnotation

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceAnnotation -> SDoc

Outputable IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceClassOp -> SDoc

Outputable IfaceClsInst

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceClsInst -> SDoc

Outputable IfaceCompleteMatch

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceCompleteMatch -> SDoc

Outputable IfaceConAlt

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceConAlt -> SDoc

Outputable IfaceDecl

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceDecl -> SDoc

Outputable IfaceExpr

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceExpr -> SDoc

Outputable IfaceFamInst

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceFamInst -> SDoc

Outputable IfaceIdDetails

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceIdDetails -> SDoc

Outputable IfaceInfoItem

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceInfoItem -> SDoc

Outputable IfaceJoinInfo

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceJoinInfo -> SDoc

Outputable IfaceLFInfo

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceLFInfo -> SDoc

Outputable IfaceRule

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceRule -> SDoc

Outputable IfaceTyConParent

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceTyConParent -> SDoc

Outputable IfaceUnfolding

Defined in GHC.Iface.Syntax

Methods

ppr :: IfaceUnfolding -> SDoc

Outputable ShowHowMuch

Defined in GHC.Iface.Syntax

Methods

ppr :: ShowHowMuch -> SDoc

Outputable AddEpAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: AddEpAnn -> SDoc

Outputable Anchor

Defined in GHC.Parser.Annotation

Methods

ppr :: Anchor -> SDoc

Outputable AnchorOperation

Defined in GHC.Parser.Annotation

Methods

ppr :: AnchorOperation -> SDoc

Outputable AnnContext

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnContext -> SDoc

Outputable AnnKeywordId

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnKeywordId -> SDoc

Outputable AnnList

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnList -> SDoc

Outputable AnnListItem

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnListItem -> SDoc

Outputable AnnPragma

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnPragma -> SDoc

Outputable AnnSortKey

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnSortKey -> SDoc

Outputable DeltaPos

Defined in GHC.Parser.Annotation

Methods

ppr :: DeltaPos -> SDoc

Outputable EpAnnComments

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnnComments -> SDoc

Outputable EpaComment

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaComment -> SDoc

Outputable EpaLocation

Defined in GHC.Parser.Annotation

Methods

ppr :: EpaLocation -> SDoc

Outputable IsUnicodeSyntax

Defined in GHC.Parser.Annotation

Methods

ppr :: IsUnicodeSyntax -> SDoc

Outputable NameAdornment

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAdornment -> SDoc

Outputable NameAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAnn -> SDoc

Outputable TrailingAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: TrailingAnn -> SDoc

Outputable Token

Defined in GHC.Parser.Lexer

Methods

ppr :: Token -> SDoc

Outputable InteractiveImport

Defined in GHC.Runtime.Context

Methods

ppr :: InteractiveImport -> SDoc

Outputable GetDocsFailure

Defined in GHC.Runtime.Eval

Methods

ppr :: GetDocsFailure -> SDoc

Outputable Term

Defined in GHC.Runtime.Heap.Inspect

Methods

ppr :: Term -> SDoc

Outputable BinderInfo

Defined in GHC.Stg.Lift.Analysis

Methods

ppr :: BinderInfo -> SDoc

Outputable Skeleton

Defined in GHC.Stg.Lift.Analysis

Methods

ppr :: Skeleton -> SDoc

Outputable HoleFit

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: HoleFit -> SDoc

Outputable HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: HoleFitCandidate -> SDoc

Outputable TypedHole

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

ppr :: TypedHole -> SDoc

Outputable IdBindingInfo

Defined in GHC.Tc.Types

Methods

ppr :: IdBindingInfo -> SDoc

Outputable PromotionErr

Defined in GHC.Tc.Types

Methods

ppr :: PromotionErr -> SDoc

Outputable TcBinder

Defined in GHC.Tc.Types

Methods

ppr :: TcBinder -> SDoc

Outputable TcIdSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInfo -> SDoc

Outputable TcIdSigInst

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInst -> SDoc

Outputable TcPatSynInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcPatSynInfo -> SDoc

Outputable TcSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcSigInfo -> SDoc

Outputable TcTyThing

Defined in GHC.Tc.Types

Methods

ppr :: TcTyThing -> SDoc

Outputable ThStage

Defined in GHC.Tc.Types

Methods

ppr :: ThStage -> SDoc

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

Outputable CanEqLHS

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CanEqLHS -> SDoc

Outputable CheckTyEqResult

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CheckTyEqResult -> SDoc

Outputable Ct

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Ct -> SDoc

Outputable CtEvidence

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtEvidence -> SDoc

Outputable CtFlavour

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtFlavour -> SDoc

Outputable CtIrredReason

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: CtIrredReason -> SDoc

Outputable HasGivenEqs

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HasGivenEqs -> SDoc

Outputable Hole

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Hole -> SDoc

Outputable HoleSort

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: HoleSort -> SDoc

Outputable ImplicStatus

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: ImplicStatus -> SDoc

Outputable Implication

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: Implication -> SDoc

Outputable QCInst

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: QCInst -> SDoc

Outputable SubGoalDepth

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: SubGoalDepth -> SDoc

Outputable TcEvDest

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: TcEvDest -> SDoc

Outputable WantedConstraints

Defined in GHC.Tc.Types.Constraint

Methods

ppr :: WantedConstraints -> SDoc

Outputable EvBind

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBind -> SDoc

Outputable EvBindMap

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindMap -> SDoc

Outputable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindsVar -> SDoc

Outputable EvCallStack

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvCallStack -> SDoc

Outputable EvTerm

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTerm -> SDoc

Outputable EvTypeable

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTypeable -> SDoc

Outputable HoleExprRef

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HoleExprRef -> SDoc

Outputable HsWrapper

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HsWrapper -> SDoc

Outputable TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: TcEvBinds -> SDoc

Outputable CtOrigin

Defined in GHC.Tc.Types.Origin

Methods

ppr :: CtOrigin -> SDoc

Outputable SkolemInfo

Defined in GHC.Tc.Types.Origin

Methods

ppr :: SkolemInfo -> SDoc

Outputable IsExtraConstraint

Defined in GHC.Tc.Utils.Monad

Methods

ppr :: IsExtraConstraint -> SDoc

Outputable ExpType

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: ExpType -> SDoc

Outputable InferResult

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: InferResult -> SDoc

Outputable MetaDetails

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: MetaDetails -> SDoc

Outputable MetaInfo

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: MetaInfo -> SDoc

Outputable TcLevel

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: TcLevel -> SDoc

Outputable TcTyVarDetails

Defined in GHC.Tc.Utils.TcType

Methods

ppr :: TcTyVarDetails -> SDoc

Outputable Annotation

Defined in GHC.Types.Annotations

Methods

ppr :: Annotation -> SDoc

Outputable AvailInfo

Defined in GHC.Types.Avail

Methods

ppr :: AvailInfo -> SDoc

Outputable GreName

Defined in GHC.Types.Avail

Methods

ppr :: GreName -> SDoc

Outputable Activation

Defined in GHC.Types.Basic

Methods

ppr :: Activation -> SDoc

Outputable Alignment

Defined in GHC.Types.Basic

Methods

ppr :: Alignment -> SDoc

Outputable Boxity

Defined in GHC.Types.Basic

Methods

ppr :: Boxity -> SDoc

Outputable CompilerPhase

Defined in GHC.Types.Basic

Methods

ppr :: CompilerPhase -> SDoc

Outputable FunctionOrData

Defined in GHC.Types.Basic

Methods

ppr :: FunctionOrData -> SDoc

Outputable InlinePragma

Defined in GHC.Types.Basic

Methods

ppr :: InlinePragma -> SDoc

Outputable InlineSpec

Defined in GHC.Types.Basic

Methods

ppr :: InlineSpec -> SDoc

Outputable IntWithInf

Defined in GHC.Types.Basic

Methods

ppr :: IntWithInf -> SDoc

Outputable LeftOrRight

Defined in GHC.Types.Basic

Methods

ppr :: LeftOrRight -> SDoc

Outputable OccInfo

Defined in GHC.Types.Basic

Methods

ppr :: OccInfo -> SDoc

Outputable OneShotInfo

Defined in GHC.Types.Basic

Methods

ppr :: OneShotInfo -> SDoc

Outputable Origin

Defined in GHC.Types.Basic

Methods

ppr :: Origin -> SDoc

Outputable OverlapFlag

Defined in GHC.Types.Basic

Methods

ppr :: OverlapFlag -> SDoc

Outputable OverlapMode

Defined in GHC.Types.Basic

Methods

ppr :: OverlapMode -> SDoc

Outputable PromotionFlag

Defined in GHC.Types.Basic

Methods

ppr :: PromotionFlag -> SDoc

Outputable RecFlag

Defined in GHC.Types.Basic

Methods

ppr :: RecFlag -> SDoc

Outputable RuleMatchInfo

Defined in GHC.Types.Basic

Methods

ppr :: RuleMatchInfo -> SDoc

Outputable SuccessFlag

Defined in GHC.Types.Basic

Methods

ppr :: SuccessFlag -> SDoc

Outputable SwapFlag

Defined in GHC.Types.Basic

Methods

ppr :: SwapFlag -> SDoc

Outputable TailCallInfo

Defined in GHC.Types.Basic

Methods

ppr :: TailCallInfo -> SDoc

Outputable TopLevelFlag

Defined in GHC.Types.Basic

Methods

ppr :: TopLevelFlag -> SDoc

Outputable TupleSort

Defined in GHC.Types.Basic

Methods

ppr :: TupleSort -> SDoc

Outputable TypeOrKind

Defined in GHC.Types.Basic

Methods

ppr :: TypeOrKind -> SDoc

Outputable CompleteMatch

Defined in GHC.Types.CompleteMatch

Methods

ppr :: CompleteMatch -> SDoc

Outputable DuplicateRecordFields

Defined in GHC.Types.FieldLabel

Methods

ppr :: DuplicateRecordFields -> SDoc

Outputable FieldLabel

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldLabel -> SDoc

Outputable FieldSelectors

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldSelectors -> SDoc

Outputable Fixity

Defined in GHC.Types.Fixity

Methods

ppr :: Fixity -> SDoc

Outputable FixityDirection

Defined in GHC.Types.Fixity

Methods

ppr :: FixityDirection -> SDoc

Outputable LexicalFixity

Defined in GHC.Types.Fixity

Methods

ppr :: LexicalFixity -> SDoc

Outputable FixItem

Defined in GHC.Types.Fixity.Env

Methods

ppr :: FixItem -> SDoc

Outputable CCallConv

Defined in GHC.Types.ForeignCall

Methods

ppr :: CCallConv -> SDoc

Outputable CCallSpec

Defined in GHC.Types.ForeignCall

Methods

ppr :: CCallSpec -> SDoc

Outputable CExportSpec

Defined in GHC.Types.ForeignCall

Methods

ppr :: CExportSpec -> SDoc

Outputable CType

Defined in GHC.Types.ForeignCall

Methods

ppr :: CType -> SDoc

Outputable ForeignCall

Defined in GHC.Types.ForeignCall

Methods

ppr :: ForeignCall -> SDoc

Outputable Header

Defined in GHC.Types.ForeignCall

Methods

ppr :: Header -> SDoc

Outputable Safety

Defined in GHC.Types.ForeignCall

Methods

ppr :: Safety -> SDoc

Outputable CafInfo

Defined in GHC.Types.Id.Info

Methods

ppr :: CafInfo -> SDoc

Outputable IdDetails

Defined in GHC.Types.Id.Info

Methods

ppr :: IdDetails -> SDoc

Outputable LevityInfo

Defined in GHC.Types.Id.Info

Methods

ppr :: LevityInfo -> SDoc

Outputable RecSelParent

Defined in GHC.Types.Id.Info

Methods

ppr :: RecSelParent -> SDoc

Outputable TickBoxOp

Defined in GHC.Types.Id.Info

Methods

ppr :: TickBoxOp -> SDoc

Outputable Name

Defined in GHC.Types.Name

Methods

ppr :: Name -> SDoc

Outputable NameSort

Defined in GHC.Types.Name

Methods

ppr :: NameSort -> SDoc

Outputable OccName

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccName -> SDoc

Outputable GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

ppr :: GlobalRdrElt -> SDoc

Outputable ImportSpec

Defined in GHC.Types.Name.Reader

Methods

ppr :: ImportSpec -> SDoc

Outputable LocalRdrEnv

Defined in GHC.Types.Name.Reader

Methods

ppr :: LocalRdrEnv -> SDoc

Outputable Parent

Defined in GHC.Types.Name.Reader

Methods

ppr :: Parent -> SDoc

Outputable RdrName

Defined in GHC.Types.Name.Reader

Methods

ppr :: RdrName -> SDoc

Outputable IfaceTrustInfo

Defined in GHC.Types.SafeHaskell

Methods

ppr :: IfaceTrustInfo -> SDoc

Outputable SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

ppr :: SafeHaskellMode -> SDoc

Outputable FractionalLit

Defined in GHC.Types.SourceText

Methods

ppr :: FractionalLit -> SDoc

Outputable IntegralLit

Defined in GHC.Types.SourceText

Methods

ppr :: IntegralLit -> SDoc

Outputable SourceText

Defined in GHC.Types.SourceText

Methods

ppr :: SourceText -> SDoc

Outputable StringLiteral

Defined in GHC.Types.SourceText

Methods

ppr :: StringLiteral -> SDoc

Outputable RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

Outputable RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

Outputable SrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcLoc -> SDoc

Outputable SrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcSpan -> SDoc

Outputable UnhelpfulSpanReason

Defined in GHC.Types.SrcLoc

Methods

ppr :: UnhelpfulSpanReason -> SDoc

Outputable Target

Defined in GHC.Types.Target

Methods

ppr :: Target -> SDoc

Outputable TargetId

Defined in GHC.Types.Target

Methods

ppr :: TargetId -> SDoc

Outputable TyThing

Defined in GHC.Types.TyThing

Methods

ppr :: TyThing -> SDoc

Outputable Unique

Defined in GHC.Types.Unique

Methods

ppr :: Unique -> SDoc

Outputable AnonArgFlag

Defined in GHC.Types.Var

Methods

ppr :: AnonArgFlag -> SDoc

Outputable ArgFlag

Defined in GHC.Types.Var

Methods

ppr :: ArgFlag -> SDoc

Outputable Var

Defined in GHC.Types.Var

Methods

ppr :: Var -> SDoc

Outputable InScopeSet

Defined in GHC.Types.Var.Env

Methods

ppr :: InScopeSet -> SDoc

Outputable ModuleGraphNode

Defined in GHC.Unit.Module.Graph

Methods

ppr :: ModuleGraphNode -> SDoc

Outputable ModLocation

Defined in GHC.Unit.Module.Location

Methods

ppr :: ModLocation -> SDoc

Outputable ExtendedModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ExtendedModSummary -> SDoc

Outputable ModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ModSummary -> SDoc

Outputable ModuleName

Defined in GHC.Unit.Module.Name

Methods

ppr :: ModuleName -> SDoc

Outputable WarningTxt

Defined in GHC.Unit.Module.Warnings

Methods

ppr :: WarningTxt -> SDoc

Outputable ModuleOrigin

Defined in GHC.Unit.State

Methods

ppr :: ModuleOrigin -> SDoc

Outputable UnitErr

Defined in GHC.Unit.State

Methods

ppr :: UnitErr -> SDoc

Outputable UnitVisibility

Defined in GHC.Unit.State

Methods

ppr :: UnitVisibility -> SDoc

Outputable UnusableUnitReason

Defined in GHC.Unit.State

Methods

ppr :: UnusableUnitReason -> SDoc

Outputable InstalledModule

Defined in GHC.Unit.Types

Methods

ppr :: InstalledModule -> SDoc

Outputable InstantiatedModule

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedModule -> SDoc

Outputable InstantiatedUnit

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedUnit -> SDoc

Outputable Module

Defined in GHC.Unit.Types

Methods

ppr :: Module -> SDoc

Outputable Unit

Defined in GHC.Unit.Types

Methods

ppr :: Unit -> SDoc

Outputable UnitId

Defined in GHC.Unit.Types

Methods

ppr :: UnitId -> SDoc

Outputable PprStyle

Defined in GHC.Utils.Outputable

Methods

ppr :: PprStyle -> SDoc

Outputable QualifyName

Defined in GHC.Utils.Outputable

Methods

ppr :: QualifyName -> SDoc

Outputable SDoc

Defined in GHC.Utils.Outputable

Methods

ppr :: SDoc -> SDoc

Outputable DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: DocDecl -> SDoc

Outputable ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignExport -> SDoc

Outputable ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignImport -> SDoc

Outputable NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: NewOrData -> SDoc

Outputable SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: SpliceDecoration -> SDoc

Outputable NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtCon -> SDoc

Outputable NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtField -> SDoc

Outputable OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

ppr :: OverLitVal -> SDoc

Outputable HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsIPName -> SDoc

Outputable HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsTyLit -> SDoc

Outputable Serialized

Defined in GHC.Utils.Outputable

Methods

ppr :: Serialized -> SDoc

Outputable Extension

Defined in GHC.Utils.Outputable

Methods

ppr :: Extension -> SDoc

Outputable Ordering

Defined in GHC.Utils.Outputable

Methods

ppr :: Ordering -> SDoc

Outputable Integer

Defined in GHC.Utils.Outputable

Methods

ppr :: Integer -> SDoc

Outputable ()

Defined in GHC.Utils.Outputable

Methods

ppr :: () -> SDoc

Outputable Bool

Defined in GHC.Utils.Outputable

Methods

ppr :: Bool -> SDoc

Outputable Char

Defined in GHC.Utils.Outputable

Methods

ppr :: Char -> SDoc

Outputable Double

Defined in GHC.Utils.Outputable

Methods

ppr :: Double -> SDoc

Outputable Float

Defined in GHC.Utils.Outputable

Methods

ppr :: Float -> SDoc

Outputable Int

Defined in GHC.Utils.Outputable

Methods

ppr :: Int -> SDoc

Outputable Word

Defined in GHC.Utils.Outputable

Methods

ppr :: Word -> SDoc

Outputable a => Outputable (SCC a)

Defined in GHC.Utils.Outputable

Methods

ppr :: SCC a -> SDoc

Outputable elt => Outputable (IntMap elt)

Defined in GHC.Utils.Outputable

Methods

ppr :: IntMap elt -> SDoc

Outputable a => Outputable (Set a)

Defined in GHC.Utils.Outputable

Methods

ppr :: Set a -> SDoc

Outputable b => Outputable (TaggedBndr b)

Defined in GHC.Core

Methods

ppr :: TaggedBndr b -> SDoc

Outputable ev => Outputable (NormaliseStepResult ev)

Defined in GHC.Core.Coercion

Methods

ppr :: NormaliseStepResult ev -> SDoc

Outputable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: CoAxiom br -> SDoc

Outputable a => Outputable (CoreMap a)

Defined in GHC.Core.Map.Expr

Methods

ppr :: CoreMap a -> SDoc

Outputable a => Outputable (Scaled a)

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Scaled a -> SDoc

Outputable a => Outputable (UnifyResultM a)

Defined in GHC.Core.Unify

Methods

ppr :: UnifyResultM a -> SDoc

Outputable a => Outputable (Bag a)

Defined in GHC.Data.Bag

Methods

ppr :: Bag a -> SDoc

OutputableBndr a => Outputable (BooleanFormula a)

Defined in GHC.Data.BooleanFormula

Methods

ppr :: BooleanFormula a -> SDoc

Outputable a => Outputable (Pair a)

Defined in GHC.Data.Pair

Methods

ppr :: Pair a -> SDoc

Outputable a => Outputable (OnOff a)

Defined in GHC.Driver.Session

Methods

ppr :: OnOff a -> SDoc

OutputableBndrId p => Outputable (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: IE (GhcPass p) -> SDoc

OutputableBndr name => Outputable (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

ppr :: IEWrappedName name -> SDoc

(OutputableBndrId p, Outputable (Anno (IE (GhcPass p)))) => Outputable (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

Methods

ppr :: ImportDecl (GhcPass p) -> SDoc

Outputable a => Outputable (EpAnn a)

Defined in GHC.Parser.Annotation

Methods

ppr :: EpAnn a -> SDoc

Outputable a => Outputable (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

ppr :: SrcSpanAnn' a -> SDoc

OutputableBndrId a => Outputable (InstInfo (GhcPass a))

Defined in GHC.Tc.Utils.Env

Methods

ppr :: InstInfo (GhcPass a) -> SDoc

Outputable name => Outputable (AnnTarget name)

Defined in GHC.Types.Annotations

Methods

ppr :: AnnTarget name -> SDoc

Outputable (DefMethSpec ty)

Defined in GHC.Types.Basic

Methods

ppr :: DefMethSpec ty -> SDoc

Outputable a => Outputable (OccEnv a)

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccEnv a -> SDoc

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

Outputable a => Outputable (UniqDSet a)

Defined in GHC.Types.Unique.DSet

Methods

ppr :: UniqDSet a -> SDoc

Outputable unit => Outputable (Definite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Definite unit -> SDoc

Outputable a => Outputable (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

ppr :: GenWithIsBoot a -> SDoc

Outputable unit => Outputable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Indefinite unit -> SDoc

Outputable (RecordPatSynField a)

Defined in Language.Haskell.Syntax.Binds

Methods

ppr :: RecordPatSynField a -> SDoc

Outputable (FamilyInfo pass)

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: FamilyInfo pass -> SDoc

Outputable (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: FieldLabelStrings p -> SDoc

Outputable (HsFieldLabel p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: HsFieldLabel p -> SDoc

Outputable (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: FieldOcc pass -> SDoc

Outputable a => Outputable (NonEmpty a)

Defined in GHC.Utils.Outputable

Methods

ppr :: NonEmpty a -> SDoc

Outputable a => Outputable (Maybe a)

Defined in GHC.Utils.Outputable

Methods

ppr :: Maybe a -> SDoc

Outputable a => Outputable [a]

Defined in GHC.Utils.Outputable

Methods

ppr :: [a] -> SDoc

(Outputable a, Outputable b) => Outputable (Either a b)

Defined in GHC.Utils.Outputable

Methods

ppr :: Either a b -> SDoc

(Outputable key, Outputable elt) => Outputable (Map key elt)

Defined in GHC.Utils.Outputable

Methods

ppr :: Map key elt -> SDoc

(Outputable a, Outputable b) => Outputable (HsExpansion a b)

Just print the original expression (the a).

Defined in GHC.Hs.Expr

Methods

ppr :: HsExpansion a b -> SDoc

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

OutputableBndr tv => Outputable (VarBndr tv TyConBndrVis)

Defined in GHC.Core.TyCon

Methods

ppr :: VarBndr tv TyConBndrVis -> SDoc

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

Outputable tv => Outputable (VarBndr tv Specificity)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv Specificity -> SDoc

(Outputable p, OutputableBndr p, Outputable arg) => Outputable (HsRecField' p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecField' p arg -> SDoc

(Outputable arg, Outputable (XRec p (HsRecField p arg))) => Outputable (HsRecFields p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecFields p arg -> SDoc

(Outputable tm, Outputable ty) => Outputable (HsArg tm ty)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsArg tm ty -> SDoc

Outputable a => Outputable (HsScaled pass a)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsScaled pass a -> SDoc

(Outputable a, Outputable b) => Outputable (a, b)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b) -> SDoc

(Outputable tyarg, Outputable arg, Outputable rec) => Outputable (HsConDetails tyarg arg rec)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsConDetails tyarg arg rec -> SDoc

(Outputable a, Outputable b, Outputable c) => Outputable (a, b, c)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d) => Outputable (a, b, c, d)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e) => Outputable (a, b, c, d, e)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e, Outputable f) => Outputable (a, b, c, d, e, f)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e, f) -> SDoc

(Outputable a, Outputable b, Outputable c, Outputable d, Outputable e, Outputable f, Outputable g) => Outputable (a, b, c, d, e, f, g)

Defined in GHC.Utils.Outputable

Methods

ppr :: (a, b, c, d, e, f, g) -> SDoc

data LabelStyle

Style of label pretty-printing.

When we produce C sources or headers, we have to take into account that C compilers transform C labels when they convert them into symbols. For example, they can add prefixes (e.g., "_" on Darwin) or suffixes (size for stdcalls on Windows). So we provide two ways to pretty-print CLabels: C style or Asm style.

Constructors

CStyle

C label style (used by C and LLVM backends)

AsmStyle

Asm label style (used by NCG backend)

Instances

Show LabelStyle

Defined in GHC.Utils.Outputable

Methods

showsPrec :: Int -> LabelStyle -> ShowS

show :: LabelStyle -> String

showList :: [LabelStyle] -> ShowS

Eq LabelStyle

Defined in GHC.Utils.Outputable

Methods

(==) :: LabelStyle -> LabelStyle -> Bool

(/=) :: LabelStyle -> LabelStyle -> Bool

Ord LabelStyle

Defined in GHC.Utils.Outputable

Methods

compare :: LabelStyle -> LabelStyle -> Ordering

(<) :: LabelStyle -> LabelStyle -> Bool

(<=) :: LabelStyle -> LabelStyle -> Bool

(>) :: LabelStyle -> LabelStyle -> Bool

(>=) :: LabelStyle -> LabelStyle -> Bool

max :: LabelStyle -> LabelStyle -> LabelStyle

min :: LabelStyle -> LabelStyle -> LabelStyle

data Depth

Constructors

AllTheWay

PartWay Int

0 => stop

DefaultDepth

Use sdocDefaultDepth field as depth

data BindingSite

BindingSite is used to tell the thing that prints binder what language construct is binding the identifier. This can be used to decide how much info to print. Also see Note [Binding-site specific printing] in GHC.Core.Ppr

Constructors

LambdaBind

The x in (x. e)

CaseBind

The x in case scrut of x { (y,z) -> ... }

CasePatBind

The y,z in case scrut of x { (y,z) -> ... }

LetBind

The x in (let x = rhs in e)

ztext :: FastZString -> SDoc

word :: Integer -> SDoc

withUserStyle :: PrintUnqualified -> Depth -> SDoc -> SDoc

withPprStyle :: PprStyle -> SDoc -> SDoc

withErrStyle :: PrintUnqualified -> SDoc -> SDoc

whenPprDebug :: SDoc -> SDoc

Says what to do with -dppr-debug; without, return empty

vcat :: [SDoc] -> SDoc

Concatenate SDoc vertically with dovetailing

vbar :: SDoc

userStyle :: PprStyle -> Bool

updSDocContext :: (SDocContext -> SDocContext) -> SDoc -> SDoc

unicodeSyntax :: SDoc -> SDoc -> SDoc

underscore :: SDoc

speakNth :: Int -> SDoc

Converts an integer to a verbal index:

speakNth 1 = text "first"
speakNth 5 = text "fifth"
speakNth 21 = text "21st"

speakNOf :: Int -> SDoc -> SDoc

Converts an integer and object description to a statement about the multiplicity of those objects:

speakNOf 0 (text "melon") = text "no melons"
speakNOf 1 (text "melon") = text "one melon"
speakNOf 3 (text "melon") = text "three melons"

speakN :: Int -> SDoc

Converts an integer to a verbal multiplicity:

speakN 0 = text "none"
speakN 5 = text "five"
speakN 10 = text "10"

space :: SDoc

showSDocUnsafe :: SDoc -> String

showSDocOneLine :: SDocContext -> SDoc -> String

showPprUnsafe :: Outputable a => a -> String

setStyleColoured :: Bool -> PprStyle -> PprStyle

sep :: [SDoc] -> SDoc

Separate: is either like hsep or like vcat, depending on what fits

semi :: SDoc

sdocWithContext :: (SDocContext -> SDoc) -> SDoc

sdocOption :: (SDocContext -> a) -> (a -> SDoc) -> SDoc

runSDoc :: SDoc -> SDocContext -> Doc

rparen :: SDoc

renderWithContext :: SDocContext -> SDoc -> String

reallyAlwaysQualifyNames :: QueryQualifyName

reallyAlwaysQualify :: PrintUnqualified

rbrack :: SDoc

rbrace :: SDoc

rational :: Rational -> SDoc

quotes :: SDoc -> SDoc

quotedListWithOr :: [SDoc] -> SDoc

quotedListWithNor :: [SDoc] -> SDoc

quote :: SDoc -> SDoc

queryQual :: PprStyle -> PrintUnqualified

qualPackage :: PprStyle -> QueryQualifyPackage

qualName :: PprStyle -> QueryQualifyName

qualModule :: PprStyle -> QueryQualifyModule

punctuate

Arguments

:: SDoc

The punctuation

-> [SDoc]

The list that will have punctuation added between every adjacent pair of elements

-> [SDoc]

Punctuated list

ptext :: PtrString -> SDoc

printSDocLn :: SDocContext -> Mode -> Handle -> SDoc -> IO ()

Like printSDoc but appends an extra newline.

printSDoc :: SDocContext -> Mode -> Handle -> SDoc -> IO ()

The analog of printDoc_ for SDoc, which tries to make sure the terminal doesn't get screwed up by the ANSI color codes if an exception is thrown during pretty-printing.

primWordSuffix :: SDoc

primWord8Suffix :: SDoc

primWord64Suffix :: SDoc

primWord32Suffix :: SDoc

primWord16Suffix :: SDoc

primIntSuffix :: SDoc

primInt8Suffix :: SDoc

primInt64Suffix :: SDoc

primInt32Suffix :: SDoc

primInt16Suffix :: SDoc

primFloatSuffix :: SDoc

primDoubleSuffix :: SDoc

primCharSuffix :: SDoc

pprWithCommas

Arguments

:: (a -> SDoc)

The pretty printing function to use

-> [a]

The things to be pretty printed

-> SDoc

SDoc where the things have been pretty printed, comma-separated and finally packed into a paragraph.

pprWithBars

Arguments

:: (a -> SDoc)

The pretty printing function to use

-> [a]

The things to be pretty printed

-> SDoc

SDoc where the things have been pretty printed, bar-separated and finally packed into a paragraph.

pprSetDepth :: Depth -> SDoc -> SDoc

pprQuotedList :: Outputable a => [a] -> SDoc

Returns the comma-separated concatenation of the quoted pretty printed things.

[x,y,z]  ==>  `x', `y', `z'

pprPrimWord8 :: Integer -> SDoc

pprPrimWord64 :: Integer -> SDoc

pprPrimWord32 :: Integer -> SDoc

pprPrimWord16 :: Integer -> SDoc

pprPrimWord :: Integer -> SDoc

pprPrimInt8 :: Integer -> SDoc

pprPrimInt64 :: Integer -> SDoc

pprPrimInt32 :: Integer -> SDoc

pprPrimInt16 :: Integer -> SDoc

pprPrimInt :: Integer -> SDoc

pprPrimChar :: Char -> SDoc

Special combinator for showing unboxed literals.

pprPrefixVar :: Bool -> SDoc -> SDoc

pprInfixVar :: Bool -> SDoc -> SDoc

pprHsString :: FastString -> SDoc

Special combinator for showing string literals.

pprHsChar :: Char -> SDoc

Special combinator for showing character literals.

pprHsBytes :: ByteString -> SDoc

Special combinator for showing bytestring literals.

pprFilePathString :: FilePath -> SDoc

Normalise, escape and render a string representing a path

e.g. "c:\whatever"

pprFastFilePath :: FastString -> SDoc

pprDeeperList :: ([SDoc] -> SDoc) -> [SDoc] -> SDoc

Truncate a list that is longer than the current depth.

pprDeeper :: SDoc -> SDoc

pprCode :: LabelStyle -> SDoc -> SDoc

ppWhenOption :: (SDocContext -> Bool) -> SDoc -> SDoc

ppWhen :: Bool -> SDoc -> SDoc

ppUnlessOption :: (SDocContext -> Bool) -> SDoc -> SDoc

ppUnless :: Bool -> SDoc -> SDoc

plural :: [a] -> SDoc

Determines the pluralisation suffix appropriate for the length of a list:

plural [] = char 's'
plural ["Hello"] = empty
plural ["Hello", "World"] = char 's'

parens :: SDoc -> SDoc

neverQualifyPackages :: QueryQualifyPackage

neverQualifyNames :: QueryQualifyName

neverQualifyModules :: QueryQualifyModule

neverQualify :: PrintUnqualified

nest :: Int -> SDoc -> SDoc

Indent SDoc some specified amount

mulArrow :: SDoc -> SDoc

mkUserStyle :: PrintUnqualified -> Depth -> PprStyle

mkErrStyle :: PrintUnqualified -> PprStyle

Style for printing error messages

mkDumpStyle :: PrintUnqualified -> PprStyle

lparen :: SDoc

lollipop :: SDoc

lbrack :: SDoc

lbrace :: SDoc

larrowtt :: SDoc

larrowt :: SDoc

larrow :: SDoc

lambda :: SDoc

keyword :: SDoc -> SDoc

itsOrTheir :: [a] -> SDoc

Determines the form of possessive appropriate for the length of a list:

itsOrTheir [x]   = text "its"
itsOrTheir [x,y] = text "their"
itsOrTheir []    = text "their"  -- probably avoid this

isOrAre :: [a] -> SDoc

Determines the form of to be appropriate for the length of a list:

isOrAre [] = text "are"
isOrAre ["Hello"] = text "is"
isOrAre ["Hello", "World"] = text "are"

isEmpty :: SDocContext -> SDoc -> Bool

interppSP :: Outputable a => [a] -> SDoc

Returns the separated concatenation of the pretty printed things.

interpp'SP' :: (a -> SDoc) -> [a] -> SDoc

interpp'SP :: Outputable a => [a] -> SDoc

Returns the comma-separated concatenation of the pretty printed things.

integer :: Integer -> SDoc

intWithCommas :: Integral a => a -> SDoc

int :: Int -> SDoc

ifPprDebug :: SDoc -> SDoc -> SDoc

Says what to do with and without -dppr-debug

hsep :: [SDoc] -> SDoc

Concatenate SDoc horizontally with a space between each one

hcat :: [SDoc] -> SDoc

Concatenate SDoc horizontally

hangNotEmpty :: SDoc -> Int -> SDoc -> SDoc

This behaves like hang, but does not indent the second document when the header is empty.

hang

Arguments

:: SDoc

The header

-> Int

Amount to indent the hung body

-> SDoc

The hung body, indented and placed below the header

-> SDoc

getPprStyle :: (PprStyle -> SDoc) -> SDoc

getPprDebug :: (Bool -> SDoc) -> SDoc

Indicate if -dppr-debug mode is enabled

ftext :: FastString -> SDoc

fsep :: [SDoc] -> SDoc

A paragraph-fill combinator. It's much like sep, only it keeps fitting things on one line until it can't fit any more.

forAllLit :: SDoc

float :: Float -> SDoc

fcat :: [SDoc] -> SDoc

This behaves like fsep, but it uses <> for horizontal conposition rather than <+>

equals :: SDoc

empty :: SDoc

dumpStyle :: PprStyle -> Bool

doubleQuotes :: SDoc -> SDoc

doublePrec :: Int -> Double -> SDoc

doublePrec p n shows a floating point number n with p digits of precision after the decimal point.

double :: Double -> SDoc

dot :: SDoc

docToSDoc :: Doc -> SDoc

doOrDoes :: [a] -> SDoc

Determines the form of to do appropriate for the length of a list:

doOrDoes [] = text "do"
doOrDoes ["Hello"] = text "does"
doOrDoes ["Hello", "World"] = text "do"

defaultUserStyle :: PprStyle

defaultSDocContext :: SDocContext

Default pretty-printing options

defaultErrStyle :: PprStyle

Default style for error messages, when we don't know PrintUnqualified It's a bit of a hack because it doesn't take into account what's in scope Only used for desugarer warnings, and typechecker errors in interface sigs

defaultDumpStyle :: PprStyle

dcolon :: SDoc

darrow :: SDoc

cparen :: Bool -> SDoc -> SDoc

comma :: SDoc

coloured :: PprColour -> SDoc -> SDoc

Apply the given colour/style for the argument.

Only takes effect if colours are enabled.

colon :: SDoc

codeStyle :: PprStyle -> Bool

cmdlineParserStyle :: PprStyle

char :: Char -> SDoc

cat :: [SDoc] -> SDoc

Catenate: is either like hcat or like vcat, depending on what fits

bullet :: SDoc

bufLeftRenderSDoc :: SDocContext -> BufHandle -> SDoc -> IO ()

An efficient variant of printSDoc specialized for LeftMode that outputs to a BufHandle.

brackets :: SDoc -> SDoc

braces :: SDoc -> SDoc

blankLine :: SDoc

asmStyle :: PprStyle -> Bool

arrowtt :: SDoc

arrowt :: SDoc

arrow :: SDoc

angleBrackets :: SDoc -> SDoc

alwaysQualifyPackages :: QueryQualifyPackage

alwaysQualifyNames :: QueryQualifyName

NB: This won't ever show package IDs

alwaysQualifyModules :: QueryQualifyModule

alwaysQualify :: PrintUnqualified

(<>) :: SDoc -> SDoc -> SDoc

Join two SDoc together horizontally without a gap

(<+>) :: SDoc -> SDoc -> SDoc

Join two SDoc together horizontally with a gap between them

($+$) :: SDoc -> SDoc -> SDoc

Join two SDoc together vertically

($$) :: SDoc -> SDoc -> SDoc

Join two SDoc together vertically; if there is no vertical overlap it "dovetails" the two onto one line

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

Data OccName

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

NFData OccName

Defined in GHC.Types.Name.Occurrence

Methods

rnf :: OccName -> ()

HasOccName OccName

Defined in GHC.Types.Name.Occurrence

Methods

occName :: OccName -> OccName

Uniquable OccName

Defined in GHC.Types.Name.Occurrence

Methods

getUnique :: OccName -> Unique

Binary OccName

Defined in GHC.Types.Name.Occurrence

Methods

put_ :: BinHandle -> OccName -> IO ()

put :: BinHandle -> OccName -> IO (Bin OccName)

get :: BinHandle -> IO OccName

Outputable OccName

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccName -> SDoc

OutputableBndr OccName

Defined in GHC.Types.Name.Occurrence

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

Eq OccName

Defined in GHC.Types.Name.Occurrence

Methods

(==) :: OccName -> OccName -> Bool

(/=) :: OccName -> OccName -> Bool

Ord OccName

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

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

HasOccName IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceClassOp -> OccName

HasOccName IfaceConDecl

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceConDecl -> OccName

HasOccName IfaceDecl

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceDecl -> OccName

HasOccName HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

occName :: HoleFitCandidate -> OccName

HasOccName TcBinder

Defined in GHC.Tc.Types

Methods

occName :: TcBinder -> OccName

HasOccName GreName

Defined in GHC.Types.Avail

Methods

occName :: GreName -> OccName

HasOccName FieldLabel

Defined in GHC.Types.FieldLabel

Methods

occName :: FieldLabel -> OccName

HasOccName Name

Defined in GHC.Types.Name

Methods

occName :: Name -> OccName

HasOccName OccName

Defined in GHC.Types.Name.Occurrence

Methods

occName :: OccName -> OccName

HasOccName GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

occName :: GlobalRdrElt -> OccName

HasOccName RdrName

Defined in GHC.Types.Name.Reader

Methods

occName :: RdrName -> OccName

HasOccName Var

Defined in GHC.Types.Var

Methods

occName :: Var -> OccName

HasOccName name => HasOccName (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

occName :: IEWrappedName name -> OccName

occNameString :: OccName -> String

mkVarOccFS :: FastString -> OccName

mkRecFldSelOcc :: String -> OccName

data PtrString

A PtrString is a pointer to some array of Latin-1 encoded chars.

Constructors

PtrString !(Ptr Word8) !Int

newtype NonDetFastString

Non-deterministic FastString

This is a simple FastString wrapper with an Ord instance using uniqCompareFS (i.e. which compares FastStrings on their Uniques). Hence it is not deterministic from one run to the other.

Constructors

NonDetFastString FastString

Instances

Data NonDetFastString

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonDetFastString -> c NonDetFastString

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NonDetFastString

toConstr :: NonDetFastString -> Constr

dataTypeOf :: NonDetFastString -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NonDetFastString)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NonDetFastString)

gmapT :: (forall b. Data b => b -> b) -> NonDetFastString -> NonDetFastString

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonDetFastString -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonDetFastString -> r

gmapQ :: (forall d. Data d => d -> u) -> NonDetFastString -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NonDetFastString -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString

Show NonDetFastString

Defined in GHC.Data.FastString

Methods

showsPrec :: Int -> NonDetFastString -> ShowS

show :: NonDetFastString -> String

showList :: [NonDetFastString] -> ShowS

Outputable NonDetFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: NonDetFastString -> SDoc

Eq NonDetFastString

Defined in GHC.Data.FastString

Methods

(==) :: NonDetFastString -> NonDetFastString -> Bool

(/=) :: NonDetFastString -> NonDetFastString -> Bool

Ord NonDetFastString

Defined in GHC.Data.FastString

Methods

compare :: NonDetFastString -> NonDetFastString -> Ordering

(<) :: NonDetFastString -> NonDetFastString -> Bool

(<=) :: NonDetFastString -> NonDetFastString -> Bool

(>) :: NonDetFastString -> NonDetFastString -> Bool

(>=) :: NonDetFastString -> NonDetFastString -> Bool

max :: NonDetFastString -> NonDetFastString -> NonDetFastString

min :: NonDetFastString -> NonDetFastString -> NonDetFastString

newtype LexicalFastString

Lexical FastString

This is a simple FastString wrapper with an Ord instance using lexicalCompareFS (i.e. which compares FastStrings on their String representation). Hence it is deterministic from one run to the other.

Constructors

LexicalFastString FastString

Instances

Data LexicalFastString

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LexicalFastString -> c LexicalFastString

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LexicalFastString

toConstr :: LexicalFastString -> Constr

dataTypeOf :: LexicalFastString -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LexicalFastString)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LexicalFastString)

gmapT :: (forall b. Data b => b -> b) -> LexicalFastString -> LexicalFastString

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFastString -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFastString -> r

gmapQ :: (forall d. Data d => d -> u) -> LexicalFastString -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LexicalFastString -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString

Show LexicalFastString

Defined in GHC.Data.FastString

Methods

showsPrec :: Int -> LexicalFastString -> ShowS

show :: LexicalFastString -> String

showList :: [LexicalFastString] -> ShowS

Outputable LexicalFastString

Defined in GHC.Utils.Outputable

Methods

ppr :: LexicalFastString -> SDoc

Eq LexicalFastString

Defined in GHC.Data.FastString

Methods

(==) :: LexicalFastString -> LexicalFastString -> Bool

(/=) :: LexicalFastString -> LexicalFastString -> Bool

Ord LexicalFastString

Defined in GHC.Data.FastString

Methods

compare :: LexicalFastString -> LexicalFastString -> Ordering

(<) :: LexicalFastString -> LexicalFastString -> Bool

(<=) :: LexicalFastString -> LexicalFastString -> Bool

(>) :: LexicalFastString -> LexicalFastString -> Bool

(>=) :: LexicalFastString -> LexicalFastString -> Bool

max :: LexicalFastString -> LexicalFastString -> LexicalFastString

min :: LexicalFastString -> LexicalFastString -> LexicalFastString

data FastZString

Instances

NFData FastZString

Defined in GHC.Data.FastString

Methods

rnf :: FastZString -> ()

data FastString

A FastString is a UTF-8 encoded string together with a unique ID. All FastStrings are stored in a global hashtable to support fast O(1) comparison.

It is also associated with a lazy reference to the Z-encoding of this string which is used by the compiler internally.

Constructors

FastString

Fields

• uniq :: !Int
• n_chars :: !Int
• fs_sbs :: !ShortByteString
• fs_zenc :: FastZString

  Lazily computed Z-encoding of this string. See Note [Z-Encoding] in GHC.Utils.Encoding.

  Since FastStrings are globally memoized this is computed at most once for any given string.

Instances

Data FastString

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FastString -> c FastString

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FastString

toConstr :: FastString -> Constr

dataTypeOf :: FastString -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FastString)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FastString)

gmapT :: (forall b. Data b => b -> b) -> FastString -> FastString

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FastString -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FastString -> r

gmapQ :: (forall d. Data d => d -> u) -> FastString -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FastString -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

IsString FastString

Defined in GHC.Data.FastString

Methods

fromString :: String -> FastString

Monoid FastString

Defined in GHC.Data.FastString

Methods

mempty :: FastString

mappend :: FastString -> FastString -> FastString

mconcat :: [FastString] -> FastString

Semigroup FastString

Defined in GHC.Data.FastString

Methods

(<>) :: FastString -> FastString -> FastString

sconcat :: NonEmpty FastString -> FastString

stimes :: Integral b => b -> FastString -> FastString

Show FastString

Defined in GHC.Data.FastString

Methods

showsPrec :: Int -> FastString -> ShowS

show :: FastString -> String

showList :: [FastString] -> ShowS

NFData FastString

Defined in GHC.Data.FastString

Methods

rnf :: FastString -> ()

Uniquable FastString

Defined in GHC.Types.Unique

Methods

getUnique :: FastString -> Unique

Outputable FastString

Defined in GHC.Utils.Outputable

Methods

ppr :: FastString -> SDoc

Eq FastString

Defined in GHC.Data.FastString

Methods

(==) :: FastString -> FastString -> Bool

(/=) :: FastString -> FastString -> Bool

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

zString :: FastZString -> String

zEncodeFS :: FastString -> FastZString

Returns a Z-encoded version of a FastString. This might be the original, if it was already Z-encoded. The first time this function is applied to a particular FastString, the results are memoized.

unsafeMkByteString :: String -> ByteString

unpackPtrString :: PtrString -> String

Decode a PtrString back into a String using Latin-1 encoding. This does not free the memory associated with PtrString.

unpackFS :: FastString -> String

Unpacks and decodes the FastString

uniqueOfFS :: FastString -> Int

uniqCompareFS :: FastString -> FastString -> Ordering

Compare FastString by their Unique (not lexically).

Much cheaper than lexicalCompareFS but non-deterministic!

unconsFS :: FastString -> Maybe (Char, FastString)

sLit :: String -> PtrString

nullFS :: FastString -> Bool

Returns True if the FastString is empty

nilFS :: FastString

mkPtrString# :: Addr# -> PtrString

Wrap an unboxed address into a PtrString.

mkPtrString :: String -> PtrString

Encode a String into a newly allocated PtrString using Latin-1 encoding. The original string must not contain non-Latin-1 characters (above codepoint 0xff).

mkFastStringShortByteString :: ShortByteString -> FastString

Create a FastString from an existing ShortByteString without copying.

mkFastStringBytes :: Ptr Word8 -> Int -> FastString

mkFastStringByteString :: ByteString -> FastString

Create a FastString by copying an existing ByteString

mkFastStringByteList :: [Word8] -> FastString

Creates a FastString from a UTF-8 encoded [Word8]

mkFastString# :: Addr# -> FastString

mkFastString :: String -> FastString

Creates a UTF-8 encoded FastString from a String

lexicalCompareFS :: FastString -> FastString -> Ordering

Compare FastString lexically

If you don't care about the lexical ordering, use uniqCompareFS instead.

lengthPS :: PtrString -> Int

Return the length of a PtrString

lengthFZS :: FastZString -> Int

lengthFS :: FastString -> Int

Returns the length of the FastString in characters

isUnderscoreFS :: FastString -> Bool

headFS :: FastString -> Char

hPutFZS :: Handle -> FastZString -> IO ()

hPutFS :: Handle -> FastString -> IO ()

Outputs a FastString with no decoding at all, that is, you get the actual bytes in the FastString written to the Handle.

getFastStringZEncCounter :: IO Int

getFastStringTable :: IO [[[FastString]]]

fsLit :: String -> FastString

fastZStringToByteString :: FastZString -> ByteString

fastStringToShortByteString :: FastString -> ShortByteString

fastStringToByteString :: FastString -> ByteString

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

consFS :: Char -> FastString -> FastString

concatFS :: [FastString] -> FastString

bytesFS :: FastString -> ByteString

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

appendFS :: FastString -> FastString -> FastString

data Backend

Code generation backends.

GHC supports several code generation backends serving different purposes (producing machine code, producing ByteCode for the interpreter) and supporting different platforms.

Constructors

NCG

Native code generator backend.

Compiles Cmm code into textual assembler, then relies on an external assembler toolchain to produce machine code.

Only supports a few platforms (X86, PowerPC, SPARC).

See GHC.CmmToAsm.

LLVM

LLVM backend.

Compiles Cmm code into LLVM textual IR, then relies on LLVM toolchain to produce machine code.

It relies on LLVM support for the calling convention used by the NCG backend to produce code objects ABI compatible with it (see "cc 10" or "ghccc" calling convention in https://llvm.org/docs/LangRef.html#calling-conventions).

Support a few platforms (X86, AArch64, s390x, ARM).

See GHC.CmmToLlvm

ViaC

Via-C backend.

Compiles Cmm code into C code, then relies on a C compiler to produce machine code.

It produces code objects that are *not* ABI compatible with those produced by NCG and LLVM backends.

Produced code is expected to be less efficient than the one produced by NCG and LLVM backends because STG registers are not pinned into real registers. On the other hand, it supports more target platforms (those having a valid C toolchain).

See GHC.CmmToC

Interpreter

ByteCode interpreter.

Produce ByteCode objects (BCO, see GHC.ByteCode) that can be interpreted. It is used by GHCi.

Currently some extensions are not supported (foreign primops).

See GHC.StgToByteCode

NoBackend

No code generated.

Use this to disable code generation. It is particularly useful when GHC is used as a library for other purpose than generating code (e.g. to generate documentation with Haddock) or when the user requested it (via -fno-code) for some reason.

Instances

Read Backend

Defined in GHC.Driver.Backend

Methods

readsPrec :: Int -> ReadS Backend

readList :: ReadS [Backend]

readPrec :: ReadPrec Backend

readListPrec :: ReadPrec [Backend]

Show Backend

Defined in GHC.Driver.Backend

Methods

showsPrec :: Int -> Backend -> ShowS

show :: Backend -> String

showList :: [Backend] -> ShowS

Eq Backend

Defined in GHC.Driver.Backend

Methods

(==) :: Backend -> Backend -> Bool

(/=) :: Backend -> Backend -> Bool

Ord Backend

Defined in GHC.Driver.Backend

Methods

compare :: Backend -> Backend -> Ordering

(<) :: Backend -> Backend -> Bool

(<=) :: Backend -> Backend -> Bool

(>) :: Backend -> Backend -> Bool

(>=) :: Backend -> Backend -> Bool

max :: Backend -> Backend -> Backend

min :: Backend -> Backend -> Backend

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

Constructors

DynFlags

Fields

• ghcMode :: GhcMode
• ghcLink :: GhcLink
• backend :: !Backend

  The backend to use (if any).

  Whenever you change the backend, also make sure to set ghcLink to something sensible.

  NoBackend can be used to avoid generating any output, however, note that:

  • If a program uses Template Haskell the typechecker may need to run code from an imported module. To facilitate this, code generation is enabled for modules imported by modules that use template haskell, using the default backend for the platform. See Note [-fno-code mode].
• ghcNameVersion :: !GhcNameVersion
• fileSettings :: !FileSettings
• targetPlatform :: Platform
• toolSettings :: !ToolSettings
• platformMisc :: !PlatformMisc
• rawSettings :: [(String, String)]
• llvmConfig :: LlvmConfig

  N.B. It's important that this field is lazy since we load the LLVM configuration lazily. See Note [LLVM Configuration] in GHC.SysTools.

• verbosity :: Int

  Verbosity level: see Note [Verbosity levels]

• optLevel :: Int

  Optimisation level

• debugLevel :: Int

  How much debug information to produce

• simplPhases :: Int

  Number of simplifier phases

• maxSimplIterations :: Int

  Max simplifier iterations

• ruleCheck :: Maybe String
• inlineCheck :: Maybe String

  A prefix to report inlining decisions about

• strictnessBefore :: [Int]

  Additional demand analysis

• parMakeCount :: Maybe Int

  The number of modules to compile in parallel in --make mode, where Nothing ==> compile as many in parallel as there are CPUs.

• enableTimeStats :: Bool

  Enable RTS timing statistics?

• ghcHeapSize :: Maybe Int

  The heap size to set.

• maxRelevantBinds :: Maybe Int

  Maximum number of bindings from the type envt to show in type error messages

• maxValidHoleFits :: Maybe Int

  Maximum number of hole fits to show in typed hole error messages

• maxRefHoleFits :: Maybe Int

  Maximum number of refinement hole fits to show in typed hole error messages

• refLevelHoleFits :: Maybe Int

  Maximum level of refinement for refinement hole fits in typed hole error messages

• maxUncoveredPatterns :: Int

  Maximum number of unmatched patterns to show in non-exhaustiveness warnings

• maxPmCheckModels :: Int

  Soft limit on the number of models the pattern match checker checks a pattern against. A safe guard against exponential blow-up.

• simplTickFactor :: Int

  Multiplier for simplifier ticks

• specConstrThreshold :: Maybe Int

  Threshold for SpecConstr

• specConstrCount :: Maybe Int

  Max number of specialisations for any one function

• specConstrRecursive :: Int

  Max number of specialisations for recursive types Not optional; otherwise ForceSpecConstr can diverge.

• binBlobThreshold :: Word

  Binary literals (e.g. strings) whose size is above this threshold will be dumped in a binary file by the assembler code generator (0 to disable)

• liberateCaseThreshold :: Maybe Int

  Threshold for LiberateCase

• floatLamArgs :: Maybe Int

  Arg count for lambda floating See FloatOutSwitches

• liftLamsRecArgs :: Maybe Int

  Maximum number of arguments after lambda lifting a recursive function.

• liftLamsNonRecArgs :: Maybe Int

  Maximum number of arguments after lambda lifting a non-recursive function.

• liftLamsKnown :: Bool

  Lambda lift even when this turns a known call into an unknown call.

• cmmProcAlignment :: Maybe Int

  Align Cmm functions at this boundary or use default.

• historySize :: Int

  Simplification history size

• importPaths :: [FilePath]
• mainModuleNameIs :: ModuleName
• mainFunIs :: Maybe String
• reductionDepth :: IntWithInf

  Typechecker maximum stack depth

• solverIterations :: IntWithInf

  Number of iterations in the constraints solver Typically only 1 is needed

• homeUnitId_ :: UnitId

  Target home unit-id

• homeUnitInstanceOf_ :: Maybe UnitId

  Id of the unit to instantiate

• homeUnitInstantiations_ :: [(ModuleName, Module)]

  Module instantiations

• targetWays_ :: Ways

  Target way flags from the command line

• splitInfo :: Maybe (String, Int)
• objectDir :: Maybe String
• dylibInstallName :: Maybe String
• hiDir :: Maybe String
• hieDir :: Maybe String
• stubDir :: Maybe String
• dumpDir :: Maybe String
• objectSuf_ :: String
• hcSuf :: String
• hiSuf_ :: String
• hieSuf :: String
• dynamicTooFailed :: IORef Bool
• dynObjectSuf_ :: String
• dynHiSuf_ :: String
• outputFile_ :: Maybe String
• dynOutputFile_ :: Maybe String
• outputHi :: Maybe String
• dynOutputHi :: Maybe String
• dynLibLoader :: DynLibLoader
• dynamicNow :: !Bool

  Indicate if we are now generating dynamic output because of -dynamic-too. This predicate is used to query the appropriate fields (outputFile/dynOutputFile, ways, etc.)

• dumpPrefix :: Maybe FilePath

  This is set by runPipeline or 'ghc.GHCi.UI.runStmt' based on where its output is going.

• dumpPrefixForce :: Maybe FilePath

  Override the dumpPrefix set by runPipeline or 'ghc.GHCi.UI.runStmt'. Set by -ddump-file-prefix

• ldInputs :: [Option]
• includePaths :: IncludeSpecs
• libraryPaths :: [String]
• frameworkPaths :: [String]
• cmdlineFrameworks :: [String]
• rtsOpts :: Maybe String
• rtsOptsEnabled :: RtsOptsEnabled
• rtsOptsSuggestions :: Bool
• hpcDir :: String

  Path to store the .mix files

• pluginModNames :: [ModuleName]
• pluginModNameOpts :: [(ModuleName, String)]
• frontendPluginOpts :: [String]

  the -ffrontend-opt flags given on the command line, in *reverse* order that they're specified on the command line.

• depMakefile :: FilePath
• depIncludePkgDeps :: Bool
• depIncludeCppDeps :: Bool
• depExcludeMods :: [ModuleName]
• depSuffixes :: [String]
• packageDBFlags :: [PackageDBFlag]

  The -package-db flags given on the command line, In *reverse* order that they're specified on the command line. This is intended to be applied with the list of "initial" package databases derived from GHC_PACKAGE_PATH; see getUnitDbRefs.

• ignorePackageFlags :: [IgnorePackageFlag]

  The -ignore-package flags from the command line. In *reverse* order that they're specified on the command line.

• packageFlags :: [PackageFlag]

  The -package and -hide-package flags from the command-line. In *reverse* order that they're specified on the command line.

• pluginPackageFlags :: [PackageFlag]

  The -plugin-package-id flags from command line. In *reverse* order that they're specified on the command line.

• trustFlags :: [TrustFlag]

  The -trust and -distrust flags. In *reverse* order that they're specified on the command line.

• packageEnv :: Maybe FilePath

  Filepath to the package environment file (if overriding default)

• dumpFlags :: EnumSet DumpFlag
• generalFlags :: EnumSet GeneralFlag
• warningFlags :: EnumSet WarningFlag
• fatalWarningFlags :: EnumSet WarningFlag
• language :: Maybe Language
• safeHaskell :: SafeHaskellMode

  Safe Haskell mode

• safeInfer :: Bool
• safeInferred :: Bool
• thOnLoc :: SrcSpan
• newDerivOnLoc :: SrcSpan
• deriveViaOnLoc :: SrcSpan
• overlapInstLoc :: SrcSpan
• incoherentOnLoc :: SrcSpan
• pkgTrustOnLoc :: SrcSpan
• warnSafeOnLoc :: SrcSpan
• warnUnsafeOnLoc :: SrcSpan
• trustworthyOnLoc :: SrcSpan
• extensions :: [OnOff Extension]
• extensionFlags :: EnumSet Extension
• unfoldingOpts :: !UnfoldingOpts

  Unfolding control See Note [Discounts and thresholds] in GHC.Core.Unfold

• maxWorkerArgs :: Int
• ghciHistSize :: Int
• flushOut :: FlushOut
• flushErr :: FlushErr
• ghcVersionFile :: Maybe FilePath
• haddockOptions :: Maybe String
• ghciScripts :: [String]

  GHCi scripts specified by -ghci-script, in reverse order

• pprUserLength :: Int
• pprCols :: Int
• useUnicode :: Bool
• useColor :: OverridingBool
• canUseColor :: Bool
• colScheme :: Scheme
• profAuto :: ProfAuto

  what kind of {-# SCC #-} to add automatically

• callerCcFilters :: [CallerCcFilter]
• interactivePrint :: Maybe String
• nextWrapperNum :: IORef (ModuleEnv Int)
• sseVersion :: Maybe SseVersion

  Machine dependent flags (-m<blah> stuff)

• bmiVersion :: Maybe BmiVersion
• avx :: Bool
• avx2 :: Bool
• avx512cd :: Bool
• avx512er :: Bool
• avx512f :: Bool
• avx512pf :: Bool
• rtldInfo :: IORef (Maybe LinkerInfo)

  Run-time linker information (what options we need, etc.)

• rtccInfo :: IORef (Maybe CompilerInfo)

  Run-time compiler information

• maxInlineAllocSize :: Int

  Max size, in bytes, of inline array allocations.

• maxInlineMemcpyInsns :: Int

  Only inline memcpy if it generates no more than this many pseudo (roughly: Cmm) instructions.

• maxInlineMemsetInsns :: Int

  Only inline memset if it generates no more than this many pseudo (roughly: Cmm) instructions.

• reverseErrors :: Bool

  Reverse the order of error messages in GHC/GHCi

• maxErrors :: Maybe Int

  Limit the maximum number of errors to show

• initialUnique :: Word

  Unique supply configuration for testing build determinism

• uniqueIncrement :: Int
• cfgWeights :: Weights

  Temporary: CFG Edge weights for fast iterations

type Unit = GenUnit UnitId

type Module = GenModule Unit

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

moduleName :: GenModule unit -> ModuleName

Module name (e.g. A.B.C)

moduleUnit :: GenModule unit -> unit

Unit the module belongs to

pprModule :: Module -> SDoc

data SDocContext

Constructors

SDC

Fields

• sdocStyle :: !PprStyle
• sdocColScheme :: !Scheme
• sdocLastColour :: !PprColour

  The most recently used colour. This allows nesting colours.

• sdocShouldUseColor :: !Bool
• sdocDefaultDepth :: !Int
• sdocLineLength :: !Int
• sdocCanUseUnicode :: !Bool

  True if Unicode encoding is supported and not disable by GHC_NO_UNICODE environment variable

• sdocHexWordLiterals :: !Bool
• sdocPprDebug :: !Bool
• sdocPrintUnicodeSyntax :: !Bool
• sdocPrintCaseAsLet :: !Bool
• sdocPrintTypecheckerElaboration :: !Bool
• sdocPrintAxiomIncomps :: !Bool
• sdocPrintExplicitKinds :: !Bool
• sdocPrintExplicitCoercions :: !Bool
• sdocPrintExplicitRuntimeReps :: !Bool
• sdocPrintExplicitForalls :: !Bool
• sdocPrintPotentialInstances :: !Bool
• sdocPrintEqualityRelations :: !Bool
• sdocSuppressTicks :: !Bool
• sdocSuppressTypeSignatures :: !Bool
• sdocSuppressTypeApplications :: !Bool
• sdocSuppressIdInfo :: !Bool
• sdocSuppressCoercions :: !Bool
• sdocSuppressUnfoldings :: !Bool
• sdocSuppressVarKinds :: !Bool
• sdocSuppressUniques :: !Bool
• sdocSuppressModulePrefixes :: !Bool
• sdocSuppressStgExts :: !Bool
• sdocErrorSpans :: !Bool
• sdocStarIsType :: !Bool
• sdocLinearTypes :: !Bool
• sdocImpredicativeTypes :: !Bool
• sdocPrintTypeAbbreviations :: !Bool
• sdocUnitIdForUser :: !(FastString -> SDoc)

  Used to map UnitIds to more friendly "package-version:component" strings while pretty-printing.

  Use pprWithUnitState to set it. Users should never have to set it to pretty-print SDocs emitted by GHC, otherwise it's a bug. It's an internal field used to thread the UnitState so that the Outputable instance of UnitId can use it.

  See Note [Pretty-printing UnitId] in GHC.Unit for more details.

  Note that we use FastString instead of UnitId to avoid boring module inter-dependency issues.

data SDoc

Represents a pretty-printable document.

To display an SDoc, use printSDoc, printSDocLn, bufLeftRenderSDoc, or renderWithContext. Avoid calling runSDoc directly as it breaks the abstraction layer.

Instances

IsString SDoc

Defined in GHC.Utils.Outputable

Methods

fromString :: String -> SDoc

Outputable SDoc

Defined in GHC.Utils.Outputable

Methods

ppr :: SDoc -> SDoc

OutputableP env SDoc

Defined in GHC.Utils.Outputable

Methods

pdoc :: env -> SDoc -> SDoc

data PprStyle

Constructors

PprUser PrintUnqualified Depth Coloured

PprDump PrintUnqualified

PprCode LabelStyle

Print code; either C or assembler

Instances

Outputable PprStyle

Defined in GHC.Utils.Outputable

Methods

ppr :: PprStyle -> SDoc

text :: String -> SDoc

zipWithAndUnzipM :: Monad m => (a -> b -> m (c, d)) -> [a] -> [b] -> m ([c], [d])

zipWith4M :: Monad m => (a -> b -> c -> d -> m e) -> [a] -> [b] -> [c] -> [d] -> m [e]

zipWith3M_ :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m ()

zipWith3M :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m [d]

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

orM :: Monad m => m Bool -> m Bool -> m Bool

Monadic version of or

maybeMapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap specialised for Maybe

mapSndM :: Monad m => (b -> m c) -> [(a, b)] -> m [(a, c)]

Monadic version of mapSnd

mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]

Applicative version of mapMaybe

mapAndUnzip5M :: Monad m => (a -> m (b, c, d, e, f)) -> [a] -> m ([b], [c], [d], [e], [f])

mapAndUnzip4M :: Monad m => (a -> m (b, c, d, e)) -> [a] -> m ([b], [c], [d], [e])

mapAndUnzip3M :: Monad m => (a -> m (b, c, d)) -> [a] -> m ([b], [c], [d])

mapAndUnzipM for triples

mapAccumLM

Arguments

:: Monad m

=> (acc -> x -> m (acc, y))

combining function

-> acc

initial state

-> [x]

inputs

-> m (acc, [y])

final state, outputs

Monadic version of mapAccumL

liftSndM :: Monad m => (a -> b) -> m (r, a) -> m (r, b)

liftFstM :: Monad m => (a -> b) -> m (a, r) -> m (b, r)

foldlM_ :: (Monad m, Foldable t) => (a -> b -> m a) -> a -> t b -> m ()

Monadic version of foldl that discards its result

fmapMaybeM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap

fmapEitherM :: Monad m => (a -> m b) -> (c -> m d) -> Either a c -> m (Either b d)

Monadic version of fmap

filterOutM :: Applicative m => (a -> m Bool) -> [a] -> m [a]

Like filterM, only it reverses the sense of the test.

concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]

Monadic version of concatMap

anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool

Monadic version of any, aborts the computation at the first True value

allM :: Monad m => (a -> m Bool) -> [a] -> m Bool

Monad version of all, aborts the computation at the first False value

data ModuleName

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

Instances

Data ModuleName

Defined in GHC.Unit.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

Defined in GHC.Unit.Module.Name

Methods

showsPrec :: Int -> ModuleName -> ShowS

show :: ModuleName -> String

showList :: [ModuleName] -> ShowS

NFData ModuleName

Defined in GHC.Unit.Module.Name

Methods

rnf :: ModuleName -> ()

Uniquable ModuleName

Defined in GHC.Unit.Module.Name

Methods

getUnique :: ModuleName -> Unique

Binary ModuleName

Defined in GHC.Unit.Module.Name

Methods

put_ :: BinHandle -> ModuleName -> IO ()

put :: BinHandle -> ModuleName -> IO (Bin ModuleName)

get :: BinHandle -> IO ModuleName

Outputable ModuleName

Defined in GHC.Unit.Module.Name

Methods

ppr :: ModuleName -> SDoc

Eq ModuleName

Defined in GHC.Unit.Module.Name

Methods

(==) :: ModuleName -> ModuleName -> Bool

(/=) :: ModuleName -> ModuleName -> Bool

Ord ModuleName

Defined in GHC.Unit.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

type Anno ModuleName

Defined in GHC.Hs.ImpExp

type Anno ModuleName = SrcSpanAnnA

data StaticPlugin

A static plugin with its arguments. For registering compiled-in plugins through the GHC API.

Constructors

StaticPlugin

Fields

• spPlugin :: PluginWithArgs

  the actual plugin together with its commandline arguments

data LoadedPlugin

A plugin with its arguments. The result of loading the plugin.

Constructors

LoadedPlugin

Fields

• lpPlugin :: PluginWithArgs

  the actual plugin together with its commandline arguments

• lpModule :: ModIface

  the module containing the plugin

type ForeignHValue = ForeignRef HValue

data HValue

Instances

Show HValue

Defined in GHCi.RemoteTypes

Methods

showsPrec :: Int -> HValue -> ShowS

show :: HValue -> String

showList :: [HValue] -> ShowS

data ForeignSrcLang

Foreign formats supported by GHC via TH

Constructors

LangC

C

LangCxx

C++

LangObjc

Objective C

LangObjcxx

Objective C++

LangAsm

Assembly language (.s)

RawObject

Object (.o)

Instances

Generic ForeignSrcLang

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

Defined in GHC.ForeignSrcLang.Type

Methods

showsPrec :: Int -> ForeignSrcLang -> ShowS

show :: ForeignSrcLang -> String

showList :: [ForeignSrcLang] -> ShowS

Eq ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Methods

(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool

(/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool

type Rep ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

type Rep ForeignSrcLang = D1 ('MetaData "ForeignSrcLang" "GHC.ForeignSrcLang.Type" "ghc-boot-th-9.2.4" '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 "RawObject" 'PrefixI 'False) (U1 :: Type -> Type))))

coreModule :: DesugaredMod m => m -> ModGuts

pattern RealSrcLoc' :: RealSrcLoc -> SrcLoc

type TcPluginResult' = TcPluginResult