Development.IDE.GHC.Compat.Core

Compat Core module that handles the GHC module hierarchy re-organisation by re-exporting everything we care about.

This module provides no other compat mechanisms, except for simple backward-compatible pattern synonyms.

Session

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

extensions :: DynFlags -> [OnOff Extension]

extensionFlags :: DynFlags -> EnumSet Extension

targetPlatform :: DynFlags -> Platform

packageFlags :: DynFlags -> [PackageFlag]

The -package and -hide-package flags from the command-line. In *reverse* order that they're specified on the command line.

generalFlags :: DynFlags -> EnumSet GeneralFlag

warningFlags :: DynFlags -> EnumSet WarningFlag

topDir :: DynFlags -> FilePath

hiDir :: DynFlags -> Maybe String

tmpDir :: DynFlags -> String

importPaths :: DynFlags -> [FilePath]

useColor :: DynFlags -> OverridingBool

canUseColor :: DynFlags -> Bool

useUnicode :: DynFlags -> Bool

objectDir :: DynFlags -> Maybe String

flagsForCompletion :: Bool -> [String]

Make a list of flags for shell completion. Filter all available flags into two groups, for interactive GHC vs all other.

setImportPaths :: [FilePath] -> DynFlags -> DynFlags

outputFile :: DynFlags -> Maybe String

pluginModNames :: DynFlags -> [ModuleName]

refLevelHoleFits :: DynFlags -> Maybe Int

Maximum level of refinement for refinement hole fits in typed hole error messages

maxRefHoleFits :: DynFlags -> Maybe Int

Maximum number of refinement hole fits to show in typed hole error messages

maxValidHoleFits :: DynFlags -> Maybe Int

Maximum number of hole fits to show in typed hole error messages

type CommandLineOption = String

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

staticPlugins :: DynFlags -> [StaticPlugin]

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

sPgm_F :: Settings -> String

settings :: DynFlags -> Settings

"unbuild" a Settings from a DynFlags. This shouldn't be needed in the vast majority of code. But GHCi questionably uses this to produce a default DynFlags from which to compute a flags diff for printing.

gopt :: GeneralFlag -> DynFlags -> Bool

Test whether a GeneralFlag is set

gopt_set :: DynFlags -> GeneralFlag -> DynFlags

Set a GeneralFlag

gopt_unset :: DynFlags -> GeneralFlag -> DynFlags

Unset a GeneralFlag

wopt :: WarningFlag -> DynFlags -> Bool

Test whether a WarningFlag is set

wopt_set :: DynFlags -> WarningFlag -> DynFlags

Set a WarningFlag

xFlags :: [FlagSpec Extension]

These -Xblah flags can all be reversed with -XNoblah

xopt :: Extension -> DynFlags -> Bool

Test whether a Extension is set

xopt_unset :: DynFlags -> Extension -> DynFlags

Unset a Extension

xopt_set :: DynFlags -> Extension -> DynFlags

Set a Extension

data FlagSpec flag

Constructors

FlagSpec

Fields

• flagSpecName :: String

  Flag in string form

• flagSpecFlag :: flag

  Flag in internal form

• flagSpecAction :: TurnOnFlag -> DynP ()

  Extra action to run when the flag is found Typically, emit a warning or error

• flagSpecGhcMode :: GhcFlagMode

  In which ghc mode the flag has effect

data WarningFlag

Constructors

Opt_WarnDuplicateExports

Opt_WarnDuplicateConstraints

Opt_WarnRedundantConstraints

Opt_WarnHiShadows

Opt_WarnImplicitPrelude

Opt_WarnIncompletePatterns

Opt_WarnIncompleteUniPatterns

Opt_WarnIncompletePatternsRecUpd

Opt_WarnOverflowedLiterals

Opt_WarnEmptyEnumerations

Opt_WarnMissingFields

Opt_WarnMissingImportList

Opt_WarnMissingMethods

Opt_WarnMissingSignatures

Opt_WarnMissingLocalSignatures

Opt_WarnNameShadowing

Opt_WarnOverlappingPatterns

Opt_WarnTypeDefaults

Opt_WarnMonomorphism

Opt_WarnUnusedTopBinds

Opt_WarnUnusedLocalBinds

Opt_WarnUnusedPatternBinds

Opt_WarnUnusedImports

Opt_WarnUnusedMatches

Opt_WarnUnusedTypePatterns

Opt_WarnUnusedForalls

Opt_WarnUnusedRecordWildcards

Opt_WarnRedundantRecordWildcards

Opt_WarnWarningsDeprecations

Opt_WarnDeprecatedFlags

Opt_WarnMissingMonadFailInstances

Opt_WarnSemigroup

Opt_WarnDodgyExports

Opt_WarnDodgyImports

Opt_WarnOrphans

Opt_WarnAutoOrphans

Opt_WarnIdentities

Opt_WarnTabs

Opt_WarnUnrecognisedPragmas

Opt_WarnDodgyForeignImports

Opt_WarnUnusedDoBind

Opt_WarnWrongDoBind

Opt_WarnAlternativeLayoutRuleTransitional

Opt_WarnUnsafe

Opt_WarnSafe

Opt_WarnTrustworthySafe

Opt_WarnMissedSpecs

Opt_WarnAllMissedSpecs

Opt_WarnUnsupportedCallingConventions

Opt_WarnUnsupportedLlvmVersion

Opt_WarnMissedExtraSharedLib

Opt_WarnInlineRuleShadowing

Opt_WarnTypedHoles

Opt_WarnPartialTypeSignatures

Opt_WarnMissingExportedSignatures

Opt_WarnUntickedPromotedConstructors

Opt_WarnDerivingTypeable

Opt_WarnDeferredTypeErrors

Opt_WarnDeferredOutOfScopeVariables

Opt_WarnNonCanonicalMonadInstances

Opt_WarnNonCanonicalMonadFailInstances

Opt_WarnNonCanonicalMonoidInstances

Opt_WarnMissingPatternSynonymSignatures

Opt_WarnUnrecognisedWarningFlags

Opt_WarnSimplifiableClassConstraints

Opt_WarnCPPUndef

Opt_WarnUnbangedStrictPatterns

Opt_WarnMissingHomeModules

Opt_WarnPartialFields

Opt_WarnMissingExportList

Opt_WarnInaccessibleCode

Opt_WarnStarIsType

Opt_WarnStarBinder

Opt_WarnImplicitKindVars

Opt_WarnSpaceAfterBang

Opt_WarnMissingDerivingStrategies

Opt_WarnPrepositiveQualifiedModule

Opt_WarnUnusedPackages

Opt_WarnInferredSafeImports

Opt_WarnMissingSafeHaskellMode

Opt_WarnCompatUnqualifiedImports

Opt_WarnDerivingDefaults

Instances

Enum WarningFlag

Defined in DynFlags

Methods

succ :: WarningFlag -> WarningFlag

pred :: WarningFlag -> WarningFlag

toEnum :: Int -> WarningFlag

fromEnum :: WarningFlag -> Int

enumFrom :: WarningFlag -> [WarningFlag]

enumFromThen :: WarningFlag -> WarningFlag -> [WarningFlag]

enumFromTo :: WarningFlag -> WarningFlag -> [WarningFlag]

enumFromThenTo :: WarningFlag -> WarningFlag -> WarningFlag -> [WarningFlag]

Eq WarningFlag

Defined in DynFlags

Methods

(==) :: WarningFlag -> WarningFlag -> Bool

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

Show WarningFlag

Defined in DynFlags

Methods

showsPrec :: Int -> WarningFlag -> ShowS

show :: WarningFlag -> String

showList :: [WarningFlag] -> ShowS

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_DoStgLinting

Opt_DoCmmLinting

Opt_DoAsmLinting

Opt_DoAnnotationLinting

Opt_NoLlvmMangler

Opt_FastLlvm

Opt_NoTypeableBinds

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

Opt_AsmShortcutting

Opt_OmitYields

Opt_FunToThunk

Opt_DictsStrict

Opt_DmdTxDictSel

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_SccProfilingOn

Opt_Ticky

Opt_Ticky_Allocd

Opt_Ticky_LNE

Opt_Ticky_Dyn_Thunk

Opt_RPath

Opt_RelativeDynlibPaths

Opt_Hpc

Opt_FlatCache

Opt_ExternalInterpreter

Opt_OptimalApplicativeDo

Opt_VersionMacros

Opt_WholeArchiveHsLibs

Opt_SingleLibFolder

Opt_KeepCAFs

Opt_KeepGoing

Opt_ByteCode

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 DynFlags

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]

Eq GeneralFlag

Defined in DynFlags

Methods

(==) :: GeneralFlag -> GeneralFlag -> Bool

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

Show GeneralFlag

Defined in DynFlags

Methods

showsPrec :: Int -> GeneralFlag -> ShowS

show :: GeneralFlag -> String

showList :: [GeneralFlag] -> ShowS

data PackageFlag

Flags for manipulating packages visibility.

Instances

Eq PackageFlag

Defined in DynFlags

Methods

(==) :: PackageFlag -> PackageFlag -> Bool

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

Show PackageFlag

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> PackageFlag -> ShowS

show :: PackageFlag -> String

showList :: [PackageFlag] -> ShowS

Outputable PackageFlag

Defined in DynFlags

Methods

ppr :: PackageFlag -> SDoc

pprPrec :: Rational -> PackageFlag -> SDoc

data PackageArg

We accept flags which make packages visible, but how they select the package varies; this data type reflects what selection criterion is used.

Constructors

PackageArg String

-package, by PackageName

UnitIdArg UnitId

-package-id, by UnitId

Instances

Eq PackageArg

Defined in DynFlags

Methods

(==) :: PackageArg -> PackageArg -> Bool

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

Show PackageArg

Defined in DynFlags

Methods

showsPrec :: Int -> PackageArg -> ShowS

show :: PackageArg -> String

showList :: [PackageArg] -> ShowS

Outputable PackageArg

Defined in DynFlags

Methods

ppr :: PackageArg -> SDoc

pprPrec :: Rational -> PackageArg -> SDoc

data ModRenaming

Represents the renaming that may be associated with an exposed package, e.g. the rns part of -package "foo (rns)".

Here are some example parsings of the package flags (where a string literal is punned to be a ModuleName:

• -package foo is ModRenaming True []
• -package foo () is ModRenaming False []
• -package foo (A) is ModRenaming False [(A, A)]
• -package foo (A as B) is ModRenaming False [(A, B)]
• -package foo with (A as B) is ModRenaming True [(A, B)]

Constructors

ModRenaming

Fields

• modRenamingWithImplicit :: Bool

  Bring all exposed modules into scope?

• modRenamings :: [(ModuleName, ModuleName)]

  Bring module m into scope under name n.

Instances

Eq ModRenaming

Defined in DynFlags

Methods

(==) :: ModRenaming -> ModRenaming -> Bool

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

Outputable ModRenaming

Defined in DynFlags

Methods

ppr :: ModRenaming -> SDoc

pprPrec :: Rational -> ModRenaming -> SDoc

pattern ExposePackage :: String -> PackageArg -> ModRenaming -> PackageFlag

parseDynamicFlagsCmdLine

Arguments

:: MonadIO m

=> DynFlags

-> [Located String]

-> m (DynFlags, [Located String], [Warn])

Updated DynFlags, left-over arguments, and list of warnings.

Parse dynamic flags from a list of command line arguments. Returns the parsed DynFlags, the left-over arguments, and a list of warnings. Throws a UsageError if errors occurred during parsing (such as unknown flags or missing arguments).

parseDynamicFilePragma

Arguments

:: MonadIO m

=> DynFlags

-> [Located String]

-> m (DynFlags, [Located String], [Warn])

Updated DynFlags, left-over arguments, and list of warnings.

Like parseDynamicFlagsCmdLine but does not allow the package flags (-package, -hide-package, -ignore-package, -hide-all-packages, -package-db). Used to parse flags set in a modules pragma.

data WarnReason

Used when outputting warnings: if a reason is given, it is displayed. If a warning isn't controlled by a flag, this is made explicit at the point of use.

Constructors

NoReason

Reason !WarningFlag

Warning was enabled with the flag

ErrReason !(Maybe WarningFlag)

Warning was made an error because of -Werror or -Werror=WarningFlag

Instances

Show WarnReason

Defined in DynFlags

Methods

showsPrec :: Int -> WarnReason -> ShowS

show :: WarnReason -> String

showList :: [WarnReason] -> ShowS

ToJson WarnReason

Defined in DynFlags

Methods

json :: WarnReason -> JsonDoc

Outputable WarnReason

Defined in DynFlags

Methods

ppr :: WarnReason -> SDoc

pprPrec :: Rational -> WarnReason -> SDoc

wWarningFlags :: [FlagSpec WarningFlag]

These -W<blah> flags can all be reversed with -Wno-<blah>

updOptLevel :: Int -> DynFlags -> DynFlags

Sets the DynFlags to be appropriate to the optimisation level

setUnsafeGlobalDynFlags :: DynFlags -> IO ()

Linear Haskell

type Scaled a = a

scaledThing :: Scaled a -> a

Interface Files

type IfaceExport = AvailInfo

The original names declared of a certain module that are exported

data IfaceTyCon

Constructors

IfaceTyCon

Fields

• ifaceTyConName :: IfExtName
• ifaceTyConInfo :: IfaceTyConInfo

Instances

Eq IfaceTyCon

Defined in IfaceType

Methods

(==) :: IfaceTyCon -> IfaceTyCon -> Bool

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

NFData IfaceTyCon

Defined in IfaceType

Methods

rnf :: IfaceTyCon -> ()

Binary IfaceTyCon

Defined in IfaceType

Methods

put_ :: BinHandle -> IfaceTyCon -> IO ()

put :: BinHandle -> IfaceTyCon -> IO (Bin IfaceTyCon)

get :: BinHandle -> IO IfaceTyCon

Outputable IfaceTyCon

Defined in IfaceType

Methods

ppr :: IfaceTyCon -> SDoc

pprPrec :: Rational -> IfaceTyCon -> SDoc

type ModIface = ModIface_ 'ModIfaceFinal

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 [RnNames . Trust Own Package]

• mi_complete_sigs :: [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.

Instances

Binary ModIface

Defined in HscTypes

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 HscTypes

Methods

rnf :: ModIface_ phase -> ()

data HscSource

Constructors

HsSrcFile

HsBootFile

HsigFile

Instances

Eq HscSource

Defined in DriverPhases

Methods

(==) :: HscSource -> HscSource -> Bool

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

Ord HscSource

Defined in DriverPhases

Methods

compare :: HscSource -> HscSource -> Ordering

(<) :: HscSource -> HscSource -> Bool

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

(>) :: HscSource -> HscSource -> Bool

(>=) :: HscSource -> HscSource -> Bool

max :: HscSource -> HscSource -> HscSource

min :: HscSource -> HscSource -> HscSource

Show HscSource

Defined in DriverPhases

Methods

showsPrec :: Int -> HscSource -> ShowS

show :: HscSource -> String

showList :: [HscSource] -> ShowS

Binary HscSource

Defined in DriverPhases

Methods

put_ :: BinHandle -> HscSource -> IO ()

put :: BinHandle -> HscSource -> IO (Bin HscSource)

get :: BinHandle -> IO HscSource

data WhereFrom

Constructors

ImportByUser IsBootInterface

ImportBySystem

ImportByPlugin

Instances

Outputable WhereFrom

Defined in TcRnTypes

Methods

ppr :: WhereFrom -> SDoc

pprPrec :: Rational -> WhereFrom -> SDoc

loadInterface :: SDoc -> Module -> WhereFrom -> IfM lcl (MaybeErr MsgDoc ModIface)

data SourceModified

Indicates whether a given module's source has been modified since it was last compiled.

Constructors

SourceModified

the source has been modified

SourceUnmodified

the source has not been modified. Compilation may or may not be necessary, depending on whether any dependencies have changed since we last compiled.

SourceUnmodifiedAndStable

the source has not been modified, and furthermore all of its (transitive) dependencies are up to date; it definitely does not need to be recompiled. This is important for two reasons: (a) we can omit the version check in checkOldIface, and (b) if the module used TH splices we don't need to force recompilation.

Instances

Eq SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

(==) :: SourceModified -> SourceModified -> Bool

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

Show SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> SourceModified -> ShowS

show :: SourceModified -> String

showList :: [SourceModified] -> ShowS

NFData SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SourceModified -> ()

loadModuleInterface :: SDoc -> Module -> TcM ModIface

Load interface directly for a fully qualified Module. (This is a fairly rare operation, but in particular it is used to load orphan modules in order to pull their instances into the global package table and to handle some operations in GHCi).

data RecompileRequired

Constructors

UpToDate

everything is up to date, recompilation is not required

MustCompile

The .hs file has been touched, or the .o/.hi file does not exist

RecompBecause String

The .o/.hi files are up to date, but something else has changed to force recompilation; the String says what (one-line summary)

Instances

Eq RecompileRequired

Defined in MkIface

Methods

(==) :: RecompileRequired -> RecompileRequired -> Bool

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

Semigroup RecompileRequired

Defined in MkIface

Methods

(<>) :: RecompileRequired -> RecompileRequired -> RecompileRequired

sconcat :: NonEmpty RecompileRequired -> RecompileRequired

stimes :: Integral b => b -> RecompileRequired -> RecompileRequired

Monoid RecompileRequired

Defined in MkIface

Methods

mempty :: RecompileRequired

mappend :: RecompileRequired -> RecompileRequired -> RecompileRequired

mconcat :: [RecompileRequired] -> RecompileRequired

mkPartialIface :: HscEnv -> ModDetails -> ModGuts -> PartialModIface

mkFullIface :: HscEnv -> PartialModIface -> IO ModIface

Fully instantiate a interface Adds fingerprints and potentially code generator produced information.

checkOldIface :: HscEnv -> ModSummary -> SourceModified -> Maybe ModIface -> IO (RecompileRequired, Maybe ModIface)

Top level function to check if the version of an old interface file is equivalent to the current source file the user asked us to compile. If the same, we can avoid recompilation. We return a tuple where the first element is a bool saying if we should recompile the object file and the second is maybe the interface file, where Nothing means to rebuild the interface file and not use the existing one.

pattern IsBoot :: IsBootInterface

pattern NotBoot :: IsBootInterface

Fixity

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

Eq LexicalFixity

Defined in BasicTypes

Methods

(==) :: LexicalFixity -> LexicalFixity -> Bool

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

Data LexicalFixity

Defined in BasicTypes

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 BasicTypes

Methods

ppr :: LexicalFixity -> SDoc

pprPrec :: Rational -> LexicalFixity -> SDoc

ModSummary

data ModSummary

A single node in a ModuleGraph. The 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 or hs-boot

• 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

Show ModSummary

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModSummary -> ShowS

show :: ModSummary -> String

showList :: [ModSummary] -> ShowS

NFData ModSummary

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModSummary -> ()

Outputable ModSummary

Defined in HscTypes

Methods

ppr :: ModSummary -> SDoc

pprPrec :: Rational -> ModSummary -> SDoc

HomeModInfo

data HomeModInfo

Information about modules in the package being compiled

Constructors

HomeModInfo

Fields

• hm_iface :: !ModIface

  The basic loaded interface file: every loaded module has one of these, even if it is imported from another package

• hm_details :: !ModDetails

  Extra information that has been created from the ModIface for the module, typically during typechecking

• hm_linkable :: !(Maybe Linkable)

  The actual artifact we would like to link to access things in this module.

  hm_linkable might be Nothing:

  1. If this is an .hs-boot module
  2. Temporarily during compilation if we pruned away the old linkable because it was out of date.

  After a complete compilation (load), all hm_linkable fields in the HomePackageTable will be Just.

  When re-linking a module (HscNoRecomp), we construct the HomeModInfo by building a new ModDetails from the old ModIface (only).

ModGuts

data ModGuts

A ModGuts is carried through the compiler, accumulating stuff as it goes There is only one ModGuts at any time, the one for the module being compiled right now. Once it is compiled, a ModIface and ModDetails are extracted and the ModGuts is discarded.

Constructors

ModGuts

Fields

• mg_module :: !Module

  Module being compiled

• mg_hsc_src :: HscSource

  Whether it's an hs-boot module

• mg_loc :: SrcSpan

  For error messages from inner passes

• mg_exports :: ![AvailInfo]

  What it exports

• mg_deps :: !Dependencies

  What it depends on, directly or otherwise

• mg_usages :: ![Usage]

  What was used? Used for interfaces.

• mg_used_th :: !Bool

  Did we run a TH splice?

• mg_rdr_env :: !GlobalRdrEnv

  Top-level lexical environment

• mg_fix_env :: !FixityEnv

  Fixities declared in this module. Used for creating interface files.

• mg_tcs :: ![TyCon]

  TyCons declared in this module (includes TyCons for classes)

• mg_insts :: ![ClsInst]

  Class instances declared in this module

• mg_fam_insts :: ![FamInst]

  Family instances declared in this module

• mg_patsyns :: ![PatSyn]

  Pattern synonyms declared in this module

• mg_rules :: ![CoreRule]

  Before the core pipeline starts, contains See Note [Overall plumbing for rules] in Rules.hs

• mg_binds :: !CoreProgram

  Bindings for this module

• mg_foreign :: !ForeignStubs

  Foreign exports declared in this module

• mg_foreign_files :: ![(ForeignSrcLang, FilePath)]

  Files to be compiled with the C compiler

• mg_warns :: !Warnings

  Warnings declared in the module

• mg_anns :: [Annotation]

  Annotations declared in this module

• mg_complete_sigs :: [CompleteMatch]

  Complete Matches

• mg_hpc_info :: !HpcInfo

  Coverage tick boxes in the module

• mg_modBreaks :: !(Maybe ModBreaks)

  Breakpoints for the module

• mg_inst_env :: InstEnv

  Class instance environment for home-package modules (including this one); c.f. tcg_inst_env

• mg_fam_inst_env :: FamInstEnv

  Type-family instance environment for home-package modules (including this one); c.f. tcg_fam_inst_env

• mg_safe_haskell :: SafeHaskellMode

  Safe Haskell mode

• mg_trust_pkg :: Bool

  Do we need to trust our own package for Safe Haskell? See Note [RnNames . Trust Own Package]

• mg_doc_hdr :: !(Maybe HsDocString)

  Module header.

• mg_decl_docs :: !DeclDocMap

  Docs on declarations.

• mg_arg_docs :: !ArgDocMap

  Docs on arguments.

Instances

Show ModGuts

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModGuts -> ShowS

show :: ModGuts -> String

showList :: [ModGuts] -> ShowS

NFData ModGuts

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModGuts -> ()

data CgGuts

A restricted form of ModGuts for code generation purposes

Constructors

CgGuts

Fields

• cg_module :: !Module

  Module being compiled

• cg_tycons :: [TyCon]

  Algebraic data types (including ones that started life as classes); generate constructors and info tables. Includes newtypes, just for the benefit of External Core

• cg_binds :: CoreProgram

  The tidied main bindings, including previously-implicit bindings for record and class selectors, and data constructor wrappers. But *not* data constructor workers; reason: we regard them as part of the code-gen of tycons

• cg_foreign :: !ForeignStubs

  Foreign export stubs

• cg_foreign_files :: ![(ForeignSrcLang, FilePath)]
• cg_dep_pkgs :: ![InstalledUnitId]

  Dependent packages, used to generate #includes for C code gen

• cg_hpc_info :: !HpcInfo

  Program coverage tick box information

• cg_modBreaks :: !(Maybe ModBreaks)

  Module breakpoints

• cg_spt_entries :: [SptEntry]

  Static pointer table entries for static forms defined in the module. See Note [Grand plan for static forms] in StaticPtrTable

Instances

Show CgGuts

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> CgGuts -> ShowS

show :: CgGuts -> String

showList :: [CgGuts] -> ShowS

NFData CgGuts

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: CgGuts -> ()

ModDetails

data ModDetails

The ModDetails is essentially a cache for information in the ModIface for home modules only. Information relating to packages will be loaded into global environments in ExternalPackageState.

Constructors

ModDetails

Fields

• md_exports :: [AvailInfo]
• md_types :: !TypeEnv

  Local type environment for this particular module Includes Ids, TyCons, PatSyns

• md_insts :: ![ClsInst]

  DFunIds for the instances in this module

• md_fam_insts :: ![FamInst]
• md_rules :: ![CoreRule]

  Domain may include Ids from other modules

• md_anns :: ![Annotation]

  Annotations present in this module: currently they only annotate things also declared in this module

• md_complete_sigs :: [CompleteMatch]

  Complete match pragmas for this module

Instances

Show ModDetails

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModDetails -> ShowS

show :: ModDetails -> String

showList :: [ModDetails] -> ShowS

NFData ModDetails

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModDetails -> ()

Var

data Type

Constructors

TyVarTy Var

Vanilla type or kind variable (*never* a coercion variable)

AppTy Type Type

Type application to something other than a TyCon. Parameters:

1) Function: must not be a TyConApp or CastTy, must be another AppTy, or TyVarTy See Note Respecting definitional equality about the no CastTy requirement

2) Argument type

TyConApp TyCon [KindOrType]

Application of a TyCon, including newtypes and synonyms. Invariant: saturated applications of FunTyCon must use FunTy and saturated synonyms must use their own constructors. However, unsaturated FunTyCons do appear as TyConApps. Parameters:

1) Type constructor being applied to.

2) Type arguments. Might not have enough type arguments here to saturate the constructor. Even type synonyms are not necessarily saturated; for example unsaturated type synonyms can appear as the right hand side of a type synonym.

ForAllTy !TyCoVarBinder Type

A Π type.

LitTy TyLit

Type literals are similar to type constructors.

CastTy Type KindCoercion

A kind cast. The coercion is always nominal. INVARIANT: The cast is never refl. INVARIANT: The Type is not a CastTy (use TransCo instead) See Note Respecting definitional equality and (EQ3)

CoercionTy Coercion

Injection of a Coercion into a type This should only ever be used in the RHS of an AppTy, in the list of a TyConApp, when applying a promoted GADT data constructor

Instances

Data Type

Defined in TyCoRep

Methods

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

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

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

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

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

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

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

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

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

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

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

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

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

NFData Type

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Type -> ()

Outputable Type

Defined in TyCoRep

Methods

ppr :: Type -> SDoc

pprPrec :: Rational -> Type -> SDoc

Eq (DeBruijn Type)

Defined in CoreMap

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

ToHie (TScoped Type)

Defined in Compat.HieAst

Methods

toHie :: TScoped Type -> HieM [HieAST Type]

pattern FunTy :: Type -> Type -> Type

splitForAllTyCoVars :: Type -> ([TyCoVar], Type)

mkVisFunTys :: [Scaled Type] -> Type -> Type

mkInfForAllTys :: [TyVar] -> Type -> Type

Specs

data ImpDeclSpec

Import Declaration Specification

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

Constructors

ImpDeclSpec

Fields

• is_mod :: ModuleName

  Module imported, e.g. import Muggle Note the Muggle may well not be the defining module for this thing!

• is_as :: ModuleName

  Import alias, e.g. from as M (or Muggle if there is no as clause)

• is_qual :: Bool

  Was this import qualified?

• is_dloc :: SrcSpan

  The location of the entire import declaration

Instances

Eq ImpDeclSpec

Defined in RdrName

Methods

(==) :: ImpDeclSpec -> ImpDeclSpec -> Bool

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

Data ImpDeclSpec

Defined in RdrName

Methods

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

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

toConstr :: ImpDeclSpec -> Constr

dataTypeOf :: ImpDeclSpec -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ImpDeclSpec

Defined in RdrName

Methods

compare :: ImpDeclSpec -> ImpDeclSpec -> Ordering

(<) :: ImpDeclSpec -> ImpDeclSpec -> Bool

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

(>) :: ImpDeclSpec -> ImpDeclSpec -> Bool

(>=) :: ImpDeclSpec -> ImpDeclSpec -> Bool

max :: ImpDeclSpec -> ImpDeclSpec -> ImpDeclSpec

min :: ImpDeclSpec -> ImpDeclSpec -> ImpDeclSpec

data ImportSpec

Import Specification

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

Constructors

ImpSpec

Fields

• is_decl :: ImpDeclSpec
• is_item :: ImpItemSpec

Instances

Eq ImportSpec

Defined in RdrName

Methods

(==) :: ImportSpec -> ImportSpec -> Bool

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

Data ImportSpec

Defined in RdrName

Methods

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

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

toConstr :: ImportSpec -> Constr

dataTypeOf :: ImportSpec -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ImportSpec

Defined in RdrName

Methods

compare :: ImportSpec -> ImportSpec -> Ordering

(<) :: ImportSpec -> ImportSpec -> Bool

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

(>) :: ImportSpec -> ImportSpec -> Bool

(>=) :: ImportSpec -> ImportSpec -> Bool

max :: ImportSpec -> ImportSpec -> ImportSpec

min :: ImportSpec -> ImportSpec -> ImportSpec

Outputable ImportSpec

Defined in RdrName

Methods

ppr :: ImportSpec -> SDoc

pprPrec :: Rational -> ImportSpec -> SDoc

SourceText

data SourceText

Constructors

SourceText String

NoSourceText

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

Instances

Eq SourceText

Defined in BasicTypes

Methods

(==) :: SourceText -> SourceText -> Bool

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

Data SourceText

Defined in BasicTypes

Methods

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

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

toConstr :: SourceText -> Constr

dataTypeOf :: SourceText -> DataType

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

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

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

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

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

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

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

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

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

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

Show SourceText

Defined in BasicTypes

Methods

showsPrec :: Int -> SourceText -> ShowS

show :: SourceText -> String

showList :: [SourceText] -> ShowS

Outputable SourceText

Defined in BasicTypes

Methods

ppr :: SourceText -> SDoc

pprPrec :: Rational -> SourceText -> SDoc

Annotate (SourceText, FastString)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> (SourceText, FastString) -> Annotated ()

Name

tyThingParent_maybe :: TyThing -> Maybe TyThing

tyThingParent_maybe x returns (Just p) when pprTyThingInContext should print a declaration for p (albeit with some "..." in it) when asked to show x It returns the *immediate* parent. So a datacon returns its tycon but the tycon could be the associated type of a class, so it in turn might have a parent.

Ways

data Way

Instances

Eq Way

Defined in DynFlags

Methods

(==) :: Way -> Way -> Bool

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

Ord Way

Defined in DynFlags

Methods

compare :: Way -> Way -> Ordering

(<) :: Way -> Way -> Bool

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

(>) :: Way -> Way -> Bool

(>=) :: Way -> Way -> Bool

max :: Way -> Way -> Way

min :: Way -> Way -> Way

Show Way

Defined in DynFlags

Methods

showsPrec :: Int -> Way -> ShowS

show :: Way -> String

showList :: [Way] -> ShowS

wayGeneralFlags :: Platform -> Way -> [GeneralFlag]

wayUnsetGeneralFlags :: Platform -> Way -> [GeneralFlag]

AvailInfo

data AvailInfo

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

Instances

Eq AvailInfo

Used when deciding if the interface has changed

Defined in Avail

Methods

(==) :: AvailInfo -> AvailInfo -> Bool

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

Data AvailInfo

Defined in Avail

Methods

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

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

toConstr :: AvailInfo -> Constr

dataTypeOf :: AvailInfo -> DataType

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

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

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

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

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

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

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

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

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

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

Binary AvailInfo

Defined in Avail

Methods

put_ :: BinHandle -> AvailInfo -> IO ()

put :: BinHandle -> AvailInfo -> IO (Bin AvailInfo)

get :: BinHandle -> IO AvailInfo

Outputable AvailInfo

Defined in Avail

Methods

ppr :: AvailInfo -> SDoc

pprPrec :: Rational -> AvailInfo -> SDoc

pattern AvailName :: Name -> AvailInfo

pattern AvailFL :: FieldLabel -> AvailInfo

pattern AvailTC :: Name -> [Name] -> [FieldLabel] -> AvailInfo

availName :: AvailInfo -> Name

Just the main name made available, i.e. not the available pieces of type or class brought into scope by the GenAvailInfo

availNames :: AvailInfo -> [Name]

All names made available by the availability information (excluding overloaded selectors)

availNamesWithSelectors :: AvailInfo -> [Name]

All names made available by the availability information (including overloaded selectors)

availsToNameSet :: [AvailInfo] -> NameSet

TcGblEnv

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 HscTypes

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

• 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 HscMain) - To create the Dependencies field in interface (mkDependencies)

• tcg_dus :: DefUses
• tcg_used_gres :: TcRef [GlobalRdrElt]
• tcg_keep :: TcRef NameSet
• tcg_th_used :: TcRef Bool

  True = Template Haskell syntax used.

  We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.

• tcg_th_splice_used :: TcRef Bool

  True = A Template Haskell splice was used.

  Splices disable recompilation avoidance (see #481)

• tcg_th_top_level_locs :: TcRef (Set RealSrcSpan)

  Locations of the top-level splices; used for providing details on scope in error messages for out-of-scope variables

• 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 [(Located (IE 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_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_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 :: [CompleteMatch]

  Tracking indices for cost centre annotations

• tcg_cc_st :: TcRef CostCentreState

Instances

ContainsCostCentreState TcGblEnv

Defined in TcRnMonad

Methods

extractCostCentreState :: TcGblEnv -> TcRef CostCentreState

ContainsModule TcGblEnv

Defined in TcRnTypes

Methods

extractModule :: TcGblEnv -> Module

Parsing and LExer types

data HsParsedModule

Constructors

HsParsedModule

Fields

• hpm_module :: Located (HsModule GhcPs)
• 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)

• hpm_annotations :: ApiAnns

data ParsedModule

The result of successful parsing.

Constructors

ParsedModule

Fields

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

Instances

Show ParsedModule

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ParsedModule -> ShowS

show :: ParsedModule -> String

showList :: [ParsedModule] -> ShowS

NFData ParsedModule

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ParsedModule -> ()

ParsedMod ParsedModule

Defined in GHC

Methods

modSummary :: ParsedModule -> ModSummary

parsedSource :: ParsedModule -> ParsedSource

type ParsedSource = Located (HsModule GhcPs)

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

Compilation Main

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.

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.

unGhc :: Ghc a -> Session -> IO a

data Session

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

Constructors

Session !(IORef HscEnv)

modifySession :: GhcMonad m => (HscEnv -> HscEnv) -> m ()

Set the current session to the result of applying the current session to the argument.

getSession :: GhcMonad m => m HscEnv

setSessionDynFlags :: GhcMonad m => DynFlags -> m [InstalledUnitId]

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

Returns a list of new packages that may need to be linked in using the dynamic linker (see linkPackages) as a result of new package flags. If you are not doing linking or doing static linking, you can ignore the list of packages returned.

getSessionDynFlags :: GhcMonad m => m DynFlags

Grabs the DynFlags from the Session

class (Functor m, MonadIO m, ExceptionMonad m, HasDynFlags m) => GhcMonad (m :: Type -> Type)

A monad that has all the features needed by GHC API calls.

In short, a GHC monad

• allows embedding of IO actions,
• can log warnings,
• allows handling of (extensible) exceptions, and
• maintains a current session.

If you do not use Ghc or GhcT, make sure to call initGhcMonad before any call to the GHC API functions can occur.

Minimal complete definition

getSession, setSession

Instances

GhcMonad Ghc

Defined in GhcMonad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

ExceptionMonad m => GhcMonad (GhcT m)

Defined in GhcMonad

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

Monad Ghc

Defined in GhcMonad

Methods

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

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

return :: a -> Ghc a

Functor Ghc

Defined in GhcMonad

Methods

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

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

MonadFix Ghc

Defined in GhcMonad

Methods

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

Applicative Ghc

Defined in GhcMonad

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

MonadIO Ghc

Defined in GhcMonad

Methods

liftIO :: IO a -> Ghc a

GhcMonad Ghc

Defined in GhcMonad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

HasDynFlags Ghc

Defined in GhcMonad

Methods

getDynFlags :: Ghc DynFlags

ExceptionMonad Ghc

Defined in GhcMonad

Methods

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

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

gbracket :: Ghc a -> (a -> Ghc b) -> (a -> Ghc c) -> Ghc c

gfinally :: Ghc a -> Ghc b -> Ghc a

runHsc :: HscEnv -> Hsc a -> IO a

compileFile :: HscEnv -> Phase -> (FilePath, Maybe Phase) -> IO FilePath

data Phase

Constructors

Unlit HscSource

Cpp HscSource

HsPp HscSource

Hsc HscSource

Ccxx

Cc

Cobjc

Cobjcxx

HCc

As Bool

LlvmOpt

LlvmLlc

LlvmMangle

CmmCpp

Cmm

MergeForeign

StopLn

Instances

Eq Phase

Defined in DriverPhases

Methods

(==) :: Phase -> Phase -> Bool

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

Show Phase

Defined in DriverPhases

Methods

showsPrec :: Int -> Phase -> ShowS

show :: Phase -> String

showList :: [Phase] -> ShowS

Outputable Phase

Defined in DriverPhases

Methods

ppr :: Phase -> SDoc

pprPrec :: Rational -> Phase -> SDoc

hscDesugar :: HscEnv -> ModSummary -> TcGblEnv -> IO ModGuts

Convert a typechecked module to Core

hscGenHardCode

Arguments

:: HscEnv

-> CgGuts

-> ModLocation

-> FilePath

-> IO (FilePath, Maybe FilePath, [(ForeignSrcLang, FilePath)])

Just f = _stub.c is f

Compile to hard-code.

hscInteractive :: HscEnv -> CgGuts -> ModLocation -> IO (Maybe FilePath, CompiledByteCode, [SptEntry])

hscSimplify :: HscEnv -> [String] -> ModGuts -> IO ModGuts

hscTypecheckRename :: HscEnv -> ModSummary -> HsParsedModule -> IO (TcGblEnv, RenamedStuff)

Rename and typecheck a module, additionally returning the renamed syntax

makeSimpleDetails :: HscEnv -> TcGblEnv -> IO ModDetails

Make a ModDetails from the results of typechecking. Used when typechecking only, as opposed to full compilation.

Typecheck utils

tcSplitForAllTyVars :: Type -> ([TyVar], Type)

tcSplitForAllTyVarBinder_maybe :: Type -> Maybe (TyVarBinder, Type)

typecheckIface :: ModIface -> IfG ModDetails

mkIfaceTc :: HscEnv -> SafeHaskellMode -> ModDetails -> TcGblEnv -> IO ModIface

Make an interface from the results of typechecking only. Useful for non-optimising compilation, or where we aren't generating any object code at all (HscNothing).

data ImportedModsVal

Constructors

ImportedModsVal

Fields

• imv_name :: ModuleName

  The name the module is imported with

• imv_span :: SrcSpan

  the source span of the whole import

• imv_is_safe :: IsSafeImport

  whether this is a safe import

• imv_is_hiding :: Bool

  whether this is an "hiding" import

• imv_all_exports :: !GlobalRdrEnv

  all the things the module could provide NB. BangPattern here: otherwise this leaks. (#15111)

• imv_qualified :: Bool

  whether this is a qualified import

importedByUser :: [ImportedBy] -> [ImportedModsVal]

type TypecheckedSource = LHsBinds GhcTc

Source Locations

type HasSrcSpan = HasSrcSpan

type Located = GenLocated SrcSpan

unLoc :: HasSrcSpan a => a -> SrcSpanLess a

getLoc :: HasSrcSpan a => a -> SrcSpan

type RealLocated = GenLocated RealSrcSpan

data GenLocated l e

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

Constructors

L l e

Instances

HasDecls ParsedSource

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => ParsedSource -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => ParsedSource -> [LHsDecl GhcPs] -> TransformT m ParsedSource

Functor (GenLocated l)

Defined in SrcLoc

Methods

fmap :: (a -> b) -> GenLocated l a -> GenLocated l b

(<$) :: a -> GenLocated l b -> GenLocated l a

Show (Annotated ParsedSource)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Annotated ParsedSource -> ShowS

show :: Annotated ParsedSource -> String

showList :: [Annotated ParsedSource] -> ShowS

Foldable (GenLocated l)

Defined in 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 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)

NFData (Annotated ParsedSource)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Annotated ParsedSource -> ()

NamedThing e => NamedThing (Located e)

Defined in Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

HasSrcSpan (Located a)

Defined in SrcLoc

Methods

composeSrcSpan :: Located (SrcSpanLess (Located a)) -> Located a

decomposeSrcSpan :: Located a -> Located (SrcSpanLess (Located a))

Annotate [ExprLStmt GhcPs]

Used for declarations that need to be aligned together, e.g. in a do or let .. in statement/expr

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [ExprLStmt GhcPs] -> Annotated ()

Annotate [LHsDerivingClause GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsDerivingClause GhcPs] -> Annotated ()

Annotate [LHsType GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsType GhcPs] -> Annotated ()

Annotate [LHsSigType GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsSigType GhcPs] -> Annotated ()

Annotate [LConDeclField GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LConDeclField GhcPs] -> Annotated ()

Annotate [LIE GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LIE GhcPs] -> Annotated ()

Annotate body => Annotate [Located (Match GhcPs (Located body))]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [Located (Match GhcPs (Located body))] -> Annotated ()

Annotate [Located (StmtLR GhcPs GhcPs (LHsCmd GhcPs))]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [Located (StmtLR GhcPs GhcPs (LHsCmd GhcPs))] -> Annotated ()

Annotate (TyFamInstEqn GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> TyFamInstEqn GhcPs -> Annotated ()

Annotate (HsRecUpdField GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecUpdField GhcPs -> Annotated ()

Annotate (FunDep (Located RdrName))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> FunDep (Located RdrName) -> Annotated ()

Annotate name => Annotate (BooleanFormula (Located name))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> BooleanFormula (Located name) -> Annotated ()

(Data ast, Annotate ast) => Annotate (Located ast)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Located ast -> Annotated ()

HasDecls (LHsExpr GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LHsExpr GhcPs -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LHsExpr GhcPs -> [LHsDecl GhcPs] -> TransformT m (LHsExpr GhcPs)

HasLoc (Located a)

Defined in Compat.HieAst

Methods

loc :: Located a -> SrcSpan

HasType (LHsBind GhcRn)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsBind GhcRn -> HieM [HieAST Type]

HasType (LHsBind GhcTc)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsBind GhcTc -> HieM [HieAST Type]

HasType (LHsExpr GhcRn)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsExpr GhcRn -> HieM [HieAST Type]

HasType (LHsExpr GhcTc)

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LHsExpr GhcTc -> HieM [HieAST Type]

HasType (Located (Pat GhcRn))

Defined in Compat.HieAst

Methods

getTypeNode :: Located (Pat GhcRn) -> HieM [HieAST Type]

HasType (Located (Pat GhcTc))

Defined in Compat.HieAst

Methods

getTypeNode :: Located (Pat GhcTc) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (LHsExpr a), Data (HsTupArg a)) => ToHie (LHsTupArg (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsTupArg (GhcPass p) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (PScoped (LPat a)), ToHie (BindContext (LHsBind a)), ToHie (LHsExpr a), ToHie (MatchGroup a (LHsCmd a)), ToHie (SigContext (LSig a)), ToHie (RScoped (HsValBindsLR a a)), Data (HsCmd a), Data (HsCmdTop a), Data (StmtLR a a (Located (HsCmd a))), Data (HsLocalBinds a), Data (StmtLR a a (Located (HsExpr a)))) => ToHie (LHsCmd (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsCmd (GhcPass p) -> HieM [HieAST Type]

(ToHie (LHsCmd a), Data (HsCmdTop a)) => ToHie (LHsCmdTop a)

Defined in Compat.HieAst

Methods

toHie :: LHsCmdTop a -> HieM [HieAST Type]

ToHie (LSpliceDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LSpliceDecl GhcRn -> HieM [HieAST Type]

ToHie (LTyClDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LTyClDecl GhcRn -> HieM [HieAST Type]

ToHie (LFamilyDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LFamilyDecl GhcRn -> HieM [HieAST Type]

ToHie (LInjectivityAnn GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LInjectivityAnn GhcRn -> HieM [HieAST Type]

ToHie (HsDeriving GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsDeriving GhcRn -> HieM [HieAST Type]

ToHie (LHsDerivingClause GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsDerivingClause GhcRn -> HieM [HieAST Type]

ToHie (LStandaloneKindSig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LStandaloneKindSig GhcRn -> HieM [HieAST Type]

ToHie (LConDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LConDecl GhcRn -> HieM [HieAST Type]

ToHie (LTyFamInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LTyFamInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LDataFamInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDataFamInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LClsInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LClsInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LDerivDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDerivDecl GhcRn -> HieM [HieAST Type]

ToHie (LDefaultDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDefaultDecl GhcRn -> HieM [HieAST Type]

ToHie (LForeignDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LForeignDecl GhcRn -> HieM [HieAST Type]

ToHie (LRuleDecls GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRuleDecls GhcRn -> HieM [HieAST Type]

ToHie (LRuleDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRuleDecl GhcRn -> HieM [HieAST Type]

ToHie (LWarnDecls GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LWarnDecls GhcRn -> HieM [HieAST Type]

ToHie (LWarnDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LWarnDecl GhcRn -> HieM [HieAST Type]

ToHie (LAnnDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LAnnDecl GhcRn -> HieM [HieAST Type]

ToHie (LRoleAnnotDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRoleAnnotDecl GhcRn -> HieM [HieAST Type]

ToHie (LFixitySig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LFixitySig GhcRn -> HieM [HieAST Type]

ToHie (LHsContext GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsContext GhcRn -> HieM [HieAST Type]

ToHie (LHsType GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsType GhcRn -> HieM [HieAST Type]

ToHie (LConDeclField GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LConDeclField GhcRn -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (Context (Located (IdP a))), HasType (LHsExpr a), ToHie (PScoped (LPat a)), ToHie (MatchGroup a (LHsExpr a)), ToHie (LGRHS a (LHsExpr a)), ToHie (RContext (HsRecordBinds a)), ToHie (RFContext (Located (AmbiguousFieldOcc a))), ToHie (ArithSeqInfo a), ToHie (LHsCmdTop a), ToHie (RScoped (GuardLStmt a)), ToHie (RScoped (LHsLocalBinds a)), ToHie (TScoped (LHsWcType (NoGhcTc a))), ToHie (TScoped (LHsSigWcType (NoGhcTc a))), Data (HsExpr a), Data (HsSplice a), Data (HsTupArg a), Data (AmbiguousFieldOcc a), HasRealDataConName a) => ToHie (LHsExpr (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsExpr (GhcPass p) -> HieM [HieAST Type]

ToHie (LImportDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LImportDecl GhcRn -> HieM [HieAST Type]

ToHie (LBooleanFormula (Located Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (Located Name) -> HieM [HieAST Type]

ToHie (Located [LConDeclField GhcRn])

Defined in Compat.HieAst

Methods

toHie :: Located [LConDeclField GhcRn] -> HieM [HieAST Type]

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

(ToHie (Context (Located (IdP a))), ToHie (PScoped (LPat a)), ToHie (HsPatSynDir a)) => ToHie (Located (PatSynBind a a))

Defined in Compat.HieAst

Methods

toHie :: Located (PatSynBind a a) -> HieM [HieAST Type]

ToHie (Located HsIPName)

Defined in Compat.HieAst

Methods

toHie :: Located HsIPName -> HieM [HieAST Type]

ToHie (Located (FunDep (Located Name)))

Defined in Compat.HieAst

Methods

toHie :: Located (FunDep (Located Name)) -> HieM [HieAST Type]

(ToHie (LHsExpr a), Data (HsSplice a)) => ToHie (Located (HsSplice a))

Defined in Compat.HieAst

Methods

toHie :: Located (HsSplice a) -> HieM [HieAST Type]

ToHie (Located OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: Located OverlapMode -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (Context (Located (IdP a))), ToHie (RContext (HsRecFields a (PScoped (LPat a)))), ToHie (LHsExpr a), ToHie (TScoped (LHsSigWcType a)), ProtectSig a, ToHie (TScoped (ProtectedSig a)), HasType (LPat a), Data (HsSplice a)) => ToHie (PScoped (Located (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (Located (Pat (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LHsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsType GhcRn) -> HieM [HieAST Type]

ToHie (TScoped (LHsWcType GhcTc))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsWcType GhcTc) -> HieM [HieAST Type]

ToHie (TScoped (LHsSigWcType GhcTc))

Dummy instances - never called

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsSigWcType GhcTc) -> HieM [HieAST Type]

ToHie (Context (Located NoExtField))

Defined in Compat.HieAst

Methods

toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

(ToHie (Context (Located (IdP a))), ToHie (MatchGroup a (LHsExpr a)), ToHie (PScoped (LPat a)), ToHie (GRHSs a (LHsExpr a)), ToHie (LHsExpr a), ToHie (Located (PatSynBind a a)), HasType (LHsBind a), ModifyState (IdP a), Data (HsBind a)) => ToHie (BindContext (LHsBind a))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LHsBind a) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (PScoped (LPat a)), ToHie (LHsExpr a), ToHie (SigContext (LSig a)), ToHie (RScoped (LHsLocalBinds a)), ToHie (RScoped (ApplicativeArg a)), ToHie (Located body), Data (StmtLR a a (Located body)), Data (StmtLR a a (Located (HsExpr a)))) => ToHie (RScoped (LStmt (GhcPass p) (Located body)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LStmt (GhcPass p) (Located body)) -> HieM [HieAST Type]

ToHie (RScoped (LFamilyResultSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LFamilyResultSig GhcRn) -> HieM [HieAST Type]

ToHie (RScoped (LRuleBndr GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LRuleBndr GhcRn) -> HieM [HieAST Type]

(ToHie (LHsExpr a), ToHie (PScoped (LPat a)), ToHie (BindContext (LHsBind a)), ToHie (SigContext (LSig a)), ToHie (RScoped (HsValBindsLR a a)), Data (HsLocalBinds a)) => ToHie (RScoped (LHsLocalBinds a))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LHsLocalBinds a) -> HieM [HieAST Type]

ToHie (SigContext (LSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LSig GhcRn) -> HieM [HieAST Type]

ToHie (SigContext (LSig GhcTc))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LSig GhcTc) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data label, Data arg) => ToHie (RContext (LHsRecField' label arg))

Defined in Compat.HieAst

Methods

toHie :: RContext (LHsRecField' label arg) -> HieM [HieAST Type]

ToHie (RFContext (LFieldOcc GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RFContext (LFieldOcc GhcRn) -> HieM [HieAST Type]

ToHie (RFContext (LFieldOcc GhcTc))

Defined in Compat.HieAst

Methods

toHie :: RFContext (LFieldOcc GhcTc) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcTc)) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LIE GhcRn))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIE GhcRn) -> HieM [HieAST Type]

ToHie (IEContext (Located (FieldLbl Name)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located (FieldLbl Name)) -> HieM [HieAST Type]

ToHie (IEContext (Located ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located ModuleName) -> HieM [HieAST Type]

ToHie (TVScoped (LHsTyVarBndr GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LHsTyVarBndr GhcRn) -> HieM [HieAST Type]

(Eq l, Eq e) => Eq (GenLocated l e)

Defined in SrcLoc

Methods

(==) :: GenLocated l e -> GenLocated l e -> Bool

(/=) :: GenLocated l e -> GenLocated l e -> Bool

(Data l, Data e) => Data (GenLocated l e)

Defined in 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)

(Ord l, Ord e) => Ord (GenLocated l e)

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

Outputable a => Show (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> GenLocated SrcSpan a -> ShowS

show :: GenLocated SrcSpan a -> String

showList :: [GenLocated SrcSpan a] -> ShowS

(NFData l, NFData e) => NFData (GenLocated l e)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: GenLocated l e -> ()

(Outputable l, Outputable e) => Outputable (GenLocated l e)

Defined in SrcLoc

Methods

ppr :: GenLocated l e -> SDoc

pprPrec :: Rational -> GenLocated l e -> SDoc

Annotate body => Annotate (Match GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Match GhcPs (Located body) -> Annotated ()

Annotate body => Annotate (GRHS GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> GRHS GhcPs (Located body) -> Annotated ()

Annotate body => Annotate (Stmt GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Stmt GhcPs (Located body) -> Annotated ()

Annotate (HsRecField GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecField GhcPs (LHsExpr GhcPs) -> Annotated ()

Annotate (HsRecField GhcPs (Located (Pat GhcPs)))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecField GhcPs (Located (Pat GhcPs)) -> Annotated ()

Annotate arg => Annotate (HsImplicitBndrs GhcPs (Located arg))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsImplicitBndrs GhcPs (Located arg) -> Annotated ()

HasDecls (LMatch GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LMatch GhcPs (LHsExpr GhcPs) -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LMatch GhcPs (LHsExpr GhcPs) -> [LHsDecl GhcPs] -> TransformT m (LMatch GhcPs (LHsExpr GhcPs))

HasDecls (LStmt GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LStmt GhcPs (LHsExpr GhcPs) -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LStmt GhcPs (LHsExpr GhcPs) -> [LHsDecl GhcPs] -> TransformT m (LStmt GhcPs (LHsExpr GhcPs))

(a ~ GhcPass p, ToHie body, ToHie (HsMatchContext (NameOrRdrName (IdP a))), ToHie (PScoped (LPat a)), ToHie (GRHSs a body), Data (Match a body)) => ToHie (LMatch (GhcPass p) body)

Defined in Compat.HieAst

Methods

toHie :: LMatch (GhcPass p) body -> HieM [HieAST Type]

(ToHie (Located body), ToHie (RScoped (GuardLStmt a)), Data (GRHS a (Located body))) => ToHie (LGRHS a (Located body))

Defined in Compat.HieAst

Methods

toHie :: LGRHS a (Located body) -> HieM [HieAST Type]

type SrcSpanLess (GenLocated l e)

Defined in SrcLoc

type SrcSpanLess (GenLocated l e) = e

data SrcSpan

Source Span

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

Constructors

UnhelpfulSpan !FastString

Instances

Eq SrcSpan

Defined in SrcLoc

Methods

(==) :: SrcSpan -> SrcSpan -> Bool

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

Data SrcSpan

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

Ord SrcSpan

Defined in SrcLoc

Methods

compare :: SrcSpan -> SrcSpan -> Ordering

(<) :: SrcSpan -> SrcSpan -> Bool

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

(>) :: SrcSpan -> SrcSpan -> Bool

(>=) :: SrcSpan -> SrcSpan -> Bool

max :: SrcSpan -> SrcSpan -> SrcSpan

min :: SrcSpan -> SrcSpan -> SrcSpan

Show SrcSpan

Defined in SrcLoc

Methods

showsPrec :: Int -> SrcSpan -> ShowS

show :: SrcSpan -> String

showList :: [SrcSpan] -> ShowS

NFData SrcSpan

Defined in SrcLoc

Methods

rnf :: SrcSpan -> ()

ToJson SrcSpan

Defined in SrcLoc

Methods

json :: SrcSpan -> JsonDoc

Outputable SrcSpan

Defined in SrcLoc

Methods

ppr :: SrcSpan -> SDoc

pprPrec :: Rational -> SrcSpan -> SDoc

HasDecls ParsedSource

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => ParsedSource -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => ParsedSource -> [LHsDecl GhcPs] -> TransformT m ParsedSource

Show (Annotated ParsedSource)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Annotated ParsedSource -> ShowS

show :: Annotated ParsedSource -> String

showList :: [Annotated ParsedSource] -> ShowS

NFData (Annotated ParsedSource)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Annotated ParsedSource -> ()

NamedThing e => NamedThing (Located e)

Defined in Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

HasSrcSpan (Located a)

Defined in SrcLoc

Methods

composeSrcSpan :: Located (SrcSpanLess (Located a)) -> Located a

decomposeSrcSpan :: Located a -> Located (SrcSpanLess (Located a))

Annotate [ExprLStmt GhcPs]

Used for declarations that need to be aligned together, e.g. in a do or let .. in statement/expr

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [ExprLStmt GhcPs] -> Annotated ()

Annotate [LHsDerivingClause GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsDerivingClause GhcPs] -> Annotated ()

Annotate [LHsType GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsType GhcPs] -> Annotated ()

Annotate [LHsSigType GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LHsSigType GhcPs] -> Annotated ()

Annotate [LConDeclField GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LConDeclField GhcPs] -> Annotated ()

Annotate [LIE GhcPs]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [LIE GhcPs] -> Annotated ()

Annotate body => Annotate [Located (Match GhcPs (Located body))]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [Located (Match GhcPs (Located body))] -> Annotated ()

Annotate [Located (StmtLR GhcPs GhcPs (LHsCmd GhcPs))]

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> [Located (StmtLR GhcPs GhcPs (LHsCmd GhcPs))] -> Annotated ()

Annotate (TyFamInstEqn GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> TyFamInstEqn GhcPs -> Annotated ()

Annotate (HsRecUpdField GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecUpdField GhcPs -> Annotated ()

Annotate (FunDep (Located RdrName))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> FunDep (Located RdrName) -> Annotated ()

Annotate name => Annotate (BooleanFormula (Located name))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> BooleanFormula (Located name) -> Annotated ()

(Data ast, Annotate ast) => Annotate (Located ast)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Located ast -> Annotated ()

HasDecls (LHsExpr GhcPs)

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LHsExpr GhcPs -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LHsExpr GhcPs -> [LHsDecl GhcPs] -> TransformT m (LHsExpr GhcPs)

HasLoc (Located a)

Defined in Compat.HieAst

Methods

loc :: Located a -> SrcSpan

HasType (LHsBind GhcRn)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsBind GhcRn -> HieM [HieAST Type]

HasType (LHsBind GhcTc)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsBind GhcTc -> HieM [HieAST Type]

HasType (LHsExpr GhcRn)

Defined in Compat.HieAst

Methods

getTypeNode :: LHsExpr GhcRn -> HieM [HieAST Type]

HasType (LHsExpr GhcTc)

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LHsExpr GhcTc -> HieM [HieAST Type]

HasType (Located (Pat GhcRn))

Defined in Compat.HieAst

Methods

getTypeNode :: Located (Pat GhcRn) -> HieM [HieAST Type]

HasType (Located (Pat GhcTc))

Defined in Compat.HieAst

Methods

getTypeNode :: Located (Pat GhcTc) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (LHsExpr a), Data (HsTupArg a)) => ToHie (LHsTupArg (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsTupArg (GhcPass p) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (PScoped (LPat a)), ToHie (BindContext (LHsBind a)), ToHie (LHsExpr a), ToHie (MatchGroup a (LHsCmd a)), ToHie (SigContext (LSig a)), ToHie (RScoped (HsValBindsLR a a)), Data (HsCmd a), Data (HsCmdTop a), Data (StmtLR a a (Located (HsCmd a))), Data (HsLocalBinds a), Data (StmtLR a a (Located (HsExpr a)))) => ToHie (LHsCmd (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsCmd (GhcPass p) -> HieM [HieAST Type]

(ToHie (LHsCmd a), Data (HsCmdTop a)) => ToHie (LHsCmdTop a)

Defined in Compat.HieAst

Methods

toHie :: LHsCmdTop a -> HieM [HieAST Type]

ToHie (LSpliceDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LSpliceDecl GhcRn -> HieM [HieAST Type]

ToHie (LTyClDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LTyClDecl GhcRn -> HieM [HieAST Type]

ToHie (LFamilyDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LFamilyDecl GhcRn -> HieM [HieAST Type]

ToHie (LInjectivityAnn GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LInjectivityAnn GhcRn -> HieM [HieAST Type]

ToHie (HsDeriving GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsDeriving GhcRn -> HieM [HieAST Type]

ToHie (LHsDerivingClause GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsDerivingClause GhcRn -> HieM [HieAST Type]

ToHie (LStandaloneKindSig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LStandaloneKindSig GhcRn -> HieM [HieAST Type]

ToHie (LConDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LConDecl GhcRn -> HieM [HieAST Type]

ToHie (LTyFamInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LTyFamInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LDataFamInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDataFamInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LClsInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LClsInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LInstDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LInstDecl GhcRn -> HieM [HieAST Type]

ToHie (LDerivDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDerivDecl GhcRn -> HieM [HieAST Type]

ToHie (LDefaultDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LDefaultDecl GhcRn -> HieM [HieAST Type]

ToHie (LForeignDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LForeignDecl GhcRn -> HieM [HieAST Type]

ToHie (LRuleDecls GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRuleDecls GhcRn -> HieM [HieAST Type]

ToHie (LRuleDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRuleDecl GhcRn -> HieM [HieAST Type]

ToHie (LWarnDecls GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LWarnDecls GhcRn -> HieM [HieAST Type]

ToHie (LWarnDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LWarnDecl GhcRn -> HieM [HieAST Type]

ToHie (LAnnDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LAnnDecl GhcRn -> HieM [HieAST Type]

ToHie (LRoleAnnotDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LRoleAnnotDecl GhcRn -> HieM [HieAST Type]

ToHie (LFixitySig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LFixitySig GhcRn -> HieM [HieAST Type]

ToHie (LHsContext GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsContext GhcRn -> HieM [HieAST Type]

ToHie (LHsType GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LHsType GhcRn -> HieM [HieAST Type]

ToHie (LConDeclField GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LConDeclField GhcRn -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (Context (Located (IdP a))), HasType (LHsExpr a), ToHie (PScoped (LPat a)), ToHie (MatchGroup a (LHsExpr a)), ToHie (LGRHS a (LHsExpr a)), ToHie (RContext (HsRecordBinds a)), ToHie (RFContext (Located (AmbiguousFieldOcc a))), ToHie (ArithSeqInfo a), ToHie (LHsCmdTop a), ToHie (RScoped (GuardLStmt a)), ToHie (RScoped (LHsLocalBinds a)), ToHie (TScoped (LHsWcType (NoGhcTc a))), ToHie (TScoped (LHsSigWcType (NoGhcTc a))), Data (HsExpr a), Data (HsSplice a), Data (HsTupArg a), Data (AmbiguousFieldOcc a), HasRealDataConName a) => ToHie (LHsExpr (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: LHsExpr (GhcPass p) -> HieM [HieAST Type]

ToHie (LImportDecl GhcRn)

Defined in Compat.HieAst

Methods

toHie :: LImportDecl GhcRn -> HieM [HieAST Type]

ToHie (LBooleanFormula (Located Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (Located Name) -> HieM [HieAST Type]

ToHie (Located [LConDeclField GhcRn])

Defined in Compat.HieAst

Methods

toHie :: Located [LConDeclField GhcRn] -> HieM [HieAST Type]

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

(ToHie (Context (Located (IdP a))), ToHie (PScoped (LPat a)), ToHie (HsPatSynDir a)) => ToHie (Located (PatSynBind a a))

Defined in Compat.HieAst

Methods

toHie :: Located (PatSynBind a a) -> HieM [HieAST Type]

ToHie (Located HsIPName)

Defined in Compat.HieAst

Methods

toHie :: Located HsIPName -> HieM [HieAST Type]

ToHie (Located (FunDep (Located Name)))

Defined in Compat.HieAst

Methods

toHie :: Located (FunDep (Located Name)) -> HieM [HieAST Type]

(ToHie (LHsExpr a), Data (HsSplice a)) => ToHie (Located (HsSplice a))

Defined in Compat.HieAst

Methods

toHie :: Located (HsSplice a) -> HieM [HieAST Type]

ToHie (Located OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: Located OverlapMode -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (Context (Located (IdP a))), ToHie (RContext (HsRecFields a (PScoped (LPat a)))), ToHie (LHsExpr a), ToHie (TScoped (LHsSigWcType a)), ProtectSig a, ToHie (TScoped (ProtectedSig a)), HasType (LPat a), Data (HsSplice a)) => ToHie (PScoped (Located (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (Located (Pat (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LHsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsType GhcRn) -> HieM [HieAST Type]

ToHie (TScoped (LHsWcType GhcTc))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsWcType GhcTc) -> HieM [HieAST Type]

ToHie (TScoped (LHsSigWcType GhcTc))

Dummy instances - never called

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsSigWcType GhcTc) -> HieM [HieAST Type]

ToHie (Context (Located NoExtField))

Defined in Compat.HieAst

Methods

toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

(ToHie (Context (Located (IdP a))), ToHie (MatchGroup a (LHsExpr a)), ToHie (PScoped (LPat a)), ToHie (GRHSs a (LHsExpr a)), ToHie (LHsExpr a), ToHie (Located (PatSynBind a a)), HasType (LHsBind a), ModifyState (IdP a), Data (HsBind a)) => ToHie (BindContext (LHsBind a))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LHsBind a) -> HieM [HieAST Type]

(a ~ GhcPass p, ToHie (PScoped (LPat a)), ToHie (LHsExpr a), ToHie (SigContext (LSig a)), ToHie (RScoped (LHsLocalBinds a)), ToHie (RScoped (ApplicativeArg a)), ToHie (Located body), Data (StmtLR a a (Located body)), Data (StmtLR a a (Located (HsExpr a)))) => ToHie (RScoped (LStmt (GhcPass p) (Located body)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LStmt (GhcPass p) (Located body)) -> HieM [HieAST Type]

ToHie (RScoped (LFamilyResultSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LFamilyResultSig GhcRn) -> HieM [HieAST Type]

ToHie (RScoped (LRuleBndr GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LRuleBndr GhcRn) -> HieM [HieAST Type]

(ToHie (LHsExpr a), ToHie (PScoped (LPat a)), ToHie (BindContext (LHsBind a)), ToHie (SigContext (LSig a)), ToHie (RScoped (HsValBindsLR a a)), Data (HsLocalBinds a)) => ToHie (RScoped (LHsLocalBinds a))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LHsLocalBinds a) -> HieM [HieAST Type]

ToHie (SigContext (LSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LSig GhcRn) -> HieM [HieAST Type]

ToHie (SigContext (LSig GhcTc))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LSig GhcTc) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data label, Data arg) => ToHie (RContext (LHsRecField' label arg))

Defined in Compat.HieAst

Methods

toHie :: RContext (LHsRecField' label arg) -> HieM [HieAST Type]

ToHie (RFContext (LFieldOcc GhcRn))

Defined in Compat.HieAst

Methods

toHie :: RFContext (LFieldOcc GhcRn) -> HieM [HieAST Type]

ToHie (RFContext (LFieldOcc GhcTc))

Defined in Compat.HieAst

Methods

toHie :: RFContext (LFieldOcc GhcTc) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcTc)) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LIE GhcRn))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIE GhcRn) -> HieM [HieAST Type]

ToHie (IEContext (Located (FieldLbl Name)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located (FieldLbl Name)) -> HieM [HieAST Type]

ToHie (IEContext (Located ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located ModuleName) -> HieM [HieAST Type]

ToHie (TVScoped (LHsTyVarBndr GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LHsTyVarBndr GhcRn) -> HieM [HieAST Type]

Outputable a => Show (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> GenLocated SrcSpan a -> ShowS

show :: GenLocated SrcSpan a -> String

showList :: [GenLocated SrcSpan a] -> ShowS

Annotate body => Annotate (Match GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Match GhcPs (Located body) -> Annotated ()

Annotate body => Annotate (GRHS GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> GRHS GhcPs (Located body) -> Annotated ()

Annotate body => Annotate (Stmt GhcPs (Located body))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Stmt GhcPs (Located body) -> Annotated ()

Annotate (HsRecField GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecField GhcPs (LHsExpr GhcPs) -> Annotated ()

Annotate (HsRecField GhcPs (Located (Pat GhcPs)))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsRecField GhcPs (Located (Pat GhcPs)) -> Annotated ()

Annotate arg => Annotate (HsImplicitBndrs GhcPs (Located arg))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> HsImplicitBndrs GhcPs (Located arg) -> Annotated ()

HasDecls (LMatch GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LMatch GhcPs (LHsExpr GhcPs) -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LMatch GhcPs (LHsExpr GhcPs) -> [LHsDecl GhcPs] -> TransformT m (LMatch GhcPs (LHsExpr GhcPs))

HasDecls (LStmt GhcPs (LHsExpr GhcPs))

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

hsDecls :: forall (m :: Type -> Type). Monad m => LStmt GhcPs (LHsExpr GhcPs) -> TransformT m [LHsDecl GhcPs]

replaceDecls :: forall (m :: Type -> Type). Monad m => LStmt GhcPs (LHsExpr GhcPs) -> [LHsDecl GhcPs] -> TransformT m (LStmt GhcPs (LHsExpr GhcPs))

(a ~ GhcPass p, ToHie body, ToHie (HsMatchContext (NameOrRdrName (IdP a))), ToHie (PScoped (LPat a)), ToHie (GRHSs a body), Data (Match a body)) => ToHie (LMatch (GhcPass p) body)

Defined in Compat.HieAst

Methods

toHie :: LMatch (GhcPass p) body -> HieM [HieAST Type]

(ToHie (Located body), ToHie (RScoped (GuardLStmt a)), Data (GRHS a (Located body))) => ToHie (LGRHS a (Located body))

Defined in Compat.HieAst

Methods

toHie :: LGRHS a (Located body) -> HieM [HieAST Type]

data RealSrcSpan

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

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

Real Source Span

Instances

Eq RealSrcSpan

Defined in SrcLoc

Methods

(==) :: RealSrcSpan -> RealSrcSpan -> Bool

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

Data RealSrcSpan

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

Ord RealSrcSpan

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

Show RealSrcSpan

Defined in SrcLoc

Methods

showsPrec :: Int -> RealSrcSpan -> ShowS

show :: RealSrcSpan -> String

showList :: [RealSrcSpan] -> ShowS

ToJSON RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

toJSON :: RealSrcSpan -> Value

toEncoding :: RealSrcSpan -> Encoding

toJSONList :: [RealSrcSpan] -> Value

toEncodingList :: [RealSrcSpan] -> Encoding

FromJSON RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

parseJSON :: Value -> Parser RealSrcSpan

parseJSONList :: Value -> Parser [RealSrcSpan]

NFData RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: RealSrcSpan -> ()

ToJson RealSrcSpan

Defined in SrcLoc

Methods

json :: RealSrcSpan -> JsonDoc

Outputable RealSrcSpan

Defined in SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

pprPrec :: Rational -> RealSrcSpan -> SDoc

MapAge RealSrcSpan

Defined in Development.IDE.Core.UseStale

Methods

mapAgeFrom :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked to RealSrcSpan -> Maybe (Tracked from RealSrcSpan)

mapAgeTo :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked from RealSrcSpan -> Maybe (Tracked to RealSrcSpan)

pattern RealSrcSpan :: RealSrcSpan -> Maybe BufSpan -> SrcSpan

data RealSrcLoc

Real Source Location

Represents a single point within a file

Instances

Eq RealSrcLoc

Defined in SrcLoc

Methods

(==) :: RealSrcLoc -> RealSrcLoc -> Bool

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

Ord RealSrcLoc

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

Show RealSrcLoc

Defined in SrcLoc

Methods

showsPrec :: Int -> RealSrcLoc -> ShowS

show :: RealSrcLoc -> String

showList :: [RealSrcLoc] -> ShowS

Outputable RealSrcLoc

Defined in SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

pprPrec :: Rational -> RealSrcLoc -> SDoc

data SrcLoc

Source Location

Constructors

RealSrcLoc !RealSrcLoc

UnhelpfulLoc FastString

Instances

Eq SrcLoc

Defined in SrcLoc

Methods

(==) :: SrcLoc -> SrcLoc -> Bool

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

Ord SrcLoc

Defined in SrcLoc

Methods

compare :: SrcLoc -> SrcLoc -> Ordering

(<) :: SrcLoc -> SrcLoc -> Bool

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

(>) :: SrcLoc -> SrcLoc -> Bool

(>=) :: SrcLoc -> SrcLoc -> Bool

max :: SrcLoc -> SrcLoc -> SrcLoc

min :: SrcLoc -> SrcLoc -> SrcLoc

Show SrcLoc

Defined in SrcLoc

Methods

showsPrec :: Int -> SrcLoc -> ShowS

show :: SrcLoc -> String

showList :: [SrcLoc] -> ShowS

Outputable SrcLoc

Defined in SrcLoc

Methods

ppr :: SrcLoc -> SDoc

pprPrec :: Rational -> SrcLoc -> SDoc

type BufSpan = ()

leftmost_smallest :: SrcSpan -> SrcSpan -> Ordering

Alternative strategies for ordering SrcSpans

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.

mkGeneralSrcSpan :: FastString -> SrcSpan

Create a "bad" SrcSpan that has not location information

mkRealSrcSpan :: RealSrcLoc -> RealSrcLoc -> RealSrcSpan

Create a SrcSpan between two points in a file

mkRealSrcLoc :: FastString -> Int -> Int -> RealSrcLoc

getRealSrcSpan :: RealLocated a -> RealSrcSpan

realSrcLocSpan :: RealSrcLoc -> RealSrcSpan

realSrcSpanStart :: RealSrcSpan -> RealSrcLoc

realSrcSpanEnd :: RealSrcSpan -> RealSrcLoc

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

wiredInSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

mkSrcSpan :: SrcLoc -> SrcLoc -> SrcSpan

Create a SrcSpan between two points in a file

srcSpanStart :: SrcSpan -> SrcLoc

Returns the location at the start of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanStartLine :: RealSrcSpan -> Int

srcSpanStartCol :: RealSrcSpan -> Int

srcSpanEnd :: SrcSpan -> SrcLoc

Returns the location at the end of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanEndLine :: RealSrcSpan -> Int

srcSpanEndCol :: RealSrcSpan -> Int

srcSpanFile :: RealSrcSpan -> FastString

srcLocCol :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

srcLocFile :: RealSrcLoc -> FastString

Gives the filename of the RealSrcLoc

srcLocLine :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

noSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

noSrcLoc :: SrcLoc

Built-in "bad" SrcLoc values for particular locations

noLoc :: HasSrcSpan a => SrcSpanLess a -> a

Finder

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 UnitId

The requested package was not found

FoundMultiple [(Module, ModuleOrigin)]

_Error_: both in multiple packages

NotFound

Not found

Fields

• fr_paths :: [FilePath]
• fr_pkg :: Maybe UnitId
• fr_mods_hidden :: [UnitId]
• fr_pkgs_hidden :: [UnitId]
• fr_unusables :: [(UnitId, UnusablePackageReason)]
• fr_suggestions :: [ModuleSuggestion]

mkHomeModLocation :: DynFlags -> ModuleName -> FilePath -> IO ModLocation

addBootSuffixLocnOut :: ModLocation -> ModLocation

Add the -boot suffix to all output file paths associated with the module, not including the input file itself

findObjectLinkableMaybe :: Module -> ModLocation -> IO (Maybe Linkable)

data InstalledFindResult

Constructors

InstalledFound ModLocation InstalledModule

InstalledNoPackage InstalledUnitId

InstalledNotFound [FilePath] (Maybe InstalledUnitId)

Module and Package

data ModuleOrigin

Package state is all stored in DynFlags, including the details of all packages, which packages are exposed, and which modules they provide.

The package state is computed by initPackages, and kept in DynFlags. It is influenced by various package flags:

• -package pkg and -package-id pkg cause pkg to become exposed. If -hide-all-packages was not specified, these commands also cause all other packages with the same name to become hidden.
• -hide-package pkg causes pkg to become hidden.
• (there are a few more flags, check below for their semantics)

The package state has the following properties.

• Let exposedPackages be the set of packages thus exposed. Let depExposedPackages be the transitive closure from exposedPackages of their dependencies.
• When searching for a module from a preload import declaration, only the exposed modules in exposedPackages are valid.
• When searching for a module from an implicit import, all modules from depExposedPackages are valid.
• When linking in a compilation manager mode, we link in packages the program depends on (the compiler knows this list by the time it gets to the link step). Also, we link in all packages which were mentioned with preload -package flags on the command-line, or are a transitive dependency of same, or are "base"/"rts". The reason for this is that we might need packages which don't contain any Haskell modules, and therefore won't be discovered by the normal mechanism of dependency tracking.

Given a module name, there may be multiple ways it came into scope, possibly simultaneously. This data type tracks all the possible ways it could have come into scope. Warning: don't use the record functions, they're partial!

Constructors

ModHidden

Module is hidden, and thus never will be available for import. (But maybe the user didn't realize), so we'll still keep track of these modules.)

ModUnusable UnusablePackageReason

Module is unavailable because the package is unusable.

ModOrigin

Module is public, and could have come from some places.

Fields

• fromOrigPackage :: Maybe Bool

  Just False means that this module is in someone's exported-modules list, but that package is hidden; Just True means that it is available; Nothing means neither applies.

• fromExposedReexport :: [PackageConfig]

  Is the module available from a reexport of an exposed package? There could be multiple.

• fromHiddenReexport :: [PackageConfig]

  Is the module available from a reexport of a hidden package?

• fromPackageFlag :: Bool

  Did the module export come from a package flag? (ToDo: track more information.

Instances

Semigroup ModuleOrigin

Defined in Packages

Methods

(<>) :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin

sconcat :: NonEmpty ModuleOrigin -> ModuleOrigin

stimes :: Integral b => b -> ModuleOrigin -> ModuleOrigin

Monoid ModuleOrigin

Defined in Packages

Methods

mempty :: ModuleOrigin

mappend :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin

mconcat :: [ModuleOrigin] -> ModuleOrigin

Outputable ModuleOrigin

Defined in Packages

Methods

ppr :: ModuleOrigin -> SDoc

pprPrec :: Rational -> ModuleOrigin -> SDoc

newtype PackageName

Constructors

PackageName FastString

Instances

Eq PackageName

Defined in PackageConfig

Methods

(==) :: PackageName -> PackageName -> Bool

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

Ord PackageName

Defined in PackageConfig

Methods

compare :: PackageName -> PackageName -> Ordering

(<) :: PackageName -> PackageName -> Bool

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

(>) :: PackageName -> PackageName -> Bool

(>=) :: PackageName -> PackageName -> Bool

max :: PackageName -> PackageName -> PackageName

min :: PackageName -> PackageName -> PackageName

Show PackageName

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> PackageName -> ShowS

show :: PackageName -> String

showList :: [PackageName] -> ShowS

Uniquable PackageName

Defined in PackageConfig

Methods

getUnique :: PackageName -> Unique

Outputable PackageName

Defined in PackageConfig

Methods

ppr :: PackageName -> SDoc

pprPrec :: Rational -> PackageName -> SDoc

BinaryStringRep PackageName

Defined in PackageConfig

Methods

fromStringRep :: ByteString -> PackageName

toStringRep :: PackageName -> ByteString

Linker

data Unlinked

Objects which have yet to be linked by the compiler

Constructors

DotO FilePath

An object file (.o)

DotA FilePath

Static archive file (.a)

DotDLL FilePath

Dynamically linked library file (.so, .dll, .dylib)

BCOs CompiledByteCode [SptEntry]

A byte-code object, lives only in memory. Also carries some static pointer table entries which should be loaded along with the BCOs. See Note [Grant plan for static forms] in StaticPtrTable.

Instances

Outputable Unlinked

Defined in LinkerTypes

Methods

ppr :: Unlinked -> SDoc

pprPrec :: Rational -> Unlinked -> SDoc

data Linkable

Information we can use to dynamically link modules into the compiler

Constructors

LM

Fields

• linkableTime :: UTCTime

  Time at which this linkable was built (i.e. when the bytecodes were produced, or the mod date on the files)

• linkableModule :: Module

  The linkable module itself

• linkableUnlinked :: [Unlinked]

  Those files and chunks of code we have yet to link.

  INVARIANT: A valid linkable always has at least one Unlinked item. If this list is empty, the Linkable represents a fake linkable, which is generated in HscNothing mode to avoid recompiling modules.

  ToDo: Do items get removed from this list when they get linked?

Instances

Show Linkable

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Linkable -> ShowS

show :: Linkable -> String

showList :: [Linkable] -> ShowS

NFData Linkable

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Linkable -> ()

Outputable Linkable

Defined in LinkerTypes

Methods

ppr :: Linkable -> SDoc

pprPrec :: Rational -> Linkable -> SDoc

unload

Arguments

:: HscEnv

-> [Linkable]

The linkables to *keep*.

-> IO ()

Unloading old objects ready for a new compilation sweep.

The compilation manager provides us with a list of linkables that it considers "stable", i.e. won't be recompiled this time around. For each of the modules current linked in memory,

• if the linkable is stable (and it's the same one -- the user may have recompiled the module on the side), we keep it,
• otherwise, we unload it.
• we also implicitly unload all temporary bindings at this point.

initDynLinker :: HscEnv -> IO ()

Initialise the dynamic linker. This entails

a) Calling the C initialisation procedure,

b) Loading any packages specified on the command line,

c) Loading any packages specified on the command line, now held in the -l options in v_Opt_l,

d) Loading any .o/.dll files specified on the command line, now held in ldInputs,

e) Loading any MacOS frameworks.

NOTE: This function is idempotent; if called more than once, it does nothing. This is useful in Template Haskell, where we call it before trying to link.

Hooks

data Hooks

runMetaHook :: Hooks -> Maybe (MetaHook TcM)

type MetaHook (f :: Type -> Type) = MetaRequest -> LHsExpr GhcTc -> f MetaResult

data MetaRequest

The supported metaprogramming result types

Constructors

MetaE (LHsExpr GhcPs -> MetaResult)

MetaP (LPat GhcPs -> MetaResult)

MetaT (LHsType GhcPs -> MetaResult)

MetaD ([LHsDecl GhcPs] -> MetaResult)

MetaAW (Serialized -> MetaResult)

metaRequestE :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LHsExpr GhcPs)

metaRequestP :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LPat GhcPs)

metaRequestT :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LHsType GhcPs)

metaRequestD :: Functor f => MetaHook f -> LHsExpr GhcTc -> f [LHsDecl GhcPs]

metaRequestAW :: Functor f => MetaHook f -> LHsExpr GhcTc -> f Serialized

HPT

addToHpt :: HomePackageTable -> ModuleName -> HomeModInfo -> HomePackageTable

addListToHpt :: HomePackageTable -> [(ModuleName, HomeModInfo)] -> HomePackageTable

Driver-Make

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 HscTypes

Methods

ppr :: Target -> SDoc

pprPrec :: Rational -> Target -> SDoc

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

Eq TargetId

Defined in HscTypes

Methods

(==) :: TargetId -> TargetId -> Bool

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

Outputable TargetId

Defined in HscTypes

Methods

ppr :: TargetId -> SDoc

pprPrec :: Rational -> TargetId -> SDoc

mkModuleGraph :: [ModSummary] -> ModuleGraph

GHCi

initObjLinker :: HscEnv -> IO ()

loadDLL :: HscEnv -> String -> IO (Maybe String)

loadDLL loads a dynamic library using the OS's native linker (i.e. dlopen() on Unix, LoadLibrary() on Windows). It takes either an absolute pathname to the file, or a relative filename (e.g. "libfoo.so" or "foo.dll"). In the latter case, loadDLL searches the standard locations for the appropriate library.

Returns:

Nothing => success Just err_msg => failure

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

Show InteractiveImport

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> InteractiveImport -> ShowS

show :: InteractiveImport -> String

showList :: [InteractiveImport] -> ShowS

Outputable InteractiveImport

Defined in HscTypes

Methods

ppr :: InteractiveImport -> SDoc

pprPrec :: Rational -> InteractiveImport -> SDoc

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.

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

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

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

data Warn

A command-line warning message and the reason it arose

Constructors

Warn

Fields

• warnReason :: WarnReason
• warnMsg :: Located String

ModLocation

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

Instances

Show ModLocation

Defined in Module

Methods

showsPrec :: Int -> ModLocation -> ShowS

show :: ModLocation -> String

showList :: [ModLocation] -> ShowS

Outputable ModLocation

Defined in Module

Methods

ppr :: ModLocation -> SDoc

pprPrec :: Rational -> ModLocation -> SDoc

pattern ModLocation :: Maybe FilePath -> FilePath -> FilePath -> ModLocation

ml_hs_file :: ModLocation -> Maybe FilePath

ml_obj_file :: ModLocation -> FilePath

ml_hi_file :: ModLocation -> FilePath

ml_hie_file :: ModLocation -> FilePath

DataCon

dataConExTyCoVars :: DataCon -> [TyCoVar]

Role

data Role

Constructors

Nominal

Representational

Phantom

Instances

Eq Role

Defined in CoAxiom

Methods

(==) :: Role -> Role -> Bool

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

Data Role

Defined in CoAxiom

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

Ord Role

Defined in CoAxiom

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

Binary Role

Defined in CoAxiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in CoAxiom

Methods

ppr :: Role -> SDoc

pprPrec :: Rational -> Role -> SDoc

Annotate (Maybe Role)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Maybe Role -> Annotated ()

Panic

type PlainGhcException = PlainGhcException

panic :: String -> a

Panics and asserts.

Util Module re-exports

isKindLevel :: TypeOrKind -> Bool

isTypeLevel :: TypeOrKind -> Bool

mkIntWithInf :: Int -> IntWithInf

Inject any integer into an IntWithInf

treatZeroAsInf :: Int -> IntWithInf

Turn a positive number into an IntWithInf, where 0 represents infinity

intGtLimit :: Int -> IntWithInf -> Bool

infinity :: IntWithInf

A representation of infinity

integralFractionalLit :: Bool -> Integer -> FractionalLit

negateFractionalLit :: FractionalLit -> FractionalLit

mkFractionalLit :: Real a => a -> FractionalLit

negateIntegralLit :: IntegralLit -> IntegralLit

mkIntegralLit :: Integral a => a -> IntegralLit

isEarlyActive :: Activation -> Bool

isAlwaysActive :: Activation -> Bool

isNeverActive :: Activation -> Bool

competesWith :: Activation -> Activation -> Bool

isActiveIn :: PhaseNum -> Activation -> Bool

isActive :: CompilerPhase -> Activation -> Bool

pprInlineDebug :: InlinePragma -> SDoc

pprInline :: InlinePragma -> SDoc

setInlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo -> InlinePragma

setInlinePragmaActivation :: InlinePragma -> Activation -> InlinePragma

inlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo

inlinePragmaActivation :: InlinePragma -> Activation

inlinePragmaSat :: InlinePragma -> Maybe Arity

isAnyInlinePragma :: InlinePragma -> Bool

isInlinablePragma :: InlinePragma -> Bool

isInlinePragma :: InlinePragma -> Bool

isDefaultInlinePragma :: InlinePragma -> Bool

dfunInlinePragma :: InlinePragma

inlinePragmaSpec :: InlinePragma -> InlineSpec

neverInlinePragma :: InlinePragma

alwaysInlinePragma :: InlinePragma

defaultInlinePragma :: InlinePragma

noUserInlineSpec :: InlineSpec -> Bool

isFunLike :: RuleMatchInfo -> Bool

isConLike :: RuleMatchInfo -> Bool

activeDuringFinal :: Activation

activeAfterInitial :: Activation

pprWithSourceText :: SourceText -> SDoc -> SDoc

Special combinator for showing string literals.

failed :: SuccessFlag -> Bool

succeeded :: SuccessFlag -> Bool

successIf :: Bool -> SuccessFlag

zapFragileOcc :: OccInfo -> OccInfo

isOneOcc :: OccInfo -> Bool

isDeadOcc :: OccInfo -> Bool

isStrongLoopBreaker :: OccInfo -> Bool

isWeakLoopBreaker :: OccInfo -> Bool

weakLoopBreaker :: OccInfo

strongLoopBreaker :: OccInfo

isAlwaysTailCalled :: OccInfo -> Bool

zapOccTailCallInfo :: OccInfo -> OccInfo

tailCallInfo :: OccInfo -> TailCallInfo

notOneBranch :: OneBranch

oneBranch :: OneBranch

notInsideLam :: InsideLam

insideLam :: InsideLam

seqOccInfo :: OccInfo -> ()

isManyOccs :: OccInfo -> Bool

noOccInfo :: OccInfo

pprAlternative

Arguments

:: (a -> SDoc)

The pretty printing function to use

-> a

The things to be pretty printed

-> ConTag

Alternative (one-based)

-> Arity

Arity

-> SDoc

SDoc where the alternative havs been pretty printed and finally packed into a paragraph.

Pretty print an alternative in an unboxed sum e.g. "| a | |".

sumParens :: SDoc -> SDoc

tupleParens :: TupleSort -> SDoc -> SDoc

boxityTupleSort :: Boxity -> TupleSort

tupleSortBoxity :: TupleSort -> Boxity

maybeParen :: PprPrec -> PprPrec -> SDoc -> SDoc

appPrec :: PprPrec

opPrec :: PprPrec

funPrec :: PprPrec

sigPrec :: PprPrec

topPrec :: PprPrec

hasOverlappingFlag :: OverlapMode -> Bool

hasOverlappableFlag :: OverlapMode -> Bool

hasIncoherentFlag :: OverlapMode -> Bool

setOverlapModeMaybe :: OverlapFlag -> Maybe OverlapMode -> OverlapFlag

isGenerated :: Origin -> Bool

boolToRecFlag :: Bool -> RecFlag

isNonRec :: RecFlag -> Bool

isRec :: RecFlag -> Bool

isBoxed :: Boxity -> Bool

isTopLevel :: TopLevelFlag -> Bool

isNotTopLevel :: TopLevelFlag -> Bool

compareFixity :: Fixity -> Fixity -> (Bool, Bool)

funTyFixity :: Fixity

negateFixity :: Fixity

defaultFixity :: Fixity

minPrecedence :: Int

maxPrecedence :: Int

pprRuleName :: RuleName -> SDoc

pprWarningTxtForMsg :: WarningTxt -> SDoc

initialVersion :: Version

bumpVersion :: Version -> Version

isPromoted :: PromotionFlag -> Bool

unSwap :: SwapFlag -> (a -> a -> b) -> a -> a -> b

isSwapped :: SwapFlag -> Bool

flipSwap :: SwapFlag -> SwapFlag

bestOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo

worstOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo

hasNoOneShotInfo :: OneShotInfo -> Bool

isOneShotInfo :: OneShotInfo -> Bool

noOneShotInfo :: OneShotInfo

It is always safe to assume that an Id has no lambda-bound variable information

alignmentOf :: Int -> Alignment

mkAlignment :: Int -> Alignment

fIRST_TAG :: ConTag

Tags are allocated from here for real constructors or for superclass selectors

pickLR :: LeftOrRight -> (a, a) -> a

data LeftOrRight

Constructors

CLeft

CRight

Instances

Eq LeftOrRight

Defined in BasicTypes

Methods

(==) :: LeftOrRight -> LeftOrRight -> Bool

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

Data LeftOrRight

Defined in BasicTypes

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

Outputable LeftOrRight

Defined in BasicTypes

Methods

ppr :: LeftOrRight -> SDoc

pprPrec :: Rational -> LeftOrRight -> SDoc

type Arity = Int

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

type RepArity = Int

Representation Arity

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

type JoinArity = Int

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

type ConTag = Int

Constructor Tag

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

type ConTagZ = Int

A *zero-indexed* constructor tag

data Alignment

A power-of-two alignment

Instances

Eq Alignment

Defined in BasicTypes

Methods

(==) :: Alignment -> Alignment -> Bool

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

Ord Alignment

Defined in BasicTypes

Methods

compare :: Alignment -> Alignment -> Ordering

(<) :: Alignment -> Alignment -> Bool

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

(>) :: Alignment -> Alignment -> Bool

(>=) :: Alignment -> Alignment -> Bool

max :: Alignment -> Alignment -> Alignment

min :: Alignment -> Alignment -> Alignment

Outputable Alignment

Defined in BasicTypes

Methods

ppr :: Alignment -> SDoc

pprPrec :: Rational -> Alignment -> SDoc

data OneShotInfo

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

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

Constructors

NoOneShotInfo

No information

OneShotLam

The lambda is applied at most once.

Instances

Eq OneShotInfo

Defined in BasicTypes

Methods

(==) :: OneShotInfo -> OneShotInfo -> Bool

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

Outputable OneShotInfo

Defined in BasicTypes

Methods

ppr :: OneShotInfo -> SDoc

pprPrec :: Rational -> OneShotInfo -> SDoc

data SwapFlag

Constructors

NotSwapped

IsSwapped

Instances

Outputable SwapFlag

Defined in BasicTypes

Methods

ppr :: SwapFlag -> SDoc

pprPrec :: Rational -> SwapFlag -> SDoc

data PromotionFlag

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

Constructors

NotPromoted

IsPromoted

Instances

Eq PromotionFlag

Defined in BasicTypes

Methods

(==) :: PromotionFlag -> PromotionFlag -> Bool

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

Data PromotionFlag

Defined in BasicTypes

Methods

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

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

toConstr :: PromotionFlag -> Constr

dataTypeOf :: PromotionFlag -> DataType

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

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

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

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

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

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

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

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

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

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

data FunctionOrData

Constructors

IsFunction

IsData

Instances

Eq FunctionOrData

Defined in BasicTypes

Methods

(==) :: FunctionOrData -> FunctionOrData -> Bool

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

Data FunctionOrData

Defined in BasicTypes

Methods

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

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

toConstr :: FunctionOrData -> Constr

dataTypeOf :: FunctionOrData -> DataType

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

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

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

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

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

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

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

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

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

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

Ord FunctionOrData

Defined in BasicTypes

Methods

compare :: FunctionOrData -> FunctionOrData -> Ordering

(<) :: FunctionOrData -> FunctionOrData -> Bool

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

(>) :: FunctionOrData -> FunctionOrData -> Bool

(>=) :: FunctionOrData -> FunctionOrData -> Bool

max :: FunctionOrData -> FunctionOrData -> FunctionOrData

min :: FunctionOrData -> FunctionOrData -> FunctionOrData

Outputable FunctionOrData

Defined in BasicTypes

Methods

ppr :: FunctionOrData -> SDoc

pprPrec :: Rational -> FunctionOrData -> SDoc

data StringLiteral

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

Constructors

StringLiteral

Fields

• sl_st :: SourceText
• sl_fs :: FastString

Instances

Eq StringLiteral

Defined in BasicTypes

Methods

(==) :: StringLiteral -> StringLiteral -> Bool

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

Data StringLiteral

Defined in BasicTypes

Methods

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

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

toConstr :: StringLiteral -> Constr

dataTypeOf :: StringLiteral -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable StringLiteral

Defined in BasicTypes

Methods

ppr :: StringLiteral -> SDoc

pprPrec :: Rational -> StringLiteral -> SDoc

Annotate StringLiteral

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> StringLiteral -> Annotated ()

data WarningTxt

Warning Text

reason/explanation from a WARNING or DEPRECATED pragma

Constructors

WarningTxt (Located SourceText) [Located StringLiteral]

DeprecatedTxt (Located SourceText) [Located StringLiteral]

Instances

Eq WarningTxt

Defined in BasicTypes

Methods

(==) :: WarningTxt -> WarningTxt -> Bool

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

Data WarningTxt

Defined in BasicTypes

Methods

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

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

toConstr :: WarningTxt -> Constr

dataTypeOf :: WarningTxt -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable WarningTxt

Defined in BasicTypes

Methods

ppr :: WarningTxt -> SDoc

pprPrec :: Rational -> WarningTxt -> SDoc

Annotate WarningTxt

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> WarningTxt -> Annotated ()

type RuleName = FastString

data Fixity

Constructors

Fixity SourceText Int FixityDirection

Instances

Eq Fixity

Defined in BasicTypes

Methods

(==) :: Fixity -> Fixity -> Bool

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

Data Fixity

Defined in BasicTypes

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

Outputable Fixity

Defined in BasicTypes

Methods

ppr :: Fixity -> SDoc

pprPrec :: Rational -> Fixity -> SDoc

data FixityDirection

Constructors

InfixL

InfixR

InfixN

Instances

Eq FixityDirection

Defined in BasicTypes

Methods

(==) :: FixityDirection -> FixityDirection -> Bool

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

Data FixityDirection

Defined in BasicTypes

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

Outputable FixityDirection

Defined in BasicTypes

Methods

ppr :: FixityDirection -> SDoc

pprPrec :: Rational -> FixityDirection -> SDoc

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

Eq LexicalFixity

Defined in BasicTypes

Methods

(==) :: LexicalFixity -> LexicalFixity -> Bool

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

Data LexicalFixity

Defined in BasicTypes

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 BasicTypes

Methods

ppr :: LexicalFixity -> SDoc

pprPrec :: Rational -> LexicalFixity -> SDoc

data TopLevelFlag

Constructors

TopLevel

NotTopLevel

Instances

Outputable TopLevelFlag

Defined in BasicTypes

Methods

ppr :: TopLevelFlag -> SDoc

pprPrec :: Rational -> TopLevelFlag -> SDoc

data Boxity

Constructors

Boxed

Unboxed

Instances

Eq Boxity

Defined in BasicTypes

Methods

(==) :: Boxity -> Boxity -> Bool

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

Data Boxity

Defined in BasicTypes

Methods

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

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

toConstr :: Boxity -> Constr

dataTypeOf :: Boxity -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable Boxity

Defined in BasicTypes

Methods

ppr :: Boxity -> SDoc

pprPrec :: Rational -> Boxity -> SDoc

data RecFlag

Recursivity Flag

Constructors

Recursive

NonRecursive

Instances

Eq RecFlag

Defined in BasicTypes

Methods

(==) :: RecFlag -> RecFlag -> Bool

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

Data RecFlag

Defined in BasicTypes

Methods

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

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

toConstr :: RecFlag -> Constr

dataTypeOf :: RecFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable RecFlag

Defined in BasicTypes

Methods

ppr :: RecFlag -> SDoc

pprPrec :: Rational -> RecFlag -> SDoc

data Origin

Constructors

FromSource

Generated

Instances

Eq Origin

Defined in BasicTypes

Methods

(==) :: Origin -> Origin -> Bool

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

Data Origin

Defined in BasicTypes

Methods

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

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

toConstr :: Origin -> Constr

dataTypeOf :: Origin -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable Origin

Defined in BasicTypes

Methods

ppr :: Origin -> SDoc

pprPrec :: Rational -> Origin -> SDoc

data OverlapFlag

The semantics allowed for overlapping instances for a particular instance. See Note [Safe Haskell isSafeOverlap] (in hs) for a explanation of the isSafeOverlap field.

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

Constructors

OverlapFlag

Fields

• overlapMode :: OverlapMode
• isSafeOverlap :: Bool

Instances

Eq OverlapFlag

Defined in BasicTypes

Methods

(==) :: OverlapFlag -> OverlapFlag -> Bool

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

Data OverlapFlag

Defined in BasicTypes

Methods

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

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

toConstr :: OverlapFlag -> Constr

dataTypeOf :: OverlapFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable OverlapFlag

Defined in BasicTypes

Methods

ppr :: OverlapFlag -> SDoc

pprPrec :: Rational -> OverlapFlag -> SDoc

data OverlapMode

Constructors

NoOverlap SourceText

This instance must not overlap another NoOverlap instance. However, it may be overlapped by Overlapping instances, and it may overlap Overlappable instances.

Overlappable SourceText

Silently ignore this instance if you find a more specific one that matches the constraint you are trying to resolve

Example: constraint (Foo [Int]) instance Foo [Int] instance {--} Foo [a]

Since the second instance has the Overlappable flag, the first instance will be chosen (otherwise its ambiguous which to choose)

Overlapping SourceText

Silently ignore any more general instances that may be used to solve the constraint.

Example: constraint (Foo [Int]) instance {--} Foo [Int] instance Foo [a]

Since the first instance has the Overlapping flag, the second---more general---instance will be ignored (otherwise it is ambiguous which to choose)

Overlaps SourceText

Equivalent to having both Overlapping and Overlappable flags.

Incoherent SourceText

Behave like Overlappable and Overlapping, and in addition pick an an arbitrary one if there are multiple matching candidates, and don't worry about later instantiation

Example: constraint (Foo [b]) instance {-# INCOHERENT -} Foo [Int] instance Foo [a] Without the Incoherent flag, we'd complain that instantiating b would change which instance was chosen. See also note [Incoherent instances] in InstEnv

Instances

Eq OverlapMode

Defined in BasicTypes

Methods

(==) :: OverlapMode -> OverlapMode -> Bool

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

Data OverlapMode

Defined in BasicTypes

Methods

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

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

toConstr :: OverlapMode -> Constr

dataTypeOf :: OverlapMode -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable OverlapMode

Defined in BasicTypes

Methods

ppr :: OverlapMode -> SDoc

pprPrec :: Rational -> OverlapMode -> SDoc

Annotate OverlapMode

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> OverlapMode -> Annotated ()

ToHie (Located OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: Located OverlapMode -> HieM [HieAST Type]

newtype PprPrec

A general-purpose pretty-printing precedence type.

Constructors

PprPrec Int

Instances

Eq PprPrec

Defined in BasicTypes

Methods

(==) :: PprPrec -> PprPrec -> Bool

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

Ord PprPrec

Defined in BasicTypes

Methods

compare :: PprPrec -> PprPrec -> Ordering

(<) :: PprPrec -> PprPrec -> Bool

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

(>) :: PprPrec -> PprPrec -> Bool

(>=) :: PprPrec -> PprPrec -> Bool

max :: PprPrec -> PprPrec -> PprPrec

min :: PprPrec -> PprPrec -> PprPrec

Show PprPrec

Defined in BasicTypes

Methods

showsPrec :: Int -> PprPrec -> ShowS

show :: PprPrec -> String

showList :: [PprPrec] -> ShowS

data TupleSort

Constructors

BoxedTuple

UnboxedTuple

ConstraintTuple

Instances

Eq TupleSort

Defined in BasicTypes

Methods

(==) :: TupleSort -> TupleSort -> Bool

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

Data TupleSort

Defined in BasicTypes

Methods

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

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

toConstr :: TupleSort -> Constr

dataTypeOf :: TupleSort -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable TupleSort

Defined in BasicTypes

Methods

ppr :: TupleSort -> SDoc

pprPrec :: Rational -> TupleSort -> SDoc

data EP a

Embedding Projection pair

Constructors

EP

Fields

• fromEP :: a
• toEP :: a

data OccInfo

identifier Occurrence Information

Constructors

ManyOccs

There are many occurrences, or unknown occurrences

Fields

• occ_tail :: !TailCallInfo

IAmDead

Marks unused variables. Sometimes useful for lambda and case-bound variables.

OneOcc

Occurs exactly once (per branch), not inside a rule

Fields

• occ_in_lam :: !InsideLam
• occ_one_br :: !OneBranch
• occ_int_cxt :: !InterestingCxt
• occ_tail :: !TailCallInfo

IAmALoopBreaker

This identifier breaks a loop of mutually recursive functions. The field marks whether it is only a loop breaker due to a reference in a rule

Fields

• occ_rules_only :: !RulesOnly
• occ_tail :: !TailCallInfo

Instances

Eq OccInfo

Defined in BasicTypes

Methods

(==) :: OccInfo -> OccInfo -> Bool

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

Outputable OccInfo

Defined in BasicTypes

Methods

ppr :: OccInfo -> SDoc

pprPrec :: Rational -> OccInfo -> SDoc

type InterestingCxt = Bool

Interesting Context

type InsideLam = Bool

Inside Lambda

type OneBranch = Bool

data TailCallInfo

Constructors

AlwaysTailCalled JoinArity

NoTailCallInfo

Instances

Eq TailCallInfo

Defined in BasicTypes

Methods

(==) :: TailCallInfo -> TailCallInfo -> Bool

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

Outputable TailCallInfo

Defined in BasicTypes

Methods

ppr :: TailCallInfo -> SDoc

pprPrec :: Rational -> TailCallInfo -> SDoc

data DefMethSpec ty

Default Method Specification

Constructors

VanillaDM

GenericDM ty

Instances

Binary (DefMethSpec IfaceType)

Defined in IfaceType

Methods

put_ :: BinHandle -> DefMethSpec IfaceType -> IO ()

put :: BinHandle -> DefMethSpec IfaceType -> IO (Bin (DefMethSpec IfaceType))

get :: BinHandle -> IO (DefMethSpec IfaceType)

Outputable (DefMethSpec ty)

Defined in BasicTypes

Methods

ppr :: DefMethSpec ty -> SDoc

pprPrec :: Rational -> DefMethSpec ty -> SDoc

data SuccessFlag

Constructors

Succeeded

Failed

Instances

Outputable SuccessFlag

Defined in BasicTypes

Methods

ppr :: SuccessFlag -> SDoc

pprPrec :: Rational -> SuccessFlag -> SDoc

data SourceText

Constructors

SourceText String

NoSourceText

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

Instances

Eq SourceText

Defined in BasicTypes

Methods

(==) :: SourceText -> SourceText -> Bool

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

Data SourceText

Defined in BasicTypes

Methods

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

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

toConstr :: SourceText -> Constr

dataTypeOf :: SourceText -> DataType

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

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

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

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

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

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

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

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

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

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

Show SourceText

Defined in BasicTypes

Methods

showsPrec :: Int -> SourceText -> ShowS

show :: SourceText -> String

showList :: [SourceText] -> ShowS

Outputable SourceText

Defined in BasicTypes

Methods

ppr :: SourceText -> SDoc

pprPrec :: Rational -> SourceText -> SDoc

Annotate (SourceText, FastString)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> (SourceText, FastString) -> Annotated ()

type PhaseNum = Int

Phase Number

data CompilerPhase

Constructors

Phase PhaseNum

InitialPhase

Instances

Outputable CompilerPhase

Defined in BasicTypes

Methods

ppr :: CompilerPhase -> SDoc

pprPrec :: Rational -> CompilerPhase -> SDoc

data Activation

Constructors

NeverActive

AlwaysActive

ActiveBefore SourceText PhaseNum

ActiveAfter SourceText PhaseNum

Instances

Eq Activation

Defined in BasicTypes

Methods

(==) :: Activation -> Activation -> Bool

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

Data Activation

Defined in BasicTypes

Methods

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

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

toConstr :: Activation -> Constr

dataTypeOf :: Activation -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable Activation

Defined in BasicTypes

Methods

ppr :: Activation -> SDoc

pprPrec :: Rational -> Activation -> SDoc

data RuleMatchInfo

Rule Match Information

Constructors

ConLike

FunLike

Instances

Eq RuleMatchInfo

Defined in BasicTypes

Methods

(==) :: RuleMatchInfo -> RuleMatchInfo -> Bool

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

Data RuleMatchInfo

Defined in BasicTypes

Methods

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

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

toConstr :: RuleMatchInfo -> Constr

dataTypeOf :: RuleMatchInfo -> DataType

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

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

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

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

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

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

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

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

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

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

Show RuleMatchInfo

Defined in BasicTypes

Methods

showsPrec :: Int -> RuleMatchInfo -> ShowS

show :: RuleMatchInfo -> String

showList :: [RuleMatchInfo] -> ShowS

Outputable RuleMatchInfo

Defined in BasicTypes

Methods

ppr :: RuleMatchInfo -> SDoc

pprPrec :: Rational -> RuleMatchInfo -> SDoc

data InlinePragma

Constructors

InlinePragma

Fields

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

Instances

Eq InlinePragma

Defined in BasicTypes

Methods

(==) :: InlinePragma -> InlinePragma -> Bool

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

Data InlinePragma

Defined in BasicTypes

Methods

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

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

toConstr :: InlinePragma -> Constr

dataTypeOf :: InlinePragma -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable InlinePragma

Defined in BasicTypes

Methods

ppr :: InlinePragma -> SDoc

pprPrec :: Rational -> InlinePragma -> SDoc

data InlineSpec

Inline Specification

Constructors

Inline

Inlinable

NoInline

NoUserInline

Instances

Eq InlineSpec

Defined in BasicTypes

Methods

(==) :: InlineSpec -> InlineSpec -> Bool

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

Data InlineSpec

Defined in BasicTypes

Methods

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

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

toConstr :: InlineSpec -> Constr

dataTypeOf :: InlineSpec -> DataType

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

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

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

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

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

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

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

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

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

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

Show InlineSpec

Defined in BasicTypes

Methods

showsPrec :: Int -> InlineSpec -> ShowS

show :: InlineSpec -> String

showList :: [InlineSpec] -> ShowS

Outputable InlineSpec

Defined in BasicTypes

Methods

ppr :: InlineSpec -> SDoc

pprPrec :: Rational -> InlineSpec -> SDoc

data IntegralLit

Integral Literal

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

Constructors

IL

Fields

• il_text :: SourceText
• il_neg :: Bool
• il_value :: Integer

Instances

Eq IntegralLit

Defined in BasicTypes

Methods

(==) :: IntegralLit -> IntegralLit -> Bool

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

Data IntegralLit

Defined in BasicTypes

Methods

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

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

toConstr :: IntegralLit -> Constr

dataTypeOf :: IntegralLit -> DataType

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

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

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

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

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

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

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

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

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

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

Ord IntegralLit

Defined in BasicTypes

Methods

compare :: IntegralLit -> IntegralLit -> Ordering

(<) :: IntegralLit -> IntegralLit -> Bool

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

(>) :: IntegralLit -> IntegralLit -> Bool

(>=) :: IntegralLit -> IntegralLit -> Bool

max :: IntegralLit -> IntegralLit -> IntegralLit

min :: IntegralLit -> IntegralLit -> IntegralLit

Show IntegralLit

Defined in BasicTypes

Methods

showsPrec :: Int -> IntegralLit -> ShowS

show :: IntegralLit -> String

showList :: [IntegralLit] -> ShowS

Outputable IntegralLit

Defined in BasicTypes

Methods

ppr :: IntegralLit -> SDoc

pprPrec :: Rational -> IntegralLit -> SDoc

data FractionalLit

Fractional Literal

Used (instead of Rational) to represent exactly the floating point literal that we encountered in the user's source program. This allows us to pretty-print exactly what the user wrote, which is important e.g. for floating point numbers that can't represented as Doubles (we used to via Double for pretty-printing). See also #2245.

Constructors

FL

Fields

• fl_text :: SourceText
• fl_neg :: Bool
• fl_value :: Rational

Instances

Eq FractionalLit

Defined in BasicTypes

Methods

(==) :: FractionalLit -> FractionalLit -> Bool

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

Data FractionalLit

Defined in BasicTypes

Methods

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

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

toConstr :: FractionalLit -> Constr

dataTypeOf :: FractionalLit -> DataType

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

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

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

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

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

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

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

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

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

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

Ord FractionalLit

Defined in BasicTypes

Methods

compare :: FractionalLit -> FractionalLit -> Ordering

(<) :: FractionalLit -> FractionalLit -> Bool

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

(>) :: FractionalLit -> FractionalLit -> Bool

(>=) :: FractionalLit -> FractionalLit -> Bool

max :: FractionalLit -> FractionalLit -> FractionalLit

min :: FractionalLit -> FractionalLit -> FractionalLit

Show FractionalLit

Defined in BasicTypes

Methods

showsPrec :: Int -> FractionalLit -> ShowS

show :: FractionalLit -> String

showList :: [FractionalLit] -> ShowS

Outputable FractionalLit

Defined in BasicTypes

Methods

ppr :: FractionalLit -> SDoc

pprPrec :: Rational -> FractionalLit -> SDoc

data IntWithInf

An integer or infinity

Instances

Eq IntWithInf

Defined in BasicTypes

Methods

(==) :: IntWithInf -> IntWithInf -> Bool

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

Num IntWithInf

Defined in BasicTypes

Methods

(+) :: IntWithInf -> IntWithInf -> IntWithInf

(-) :: IntWithInf -> IntWithInf -> IntWithInf

(*) :: IntWithInf -> IntWithInf -> IntWithInf

negate :: IntWithInf -> IntWithInf

abs :: IntWithInf -> IntWithInf

signum :: IntWithInf -> IntWithInf

fromInteger :: Integer -> IntWithInf

Ord IntWithInf

Defined in BasicTypes

Methods

compare :: IntWithInf -> IntWithInf -> Ordering

(<) :: IntWithInf -> IntWithInf -> Bool

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

(>) :: IntWithInf -> IntWithInf -> Bool

(>=) :: IntWithInf -> IntWithInf -> Bool

max :: IntWithInf -> IntWithInf -> IntWithInf

min :: IntWithInf -> IntWithInf -> IntWithInf

Outputable IntWithInf

Defined in BasicTypes

Methods

ppr :: IntWithInf -> SDoc

pprPrec :: Rational -> IntWithInf -> SDoc

data SpliceExplicitFlag

Constructors

ExplicitSplice

= $(f x y)

ImplicitSplice

= f x y, i.e. a naked top level expression

Instances

Data SpliceExplicitFlag

Defined in BasicTypes

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 TypeOrKind

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

Constructors

TypeLevel

KindLevel

Instances

Eq TypeOrKind

Defined in BasicTypes

Methods

(==) :: TypeOrKind -> TypeOrKind -> Bool

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

Outputable TypeOrKind

Defined in BasicTypes

Methods

ppr :: TypeOrKind -> SDoc

pprPrec :: Rational -> TypeOrKind -> SDoc

module Class

coercionKind :: Coercion -> Pair Type

If it is the case that

c :: (t1 ~ t2)

i.e. the kind of c relates t1 and t2, then coercionKind c = Pair t1 t2.

module Predicate

module ConLike

module CoreUtils

buildSynTyCon

Arguments

:: Name

-> [KnotTied TyConBinder]

-> Kind

result kind

-> [Role]

-> KnotTied Type

-> TyCon

buildAlgTyCon

Arguments

:: Name

-> [TyVar]

Kind variables and type variables

-> [Role]

-> Maybe CType

-> ThetaType

Stupid theta

-> AlgTyConRhs

-> Bool

True = was declared in GADT syntax

-> AlgTyConFlav

-> TyCon

splitDataProductType_maybe

Arguments

:: Type

A product type, perhaps

-> Maybe (TyCon, [Type], DataCon, [Type])

Extract the type constructor, type argument, data constructor and it's representation argument types from a type if it is a product type.

Precisely, we return Just for any type that is all of:

• Concrete (i.e. constructors visible)
• Single-constructor
• Not existentially quantified

Whether the type is a data type or a newtype

promoteDataCon :: DataCon -> TyCon

dataConUserTyVarsArePermuted :: DataCon -> Bool

Were the type variables of the data con written in a different order than the regular order (universal tyvars followed by existential tyvars)?

This is not a cheap test, so we minimize its use in GHC as much as possible. Currently, its only call site in the GHC codebase is in mkDataConRep in MkId, and so dataConUserTyVarsArePermuted is only called at most once during a data constructor's lifetime.

dataConCannotMatch :: [Type] -> DataCon -> Bool

classDataCon :: Class -> DataCon

specialPromotedDc :: DataCon -> Bool

Should this DataCon be allowed in a type even without -XDataKinds? Currently, only Lifted & Unlifted

isVanillaDataCon :: DataCon -> Bool

Vanilla DataCons are those that are nice boring Haskell 98 constructors

isUnboxedTupleCon :: DataCon -> Bool

isTupleDataCon :: DataCon -> Bool

dataConIdentity :: DataCon -> ByteString

The string package:module.name identifying a constructor, which is attached to its info table and used by the GHCi debugger and the heap profiler

dataConRepArgTys :: DataCon -> [Type]

Returns the arg types of the worker, including *all* non-dependent evidence, after any flattening has been done and without substituting for any type variables

dataConOrigArgTys :: DataCon -> [Type]

Returns the argument types of the wrapper, excluding all dictionary arguments and without substituting for any type variables

dataConInstArgTys

Arguments

:: DataCon

A datacon with no existentials or equality constraints However, it can have a dcTheta (notably it can be a class dictionary, with superclasses)

-> [Type]

Instantiated at these types

-> [Type]

Finds the instantiated types of the arguments required to construct a DataCon representation NB: these INCLUDE any dictionary args but EXCLUDE the data-declaration context, which is discarded It's all post-flattening etc; this is a representation type

dataConUserType :: 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.

dataConOrigResTy :: DataCon -> Type

dataConInstSig :: DataCon -> [Type] -> ([TyCoVar], ThetaType, [Type])

Instantiate the universal tyvars of a data con, returning ( instantiated existentials , instantiated constraints including dependent GADT equalities which are *also* listed in the instantiated existentials , instantiated args)

dataConSig :: DataCon -> ([TyCoVar], ThetaType, [Type], Type)

The "signature" of the DataCon returns, in order:

1) The result of dataConUnivAndExTyCoVars,

2) All the ThetaTypes relating to the DataCon (coercion, dictionary, implicit parameter - whatever), including dependent GADT equalities. Dependent GADT equalities are *also* listed in return value (1), so be careful!

3) The type arguments to the constructor

4) The original result type of the DataCon

dataConBoxer :: DataCon -> Maybe DataConBoxer

dataConImplBangs :: DataCon -> [HsImplBang]

dataConRepStrictness :: DataCon -> [StrictnessMark]

Give the demands on the arguments of a Core constructor application (Con dc args)

isNullaryRepDataCon :: DataCon -> Bool

Return whether there are any argument types for this DataCons runtime representation type See Note [DataCon arities]

isNullarySrcDataCon :: DataCon -> Bool

Return whether there are any argument types for this DataCons original source type See Note [DataCon arities]

dataConRepArity :: DataCon -> Arity

Gives the number of actual fields in the representation of the data constructor. This may be more than appear in the source code; the extra ones are the existentially quantified dictionaries

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

dataConFieldType_maybe :: DataCon -> FieldLabelString -> Maybe (FieldLabel, Type)

Extract the label and type for any given labelled field of the DataCon, or return Nothing if the field does not belong to it

dataConFieldType :: DataCon -> FieldLabelString -> Type

Extract the type for any given labelled field of the DataCon

dataConImplicitTyThings :: DataCon -> [TyThing]

Find all the Ids implicitly brought into scope by the data constructor. Currently, the union of the dataConWorkId and the dataConWrapId

dataConWrapId :: DataCon -> Id

Returns an Id which looks like the Haskell-source constructor by using the wrapper if it exists (see dataConWrapId_maybe) and failing over to the worker (see dataConWorkId)

dataConWrapId_maybe :: DataCon -> Maybe Id

Get the Id of the DataCon wrapper: a function that wraps the "actual" constructor so it has the type visible in the source program: c.f. dataConWorkId. Returns Nothing if there is no wrapper, which occurs for an algebraic data constructor and also for a newtype (whose constructor is inlined compulsorily)

dataConWorkId :: DataCon -> Id

Get the Id of the DataCon worker: a function that is the "actual" constructor and has no top level binding in the program. The type may be different from the obvious one written in the source program. Panics if there is no such Id for this DataCon

dataConTheta :: DataCon -> ThetaType

The *full* constraints on the constructor type, including dependent GADT equalities.

dataConEqSpec :: DataCon -> [EqSpec]

Equalities derived from the result type of the data constructor, as written by the programmer in any GADT declaration. This includes *all* GADT-like equalities, including those written in by hand by the programmer.

dataConUnivAndExTyCoVars :: DataCon -> [TyCoVar]

Both the universal and existential type/coercion variables of the constructor

dataConUnivTyVars :: DataCon -> [TyVar]

The universally-quantified type variables of the constructor

dataConIsInfix :: DataCon -> Bool

Should the DataCon be presented infix?

dataConRepType :: DataCon -> Type

The representation type of the data constructor, i.e. the sort type that will represent values of this type at runtime

dataConOrigTyCon :: DataCon -> TyCon

The original type constructor used in the definition of this data constructor. In case of a data family instance, that will be the family type constructor.

dataConTagZ :: DataCon -> ConTagZ

dataConTag :: DataCon -> ConTag

The tag used for ordering DataCons

mkDataCon

Arguments

:: Name

-> Bool

Is the constructor declared infix?

-> TyConRepName

TyConRepName for the promoted TyCon

-> [HsSrcBang]

Strictness/unpack annotations, from user

-> [FieldLabel]

Field labels for the constructor, if it is a record, otherwise empty

-> [TyVar]

Universals.

-> [TyCoVar]

Existentials.

-> [TyVarBinder]

User-written TyVarBinders. These must be Inferred/Specified. See Note [TyVarBinders in DataCons]

-> [EqSpec]

GADT equalities

-> KnotTied ThetaType

Theta-type occurring before the arguments proper

-> [KnotTied Type]

Original argument types

-> KnotTied Type

Original result type

-> RuntimeRepInfo

See comments on RuntimeRepInfo

-> KnotTied TyCon

Representation type constructor

-> ConTag

Constructor tag

-> ThetaType

The "stupid theta", context of the data declaration e.g. data Eq a => T a ...

-> Id

Worker Id

-> DataConRep

Representation

-> DataCon

Build a new data constructor

isMarkedStrict :: StrictnessMark -> Bool

isSrcUnpacked :: SrcUnpackedness -> Bool

isSrcStrict :: SrcStrictness -> Bool

isBanged :: HsImplBang -> Bool

eqHsBang :: HsImplBang -> HsImplBang -> Bool

Compare strictness annotations

filterEqSpec :: [EqSpec] -> [TyVar] -> [TyVar]

Filter out any TyVars mentioned in an EqSpec.

substEqSpec :: TCvSubst -> EqSpec -> EqSpec

Substitute in an EqSpec. Precondition: if the LHS of the EqSpec is mapped in the substitution, it is mapped to a type variable, not a full type.

eqSpecPreds :: [EqSpec] -> ThetaType

eqSpecPair :: EqSpec -> (TyVar, Type)

eqSpecType :: EqSpec -> Type

eqSpecTyVar :: EqSpec -> TyVar

mkEqSpec :: TyVar -> Type -> EqSpec

Make a non-dependent EqSpec

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

Methods

ppr :: HsSrcBang -> SDoc

pprPrec :: Rational -> 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 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 DataCon

Methods

ppr :: HsImplBang -> SDoc

pprPrec :: Rational -> HsImplBang -> SDoc

data SrcStrictness

Source Strictness

What strictness annotation the user wrote

Constructors

SrcLazy

Lazy, ie '~'

SrcStrict

Strict, ie !

NoSrcStrict

no strictness annotation

Instances

Eq SrcStrictness

Defined in DataCon

Methods

(==) :: SrcStrictness -> SrcStrictness -> Bool

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

Data SrcStrictness

Defined in 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 DataCon

Methods

put_ :: BinHandle -> SrcStrictness -> IO ()

put :: BinHandle -> SrcStrictness -> IO (Bin SrcStrictness)

get :: BinHandle -> IO SrcStrictness

Outputable SrcStrictness

Defined in DataCon

Methods

ppr :: SrcStrictness -> SDoc

pprPrec :: Rational -> SrcStrictness -> SDoc

data SrcUnpackedness

Source Unpackedness

What unpackedness the user requested

Constructors

SrcUnpack

{--} specified

SrcNoUnpack

{--} specified

NoSrcUnpack

no unpack pragma

Instances

Eq SrcUnpackedness

Defined in DataCon

Methods

(==) :: SrcUnpackedness -> SrcUnpackedness -> Bool

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

Data SrcUnpackedness

Defined in 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 DataCon

Methods

put_ :: BinHandle -> SrcUnpackedness -> IO ()

put :: BinHandle -> SrcUnpackedness -> IO (Bin SrcUnpackedness)

get :: BinHandle -> IO SrcUnpackedness

Outputable SrcUnpackedness

Defined in DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

pprPrec :: Rational -> SrcUnpackedness -> SDoc

data StrictnessMark

Constructors

MarkedStrict

NotMarkedStrict

Instances

Outputable StrictnessMark

Defined in DataCon

Methods

ppr :: StrictnessMark -> SDoc

pprPrec :: Rational -> StrictnessMark -> SDoc

dataConName :: DataCon -> Name

The Name of the DataCon, giving it a unique, rooted identification

dataConTyCon :: DataCon -> TyCon

The type constructor that we are building via this data constructor

dataConUserTyVars :: DataCon -> [TyVar]

The type variables of the constructor, in the order the user wrote them

dataConUserTyVarBinders :: DataCon -> [TyVarBinder]

TyCoVarBinders for the type variables of the constructor, in the order the user wrote them

dataConSourceArity :: DataCon -> Arity

Source-level arity of the data constructor

dataConFieldLabels :: DataCon -> [FieldLabel]

The labels for the fields of this particular DataCon

dataConInstOrigArgTys :: DataCon -> [Type] -> [Type]

Returns just the instantiated value argument types of a DataCon, (excluding dictionary args)

dataConStupidTheta :: DataCon -> ThetaType

The "stupid theta" of the DataCon, such as data Eq a in:

data Eq a => T a = ...

dataConFullSig :: DataCon -> ([TyVar], [TyCoVar], [EqSpec], ThetaType, [Type], Type)

The "full signature" of the DataCon returns, in order:

1) The result of dataConUnivTyVars

2) The result of dataConExTyCoVars

3) The non-dependent GADT equalities. Dependent GADT equalities are implied by coercion variables in return value (2).

4) The other constraints of the data constructor type, excluding GADT equalities

5) The original argument types to the DataCon (i.e. before any change of the representation of the type)

6) The original result type of the DataCon

isUnboxedSumCon :: DataCon -> Bool

data DataCon

A data constructor

• AnnKeywordId : AnnOpen, AnnClose,AnnComma

Instances

Eq DataCon

Defined in DataCon

Methods

(==) :: DataCon -> DataCon -> Bool

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

Data DataCon

Defined in 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 DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

Uniquable DataCon

Defined in DataCon

Methods

getUnique :: DataCon -> Unique

Outputable DataCon

Defined in DataCon

Methods

ppr :: DataCon -> SDoc

pprPrec :: Rational -> DataCon -> SDoc

OutputableBndr DataCon

Defined in DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

data DataConRep

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

Constructors

NoDataConRep

DCR

Fields

• dcr_wrap_id :: Id
• dcr_boxer :: DataConBoxer
• dcr_arg_tys :: [Type]
• dcr_stricts :: [StrictnessMark]
• dcr_bangs :: [HsImplBang]

data EqSpec

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

Instances

Outputable EqSpec

Defined in DataCon

Methods

ppr :: EqSpec -> SDoc

pprPrec :: Rational -> EqSpec -> SDoc

type FieldLabelString = FastString

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

type FieldLabel = FieldLbl Name

data FieldLbl a

Fields in an algebraic record type

Constructors

FieldLabel

Fields

• flLabel :: FieldLabelString

  User-visible label of the field

• flIsOverloaded :: Bool

  Was DuplicateRecordFields on in the defining module for this datatype?

• flSelector :: a

  Record selector function

Instances

Functor FieldLbl

Defined in FieldLabel

Methods

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

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

Foldable FieldLbl

Defined in FieldLabel

Methods

fold :: Monoid m => FieldLbl m -> m

foldMap :: Monoid m => (a -> m) -> FieldLbl a -> m

foldMap' :: Monoid m => (a -> m) -> FieldLbl a -> m

foldr :: (a -> b -> b) -> b -> FieldLbl a -> b

foldr' :: (a -> b -> b) -> b -> FieldLbl a -> b

foldl :: (b -> a -> b) -> b -> FieldLbl a -> b

foldl' :: (b -> a -> b) -> b -> FieldLbl a -> b

foldr1 :: (a -> a -> a) -> FieldLbl a -> a

foldl1 :: (a -> a -> a) -> FieldLbl a -> a

toList :: FieldLbl a -> [a]

null :: FieldLbl a -> Bool

length :: FieldLbl a -> Int

elem :: Eq a => a -> FieldLbl a -> Bool

maximum :: Ord a => FieldLbl a -> a

minimum :: Ord a => FieldLbl a -> a

sum :: Num a => FieldLbl a -> a

product :: Num a => FieldLbl a -> a

Traversable FieldLbl

Defined in FieldLabel

Methods

traverse :: Applicative f => (a -> f b) -> FieldLbl a -> f (FieldLbl b)

sequenceA :: Applicative f => FieldLbl (f a) -> f (FieldLbl a)

mapM :: Monad m => (a -> m b) -> FieldLbl a -> m (FieldLbl b)

sequence :: Monad m => FieldLbl (m a) -> m (FieldLbl a)

Eq a => Eq (FieldLbl a)

Defined in FieldLabel

Methods

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

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

Data a => Data (FieldLbl a)

Defined in FieldLabel

Methods

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

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

toConstr :: FieldLbl a -> Constr

dataTypeOf :: FieldLbl a -> DataType

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

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

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

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

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

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

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

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

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

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

Binary a => Binary (FieldLbl a)

Defined in FieldLabel

Methods

put_ :: BinHandle -> FieldLbl a -> IO ()

put :: BinHandle -> FieldLbl a -> IO (Bin (FieldLbl a))

get :: BinHandle -> IO (FieldLbl a)

Outputable a => Outputable (FieldLbl a)

Defined in FieldLabel

Methods

ppr :: FieldLbl a -> SDoc

pprPrec :: Rational -> FieldLbl a -> SDoc

ToHie (IEContext (Located (FieldLbl Name)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located (FieldLbl Name)) -> HieM [HieAST Type]

fIRST_TAG :: ConTag

Tags are allocated from here for real constructors or for superclass selectors

type ConTag = Int

Constructor Tag

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

module DsExpr

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.

Using ApplicativeDo: 'fs <*> as' can be understood as the do expression

do f <- fs
   a <- as
   pure (f a)

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.

Using ApplicativeDo: 'liftA2 f as bs' can be understood as the do expression

do a <- as
   b <- bs
   pure (f a b)

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

Sequence actions, discarding the value of the first argument.

'as *> bs' can be understood as the do expression

do as
   bs

This is a tad complicated for our ApplicativeDo extension which will give it a Monad constraint. For an Applicative constraint we write it of the form

do _ <- as
   b <- bs
   pure b

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

Sequence actions, discarding the value of the second argument.

Using ApplicativeDo: 'as <* bs' can be understood as the do expression

do a <- as
   bs
   pure a

Instances

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]

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

Defined in Data.Aeson.Types.Internal

Methods

pure :: a -> IResult a

(<*>) :: IResult (a -> b) -> IResult a -> IResult b

liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c

(*>) :: IResult a -> IResult b -> IResult b

(<*) :: IResult a -> IResult b -> IResult a

Applicative Result

Defined in Data.Aeson.Types.Internal

Methods

pure :: a -> Result a

(<*>) :: Result (a -> b) -> Result a -> Result b

liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c

(*>) :: Result a -> Result b -> Result b

(<*) :: Result a -> Result b -> Result a

Applicative Parser

Defined in Data.Aeson.Types.Internal

Methods

pure :: a -> Parser a

(<*>) :: Parser (a -> b) -> Parser a -> Parser b

liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c

(*>) :: Parser a -> Parser b -> Parser b

(<*) :: Parser a -> Parser b -> Parser a

Applicative Tree

Defined in Data.Tree

Methods

pure :: a -> Tree a

(<*>) :: Tree (a -> b) -> Tree a -> Tree b

liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c

(*>) :: Tree a -> Tree b -> Tree b

(<*) :: Tree a -> Tree b -> Tree a

Applicative NonNegative

Defined in Algebra.Graph.Label

Methods

pure :: a -> NonNegative a

(<*>) :: NonNegative (a -> b) -> NonNegative a -> NonNegative b

liftA2 :: (a -> b -> c) -> NonNegative a -> NonNegative b -> NonNegative c

(*>) :: NonNegative a -> NonNegative b -> NonNegative b

(<*) :: NonNegative a -> NonNegative b -> NonNegative a

Applicative Minimum

Defined in Algebra.Graph.Label

Methods

pure :: a -> Minimum a

(<*>) :: Minimum (a -> b) -> Minimum a -> Minimum b

liftA2 :: (a -> b -> c) -> Minimum a -> Minimum b -> Minimum c

(*>) :: Minimum a -> Minimum b -> Minimum b

(<*) :: Minimum a -> Minimum b -> Minimum a

Applicative Graph

<*> is a good consumer of its first agument and producer.

Defined in Algebra.Graph

Methods

pure :: a -> Graph a

(<*>) :: Graph (a -> b) -> Graph a -> Graph b

liftA2 :: (a -> b -> c) -> Graph a -> Graph b -> Graph c

(*>) :: Graph a -> Graph b -> Graph b

(<*) :: Graph a -> Graph b -> Graph a

Applicative List

Defined in Algebra.Graph.Internal

Methods

pure :: a -> List a

(<*>) :: List (a -> b) -> List a -> List b

liftA2 :: (a -> b -> c) -> List a -> List b -> List c

(*>) :: List a -> List b -> List b

(<*) :: List a -> List b -> List a

Applicative Concurrently

Defined in Control.Concurrent.Async

Methods

pure :: a -> Concurrently a

(<*>) :: Concurrently (a -> b) -> Concurrently a -> Concurrently b

liftA2 :: (a -> b -> c) -> Concurrently a -> Concurrently b -> Concurrently c

(*>) :: Concurrently a -> Concurrently b -> Concurrently b

(<*) :: Concurrently a -> Concurrently b -> Concurrently a

Applicative Complex

Since: base-4.9.0.0

Defined in Data.Complex

Methods

pure :: a -> Complex a

(<*>) :: Complex (a -> b) -> Complex a -> Complex b

liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c

(*>) :: Complex a -> Complex b -> Complex b

(<*) :: Complex a -> Complex b -> Complex a

Applicative Min

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

pure :: a -> Min a

(<*>) :: Min (a -> b) -> Min a -> Min b

liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c

(*>) :: Min a -> Min b -> Min b

(<*) :: Min a -> Min b -> Min a

Applicative Max

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

pure :: a -> Max a

(<*>) :: Max (a -> b) -> Max a -> Max b

liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c

(*>) :: Max a -> Max b -> Max b

(<*) :: Max a -> Max b -> Max a

Applicative First

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

pure :: a -> First a

(<*>) :: First (a -> b) -> First a -> First b

liftA2 :: (a -> b -> c) -> First a -> First b -> First c

(*>) :: First a -> First b -> First b

(<*) :: First a -> First b -> First a

Applicative Last

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

pure :: a -> Last a

(<*>) :: Last (a -> b) -> Last a -> Last b

liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c

(*>) :: Last a -> Last b -> Last b

(<*) :: Last a -> Last b -> Last a

Applicative Option

Since: base-4.9.0.0

Defined in Data.Semigroup

Methods

pure :: a -> Option a

(<*>) :: Option (a -> b) -> Option a -> Option b

liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c

(*>) :: Option a -> Option b -> Option b

(<*) :: Option a -> Option b -> Option a

Applicative ZipList

f <$> ZipList xs1 <*> ... <*> ZipList xsN
    = ZipList (zipWithN f xs1 ... xsN)

where zipWithN refers to the zipWith function of the appropriate arity (zipWith, zipWith3, zipWith4, ...). For example:

(\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
    = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
    = ZipList {getZipList = ["a5","b6b6","c7c7c7"]}

Since: base-2.1

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 STM

Since: base-4.8.0.0

Defined in GHC.Conc.Sync

Methods

pure :: a -> STM a

(<*>) :: STM (a -> b) -> STM a -> STM b

liftA2 :: (a -> b -> c) -> STM a -> STM b -> STM c

(*>) :: STM a -> STM b -> STM b

(<*) :: STM a -> STM b -> STM a

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

Since: base-4.6.0.0

Defined in Text.ParserCombinators.ReadPrec

Methods

pure :: a -> ReadPrec a

(<*>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b

liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c

(*>) :: ReadPrec a -> ReadPrec b -> ReadPrec b

(<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a

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

Defined in Data.Binary.Put

Methods

pure :: a -> PutM a

(<*>) :: PutM (a -> b) -> PutM a -> PutM b

liftA2 :: (a -> b -> c) -> PutM a -> PutM b -> PutM c

(*>) :: PutM a -> PutM b -> PutM b

(<*) :: PutM a -> PutM b -> PutM a

Applicative Get

Defined in Data.Binary.Get.Internal

Methods

pure :: a -> Get a

(<*>) :: Get (a -> b) -> Get a -> Get b

liftA2 :: (a -> b -> c) -> Get a -> Get b -> Get c

(*>) :: Get a -> Get b -> Get b

(<*) :: Get a -> Get b -> Get a

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

Since: containers-0.5.4

Defined in Data.Sequence.Internal

Methods

pure :: a -> Seq a

(<*>) :: Seq (a -> b) -> Seq a -> Seq b

liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c

(*>) :: Seq a -> Seq b -> Seq b

(<*) :: Seq a -> Seq b -> Seq a

Applicative DNonEmpty

Defined in Data.DList.DNonEmpty.Internal

Methods

pure :: a -> DNonEmpty a

(<*>) :: DNonEmpty (a -> b) -> DNonEmpty a -> DNonEmpty b

liftA2 :: (a -> b -> c) -> DNonEmpty a -> DNonEmpty b -> DNonEmpty c

(*>) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty b

(<*) :: DNonEmpty a -> DNonEmpty b -> DNonEmpty a

Applicative DList

Defined in Data.DList.Internal

Methods

pure :: a -> DList a

(<*>) :: DList (a -> b) -> DList a -> DList b

liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c

(*>) :: DList a -> DList b -> DList b

(<*) :: DList a -> DList b -> DList a

Applicative TcPluginM

Defined in TcRnTypes

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 Ghc

Defined in GhcMonad

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 CompPipeline

Defined in PipelineMonad

Methods

pure :: a -> CompPipeline a

(<*>) :: CompPipeline (a -> b) -> CompPipeline a -> CompPipeline b

liftA2 :: (a -> b -> c) -> CompPipeline a -> CompPipeline b -> CompPipeline c

(*>) :: CompPipeline a -> CompPipeline b -> CompPipeline b

(<*) :: CompPipeline a -> CompPipeline b -> CompPipeline a

Applicative Hsc

Defined in HscTypes

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 PV

Defined in RdrHsSyn

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 UnifyResultM

Defined in 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 P

Defined in 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 CoreM

Defined in CoreMonad

Methods

pure :: a -> CoreM a

(<*>) :: CoreM (a -> b) -> CoreM a -> CoreM b

liftA2 :: (a -> b -> c) -> CoreM a -> CoreM b -> CoreM c

(*>) :: CoreM a -> CoreM b -> CoreM b

(<*) :: CoreM a -> CoreM b -> CoreM a

Applicative UniqSM

Defined in UniqSupply

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 Pair

Defined in 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 Heapsize

Defined in HeapSize

Methods

pure :: a -> Heapsize a

(<*>) :: Heapsize (a -> b) -> Heapsize a -> Heapsize b

liftA2 :: (a -> b -> c) -> Heapsize a -> Heapsize b -> Heapsize c

(*>) :: Heapsize a -> Heapsize b -> Heapsize b

(<*) :: Heapsize a -> Heapsize b -> Heapsize a

Applicative CradleLoadResult

Defined in HIE.Bios.Types

Methods

pure :: a -> CradleLoadResult a

(<*>) :: CradleLoadResult (a -> b) -> CradleLoadResult a -> CradleLoadResult b

liftA2 :: (a -> b -> c) -> CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult c

(*>) :: CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult b

(<*) :: CradleLoadResult a -> CradleLoadResult b -> CradleLoadResult a

Applicative Rules

Defined in Development.IDE.Graph.Internal.Rules

Methods

pure :: a -> Rules a

(<*>) :: Rules (a -> b) -> Rules a -> Rules b

liftA2 :: (a -> b -> c) -> Rules a -> Rules b -> Rules c

(*>) :: Rules a -> Rules b -> Rules b

(<*) :: Rules a -> Rules b -> Rules a

Applicative Action

Defined in Development.IDE.Graph.Internal.Action

Methods

pure :: a -> Action a

(<*>) :: Action (a -> b) -> Action a -> Action b

liftA2 :: (a -> b -> c) -> Action a -> Action b -> Action c

(*>) :: Action a -> Action b -> Action b

(<*) :: Action a -> Action b -> Action a

Applicative Eval

Defined in Control.Parallel.Strategies

Methods

pure :: a -> Eval a

(<*>) :: Eval (a -> b) -> Eval a -> Eval b

liftA2 :: (a -> b -> c) -> Eval a -> Eval b -> Eval c

(*>) :: Eval a -> Eval b -> Eval b

(<*) :: Eval a -> Eval b -> Eval a

Applicative Vector

Defined in Data.Vector

Methods

pure :: a -> Vector a

(<*>) :: Vector (a -> b) -> Vector a -> Vector b

liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c

(*>) :: Vector a -> Vector b -> Vector b

(<*) :: Vector a -> Vector b -> Vector a

Applicative ReadM

Defined in Options.Applicative.Types

Methods

pure :: a -> ReadM a

(<*>) :: ReadM (a -> b) -> ReadM a -> ReadM b

liftA2 :: (a -> b -> c) -> ReadM a -> ReadM b -> ReadM c

(*>) :: ReadM a -> ReadM b -> ReadM b

(<*) :: ReadM a -> ReadM b -> ReadM a

Applicative Parser

Defined in Options.Applicative.Types

Methods

pure :: a -> Parser a

(<*>) :: Parser (a -> b) -> Parser a -> Parser b

liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c

(*>) :: Parser a -> Parser b -> Parser b

(<*) :: Parser a -> Parser b -> Parser a

Applicative ParserM

Defined in Options.Applicative.Types

Methods

pure :: a -> ParserM a

(<*>) :: ParserM (a -> b) -> ParserM a -> ParserM b

liftA2 :: (a -> b -> c) -> ParserM a -> ParserM b -> ParserM c

(*>) :: ParserM a -> ParserM b -> ParserM b

(<*) :: ParserM a -> ParserM b -> ParserM a

Applicative ParserResult

Defined in Options.Applicative.Types

Methods

pure :: a -> ParserResult a

(<*>) :: ParserResult (a -> b) -> ParserResult a -> ParserResult b

liftA2 :: (a -> b -> c) -> ParserResult a -> ParserResult b -> ParserResult c

(*>) :: ParserResult a -> ParserResult b -> ParserResult b

(<*) :: ParserResult a -> ParserResult b -> ParserResult a

Applicative SmallArray

Defined in Data.Primitive.SmallArray

Methods

pure :: a -> SmallArray a

(<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b

liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c

(*>) :: SmallArray a -> SmallArray b -> SmallArray b

(<*) :: SmallArray a -> SmallArray b -> SmallArray a

Applicative Array

Defined in Data.Primitive.Array

Methods

pure :: a -> Array a

(<*>) :: Array (a -> b) -> Array a -> Array b

liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c

(*>) :: Array a -> Array b -> Array b

(<*) :: Array a -> Array b -> Array a

Applicative Rules

Defined in Development.Shake.Internal.Core.Rules

Methods

pure :: a -> Rules a

(<*>) :: Rules (a -> b) -> Rules a -> Rules b

liftA2 :: (a -> b -> c) -> Rules a -> Rules b -> Rules c

(*>) :: Rules a -> Rules b -> Rules b

(<*) :: Rules a -> Rules b -> Rules a

Applicative Action

Defined in Development.Shake.Internal.Core.Types

Methods

pure :: a -> Action a

(<*>) :: Action (a -> b) -> Action a -> Action b

liftA2 :: (a -> b -> c) -> Action a -> Action b -> Action c

(*>) :: Action a -> Action b -> Action b

(<*) :: Action a -> Action b -> Action a

Applicative RowParser

Defined in Database.SQLite.Simple.Internal

Methods

pure :: a -> RowParser a

(<*>) :: RowParser (a -> b) -> RowParser a -> RowParser b

liftA2 :: (a -> b -> c) -> RowParser a -> RowParser b -> RowParser c

(*>) :: RowParser a -> RowParser b -> RowParser b

(<*) :: RowParser a -> RowParser b -> RowParser a

Applicative Flat

Defined in UnliftIO.Internals.Async

Methods

pure :: a -> Flat a

(<*>) :: Flat (a -> b) -> Flat a -> Flat b

liftA2 :: (a -> b -> c) -> Flat a -> Flat b -> Flat c

(*>) :: Flat a -> Flat b -> Flat b

(<*) :: Flat a -> Flat b -> Flat a

Applicative FlatApp

Defined in UnliftIO.Internals.Async

Methods

pure :: a -> FlatApp a

(<*>) :: FlatApp (a -> b) -> FlatApp a -> FlatApp b

liftA2 :: (a -> b -> c) -> FlatApp a -> FlatApp b -> FlatApp c

(*>) :: FlatApp a -> FlatApp b -> FlatApp b

(<*) :: FlatApp a -> FlatApp b -> FlatApp a

Applicative Id

Defined in Data.Vector.Fusion.Util

Methods

pure :: a -> Id a

(<*>) :: Id (a -> b) -> Id a -> Id b

liftA2 :: (a -> b -> c) -> Id a -> Id b -> Id c

(*>) :: Id a -> Id b -> Id b

(<*) :: Id a -> Id b -> Id a

Applicative Box

Defined in Data.Vector.Fusion.Util

Methods

pure :: a -> Box a

(<*>) :: Box (a -> b) -> Box a -> Box b

liftA2 :: (a -> b -> c) -> Box a -> Box b -> Box c

(*>) :: Box a -> Box b -> Box b

(<*) :: Box a -> Box b -> Box 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 PositionResult

Defined in Development.IDE.Core.PositionMapping

Methods

pure :: a -> PositionResult a

(<*>) :: PositionResult (a -> b) -> PositionResult a -> PositionResult b

liftA2 :: (a -> b -> c) -> PositionResult a -> PositionResult b -> PositionResult c

(*>) :: PositionResult a -> PositionResult b -> PositionResult b

(<*) :: PositionResult a -> PositionResult b -> PositionResult a

Applicative NormM

Defined in 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 DFFV

Defined in TidyPgm

Methods

pure :: a -> DFFV a

(<*>) :: DFFV (a -> b) -> DFFV a -> DFFV b

liftA2 :: (a -> b -> c) -> DFFV a -> DFFV b -> DFFV c

(*>) :: DFFV a -> DFFV b -> DFFV b

(<*) :: DFFV a -> DFFV b -> DFFV a

Applicative UM

Defined in 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 Extended

Defined in Algebra.Graph.Label

Methods

pure :: a -> Extended a

(<*>) :: Extended (a -> b) -> Extended a -> Extended b

liftA2 :: (a -> b -> c) -> Extended a -> Extended b -> Extended c

(*>) :: Extended a -> Extended b -> Extended b

(<*) :: Extended a -> Extended b -> Extended a

Applicative IdeAction

Defined in Development.IDE.Core.Shake

Methods

pure :: a -> IdeAction a

(<*>) :: IdeAction (a -> b) -> IdeAction a -> IdeAction b

liftA2 :: (a -> b -> c) -> IdeAction a -> IdeAction b -> IdeAction c

(*>) :: IdeAction a -> IdeAction b -> IdeAction b

(<*) :: IdeAction a -> IdeAction b -> IdeAction a

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

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)

Representable f => Applicative (Co f)

Defined in Data.Functor.Rep

Methods

pure :: a -> Co f a

(<*>) :: Co f (a -> b) -> Co f a -> Co f b

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

(*>) :: Co f a -> Co f b -> Co f b

(<*) :: Co f a -> Co f b -> Co f a

Applicative (ST s)

Since: base-4.4.0.0

Defined in GHC.ST

Methods

pure :: a -> ST s a

(<*>) :: ST s (a -> b) -> ST s a -> ST s b

liftA2 :: (a -> b -> c) -> ST s a -> ST s b -> ST s c

(*>) :: ST s a -> ST s b -> ST s b

(<*) :: ST s a -> ST s b -> ST s a

Applicative (Parser i)

Defined in Data.Attoparsec.Internal.Types

Methods

pure :: a -> Parser i a

(<*>) :: Parser i (a -> b) -> Parser i a -> Parser i b

liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c

(*>) :: Parser i a -> Parser i b -> Parser i b

(<*) :: Parser i a -> Parser i b -> Parser i a

Applicative (ST s)

Since: base-2.1

Defined in Control.Monad.ST.Lazy.Imp

Methods

pure :: a -> ST s a

(<*>) :: ST s (a -> b) -> ST s a -> ST s b

liftA2 :: (a -> b -> c) -> ST s a -> ST s b -> ST s c

(*>) :: ST s a -> ST s b -> ST s b

(<*) :: ST s a -> ST s b -> ST s 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

Arrow a => Applicative (ArrowMonad a)

Since: base-4.6.0.0

Defined in Control.Arrow

Methods

pure :: a0 -> ArrowMonad a a0

(<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b

liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c

(*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b

(<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0

Applicative (Proxy :: Type -> Type)

Since: base-4.7.0.0

Defined in Data.Proxy

Methods

pure :: a -> Proxy a

(<*>) :: Proxy (a -> b) -> Proxy a -> Proxy b

liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c

(*>) :: Proxy a -> Proxy b -> Proxy b

(<*) :: Proxy a -> Proxy b -> Proxy a

(Functor m, Monad m) => Applicative (MaybeT m)

Defined in Control.Monad.Trans.Maybe

Methods

pure :: a -> MaybeT m a

(<*>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b

liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c

(*>) :: MaybeT m a -> MaybeT m b -> MaybeT m b

(<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a

Monad m => Applicative (ZipSource m)

Defined in Data.Conduit.Internal.Conduit

Methods

pure :: a -> ZipSource m a

(<*>) :: ZipSource m (a -> b) -> ZipSource m a -> ZipSource m b

liftA2 :: (a -> b -> c) -> ZipSource m a -> ZipSource m b -> ZipSource m c

(*>) :: ZipSource m a -> ZipSource m b -> ZipSource m b

(<*) :: ZipSource m a -> ZipSource m b -> ZipSource m a

Applicative m => Applicative (ResourceT m)

Defined in Control.Monad.Trans.Resource.Internal

Methods

pure :: a -> ResourceT m a

(<*>) :: ResourceT m (a -> b) -> ResourceT m a -> ResourceT m b

liftA2 :: (a -> b -> c) -> ResourceT m a -> ResourceT m b -> ResourceT m c

(*>) :: ResourceT m a -> ResourceT m b -> ResourceT m b

(<*) :: ResourceT m a -> ResourceT m b -> ResourceT m a

Alternative f => Applicative (Cofree f)

Defined in Control.Comonad.Cofree

Methods

pure :: a -> Cofree f a

(<*>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b

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

(*>) :: Cofree f a -> Cofree f b -> Cofree f b

(<*) :: Cofree f a -> Cofree f b -> Cofree f a

Functor f => Applicative (Free f)

Defined in Control.Monad.Free

Methods

pure :: a -> Free f a

(<*>) :: Free f (a -> b) -> Free f a -> Free f b

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

(*>) :: Free f a -> Free f b -> Free f b

(<*) :: Free f a -> Free f b -> Free f a

Applicative m => Applicative (GhcT m)

Defined in GhcMonad

Methods

pure :: a -> GhcT m a

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

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

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

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

Applicative (IOEnv m)

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

Monad m => Applicative (EwM m)

Defined in CmdLineParser

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

Defined in CmdLineParser

Methods

pure :: a -> CmdLineP s a

(<*>) :: CmdLineP s (a -> b) -> CmdLineP s a -> CmdLineP s b

liftA2 :: (a -> b -> c) -> CmdLineP s a -> CmdLineP s b -> CmdLineP s c

(*>) :: CmdLineP s a -> CmdLineP s b -> CmdLineP s b

(<*) :: CmdLineP s a -> CmdLineP s b -> CmdLineP s a

Applicative (MaybeErr err)

Defined in Maybes

Methods

pure :: a -> MaybeErr err a

(<*>) :: MaybeErr err (a -> b) -> MaybeErr err a -> MaybeErr err b

liftA2 :: (a -> b -> c) -> MaybeErr err a -> MaybeErr err b -> MaybeErr err c

(*>) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err b

(<*) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err a

Monad m => Applicative (TransformT m)

Defined in Language.Haskell.GHC.ExactPrint.Transform

Methods

pure :: a -> TransformT m a

(<*>) :: TransformT m (a -> b) -> TransformT m a -> TransformT m b

liftA2 :: (a -> b -> c) -> TransformT m a -> TransformT m b -> TransformT m c

(*>) :: TransformT m a -> TransformT m b -> TransformT m b

(<*) :: TransformT m a -> TransformT m b -> TransformT m a

Monad m => Applicative (DbMonadT m)

Defined in HieDb.Types

Methods

pure :: a -> DbMonadT m a

(<*>) :: DbMonadT m (a -> b) -> DbMonadT m a -> DbMonadT m b

liftA2 :: (a -> b -> c) -> DbMonadT m a -> DbMonadT m b -> DbMonadT m c

(*>) :: DbMonadT m a -> DbMonadT m b -> DbMonadT m b

(<*) :: DbMonadT m a -> DbMonadT m b -> DbMonadT m a

Applicative f => Applicative (Yoneda f)

Defined in Data.Functor.Yoneda

Methods

pure :: a -> Yoneda f a

(<*>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b

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

(*>) :: Yoneda f a -> Yoneda f b -> Yoneda f b

(<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a

Applicative (ReifiedGetter s)

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedGetter s a

(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b

liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c

(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b

(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a

Applicative (ReifiedFold s)

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedFold s a

(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b

liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c

(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b

(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a

Applicative f => Applicative (Indexing f)

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a -> Indexing f a

(<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b

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

(*>) :: Indexing f a -> Indexing f b -> Indexing f b

(<*) :: Indexing f a -> Indexing f b -> Indexing f a

Applicative f => Applicative (Indexing64 f)

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a -> Indexing64 f a

(<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b

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

(*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b

(<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a

Applicative f => Applicative (WrappedPoly f)

Defined in Data.MonoTraversable

Methods

pure :: a -> WrappedPoly f a

(<*>) :: WrappedPoly f (a -> b) -> WrappedPoly f a -> WrappedPoly f b

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

(*>) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f b

(<*) :: WrappedPoly f a -> WrappedPoly f b -> WrappedPoly f a

Applicative m => Applicative (ListT m)

Defined in Control.Monad.Trans.List

Methods

pure :: a -> ListT m a

(<*>) :: ListT m (a -> b) -> ListT m a -> ListT m b

liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c

(*>) :: ListT m a -> ListT m b -> ListT m b

(<*) :: ListT m a -> ListT m b -> ListT m a

Semigroup a => Applicative (These a)

Defined in Data.Strict.These

Methods

pure :: a0 -> These a a0

(<*>) :: These a (a0 -> b) -> These a a0 -> These a b

liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c

(*>) :: These a a0 -> These a b -> These a b

(<*) :: These a a0 -> These a b -> These a a0

Semigroup a => Applicative (These a)

Defined in Data.These

Methods

pure :: a0 -> These a a0

(<*>) :: These a (a0 -> b) -> These a a0 -> These a b

liftA2 :: (a0 -> b -> c) -> These a a0 -> These a b -> These a c

(*>) :: These a a0 -> These a b -> These a b

(<*) :: These a a0 -> These a b -> These a a0

MonadUnliftIO m => Applicative (Concurrently m)

Since: unliftio-0.1.0.0

Defined in UnliftIO.Internals.Async

Methods

pure :: a -> Concurrently m a

(<*>) :: Concurrently m (a -> b) -> Concurrently m a -> Concurrently m b

liftA2 :: (a -> b -> c) -> Concurrently m a -> Concurrently m b -> Concurrently m c

(*>) :: Concurrently m a -> Concurrently m b -> Concurrently m b

(<*) :: Concurrently m a -> Concurrently m b -> Concurrently m a

MonadUnliftIO m => Applicative (Conc m)

Since: unliftio-0.2.9.0

Defined in UnliftIO.Internals.Async

Methods

pure :: a -> Conc m a

(<*>) :: Conc m (a -> b) -> Conc m a -> Conc m b

liftA2 :: (a -> b -> c) -> Conc m a -> Conc m b -> Conc m c

(*>) :: Conc m a -> Conc m b -> Conc m b

(<*) :: Conc m a -> Conc m b -> Conc m a

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 m => Applicative (QuoteToQuasi m)

Defined in Language.Haskell.TH.Syntax.Compat

Methods

pure :: a -> QuoteToQuasi m a

(<*>) :: QuoteToQuasi m (a -> b) -> QuoteToQuasi m a -> QuoteToQuasi m b

liftA2 :: (a -> b -> c) -> QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m c

(*>) :: QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m b

(<*) :: QuoteToQuasi m a -> QuoteToQuasi m b -> QuoteToQuasi m a

Monad m => Applicative (ExceptStringT m)

Defined in Development.IDE.GHC.ExactPrint

Methods

pure :: a -> ExceptStringT m a

(<*>) :: ExceptStringT m (a -> b) -> ExceptStringT m a -> ExceptStringT m b

liftA2 :: (a -> b -> c) -> ExceptStringT m a -> ExceptStringT m b -> ExceptStringT m c

(*>) :: ExceptStringT m a -> ExceptStringT m b -> ExceptStringT m b

(<*) :: ExceptStringT m a -> ExceptStringT m b -> ExceptStringT m a

Applicative (Tracked age)

Defined in Development.IDE.Core.UseStale

Methods

pure :: a -> Tracked age a

(<*>) :: Tracked age (a -> b) -> Tracked age a -> Tracked age b

liftA2 :: (a -> b -> c) -> Tracked age a -> Tracked age b -> Tracked age c

(*>) :: Tracked age a -> Tracked age b -> Tracked age b

(<*) :: Tracked age a -> Tracked age b -> Tracked age a

Applicative 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

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

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

Applicative m => Applicative (Kleisli m a)

Since: base-4.14.0.0

Defined in Control.Arrow

Methods

pure :: a0 -> Kleisli m a a0

(<*>) :: Kleisli m a (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b

liftA2 :: (a0 -> b -> c) -> Kleisli m a a0 -> Kleisli m a b -> Kleisli m a c

(*>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b

(<*) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a a0

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

Since: base-2.0.1

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

Biapplicative p => Applicative (Join p)

Defined in Data.Bifunctor.Join

Methods

pure :: a -> Join p a

(<*>) :: Join p (a -> b) -> Join p a -> Join p b

liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c

(*>) :: Join p a -> Join p b -> Join p b

(<*) :: Join p a -> Join p b -> Join p a

Biapplicative p => Applicative (Fix p)

Defined in Data.Bifunctor.Fix

Methods

pure :: a -> Fix p a

(<*>) :: Fix p (a -> b) -> Fix p a -> Fix p b

liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c

(*>) :: Fix p a -> Fix p b -> Fix p b

(<*) :: Fix p a -> Fix p b -> Fix p a

Applicative m => Applicative (IdentityT m)

Defined in Control.Monad.Trans.Identity

Methods

pure :: a -> IdentityT m a

(<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b

liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c

(*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b

(<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a

(Monoid w, Applicative m) => Applicative (WriterT w m)

Defined in Control.Monad.Trans.Writer.Strict

Methods

pure :: a -> WriterT w m a

(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b

liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c

(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b

(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a

(Monoid w, Applicative m) => Applicative (WriterT w m)

Defined in Control.Monad.Trans.Writer.Lazy

Methods

pure :: a -> WriterT w m a

(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b

liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c

(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b

(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a

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

Defined in Control.Monad.Trans.State.Strict

Methods

pure :: a -> StateT s m a

(<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b

liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c

(*>) :: StateT s m a -> StateT s m b -> StateT s m b

(<*) :: StateT s m a -> StateT s m b -> StateT s m a

(Functor m, Monad m) => Applicative (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

Applicative m => Applicative (ReaderT r m)

Defined in Control.Monad.Trans.Reader

Methods

pure :: a -> ReaderT r m a

(<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b

liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c

(*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b

(<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a

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

Defined in Control.Monad.Trans.Except

Methods

pure :: a -> ExceptT e m a

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

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

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

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

Monad m => Applicative (ZipSink i m)

Defined in Data.Conduit.Internal.Conduit

Methods

pure :: a -> ZipSink i m a

(<*>) :: ZipSink i m (a -> b) -> ZipSink i m a -> ZipSink i m b

liftA2 :: (a -> b -> c) -> ZipSink i m a -> ZipSink i m b -> ZipSink i m c

(*>) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m b

(<*) :: ZipSink i m a -> ZipSink i m b -> ZipSink i m a

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

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

Since: containers-0.5.9

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 f, Monad m) => Applicative (FreeT f m)

Defined in Control.Monad.Trans.Free

Methods

pure :: a -> FreeT f m a

(<*>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b

liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c

(*>) :: FreeT f m a -> FreeT f m b -> FreeT f m b

(<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a

(Alternative f, Applicative w) => Applicative (CofreeT f w)

Defined in Control.Comonad.Trans.Cofree

Methods

pure :: a -> CofreeT f w a

(<*>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b

liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c

(*>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b

(<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a

Applicative f => Applicative (Indexing f)

Defined in WithIndex

Methods

pure :: a -> Indexing f a

(<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b

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

(*>) :: Indexing f a -> Indexing f b -> Indexing f b

(<*) :: Indexing f a -> Indexing f b -> Indexing f a

(Applicative f, Applicative g) => Applicative (Day f g)

Defined in Data.Functor.Day

Methods

pure :: a -> Day f g a

(<*>) :: Day f g (a -> b) -> Day f g a -> Day f g b

liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c

(*>) :: Day f g a -> Day f g b -> Day f g b

(<*) :: Day f g a -> Day f g b -> Day f g a

(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

Applicative (Tagged s)

Defined in Data.Tagged

Methods

pure :: a -> Tagged s a

(<*>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b

liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c

(*>) :: Tagged s a -> Tagged s b -> Tagged s b

(<*) :: Tagged s a -> Tagged s b -> Tagged s a

Applicative (Mafic a b)

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> Mafic a b a0

(<*>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0

liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c

(*>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0

(<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0

Applicative (Indexed i a)

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a0 -> Indexed i a a0

(<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b

liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c

(*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b

(<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0

Applicative (Flows i b)

This is an illegal Applicative.

Defined in Control.Lens.Internal.Level

Methods

pure :: a -> Flows i b a

(<*>) :: Flows i b (a -> b0) -> Flows i b a -> Flows i b b0

liftA2 :: (a -> b0 -> c) -> Flows i b a -> Flows i b b0 -> Flows i b c

(*>) :: Flows i b a -> Flows i b b0 -> Flows i b b0

(<*) :: Flows i b a -> Flows i b b0 -> Flows i b a

Applicative m => Applicative (LspT config m)

Defined in Language.LSP.Server.Core

Methods

pure :: a -> LspT config m a

(<*>) :: LspT config m (a -> b) -> LspT config m a -> LspT config m b

liftA2 :: (a -> b -> c) -> LspT config m a -> LspT config m b -> LspT config m c

(*>) :: LspT config m a -> LspT config m b -> LspT config m b

(<*) :: LspT config m a -> LspT config m b -> LspT config m a

(Applicative (Rep p), Representable p) => Applicative (Prep p)

Defined in Data.Profunctor.Rep

Methods

pure :: a -> Prep p a

(<*>) :: Prep p (a -> b) -> Prep p a -> Prep p b

liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c

(*>) :: Prep p a -> Prep p b -> Prep p b

(<*) :: Prep p a -> Prep p b -> Prep p a

(Monoid w, Functor m, Monad m) => Applicative (AccumT w m)

Defined in Control.Monad.Trans.Accum

Methods

pure :: a -> AccumT w m a

(<*>) :: AccumT w m (a -> b) -> AccumT w m a -> AccumT w m b

liftA2 :: (a -> b -> c) -> AccumT w m a -> AccumT w m b -> AccumT w m c

(*>) :: AccumT w m a -> AccumT w m b -> AccumT w m b

(<*) :: AccumT w m a -> AccumT w m b -> AccumT w m a

(Functor m, Monad m) => Applicative (WriterT w m)

Defined in Control.Monad.Trans.Writer.CPS

Methods

pure :: a -> WriterT w m a

(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b

liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c

(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b

(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a

(Functor m, Monad m) => Applicative (SelectT r m)

Defined in Control.Monad.Trans.Select

Methods

pure :: a -> SelectT r m a

(<*>) :: SelectT r m (a -> b) -> SelectT r m a -> SelectT r m b

liftA2 :: (a -> b -> c) -> SelectT r m a -> SelectT r m b -> SelectT r m c

(*>) :: SelectT r m a -> SelectT r m b -> SelectT r m b

(<*) :: SelectT r m a -> SelectT r m b -> SelectT r m a

Applicative (Mag a b)

Defined in Data.Biapplicative

Methods

pure :: a0 -> Mag a b a0

(<*>) :: Mag a b (a0 -> b0) -> Mag a b a0 -> Mag a b b0

liftA2 :: (a0 -> b0 -> c) -> Mag a b a0 -> Mag a b b0 -> Mag a b c

(*>) :: Mag a b a0 -> Mag a b b0 -> Mag a b b0

(<*) :: Mag a b a0 -> Mag a b b0 -> Mag a b a0

Monoid m => Applicative (Holes t m)

Defined in Control.Lens.Traversal

Methods

pure :: a -> Holes t m a

(<*>) :: Holes t m (a -> b) -> Holes t m a -> Holes t m b

liftA2 :: (a -> b -> c) -> Holes t m a -> Holes t m b -> Holes t m c

(*>) :: Holes t m a -> Holes t m b -> Holes t m b

(<*) :: Holes t m a -> Holes t m b -> Holes t m a

Applicative ((->) r :: Type -> Type)

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

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

(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 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 f, Applicative g) => Applicative (Product f g)

Since: base-4.9.0.0

Defined in Data.Functor.Product

Methods

pure :: a -> Product f g a

(<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b

liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c

(*>) :: Product f g a -> Product f g b -> Product f g b

(<*) :: Product f g a -> Product f g b -> Product f g a

Applicative (ConduitT i o m)

Defined in Data.Conduit.Internal.Conduit

Methods

pure :: a -> ConduitT i o m a

(<*>) :: ConduitT i o m (a -> b) -> ConduitT i o m a -> ConduitT i o m b

liftA2 :: (a -> b -> c) -> ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m c

(*>) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m b

(<*) :: ConduitT i o m a -> ConduitT i o m b -> ConduitT i o m a

Monad m => Applicative (ZipConduit i o m)

Defined in Data.Conduit.Internal.Conduit

Methods

pure :: a -> ZipConduit i o m a

(<*>) :: ZipConduit i o m (a -> b) -> ZipConduit i o m a -> ZipConduit i o m b

liftA2 :: (a -> b -> c) -> ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m c

(*>) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m b

(<*) :: ZipConduit i o m a -> ZipConduit i o m b -> ZipConduit i o m a

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

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

Since: containers-0.5.9

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

Applicative (Molten i a b)

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> Molten i a b a0

(<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0

liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c

(*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0

(<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0

Applicative (Bazaar p a b)

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> Bazaar p a b a0

(<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0

liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c

(*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0

(<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0

Applicative (ContT r m)

Defined in Control.Monad.Trans.Cont

Methods

pure :: a -> ContT r m a

(<*>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b

liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c

(*>) :: ContT r m a -> ContT r m b -> ContT r m b

(<*) :: ContT r m a -> ContT r m b -> ContT r m a

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

(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 g) => Applicative (Compose f g)

Since: base-4.9.0.0

Defined in Data.Functor.Compose

Methods

pure :: a -> Compose f g a

(<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b

liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c

(*>) :: Compose f g a -> Compose f g b -> Compose f g b

(<*) :: Compose f g a -> Compose f g b -> Compose f g a

(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)

Defined in Control.Monad.Trans.RWS.Strict

Methods

pure :: a -> RWST r w s m a

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a

(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m)

Defined in Control.Monad.Trans.RWS.Lazy

Methods

pure :: a -> RWST r w s m a

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a

(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

Applicative (TakingWhile p f a b)

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> TakingWhile p f a b a0

(<*>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0

liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c

(*>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0

(<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0

Applicative (BazaarT p g a b)

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> BazaarT p g a b a0

(<*>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0

liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c

(*>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0

(<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0

Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s)

Defined in Data.Reflection

Methods

pure :: a -> ReflectedApplicative f s a

(<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b

liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c

(*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b

(<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a

(Functor m, Monad m) => Applicative (RWST r w s m)

Defined in Control.Monad.Trans.RWS.CPS

Methods

pure :: a -> RWST r w s m a

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a

Monad m => Applicative (Pipe l i o u m)

Defined in Data.Conduit.Internal.Pipe

Methods

pure :: a -> Pipe l i o u m a

(<*>) :: Pipe l i o u m (a -> b) -> Pipe l i o u m a -> Pipe l i o u m b

liftA2 :: (a -> b -> c) -> Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m c

(*>) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m b

(<*) :: Pipe l i o u m a -> Pipe l i o u m b -> Pipe l i o u m a

mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

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.

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

foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

Monadic fold over the elements of a structure, associating to the left, i.e. from left to right.

pprRuntimeTrace

Arguments

:: String

header

-> SDoc

information to output

-> CoreExpr

expression

-> DsM CoreExpr

Inject a trace message into the compiled program. Whereas pprTrace prints out information *while compiling*, pprRuntimeTrace captures that information and causes it to be printed *at runtime* using Debug.Trace.trace.

pprRuntimeTrace hdr doc expr

will produce an expression that looks like

trace (hdr + doc) expr

When using this to debug a module that Debug.Trace depends on, it is necessary to import {--} Debug.Trace () in that module. We could avoid this inconvenience by wiring in Debug.Trace.trace, but that doesn't seem worth the effort and maintenance cost.

dsWhenNoErrs :: DsM a -> (a -> CoreExpr) -> DsM CoreExpr

Runs the thing_inside. If there are no errors, then returns the expr given. Otherwise, returns unitExpr. This is useful for doing a bunch of levity polymorphism checks and then avoiding making a core App. (If we make a core App on a levity polymorphic argument, detecting how to handle the let/app invariant might call isUnliftedType, which panics on a levity polymorphic type.) See #12709 for an example of why this machinery is necessary.

dsNoLevPolyExpr :: CoreExpr -> SDoc -> DsM ()

Check an expression for levity polymorphism, failing if it is levity polymorphic.

dsNoLevPoly :: Type -> SDoc -> DsM ()

Fail with an error message if the type is levity polymorphic.

discardWarningsDs :: DsM a -> DsM a

dsExtendMetaEnv :: DsMetaEnv -> DsM a -> DsM a

dsLookupMetaEnv :: Name -> DsM (Maybe DsMetaVal)

dsGetCompleteMatches :: TyCon -> DsM [CompleteMatch]

The COMPLETE pragmas provided by the user for a given TyCon.

dsGetMetaEnv :: DsM (NameEnv DsMetaVal)

dsGetFamInstEnvs :: DsM FamInstEnvs

dsLookupConLike :: Name -> DsM ConLike

dsLookupDataCon :: Name -> DsM DataCon

dsLookupTyCon :: Name -> DsM TyCon

dsLookupGlobalId :: Name -> DsM Id

dsLookupGlobal :: Name -> DsM TyThing

mkPrintUnqualifiedDs :: DsM PrintUnqualified

askNoErrsDs :: DsM a -> DsM (a, Bool)

failDs :: DsM a

failWithDs :: SDoc -> DsM a

errDsCoreExpr :: SDoc -> DsM CoreExpr

Issue an error, but return the expression for (), so that we can continue reporting errors.

errDs :: SDoc -> DsM ()

warnIfSetDs :: WarningFlag -> SDoc -> DsM ()

Emit a warning only if the correct WarnReason is set in the DynFlags

warnDs :: WarnReason -> SDoc -> DsM ()

Emit a warning for the current source location NB: Warns whether or not -Wxyz is set

putSrcSpanDs :: SrcSpan -> DsM a -> DsM a

getSrcSpanDs :: DsM SrcSpan

updPmDelta :: Delta -> DsM a -> DsM a

Set the pattern match oracle state within the scope of the given action. See dsl_delta.

getPmDelta :: DsM Delta

Get the current pattern match oracle state. See dsl_delta.

getGhcModeDs :: DsM GhcMode

newSysLocalsDs :: [Type] -> DsM [Id]

newSysLocalsDsNoLP :: [Type] -> DsM [Id]

newFailLocalDs :: Type -> DsM Id

newSysLocalDs :: Type -> DsM Id

newSysLocalDsNoLP :: Type -> DsM Id

newPredVarDs :: PredType -> DsM Var

duplicateLocalDs :: Id -> DsM Id

newUniqueId :: Id -> Type -> DsM Id

initTcDsForSolver :: TcM a -> DsM (Messages, Maybe a)

initDsWithModGuts :: HscEnv -> ModGuts -> DsM a -> IO (Messages, Maybe a)

Run a DsM action in the context of an existing ModGuts

initDs :: HscEnv -> TcGblEnv -> DsM a -> IO (Messages, Maybe a)

Run a DsM action inside the IO monad.

initDsTc :: DsM a -> TcM a

Run a DsM action inside the TcM monad.

fixDs :: (a -> DsM a) -> DsM a

orFail :: CanItFail -> CanItFail -> CanItFail

idDsWrapper :: DsWrapper

data DsMatchContext

Constructors

DsMatchContext (HsMatchContext Name) SrcSpan

Instances

Outputable DsMatchContext

Defined in DsMonad

Methods

ppr :: DsMatchContext -> SDoc

pprPrec :: Rational -> DsMatchContext -> SDoc

data EquationInfo

Constructors

EqnInfo

Fields

• eqn_pats :: [Pat GhcTc]

  The patterns for an equation

  NB: We have already applied decideBangHood to these patterns. See Note [decideBangHood] in DsUtils

• eqn_orig :: Origin

  Was this equation present in the user source?

  This helps us avoid warnings on patterns that GHC elaborated.

  For instance, the pattern -1 :: Word gets desugared into W# :: Word, but we shouldn't warn about an overflowed literal for both of these cases.

• eqn_rhs :: MatchResult

  What to do after match

Instances

Outputable EquationInfo

Defined in DsMonad

Methods

ppr :: EquationInfo -> SDoc

pprPrec :: Rational -> EquationInfo -> SDoc

type DsWrapper = CoreExpr -> CoreExpr

data MatchResult

Constructors

MatchResult CanItFail (CoreExpr -> DsM CoreExpr)

data CanItFail

Constructors

CanFail

CantFail

type DsWarning = (SrcSpan, SDoc)

newUniqueSupply :: TcRnIf gbl lcl UniqSupply

newUnique :: TcRnIf gbl lcl Unique

whenGOptM :: GeneralFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

unsetWOptM :: WarningFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetGOptM :: GeneralFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

xoptM :: Extension -> TcRnIf gbl lcl Bool

type DsM = TcRnIf DsGblEnv DsLclEnv

type DsMetaEnv = NameEnv DsMetaVal

data DsMetaVal

Constructors

DsBound Id

DsSplice (HsExpr GhcTc)

data UniqSupply

Unique Supply

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

traceCmd :: DynFlags -> String -> String -> IO a -> IO a

isWarnMsgFatal :: DynFlags -> WarnMsg -> Maybe (Maybe WarningFlag)

Checks if given WarnMsg is a fatal warning.

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

logOutput :: DynFlags -> PprStyle -> MsgDoc -> IO ()

Like logInfo but with SevOutput rather then SevInfo

printOutputForUser :: DynFlags -> PrintUnqualified -> MsgDoc -> IO ()

printInfoForUser :: DynFlags -> PrintUnqualified -> MsgDoc -> IO ()

putMsg :: DynFlags -> MsgDoc -> IO ()

debugTraceMsg :: DynFlags -> Int -> MsgDoc -> IO ()

withTimingSilentD

Arguments

:: (MonadIO m, HasDynFlags m)

=> 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) and gets the DynFlags from the given Monad.

See Note [withTiming] for more.

withTimingSilent

Arguments

:: MonadIO m

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

withTimingD

Arguments

:: (MonadIO m, HasDynFlags m)

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

Like withTiming but get DynFlags from the Monad.

withTiming

Arguments

:: MonadIO m

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

showPass :: DynFlags -> String -> IO ()

compilationProgressMsg :: DynFlags -> String -> IO ()

fatalErrorMsg'' :: FatalMessager -> String -> IO ()

fatalErrorMsg :: DynFlags -> MsgDoc -> IO ()

warningMsg :: DynFlags -> MsgDoc -> IO ()

errorMsg :: DynFlags -> MsgDoc -> IO ()

dumpSDocWithStyle :: PprStyle -> DynFlags -> DumpFlag -> String -> SDoc -> IO ()

Write out a dump. If --dump-to-file is set then this goes to a file. otherwise emit to stdout.

When hdr is empty, we print in a more compact format (no separators and blank lines)

The DumpFlag is used only to choose the filename to use if --dump-to-file is used; it is not used to decide whether to dump the output

dumpSDocForUser :: DynFlags -> PrintUnqualified -> DumpFlag -> String -> SDoc -> IO ()

A wrapper around dumpSDocWithStyle which uses PprUser style.

mkDumpDoc :: String -> SDoc -> SDoc

dumpIfSet_dyn_printer :: PrintUnqualified -> DynFlags -> DumpFlag -> SDoc -> IO ()

a wrapper around dumpSDoc. First check whether the dump flag is set Do nothing if it is unset

Unlike dumpIfSet_dyn, has a printer argument but no header argument

dumpIfSet_dyn :: DynFlags -> DumpFlag -> String -> SDoc -> IO ()

a wrapper around dumpSDoc. First check whether the dump flag is set Do nothing if it is unset

dumpIfSet :: DynFlags -> Bool -> String -> SDoc -> IO ()

doIfSet_dyn :: DynFlags -> GeneralFlag -> IO () -> IO ()

doIfSet :: Bool -> IO () -> IO ()

ghcExit :: DynFlags -> Int -> IO ()

pprLocErrMsg :: ErrMsg -> SDoc

pprErrMsgBagWithLoc :: Bag ErrMsg -> [SDoc]

formatErrDoc :: DynFlags -> ErrDoc -> SDoc

printBagOfErrors :: DynFlags -> Bag ErrMsg -> IO ()

warningsToMessages :: DynFlags -> WarningMessages -> Messages

errorsFound :: DynFlags -> Messages -> Bool

isEmptyMessages :: Messages -> Bool

emptyMessages :: Messages

mkPlainWarnMsg :: DynFlags -> SrcSpan -> MsgDoc -> ErrMsg

Variant that doesn't care about qualified/unqualified names

mkLongWarnMsg :: DynFlags -> SrcSpan -> PrintUnqualified -> MsgDoc -> MsgDoc -> ErrMsg

A long (multi-line) error message

mkPlainErrMsg :: DynFlags -> SrcSpan -> MsgDoc -> ErrMsg

Variant that doesn't care about qualified/unqualified names

mkErrMsg :: DynFlags -> SrcSpan -> PrintUnqualified -> MsgDoc -> ErrMsg

A short (one-line) error message

mkLongErrMsg :: DynFlags -> SrcSpan -> PrintUnqualified -> MsgDoc -> MsgDoc -> ErrMsg

A long (multi-line) error message

mkErrDoc :: DynFlags -> SrcSpan -> PrintUnqualified -> ErrDoc -> ErrMsg

makeIntoWarning :: WarnReason -> ErrMsg -> ErrMsg

pprMessageBag :: Bag MsgDoc -> SDoc

errDoc :: [MsgDoc] -> [MsgDoc] -> [MsgDoc] -> ErrDoc

unionMessages :: Messages -> Messages -> Messages

orValid :: Validity -> Validity -> Validity

getInvalids :: [Validity] -> [MsgDoc]

allValid :: [Validity] -> Validity

If they aren't all valid, return the first

andValid :: Validity -> Validity -> Validity

isValid :: Validity -> Bool

data Validity

Constructors

IsValid

Everything is fine

NotValid MsgDoc

A problem, and some indication of why

type Messages = (WarningMessages, ErrorMessages)

type WarningMessages = Bag WarnMsg

type ErrorMessages = Bag ErrMsg

data ErrMsg

Instances

Show ErrMsg

Defined in ErrUtils

Methods

showsPrec :: Int -> ErrMsg -> ShowS

show :: ErrMsg -> String

showList :: [ErrMsg] -> ShowS

data ErrDoc

Categorise error msgs by their importance. This is so each section can be rendered visually distinct. See Note [Error report] for where these come from.

type WarnMsg = ErrMsg

mkLocMessage :: Severity -> SrcSpan -> MsgDoc -> MsgDoc

Make an unannotated error message with location info.

mkLocMessageAnn

Arguments

:: Maybe String

optional annotation

-> Severity

severity

-> SrcSpan

location

-> MsgDoc

message

-> MsgDoc

Make a possibly annotated error message with location info.

getCaretDiagnostic :: Severity -> SrcSpan -> IO MsgDoc

dumpSDoc :: DynFlags -> PrintUnqualified -> DumpFlag -> String -> SDoc -> IO ()

A wrapper around dumpSDocWithStyle which uses PprDump style.

data Severity

Constructors

SevOutput

SevFatal

SevInteractive

SevDump

Log message intended for compiler developers No filelinecolumn stuff

SevInfo

Log messages intended for end users. No filelinecolumn stuff.

SevWarning

SevError

SevWarning and SevError are used for warnings and errors o The message has a filelinecolumn heading, plus "warning:" or "error:", added by mkLocMessags o Output is intended for end users

Instances

Show Severity

Defined in ErrUtils

Methods

showsPrec :: Int -> Severity -> ShowS

show :: Severity -> String

showList :: [Severity] -> ShowS

ToJson Severity

Defined in ErrUtils

Methods

json :: Severity -> JsonDoc

type MsgDoc = SDoc

module FamInst

module FamInstEnv

optionsErrorMsgs :: DynFlags -> [String] -> [Located String] -> FilePath -> Messages

checkProcessArgsResult :: MonadIO m => DynFlags -> [Located String] -> m ()

Complain about non-dynamic flags in OPTIONS pragmas.

Throws a SourceError if the input list is non-empty claiming that the input flags are unknown.

getOptions

Arguments

:: DynFlags

-> StringBuffer

Input Buffer

-> FilePath

Source filename. Used for location info.

-> [Located String]

Parsed options.

Parse OPTIONS and LANGUAGE pragmas of the source file.

Throws a SourceError if flag parsing fails (including unsupported flags.)

getOptionsFromFile

Arguments

:: DynFlags

-> FilePath

Input file

-> IO [Located String]

Parsed options, if any.

Parse OPTIONS and LANGUAGE pragmas of the source file.

Throws a SourceError if flag parsing fails (including unsupported flags.)

mkPrelImports :: ModuleName -> SrcSpan -> Bool -> [LImportDecl GhcPs] -> [LImportDecl GhcPs]

module Id

module InstEnv

module IfaceSyn

unitModuleSet :: Module -> ModuleSet

unionModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

delModuleSet :: ModuleSet -> Module -> ModuleSet

minusModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

intersectModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

elemModuleSet :: Module -> ModuleSet -> Bool

moduleSetElts :: ModuleSet -> [Module]

emptyModuleSet :: ModuleSet

extendModuleSetList :: ModuleSet -> [Module] -> ModuleSet

extendModuleSet :: ModuleSet -> Module -> ModuleSet

mkModuleSet :: [Module] -> ModuleSet

isEmptyModuleEnv :: ModuleEnv a -> Bool

unitModuleEnv :: Module -> a -> ModuleEnv a

moduleEnvToList :: ModuleEnv a -> [(Module, a)]

moduleEnvElts :: ModuleEnv a -> [a]

moduleEnvKeys :: ModuleEnv a -> [Module]

emptyModuleEnv :: ModuleEnv a

mkModuleEnv :: [(Module, a)] -> ModuleEnv a

mapModuleEnv :: (a -> b) -> ModuleEnv a -> ModuleEnv b

lookupWithDefaultModuleEnv :: ModuleEnv a -> a -> Module -> a

lookupModuleEnv :: ModuleEnv a -> Module -> Maybe a

plusModuleEnv :: ModuleEnv a -> ModuleEnv a -> ModuleEnv a

delModuleEnv :: ModuleEnv a -> Module -> ModuleEnv a

delModuleEnvList :: ModuleEnv a -> [Module] -> ModuleEnv a

plusModuleEnv_C :: (a -> a -> a) -> ModuleEnv a -> ModuleEnv a -> ModuleEnv a

extendModuleEnvList_C :: (a -> a -> a) -> ModuleEnv a -> [(Module, a)] -> ModuleEnv a

extendModuleEnvList :: ModuleEnv a -> [(Module, a)] -> ModuleEnv a

extendModuleEnvWith :: (a -> a -> a) -> ModuleEnv a -> Module -> a -> ModuleEnv a

extendModuleEnv :: ModuleEnv a -> Module -> a -> ModuleEnv a

elemModuleEnv :: Module -> ModuleEnv a -> Bool

filterModuleEnv :: (Module -> a -> Bool) -> ModuleEnv a -> ModuleEnv a

wiredInUnitIds :: [UnitId]

isHoleModule :: Module -> Bool

isInteractiveModule :: Module -> Bool

mainUnitId :: UnitId

This is the package Id for the current program. It is the default package Id if you don't specify a package name. We don't add this prefix to symbol names, since there can be only one main package per program.

interactiveUnitId :: UnitId

thisGhcUnitId :: UnitId

thUnitId :: UnitId

rtsUnitId :: UnitId

baseUnitId :: UnitId

integerUnitId :: UnitId

primUnitId :: UnitId

parseModSubst :: ReadP [(ModuleName, Module)]

parseModuleId :: ReadP Module

parseComponentId :: ReadP ComponentId

parseUnitId :: ReadP UnitId

parseModuleName :: ReadP ModuleName

generalizeIndefModule :: IndefModule -> IndefModule

generalizeIndefUnitId :: IndefUnitId -> IndefUnitId

splitUnitIdInsts :: UnitId -> (InstalledUnitId, Maybe IndefUnitId)

See splitModuleInsts.

splitModuleInsts :: Module -> (InstalledModule, Maybe IndefModule)

Given a possibly on-the-fly instantiated module, split it into a Module that we definitely can find on-disk, as well as an instantiation if we need to instantiate it on the fly. If the instantiation is Nothing no on-the-fly renaming is needed.

renameHoleUnitId' :: PackageConfigMap -> ShHoleSubst -> UnitId -> UnitId

Like 'renameHoleUnitId, but requires only PackageConfigMap so it can be used by Packages.

renameHoleModule' :: PackageConfigMap -> ShHoleSubst -> Module -> Module

Like renameHoleModule, but requires only PackageConfigMap so it can be used by Packages.

renameHoleUnitId :: DynFlags -> ShHoleSubst -> UnitId -> UnitId

Substitutes holes in a UnitId, suitable for renaming when an include occurs; see Note [Representation of module/name variable].

p[A=A] maps to p[A=B] with A=B.

renameHoleModule :: DynFlags -> ShHoleSubst -> Module -> Module

Substitutes holes in a Module. NOT suitable for being called directly on a nameModule, see Note [Representation of module/name variable]. p[A=A]:B maps to p[A=q():A]:B with A=q():A; similarly, A maps to q():A.

stringToUnitId :: String -> UnitId

fsToUnitId :: FastString -> UnitId

Create a new simple unit identifier from a FastString. Internally, this is primarily used to specify wired-in unit identifiers.

newSimpleUnitId :: ComponentId -> UnitId

Create a new simple unit identifier (no holes) from a ComponentId.

stableUnitIdCmp :: UnitId -> UnitId -> Ordering

Compares package ids lexically, rather than by their Uniques

newUnitId :: ComponentId -> [(ModuleName, Module)] -> UnitId

Create a new, un-hashed unit identifier.

hashUnitId :: ComponentId -> [(ModuleName, Module)] -> FastString

Generate a uniquely identifying FastString for a unit identifier. This is a one-way function. You can rely on one special property: if a unit identifier is in most general form, its FastString coincides with its ComponentId. This hash is completely internal to GHC and is not used for symbol names or file paths.

unitIdIsDefinite :: UnitId -> Bool

A UnitId is definite if it has no free holes.

unitIdFreeHoles :: UnitId -> UniqDSet ModuleName

Retrieve the set of free holes of a UnitId.

delInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> InstalledModuleEnv a

filterInstalledModuleEnv :: (InstalledModule -> a -> Bool) -> InstalledModuleEnv a -> InstalledModuleEnv a

extendInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> a -> InstalledModuleEnv a

lookupInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> Maybe a

emptyInstalledModuleEnv :: InstalledModuleEnv a

installedUnitIdEq :: InstalledUnitId -> UnitId -> Bool

Test if a UnitId corresponds to a given InstalledUnitId, modulo instantiation.

installedModuleEq :: InstalledModule -> Module -> Bool

Test if a Module corresponds to a given InstalledModule, modulo instantiation.

stringToInstalledUnitId :: String -> InstalledUnitId

componentIdToInstalledUnitId :: ComponentId -> InstalledUnitId

fsToInstalledUnitId :: FastString -> InstalledUnitId

installedUnitIdString :: InstalledUnitId -> String

toInstalledUnitId :: UnitId -> InstalledUnitId

Lossy conversion to the on-disk InstalledUnitId for a component.

indefModuleToModule :: DynFlags -> IndefModule -> Module

Injects an IndefModule to Module (see also indefUnitIdToUnitId.

indefUnitIdToUnitId :: DynFlags -> IndefUnitId -> UnitId

Injects an IndefUnitId (indefinite library which was on-the-fly instantiated) to a UnitId (either an indefinite or definite library).

newIndefUnitId :: ComponentId -> [(ModuleName, Module)] -> IndefUnitId

Create a new IndefUnitId given an explicit module substitution.

unitIdKey :: UnitId -> Unique

unitIdFS :: UnitId -> FastString

pprModule :: Module -> SDoc

mkModule :: UnitId -> ModuleName -> Module

stableModuleCmp :: Module -> Module -> Ordering

This gives a stable ordering, as opposed to the Ord instance which gives an ordering based on the Uniques of the components, which may not be stable from run to run of the compiler.

mkHoleModule :: ModuleName -> Module

Create a module variable at some ModuleName. See Note [Representation of module/name variables]

moduleIsDefinite :: Module -> Bool

A Module is definite if it has no free holes.

moduleFreeHoles :: Module -> UniqDSet ModuleName

Calculate the free holes of a Module. If this set is non-empty, this module was defined in an indefinite library that had required signatures.

If a module has free holes, that means that substitutions can operate on it; if it has no free holes, substituting over a module has no effect.

moduleNameColons :: ModuleName -> String

Returns the string version of the module name, with dots replaced by colons.

moduleNameSlashes :: ModuleName -> String

Returns the string version of the module name, with dots replaced by slashes.

mkModuleNameFS :: FastString -> ModuleName

mkModuleName :: String -> ModuleName

moduleStableString :: Module -> String

Get a string representation of a Module that's unique and stable across recompilations. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal"

moduleNameString :: ModuleName -> String

moduleNameFS :: ModuleName -> FastString

pprModuleName :: ModuleName -> SDoc

stableModuleNameCmp :: ModuleName -> ModuleName -> Ordering

Compares module names lexically, rather than by their Uniques

addBootSuffixLocn :: ModLocation -> ModLocation

Add the -boot suffix to all file paths associated with the module

addBootSuffix_maybe :: Bool -> FilePath -> FilePath

Add the -boot suffix if the Bool argument is True

addBootSuffix :: FilePath -> FilePath

Add the -boot suffix to .hs, .hi and .o files

class ContainsModule t where

Methods

extractModule :: t -> Module

Instances

ContainsModule DsGblEnv

Defined in TcRnTypes

Methods

extractModule :: DsGblEnv -> Module

ContainsModule TcGblEnv

Defined in TcRnTypes

Methods

extractModule :: TcGblEnv -> Module

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in TcRnTypes

Methods

extractModule :: Env gbl lcl -> Module

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

Methods

getModule :: m Module

Instances

HasModule CoreM

Defined in CoreMonad

Methods

getModule :: CoreM Module

ContainsModule env => HasModule (IOEnv env)

Defined in IOEnv

Methods

getModule :: IOEnv env Module

data IndefUnitId

A unit identifier which identifies an indefinite library (with holes) that has been *on-the-fly* instantiated with a substitution indefUnitIdInsts. In fact, an indefinite unit identifier could have no holes, but we haven't gotten around to compiling the actual library yet.

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

Constructors

IndefUnitId

Fields

• indefUnitIdFS :: FastString

  A private, uniquely identifying representation of a UnitId. This string is completely private to GHC and is just used to get a unique; in particular, we don't use it for symbols (indefinite libraries are not compiled).

• indefUnitIdKey :: Unique

  Cached unique of unitIdFS.

• indefUnitIdComponentId :: !ComponentId

  The component identity of the indefinite library that is being instantiated.

• indefUnitIdInsts :: ![(ModuleName, Module)]

  The sorted (by ModuleName) instantiations of this library.

• indefUnitIdFreeHoles :: UniqDSet ModuleName

  A cache of the free module variables of unitIdInsts. This lets us efficiently tell if a UnitId has been fully instantiated (free module variables are empty) and whether or not a substitution can have any effect.

Instances

Eq IndefUnitId

Defined in Module

Methods

(==) :: IndefUnitId -> IndefUnitId -> Bool

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

Ord IndefUnitId

Defined in Module

Methods

compare :: IndefUnitId -> IndefUnitId -> Ordering

(<) :: IndefUnitId -> IndefUnitId -> Bool

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

(>) :: IndefUnitId -> IndefUnitId -> Bool

(>=) :: IndefUnitId -> IndefUnitId -> Bool

max :: IndefUnitId -> IndefUnitId -> IndefUnitId

min :: IndefUnitId -> IndefUnitId -> IndefUnitId

Binary IndefUnitId

Defined in Module

Methods

put_ :: BinHandle -> IndefUnitId -> IO ()

put :: BinHandle -> IndefUnitId -> IO (Bin IndefUnitId)

get :: BinHandle -> IO IndefUnitId

Outputable IndefUnitId

Defined in Module

Methods

ppr :: IndefUnitId -> SDoc

pprPrec :: Rational -> IndefUnitId -> SDoc

data IndefModule

Constructors

IndefModule

Fields

• indefModuleUnitId :: IndefUnitId
• indefModuleName :: ModuleName

Instances

Eq IndefModule

Defined in Module

Methods

(==) :: IndefModule -> IndefModule -> Bool

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

Ord IndefModule

Defined in Module

Methods

compare :: IndefModule -> IndefModule -> Ordering

(<) :: IndefModule -> IndefModule -> Bool

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

(>) :: IndefModule -> IndefModule -> Bool

(>=) :: IndefModule -> IndefModule -> Bool

max :: IndefModule -> IndefModule -> IndefModule

min :: IndefModule -> IndefModule -> IndefModule

Outputable IndefModule

Defined in Module

Methods

ppr :: IndefModule -> SDoc

pprPrec :: Rational -> IndefModule -> SDoc

data InstalledModule

A InstalledModule is a Module which contains a InstalledUnitId.

Constructors

InstalledModule

Fields

• installedModuleUnitId :: !InstalledUnitId
• installedModuleName :: !ModuleName

Instances

Eq InstalledModule

Defined in Module

Methods

(==) :: InstalledModule -> InstalledModule -> Bool

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

Ord InstalledModule

Defined in Module

Methods

compare :: InstalledModule -> InstalledModule -> Ordering

(<) :: InstalledModule -> InstalledModule -> Bool

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

(>) :: InstalledModule -> InstalledModule -> Bool

(>=) :: InstalledModule -> InstalledModule -> Bool

max :: InstalledModule -> InstalledModule -> InstalledModule

min :: InstalledModule -> InstalledModule -> InstalledModule

Outputable InstalledModule

Defined in Module

Methods

ppr :: InstalledModule -> SDoc

pprPrec :: Rational -> InstalledModule -> SDoc

newtype DefUnitId

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

Constructors

DefUnitId

Fields

• unDefUnitId :: InstalledUnitId

Instances

Eq DefUnitId

Defined in Module

Methods

(==) :: DefUnitId -> DefUnitId -> Bool

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

Ord DefUnitId

Defined in Module

Methods

compare :: DefUnitId -> DefUnitId -> Ordering

(<) :: DefUnitId -> DefUnitId -> Bool

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

(>) :: DefUnitId -> DefUnitId -> Bool

(>=) :: DefUnitId -> DefUnitId -> Bool

max :: DefUnitId -> DefUnitId -> DefUnitId

min :: DefUnitId -> DefUnitId -> DefUnitId

Binary DefUnitId

Defined in Module

Methods

put_ :: BinHandle -> DefUnitId -> IO ()

put :: BinHandle -> DefUnitId -> IO (Bin DefUnitId)

get :: BinHandle -> IO DefUnitId

Outputable DefUnitId

Defined in Module

Methods

ppr :: DefUnitId -> SDoc

pprPrec :: Rational -> DefUnitId -> SDoc

data InstalledModuleEnv elt

A map keyed off of InstalledModule

type ShHoleSubst = ModuleNameEnv Module

Substitution on module variables, mapping module names to module identifiers.

data ModuleEnv elt

A map keyed off of Modules

type ModuleSet = Set NDModule

A set of Modules

type ModuleNameEnv elt = UniqFM elt

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

type DModuleNameEnv elt = UniqDFM elt

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

unitIdString :: UnitId -> String

data Module

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

Module variables (i.e. H) which can be instantiated to a specific module at some later point in time are represented with moduleUnitId set to holeUnitId (this allows us to avoid having to make moduleUnitId a partial operation.)

Constructors

Module !UnitId !ModuleName

Instances

Eq Module

Defined in Module

Methods

(==) :: Module -> Module -> Bool

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

Data Module

Defined in Module

Methods

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

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

toConstr :: Module -> Constr

dataTypeOf :: Module -> DataType

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

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

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

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

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

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

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

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

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

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

Ord Module

Defined in Module

Methods

compare :: Module -> Module -> Ordering

(<) :: Module -> Module -> Bool

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

(>) :: Module -> Module -> Bool

(>=) :: Module -> Module -> Bool

max :: Module -> Module -> Module

min :: Module -> Module -> Module

Show Module

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Module -> ShowS

show :: Module -> String

showList :: [Module] -> ShowS

NFData Module

Defined in Module

Methods

rnf :: Module -> ()

Binary Module

Defined in Module

Methods

put_ :: BinHandle -> Module -> IO ()

put :: BinHandle -> Module -> IO (Bin Module)

get :: BinHandle -> IO Module

Uniquable Module

Defined in Module

Methods

getUnique :: Module -> Unique

Outputable Module

Defined in Module

Methods

ppr :: Module -> SDoc

pprPrec :: Rational -> Module -> SDoc

DbUnitIdModuleRep InstalledUnitId ComponentId UnitId ModuleName Module

Defined in Module

Methods

fromDbModule :: DbModule InstalledUnitId ComponentId UnitId ModuleName Module -> Module

toDbModule :: Module -> DbModule InstalledUnitId ComponentId UnitId ModuleName Module

fromDbUnitId :: DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module -> UnitId

toDbUnitId :: UnitId -> DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module

data ModuleName

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

Instances

Eq ModuleName

Defined in Module

Methods

(==) :: ModuleName -> ModuleName -> Bool

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

Data ModuleName

Defined in Module

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

Ord ModuleName

Defined in Module

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

Show ModuleName

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModuleName -> ShowS

show :: ModuleName -> String

showList :: [ModuleName] -> ShowS

Hashable ModuleName

Defined in Development.IDE.GHC.Orphans

Methods

hashWithSalt :: Int -> ModuleName -> Int

hash :: ModuleName -> Int

NFData ModuleName

Defined in Module

Methods

rnf :: ModuleName -> ()

Binary ModuleName

Defined in Module

Methods

put_ :: BinHandle -> ModuleName -> IO ()

put :: BinHandle -> ModuleName -> IO (Bin ModuleName)

get :: BinHandle -> IO ModuleName

Uniquable ModuleName

Defined in Module

Methods

getUnique :: ModuleName -> Unique

Outputable ModuleName

Defined in Module

Methods

ppr :: ModuleName -> SDoc

pprPrec :: Rational -> ModuleName -> SDoc

BinaryStringRep ModuleName

Defined in Module

Methods

fromStringRep :: ByteString -> ModuleName

toStringRep :: ModuleName -> ByteString

Annotate ModuleName

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> ModuleName -> Annotated ()

DbUnitIdModuleRep InstalledUnitId ComponentId UnitId ModuleName Module

Defined in Module

Methods

fromDbModule :: DbModule InstalledUnitId ComponentId UnitId ModuleName Module -> Module

toDbModule :: Module -> DbModule InstalledUnitId ComponentId UnitId ModuleName Module

fromDbUnitId :: DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module -> UnitId

toDbUnitId :: UnitId -> DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module

ToHie (IEContext (Located ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located ModuleName) -> HieM [HieAST Type]

pattern IndefiniteUnitId :: !IndefUnitId -> UnitId

pattern DefiniteUnitId :: !DefUnitId -> UnitId

newtype InstalledUnitId

An installed unit identifier identifies a library which has been installed to the package database. These strings are provided to us via the -this-unit-id flag. The library in question may be definite or indefinite; if it is indefinite, none of the holes have been filled (we never install partially instantiated libraries.) Put another way, an installed unit id is either fully instantiated, or not instantiated at all.

Installed unit identifiers look something like p+af23SAj2dZ219, or maybe just p if they don't use Backpack.

Constructors

InstalledUnitId

Fields

• installedUnitIdFS :: FastString

  The full hashed unit identifier, including the component id and the hash.

Instances

Eq InstalledUnitId

Defined in Module

Methods

(==) :: InstalledUnitId -> InstalledUnitId -> Bool

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

Ord InstalledUnitId

Defined in Module

Methods

compare :: InstalledUnitId -> InstalledUnitId -> Ordering

(<) :: InstalledUnitId -> InstalledUnitId -> Bool

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

(>) :: InstalledUnitId -> InstalledUnitId -> Bool

(>=) :: InstalledUnitId -> InstalledUnitId -> Bool

max :: InstalledUnitId -> InstalledUnitId -> InstalledUnitId

min :: InstalledUnitId -> InstalledUnitId -> InstalledUnitId

Show InstalledUnitId

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> InstalledUnitId -> ShowS

show :: InstalledUnitId -> String

showList :: [InstalledUnitId] -> ShowS

Hashable InstalledUnitId

Defined in Development.IDE.GHC.Orphans

Methods

hashWithSalt :: Int -> InstalledUnitId -> Int

hash :: InstalledUnitId -> Int

NFData InstalledUnitId

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: InstalledUnitId -> ()

Binary InstalledUnitId

Defined in Module

Methods

put_ :: BinHandle -> InstalledUnitId -> IO ()

put :: BinHandle -> InstalledUnitId -> IO (Bin InstalledUnitId)

get :: BinHandle -> IO InstalledUnitId

Uniquable InstalledUnitId

Defined in Module

Methods

getUnique :: InstalledUnitId -> Unique

Outputable InstalledUnitId

Defined in Module

Methods

ppr :: InstalledUnitId -> SDoc

pprPrec :: Rational -> InstalledUnitId -> SDoc

BinaryStringRep InstalledUnitId

Defined in Module

Methods

fromStringRep :: ByteString -> InstalledUnitId

toStringRep :: InstalledUnitId -> ByteString

DbUnitIdModuleRep InstalledUnitId ComponentId UnitId ModuleName Module

Defined in Module

Methods

fromDbModule :: DbModule InstalledUnitId ComponentId UnitId ModuleName Module -> Module

toDbModule :: Module -> DbModule InstalledUnitId ComponentId UnitId ModuleName Module

fromDbUnitId :: DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module -> UnitId

toDbUnitId :: UnitId -> DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module

newtype ComponentId

A ComponentId consists of the package name, package version, component ID, the transitive dependencies of the component, and other information to uniquely identify the source code and build configuration of a component.

This used to be known as an InstalledPackageId, but a package can contain multiple components and a ComponentId uniquely identifies a component within a package. When a package only has one component, the ComponentId coincides with the InstalledPackageId

Constructors

ComponentId FastString

Instances

Eq ComponentId

Defined in Module

Methods

(==) :: ComponentId -> ComponentId -> Bool

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

Ord ComponentId

Defined in Module

Methods

compare :: ComponentId -> ComponentId -> Ordering

(<) :: ComponentId -> ComponentId -> Bool

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

(>) :: ComponentId -> ComponentId -> Bool

(>=) :: ComponentId -> ComponentId -> Bool

max :: ComponentId -> ComponentId -> ComponentId

min :: ComponentId -> ComponentId -> ComponentId

Show ComponentId

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ComponentId -> ShowS

show :: ComponentId -> String

showList :: [ComponentId] -> ShowS

Binary ComponentId

Defined in Module

Methods

put_ :: BinHandle -> ComponentId -> IO ()

put :: BinHandle -> ComponentId -> IO (Bin ComponentId)

get :: BinHandle -> IO ComponentId

Uniquable ComponentId

Defined in Module

Methods

getUnique :: ComponentId -> Unique

Outputable ComponentId

Defined in Module

Methods

ppr :: ComponentId -> SDoc

pprPrec :: Rational -> ComponentId -> SDoc

BinaryStringRep ComponentId

Defined in Module

Methods

fromStringRep :: ByteString -> ComponentId

toStringRep :: ComponentId -> ByteString

DbUnitIdModuleRep InstalledUnitId ComponentId UnitId ModuleName Module

Defined in Module

Methods

fromDbModule :: DbModule InstalledUnitId ComponentId UnitId ModuleName Module -> Module

toDbModule :: Module -> DbModule InstalledUnitId ComponentId UnitId ModuleName Module

fromDbUnitId :: DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module -> UnitId

toDbUnitId :: UnitId -> DbUnitId InstalledUnitId ComponentId UnitId ModuleName Module

pprPrefixName :: NamedThing a => a -> SDoc

pprInfixName :: (Outputable a, NamedThing a) => a -> SDoc

getOccFS :: NamedThing a => a -> FastString

getOccString :: NamedThing a => a -> String

getSrcSpan :: NamedThing a => a -> SrcSpan

getSrcLoc :: NamedThing a => a -> SrcLoc

nameStableString :: Name -> String

Get a string representation of a Name that's unique and stable across recompilations. Used for deterministic generation of binds for derived instances. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal$String"

pprNameDefnLoc :: Name -> SDoc

pprDefinedAt :: Name -> SDoc

pprModulePrefix :: PprStyle -> Module -> OccName -> SDoc

pprNameUnqualified :: Name -> SDoc

Print the string of Name unqualifiedly directly.

stableNameCmp :: Name -> Name -> Ordering

Compare Names lexicographically This only works for Names that originate in the source code or have been tidied.

localiseName :: Name -> Name

Make the Name into an internal name, regardless of what it was to begin with

tidyNameOcc :: Name -> OccName -> Name

setNameLoc :: Name -> SrcSpan -> Name

setNameUnique :: Name -> Unique -> Name

mkFCallName :: Unique -> String -> Name

Make a name for a foreign call

mkSysTvName :: Unique -> FastString -> Name

mkSystemVarName :: Unique -> FastString -> Name

mkSystemNameAt :: Unique -> OccName -> SrcSpan -> Name

mkSystemName :: Unique -> OccName -> Name

Create a name brought into being by the compiler

mkWiredInName :: Module -> OccName -> Unique -> TyThing -> BuiltInSyntax -> Name

Create a name which is actually defined by the compiler itself

mkExternalName :: Unique -> Module -> OccName -> SrcSpan -> Name

Create a name which definitely originates in the given module

mkDerivedInternalName :: (OccName -> OccName) -> Unique -> Name -> Name

mkClonedInternalName :: Unique -> Name -> Name

mkInternalName :: Unique -> OccName -> SrcSpan -> Name

Create a name which is (for now at least) local to the current module and hence does not need a Module to disambiguate it from other Names

isSystemName :: Name -> Bool

isVarName :: Name -> Bool

isValName :: Name -> Bool

isDataConName :: Name -> Bool

isTyConName :: Name -> Bool

isTyVarName :: Name -> Bool

nameIsFromExternalPackage :: UnitId -> Name -> Bool

Returns True if the Name comes from some other package: neither this package nor the interactive package.

nameIsHomePackageImport :: Module -> Name -> Bool

nameIsHomePackage :: Module -> Name -> Bool

nameIsLocalOrFrom :: Module -> Name -> Bool

Returns True if the name is (a) Internal (b) External but from the specified module (c) External but from the interactive package

The key idea is that False means: the entity is defined in some other module you can find the details (type, fixity, instances) in some interface file those details will be stored in the EPT or HPT

True means: the entity is defined in this module or earlier in the GHCi session you can find details (type, fixity, instances) in the TcGblEnv or TcLclEnv

The isInteractiveModule part is because successive interactions of a GHCi session each give rise to a fresh module (Ghci1, Ghci2, etc), but they all come from the magic interactive package; and all the details are kept in the TcLclEnv, TcGblEnv, NOT in the HPT or EPT. See Note [The interactive package] in HscTypes

nameModule_maybe :: Name -> Maybe Module

nameModule :: HasDebugCallStack => Name -> Module

isHoleName :: Name -> Bool

isInternalName :: Name -> Bool

isExternalName :: Name -> Bool

isBuiltInSyntax :: Name -> Bool

wiredInNameTyThing_maybe :: Name -> Maybe TyThing

isWiredInName :: Name -> Bool

nameSrcSpan :: Name -> SrcSpan

nameSrcLoc :: Name -> SrcLoc

nameNameSpace :: Name -> NameSpace

nameOccName :: Name -> OccName

nameUnique :: Name -> Unique

data BuiltInSyntax

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

Constructors

BuiltInSyntax

UserSyntax

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 HoleFitCandidate

Defined in TcHoleFitTypes

Methods

getOccName :: HoleFitCandidate -> OccName

getName :: HoleFitCandidate -> Name

NamedThing ClsInst

Defined in InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

NamedThing FamInst

Defined in FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

NamedThing IfaceDecl

Defined in IfaceSyn

Methods

getOccName :: IfaceDecl -> OccName

getName :: IfaceDecl -> Name

NamedThing IfaceClassOp

Defined in IfaceSyn

Methods

getOccName :: IfaceClassOp -> OccName

getName :: IfaceClassOp -> Name

NamedThing IfaceConDecl

Defined in IfaceSyn

Methods

getOccName :: IfaceConDecl -> OccName

getName :: IfaceConDecl -> Name

NamedThing Class

Defined in Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

NamedThing ConLike

Defined in ConLike

Methods

getOccName :: ConLike -> OccName

getName :: ConLike -> Name

NamedThing DataCon

Defined in DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

NamedThing PatSyn

Defined in PatSyn

Methods

getOccName :: PatSyn -> OccName

getName :: PatSyn -> Name

NamedThing TyThing

Defined in TyCoRep

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

NamedThing Var

Defined in Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

NamedThing TyCon

Defined in TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

NamedThing Name

Defined in Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

NamedThing (HsTyVarBndr GhcRn)

Defined in GHC.Hs.Types

Methods

getOccName :: HsTyVarBndr GhcRn -> OccName

getName :: HsTyVarBndr GhcRn -> Name

NamedThing (CoAxiom br)

Defined in CoAxiom

Methods

getOccName :: CoAxiom br -> OccName

getName :: CoAxiom br -> Name

NamedThing e => NamedThing (Located e)

Defined in Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

NamedThing tv => NamedThing (VarBndr tv flag)

Defined in Var

Methods

getOccName :: VarBndr tv flag -> OccName

getName :: VarBndr tv flag -> Name

tidyOccName :: TidyOccEnv -> OccName -> (TidyOccEnv, OccName)

avoidClashesOccEnv :: TidyOccEnv -> [OccName] -> TidyOccEnv

initTidyOccEnv :: [OccName] -> TidyOccEnv

emptyTidyOccEnv :: TidyOccEnv

mkMethodOcc :: OccName -> OccName

mkDataCOcc

Arguments

:: OccName

TyCon or data con string

-> OccSet

avoid these Occs

-> OccName

E.g. $f3OrdMaybe data T = MkT ... deriving( Data ) needs definitions for $tT :: Data.Generics.Basics.DataType $cMkT :: Data.Generics.Basics.Constr

mkDataTOcc

Arguments

:: OccName

TyCon or data con string

-> OccSet

avoid these Occs

-> OccName

E.g. $f3OrdMaybe data T = MkT ... deriving( Data ) needs definitions for $tT :: Data.Generics.Basics.DataType $cMkT :: Data.Generics.Basics.Constr

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

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.

mkLocalOcc

Arguments

:: Unique

Unique to combine with the OccName

-> OccName

Local name, e.g. sat

-> OccName

Nice unique version, e.g. $L23sat

mkSuperDictSelOcc

Arguments

:: Int

Index of superclass, e.g. 3

-> OccName

Class, e.g. Ord

-> OccName

Derived Occname, e.g. $p3Ord

mkSuperDictAuxOcc :: Int -> OccName -> OccName

mkDataConWorkerOcc :: OccName -> OccName

mkRecFldSelOcc :: String -> OccName

mkGen1R :: OccName -> OccName

mkGenR :: OccName -> OccName

mkTyConRepOcc :: OccName -> OccName

mkMaxTagOcc :: OccName -> OccName

mkTag2ConOcc :: OccName -> OccName

mkCon2TagOcc :: OccName -> OccName

mkEqPredCoOcc :: OccName -> OccName

mkInstTyCoOcc :: OccName -> OccName

mkNewTyCoOcc :: OccName -> OccName

mkClassDataConOcc :: OccName -> OccName

mkRepEqOcc :: OccName -> OccName

mkForeignExportOcc :: OccName -> OccName

mkSpecOcc :: OccName -> OccName

mkIPOcc :: OccName -> OccName

mkDictOcc :: OccName -> OccName

mkClassOpAuxOcc :: OccName -> OccName

mkDefaultMethodOcc :: OccName -> OccName

mkBuilderOcc :: OccName -> OccName

mkMatcherOcc :: OccName -> OccName

mkWorkerOcc :: OccName -> OccName

mkDataConWrapperOcc :: OccName -> OccName

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

isDefaultMethodOcc :: OccName -> Bool

isDerivedOccName :: OccName -> Bool

Test for definitions internally generated by GHC. This predicte is used to suppress printing of internal definitions in some debug prints

startsWithUnderscore :: OccName -> Bool

Haskell 98 encourages compilers to suppress warnings about unsed names in a pattern if they start with _: this implements that test

parenSymOcc :: OccName -> SDoc -> SDoc

Wrap parens around an operator

isSymOcc :: OccName -> Bool

Test if the OccName is that for any operator (whether it is a data constructor or variable or whatever)

isDataSymOcc :: OccName -> Bool

Test if the OccName is a data constructor that starts with a symbol (e.g. :, or [])

isDataOcc :: OccName -> Bool

isValOcc :: OccName -> Bool

Value OccNamess are those that are either in the variable or data constructor namespaces

isTcOcc :: OccName -> Bool

isTvOcc :: OccName -> Bool

isVarOcc :: OccName -> Bool

setOccNameSpace :: NameSpace -> OccName -> OccName

occNameString :: OccName -> String

filterOccSet :: (OccName -> Bool) -> OccSet -> OccSet

intersectsOccSet :: OccSet -> OccSet -> Bool

intersectOccSet :: OccSet -> OccSet -> OccSet

isEmptyOccSet :: OccSet -> Bool

elemOccSet :: OccName -> OccSet -> Bool

minusOccSet :: OccSet -> OccSet -> OccSet

unionManyOccSets :: [OccSet] -> OccSet

unionOccSets :: OccSet -> OccSet -> OccSet

extendOccSetList :: OccSet -> [OccName] -> OccSet

extendOccSet :: OccSet -> OccName -> OccSet

mkOccSet :: [OccName] -> OccSet

unitOccSet :: OccName -> OccSet

emptyOccSet :: OccSet

pprOccEnv :: (a -> SDoc) -> OccEnv a -> SDoc

alterOccEnv :: (Maybe elt -> Maybe elt) -> OccEnv elt -> OccName -> OccEnv elt

filterOccEnv :: (elt -> Bool) -> OccEnv elt -> OccEnv elt

delListFromOccEnv :: OccEnv a -> [OccName] -> OccEnv a

delFromOccEnv :: OccEnv a -> OccName -> OccEnv a

mkOccEnv_C :: (a -> a -> a) -> [(OccName, a)] -> OccEnv a

mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b

extendOccEnv_Acc :: (a -> b -> b) -> (a -> b) -> OccEnv b -> OccName -> a -> OccEnv b

extendOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccName -> a -> OccEnv a

plusOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccEnv a -> OccEnv a

plusOccEnv :: OccEnv a -> OccEnv a -> OccEnv a

occEnvElts :: OccEnv a -> [a]

foldOccEnv :: (a -> b -> b) -> b -> OccEnv a -> b

elemOccEnv :: OccName -> OccEnv a -> Bool

mkOccEnv :: [(OccName, a)] -> OccEnv a

lookupOccEnv :: OccEnv a -> OccName -> Maybe a

extendOccEnvList :: OccEnv a -> [(OccName, a)] -> OccEnv a

extendOccEnv :: OccEnv a -> OccName -> a -> OccEnv a

unitOccEnv :: OccName -> a -> OccEnv a

emptyOccEnv :: OccEnv a

nameSpacesRelated :: NameSpace -> NameSpace -> Bool

demoteOccName :: OccName -> Maybe OccName

mkClsOccFS :: FastString -> OccName

mkClsOcc :: String -> OccName

mkTcOccFS :: FastString -> OccName

mkTcOcc :: String -> OccName

mkTyVarOccFS :: FastString -> OccName

mkTyVarOcc :: String -> OccName

mkDataOccFS :: FastString -> OccName

mkDataOcc :: String -> OccName

mkVarOccFS :: FastString -> OccName

mkVarOcc :: String -> OccName

mkOccNameFS :: NameSpace -> FastString -> OccName

mkOccName :: NameSpace -> String -> OccName

pprOccName :: OccName -> SDoc

pprNameSpaceBrief :: NameSpace -> SDoc

pprNonVarNameSpace :: NameSpace -> SDoc

pprNameSpace :: NameSpace -> SDoc

isValNameSpace :: NameSpace -> Bool

isVarNameSpace :: NameSpace -> Bool

isTvNameSpace :: NameSpace -> Bool

isTcClsNameSpace :: NameSpace -> Bool

isDataConNameSpace :: NameSpace -> Bool

tvName :: NameSpace

srcDataName :: NameSpace

dataName :: NameSpace

tcClsName :: NameSpace

clsName :: NameSpace

tcName :: NameSpace

data NameSpace

Instances

Eq NameSpace

Defined in OccName

Methods

(==) :: NameSpace -> NameSpace -> Bool

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

Ord NameSpace

Defined in OccName

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

Binary NameSpace

Defined in OccName

Methods

put_ :: BinHandle -> NameSpace -> IO ()

put :: BinHandle -> NameSpace -> IO (Bin NameSpace)

get :: BinHandle -> IO NameSpace

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 HoleFitCandidate

Defined in TcHoleFitTypes

Methods

occName :: HoleFitCandidate -> OccName

HasOccName TcBinder

Defined in TcRnTypes

Methods

occName :: TcBinder -> OccName

HasOccName IfaceDecl

Defined in IfaceSyn

Methods

occName :: IfaceDecl -> OccName

HasOccName IfaceClassOp

Defined in IfaceSyn

Methods

occName :: IfaceClassOp -> OccName

HasOccName IfaceConDecl

Defined in IfaceSyn

Methods

occName :: IfaceConDecl -> OccName

HasOccName RdrName

Defined in RdrName

Methods

occName :: RdrName -> OccName

HasOccName Var

Defined in Var

Methods

occName :: Var -> OccName

HasOccName OccName

Defined in OccName

Methods

occName :: OccName -> OccName

HasOccName Name

Defined in Name

Methods

occName :: Name -> OccName

HasOccName name => HasOccName (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

occName :: IEWrappedName name -> OccName

data OccEnv a

Instances

Data a => Data (OccEnv a)

Defined in OccName

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 OccName

Methods

ppr :: OccEnv a -> SDoc

pprPrec :: Rational -> OccEnv a -> SDoc

type OccSet = UniqSet OccName

type TidyOccEnv = UniqFM Int

mkFsEnv :: [(FastString, a)] -> FastStringEnv a

lookupFsEnv :: FastStringEnv a -> FastString -> Maybe a

extendFsEnv :: FastStringEnv a -> FastString -> a -> FastStringEnv a

emptyFsEnv :: FastStringEnv a

type FastStringEnv a = UniqFM a

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

data 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

Eq OccName

Defined in OccName

Methods

(==) :: OccName -> OccName -> Bool

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

Data OccName

Defined in OccName

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

Ord OccName

Defined in OccName

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

Show OccName

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> OccName -> ShowS

show :: OccName -> String

showList :: [OccName] -> ShowS

Hashable OccName

Defined in Development.IDE.GHC.Orphans

Methods

hashWithSalt :: Int -> OccName -> Int

hash :: OccName -> Int

NFData OccName

Defined in OccName

Methods

rnf :: OccName -> ()

HasOccName OccName

Defined in OccName

Methods

occName :: OccName -> OccName

Binary OccName

Defined in OccName

Methods

put_ :: BinHandle -> OccName -> IO ()

put :: BinHandle -> OccName -> IO (Bin OccName)

get :: BinHandle -> IO OccName

Uniquable OccName

Defined in OccName

Methods

getUnique :: OccName -> Unique

Outputable OccName

Defined in OccName

Methods

ppr :: OccName -> SDoc

pprPrec :: Rational -> OccName -> SDoc

OutputableBndr OccName

Defined in OccName

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

data Name

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

Instances

Eq Name

The same comments as for Name's Ord instance apply.

Defined in Name

Methods

(==) :: Name -> Name -> Bool

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

Data Name

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

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

NFData Name

Defined in Name

Methods

rnf :: Name -> ()

NamedThing Name

Defined in Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

HasOccName Name

Defined in Name

Methods

occName :: Name -> OccName

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 Name

Methods

put_ :: BinHandle -> Name -> IO ()

put :: BinHandle -> Name -> IO (Bin Name)

get :: BinHandle -> IO Name

Uniquable Name

Defined in Name

Methods

getUnique :: Name -> Unique

HasSrcSpan Name

Defined in Name

Methods

composeSrcSpan :: Located (SrcSpanLess Name) -> Name

decomposeSrcSpan :: Name -> Located (SrcSpanLess Name)

Outputable Name

Defined in Name

Methods

ppr :: Name -> SDoc

pprPrec :: Rational -> Name -> SDoc

OutputableBndr Name

Defined in Name

Methods

pprBndr :: BindingSite -> Name -> SDoc

pprPrefixOcc :: Name -> SDoc

pprInfixOcc :: Name -> SDoc

bndrIsJoin_maybe :: Name -> Maybe Int

ModifyState Name

Defined in Compat.HieAst

Methods

addSubstitution :: Name -> Name -> HieState -> HieState

ToHie (LBooleanFormula (Located Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (Located Name) -> HieM [HieAST Type]

ToHie (Located (FunDep (Located Name)))

Defined in Compat.HieAst

Methods

toHie :: Located (FunDep (Located Name)) -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (Located (FieldLbl Name)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located (FieldLbl Name)) -> HieM [HieAST Type]

type SrcSpanLess Name

Defined in Name

type SrcSpanLess Name = Name

module NameCache

module NameEnv

module NameSet

module PatSyn

pprTypeForUser :: Type -> SDoc

pprTyThing :: ShowSub -> TyThing -> SDoc

Pretty-prints a TyThing.

pprTyThingInContextLoc :: TyThing -> SDoc

Like pprTyThingInContext, but adds the defining location.

pprTyThingInContext :: ShowSub -> TyThing -> SDoc

Pretty-prints a TyThing in context: that is, if the entity is a data constructor, record selector, or class method, then the entity's parent declaration is pretty-printed with irrelevant parts omitted.

pprTyThingHdr :: TyThing -> SDoc

Pretty-prints the TyThing header. For functions and data constructors the function is equivalent to pprTyThing but for type constructors and classes it prints only the header part of the declaration.

pprTyThingLoc :: TyThing -> SDoc

Pretty-prints a TyThing with its defining location.

module PrelInfo

pretendNameIsInScope :: Name -> Bool

interactiveClassKeys :: [Unique]

interactiveClassNames :: [Name]

derivableClassKeys :: [Unique]

standardClassKeys :: [Unique]

fractionalClassKeys :: [Unique]

numericClassKeys :: [Unique]

wordToNaturalIdKey :: Unique

naturalSDataConKey :: Unique

mkNaturalIdKey :: Unique

timesNaturalIdKey :: Unique

minusNaturalIdKey :: Unique

plusNaturalIdKey :: Unique

naturalToIntegerIdKey :: Unique

naturalFromIntegerIdKey :: Unique

makeStaticKey :: Unique

fromStaticPtrClassOpKey :: Unique

pushCallStackKey :: Unique

emptyCallStackKey :: Unique

mconcatClassOpKey :: Unique

mappendClassOpKey :: Unique

memptyClassOpKey :: Unique

sappendClassOpKey :: Unique

coercibleSCSelIdKey :: Unique

heqSCSelIdKey :: Unique

eqSCSelIdKey :: Unique

bitIntegerIdKey :: Unique

toDynIdKey :: Unique

starArrStarArrStarKindRepKey :: Unique

starArrStarKindRepKey :: Unique

starKindRepKey :: Unique

tr'PtrRepLiftedKey :: Unique

trRuntimeRepKey :: Unique

trTYPE'PtrRepLiftedKey :: Unique

trTYPEKey :: Unique

mkTrFunKey :: Unique

typeRepIdKey :: Unique

typeSymbolTypeRepKey :: Unique

typeNatTypeRepKey :: Unique

mkTrAppKey :: Unique

mkTrConKey :: Unique

mkTrTypeKey :: Unique

mkTyConKey :: Unique

proxyHashKey :: Unique

toListClassOpKey :: Unique

fromListNClassOpKey :: Unique

fromListClassOpKey :: Unique

isListClassKey :: Unique

ghciStepIoMClassOpKey :: Unique

mzipIdKey :: Unique

liftMIdKey :: Unique

guardMIdKey :: Unique

toRationalClassOpKey :: Unique

toIntegerClassOpKey :: Unique

realToFracIdKey :: Unique

fromIntegralIdKey :: Unique

toAnnotationWrapperIdKey :: Unique

fromStringClassOpKey :: Unique

loopAIdKey :: Unique

choiceAIdKey :: Unique

appAIdKey :: Unique

firstAIdKey :: Unique

composeAIdKey :: Unique

arrAIdKey :: Unique

failMClassOpKey :: Unique

mfixIdKey :: Unique

returnMClassOpKey :: Unique

fmapClassOpKey :: Unique

thenMClassOpKey :: Unique

bindMClassOpKey :: Unique

negateClassOpKey :: Unique

geClassOpKey :: Unique

eqClassOpKey :: Unique

enumFromThenToClassOpKey :: Unique

enumFromToClassOpKey :: Unique

enumFromThenClassOpKey :: Unique

enumFromClassOpKey :: Unique

fromRationalClassOpKey :: Unique

minusClassOpKey :: Unique

fromIntegerClassOpKey :: Unique

unboundKey :: Unique

coerceKey :: Unique

magicDictKey :: Unique

undefinedKey :: Unique

checkDotnetResNameIdKey :: Unique

unmarshalStringIdKey :: Unique

marshalStringIdKey :: Unique

marshalObjectIdKey :: Unique

unmarshalObjectIdKey :: Unique

rationalToDoubleIdKey :: Unique

rationalToFloatIdKey :: Unique

noinlineIdKey :: Unique

coercionTokenIdKey :: Unique

dollarIdKey :: Unique

groupWithIdKey :: Unique

mapIdKey :: Unique

inlineIdKey :: Unique

breakpointCondIdKey :: Unique

breakpointIdKey :: Unique

traceKey :: Unique

runRWKey :: Unique

oneShotKey :: Unique

assertErrorIdKey :: Unique

lazyIdKey :: Unique

thenIOIdKey :: Unique

runMainKey :: Unique

rootMainKey :: Unique

decodeDoubleIntegerIdKey :: Unique

int64ToIntegerIdKey :: Unique

word64ToIntegerIdKey :: Unique

wordToIntegerIdKey :: Unique

shiftRIntegerIdKey :: Unique

shiftLIntegerIdKey :: Unique

complementIntegerIdKey :: Unique

xorIntegerIdKey :: Unique

orIntegerIdKey :: Unique

andIntegerIdKey :: Unique

lcmIntegerIdKey :: Unique

gcdIntegerIdKey :: Unique

encodeDoubleIntegerIdKey :: Unique

encodeFloatIntegerIdKey :: Unique

doubleFromIntegerIdKey :: Unique

floatFromIntegerIdKey :: Unique

quotRemIntegerIdKey :: Unique

divModIntegerIdKey :: Unique

modIntegerIdKey :: Unique

divIntegerIdKey :: Unique

remIntegerIdKey :: Unique

quotIntegerIdKey :: Unique

compareIntegerIdKey :: Unique

geIntegerPrimIdKey :: Unique

ltIntegerPrimIdKey :: Unique

gtIntegerPrimIdKey :: Unique

leIntegerPrimIdKey :: Unique

signumIntegerIdKey :: Unique

absIntegerIdKey :: Unique

neqIntegerPrimIdKey :: Unique

eqIntegerPrimIdKey :: Unique

negateIntegerIdKey :: Unique

minusIntegerIdKey :: Unique

timesIntegerIdKey :: Unique

plusIntegerIdKey :: Unique

integerToInt64IdKey :: Unique

integerToWord64IdKey :: Unique

integerToIntIdKey :: Unique

integerToWordIdKey :: Unique

smallIntegerIdKey :: Unique

mkIntegerIdKey :: Unique

assertIdKey :: Unique

otherwiseIdKey :: Unique

sndIdKey :: Unique

fstIdKey :: Unique

voidArgIdKey :: Unique

nullAddrIdKey :: Unique

failIOIdKey :: Unique

printIdKey :: Unique

newStablePtrIdKey :: Unique

returnIOIdKey :: Unique

bindIOIdKey :: Unique

zipIdKey :: Unique

filterIdKey :: Unique

concatIdKey :: Unique

unsafeCoerceIdKey :: Unique

absentSumFieldErrorIdKey :: Unique

modIntIdKey :: Unique

divIntIdKey :: Unique

typeErrorIdKey :: Unique

voidPrimIdKey :: Unique

unpackCStringIdKey :: Unique

unpackCStringFoldrIdKey :: Unique

unpackCStringAppendIdKey :: Unique

unpackCStringUtf8IdKey :: Unique

recConErrorIdKey :: Unique

realWorldPrimIdKey :: Unique

patErrorIdKey :: Unique

runtimeErrorIdKey :: Unique

nonExhaustiveGuardsErrorIdKey :: Unique

noMethodBindingErrorIdKey :: Unique

eqStringIdKey :: Unique

seqIdKey :: Unique

recSelErrorIdKey :: Unique

foldrIdKey :: Unique

errorIdKey :: Unique

buildIdKey :: Unique

appendIdKey :: Unique

augmentIdKey :: Unique

absentErrorIdKey :: Unique

wildCardKey :: Unique

typeLitNatDataConKey :: Unique

typeLitSymbolDataConKey :: Unique

kindRepTypeLitDDataConKey :: Unique

kindRepTypeLitSDataConKey :: Unique

kindRepTYPEDataConKey :: Unique

kindRepFunDataConKey :: Unique

kindRepAppDataConKey :: Unique

kindRepVarDataConKey :: Unique

kindRepTyConAppDataConKey :: Unique

vecElemDataConKeys :: [Unique]

vecCountDataConKeys :: [Unique]

unliftedRepDataConKeys :: [Unique]

unliftedSimpleRepDataConKeys :: [Unique]

liftedRepDataConKey :: Unique

runtimeRepSimpleDataConKeys :: [Unique]

sumRepDataConKey :: Unique

tupleRepDataConKey :: Unique

vecRepDataConKey :: Unique

metaSelDataConKey :: Unique

metaConsDataConKey :: Unique

metaDataDataConKey :: Unique

decidedUnpackDataConKey :: Unique

decidedStrictDataConKey :: Unique

decidedLazyDataConKey :: Unique

noSourceStrictnessDataConKey :: Unique

sourceStrictDataConKey :: Unique

sourceLazyDataConKey :: Unique

noSourceUnpackednessDataConKey :: Unique

sourceNoUnpackDataConKey :: Unique

sourceUnpackDataConKey :: Unique

notAssociativeDataConKey :: Unique

rightAssociativeDataConKey :: Unique

leftAssociativeDataConKey :: Unique

infixIDataConKey :: Unique

prefixIDataConKey :: Unique

typeErrorShowTypeDataConKey :: Unique

typeErrorVAppendDataConKey :: Unique

typeErrorAppendDataConKey :: Unique

typeErrorTextDataConKey :: Unique

typeLitSortTyConKey :: Unique

kindRepTyConKey :: Unique

trGhcPrimModuleKey :: Unique

trNameDDataConKey :: Unique

trNameSDataConKey :: Unique

trNameTyConKey :: Unique

trModuleDataConKey :: Unique

trModuleTyConKey :: Unique

trTyConDataConKey :: Unique

trTyConTyConKey :: Unique

srcLocDataConKey :: Unique

fingerprintDataConKey :: Unique

staticPtrInfoDataConKey :: Unique

staticPtrDataConKey :: Unique

coercibleDataConKey :: Unique

ordGTDataConKey :: Unique

ordEQDataConKey :: Unique

ordLTDataConKey :: Unique

rightDataConKey :: Unique

leftDataConKey :: Unique

genUnitDataConKey :: Unique

inrDataConKey :: Unique

inlDataConKey :: Unique

crossDataConKey :: Unique

heqDataConKey :: Unique

integerDataConKey :: Unique

ioDataConKey :: Unique

wordDataConKey :: Unique

trueDataConKey :: Unique

stableNameDataConKey :: Unique

word8DataConKey :: Unique

ratioDataConKey :: Unique

nilDataConKey :: Unique

eqDataConKey :: Unique

justDataConKey :: Unique

nothingDataConKey :: Unique

integerSDataConKey :: Unique

intDataConKey :: Unique

floatDataConKey :: Unique

falseDataConKey :: Unique

doubleDataConKey :: Unique

consDataConKey :: Unique

charDataConKey :: Unique

doubleX8PrimTyConKey :: Unique

floatX16PrimTyConKey :: Unique

doubleX4PrimTyConKey :: Unique

floatX8PrimTyConKey :: Unique

doubleX2PrimTyConKey :: Unique

floatX4PrimTyConKey :: Unique

word64X8PrimTyConKey :: Unique

word32X16PrimTyConKey :: Unique

word16X32PrimTyConKey :: Unique

word8X64PrimTyConKey :: Unique

word64X4PrimTyConKey :: Unique

word32X8PrimTyConKey :: Unique

word16X16PrimTyConKey :: Unique

word8X32PrimTyConKey :: Unique

word64X2PrimTyConKey :: Unique

word32X4PrimTyConKey :: Unique

word16X8PrimTyConKey :: Unique

word8X16PrimTyConKey :: Unique

int64X8PrimTyConKey :: Unique

int32X16PrimTyConKey :: Unique

int16X32PrimTyConKey :: Unique

int8X64PrimTyConKey :: Unique

int64X4PrimTyConKey :: Unique

int32X8PrimTyConKey :: Unique

int16X16PrimTyConKey :: Unique

int8X32PrimTyConKey :: Unique

int64X2PrimTyConKey :: Unique

int32X4PrimTyConKey :: Unique

int16X8PrimTyConKey :: Unique

int8X16PrimTyConKey :: Unique

typeSymbolAppendFamNameKey :: Unique

someTypeRepDataConKey :: Unique

someTypeRepTyConKey :: Unique

typeRepTyConKey :: Unique

callStackTyConKey :: Unique

staticPtrInfoTyConKey :: Unique

staticPtrTyConKey :: Unique

smallMutableArrayPrimTyConKey :: Unique

smallArrayPrimTyConKey :: Unique

anyTyConKey :: Unique

specTyConKey :: Unique

proxyPrimTyConKey :: Unique

coercibleTyConKey :: Unique

ntTyConKey :: Unique

errorMessageTypeErrorFamKey :: Unique

typeNatLogTyFamNameKey :: Unique

typeNatModTyFamNameKey :: Unique

typeNatDivTyFamNameKey :: Unique

typeNatCmpTyFamNameKey :: Unique

typeSymbolCmpTyFamNameKey :: Unique

typeNatSubTyFamNameKey :: Unique

typeNatLeqTyFamNameKey :: Unique

typeNatExpTyFamNameKey :: Unique

typeNatMulTyFamNameKey :: Unique

typeNatAddTyFamNameKey :: Unique

typeSymbolKindConNameKey :: Unique

typeNatKindConNameKey :: Unique

uWordTyConKey :: Unique

uIntTyConKey :: Unique

uFloatTyConKey :: Unique

uDoubleTyConKey :: Unique

uCharTyConKey :: Unique

uAddrTyConKey :: Unique

uRecTyConKey :: Unique

rep1TyConKey :: Unique

repTyConKey :: Unique

noSelTyConKey :: Unique

s1TyConKey :: Unique

c1TyConKey :: Unique

d1TyConKey :: Unique

rec0TyConKey :: Unique

sTyConKey :: Unique

cTyConKey :: Unique

dTyConKey :: Unique

rTyConKey :: Unique

compTyConKey :: Unique

prodTyConKey :: Unique

sumTyConKey :: Unique

m1TyConKey :: Unique

k1TyConKey :: Unique

rec1TyConKey :: Unique

par1TyConKey :: Unique

u1TyConKey :: Unique

v1TyConKey :: Unique

opaqueTyConKey :: Unique

unknown3TyConKey :: Unique

unknown2TyConKey :: Unique

unknown1TyConKey :: Unique

unknownTyConKey :: Unique

frontendPluginTyConKey :: Unique

pluginTyConKey :: Unique

vecElemTyConKey :: Unique

vecCountTyConKey :: Unique

runtimeRepTyConKey :: Unique

constraintKindTyConKey :: Unique

tYPETyConKey :: Unique

eitherTyConKey :: Unique

objectTyConKey :: Unique

compactPrimTyConKey :: Unique

tVarPrimTyConKey :: Unique

funPtrTyConKey :: Unique

ptrTyConKey :: Unique

bcoPrimTyConKey :: Unique

threadIdPrimTyConKey :: Unique

typeConKey :: Unique

boxityConKey :: Unique

kindConKey :: Unique

anyBoxConKey :: Unique

unliftedConKey :: Unique

liftedConKey :: Unique

word64TyConKey :: Unique

word64PrimTyConKey :: Unique

word32TyConKey :: Unique

word32PrimTyConKey :: Unique

word16TyConKey :: Unique

word16PrimTyConKey :: Unique

word8TyConKey :: Unique

word8PrimTyConKey :: Unique

wordTyConKey :: Unique

wordPrimTyConKey :: Unique

voidPrimTyConKey :: Unique

ioTyConKey :: Unique

mutVarPrimTyConKey :: Unique

eqPhantPrimTyConKey :: Unique

eqReprPrimTyConKey :: Unique

eqPrimTyConKey :: Unique

stableNameTyConKey :: Unique

stableNamePrimTyConKey :: Unique

statePrimTyConKey :: Unique

mutableArrayArrayPrimTyConKey :: Unique

arrayArrayPrimTyConKey :: Unique

heqTyConKey :: Unique

eqTyConKey :: Unique

stablePtrTyConKey :: Unique

stablePtrPrimTyConKey :: Unique

realWorldTyConKey :: Unique

rationalTyConKey :: Unique

ratioTyConKey :: Unique

mVarPrimTyConKey :: Unique

orderingTyConKey :: Unique

mutableByteArrayPrimTyConKey :: Unique

mutableArrayPrimTyConKey :: Unique

weakPrimTyConKey :: Unique

maybeTyConKey :: Unique

foreignObjPrimTyConKey :: Unique

listTyConKey :: Unique

naturalTyConKey :: Unique

integerTyConKey :: Unique

int64TyConKey :: Unique

int64PrimTyConKey :: Unique

int32TyConKey :: Unique

int32PrimTyConKey :: Unique

int16TyConKey :: Unique

int16PrimTyConKey :: Unique

int8TyConKey :: Unique

int8PrimTyConKey :: Unique

intTyConKey :: Unique

intPrimTyConKey :: Unique

funTyConKey :: Unique

floatTyConKey :: Unique

floatPrimTyConKey :: Unique

doubleTyConKey :: Unique

doublePrimTyConKey :: Unique

charTyConKey :: Unique

charPrimTyConKey :: Unique

byteArrayPrimTyConKey :: Unique

boolTyConKey :: Unique

arrayPrimTyConKey :: Unique

addrPrimTyConKey :: Unique

hasFieldClassNameKey :: Unique

ipClassKey :: Unique

monoidClassKey :: Unique

semigroupClassKey :: Unique

isLabelClassNameKey :: Unique

ghciIoClassKey :: Unique

knownSymbolClassNameKey :: Unique

knownNatClassNameKey :: Unique

selectorClassKey :: Unique

constructorClassKey :: Unique

datatypeClassKey :: Unique

gen1ClassKey :: Unique

genClassKey :: Unique

traversableClassKey :: Unique

foldableClassKey :: Unique

applicativeClassKey :: Unique

isStringClassKey :: Unique

randomGenClassKey :: Unique

randomClassKey :: Unique

monadPlusClassKey :: Unique

monadFailClassKey :: Unique

monadFixClassKey :: Unique

typeable7ClassKey :: Unique

typeable6ClassKey :: Unique

typeable5ClassKey :: Unique

typeable4ClassKey :: Unique

typeable3ClassKey :: Unique

typeable2ClassKey :: Unique

typeable1ClassKey :: Unique

typeableClassKey :: Unique

ixClassKey :: Unique

showClassKey :: Unique

realFracClassKey :: Unique

realFloatClassKey :: Unique

realClassKey :: Unique

readClassKey :: Unique

ordClassKey :: Unique

numClassKey :: Unique

functorClassKey :: Unique

dataClassKey :: Unique

monadClassKey :: Unique

integralClassKey :: Unique

fractionalClassKey :: Unique

floatingClassKey :: Unique

eqClassKey :: Unique

enumClassKey :: Unique

boundedClassKey :: Unique

mk_known_key_name :: NameSpace -> Module -> FastString -> Unique -> Name

dcQual :: Module -> FastString -> Unique -> Name

clsQual :: Module -> FastString -> Unique -> Name

tcQual :: Module -> FastString -> Unique -> Name

varQual :: Module -> FastString -> Unique -> Name

fingerprintDataConName :: Name

fromStaticPtrName :: Name

staticPtrDataConName :: Name

staticPtrTyConName :: Name

staticPtrInfoDataConName :: Name

staticPtrInfoTyConName :: Name

makeStaticName :: Name

frontendPluginTyConName :: Name

pluginTyConName :: Name

pLUGINS :: Module

srcLocDataConName :: Name

pushCallStackName :: Name

emptyCallStackName :: Name

callStackTyConName :: Name

hasFieldClassName :: Name

ipClassName :: Name

isLabelClassName :: Name

knownSymbolClassName :: Name

knownNatClassName :: Name

isStringClassName :: Name

randomGenClassName :: Name

randomClassName :: Name

monadPlusClassName :: Name

toAnnotationWrapperName :: Name

mzipName :: Name

liftMName :: Name

guardMName :: Name

loopAName :: Name

choiceAName :: Name

appAName :: Name

firstAName :: Name

composeAName :: Name

arrAName :: Name

mfixName :: Name

monadFixClassName :: Name

newStablePtrName :: Name

stablePtrTyConName :: Name

funPtrTyConName :: Name

ptrTyConName :: Name

word64TyConName :: Name

word32TyConName :: Name

word16TyConName :: Name

int64TyConName :: Name

int32TyConName :: Name

int16TyConName :: Name

int8TyConName :: Name

failIOName :: Name

returnIOName :: Name

bindIOName :: Name

thenIOName :: Name

ioDataConName :: Name

ioTyConName :: Name

ghciStepIoMName :: Name

ghciIoClassName :: Name

genericClassNames :: [Name]

selectorClassName :: Name

constructorClassName :: Name

datatypeClassName :: Name

gen1ClassName :: Name

genClassName :: Name

readClassName :: Name

showClassName :: Name

toListName :: Name

fromListNName :: Name

fromListName :: Name

isListClassName :: Name

zipName :: Name

filterName :: Name

concatName :: Name

boundedClassName :: Name

enumFromThenToName :: Name

enumFromThenName :: Name

enumFromToName :: Name

enumFromName :: Name

enumClassName :: Name

traceName :: Name

assertErrorName :: Name

dataClassName :: Name

toDynName :: Name

typeErrorShowTypeDataConName :: Name

typeErrorVAppendDataConName :: Name

typeErrorAppendDataConName :: Name

typeErrorTextDataConName :: Name

errorMessageTypeErrorFamName :: Name

starArrStarArrStarKindRepName :: Name

starArrStarKindRepName :: Name

starKindRepName :: Name

trGhcPrimModuleName :: Name

typeSymbolTypeRepName :: Name

typeNatTypeRepName :: Name

mkTrFunName :: Name

mkTrAppName :: Name

mkTrConName :: Name

mkTrTypeName :: Name

typeRepIdName :: Name

someTypeRepDataConName :: Name

someTypeRepTyConName :: Name

typeRepTyConName :: Name

typeableClassName :: Name

typeLitNatDataConName :: Name

typeLitSymbolDataConName :: Name

typeLitSortTyConName :: Name

kindRepTypeLitDDataConName :: Name

kindRepTypeLitSDataConName :: Name

kindRepTYPEDataConName :: Name

kindRepFunDataConName :: Name

kindRepAppDataConName :: Name

kindRepVarDataConName :: Name

kindRepTyConAppDataConName :: Name

kindRepTyConName :: Name

trTyConDataConName :: Name

trTyConTyConName :: Name

trNameDDataConName :: Name

trNameSDataConName :: Name

trNameTyConName :: Name

trModuleDataConName :: Name

trModuleTyConName :: Name

ixClassName :: Name

rationalToDoubleName :: Name

rationalToFloatName :: Name

realFloatClassName :: Name

floatingClassName :: Name

realToFracName :: Name

fromIntegralName :: Name

toRationalName :: Name

toIntegerName :: Name

fromRationalName :: Name

fractionalClassName :: Name

realFracClassName :: Name

integralClassName :: Name

realClassName :: Name

ratioDataConName :: Name

ratioTyConName :: Name

rationalTyConName :: Name

wordToNaturalName :: Name

mkNaturalName :: Name

timesNaturalName :: Name

minusNaturalName :: Name

plusNaturalName :: Name

naturalToIntegerName :: Name

naturalFromIntegerName :: Name

naturalSDataConName :: Name

naturalTyConName :: Name

bitIntegerName :: Name

shiftRIntegerName :: Name

shiftLIntegerName :: Name

complementIntegerName :: Name

xorIntegerName :: Name

orIntegerName :: Name

andIntegerName :: Name

lcmIntegerName :: Name

gcdIntegerName :: Name

decodeDoubleIntegerName :: Name

encodeDoubleIntegerName :: Name

encodeFloatIntegerName :: Name

doubleFromIntegerName :: Name

floatFromIntegerName :: Name

modIntegerName :: Name

divIntegerName :: Name

remIntegerName :: Name

quotIntegerName :: Name

divModIntegerName :: Name

quotRemIntegerName :: Name

compareIntegerName :: Name

geIntegerPrimName :: Name

ltIntegerPrimName :: Name

gtIntegerPrimName :: Name

leIntegerPrimName :: Name

signumIntegerName :: Name

absIntegerName :: Name

neqIntegerPrimName :: Name

eqIntegerPrimName :: Name

negateIntegerName :: Name

minusIntegerName :: Name

integerToIntName :: Name

integerToWordName :: Name

wordToIntegerName :: Name

smallIntegerName :: Name

timesIntegerName :: Name

plusIntegerName :: Name

int64ToIntegerName :: Name

word64ToIntegerName :: Name

integerToInt64Name :: Name

integerToWord64Name :: Name

mkIntegerName :: Name

integerSDataConName :: Name

integerTyConName :: Name

negateName :: Name

minusName :: Name

fromIntegerName :: Name

numClassName :: Name

sndName :: Name

fstName :: Name

fromStringName :: Name

opaqueTyConName :: Name

breakpointCondName :: Name

breakpointName :: Name

assertName :: Name

appendName :: Name

mapName :: Name

augmentName :: Name

buildName :: Name

foldrName :: Name

otherwiseIdName :: Name

dollarName :: Name

groupWithName :: Name

alternativeClassKey :: Unique

thenAClassOpKey :: Unique

pureAClassOpKey :: Unique

apAClassOpKey :: Unique

joinMIdKey :: Unique

alternativeClassName :: Name

joinMName :: Name

mconcatName :: Name

mappendName :: Name

memptyName :: Name

monoidClassName :: Name

sappendName :: Name

semigroupClassName :: Name

traversableClassName :: Name

foldableClassName :: Name

thenAName :: Name

pureAName :: Name

apAName :: Name

applicativeClassName :: Name

failMName :: Name

monadFailClassName :: Name

returnMName :: Name

bindMName :: Name

thenMName :: Name

monadClassName :: Name

fmapName :: Name

functorClassName :: Name

geName :: Name

ordClassName :: Name

eqName :: Name

eqClassName :: Name

inlineIdName :: Name

eqStringName :: Name

unpackCStringUtf8Name :: Name

unpackCStringFoldrName :: Name

unpackCStringName :: Name

modIntName :: Name

divIntName :: Name

metaSelDataConName :: Name

metaConsDataConName :: Name

metaDataDataConName :: Name

decidedUnpackDataConName :: Name

decidedStrictDataConName :: Name

decidedLazyDataConName :: Name

noSourceStrictnessDataConName :: Name

sourceStrictDataConName :: Name

sourceLazyDataConName :: Name

noSourceUnpackednessDataConName :: Name

sourceNoUnpackDataConName :: Name

sourceUnpackDataConName :: Name

notAssociativeDataConName :: Name

rightAssociativeDataConName :: Name

leftAssociativeDataConName :: Name

infixIDataConName :: Name

prefixIDataConName :: Name

uWordTyConName :: Name

uIntTyConName :: Name

uFloatTyConName :: Name

uDoubleTyConName :: Name

uCharTyConName :: Name

uAddrTyConName :: Name

uRecTyConName :: Name

rep1TyConName :: Name

repTyConName :: Name

noSelTyConName :: Name

s1TyConName :: Name

c1TyConName :: Name

d1TyConName :: Name

rec0TyConName :: Name

sTyConName :: Name

cTyConName :: Name

dTyConName :: Name

rTyConName :: Name

compTyConName :: Name

prodTyConName :: Name

sumTyConName :: Name

m1TyConName :: Name

k1TyConName :: Name

rec1TyConName :: Name

par1TyConName :: Name

u1TyConName :: Name

v1TyConName :: Name

rightDataConName :: Name

leftDataConName :: Name

eitherTyConName :: Name

specTyConName :: Name

ordGTDataConName :: Name

ordEQDataConName :: Name

ordLTDataConName :: Name

orderingTyConName :: Name

runRWName :: Name

runMainIOName :: Name

wildCardName :: Name

dataQual_RDR :: Module -> FastString -> RdrName

clsQual_RDR :: Module -> FastString -> RdrName

tcQual_RDR :: Module -> FastString -> RdrName

varQual_RDR :: Module -> FastString -> RdrName

mappend_RDR :: RdrName

mempty_RDR :: RdrName

traverse_RDR :: RdrName

all_RDR :: RdrName

null_RDR :: RdrName

foldMap_RDR :: RdrName

foldable_foldr_RDR :: RdrName

liftA2_RDR :: RdrName

ap_RDR :: RdrName

pure_RDR :: RdrName

replace_RDR :: RdrName

fmap_RDR :: RdrName

uWordHash_RDR :: RdrName

uIntHash_RDR :: RdrName

uFloatHash_RDR :: RdrName

uDoubleHash_RDR :: RdrName

uCharHash_RDR :: RdrName

uAddrHash_RDR :: RdrName

uWordDataCon_RDR :: RdrName

uIntDataCon_RDR :: RdrName

uFloatDataCon_RDR :: RdrName

uDoubleDataCon_RDR :: RdrName

uCharDataCon_RDR :: RdrName

uAddrDataCon_RDR :: RdrName

notAssocDataCon_RDR :: RdrName

rightAssocDataCon_RDR :: RdrName

leftAssocDataCon_RDR :: RdrName

infixDataCon_RDR :: RdrName

prefixDataCon_RDR :: RdrName

conIsRecord_RDR :: RdrName

conFixity_RDR :: RdrName

conName_RDR :: RdrName

selName_RDR :: RdrName

isNewtypeName_RDR :: RdrName

packageName_RDR :: RdrName

moduleName_RDR :: RdrName

datatypeName_RDR :: RdrName

to1_RDR :: RdrName

to_RDR :: RdrName

from1_RDR :: RdrName

from_RDR :: RdrName

unComp1_RDR :: RdrName

unK1_RDR :: RdrName

unRec1_RDR :: RdrName

unPar1_RDR :: RdrName

comp1DataCon_RDR :: RdrName

prodDataCon_RDR :: RdrName

r1DataCon_RDR :: RdrName

l1DataCon_RDR :: RdrName

m1DataCon_RDR :: RdrName

k1DataCon_RDR :: RdrName

rec1DataCon_RDR :: RdrName

par1DataCon_RDR :: RdrName

u1DataCon_RDR :: RdrName

error_RDR :: RdrName

undefined_RDR :: RdrName

showParen_RDR :: RdrName

showCommaSpace_RDR :: RdrName

showSpace_RDR :: RdrName

showString_RDR :: RdrName

shows_RDR :: RdrName

showsPrec_RDR :: RdrName

pfail_RDR :: RdrName

prec_RDR :: RdrName

reset_RDR :: RdrName

alt_RDR :: RdrName

step_RDR :: RdrName

symbol_RDR :: RdrName

ident_RDR :: RdrName

punc_RDR :: RdrName

readSymField_RDR :: RdrName

readFieldHash_RDR :: RdrName

readField_RDR :: RdrName

expectP_RDR :: RdrName

lexP_RDR :: RdrName

choose_RDR :: RdrName

parens_RDR :: RdrName

readPrec_RDR :: RdrName

readListPrecDefault_RDR :: RdrName

readListPrec_RDR :: RdrName

readListDefault_RDR :: RdrName

readList_RDR :: RdrName

unsafeRangeSize_RDR :: RdrName

unsafeIndex_RDR :: RdrName

index_RDR :: RdrName

inRange_RDR :: RdrName

range_RDR :: RdrName

maxBound_RDR :: RdrName

minBound_RDR :: RdrName

pred_RDR :: RdrName

succ_RDR :: RdrName

getTag_RDR :: RdrName

not_RDR :: RdrName

and_RDR :: RdrName

compose_RDR :: RdrName

toList_RDR :: RdrName

fromListN_RDR :: RdrName

fromList_RDR :: RdrName

fromString_RDR :: RdrName

stringTy_RDR :: RdrName

fromIntegral_RDR :: RdrName

toRational_RDR :: RdrName

toInteger_RDR :: RdrName

plus_RDR :: RdrName

times_RDR :: RdrName

minus_RDR :: RdrName

fromRational_RDR :: RdrName

fromInteger_RDR :: RdrName

returnIO_RDR :: RdrName

bindIO_RDR :: RdrName

newStablePtr_RDR :: RdrName

unpackCStringUtf8_RDR :: RdrName

unpackCStringFoldr_RDR :: RdrName

unpackCString_RDR :: RdrName

eqString_RDR :: RdrName

ioDataCon_RDR :: RdrName

timesInteger_RDR :: RdrName

plusInteger_RDR :: RdrName

ratioDataCon_RDR :: RdrName

enumFromThenTo_RDR :: RdrName

enumFromThen_RDR :: RdrName

enumFromTo_RDR :: RdrName

enumFrom_RDR :: RdrName

toEnum_RDR :: RdrName

fromEnum_RDR :: RdrName

right_RDR :: RdrName

left_RDR :: RdrName

failM_RDR :: RdrName

bindM_RDR :: RdrName

returnM_RDR :: RdrName

build_RDR :: RdrName

foldr_RDR :: RdrName

append_RDR :: RdrName

map_RDR :: RdrName

monadClass_RDR :: RdrName

enumClass_RDR :: RdrName

ordClass_RDR :: RdrName

numClass_RDR :: RdrName

eqClass_RDR :: RdrName

gtTag_RDR :: RdrName

eqTag_RDR :: RdrName

ltTag_RDR :: RdrName

compare_RDR :: RdrName

gt_RDR :: RdrName

lt_RDR :: RdrName

le_RDR :: RdrName

ge_RDR :: RdrName

eq_RDR :: RdrName

main_RDR_Unqual :: RdrName

mkMainModule_ :: ModuleName -> Module

mkMainModule :: FastString -> Module

mkThisGhcModule_ :: ModuleName -> Module

mkThisGhcModule :: FastString -> Module

mkBaseModule_ :: ModuleName -> Module

mkBaseModule :: FastString -> Module

mkIntegerModule :: FastString -> Module

mkPrimModule :: FastString -> Module

dATA_ARRAY_PARALLEL_PRIM_NAME :: ModuleName

dATA_ARRAY_PARALLEL_NAME :: ModuleName

mAIN_NAME :: ModuleName

pRELUDE_NAME :: ModuleName

mkInteractiveModule :: Int -> Module

rOOT_MAIN :: Module

gHC_RECORDS :: Module

gHC_OVER_LABELS :: Module

gHC_FINGERPRINT_TYPE :: Module

gHC_STATICPTR_INTERNAL :: Module

gHC_STATICPTR :: Module

gHC_STACK_TYPES :: Module

gHC_STACK :: Module

gHC_SRCLOC :: Module

dEBUG_TRACE :: Module

dATA_COERCE :: Module

dATA_TYPE_EQUALITY :: Module

gHC_TYPENATS :: Module

gHC_TYPELITS :: Module

gHC_GENERICS :: Module

cONTROL_EXCEPTION_BASE :: Module

gHC_EXTS :: Module

rANDOM :: Module

gHC_DESUGAR :: Module

cONTROL_APPLICATIVE :: Module

aRROW :: Module

mONAD_FAIL :: Module

mONAD_ZIP :: Module

mONAD_FIX :: Module

mONAD :: Module

gHC_WORD :: Module

gHC_INT :: Module

lEX :: Module

rEAD_PREC :: Module

gENERICS :: Module

tYPEABLE_INTERNAL :: Module

tYPEABLE :: Module

dYNAMIC :: Module

sYSTEM_IO :: Module

gHC_TOP_HANDLER :: Module

gHC_FLOAT :: Module

gHC_REAL :: Module

gHC_ERR :: Module

gHC_PTR :: Module

gHC_STABLE :: Module

gHC_IX :: Module

gHC_ST :: Module

gHC_IO_Exception :: Module

gHC_IO :: Module

gHC_CONC :: Module

dATA_TRAVERSABLE :: Module

dATA_FOLDABLE :: Module

dATA_STRING :: Module

dATA_LIST :: Module

dATA_EITHER :: Module

dATA_TUPLE :: Module

gHC_TUPLE :: Module

gHC_LIST :: Module

gHC_NATURAL :: Module

gHC_INTEGER_TYPE :: Module

gHC_MAYBE :: Module

gHC_NUM :: Module

gHC_READ :: Module

gHC_SHOW :: Module

gHC_GHCI_HELPERS :: Module

gHC_GHCI :: Module

gHC_ENUM :: Module

gHC_BASE :: Module

gHC_PRIMOPWRAPPERS :: Module

gHC_CLASSES :: Module

gHC_CSTRING :: Module

gHC_MAGIC :: Module

gHC_TYPES :: Module

gHC_PRIM :: Module

pRELUDE :: Module

genericTyConNames :: [Name]

basicKnownKeyNames :: [Name]

isUnboundName :: Name -> Bool

mkUnboundName :: OccName -> Name

itName :: Unique -> SrcSpan -> Name

allNameStrings :: [String]

mAIN :: Module

liftedTypeKindTyConKey :: Unique

hasKey :: Uniquable a => a -> Unique -> Bool

class Uniquable a where

Class of things that we can obtain a Unique from

Methods

getUnique :: a -> Unique

Instances

Uniquable Int

Defined in Unique

Methods

getUnique :: Int -> Unique

Uniquable EvBindsVar

Defined in TcEvidence

Methods

getUnique :: EvBindsVar -> Unique

Uniquable LocalReg

Defined in CmmExpr

Methods

getUnique :: LocalReg -> Unique

Uniquable Label

Defined in Hoopl.Label

Methods

getUnique :: Label -> Unique

Uniquable Class

Defined in Class

Methods

getUnique :: Class -> Unique

Uniquable CoAxiomRule

Defined in CoAxiom

Methods

getUnique :: CoAxiomRule -> Unique

Uniquable ConLike

Defined in ConLike

Methods

getUnique :: ConLike -> Unique

Uniquable DataCon

Defined in DataCon

Methods

getUnique :: DataCon -> Unique

Uniquable PatSyn

Defined in PatSyn

Methods

getUnique :: PatSyn -> Unique

Uniquable Var

Defined in Var

Methods

getUnique :: Var -> Unique

Uniquable SourcePackageId

Defined in PackageConfig

Methods

getUnique :: SourcePackageId -> Unique

Uniquable PackageName

Defined in PackageConfig

Methods

getUnique :: PackageName -> Unique

Uniquable Unique

Defined in Unique

Methods

getUnique :: Unique -> Unique

Uniquable Module

Defined in Module

Methods

getUnique :: Module -> Unique

Uniquable ModuleName

Defined in Module

Methods

getUnique :: ModuleName -> Unique

Uniquable UnitId

Defined in Module

Methods

getUnique :: UnitId -> Unique

Uniquable InstalledUnitId

Defined in Module

Methods

getUnique :: InstalledUnitId -> Unique

Uniquable ComponentId

Defined in Module

Methods

getUnique :: ComponentId -> Unique

Uniquable FastString

Defined in Unique

Methods

getUnique :: FastString -> Unique

Uniquable TyCon

Defined in TyCon

Methods

getUnique :: TyCon -> Unique

Uniquable OccName

Defined in OccName

Methods

getUnique :: OccName -> Unique

Uniquable Name

Defined in Name

Methods

getUnique :: Name -> Unique

Uniquable (CoAxiom br)

Defined in CoAxiom

Methods

getUnique :: CoAxiom br -> Unique

Uniquable name => Uniquable (AnnTarget name)

Defined in Annotations

Methods

getUnique :: AnnTarget name -> Unique

module RdrName

module RnSplice

module RnNames

module TcEnv

wrapIP :: Type -> CoercionR

Create a Coercion that wraps a value in an implicit-parameter dictionary. See unwrapIP.

unwrapIP :: Type -> CoercionR

Create a Coercion that unwraps an implicit-parameter or overloaded-label dictionary to expose the underlying value. We expect the Type to have the form `IP sym ty` or `IsLabel sym ty`, and return a Coercion `co :: IP sym ty ~ ty` or `co :: IsLabel sym ty ~ Proxy# sym -> ty`. See also Note [Type-checking overloaded labels] in TcExpr.

pprHsWrapper :: HsWrapper -> (Bool -> SDoc) -> SDoc

evVarsOfTerm :: EvTerm -> VarSet

findNeededEvVars :: EvBindMap -> VarSet -> VarSet

evTermCoercion :: EvTerm -> TcCoercion

evTermCoercion_maybe :: EvTerm -> Maybe TcCoercion

isEmptyTcEvBinds :: TcEvBinds -> Bool

emptyTcEvBinds :: TcEvBinds

mkEvScSelectors :: Class -> [TcType] -> [(TcPredType, EvExpr)]

mkEvCast :: EvExpr -> TcCoercion -> EvTerm

evTypeable :: Type -> EvTypeable -> EvTerm

evSelector :: Id -> [Type] -> [EvExpr] -> EvExpr

evDataConApp :: DataCon -> [Type] -> [EvExpr] -> EvTerm

evDFunApp :: DFunId -> [Type] -> [EvExpr] -> EvTerm

evCast :: EvExpr -> TcCoercion -> EvTerm

d |> co

evCoercion :: TcCoercion -> EvTerm

evId :: EvId -> EvExpr

Any sort of evidence Id, including coercions

mkGivenEvBind :: EvVar -> EvTerm -> EvBind

mkWantedEvBind :: EvVar -> EvTerm -> EvBind

evBindVar :: EvBind -> EvVar

filterEvBindMap :: (EvBind -> Bool) -> EvBindMap -> EvBindMap

foldEvBindMap :: (EvBind -> a -> a) -> a -> EvBindMap -> a

evBindMapBinds :: EvBindMap -> Bag EvBind

lookupEvBind :: EvBindMap -> EvVar -> Maybe EvBind

isEmptyEvBindMap :: EvBindMap -> Bool

extendEvBinds :: EvBindMap -> EvBind -> EvBindMap

emptyEvBindMap :: EvBindMap

isCoEvBindsVar :: EvBindsVar -> Bool

collectHsWrapBinders :: HsWrapper -> ([Var], HsWrapper)

isErasableHsWrapper :: HsWrapper -> Bool

Is the wrapper erasable, i.e., will not affect runtime semantics?

isIdHsWrapper :: HsWrapper -> Bool

idHsWrapper :: HsWrapper

mkWpLet :: TcEvBinds -> HsWrapper

mkWpLams :: [Var] -> HsWrapper

mkWpTyLams :: [TyVar] -> HsWrapper

mkWpEvVarApps :: [EvVar] -> HsWrapper

mkWpEvApps :: [EvTerm] -> HsWrapper

mkWpTyApps :: [Type] -> HsWrapper

mkWpCastN :: TcCoercionN -> HsWrapper

mkWpCastR :: TcCoercionR -> HsWrapper

mkWpFun :: HsWrapper -> HsWrapper -> TcType -> TcType -> SDoc -> HsWrapper

maybeTcSubCo :: EqRel -> TcCoercion -> TcCoercion

If the EqRel is ReprEq, makes a SubCo; otherwise, does nothing. Note that the input coercion should always be nominal.

tcCoToMCo :: TcCoercion -> TcMCoercion

isTcReflexiveCo :: TcCoercion -> Bool

This version does a slow check, calculating the related types and seeing if they are equal.

isTcGReflMCo :: TcMCoercion -> Bool

isTcReflCo :: TcCoercion -> Bool

coVarsOfTcCo :: TcCoercion -> TcTyCoVarSet

tcCoercionRole :: TcCoercion -> Role

tcCoercionKind :: TcCoercion -> Pair TcType

mkTcCoVarCo :: CoVar -> TcCoercion

mkTcKindCo :: TcCoercion -> TcCoercionN

mkTcPhantomCo :: TcCoercionN -> TcType -> TcType -> TcCoercionP

mkTcCoherenceRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcCoherenceLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcGReflLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcGReflRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcAxiomRuleCo :: CoAxiomRule -> [TcCoercion] -> TcCoercionR

tcDowngradeRole :: Role -> Role -> TcCoercion -> TcCoercion

mkTcSubCo :: TcCoercionN -> TcCoercionR

mkTcLRCo :: LeftOrRight -> TcCoercion -> TcCoercion

mkTcNthCo :: Role -> Int -> TcCoercion -> TcCoercion

mkTcForAllCos :: [(TyVar, TcCoercionN)] -> TcCoercion -> TcCoercion

mkTcForAllCo :: TyVar -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcUnbranchedAxInstCo :: CoAxiom Unbranched -> [TcType] -> [TcCoercion] -> TcCoercionR

mkTcAxInstCo :: forall (br :: BranchFlag). Role -> CoAxiom br -> BranchIndex -> [TcType] -> [TcCoercion] -> TcCoercion

mkTcFunCo :: Role -> TcCoercion -> TcCoercion -> TcCoercion

mkTcAppCo :: TcCoercion -> TcCoercionN -> TcCoercion

mkTcTyConAppCo :: Role -> TyCon -> [TcCoercion] -> TcCoercion

mkTcRepReflCo :: TcType -> TcCoercionR

mkTcNomReflCo :: TcType -> TcCoercionN

mkTcTransCo :: TcCoercion -> TcCoercion -> TcCoercion

mkTcSymCo :: TcCoercion -> TcCoercion

mkTcReflCo :: Role -> TcType -> TcCoercion

type TcCoercion = Coercion

type TcCoercionN = CoercionN

type TcCoercionR = CoercionR

type TcCoercionP = CoercionP

type TcMCoercion = MCoercion

data HsWrapper

Constructors

WpHole

WpCompose HsWrapper HsWrapper

WpFun HsWrapper HsWrapper TcType SDoc

WpCast TcCoercionR

WpEvLam EvVar

WpEvApp EvTerm

WpTyLam TyVar

WpTyApp KindOrType

WpLet TcEvBinds

Instances

Data HsWrapper

Defined in TcEvidence

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 TcEvidence

Methods

ppr :: HsWrapper -> SDoc

pprPrec :: Rational -> HsWrapper -> SDoc

data TcEvBinds

Constructors

TcEvBinds EvBindsVar

EvBinds (Bag EvBind)

Instances

Data TcEvBinds

Defined in TcEvidence

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 TcEvidence

Methods

ppr :: TcEvBinds -> SDoc

pprPrec :: Rational -> TcEvBinds -> 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 TcEvidence

Methods

getUnique :: EvBindsVar -> Unique

Outputable EvBindsVar

Defined in TcEvidence

Methods

ppr :: EvBindsVar -> SDoc

pprPrec :: Rational -> EvBindsVar -> SDoc

newtype EvBindMap

Constructors

EvBindMap

Fields

• ev_bind_varenv :: DVarEnv EvBind

Instances

Outputable EvBindMap

Defined in TcEvidence

Methods

ppr :: EvBindMap -> SDoc

pprPrec :: Rational -> EvBindMap -> SDoc

data EvBind

Constructors

EvBind

Fields

• eb_lhs :: EvVar
• eb_rhs :: EvTerm
• eb_is_given :: Bool

Instances

Outputable EvBind

Defined in TcEvidence

Methods

ppr :: EvBind -> SDoc

pprPrec :: Rational -> EvBind -> 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 TcEvidence

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 TcEvidence

Methods

ppr :: EvTerm -> SDoc

pprPrec :: Rational -> EvTerm -> SDoc

type EvExpr = CoreExpr

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

Dictionary for Typeable (s -> t), given a dictionaries for 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 TcEvidence

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 TcEvidence

Methods

ppr :: EvTypeable -> SDoc

pprPrec :: Rational -> EvTypeable -> SDoc

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 TcEvidence

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 TcEvidence

Methods

ppr :: EvCallStack -> SDoc

pprPrec :: Rational -> EvCallStack -> SDoc

data CoercionHole

A coercion to be filled in by the type-checker. See Note [Coercion holes]

Instances

Data CoercionHole

Defined in TyCoRep

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

Outputable CoercionHole

Defined in TyCoRep

Methods

ppr :: CoercionHole -> SDoc

pprPrec :: Rational -> CoercionHole -> SDoc

data Role

Constructors

Nominal

Representational

Phantom

Instances

Eq Role

Defined in CoAxiom

Methods

(==) :: Role -> Role -> Bool

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

Data Role

Defined in CoAxiom

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

Ord Role

Defined in CoAxiom

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

Binary Role

Defined in CoAxiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in CoAxiom

Methods

ppr :: Role -> SDoc

pprPrec :: Rational -> Role -> SDoc

Annotate (Maybe Role)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> Maybe Role -> Annotated ()

pickLR :: LeftOrRight -> (a, a) -> a

data LeftOrRight

Constructors

CLeft

CRight

Instances

Eq LeftOrRight

Defined in BasicTypes

Methods

(==) :: LeftOrRight -> LeftOrRight -> Bool

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

Data LeftOrRight

Defined in BasicTypes

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

Outputable LeftOrRight

Defined in BasicTypes

Methods

ppr :: LeftOrRight -> SDoc

pprPrec :: Rational -> LeftOrRight -> SDoc

isNextArgVisible :: TcType -> Bool

Should this type be applied to a visible argument?

isNextTyConArgVisible :: TyCon -> [Type] -> Bool

If the tycon is applied to the types, is the next argument visible?

tcTyConVisibilities :: TyCon -> [Bool]

For every arg a tycon can take, the returned list says True if the argument is taken visibly, and False otherwise. Ends with an infinite tail of Trues to allow for oversaturation.

sizeTypes :: [Type] -> TypeSize

sizeType :: Type -> TypeSize

isFunPtrTy :: Type -> Bool

isFFIPrimResultTy :: DynFlags -> Type -> Validity

isFFIPrimArgumentTy :: DynFlags -> Type -> Validity

isFFILabelTy :: Type -> Validity

isFFIDynTy :: Type -> Type -> Validity

isFFIExportResultTy :: Type -> Validity

isFFIImportResultTy :: DynFlags -> Type -> Validity

isFFIExternalTy :: Type -> Validity

isFFIArgumentTy :: DynFlags -> Safety -> Type -> Validity

isFFITy :: Type -> Bool

tcSplitIOType_maybe :: Type -> Maybe (TyCon, Type)

deNoteType :: Type -> Type

isAlmostFunctionFree :: TcType -> Bool

Is this type *almost function-free*? See Note [Almost function-free] in TcRnTypes

isRigidTy :: TcType -> Bool

isTyVarHead :: TcTyVar -> TcType -> Bool

Does the given tyvar appear at the head of a chain of applications (a t1 ... tn)

isCallStackPred :: Class -> [Type] -> Maybe FastString

Is a PredType a CallStack implicit parameter?

If so, return the name of the parameter.

isCallStackTy :: Type -> Bool

Is a type a CallStack?

isStringTy :: Type -> Bool

Is a type String?

isFloatingTy :: Type -> Bool

Does a type represent a floating-point number?

isCharTy :: Type -> Bool

isUnitTy :: Type -> Bool

isBoolTy :: Type -> Bool

isWordTy :: Type -> Bool

isIntTy :: Type -> Bool

isIntegerTy :: Type -> Bool

isDoubleTy :: Type -> Bool

isFloatTy :: Type -> Bool

isOverloadedTy :: Type -> Bool

isRhoExpTy :: ExpType -> Bool

Like isRhoTy, but also says True for Infer types

isRhoTy :: TcType -> Bool

isSigmaTy :: TcType -> Bool

isInsolubleOccursCheck :: EqRel -> TcTyVar -> TcType -> Bool

Is the equality a ~r ...a.... definitely insoluble or not? a ~r Maybe a -- Definitely insoluble a ~N ...(F a)... -- Not definitely insoluble -- Perhaps (F a) reduces to Int a ~R ...(N a)... -- Not definitely insoluble -- Perhaps newtype N a = MkN Int See Note [Occurs check error] in TcCanonical for the motivation for this function.

isImprovementPred :: PredType -> Bool

immSuperClasses :: Class -> [Type] -> [PredType]

transSuperClasses :: PredType -> [PredType]

mkMinimalBySCs :: (a -> PredType) -> [a] -> [a]

pickCapturedPreds :: TyVarSet -> TcThetaType -> TcThetaType

boxEqPred :: EqRel -> Type -> Type -> Maybe (Class, [Type])

pickQuantifiablePreds :: TyVarSet -> TcThetaType -> TcThetaType

When inferring types, should we quantify over a given predicate? Generally true of classes; generally false of equality constraints. Equality constraints that mention quantified type variables and implicit variables complicate the story. See Notes [Inheriting implicit parameters] and [Quantifying over equality constraints]

evVarPred :: EvVar -> PredType

hasTyVarHead :: Type -> Bool

checkValidClsArgs :: Bool -> Class -> [KindOrType] -> Bool

isTyVarClassPred :: PredType -> Bool

pickyEqType :: TcType -> TcType -> Bool

Like pickyEqTypeVis, but returns a Bool for convenience

tcEqTypeVis :: TcType -> TcType -> Bool

Like tcEqType, but returns True if the visible part of the types are equal, even if they are really unequal (in the invisible bits)

tcEqTypeNoKindCheck :: TcType -> TcType -> Bool

Just like tcEqType, but will return True for types of different kinds as long as their non-coercion structure is identical.

tcEqType :: HasDebugCallStack => TcType -> TcType -> Bool

tcEqKind :: HasDebugCallStack => TcKind -> TcKind -> Bool

tcSplitMethodTy :: Type -> ([TyVar], PredType, Type)

tcSplitDFunHead :: Type -> (Class, [Type])

tcSplitDFunTy :: Type -> ([TyVar], [Type], Class, [Type])

tcIsTyVarTy :: Type -> Bool

tcGetTyVar :: String -> Type -> TyVar

tcGetTyVar_maybe :: Type -> Maybe TyVar

tcGetCastedTyVar_maybe :: Type -> Maybe (TyVar, CoercionN)

If the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind type

tcRepGetNumAppTys :: Type -> Arity

Returns the number of arguments in the given type, without looking through synonyms. This is used only for error reporting. We don't look through synonyms because of #11313.

tcSplitAppTys :: Type -> (Type, [Type])

tcSplitAppTy :: Type -> (Type, Type)

tcSplitAppTy_maybe :: Type -> Maybe (Type, Type)

tcFunResultTyN :: HasDebugCallStack => Arity -> Type -> Type

Strips off n *visible* arguments and returns the resulting type

tcFunResultTy :: Type -> Type

tcFunArgTy :: Type -> Type

tcSplitFunTysN :: Arity -> TcRhoType -> Either Arity ([TcSigmaType], TcSigmaType)

Split off exactly the specified number argument types Returns (Left m) if there are m missing arrows in the type (Right (tys,res)) if the type looks like t1 -> ... -> tn -> res

tcSplitFunTy_maybe :: Type -> Maybe (Type, Type)

tcSplitFunTys :: Type -> ([Type], Type)

tcSplitTyConApp :: Type -> (TyCon, [Type])

tcTyConAppArgs :: Type -> [Type]

tcTyConAppTyCon_maybe :: Type -> Maybe TyCon

Like tcRepSplitTyConApp_maybe, but only returns the TyCon.

tcTyConAppTyCon :: Type -> TyCon

tcDeepSplitSigmaTy_maybe :: TcSigmaType -> Maybe ([TcType], [TyVar], ThetaType, TcSigmaType)

tcSplitNestedSigmaTys :: Type -> ([TyVar], ThetaType, Type)

Split a sigma type into its parts, going underneath as many ForAllTys as possible. For example, given this type synonym:

type Traversal s t a b = forall f. Applicative f => (a -> f b) -> s -> f t

if you called tcSplitSigmaTy on this type:

forall s t a b. Each s t a b => Traversal s t a b

then it would return ([s,t,a,b], [Each s t a b], Traversal s t a b). But if you instead called tcSplitNestedSigmaTys on the type, it would return ([s,t,a,b,f], [Each s t a b, Applicative f], (a -> f b) -> s -> f t).

tcSplitSigmaTy :: Type -> ([TyVar], ThetaType, Type)

Split a sigma type into its parts.

tcSplitPhiTy :: Type -> (ThetaType, Type)

tcSplitPredFunTy_maybe :: Type -> Maybe (PredType, Type)

tcIsForAllTy :: Type -> Bool

Is this a ForAllTy with a named binder?

tcSplitForAllVarBndrs :: Type -> ([TyVarBinder], Type)

Like tcSplitForAllTys, but splits off only named binders.

tcSplitForAllTysSameVis :: ArgFlag -> Type -> ([TyVar], Type)

Like tcSplitForAllTys, but only splits a ForAllTy if sameVis argf supplied_argf is True, where argf is the visibility of the ForAllTy's binder and supplied_argf is the visibility provided as an argument to this function.

tcSplitForAllTys :: Type -> ([TyVar], Type)

Like tcSplitPiTys, but splits off only named binders, returning just the tycovars.

tcSplitForAllTy_maybe :: Type -> Maybe (TyVarBinder, Type)

tcSplitPiTy_maybe :: Type -> Maybe (TyBinder, Type)

Splits a type into a TyBinder and a body, if possible. Panics otherwise

tcSplitPiTys :: Type -> ([TyBinder], Type)

Splits a forall type into a list of TyBinders and the inner type. Always succeeds, even if it returns an empty list.

mkTcCastTy :: Type -> Coercion -> Type

mkTcAppTy :: Type -> Type -> Type

mkTcAppTys :: Type -> [Type] -> Type

getDFunTyKey :: Type -> OccName

mkPhiTy :: [PredType] -> Type -> Type

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

Make a sigma ty where all type variables are "specified". That is, they can be used with visible type application

mkInfSigmaTy :: [TyCoVar] -> [PredType] -> Type -> Type

Make a sigma ty where all type variables are Inferred. That is, they cannot be used with visible type application.

mkSigmaTy :: [TyCoVarBinder] -> [PredType] -> Type -> Type

findDupTyVarTvs :: [(Name, TcTyVar)] -> [(Name, Name)]

mkTyVarNamePairs :: [TyVar] -> [(Name, TyVar)]

isRuntimeUnkSkol :: TyVar -> Bool

isIndirect :: MetaDetails -> Bool

isFlexi :: MetaDetails -> Bool

isTyVarTyVar :: Var -> Bool

setMetaTyVarTcLevel :: TcTyVar -> TcLevel -> TcTyVar

metaTyVarRef :: TyVar -> IORef MetaDetails

metaTyVarTcLevel_maybe :: TcTyVar -> Maybe TcLevel

metaTyVarTcLevel :: TcTyVar -> TcLevel

metaTyVarInfo :: TcTyVar -> MetaInfo

isMetaTyVarTy :: TcType -> Bool

isAmbiguousTyVar :: TcTyVar -> Bool

isMetaTyVar :: TcTyVar -> Bool

isOverlappableTyVar :: TcTyVar -> Bool

isSkolemTyVar :: TcTyVar -> Bool

isFlattenTyVar :: TcTyVar -> Bool

True of both given and wanted flatten-skolems (fmv and fsk)

isFskTyVar :: TcTyVar -> Bool

isFmvTyVar :: TcTyVar -> Bool

isTyConableTyVar :: TcTyVar -> Bool

isImmutableTyVar :: TyVar -> Bool

isFloatedTouchableMetaTyVar :: TcLevel -> TcTyVar -> Bool

isTouchableMetaTyVar :: TcLevel -> TcTyVar -> Bool

tcIsTcTyVar :: TcTyVar -> Bool

anyRewritableTyVar :: Bool -> EqRel -> (EqRel -> TcTyVar -> Bool) -> TcType -> Bool

isTyFamFree :: Type -> Bool

Check that a type does not contain any type family applications.

tcTyConAppTyFamInstsAndVis :: TyCon -> [Type] -> [(Bool, TyCon, [Type])]

In an application of a TyCon to some arguments, find the outermost occurrences of type family applications within the arguments. This function will not consider the TyCon itself when checking for type family applications.

See tcTyFamInstsAndVis for more details on how this works (as this function is called inside of tcTyFamInstsAndVis).

tcTyFamInstsAndVis :: Type -> [(Bool, TyCon, [Type])]

Like tcTyFamInsts, except that the output records whether the type family and its arguments occur as an invisible argument in some type application. This information is useful because it helps GHC know when to turn on -fprint-explicit-kinds during error reporting so that users can actually see the type family being mentioned.

As an example, consider:

class C a
data T (a :: k)
type family F a :: k
instance C (T @(F Int) (F Bool))

There are two occurrences of the type family F in that C instance, so tcTyFamInstsAndVis (C (T @(F Int) (F Bool))) will return:

[ (True,  F, [Int])
, (False, F, [Bool]) ]

F Int is paired with True since it appears as an invisible argument to C, whereas F Bool is paired with False since it appears an a visible argument to C.

See also Note [Kind arguments in error messages] in TcErrors.

tcTyFamInsts :: Type -> [(TyCon, [Type])]

Finds outermost type-family applications occurring in a type, after expanding synonyms. In the list (F, tys) that is returned we guarantee that tys matches F's arity. For example, given type family F a :: * -> * (arity 1) calling tcTyFamInsts on (Maybe (F Int Bool) will return (F, [Int]), not (F, [Int,Bool])

This is important for its use in deciding termination of type instances (see #11581). E.g. type instance G [Int] = ...(F Int type)... we don't need to take type into account when asking if the calls on the RHS are smaller than the LHS

promoteSkolemsX :: TcLevel -> TCvSubst -> [TcTyVar] -> (TCvSubst, [TcTyVar])

promoteSkolemX :: TcLevel -> TCvSubst -> TcTyVar -> (TCvSubst, TcTyVar)

Change the TcLevel in a skolem, extending a substitution

promoteSkolem :: TcLevel -> TcTyVar -> TcTyVar

tcTypeLevel :: TcType -> TcLevel

tcTyVarLevel :: TcTyVar -> TcLevel

sameDepthAs :: TcLevel -> TcLevel -> Bool

strictlyDeeperThan :: TcLevel -> TcLevel -> Bool

pushTcLevel :: TcLevel -> TcLevel

isTopTcLevel :: TcLevel -> Bool

topTcLevel :: TcLevel

maxTcLevel :: TcLevel -> TcLevel -> TcLevel

superSkolemTv :: TcTyVarDetails

mkSynFunTys :: [SyntaxOpType] -> ExpType -> SyntaxOpType

Like mkFunTys but for SyntaxOpType

synKnownType :: TcType -> SyntaxOpType

Like SynType but accepts a regular TcType

mkCheckExpType :: TcType -> ExpType

Make an ExpType suitable for checking.

type TcCoVar = CoVar

type TcType = Type

type TcTyCoVar = Var

type TcTyVarBinder = TyVarBinder

type TcTyCon = TyCon

type TcPredType = PredType

type TcThetaType = ThetaType

type TcSigmaType = TcType

type TcRhoType = TcType

type TcTauType = TcType

type TcKind = Kind

type TcTyVarSet = TyVarSet

type TcTyCoVarSet = TyCoVarSet

type TcDTyVarSet = DTyVarSet

type TcDTyCoVarSet = DTyCoVarSet

data ExpType

An expected type to check against during type-checking. See Note [ExpType] in TcMType, where you'll also find manipulators.

Constructors

Check TcType

Infer !InferResult

Instances

Outputable ExpType

Defined in TcType

Methods

ppr :: ExpType -> SDoc

pprPrec :: Rational -> ExpType -> SDoc

data InferResult

Constructors

IR

Fields

• ir_uniq :: Unique
• ir_lvl :: TcLevel
• ir_inst :: Bool
• ir_ref :: IORef (Maybe TcType)

Instances

Outputable InferResult

Defined in TcType

Methods

ppr :: InferResult -> SDoc

pprPrec :: Rational -> InferResult -> SDoc

type ExpSigmaType = ExpType

type ExpRhoType = ExpType

data SyntaxOpType

What to expect for an argument to a rebindable-syntax operator. Quite like Type, but allows for holes to be filled in by tcSyntaxOp. The callback called from tcSyntaxOp gets a list of types; the meaning of these types is determined by a left-to-right depth-first traversal of the SyntaxOpType tree. So if you pass in

SynAny `SynFun` (SynList `SynFun` SynType Int) `SynFun` SynAny

you'll get three types back: one for the first SynAny, the element type of the list, and one for the last SynAny. You don't get anything for the SynType, because you've said positively that it should be an Int, and so it shall be.

This is defined here to avoid defining it in TcExpr.hs-boot.

Constructors

SynAny

Any type

SynRho

A rho type, deeply skolemised or instantiated as appropriate

SynList

A list type. You get back the element type of the list

SynFun SyntaxOpType SyntaxOpType infixr 0

A function.

SynType ExpType

A known type.

data MetaInfo

Constructors

TauTv

TyVarTv

FlatMetaTv

FlatSkolTv

Instances

Outputable MetaInfo

Defined in TcType

Methods

ppr :: MetaInfo -> SDoc

pprPrec :: Rational -> MetaInfo -> SDoc

newtype TcLevel

Constructors

TcLevel Int

Instances

Eq TcLevel

Defined in TcType

Methods

(==) :: TcLevel -> TcLevel -> Bool

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

Ord TcLevel

Defined in TcType

Methods

compare :: TcLevel -> TcLevel -> Ordering

(<) :: TcLevel -> TcLevel -> Bool

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

(>) :: TcLevel -> TcLevel -> Bool

(>=) :: TcLevel -> TcLevel -> Bool

max :: TcLevel -> TcLevel -> TcLevel

min :: TcLevel -> TcLevel -> TcLevel

Outputable TcLevel

Defined in TcType

Methods

ppr :: TcLevel -> SDoc

pprPrec :: Rational -> TcLevel -> SDoc

type TypeSize = IntWithInf

orphNamesOfCoCon :: forall (br :: BranchFlag). CoAxiom br -> NameSet

orphNamesOfCo :: Coercion -> NameSet

orphNamesOfTypes :: [Type] -> NameSet

orphNamesOfType :: Type -> NameSet

hasIPPred :: PredType -> Bool

isIPPred :: PredType -> Bool

isEqPrimPred :: PredType -> Bool

isEqPred :: PredType -> Bool

isClassPred :: PredType -> Bool

isEqPredClass :: Class -> Bool

mkClassPred :: Class -> [Type] -> PredType

classifiesTypeWithValues :: Kind -> Bool

Does this classify a type allowed to have values? Responds True to things like *, #, TYPE Lifted, TYPE v, Constraint.

True of any sub-kind of OpenTypeKind

isKindLevPoly :: Kind -> Bool

Tests whether the given kind (which should look like TYPE x) is something other than a constructor tree (that is, constructors at every node). E.g. True of TYPE k, TYPE (F Int) False of TYPE 'LiftedRep

tcTypeKind :: HasDebugCallStack => Type -> Kind

nonDetCmpTypes :: [Type] -> [Type] -> Ordering

nonDetCmpType :: Type -> Type -> Ordering

eqTypes :: [Type] -> [Type] -> Bool

Type equality on lists of types, looking through type synonyms but not newtypes.

eqTypeX :: RnEnv2 -> Type -> Type -> Bool

Compare types with respect to a (presumably) non-empty RnEnv2.

isPrimitiveType :: Type -> Bool

Returns true of types that are opaque to Haskell.

isUnboxedTupleType :: Type -> Bool

isUnliftedType :: HasDebugCallStack => Type -> Bool

See Type for what an unlifted type is. Panics on levity polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of levity polymorphism.

closeOverKindsDSet :: DTyVarSet -> DTyVarSet

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministic set.

closeOverKinds :: TyVarSet -> TyVarSet

Add the kind variables free in the kinds of the tyvars in the given set. Returns a non-deterministic set.

isTauTy :: Type -> Bool

mkSpecForAllTys :: [TyVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Specified, a common case

mkInvForAllTys :: [TyVar] -> Type -> Type

Like mkTyCoInvForAllTys, but tvs should be a list of tyvar

mkTyCoInvForAllTys :: [TyCoVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Inferred, a common case

mkInvForAllTy :: TyVar -> Type -> Type

Like mkTyCoInvForAllTy, but tv should be a tyvar

mkTyCoInvForAllTy :: TyCoVar -> Type -> Type

Make a dependent forall over an Inferred variable

nextRole :: Type -> Role

tcSplitTyConApp_maybe :: HasCallStack => Type -> Maybe (TyCon, [Type])

Split a type constructor application into its type constructor and applied types. Note that this may fail in the case of a FunTy with an argument of unknown kind FunTy (e.g. FunTy (a :: k) Int. since the kind of a isn't of the form TYPE rep). Consequently, you may need to zonk your type before using this function.

If you only need the TyCon, consider using tcTyConAppTyCon_maybe.

mkTyConApp :: TyCon -> [Type] -> Type

A key function: builds a TyConApp or FunTy as appropriate to its arguments. Applies its arguments to the constructor from left to right.

tcRepSplitAppTy_maybe :: Type -> Maybe (Type, Type)

Does the AppTy split as in tcSplitAppTy_maybe, but assumes that any coreView stuff is already done. Refuses to look through (c => t)

mkAppTys :: Type -> [Type] -> Type

isTyVarTy :: Type -> Bool

getTyVar :: String -> Type -> TyVar

Attempts to obtain the type variable underlying a Type, and panics with the given message if this is not a type variable type. See also getTyVar_maybe

isRuntimeRepVar :: TyVar -> Bool

Is a tyvar of type RuntimeRep?

isUnliftedTypeKind :: Kind -> Bool

Returns True if the kind classifies unlifted types and False otherwise. Note that this returns False for levity-polymorphic kinds, which may be specialized to a kind that classifies unlifted types.

substTyVarBndr :: HasCallStack => TCvSubst -> TyVar -> (TCvSubst, TyVar)

substCoUnchecked :: TCvSubst -> Coercion -> Coercion

Substitute within a Coercion disabling sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

lookupTyVar :: TCvSubst -> TyVar -> Maybe Type

substThetaUnchecked :: TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substThetaUnchecked to substTheta and remove this function. Please don't use in new code.

substTheta :: HasCallStack => TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTysUnchecked :: TCvSubst -> [Type] -> [Type]

Substitute within several Types disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTysUnchecked to substTys and remove this function. Please don't use in new code.

substTys :: HasCallStack => TCvSubst -> [Type] -> [Type]

Substitute within several Types The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyUnchecked :: TCvSubst -> Type -> Type

Substitute within a Type disabling the sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTy :: HasCallStack => TCvSubst -> Type -> Type

Substitute within a Type The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyAddInScope :: TCvSubst -> Type -> Type

Substitute within a Type after adding the free variables of the type to the in-scope set. This is useful for the case when the free variables aren't already in the in-scope set or easily available. See also Note [The substitution invariant].

substTyWithCoVars :: [CoVar] -> [Coercion] -> Type -> Type

Substitute covars within a type

substCoWithUnchecked :: [TyVar] -> [Type] -> Coercion -> Coercion

Coercion substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

substTyWithUnchecked :: [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTyWith :: HasCallStack => [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst

zipCoEnv :: HasDebugCallStack => [CoVar] -> [Coercion] -> CvSubstEnv

zipTyEnv :: HasDebugCallStack => [TyVar] -> [Type] -> TvSubstEnv

mkTvSubstPrs :: [(TyVar, Type)] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

zipTvSubst :: HasDebugCallStack => [TyVar] -> [Type] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

unionTCvSubst :: TCvSubst -> TCvSubst -> TCvSubst

extendTvSubstAndInScope :: TCvSubst -> TyVar -> Type -> TCvSubst

extendTvSubst :: TCvSubst -> TyVar -> Type -> TCvSubst

extendTCvSubst :: TCvSubst -> TyCoVar -> Type -> TCvSubst

extendTCvInScopeSet :: TCvSubst -> VarSet -> TCvSubst

extendTCvInScopeList :: TCvSubst -> [Var] -> TCvSubst

extendTCvInScope :: TCvSubst -> Var -> TCvSubst

setTvSubstEnv :: TCvSubst -> TvSubstEnv -> TCvSubst

notElemTCvSubst :: Var -> TCvSubst -> Bool

isInScope :: Var -> TCvSubst -> Bool

getTCvInScope :: TCvSubst -> InScopeSet

getTvSubstEnv :: TCvSubst -> TvSubstEnv

mkTvSubst :: InScopeSet -> TvSubstEnv -> TCvSubst

Make a TCvSubst with specified tyvar subst and empty covar subst

mkTCvSubst :: InScopeSet -> (TvSubstEnv, CvSubstEnv) -> TCvSubst

mkEmptyTCvSubst :: InScopeSet -> TCvSubst

emptyTCvSubst :: TCvSubst

data TCvSubst

Type & coercion substitution

The following invariants must hold of a TCvSubst:

1. The in-scope set is needed only to guide the generation of fresh uniques
2. In particular, the kind of the type variables in the in-scope set is not relevant
3. The substitution is only applied ONCE! This is because in general such application will not reach a fixed point.

Constructors

TCvSubst InScopeSet TvSubstEnv CvSubstEnv

Instances

Outputable TCvSubst

Defined in TyCoSubst

Methods

ppr :: TCvSubst -> SDoc

pprPrec :: Rational -> TCvSubst -> SDoc

type TvSubstEnv = TyVarEnv Type

A substitution of Types for TyVars and Kinds for KindVars

pprTypeApp :: TyCon -> [Type] -> SDoc

pprTCvBndr :: TyCoVarBinder -> SDoc

pprTCvBndrs :: [TyCoVarBinder] -> SDoc

pprSigmaType :: Type -> SDoc

pprThetaArrowTy :: ThetaType -> SDoc

pprParendTheta :: ThetaType -> SDoc

pprTheta :: ThetaType -> SDoc

pprClassPred :: Class -> [Type] -> SDoc

pprParendKind :: Kind -> SDoc

pprParendType :: Type -> SDoc

scopedSort :: [TyCoVar] -> [TyCoVar]

Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ]

This is a deterministic sorting operation (that is, doesn't depend on Uniques).

It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in RnTypes

noFreeVarsOfType :: Type -> Bool

Returns True if this type has no free variables. Should be the same as isEmptyVarSet . tyCoVarsOfType, but faster in the non-forall case.

tyCoFVsOfTypes :: [Type] -> FV

tyCoFVsOfType :: Type -> FV

The worker for tyCoFVsOfType and tyCoFVsOfTypeList. The previous implementation used unionVarSet which is O(n+m) and can make the function quadratic. It's exported, so that it can be composed with other functions that compute free variables. See Note [FV naming conventions] in FV.

Eta-expanded because that makes it run faster (apparently) See Note [FV eta expansion] in FV for explanation.

exactTyCoVarsOfTypes :: [Type] -> TyVarSet

exactTyCoVarsOfType :: Type -> TyCoVarSet

tyCoVarsOfTypesList :: [Type] -> [TyCoVar]

Returns free variables of types, including kind variables as a deterministically ordered list. For type synonyms it does not expand the synonym.

tyCoVarsOfTypesDSet :: [Type] -> DTyCoVarSet

Returns free variables of types, including kind variables as a deterministic set. For type synonyms it does not expand the synonym.

tyCoVarsOfTypeList :: Type -> [TyCoVar]

tyCoFVsOfType that returns free variables of a type in deterministic order. For explanation of why using VarSet is not deterministic see Note [Deterministic FV] in FV.

tyCoVarsOfTypeDSet :: Type -> DTyCoVarSet

tyCoFVsOfType that returns free variables of a type in a deterministic set. For explanation of why using VarSet is not deterministic see Note [Deterministic FV] in FV.

tyCoVarsOfTypes :: [Type] -> TyCoVarSet

tyCoVarsOfType :: Type -> TyCoVarSet

mkTyConTy :: TyCon -> Type

Create the plain type constructor type which has been applied to no type arguments at all.

mkForAllTys :: [TyCoVarBinder] -> Type -> Type

Wraps foralls over the type using the provided TyCoVars from left to right

mkInvisFunTys :: [Type] -> Type -> Type

Make nested arrow types

mkInvisFunTy :: Type -> Type -> Type infixr 3

mkVisFunTy :: Type -> Type -> Type infixr 3

mkTyCoVarTys :: [TyCoVar] -> [Type]

mkTyCoVarTy :: TyCoVar -> Type

mkTyVarTys :: [TyVar] -> [Type]

mkTyVarTy :: TyVar -> Type

isVisibleBinder :: TyCoBinder -> Bool

Does this binder bind a visible argument?

isInvisibleBinder :: TyCoBinder -> Bool

Does this binder bind an invisible argument?

tyThingCategory :: TyThing -> String

pprTyThingCategory :: TyThing -> SDoc

type KnotTied ty = ty

A type labeled KnotTied might have knot-tied tycons in it. See Note [Type checking recursive type and class declarations] in TcTyClsDecls

isPredTy :: HasDebugCallStack => Type -> Bool

mkAppTy :: Type -> Type -> Type

Applies a type to another, as in e.g. k a

eqType :: Type -> Type -> Bool

Type equality on source types. Does not look through newtypes or PredTypes, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in TyCoRep.

coreView :: Type -> Maybe Type

This function Strips off the top layer only of a type synonym application (if any) its underlying representation type. Returns Nothing if there is nothing to look through. This function considers Constraint to be a synonym of TYPE LiftedRep.

By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doing

tcView :: Type -> Maybe Type

Gives the typechecker view of a type. This unwraps synonyms but leaves Constraint alone. c.f. coreView, which turns Constraint into TYPE LiftedRep. Returns Nothing if no unwrapping happens. See also Note [coreView vs tcView]

isLiftedTypeKind :: Kind -> Bool

This version considers Constraint to be the same as *. Returns True if the argument is equivalent to Type/Constraint and False otherwise. See Note [Kind Constraint and kind Type]

isTauTyCon :: TyCon -> Bool

type TcTyVar = Var

Type variable that might be a metavariable

data ForallVisFlag

Is a forall invisible (e.g., forall a b. {...}, with a dot) or visible (e.g., forall a b -> {...}, with an arrow)?

Constructors

ForallVis

A visible forall (with an arrow)

ForallInvis

An invisible forall (with a dot)

Instances

Eq ForallVisFlag

Defined in Var

Methods

(==) :: ForallVisFlag -> ForallVisFlag -> Bool

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

Data ForallVisFlag

Defined in Var

Methods

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

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

toConstr :: ForallVisFlag -> Constr

dataTypeOf :: ForallVisFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ForallVisFlag

Defined in Var

Methods

compare :: ForallVisFlag -> ForallVisFlag -> Ordering

(<) :: ForallVisFlag -> ForallVisFlag -> Bool

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

(>) :: ForallVisFlag -> ForallVisFlag -> Bool

(>=) :: ForallVisFlag -> ForallVisFlag -> Bool

max :: ForallVisFlag -> ForallVisFlag -> ForallVisFlag

min :: ForallVisFlag -> ForallVisFlag -> ForallVisFlag

Outputable ForallVisFlag

Defined in Var

Methods

ppr :: ForallVisFlag -> SDoc

pprPrec :: Rational -> ForallVisFlag -> SDoc

liftedTypeKind :: Kind

constraintKind :: Kind

pprType :: Type -> SDoc

pprKind :: Kind -> SDoc

mkForAllTy :: TyCoVar -> ArgFlag -> Type -> Type

Like mkTyCoForAllTy, but does not check the occurrence of the binder See Note [Unused coercion variable in ForAllTy]

data Type

Instances

Data Type

Defined in TyCoRep

Methods

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

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

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

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

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

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

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

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

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

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

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

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

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

NFData Type

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Type -> ()

Outputable Type

Defined in TyCoRep

Methods

ppr :: Type -> SDoc

pprPrec :: Rational -> Type -> SDoc

Eq (DeBruijn Type)

Defined in CoreMap

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

ToHie (TScoped Type)

Defined in Compat.HieAst

Methods

toHie :: TScoped Type -> HieM [HieAST Type]

data TyCoBinder

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

Instances

Data TyCoBinder

Defined in TyCoRep

Methods

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

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

toConstr :: TyCoBinder -> Constr

dataTypeOf :: TyCoBinder -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable TyCoBinder

Defined in TyCoRep

Methods

ppr :: TyCoBinder -> SDoc

pprPrec :: Rational -> TyCoBinder -> SDoc

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 Kind = Type

The key type representing kinds in the compiler.

type ThetaType = [PredType]

A collection of PredTypes

data ArgFlag

Argument Flag

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

Constructors

Inferred

Specified

Required

Instances

Eq ArgFlag

Defined in Var

Methods

(==) :: ArgFlag -> ArgFlag -> Bool

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

Data ArgFlag

Defined in Var

Methods

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

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

toConstr :: ArgFlag -> Constr

dataTypeOf :: ArgFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ArgFlag

Defined in Var

Methods

compare :: ArgFlag -> ArgFlag -> Ordering

(<) :: ArgFlag -> ArgFlag -> Bool

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

(>) :: ArgFlag -> ArgFlag -> Bool

(>=) :: ArgFlag -> ArgFlag -> Bool

max :: ArgFlag -> ArgFlag -> ArgFlag

min :: ArgFlag -> ArgFlag -> ArgFlag

Binary ArgFlag

Defined in Var

Methods

put_ :: BinHandle -> ArgFlag -> IO ()

put :: BinHandle -> ArgFlag -> IO (Bin ArgFlag)

get :: BinHandle -> IO ArgFlag

Outputable ArgFlag

Defined in Var

Methods

ppr :: ArgFlag -> SDoc

pprPrec :: Rational -> ArgFlag -> SDoc

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

pprPrec :: Rational -> VarBndr tv ArgFlag -> SDoc

data AnonArgFlag

The non-dependent version of ArgFlag.

Constructors

VisArg

Used for (->): an ordinary non-dependent arrow. The argument is visible in source code.

InvisArg

Used for (=>): a non-dependent predicate arrow. The argument is invisible in source code.

Instances

Eq AnonArgFlag

Defined in Var

Methods

(==) :: AnonArgFlag -> AnonArgFlag -> Bool

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

Data AnonArgFlag

Defined in Var

Methods

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

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

toConstr :: AnonArgFlag -> Constr

dataTypeOf :: AnonArgFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord AnonArgFlag

Defined in Var

Methods

compare :: AnonArgFlag -> AnonArgFlag -> Ordering

(<) :: AnonArgFlag -> AnonArgFlag -> Bool

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

(>) :: AnonArgFlag -> AnonArgFlag -> Bool

(>=) :: AnonArgFlag -> AnonArgFlag -> Bool

max :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

min :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

Binary AnonArgFlag

Defined in Var

Methods

put_ :: BinHandle -> AnonArgFlag -> IO ()

put :: BinHandle -> AnonArgFlag -> IO (Bin AnonArgFlag)

get :: BinHandle -> IO AnonArgFlag

Outputable AnonArgFlag

Defined in Var

Methods

ppr :: AnonArgFlag -> SDoc

pprPrec :: Rational -> AnonArgFlag -> SDoc

pprTcTyVarDetails :: TcTyVarDetails -> SDoc

vanillaSkolemTv :: TcTyVarDetails

data MetaDetails

Constructors

Flexi

Indirect TcType

Instances

Outputable MetaDetails

Defined in TcType

Methods

ppr :: MetaDetails -> SDoc

pprPrec :: Rational -> MetaDetails -> SDoc

data TcTyVarDetails

Constructors

SkolemTv TcLevel Bool

RuntimeUnk

MetaTv

Fields

• mtv_info :: MetaInfo
• mtv_ref :: IORef MetaDetails
• mtv_tclvl :: TcLevel

Instances

Outputable TcTyVarDetails

Defined in TcType

Methods

ppr :: TcTyVarDetails -> SDoc

pprPrec :: Rational -> TcTyVarDetails -> SDoc

module TcRnTypes

module TcRnDriver

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.

foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

Monadic fold over the elements of a structure, associating to the left, i.e. from left to right.

getCCIndexM :: ContainsCostCentreState gbl => FastString -> TcRnIf gbl lcl CostCentreIndex

Get the next cost centre index associated with a given name.

setImplicitEnvM :: TypeEnv -> IfL a -> IfL a

forkM :: SDoc -> IfL a -> IfL a

forkM_maybe :: SDoc -> IfL a -> IfL (Maybe a)

failIfM :: MsgDoc -> IfL a

getIfModule :: IfL Module

initIfaceLclWithSubst :: Module -> SDoc -> Bool -> NameShape -> IfL a -> IfM lcl a

Initialize interface typechecking, but with a NameShape to apply when typechecking top-level OccNames (see lookupIfaceTop)

initIfaceLcl :: Module -> SDoc -> Bool -> IfL a -> IfM lcl a

initIfaceCheck :: SDoc -> HscEnv -> IfG a -> IO a

initIfaceLoad :: HscEnv -> IfG a -> IO a

initIfaceTcRn :: IfG a -> TcRn a

Run an IfG (top-level interface monad) computation inside an existing TcRn (typecheck-renaming monad) computation by initializing an IfGblEnv based on TcGblEnv.

mkIfLclEnv :: Module -> SDoc -> Bool -> IfLclEnv

setLocalRdrEnv :: LocalRdrEnv -> RnM a -> RnM a

getLocalRdrEnv :: RnM LocalRdrEnv

fixSafeInstances :: SafeHaskellMode -> [ClsInst] -> [ClsInst]

Switch instances to safe instances if we're in Safe mode.

finalSafeMode :: DynFlags -> TcGblEnv -> IO SafeHaskellMode

Figure out the final correct safe haskell mode

recordUnsafeInfer :: WarningMessages -> TcM ()

Mark that safe inference has failed See Note [Safe Haskell Overlapping Instances Implementation] although this is used for more than just that failure case.

addModFinalizersWithLclEnv :: ThModFinalizers -> TcM ()

Adds the given modFinalizers to the global environment and set them to use the current local environment.

setStage :: ThStage -> TcM a -> TcRn a

getStageAndBindLevel :: Name -> TcRn (Maybe (TopLevelFlag, ThLevel, ThStage))

getStage :: TcM ThStage

keepAlive :: Name -> TcRn ()

getTopLevelSpliceLocs :: TcM (Set RealSrcSpan)

recordTopLevelSpliceLoc :: SrcSpan -> TcM ()

When generating an out-of-scope error message for a variable matching a binding in a later inter-splice group, the typechecker uses the splice locations to provide details in the message about the scope of that binding.

recordThSpliceUse :: TcM ()

recordThUse :: TcM ()

emitNamedWildCardHoleConstraints :: [(Name, TcTyVar)] -> TcM ()

emitAnonWildCardHoleConstraint :: TcTyVar -> TcM ()

traceTcConstraints :: String -> TcM ()

setLclTypeEnv :: TcLclEnv -> TcM a -> TcM a

getLclTypeEnv :: TcM TcTypeEnv

isTouchableTcM :: TcTyVar -> TcM Bool

setTcLevel :: TcLevel -> TcM a -> TcM a

getTcLevel :: TcM TcLevel

pushTcLevelsM :: Int -> TcM a -> TcM (a, TcLevel)

pushTcLevelM :: TcM a -> TcM (TcLevel, a)

pushTcLevelM_ :: TcM a -> TcM a

pushLevelAndCaptureConstraints :: TcM a -> TcM (TcLevel, WantedConstraints, a)

The name says it all. The returned TcLevel is the *inner* TcLevel.

discardConstraints :: TcM a -> TcM a

Throw out any constraints emitted by the thing_inside

emitInsoluble :: Ct -> TcM ()

emitImplications :: Bag Implication -> TcM ()

emitImplication :: Implication -> TcM ()

emitSimples :: Cts -> TcM ()

emitSimple :: Ct -> TcM ()

emitConstraints :: WantedConstraints -> TcM ()

emitStaticConstraints :: WantedConstraints -> TcM ()

setConstraintVar :: TcRef WantedConstraints -> TcM a -> TcM a

getConstraintVar :: TcM (TcRef WantedConstraints)

chooseUniqueOccTc :: (OccSet -> OccName) -> TcM OccName

addTcEvBind :: EvBindsVar -> EvBind -> TcM ()

setTcEvBindsMap :: EvBindsVar -> EvBindMap -> TcM ()

getTcEvBindsMap :: EvBindsVar -> TcM EvBindMap

getTcEvTyCoVars :: EvBindsVar -> TcM TyCoVarSet

cloneEvBindsVar :: EvBindsVar -> TcM EvBindsVar

newNoTcEvBinds :: TcM EvBindsVar

Creates an EvBindsVar incapable of holding any bindings. It still tracks covar usages (see comments on ebv_tcvs in TcEvidence), thus must be made monadically

newTcEvBinds :: TcM EvBindsVar

addTopEvBinds :: Bag EvBind -> TcM a -> TcM a

debugTc :: TcM () -> TcM ()

mkErrInfo :: TidyEnv -> [ErrCtxt] -> TcM SDoc

add_warn :: WarnReason -> MsgDoc -> MsgDoc -> TcRn ()

Display a warning, with an optional flag, for the current source location.

addWarnAt :: WarnReason -> SrcSpan -> MsgDoc -> TcRn ()

Display a warning for a given source location.

addWarn :: WarnReason -> MsgDoc -> TcRn ()

Display a warning for the current source location.

addWarnTcM :: WarnReason -> (TidyEnv, MsgDoc) -> TcM ()

Display a warning in a given context.

addWarnTc :: WarnReason -> MsgDoc -> TcM ()

Display a warning in the current context.

warnTcM :: WarnReason -> Bool -> (TidyEnv, MsgDoc) -> TcM ()

Display a warning if a condition is met.

warnTc :: WarnReason -> Bool -> MsgDoc -> TcM ()

Display a warning if a condition is met.

warnIf :: Bool -> MsgDoc -> TcRn ()

Display a warning if a condition is met.

warnIfFlag :: WarningFlag -> Bool -> MsgDoc -> TcRn ()

Display a warning if a condition is met, and the warning is enabled

failIfTcM :: Bool -> (TidyEnv, MsgDoc) -> TcM ()

failIfTc :: Bool -> MsgDoc -> TcM ()

checkTcM :: Bool -> (TidyEnv, MsgDoc) -> TcM ()

checkTc :: Bool -> MsgDoc -> TcM ()

failWithTcM :: (TidyEnv, MsgDoc) -> TcM a

failWithTc :: MsgDoc -> TcM a

mkErrTc :: MsgDoc -> TcM ErrMsg

mkErrTcM :: (TidyEnv, MsgDoc) -> TcM ErrMsg

addErrTcM :: (TidyEnv, MsgDoc) -> TcM ()

addErrsTc :: [MsgDoc] -> TcM ()

addErrTc :: MsgDoc -> TcM ()

tryTcDiscardingErrs :: TcM r -> TcM r -> TcM r

discardErrs :: TcRn a -> TcRn a

tryTc :: TcRn a -> TcRn (Maybe a, Messages)

foldAndRecoverM :: (b -> a -> TcRn b) -> b -> [a] -> TcRn b

The accumulator is not updated if the action fails

mapAndReportM :: (a -> TcRn b) -> [a] -> TcRn [b]

Apply the function to all elements on the input list If all succeed, return the list of results Othewise fail, propagating all errors

mapAndRecoverM :: (a -> TcRn b) -> [a] -> TcRn [b]

Drop elements of the input that fail, so the result list can be shorter than the argument list

recoverM :: TcRn r -> TcRn r -> TcRn r

attemptM :: TcRn r -> TcRn (Maybe r)

captureConstraints :: TcM a -> TcM (a, WantedConstraints)

tryCaptureConstraints :: TcM a -> TcM (Maybe a, WantedConstraints)

askNoErrs :: TcRn a -> TcRn (a, Bool)

setCtLocM :: CtLoc -> TcM a -> TcM a

getCtLocM :: CtOrigin -> Maybe TypeOrKind -> TcM CtLoc

popErrCtxt :: TcM a -> TcM a

updCtxt :: ([ErrCtxt] -> [ErrCtxt]) -> TcM a -> TcM a

addLandmarkErrCtxtM :: (TidyEnv -> TcM (TidyEnv, MsgDoc)) -> TcM a -> TcM a

Variant of addLandmarkErrCtxt that allows for monadic operations and tidying.

addLandmarkErrCtxt :: MsgDoc -> TcM a -> TcM a

Add a fixed landmark message to the error context. A landmark message is always sure to be reported, even if there is a lot of context. It also doesn't count toward the maximum number of contexts reported.

addErrCtxtM :: (TidyEnv -> TcM (TidyEnv, MsgDoc)) -> TcM a -> TcM a

Add a message to the error context. This message may do tidying.

addErrCtxt :: MsgDoc -> TcM a -> TcM a

Add a fixed message to the error context. This message should not do any tidying.

setErrCtxt :: [ErrCtxt] -> TcM a -> TcM a

getErrCtxt :: TcM [ErrCtxt]

failIfErrsM :: TcRn ()

ifErrsM :: TcRn r -> TcRn r -> TcRn r

whenNoErrs :: TcM () -> TcM ()

checkNoErrs :: TcM r -> TcM r

reportWarning :: WarnReason -> ErrMsg -> TcRn ()

reportError :: ErrMsg -> TcRn ()

reportErrors :: [ErrMsg] -> TcM ()

addLongErrAt :: SrcSpan -> MsgDoc -> MsgDoc -> TcRn ()

mkErrDocAt :: SrcSpan -> ErrDoc -> TcRn ErrMsg

mkLongErrAt :: SrcSpan -> MsgDoc -> MsgDoc -> TcRn ErrMsg

discardWarnings :: TcRn a -> TcRn a

addMessages :: Messages -> TcRn ()

checkErr :: Bool -> MsgDoc -> TcRn ()

addErrs :: [(SrcSpan, MsgDoc)] -> TcRn ()

addErrAt :: SrcSpan -> MsgDoc -> TcRn ()

failAt :: SrcSpan -> MsgDoc -> TcRn a

failWith :: MsgDoc -> TcRn a

addErr :: MsgDoc -> TcRn ()

setErrsVar :: TcRef Messages -> TcRn a -> TcRn a

getErrsVar :: TcRn (TcRef Messages)

wrapLocM_ :: HasSrcSpan a => (SrcSpanLess a -> TcM ()) -> a -> TcM ()

wrapLocSndM :: (HasSrcSpan a, HasSrcSpan c) => (SrcSpanLess a -> TcM (b, SrcSpanLess c)) -> a -> TcM (b, c)

wrapLocFstM :: (HasSrcSpan a, HasSrcSpan b) => (SrcSpanLess a -> TcM (SrcSpanLess b, c)) -> a -> TcM (b, c)

wrapLocM :: (HasSrcSpan a, HasSrcSpan b) => (SrcSpanLess a -> TcM (SrcSpanLess b)) -> a -> TcM b

addLocM :: HasSrcSpan a => (SrcSpanLess a -> TcM b) -> a -> TcM b

setSrcSpan :: SrcSpan -> TcRn a -> TcRn a

getSrcSpanM :: TcRn SrcSpan

addDependentFiles :: [FilePath] -> TcRn ()

getDeclaredDefaultTys :: TcRn (Maybe [Type])

getRecFieldEnv :: TcRn RecFieldEnv

extendFixityEnv :: [(Name, FixItem)] -> RnM a -> RnM a

getFixityEnv :: TcRn FixityEnv

getImports :: TcRn ImportAvails

getRdrEnvs :: TcRn (GlobalRdrEnv, LocalRdrEnv)

getGlobalRdrEnv :: TcRn GlobalRdrEnv

tcSelfBootInfo :: TcRn SelfBootInfo

tcIsHsig :: TcRn Bool

tcIsHsBootOrSig :: TcRn Bool

getInteractivePrintName :: TcRn Name

getGHCiMonad :: TcRn Name

getIsGHCi :: TcRn Bool

traceOptIf :: DumpFlag -> SDoc -> TcRnIf m n ()

traceHiDiffs :: SDoc -> TcRnIf m n ()

traceIf :: SDoc -> TcRnIf m n ()

printForUserTcRn :: SDoc -> TcRn ()

Like logInfoTcRn, but for user consumption

getPrintUnqualified :: DynFlags -> TcRn PrintUnqualified

traceTcRnWithStyle :: PprStyle -> DynFlags -> DumpFlag -> SDoc -> TcRn ()

Unconditionally dump some trace output

The DumpFlag is used only to set the output filename for --dump-to-file, not to decide whether or not to output That part is done by the caller

traceTcRnForUser :: DumpFlag -> SDoc -> TcRn ()

A wrapper around traceTcRnWithStyle which uses PprUser style.

traceTcRn :: DumpFlag -> SDoc -> TcRn ()

A wrapper around traceTcRnWithStyle which uses PprDump style.

traceOptTcRn :: DumpFlag -> SDoc -> TcRn ()

Output a doc if the given DumpFlag is set.

By default this logs to stdout However, if the `-ddump-to-file` flag is set, then this will dump output to a file

Just a wrapper for dumpSDoc

traceRn :: String -> SDoc -> TcRn ()

traceTc :: String -> SDoc -> TcRn ()

updTcRef :: TcRef a -> (a -> a) -> TcRnIf gbl lcl ()

writeTcRef :: TcRef a -> a -> TcRnIf gbl lcl ()

readTcRef :: TcRef a -> TcRnIf gbl lcl a

newTcRef :: a -> TcRnIf gbl lcl (TcRef a)

newSysLocalIds :: FastString -> [TcType] -> TcRnIf gbl lcl [TcId]

newSysLocalId :: FastString -> TcType -> TcRnIf gbl lcl TcId

newSysName :: OccName -> TcRnIf gbl lcl Name

newNameAt :: OccName -> SrcSpan -> TcM Name

newName :: OccName -> TcM Name

cloneLocalName :: Name -> TcM Name

newUniqueSupply :: TcRnIf gbl lcl UniqSupply

newUnique :: TcRnIf gbl lcl Unique

escapeArrowScope :: TcM a -> TcM a

newArrowScope :: TcM a -> TcM a

withException :: TcRnIf gbl lcl (MaybeErr MsgDoc a) -> TcRnIf gbl lcl a

A convenient wrapper for taking a MaybeErr MsgDoc a and throwing an exception if it is an error.

getEpsAndHpt :: TcRnIf gbl lcl (ExternalPackageState, HomePackageTable)

getHpt :: TcRnIf gbl lcl HomePackageTable

updateEps_ :: (ExternalPackageState -> ExternalPackageState) -> TcRnIf gbl lcl ()

Update the external package state.

This is an atomic operation and forces evaluation of the modified EPS in order to avoid space leaks.

updateEps :: (ExternalPackageState -> (ExternalPackageState, a)) -> TcRnIf gbl lcl a

Update the external package state. Returns the second result of the modifier function.

This is an atomic operation and forces evaluation of the modified EPS in order to avoid space leaks.

getEps :: TcRnIf gbl lcl ExternalPackageState

getEpsVar :: TcRnIf gbl lcl (TcRef ExternalPackageState)

withDoDynamicToo :: TcRnIf gbl lcl a -> TcRnIf gbl lcl a

getGhcMode :: TcRnIf gbl lcl GhcMode

unlessXOptM :: Extension -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenXOptM :: Extension -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenWOptM :: WarningFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenGOptM :: GeneralFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenDOptM :: DumpFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

Do it flag is true

unsetWOptM :: WarningFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetGOptM :: GeneralFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetXOptM :: Extension -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

setXOptM :: Extension -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

woptM :: WarningFlag -> TcRnIf gbl lcl Bool

goptM :: GeneralFlag -> TcRnIf gbl lcl Bool

doptM :: DumpFlag -> TcRnIf gbl lcl Bool

xoptM :: Extension -> TcRnIf gbl lcl Bool

setEnvs :: (gbl', lcl') -> TcRnIf gbl' lcl' a -> TcRnIf gbl lcl a

getEnvs :: TcRnIf gbl lcl (gbl, lcl)

setLclEnv :: lcl' -> TcRnIf gbl lcl' a -> TcRnIf gbl lcl a

updLclEnv :: (lcl -> lcl) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

getLclEnv :: TcRnIf gbl lcl lcl

setGblEnv :: gbl -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

updGblEnv :: (gbl -> gbl) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

getGblEnv :: TcRnIf gbl lcl gbl

updTopEnv :: (HscEnv -> HscEnv) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

getTopEnv :: TcRnIf gbl lcl HscEnv

discardResult :: TcM a -> TcM ()

initTcRnIf

Arguments

:: Char

Mask for unique supply

-> HscEnv

-> gbl

-> lcl

-> TcRnIf gbl lcl a

-> IO a

initTcInteractive :: HscEnv -> TcM a -> IO (Messages, Maybe a)

initTcWithGbl :: HscEnv -> TcGblEnv -> RealSrcSpan -> TcM r -> IO (Messages, Maybe r)

Run a TcM action in the context of an existing GblEnv.

initTc :: HscEnv -> HscSource -> Bool -> Module -> RealSrcSpan -> TcM r -> IO (Messages, Maybe r)

Setup the initial typechecking environment

class ContainsCostCentreState e where

Environments which track CostCentreState

Methods

extractCostCentreState :: e -> TcRef CostCentreState

Instances

ContainsCostCentreState DsGblEnv

Defined in TcRnMonad

Methods

extractCostCentreState :: DsGblEnv -> TcRef CostCentreState

ContainsCostCentreState TcGblEnv

Defined in TcRnMonad

Methods

extractCostCentreState :: TcGblEnv -> TcRef CostCentreState

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

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

emptyRoleAnnotEnv :: RoleAnnotEnv

mkRoleAnnotEnv :: [LRoleAnnotDecl GhcRn] -> RoleAnnotEnv

getEvBindsTcPluginM :: TcPluginM EvBindsVar

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

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.

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

hasCompleteSig :: TcSigFun -> Name -> Bool

No signature or a partial signature

isPartialSig :: TcIdSigInst -> Bool

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.

emptyImportAvails :: ImportAvails

modDepsElts :: ModuleNameEnv (ModuleName, IsBootInterface) -> [(ModuleName, IsBootInterface)]

mkModDeps :: [(ModuleName, IsBootInterface)] -> ModuleNameEnv (ModuleName, IsBootInterface)

pprPECategory :: PromotionErr -> SDoc

pprTcTyThingCategory :: TcTyThing -> SDoc

thLevel :: ThStage -> ThLevel

outerLevel :: ThLevel

impLevel :: ThLevel

topSpliceStage :: ThStage

topAnnStage :: ThStage

topStage :: ThStage

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

pushErrCtxtSameOrigin :: ErrCtxt -> CtLoc -> CtLoc

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

tcVisibleOrphanMods :: TcGblEnv -> ModuleSet

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

type TcRnIf a b = IOEnv (Env a b)

type TcRn = TcRnIf TcGblEnv TcLclEnv

type IfM lcl = TcRnIf IfGblEnv lcl

type IfG = IfM ()

type IfL = IfM IfLclEnv

type DsM = TcRnIf DsGblEnv DsLclEnv

type RnM = TcRn

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

type TcM = TcRn

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

data Env gbl lcl

Constructors

Env

Fields

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

Instances

ContainsDynFlags (Env gbl lcl)

Defined in TcRnTypes

Methods

extractDynFlags :: Env gbl lcl -> DynFlags

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in TcRnTypes

Methods

extractModule :: Env gbl lcl -> Module

data IfGblEnv

Constructors

IfGblEnv

Fields

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

data IfLclEnv

Constructors

IfLclEnv

Fields

• if_mod :: Module
• if_boot :: Bool
• if_loc :: SDoc
• if_nsubst :: Maybe NameShape
• if_implicits_env :: Maybe TypeEnv
• if_tv_env :: FastStringEnv TyVar
• if_id_env :: FastStringEnv Id

data DsGblEnv

Constructors

DsGblEnv

Fields

• ds_mod :: Module
• ds_fam_inst_env :: FamInstEnv
• ds_unqual :: PrintUnqualified
• ds_msgs :: IORef Messages
• ds_if_env :: (IfGblEnv, IfLclEnv)
• ds_complete_matches :: CompleteMatchMap
• ds_cc_st :: IORef CostCentreState

Instances

ContainsCostCentreState DsGblEnv

Defined in TcRnMonad

Methods

extractCostCentreState :: DsGblEnv -> TcRef CostCentreState

ContainsModule DsGblEnv

Defined in TcRnTypes

Methods

extractModule :: DsGblEnv -> Module

data DsLclEnv

Constructors

DsLclEnv

Fields

• dsl_meta :: DsMetaEnv
• dsl_loc :: RealSrcSpan
• dsl_delta :: Delta

type DsMetaEnv = NameEnv DsMetaVal

data DsMetaVal

Constructors

DsBound Id

DsSplice (HsExpr GhcTc)

data FrontendResult

FrontendResult describes the result of running the frontend of a Haskell module. Usually, you'll get a FrontendTypecheck, since running the frontend involves typechecking a program, but for an hs-boot merge you'll just get a ModIface, since no actual typechecking occurred.

This data type really should be in HscTypes, but it needs to have a TcGblEnv which is only defined here.

Constructors

FrontendTypecheck TcGblEnv

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 HscTypes

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

• 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 HscMain) - To create the Dependencies field in interface (mkDependencies)

• tcg_dus :: DefUses
• tcg_used_gres :: TcRef [GlobalRdrElt]
• tcg_keep :: TcRef NameSet
• tcg_th_used :: TcRef Bool

  True = Template Haskell syntax used.

  We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.

• tcg_th_splice_used :: TcRef Bool

  True = A Template Haskell splice was used.

  Splices disable recompilation avoidance (see #481)

• tcg_th_top_level_locs :: TcRef (Set RealSrcSpan)

  Locations of the top-level splices; used for providing details on scope in error messages for out-of-scope variables

• 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 [(Located (IE 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_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_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 :: [CompleteMatch]

  Tracking indices for cost centre annotations

• tcg_cc_st :: TcRef CostCentreState

Instances

ContainsCostCentreState TcGblEnv

Defined in TcRnMonad

Methods

extractCostCentreState :: TcGblEnv -> TcRef CostCentreState

ContainsModule TcGblEnv

Defined in TcRnTypes

Methods

extractModule :: TcGblEnv -> Module

type RecFieldEnv = NameEnv [FieldLabel]

data SelfBootInfo

Constructors

NoSelfBoot

SelfBoot

Fields

• sb_mds :: ModDetails
• sb_tcs :: NameSet

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

type TcTypeEnv = NameEnv TcTyThing

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 TcId = Id

type TcIdSet = IdSet

type TcBinderStack = [TcBinder]

data TcBinder

Constructors

TcIdBndr TcId TopLevelFlag

TcIdBndr_ExpType Name ExpType TopLevelFlag

TcTvBndr Name TyVar

Instances

HasOccName TcBinder

Defined in TcRnTypes

Methods

occName :: TcBinder -> OccName

Outputable TcBinder

Defined in TcRnTypes

Methods

ppr :: TcBinder -> SDoc

pprPrec :: Rational -> TcBinder -> SDoc

data SpliceType

Constructors

Typed

Untyped

data ThStage

Constructors

Splice SpliceType

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

Comp

Brack ThStage PendingStuff

Instances

Outputable ThStage

Defined in TcRnTypes

Methods

ppr :: ThStage -> SDoc

pprPrec :: Rational -> ThStage -> SDoc

data PendingStuff

Constructors

RnPendingUntyped (TcRef [PendingRnSplice])

RnPendingTyped

TcPending (TcRef [PendingTcSplice]) (TcRef WantedConstraints)

type ThLevel = Int

data ArrowCtxt

Constructors

NoArrowCtxt

ArrowCtxt LocalRdrEnv (TcRef WantedConstraints)

data TcTyThing

A typecheckable thing available in a local context. Could be AGlobal TyThing, but also lexically scoped variables, etc. See TcEnv 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 TcRnTypes

Methods

ppr :: TcTyThing -> SDoc

pprPrec :: Rational -> TcTyThing -> SDoc

data PromotionErr

Constructors

TyConPE

ClassPE

FamDataConPE

ConstrainedDataConPE PredType

PatSynPE

RecDataConPE

NoDataKindsTC

NoDataKindsDC

Instances

Outputable PromotionErr

Defined in TcRnTypes

Methods

ppr :: PromotionErr -> SDoc

pprPrec :: Rational -> PromotionErr -> SDoc

data IdBindingInfo

IdBindingInfo describes how an Id is bound.

It is used for the following purposes: a) for static forms in TcExpr.checkClosedInStaticForm and b) to figure out when a nested binding can be generalised, in TcBinds.decideGeneralisationPlan.

Constructors

NotLetBound

ClosedLet

NonClosedLet RhsNames ClosedTypeId

Instances

Outputable IdBindingInfo

Defined in TcRnTypes

Methods

ppr :: IdBindingInfo -> SDoc

pprPrec :: Rational -> IdBindingInfo -> SDoc

data IsGroupClosed

IsGroupClosed describes a group of mutually-recursive bindings

Constructors

IsGroupClosed (NameEnv RhsNames) ClosedTypeId

type RhsNames = NameSet

type ClosedTypeId = Bool

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 HscTypes 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 (ModuleName, IsBootInterface)

  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 InstalledUnitId

  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 InstalledUnitId

  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 [RnNames . Tracking Trust Transitively]

• 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 [RnNames . Trust Own Package]

• imp_orphs :: [Module]

  Orphan modules below us in the import tree (and maybe including us for imported modules)

• imp_finsts :: [Module]

  Family instance modules below us in the import tree (and maybe including us for imported modules)

data WhereFrom

Constructors

ImportByUser IsBootInterface

ImportBySystem

ImportByPlugin

Instances

Outputable WhereFrom

Defined in TcRnTypes

Methods

ppr :: WhereFrom -> SDoc

pprPrec :: Rational -> WhereFrom -> SDoc

type TcSigFun = Name -> Maybe TcSigInfo

data TcSigInfo

Constructors

TcIdSig TcIdSigInfo

TcPatSynSig TcPatSynInfo

Instances

Outputable TcSigInfo

Defined in TcRnTypes

Methods

ppr :: TcSigInfo -> SDoc

pprPrec :: Rational -> TcSigInfo -> 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 TcRnTypes

Methods

ppr :: TcIdSigInfo -> SDoc

pprPrec :: Rational -> TcIdSigInfo -> SDoc

data TcIdSigInst

Constructors

TISI

Fields

• sig_inst_sig :: TcIdSigInfo
• sig_inst_skols :: [(Name, TcTyVar)]
• sig_inst_theta :: TcThetaType
• sig_inst_tau :: TcSigmaType
• sig_inst_wcs :: [(Name, TcTyVar)]
• sig_inst_wcx :: Maybe TcType

Instances

Outputable TcIdSigInst

Defined in TcRnTypes

Methods

ppr :: TcIdSigInst -> SDoc

pprPrec :: Rational -> TcIdSigInst -> SDoc

data TcPatSynInfo

Constructors

TPSI

Fields

• patsig_name :: Name
• patsig_implicit_bndrs :: [TyVarBinder]
• patsig_univ_bndrs :: [TyVar]
• patsig_req :: TcThetaType
• patsig_ex_bndrs :: [TyVar]
• patsig_prov :: TcThetaType
• patsig_body_ty :: TcSigmaType

Instances

Outputable TcPatSynInfo

Defined in TcRnTypes

Methods

ppr :: TcPatSynInfo -> SDoc

pprPrec :: Rational -> TcPatSynInfo -> SDoc

type TcPluginSolver = [Ct] -> [Ct] -> [Ct] -> TcPluginM TcPluginResult

data TcPluginM a

Instances

Monad TcPluginM

Defined in TcRnTypes

Methods

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

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

return :: a -> TcPluginM a

Functor TcPluginM

Defined in TcRnTypes

Methods

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

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

MonadFail TcPluginM

Defined in TcRnTypes

Methods

fail :: String -> TcPluginM a

Applicative TcPluginM

Defined in TcRnTypes

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

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

type RoleAnnotEnv = NameEnv (LRoleAnnotDecl GhcRn)

holeOcc :: Hole -> OccName

data Hole

An expression or type hole

Constructors

ExprHole UnboundVar

Either an out-of-scope variable or a "true" hole in an expression (TypedHoles)

TypeHole OccName

A hole in a type (PartialTypeSignatures)

Instances

Outputable Hole

Defined in Constraint

Methods

ppr :: Hole -> SDoc

pprPrec :: Rational -> Hole -> SDoc

extendCompleteMatchMap :: CompleteMatchMap -> [CompleteMatch] -> CompleteMatchMap

mkCompleteMatchMap :: [CompleteMatch] -> CompleteMatchMap

data CompleteMatch

A list of conlikes which represents a complete pattern match. These arise from COMPLETE signatures.

Constructors

CompleteMatch

Fields

• completeMatchConLikes :: [Name]

  The ConLikes that form a covering family (e.g. Nothing, Just)

• completeMatchTyCon :: Name

  The TyCon that they cover (e.g. Maybe)

Instances

Outputable CompleteMatch

Defined in HscTypes

Methods

ppr :: CompleteMatch -> SDoc

pprPrec :: Rational -> CompleteMatch -> SDoc

type CompleteMatchMap = UniqFM [CompleteMatch]

A map keyed by the completeMatchTyCon.

setLclEnvTcLevel :: TcLclEnv -> TcLevel -> TcLclEnv

getLclEnvTcLevel :: TcLclEnv -> TcLevel

setLclEnvLoc :: TcLclEnv -> RealSrcSpan -> TcLclEnv

getLclEnvLoc :: TcLclEnv -> RealSrcSpan

data TcLclEnv

Constructors

TcLclEnv

Fields

• tcl_loc :: RealSrcSpan
• tcl_ctxt :: [ErrCtxt]
• tcl_tclvl :: TcLevel
• tcl_th_ctxt :: ThStage
• tcl_th_bndrs :: ThBindEnv
• tcl_arrow_ctxt :: ArrowCtxt
• tcl_rdr :: LocalRdrEnv
• tcl_env :: TcTypeEnv
• tcl_bndrs :: TcBinderStack
• tcl_lie :: TcRef WantedConstraints
• tcl_errs :: TcRef Messages

updEnv :: (env -> env') -> IOEnv env' a -> IOEnv env a

Perform a computation with an altered environment

setEnv :: env' -> IOEnv env' a -> IOEnv env a

Perform a computation with a different environment

getEnv :: IOEnv env env

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

updMutVar :: IORef a -> (a -> a) -> IOEnv env ()

readMutVar :: IORef a -> IOEnv env a

writeMutVar :: IORef a -> a -> IOEnv env ()

newMutVar :: a -> IOEnv env (IORef a)

uninterruptibleMaskM_ :: IOEnv env a -> IOEnv env a

unsafeInterleaveM :: IOEnv env a -> IOEnv env a

tryMostM :: IOEnv env r -> IOEnv env (Either SomeException r)

tryAllM :: IOEnv env r -> IOEnv env (Either SomeException r)

tryM :: IOEnv env r -> IOEnv env (Either IOEnvFailure r)

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

runIOEnv :: env -> IOEnv env a -> IO a

failWithM :: String -> IOEnv env a

failM :: IOEnv env a

data IOEnv env a

Instances

Monad (IOEnv m)

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

Functor (IOEnv env)

Defined in IOEnv

Methods

fmap :: (a -> b) -> IOEnv env a -> IOEnv env b

(<$) :: a -> IOEnv env b -> IOEnv env a

MonadFail (IOEnv m)

Defined in IOEnv

Methods

fail :: String -> IOEnv m a

Applicative (IOEnv m)

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

MonadPlus (IOEnv env)

Defined in IOEnv

Methods

mzero :: IOEnv env a

mplus :: IOEnv env a -> IOEnv env a -> IOEnv env a

MonadIO (IOEnv env)

Defined in IOEnv

Methods

liftIO :: IO a -> IOEnv env a

Alternative (IOEnv env)

Defined in 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]

ContainsDynFlags env => HasDynFlags (IOEnv env)

Defined in IOEnv

Methods

getDynFlags :: IOEnv env DynFlags

ContainsModule env => HasModule (IOEnv env)

Defined in IOEnv

Methods

getModule :: IOEnv env Module

ExceptionMonad (IOEnv a)

Defined in IOEnv

Methods

gcatch :: Exception e => IOEnv a a0 -> (e -> IOEnv a a0) -> IOEnv a a0

gmask :: ((IOEnv a a0 -> IOEnv a a0) -> IOEnv a b) -> IOEnv a b

gbracket :: IOEnv a a0 -> (a0 -> IOEnv a b) -> (a0 -> IOEnv a c) -> IOEnv a c

gfinally :: IOEnv a a0 -> IOEnv a b -> IOEnv a a0

data IOEnvFailure

Constructors

IOEnvFailure

Instances

Show IOEnvFailure

Defined in IOEnv

Methods

showsPrec :: Int -> IOEnvFailure -> ShowS

show :: IOEnvFailure -> String

showList :: [IOEnvFailure] -> ShowS

Exception IOEnvFailure

Defined in IOEnv

Methods

toException :: IOEnvFailure -> SomeException

fromException :: SomeException -> Maybe IOEnvFailure

displayException :: IOEnvFailure -> String

filterOutM :: Applicative m => (a -> m Bool) -> [a] -> m [a]

Like filterM, only it reverses the sense of the test.

unlessM :: Monad m => m Bool -> m () -> m ()

Monadic version of unless, taking the condition in the monad

whenM :: Monad m => m Bool -> m () -> m ()

Monadic version of when, taking the condition in the monad

maybeMapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap specialised for Maybe

foldlM_ :: (Monad m, Foldable t) => (a -> b -> m a) -> a -> t b -> m ()

Monadic version of foldl that discards its result

orM :: Monad m => m Bool -> m Bool -> m Bool

Monadic version of or

fmapEitherM :: Monad m => (a -> m b) -> (c -> m d) -> Either a c -> m (Either b d)

Monadic version of fmap

fmapMaybeM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap

mapSndM :: Monad m => (b -> m c) -> [(a, b)] -> m [(a, c)]

Monadic version of mapSnd

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

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

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]

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

Eq ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Methods

(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool

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

Show ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Methods

showsPrec :: Int -> ForeignSrcLang -> ShowS

show :: ForeignSrcLang -> String

showList :: [ForeignSrcLang] -> ShowS

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

type Rep ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

type Rep ForeignSrcLang = D1 ('MetaData "ForeignSrcLang" "GHC.ForeignSrcLang.Type" "ghc-boot-th-8.10.2" '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))))

module TidyPgm

module TyCon

module TysPrim

module TysWiredIn

tyConAppNeedsKindSig

Arguments

:: Bool

Should specified binders count towards injective positions in the kind of the TyCon? (If you're using visible kind applications, then you want True here.

-> TyCon

-> Int

The number of args the TyCon is applied to.

-> Bool

Does T t_1 ... t_n need a kind signature? (Where n is the number of arguments)

Does a TyCon (that is applied to some number of arguments) need to be ascribed with an explicit kind signature to resolve ambiguity if rendered as a source-syntax type? (See Note [When does a tycon application need an explicit kind signature?] for a full explanation of what this function checks for.)

classifiesTypeWithValues :: Kind -> Bool

Does this classify a type allowed to have values? Responds True to things like *, #, TYPE Lifted, TYPE v, Constraint.

True of any sub-kind of OpenTypeKind

isKindLevPoly :: Kind -> Bool

Tests whether the given kind (which should look like TYPE x) is something other than a constructor tree (that is, constructors at every node). E.g. True of TYPE k, TYPE (F Int) False of TYPE 'LiftedRep

isConstraintKindCon :: TyCon -> Bool

setJoinResTy :: Int -> Type -> Type -> Type

modifyJoinResTy :: Int -> (Type -> Type) -> Type -> Type

splitVisVarsOfTypes :: [Type] -> Pair TyCoVarSet

splitVisVarsOfType :: Type -> Pair TyCoVarSet

Retrieve the free variables in this type, splitting them based on whether they are used visibly or invisibly. Invisible ones come first.

synTyConResKind :: TyCon -> Kind

Find the result Kind of a type synonym, after applying it to its arity number of type variables Actually this function works fine on data types too, but they'd always return *, so we never need to ask

tyConsOfType :: Type -> UniqSet TyCon

All type constructors occurring in the type; looking through type synonyms, but not newtypes. When it finds a Class, it returns the class TyCon.

occCheckExpand :: [Var] -> Type -> Maybe Type

resultIsLevPoly :: Type -> Bool

Looking past all pi-types, is the end result potentially levity polymorphic? Example: True for (forall r (a :: TYPE r). String -> a) Example: False for (forall r1 r2 (a :: TYPE r1) (b :: TYPE r2). a -> b -> Type)

isTypeLevPoly :: Type -> Bool

Returns True if a type is levity polymorphic. Should be the same as (isKindLevPoly . typeKind) but much faster. Precondition: The type has kind (TYPE blah)

tcReturnsConstraintKind :: Kind -> Bool

tcIsRuntimeTypeKind :: Kind -> Bool

Is this kind equivalent to TYPE r (for some unknown r)?

This considers Constraint to be distinct from *.

tcIsLiftedTypeKind :: Kind -> Bool

Is this kind equivalent to *?

This considers Constraint to be distinct from *. For a version that treats them as the same type, see isLiftedTypeKind.

tcIsConstraintKind :: Kind -> Bool

tcTypeKind :: HasDebugCallStack => Type -> Kind

typeKind :: HasDebugCallStack => Type -> Kind

nonDetCmpTc :: TyCon -> TyCon -> Ordering

Compare two TyCons. NB: This should never see Constraint (as recognized by Kind.isConstraintKindCon) which is considered a synonym for Type in Core. See Note [Kind Constraint and kind Type] in Kind. See Note [nonDetCmpType nondeterminism]

nonDetCmpTypesX :: RnEnv2 -> [Type] -> [Type] -> Ordering

nonDetCmpTypeX :: RnEnv2 -> Type -> Type -> Ordering

nonDetCmpTypes :: [Type] -> [Type] -> Ordering

nonDetCmpType :: Type -> Type -> Ordering

eqVarBndrs :: RnEnv2 -> [Var] -> [Var] -> Maybe RnEnv2

eqTypes :: [Type] -> [Type] -> Bool

Type equality on lists of types, looking through type synonyms but not newtypes.

eqTypeX :: RnEnv2 -> Type -> Type -> Bool

Compare types with respect to a (presumably) non-empty RnEnv2.

seqTypes :: [Type] -> ()

seqType :: Type -> ()

isValidJoinPointType :: JoinArity -> Type -> Bool

Determine whether a type could be the type of a join point of given total arity, according to the polymorphism rule. A join point cannot be polymorphic in its return type, since given join j a b x y z = e1 in e2, the types of e1 and e2 must be the same, and a and b are not in scope for e2. (See Note [The polymorphism rule of join points] in CoreSyn.) Returns False also if the type simply doesn't have enough arguments.

Note that we need to know how many arguments (type *and* value) the putative join point takes; for instance, if j :: forall a. a -> Int then j could be a binary join point returning an Int, but it could *not* be a unary join point returning a -> Int.

TODO: See Note [Excess polymorphism and join points]

isPrimitiveType :: Type -> Bool

Returns true of types that are opaque to Haskell.

isStrictType :: HasDebugCallStack => Type -> Bool

Computes whether an argument (or let right hand side) should be computed strictly or lazily, based only on its type. Currently, it's just isUnliftedType. Panics on levity-polymorphic types.

isDataFamilyAppType :: Type -> Bool

Check whether a type is a data family type

isAlgType :: Type -> Bool

See Type for what an algebraic type is. Should only be applied to types, as opposed to e.g. partially saturated type constructors

isUnboxedSumType :: Type -> Bool

isUnboxedTupleType :: Type -> Bool

getRuntimeRep :: HasDebugCallStack => Type -> Type

Extract the RuntimeRep classifier of a type. For instance, getRuntimeRep_maybe Int = LiftedRep. Panics if this is not possible.

getRuntimeRep_maybe :: HasDebugCallStack => Type -> Maybe Type

Extract the RuntimeRep classifier of a type. For instance, getRuntimeRep_maybe Int = LiftedRep. Returns Nothing if this is not possible.

dropRuntimeRepArgs :: [Type] -> [Type]

Drops prefix of RuntimeRep constructors in TyConApps. Useful for e.g. dropping 'LiftedRep arguments of unboxed tuple TyCon applications:

dropRuntimeRepArgs [ 'LiftedRep, 'IntRep , String, Int]

isRuntimeRepKindedTy :: Type -> Bool

Is this a type of kind RuntimeRep? (e.g. LiftedRep)

mightBeUnliftedType :: Type -> Bool

Returns:

• False if the type is guaranteed lifted or
• True if it is unlifted, OR we aren't sure (e.g. in a levity-polymorphic case)

isUnliftedType :: HasDebugCallStack => Type -> Bool

See Type for what an unlifted type is. Panics on levity polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of levity polymorphism.

isLiftedType_maybe :: HasDebugCallStack => Type -> Maybe Bool

Returns Just True if this type is surely lifted, Just False if it is surely unlifted, Nothing if we can't be sure (i.e., it is levity polymorphic), and panics if the kind does not have the shape TYPE r.

isCoVarType :: Type -> Bool

Does this type classify a core (unlifted) Coercion? At either role nominal or representational (t1 ~ t2) See Note [Types for coercions, predicates, and evidence] in TyCoRep

isFamFreeTy :: Type -> Bool

coAxNthLHS :: forall (br :: BranchFlag). CoAxiom br -> Int -> Type

Get the type on the LHS of a coercion induced by a type/data family instance.

mkFamilyTyConApp :: TyCon -> [Type] -> Type

Given a family instance TyCon and its arg types, return the corresponding family type. E.g:

data family T a
data instance T (Maybe b) = MkT b

Where the instance tycon is :RTL, so:

mkFamilyTyConApp :RTL Int  =  T (Maybe Int)

closeOverKindsDSet :: DTyVarSet -> DTyVarSet

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministic set.

closeOverKindsList :: [TyVar] -> [TyVar]

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministically ordered list.

closeOverKindsFV :: [TyVar] -> FV

Given a list of tyvars returns a deterministic FV computation that returns the given tyvars with the kind variables free in the kinds of the given tyvars.

closeOverKinds :: TyVarSet -> TyVarSet

Add the kind variables free in the kinds of the tyvars in the given set. Returns a non-deterministic set.

binderRelevantType_maybe :: TyCoBinder -> Maybe Type

Extract a relevant type, if there is one.

tyBinderType :: TyBinder -> Type

tyCoBinderType :: TyCoBinder -> Type

tyCoBinderVar_maybe :: TyCoBinder -> Maybe TyCoVar

isAnonTyCoBinder :: TyCoBinder -> Bool

Does this binder bind a variable that is not erased? Returns True for anonymous binders.

mkAnonBinder :: AnonArgFlag -> Type -> TyCoBinder

Make an anonymous binder

isTauTy :: Type -> Bool

appTyArgFlags :: Type -> [Type] -> [ArgFlag]

Given a Type and a list of argument types to which the Type is applied, determine each argument's visibility (Inferred, Specified, or Required).

Most of the time, the arguments will be Required, but not always. Consider f :: forall a. a -> Type. In f Type Bool, the first argument (Type) is Specified and the second argument (Bool) is Required. It is precisely this sort of higher-rank situation in which appTyArgFlags comes in handy, since f Type Bool would be represented in Core using AppTys. (See also #15792).

tyConArgFlags :: TyCon -> [Type] -> [ArgFlag]

Given a TyCon and a list of argument types to which the TyCon is applied, determine each argument's visibility (Inferred, Specified, or Required).

Wrinkle: consider the following scenario:

T :: forall k. k -> k
tyConArgFlags T [forall m. m -> m -> m, S, R, Q]

After substituting, we get

T (forall m. m -> m -> m) :: (forall m. m -> m -> m) -> forall n. n -> n -> n

Thus, the first argument is invisible, S is visible, R is invisible again, and Q is visible.

partitionInvisibles :: [(a, ArgFlag)] -> ([a], [a])

Given a list of things paired with their visibilities, partition the things into (invisible things, visible things).

filterOutInferredTypes :: TyCon -> [Type] -> [Type]

Given a TyCon and a list of argument types, filter out any Inferred arguments.

filterOutInvisibleTypes :: TyCon -> [Type] -> [Type]

Given a TyCon and a list of argument types, filter out any invisible (i.e., Inferred or Specified) arguments.

splitPiTysInvisibleN :: Int -> Type -> ([TyCoBinder], Type)

splitPiTysInvisible :: Type -> ([TyCoBinder], Type)

invisibleTyBndrCount :: Type -> Int

splitForAllVarBndrs :: Type -> ([TyCoVarBinder], Type)

Like splitPiTys but split off only named binders and returns TyCoVarBinders rather than TyCoBinders

splitPiTys :: Type -> ([TyCoBinder], Type)

Split off all TyCoBinders to a type, splitting both proper foralls and functions

splitPiTy :: Type -> (TyCoBinder, Type)

Takes a forall type apart, or panics

splitPiTy_maybe :: Type -> Maybe (TyCoBinder, Type)

Attempts to take a forall type apart; works with proper foralls and functions

splitForAllTy_co_maybe :: Type -> Maybe (TyCoVar, Type)

Like splitForAllTy_maybe, but only returns Just if it is a covar binder.

splitForAllTy_ty_maybe :: Type -> Maybe (TyCoVar, Type)

Like splitForAllTy_maybe, but only returns Just if it is a tyvar binder.

splitForAllTy_maybe :: Type -> Maybe (TyCoVar, Type)

Attempts to take a forall type apart, but only if it's a proper forall, with a named binder

dropForAlls :: Type -> Type

Drops all ForAllTys

splitForAllTy :: Type -> (TyCoVar, Type)

Take a forall type apart, or panics if that is not possible.

isFunTy :: Type -> Bool

Is this a function?

isPiTy :: Type -> Bool

Is this a function or forall?

isForAllTy_co :: Type -> Bool

Like isForAllTy, but returns True only if it is a covar binder

isForAllTy_ty :: Type -> Bool

Like isForAllTy, but returns True only if it is a tyvar binder

isForAllTy :: Type -> Bool

Checks whether this is a proper forall (with a named binder)

splitForAllTysSameVis :: ArgFlag -> Type -> ([TyCoVar], Type)

Like splitForAllTys, but only splits a ForAllTy if sameVis argf supplied_argf is True, where argf is the visibility of the ForAllTy's binder and supplied_argf is the visibility provided as an argument to this function.

splitForAllTys :: 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.

mkTyConBindersPreferAnon

Arguments

:: [TyVar]

binders

-> TyCoVarSet

free variables of result

-> [TyConBinder]

Given a list of type-level vars and the free vars of a result kind, makes TyCoBinders, preferring anonymous binders if the variable is, in fact, not dependent. e.g. mkTyConBindersPreferAnon (k:*),(b:k),(c:k) We want (k:*) Named, (b:k) Anon, (c:k) Anon

All non-coercion binders are visible.

mkLamTypes :: [Var] -> Type -> Type

mkLamType for multiple type or value arguments

mkLamType :: Var -> Type -> Type

Makes a (->) type or an implicit forall type, depending on whether it is given a type variable or a term variable. This is used, for example, when producing the type of a lambda. Always uses Inferred binders.

mkVisForAllTys :: [TyVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and visible

mkSpecForAllTys :: [TyVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Specified, a common case

mkSpecForAllTy :: TyVar -> Type -> Type

Like mkForAllTy, but assumes the variable is dependent and Specified, a common case

mkInvForAllTys :: [TyVar] -> Type -> Type

Like mkTyCoInvForAllTys, but tvs should be a list of tyvar

mkTyCoInvForAllTys :: [TyCoVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Inferred, a common case

mkInvForAllTy :: TyVar -> Type -> Type

Like mkTyCoInvForAllTy, but tv should be a tyvar

mkTyCoInvForAllTy :: TyCoVar -> Type -> Type

Make a dependent forall over an Inferred variable

stripCoercionTy :: Type -> Coercion

isCoercionTy_maybe :: Type -> Maybe Coercion

mkCoercionTy :: Coercion -> Type

discardCast :: Type -> Type

Drop the cast on a type, if any. If there is no cast, just return the original type. This is rarely what you want. The CastTy data constructor (in TyCoRep) has the invariant that another CastTy is not inside. See the data constructor for a full description of this invariant. Since CastTy cannot be nested, the result of discardCast cannot be a CastTy.

tyConBindersTyCoBinders :: [TyConBinder] -> [TyCoBinder]

splitCastTy_maybe :: Type -> Maybe (Type, Coercion)

newTyConInstRhs :: TyCon -> [Type] -> Type

Unwrap one layer of newtype on a type constructor and its arguments, using an eta-reduced version of the newtype if possible. This requires tys to have at least newTyConInstArity tycon elements.

nextRole :: Type -> Role

splitListTyConApp_maybe :: Type -> Maybe Type

Attempts to tease a list type apart and gives the type of the elements if successful (looks through type synonyms)

repSplitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Like splitTyConApp_maybe, but doesn't look through synonyms. This assumes the synonyms have already been dealt with.

Moreover, for a FunTy, it only succeeds if the argument types have enough info to extract the runtime-rep arguments that the funTyCon requires. This will usually be true; but may be temporarily false during canonicalization: see Note [FunTy and decomposing tycon applications] in TcCanonical

tcSplitTyConApp_maybe :: HasCallStack => Type -> Maybe (TyCon, [Type])

Split a type constructor application into its type constructor and applied types. Note that this may fail in the case of a FunTy with an argument of unknown kind FunTy (e.g. FunTy (a :: k) Int. since the kind of a isn't of the form TYPE rep). Consequently, you may need to zonk your type before using this function.

If you only need the TyCon, consider using tcTyConAppTyCon_maybe.

splitTyConApp :: Type -> (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor. Panics if that is not possible. See also splitTyConApp_maybe

tyConAppArgN :: Int -> Type -> Type

tyConAppArgs :: Type -> [Type]

tyConAppArgs_maybe :: Type -> Maybe [Type]

The same as snd . splitTyConApp

tyConAppTyCon :: Type -> TyCon

tyConAppTyCon_maybe :: Type -> Maybe TyCon

The same as fst . splitTyConApp

tyConAppTyConPicky_maybe :: Type -> Maybe TyCon

Retrieve the tycon heading this type, if there is one. Does not look through synonyms.

mkTyConApp :: TyCon -> [Type] -> Type

A key function: builds a TyConApp or FunTy as appropriate to its arguments. Applies its arguments to the constructor from left to right.

applyTysX :: [TyVar] -> Type -> [Type] -> Type

piResultTys :: HasDebugCallStack => Type -> [Type] -> Type

(piResultTys f_ty [ty1, .., tyn]) gives the type of (f ty1 .. tyn) where f :: f_ty piResultTys is interesting because: 1. f_ty may have more for-alls than there are args 2. Less obviously, it may have fewer for-alls For case 2. think of: piResultTys (forall a.a) [forall b.b, Int] This really can happen, but only (I think) in situations involving undefined. For example: undefined :: forall a. a Term: undefined (forall b. b->b) Int This term should have type (Int -> Int), but notice that there are more type args than foralls in undefineds type.

funArgTy :: Type -> Type

Just like piResultTys but for a single argument Try not to iterate piResultTy, because it's inefficient to substitute one variable at a time; instead use 'piResultTys"

Extract the function argument type and panic if that is not possible

funResultTy :: Type -> Type

Extract the function result type and panic if that is not possible

splitFunTys :: Type -> ([Type], Type)

splitFunTy_maybe :: Type -> Maybe (Type, Type)

Attempts to extract the argument and result types from a type

splitFunTy :: Type -> (Type, Type)

Attempts to extract the argument and result types from a type, and panics if that is not possible. See also splitFunTy_maybe

pprUserTypeErrorTy :: Type -> SDoc

Render a type corresponding to a user type error into a SDoc.

userTypeError_maybe :: Type -> Maybe Type

Is this type a custom user error? If so, give us the kind and the error message.

isLitTy :: Type -> Maybe TyLit

Is this a type literal (symbol or numeric).

isStrLitTy :: Type -> Maybe FastString

Is this a symbol literal. We also look through type synonyms.

mkStrLitTy :: FastString -> Type

isNumLitTy :: Type -> Maybe Integer

Is this a numeric literal. We also look through type synonyms.

mkNumLitTy :: Integer -> Type

repSplitAppTys :: HasDebugCallStack => Type -> (Type, [Type])

Like splitAppTys, but doesn't look through type synonyms

splitAppTys :: Type -> (Type, [Type])

Recursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.

splitAppTy :: Type -> (Type, Type)

Attempts to take a type application apart, as in splitAppTy_maybe, and panics if this is not possible

tcRepSplitAppTy_maybe :: Type -> Maybe (Type, Type)

Does the AppTy split as in tcSplitAppTy_maybe, but assumes that any coreView stuff is already done. Refuses to look through (c => t)

repSplitAppTy_maybe :: HasDebugCallStack => Type -> Maybe (Type, Type)

Does the AppTy split as in splitAppTy_maybe, but assumes that any Core view stuff is already done

splitAppTy_maybe :: Type -> Maybe (Type, Type)

Attempt to take a type application apart, whether it is a function, type constructor, or plain type application. Note that type family applications are NEVER unsaturated by this!

mkAppTys :: Type -> [Type] -> Type

repGetTyVar_maybe :: Type -> Maybe TyVar

Attempts to obtain the type variable underlying a Type, without any expansion

getCastedTyVar_maybe :: Type -> Maybe (TyVar, CoercionN)

If the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind ty

getTyVar_maybe :: Type -> Maybe TyVar

Attempts to obtain the type variable underlying a Type

isTyVarTy :: Type -> Bool

getTyVar :: String -> Type -> TyVar

Attempts to obtain the type variable underlying a Type, and panics with the given message if this is not a type variable type. See also getTyVar_maybe

mapCoercion :: Monad m => TyCoMapper env m -> env -> Coercion -> m Coercion

mapType :: Monad m => TyCoMapper env m -> env -> Type -> m Type

isRuntimeRepVar :: TyVar -> Bool

Is a tyvar of type RuntimeRep?

isUnliftedRuntimeRep :: Type -> Bool

isUnliftedTypeKind :: Kind -> Bool

Returns True if the kind classifies unlifted types and False otherwise. Note that this returns False for levity-polymorphic kinds, which may be specialized to a kind that classifies unlifted types.

isLiftedRuntimeRep :: Type -> Bool

kindRep_maybe :: HasDebugCallStack => Kind -> Maybe Type

Given a kind (TYPE rr), extract its RuntimeRep classifier rr. For example, kindRep_maybe * = Just LiftedRep Returns Nothing if the kind is not of form (TYPE rr) Treats * and Constraint as the same

kindRep :: HasDebugCallStack => Kind -> Type

Extract the RuntimeRep classifier of a type from its kind. For example, kindRep * = LiftedRep; Panics if this is not possible. Treats * and Constraint as the same

expandTypeSynonyms :: Type -> Type

Expand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.

expandTypeSynonyms only expands out type synonyms mentioned in the type, not in the kinds of any TyCon or TyVar mentioned in the type.

Keep this synchronized with synonymTyConsOfType

data TyCoMapper env (m :: Type -> Type)

This describes how a "map" operation over a type/coercion should behave

Constructors

TyCoMapper

Fields

• tcm_tyvar :: env -> TyVar -> m Type
• tcm_covar :: env -> CoVar -> m Coercion
• tcm_hole :: env -> CoercionHole -> m Coercion

  What to do with coercion holes. See Note [Coercion holes] in TyCoRep.

• tcm_tycobinder :: env -> TyCoVar -> ArgFlag -> m (env, TyCoVar)

  The returned env is used in the extended scope

• tcm_tycon :: TyCon -> m TyCon

  This is used only for TcTyCons a) To zonk TcTyCons b) To turn TcTyCons into TyCons. See Note [Type checking recursive type and class declarations] in TcTyClsDecls

cloneTyVarBndrs :: TCvSubst -> [TyVar] -> UniqSupply -> (TCvSubst, [TyVar])

cloneTyVarBndr :: TCvSubst -> TyVar -> Unique -> (TCvSubst, TyVar)

substVarBndrs :: HasCallStack => TCvSubst -> [TyCoVar] -> (TCvSubst, [TyCoVar])

substVarBndr :: HasCallStack => TCvSubst -> TyCoVar -> (TCvSubst, TyCoVar)

substTyVarBndrs :: HasCallStack => TCvSubst -> [TyVar] -> (TCvSubst, [TyVar])

substTyVarBndr :: HasCallStack => TCvSubst -> TyVar -> (TCvSubst, TyVar)

substCoUnchecked :: TCvSubst -> Coercion -> Coercion

Substitute within a Coercion disabling sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

lookupTyVar :: TCvSubst -> TyVar -> Maybe Type

substTyVars :: TCvSubst -> [TyVar] -> [Type]

substTyVar :: TCvSubst -> TyVar -> Type

substThetaUnchecked :: TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substThetaUnchecked to substTheta and remove this function. Please don't use in new code.

substTheta :: HasCallStack => TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTysUnchecked :: TCvSubst -> [Type] -> [Type]

Substitute within several Types disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTysUnchecked to substTys and remove this function. Please don't use in new code.

substTys :: HasCallStack => TCvSubst -> [Type] -> [Type]

Substitute within several Types The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyUnchecked :: TCvSubst -> Type -> Type

Substitute within a Type disabling the sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTy :: HasCallStack => TCvSubst -> Type -> Type

Substitute within a Type The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyAddInScope :: TCvSubst -> Type -> Type

Substitute within a Type after adding the free variables of the type to the in-scope set. This is useful for the case when the free variables aren't already in the in-scope set or easily available. See also Note [The substitution invariant].

substTysWith :: [TyVar] -> [Type] -> [Type] -> [Type]

Type substitution, see zipTvSubst

substCoWithUnchecked :: [TyVar] -> [Type] -> Coercion -> Coercion

Coercion substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

substTyWithUnchecked :: [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTyWith :: HasCallStack => [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst

zipCoEnv :: HasDebugCallStack => [CoVar] -> [Coercion] -> CvSubstEnv

zipTyEnv :: HasDebugCallStack => [TyVar] -> [Type] -> TvSubstEnv

mkTvSubstPrs :: [(TyVar, Type)] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

zipTCvSubst :: HasDebugCallStack => [TyCoVar] -> [Type] -> TCvSubst

zipTvSubst :: HasDebugCallStack => [TyVar] -> [Type] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

unionTCvSubst :: TCvSubst -> TCvSubst -> TCvSubst

extendTCvSubstList :: TCvSubst -> [Var] -> [Type] -> TCvSubst

extendTvSubstList :: TCvSubst -> [Var] -> [Type] -> TCvSubst

extendTvSubstAndInScope :: TCvSubst -> TyVar -> Type -> TCvSubst

extendCvSubst :: TCvSubst -> CoVar -> Coercion -> TCvSubst

extendTvSubstWithClone :: TCvSubst -> TyVar -> TyVar -> TCvSubst

extendTvSubstBinderAndInScope :: TCvSubst -> TyCoBinder -> Type -> TCvSubst

extendTvSubst :: TCvSubst -> TyVar -> Type -> TCvSubst

extendTCvSubstWithClone :: TCvSubst -> TyCoVar -> TyCoVar -> TCvSubst

extendTCvSubst :: TCvSubst -> TyCoVar -> Type -> TCvSubst

extendTCvInScopeSet :: TCvSubst -> VarSet -> TCvSubst

extendTCvInScopeList :: TCvSubst -> [Var] -> TCvSubst

extendTCvInScope :: TCvSubst -> Var -> TCvSubst

zapTCvSubst :: TCvSubst -> TCvSubst

setTvSubstEnv :: TCvSubst -> TvSubstEnv -> TCvSubst

notElemTCvSubst :: Var -> TCvSubst -> Bool

isInScope :: Var -> TCvSubst -> Bool

getTCvSubstRangeFVs :: TCvSubst -> VarSet

Returns the free variables of the types in the range of a substitution as a non-deterministic set.

getTCvInScope :: TCvSubst -> InScopeSet

getTvSubstEnv :: TCvSubst -> TvSubstEnv

mkTCvSubst :: InScopeSet -> (TvSubstEnv, CvSubstEnv) -> TCvSubst

isEmptyTCvSubst :: TCvSubst -> Bool

mkEmptyTCvSubst :: InScopeSet -> TCvSubst

emptyTCvSubst :: TCvSubst

composeTCvSubst :: TCvSubst -> TCvSubst -> TCvSubst

Composes two substitutions, applying the second one provided first, like in function composition.

composeTCvSubstEnv :: InScopeSet -> (TvSubstEnv, CvSubstEnv) -> (TvSubstEnv, CvSubstEnv) -> (TvSubstEnv, CvSubstEnv)

(compose env1 env2)(x) is env1(env2(x)); i.e. apply env2 then env1. It assumes that both are idempotent. Typically, env1 is the refinement to a base substitution env2

emptyTvSubstEnv :: TvSubstEnv

data TCvSubst

Type & coercion substitution

The following invariants must hold of a TCvSubst:

1. The in-scope set is needed only to guide the generation of fresh uniques
2. In particular, the kind of the type variables in the in-scope set is not relevant
3. The substitution is only applied ONCE! This is because in general such application will not reach a fixed point.

Constructors

TCvSubst InScopeSet TvSubstEnv CvSubstEnv

Instances

Outputable TCvSubst

Defined in TyCoSubst

Methods

ppr :: TCvSubst -> SDoc

pprPrec :: Rational -> TCvSubst -> SDoc

type TvSubstEnv = TyVarEnv Type

A substitution of Types for TyVars and Kinds for KindVars

tidyKind :: TidyEnv -> Kind -> Kind

tidyOpenKind :: TidyEnv -> Kind -> (TidyEnv, Kind)

tidyTopType :: Type -> Type

Calls tidyType on a top-level type (i.e. with an empty tidying environment)

tidyOpenType :: TidyEnv -> Type -> (TidyEnv, Type)

tidyOpenTypes :: TidyEnv -> [Type] -> (TidyEnv, [Type])

Grabs the free type variables, tidies them and then uses tidyType to work over the type itself

tidyType :: TidyEnv -> Type -> Type

tidyTypes :: TidyEnv -> [Type] -> [Type]

tidyTyCoVarOcc :: TidyEnv -> TyCoVar -> TyCoVar

tidyOpenTyCoVar :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar)

Treat a new TyCoVar as a binder, and give it a fresh tidy name using the environment if one has not already been allocated. See also tidyVarBndr

tidyOpenTyCoVars :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar])

tidyFreeTyCoVars :: TidyEnv -> [TyCoVar] -> TidyEnv

Add the free TyVars to the env in tidy form, so that we can tidy the type they are free in

tidyTyCoVarBinders :: TidyEnv -> [VarBndr TyCoVar vis] -> (TidyEnv, [VarBndr TyCoVar vis])

tidyTyCoVarBinder :: TidyEnv -> VarBndr TyCoVar vis -> (TidyEnv, VarBndr TyCoVar vis)

tidyVarBndr :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar)

tidyVarBndrs :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar])

This tidies up a type for printing in an error message, or in an interface file.

It doesn't change the uniques at all, just the print names.

tyCoVarsOfTypesWellScoped :: [Type] -> [TyVar]

Get the free vars of types in scoped order

tyCoVarsOfTypeWellScoped :: Type -> [TyVar]

Get the free vars of a type in scoped order

scopedSort :: [TyCoVar] -> [TyCoVar]

Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ]

This is a deterministic sorting operation (that is, doesn't depend on Uniques).

It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in RnTypes

noFreeVarsOfType :: Type -> Bool

Returns True if this type has no free variables. Should be the same as isEmptyVarSet . tyCoVarsOfType, but faster in the non-forall case.

coVarsOfTypes :: [Type] -> TyCoVarSet

coVarsOfType :: Type -> CoVarSet

tyCoFVsVarBndr :: Var -> FV -> FV

tyCoFVsVarBndrs :: [Var] -> FV -> FV

tyCoFVsBndr :: TyCoVarBinder -> FV -> FV

tyCoFVsOfType :: Type -> FV

The worker for tyCoFVsOfType and tyCoFVsOfTypeList. The previous implementation used unionVarSet which is O(n+m) and can make the function quadratic. It's exported, so that it can be composed with other functions that compute free variables. See Note [FV naming conventions] in FV.

Eta-expanded because that makes it run faster (apparently) See Note [FV eta expansion] in FV for explanation.

tyCoVarsOfTypeDSet :: Type -> DTyCoVarSet

tyCoFVsOfType that returns free variables of a type in a deterministic set. For explanation of why using VarSet is not deterministic see Note [Deterministic FV] in FV.

tyCoVarsOfTypes :: [Type] -> TyCoVarSet

tyCoVarsOfType :: Type -> TyCoVarSet

funTyCon :: TyCon

The (->) type constructor.

(->) :: forall (rep1 :: RuntimeRep) (rep2 :: RuntimeRep).
        TYPE rep1 -> TYPE rep2 -> *

typeSize :: Type -> Int

mkTyConTy :: TyCon -> Type

Create the plain type constructor type which has been applied to no type arguments at all.

mkPiTys :: [TyCoBinder] -> Type -> Type

mkPiTy :: TyCoBinder -> Type -> Type

mkForAllTys :: [TyCoVarBinder] -> Type -> Type

Wraps foralls over the type using the provided TyCoVars from left to right

mkInvisFunTys :: [Type] -> Type -> Type

Make nested arrow types

mkInvisFunTy :: Type -> Type -> Type infixr 3

mkVisFunTy :: Type -> Type -> Type infixr 3

mkTyVarTys :: [TyVar] -> [Type]

mkTyVarTy :: TyVar -> Type

isNamedBinder :: TyCoBinder -> Bool

isVisibleBinder :: TyCoBinder -> Bool

Does this binder bind a visible argument?

isInvisibleBinder :: TyCoBinder -> Bool

Does this binder bind an invisible argument?

type KindOrType = Type

The key representation of types within the compiler

type KnotTied ty = ty

A type labeled KnotTied might have knot-tied tycons in it. See Note [Type checking recursive type and class declarations] in TcTyClsDecls

isPredTy :: HasDebugCallStack => Type -> Bool

isCoercionTy :: Type -> Bool

mkAppTy :: Type -> Type -> Type

Applies a type to another, as in e.g. k a

mkCastTy :: Type -> Coercion -> Type

Make a CastTy. The Coercion must be nominal. Checks the Coercion for reflexivity, dropping it if it's reflexive. See Note [Respecting definitional equality] in TyCoRep

piResultTy :: HasDebugCallStack => Type -> Type -> Type

eqType :: Type -> Type -> Bool

Type equality on source types. Does not look through newtypes or PredTypes, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in TyCoRep.

coreView :: Type -> Maybe Type

This function Strips off the top layer only of a type synonym application (if any) its underlying representation type. Returns Nothing if there is nothing to look through. This function considers Constraint to be a synonym of TYPE LiftedRep.

By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doing

tcView :: Type -> Maybe Type

Gives the typechecker view of a type. This unwraps synonyms but leaves Constraint alone. c.f. coreView, which turns Constraint into TYPE LiftedRep. Returns Nothing if no unwrapping happens. See also Note [coreView vs tcView]

isRuntimeRepTy :: Type -> Bool

Is this the type RuntimeRep?

isLiftedTypeKind :: Kind -> Bool

This version considers Constraint to be the same as *. Returns True if the argument is equivalent to Type/Constraint and False otherwise. See Note [Kind Constraint and kind Type]

splitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor

partitionInvisibleTypes :: TyCon -> [Type] -> ([Type], [Type])

Given a TyCon and a list of argument types, partition the arguments into:

1. Inferred or Specified (i.e., invisible) arguments and
2. Required (i.e., visible) arguments

isTyVar :: Var -> Bool

Is this a type-level (i.e., computationally irrelevant, thus erasable) variable? Satisfies isTyVar = not . isId.

tyVarKind :: TyVar -> Kind

mkTyVarBinders :: ArgFlag -> [TyVar] -> [TyVarBinder]

Make many named binders Input vars should be type variables

mkTyCoVarBinders :: ArgFlag -> [TyCoVar] -> [TyCoVarBinder]

Make many named binders

mkTyCoVarBinder :: ArgFlag -> TyCoVar -> TyCoVarBinder

Make a named binder

binderType :: VarBndr TyCoVar argf -> Type

binderArgFlag :: VarBndr tv argf -> argf

binderVars :: [VarBndr tv argf] -> [tv]

binderVar :: VarBndr tv argf -> tv

sameVis :: ArgFlag -> ArgFlag -> Bool

Do these denote the same level of visibility? Required arguments are visible, others are not. So this function equates Specified and Inferred. Used for printing.

isInvisibleArgFlag :: ArgFlag -> Bool

Does this ArgFlag classify an argument that is not written in Haskell?

isVisibleArgFlag :: ArgFlag -> Bool

Does this ArgFlag classify an argument that is written in Haskell?

type TyVar = Var

Type or kind Variable

type TyCoVar = Id

Type or Coercion Variable

data ForallVisFlag

Is a forall invisible (e.g., forall a b. {...}, with a dot) or visible (e.g., forall a b -> {...}, with an arrow)?

Constructors

ForallVis

A visible forall (with an arrow)

ForallInvis

An invisible forall (with a dot)

Instances

Eq ForallVisFlag

Defined in Var

Methods

(==) :: ForallVisFlag -> ForallVisFlag -> Bool

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

Data ForallVisFlag

Defined in Var

Methods

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

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

toConstr :: ForallVisFlag -> Constr

dataTypeOf :: ForallVisFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ForallVisFlag

Defined in Var

Methods

compare :: ForallVisFlag -> ForallVisFlag -> Ordering

(<) :: ForallVisFlag -> ForallVisFlag -> Bool

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

(>) :: ForallVisFlag -> ForallVisFlag -> Bool

(>=) :: ForallVisFlag -> ForallVisFlag -> Bool

max :: ForallVisFlag -> ForallVisFlag -> ForallVisFlag

min :: ForallVisFlag -> ForallVisFlag -> ForallVisFlag

Outputable ForallVisFlag

Defined in Var

Methods

ppr :: ForallVisFlag -> SDoc

pprPrec :: Rational -> ForallVisFlag -> SDoc

type TyCoVarBinder = VarBndr TyCoVar ArgFlag

Variable Binder

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

A TyVarBinder is a binder with only TyVar

type TyVarBinder = VarBndr TyVar ArgFlag

liftedTypeKind :: Kind

mkForAllTy :: TyCoVar -> ArgFlag -> Type -> Type

Like mkTyCoForAllTy, but does not check the occurrence of the binder See Note [Unused coercion variable in ForAllTy]

data Type

Instances

Data Type

Defined in TyCoRep

Methods

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

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

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

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

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

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

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

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

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

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

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

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

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

NFData Type

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Type -> ()

Outputable Type

Defined in TyCoRep

Methods

ppr :: Type -> SDoc

pprPrec :: Rational -> Type -> SDoc

Eq (DeBruijn Type)

Defined in CoreMap

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

ToHie (TScoped Type)

Defined in Compat.HieAst

Methods

toHie :: TScoped Type -> HieM [HieAST Type]

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 TcEnv for how to retrieve a TyThing given a Name.

Constructors

AnId Id

AConLike ConLike

ATyCon TyCon

ACoAxiom (CoAxiom Branched)

Instances

NamedThing TyThing

Defined in TyCoRep

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

Outputable TyThing

Defined in TyCoRep

Methods

ppr :: TyThing -> SDoc

pprPrec :: Rational -> TyThing -> SDoc

data TyCoBinder

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

Instances

Data TyCoBinder

Defined in TyCoRep

Methods

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

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

toConstr :: TyCoBinder -> Constr

dataTypeOf :: TyCoBinder -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable TyCoBinder

Defined in TyCoRep

Methods

ppr :: TyCoBinder -> SDoc

pprPrec :: Rational -> TyCoBinder -> SDoc

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 Kind = Type

The key type representing kinds in the compiler.

type ThetaType = [PredType]

A collection of PredTypes

data ArgFlag

Argument Flag

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

Constructors

Inferred

Specified

Required

Instances

Eq ArgFlag

Defined in Var

Methods

(==) :: ArgFlag -> ArgFlag -> Bool

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

Data ArgFlag

Defined in Var

Methods

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

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

toConstr :: ArgFlag -> Constr

dataTypeOf :: ArgFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord ArgFlag

Defined in Var

Methods

compare :: ArgFlag -> ArgFlag -> Ordering

(<) :: ArgFlag -> ArgFlag -> Bool

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

(>) :: ArgFlag -> ArgFlag -> Bool

(>=) :: ArgFlag -> ArgFlag -> Bool

max :: ArgFlag -> ArgFlag -> ArgFlag

min :: ArgFlag -> ArgFlag -> ArgFlag

Binary ArgFlag

Defined in Var

Methods

put_ :: BinHandle -> ArgFlag -> IO ()

put :: BinHandle -> ArgFlag -> IO (Bin ArgFlag)

get :: BinHandle -> IO ArgFlag

Outputable ArgFlag

Defined in Var

Methods

ppr :: ArgFlag -> SDoc

pprPrec :: Rational -> ArgFlag -> SDoc

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

pprPrec :: Rational -> VarBndr tv ArgFlag -> SDoc

data AnonArgFlag

The non-dependent version of ArgFlag.

Constructors

VisArg

Used for (->): an ordinary non-dependent arrow. The argument is visible in source code.

InvisArg

Used for (=>): a non-dependent predicate arrow. The argument is invisible in source code.

Instances

Eq AnonArgFlag

Defined in Var

Methods

(==) :: AnonArgFlag -> AnonArgFlag -> Bool

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

Data AnonArgFlag

Defined in Var

Methods

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

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

toConstr :: AnonArgFlag -> Constr

dataTypeOf :: AnonArgFlag -> DataType

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

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

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

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

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

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

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

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

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

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

Ord AnonArgFlag

Defined in Var

Methods

compare :: AnonArgFlag -> AnonArgFlag -> Ordering

(<) :: AnonArgFlag -> AnonArgFlag -> Bool

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

(>) :: AnonArgFlag -> AnonArgFlag -> Bool

(>=) :: AnonArgFlag -> AnonArgFlag -> Bool

max :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

min :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

Binary AnonArgFlag

Defined in Var

Methods

put_ :: BinHandle -> AnonArgFlag -> IO ()

put :: BinHandle -> AnonArgFlag -> IO (Bin AnonArgFlag)

get :: BinHandle -> IO AnonArgFlag

Outputable AnonArgFlag

Defined in Var

Methods

ppr :: AnonArgFlag -> SDoc

pprPrec :: Rational -> AnonArgFlag -> SDoc

data Var

Variable

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

Instances

Eq Var

Defined in Var

Methods

(==) :: Var -> Var -> Bool

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

Data Var

Defined in Var

Methods

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

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

toConstr :: Var -> Constr

dataTypeOf :: Var -> DataType

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

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

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

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

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

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

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

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

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

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

Ord Var

Defined in Var

Methods

compare :: Var -> Var -> Ordering

(<) :: Var -> Var -> Bool

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

(>) :: Var -> Var -> Bool

(>=) :: Var -> Var -> Bool

max :: Var -> Var -> Var

min :: Var -> Var -> Var

NamedThing Var

Defined in Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

HasOccName Var

Defined in Var

Methods

occName :: Var -> OccName

Uniquable Var

Defined in Var

Methods

getUnique :: Var -> Unique

Outputable Var

Defined in Var

Methods

ppr :: Var -> SDoc

pprPrec :: Rational -> Var -> SDoc

ModifyState Id

Defined in Compat.HieAst

Methods

addSubstitution :: Id -> Id -> HieState -> HieState

Eq (DeBruijn CoreExpr)

Defined in CoreMap

Methods

(==) :: DeBruijn CoreExpr -> DeBruijn CoreExpr -> Bool

(/=) :: DeBruijn CoreExpr -> DeBruijn CoreExpr -> Bool

Eq (DeBruijn CoreAlt)

Defined in CoreMap

Methods

(==) :: DeBruijn CoreAlt -> DeBruijn CoreAlt -> Bool

(/=) :: DeBruijn CoreAlt -> DeBruijn CoreAlt -> Bool

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

module Unify

module UniqSupply

setTyVarUnique :: TyVar -> Unique -> TyVar

setVarUnique :: Var -> Unique -> Var

data Var

Variable

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

Instances

Eq Var

Defined in Var

Methods

(==) :: Var -> Var -> Bool

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

Data Var

Defined in Var

Methods

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

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

toConstr :: Var -> Constr

dataTypeOf :: Var -> DataType

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

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

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

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

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

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

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

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

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

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

Ord Var

Defined in Var

Methods

compare :: Var -> Var -> Ordering

(<) :: Var -> Var -> Bool

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

(>) :: Var -> Var -> Bool

(>=) :: Var -> Var -> Bool

max :: Var -> Var -> Var

min :: Var -> Var -> Var

NamedThing Var

Defined in Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

HasOccName Var

Defined in Var

Methods

occName :: Var -> OccName

Uniquable Var

Defined in Var

Methods

getUnique :: Var -> Unique

Outputable Var

Defined in Var

Methods

ppr :: Var -> SDoc

pprPrec :: Rational -> Var -> SDoc

ModifyState Id

Defined in Compat.HieAst

Methods

addSubstitution :: Id -> Id -> HieState -> HieState

Eq (DeBruijn CoreExpr)

Defined in CoreMap

Methods

(==) :: DeBruijn CoreExpr -> DeBruijn CoreExpr -> Bool

(/=) :: DeBruijn CoreExpr -> DeBruijn CoreExpr -> Bool

Eq (DeBruijn CoreAlt)

Defined in CoreMap

Methods

(==) :: DeBruijn CoreAlt -> DeBruijn CoreAlt -> Bool

(/=) :: DeBruijn CoreAlt -> DeBruijn CoreAlt -> Bool

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

Syntax re-exports

module GHC.Hs

module ExtractDocs

module Parser

module Lexer