| Safe Haskell | None |
|---|---|
| Language | GHC2021 |
GHC.Types.Basic
Synopsis
- data LeftOrRight
- pickLR :: LeftOrRight -> (a, a) -> a
- type ConTag = Int
- type ConTagZ = Int
- fIRST_TAG :: ConTag
- type Arity = Int
- type VisArity = Int
- type RepArity = Int
- type JoinArity = Int
- type FullArgCount = Int
- data JoinPointHood
- = JoinPoint !Int
- | NotJoinPoint
- isJoinPoint :: JoinPointHood -> Bool
- data Alignment
- mkAlignment :: Int -> Alignment
- alignmentOf :: Int -> Alignment
- alignmentBytes :: Alignment -> Int
- data PromotionFlag
- isPromoted :: PromotionFlag -> Bool
- data FunctionOrData
- = IsFunction
- | IsData
- data RecFlag
- isRec :: RecFlag -> Bool
- isNonRec :: RecFlag -> Bool
- boolToRecFlag :: Bool -> RecFlag
- data Origin
- isGenerated :: Origin -> Bool
- data DoPmc
- requiresPMC :: Origin -> Bool
- data GenReason
- isDoExpansionGenerated :: Origin -> Bool
- doExpansionFlavour :: Origin -> Maybe HsDoFlavour
- doExpansionOrigin :: HsDoFlavour -> Origin
- type RuleName = FastString
- pprRuleName :: RuleName -> SDoc
- data TopLevelFlag
- isTopLevel :: TopLevelFlag -> Bool
- isNotTopLevel :: TopLevelFlag -> Bool
- data OverlapFlag = OverlapFlag {}
- data OverlapMode
- setOverlapModeMaybe :: OverlapFlag -> Maybe OverlapMode -> OverlapFlag
- hasOverlappingFlag :: OverlapMode -> Bool
- hasOverlappableFlag :: OverlapMode -> Bool
- hasIncoherentFlag :: OverlapMode -> Bool
- hasNonCanonicalFlag :: OverlapMode -> Bool
- data Boxity
- isBoxed :: Boxity -> Bool
- data CbvMark
- isMarkedCbv :: CbvMark -> Bool
- newtype PprPrec = PprPrec Int
- topPrec :: PprPrec
- sigPrec :: PprPrec
- opPrec :: PprPrec
- funPrec :: PprPrec
- starPrec :: PprPrec
- appPrec :: PprPrec
- maxPrec :: PprPrec
- maybeParen :: PprPrec -> PprPrec -> SDoc -> SDoc
- data TupleSort
- tupleSortBoxity :: TupleSort -> Boxity
- boxityTupleSort :: Boxity -> TupleSort
- tupleParens :: TupleSort -> SDoc -> SDoc
- data UnboxedTupleOrSum
- unboxedTupleOrSumExtension :: UnboxedTupleOrSum -> Extension
- sumParens :: SDoc -> SDoc
- pprAlternative :: (a -> SDoc) -> a -> ConTag -> Arity -> SDoc
- data OneShotInfo
- noOneShotInfo :: OneShotInfo
- hasNoOneShotInfo :: OneShotInfo -> Bool
- isOneShotInfo :: OneShotInfo -> Bool
- bestOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo
- worstOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo
- data OccInfo
- = ManyOccs {
- occ_tail :: !TailCallInfo
- | IAmDead
- | OneOcc { }
- | IAmALoopBreaker {
- occ_rules_only :: !RulesOnly
- occ_tail :: !TailCallInfo
- = ManyOccs {
- noOccInfo :: OccInfo
- seqOccInfo :: OccInfo -> ()
- zapFragileOcc :: OccInfo -> OccInfo
- isOneOcc :: OccInfo -> Bool
- isDeadOcc :: OccInfo -> Bool
- isStrongLoopBreaker :: OccInfo -> Bool
- isWeakLoopBreaker :: OccInfo -> Bool
- isManyOccs :: OccInfo -> Bool
- isNoOccInfo :: OccInfo -> Bool
- strongLoopBreaker :: OccInfo
- weakLoopBreaker :: OccInfo
- data InsideLam
- type BranchCount = Int
- oneBranch :: BranchCount
- data InterestingCxt
- data TailCallInfo
- tailCallInfo :: OccInfo -> TailCallInfo
- zapOccTailCallInfo :: OccInfo -> OccInfo
- isAlwaysTailCalled :: OccInfo -> Bool
- data EP a = EP {}
- data DefMethSpec ty
- data SwapFlag
- flipSwap :: SwapFlag -> SwapFlag
- unSwap :: SwapFlag -> (a -> a -> b) -> a -> a -> b
- notSwapped :: SwapFlag -> Bool
- isSwapped :: SwapFlag -> Bool
- pickSwap :: SwapFlag -> a -> a -> a
- data CompilerPhase
- type PhaseNum = Int
- beginPhase :: Activation -> CompilerPhase
- nextPhase :: CompilerPhase -> CompilerPhase
- laterPhase :: CompilerPhase -> CompilerPhase -> CompilerPhase
- data Activation
- isActive :: CompilerPhase -> Activation -> Bool
- competesWith :: Activation -> Activation -> Bool
- isNeverActive :: Activation -> Bool
- isAlwaysActive :: Activation -> Bool
- activeInFinalPhase :: Activation -> Bool
- activeInInitialPhase :: Activation -> Bool
- activateAfterInitial :: Activation
- activateDuringFinal :: Activation
- activeAfter :: CompilerPhase -> Activation
- data RuleMatchInfo
- isConLike :: RuleMatchInfo -> Bool
- isFunLike :: RuleMatchInfo -> Bool
- data InlineSpec
- noUserInlineSpec :: InlineSpec -> Bool
- data InlinePragma = InlinePragma {}
- defaultInlinePragma :: InlinePragma
- alwaysInlinePragma :: InlinePragma
- neverInlinePragma :: InlinePragma
- dfunInlinePragma :: InlinePragma
- isDefaultInlinePragma :: InlinePragma -> Bool
- isInlinePragma :: InlinePragma -> Bool
- isInlinablePragma :: InlinePragma -> Bool
- isNoInlinePragma :: InlinePragma -> Bool
- isOpaquePragma :: InlinePragma -> Bool
- isAnyInlinePragma :: InlinePragma -> Bool
- alwaysInlineConLikePragma :: InlinePragma
- inlinePragmaSource :: InlinePragma -> SourceText
- inlinePragmaName :: InlineSpec -> SDoc
- inlineSpecSource :: InlineSpec -> SourceText
- inlinePragmaSpec :: InlinePragma -> InlineSpec
- inlinePragmaSat :: InlinePragma -> Maybe Arity
- inlinePragmaActivation :: InlinePragma -> Activation
- inlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo
- setInlinePragmaActivation :: InlinePragma -> Activation -> InlinePragma
- setInlinePragmaRuleMatchInfo :: InlinePragma -> RuleMatchInfo -> InlinePragma
- pprInline :: InlinePragma -> SDoc
- pprInlineDebug :: InlinePragma -> SDoc
- data UnfoldingSource
- isStableSource :: UnfoldingSource -> Bool
- isStableUserSource :: UnfoldingSource -> Bool
- isStableSystemSource :: UnfoldingSource -> Bool
- isCompulsorySource :: UnfoldingSource -> Bool
- data SuccessFlag
- succeeded :: SuccessFlag -> Bool
- failed :: SuccessFlag -> Bool
- successIf :: Bool -> SuccessFlag
- data IntWithInf
- infinity :: IntWithInf
- treatZeroAsInf :: Int -> IntWithInf
- subWithInf :: IntWithInf -> Int -> IntWithInf
- mkIntWithInf :: Int -> IntWithInf
- intGtLimit :: Int -> IntWithInf -> Bool
- data TypeOrKind
- isTypeLevel :: TypeOrKind -> Bool
- isKindLevel :: TypeOrKind -> Bool
- data Levity
- mightBeLifted :: Maybe Levity -> Bool
- mightBeUnlifted :: Maybe Levity -> Bool
- data TypeOrConstraint
- data TyConFlavour tc
- data TypeOrData
- data NewOrData
- tyConFlavourAssoc_maybe :: TyConFlavour tc -> Maybe tc
- data NonStandardDefaultingStrategy
- data DefaultingStrategy
- defaultNonStandardTyVars :: DefaultingStrategy -> Bool
- data ForeignSrcLang
- data ImportLevel
- convImportLevel :: ImportDeclLevelStyle -> ImportLevel
- convImportLevelSpec :: ImportDeclLevel -> ImportLevel
- allImportLevels :: [ImportLevel]
Documentation
data LeftOrRight Source #
Instances
pickLR :: LeftOrRight -> (a, a) -> a Source #
A *one-index* constructor tag
Type of the tags associated with each constructor possibility or superclass selector
Tags are allocated from here for real constructors or for superclass selectors
The number of value arguments that can be applied to a value before it does "real work". So: fib 100 has arity 0 x -> fib x has arity 1 See also Note [Definition of arity] in GHC.Core.Opt.Arity
Syntactic (visibility) arity, i.e. the number of visible arguments. See Note [Visibility and arity]
Representation Arity
The number of represented arguments that can be applied to a value before it does "real work". So: fib 100 has representation arity 0 x -> fib x has representation arity 1 (# x, y #) -> fib (x + y) has representation arity 2
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 FullArgCount = Int Source #
FullArgCount is the number of type or value arguments in an application, or the number of type or value binders in a lambda. Note: it includes both type and value arguments!
data JoinPointHood Source #
Constructors
| JoinPoint !Int | |
| NotJoinPoint |
Instances
| NFData JoinPointHood Source # | |
Defined in GHC.Utils.Outputable Methods rnf :: JoinPointHood -> () Source # | |
| Binary JoinPointHood Source # | |
Defined in GHC.Utils.Binary Methods put_ :: WriteBinHandle -> JoinPointHood -> IO () Source # put :: WriteBinHandle -> JoinPointHood -> IO (Bin JoinPointHood) Source # get :: ReadBinHandle -> IO JoinPointHood Source # | |
| Outputable JoinPointHood Source # | |
Defined in GHC.Utils.Outputable Methods ppr :: JoinPointHood -> SDoc Source # | |
| Eq JoinPointHood Source # | |
Defined in GHC.Utils.Outputable Methods (==) :: JoinPointHood -> JoinPointHood -> Bool Source # (/=) :: JoinPointHood -> JoinPointHood -> Bool Source # | |
isJoinPoint :: JoinPointHood -> Bool Source #
A power-of-two alignment
Instances
| Outputable Alignment Source # | |
| Eq Alignment Source # | |
| Ord Alignment Source # | |
Defined in GHC.Types.Basic | |
| OutputableP env Alignment Source # | |
mkAlignment :: Int -> Alignment Source #
alignmentOf :: Int -> Alignment Source #
alignmentBytes :: Alignment -> Int Source #
data PromotionFlag Source #
Constructors
| NotPromoted | |
| IsPromoted |
Instances
isPromoted :: PromotionFlag -> Bool Source #
data FunctionOrData Source #
Constructors
| IsFunction | |
| IsData |
Instances
Recursivity Flag
Constructors
| Recursive | |
| NonRecursive |
Instances
| Binary RecFlag Source # | |
| Outputable RecFlag Source # | |
| Eq RecFlag Source # | |
| Data RecFlag Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RecFlag -> c RecFlag Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RecFlag Source # toConstr :: RecFlag -> Constr Source # dataTypeOf :: RecFlag -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RecFlag) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RecFlag) Source # gmapT :: (forall b. Data b => b -> b) -> RecFlag -> RecFlag Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RecFlag -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RecFlag -> r Source # gmapQ :: (forall d. Data d => d -> u) -> RecFlag -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> RecFlag -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RecFlag -> m RecFlag Source # | |
boolToRecFlag :: Bool -> RecFlag Source #
Was this piece of code user-written or generated by the compiler?
See Note [Generated code and pattern-match checking].
Constructors
| FromSource | |
| Generated GenReason DoPmc |
Instances
| Outputable Origin Source # | |
| Eq Origin Source # | |
| Data Origin Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Origin -> c Origin Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Origin Source # toConstr :: Origin -> Constr Source # dataTypeOf :: Origin -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Origin) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Origin) Source # gmapT :: (forall b. Data b => b -> b) -> Origin -> Origin Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Origin -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Origin -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Origin -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Origin -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Origin -> m Origin Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Origin -> m Origin Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Origin -> m Origin Source # | |
isGenerated :: Origin -> Bool Source #
Whether to run pattern-match checks in generated code.
See Note [Generated code and pattern-match checking].
Instances
| Outputable DoPmc Source # | |
| Eq DoPmc Source # | |
| Data DoPmc Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DoPmc -> c DoPmc Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DoPmc Source # toConstr :: DoPmc -> Constr Source # dataTypeOf :: DoPmc -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DoPmc) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DoPmc) Source # gmapT :: (forall b. Data b => b -> b) -> DoPmc -> DoPmc Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DoPmc -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DoPmc -> r Source # gmapQ :: (forall d. Data d => d -> u) -> DoPmc -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> DoPmc -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> DoPmc -> m DoPmc Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DoPmc -> m DoPmc Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DoPmc -> m DoPmc Source # | |
requiresPMC :: Origin -> Bool Source #
Does this Origin require us to run pattern-match checking,
or should we skip these checks?
See Note [Generated code and pattern-match checking].
This metadata stores the information as to why was the piece of code generated
It is useful for generating the right error context
See Part 3 in Note [Expanding HsDo with XXExprGhcRn] in Do
Constructors
| DoExpansion HsDoFlavour | |
| OtherExpansion |
Instances
| Outputable GenReason Source # | |
| Eq GenReason Source # | |
| Data GenReason Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenReason -> c GenReason Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GenReason Source # toConstr :: GenReason -> Constr Source # dataTypeOf :: GenReason -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GenReason) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GenReason) Source # gmapT :: (forall b. Data b => b -> b) -> GenReason -> GenReason Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenReason -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenReason -> r Source # gmapQ :: (forall d. Data d => d -> u) -> GenReason -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> GenReason -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenReason -> m GenReason Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenReason -> m GenReason Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenReason -> m GenReason Source # | |
isDoExpansionGenerated :: Origin -> Bool Source #
type RuleName = FastString Source #
pprRuleName :: RuleName -> SDoc Source #
data TopLevelFlag Source #
Constructors
| TopLevel | |
| NotTopLevel |
Instances
| Outputable TopLevelFlag Source # | |
Defined in GHC.Types.Basic Methods ppr :: TopLevelFlag -> SDoc Source # | |
| Data TopLevelFlag Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TopLevelFlag -> c TopLevelFlag Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TopLevelFlag Source # toConstr :: TopLevelFlag -> Constr Source # dataTypeOf :: TopLevelFlag -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TopLevelFlag) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TopLevelFlag) Source # gmapT :: (forall b. Data b => b -> b) -> TopLevelFlag -> TopLevelFlag Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TopLevelFlag -> r Source # gmapQ :: (forall d. Data d => d -> u) -> TopLevelFlag -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> TopLevelFlag -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TopLevelFlag -> m TopLevelFlag Source # | |
isTopLevel :: TopLevelFlag -> Bool Source #
isNotTopLevel :: TopLevelFlag -> Bool Source #
data OverlapFlag Source #
The semantics allowed for overlapping instances for a particular
instance. See Note [Safe Haskell isSafeOverlap] in GHC.Core.InstEnv for a
explanation of the isSafeOverlap field.
Constructors
| OverlapFlag | |
Fields | |
Instances
data OverlapMode Source #
Constructors
| NoOverlap SourceText | This instance must not overlap another |
| Overlappable SourceText | Silently ignore this instance if you find a more specific one that matches the constraint you are trying to resolve Example: constraint (Foo [Int]) instance Foo [Int] instance {-# OVERLAPPABLE #-} Foo [a] Since the second instance has the Overlappable flag, the first instance will be chosen (otherwise its ambiguous which to choose) |
| Overlapping SourceText | Silently ignore any more general instances that may be used to solve the constraint. Example: constraint (Foo [Int]) instance {-# OVERLAPPING #-} Foo [Int] instance Foo [a] Since the first instance has the Overlapping flag, the second---more general---instance will be ignored (otherwise it is ambiguous which to choose) |
| Overlaps SourceText | Equivalent to having both |
| Incoherent SourceText | Behave like Overlappable and Overlapping, and in addition pick an arbitrary one if there are multiple matching candidates, and don't worry about later instantiation Example: constraint (Foo [b])
instance {-# INCOHERENT -} Foo [Int]
instance Foo [a]
Without the Incoherent flag, we'd complain that
instantiating |
| NonCanonical SourceText | Behave like Incoherent, but the instance choice is observable by the program behaviour. See Note [Coherence and specialisation: overview]. We don't have surface syntax for the distinction between
Incoherent and NonCanonical instances; instead, the flag
`-f{no-}specialise-incoherents` (on by default) controls
whether |
Instances
hasOverlappingFlag :: OverlapMode -> Bool Source #
hasIncoherentFlag :: OverlapMode -> Bool Source #
Instances
| Binary Boxity Source # | |
| Outputable Boxity Source # | |
| Eq Boxity Source # | |
| Data Boxity Source # | |
Defined in Language.Haskell.Syntax.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Boxity -> c Boxity Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Boxity Source # toConstr :: Boxity -> Constr Source # dataTypeOf :: Boxity -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Boxity) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Boxity) Source # gmapT :: (forall b. Data b => b -> b) -> Boxity -> Boxity Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Boxity -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Boxity -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Boxity -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Boxity -> m Boxity Source # | |
Should an argument be passed evaluated *and* tagged.
Constructors
| MarkedCbv | |
| NotMarkedCbv |
isMarkedCbv :: CbvMark -> Bool Source #
A general-purpose pretty-printing precedence type.
Instances
| Eq PprPrec Source # | |
| Ord PprPrec Source # | |
| Show PprPrec Source # | |
Constructors
| BoxedTuple | |
| UnboxedTuple | |
| ConstraintTuple |
Instances
| NFData TupleSort Source # | |
Defined in GHC.Types.Basic | |
| Binary TupleSort Source # | |
| Outputable TupleSort Source # | |
| Eq TupleSort Source # | |
| Ord TupleSort Source # | |
Defined in GHC.Types.Basic | |
| Data TupleSort Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TupleSort -> c TupleSort Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TupleSort Source # toConstr :: TupleSort -> Constr Source # dataTypeOf :: TupleSort -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TupleSort) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TupleSort) Source # gmapT :: (forall b. Data b => b -> b) -> TupleSort -> TupleSort Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TupleSort -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TupleSort -> r Source # gmapQ :: (forall d. Data d => d -> u) -> TupleSort -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> TupleSort -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TupleSort -> m TupleSort Source # | |
tupleSortBoxity :: TupleSort -> Boxity Source #
boxityTupleSort :: Boxity -> TupleSort Source #
data UnboxedTupleOrSum Source #
Are we dealing with an unboxed tuple or an unboxed sum?
Used when validity checking, see check_ubx_tuple_or_sum.
Constructors
| UnboxedTupleType | |
| UnboxedSumType |
Instances
| Outputable UnboxedTupleOrSum Source # | |
Defined in GHC.Types.Basic Methods ppr :: UnboxedTupleOrSum -> SDoc Source # | |
| Eq UnboxedTupleOrSum Source # | |
Defined in GHC.Types.Basic Methods (==) :: UnboxedTupleOrSum -> UnboxedTupleOrSum -> Bool Source # (/=) :: UnboxedTupleOrSum -> UnboxedTupleOrSum -> Bool Source # | |
Arguments
| :: (a -> SDoc) | The pretty printing function to use |
| -> a | The things to be pretty printed |
| -> ConTag | Alternative (one-based) |
| -> Arity | Arity |
| -> SDoc |
|
Pretty print an alternative in an unboxed sum e.g. "| a | |".
The OneShotInfo type
data OneShotInfo Source #
If the Id is a lambda-bound variable then it may have lambda-bound
variable info. Sometimes we know whether the lambda binding this variable
is a "one-shot" lambda; that is, whether it is applied at most once.
This information may be useful in optimisation, as computations may safely be floated inside such a lambda without risk of duplicating work.
See also Note [OneShotInfo overview] above.
Constructors
| NoOneShotInfo | No information |
| OneShotLam | The lambda is applied at most once. |
Instances
| Outputable OneShotInfo Source # | |
Defined in GHC.Types.Basic Methods ppr :: OneShotInfo -> SDoc Source # | |
| Eq OneShotInfo Source # | |
Defined in GHC.Types.Basic Methods (==) :: OneShotInfo -> OneShotInfo -> Bool Source # (/=) :: OneShotInfo -> OneShotInfo -> Bool Source # | |
noOneShotInfo :: OneShotInfo Source #
It is always safe to assume that an Id has no lambda-bound variable information
hasNoOneShotInfo :: OneShotInfo -> Bool Source #
isOneShotInfo :: OneShotInfo -> Bool Source #
bestOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo Source #
worstOneShot :: OneShotInfo -> OneShotInfo -> OneShotInfo Source #
identifier Occurrence Information
Constructors
| ManyOccs | There are many occurrences, or unknown occurrences |
Fields
| |
| IAmDead | Marks unused variables. Sometimes useful for lambda and case-bound variables. |
| OneOcc | Occurs exactly once (per branch), not inside a rule |
Fields
| |
| 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
| |
seqOccInfo :: OccInfo -> () Source #
zapFragileOcc :: OccInfo -> OccInfo Source #
isStrongLoopBreaker :: OccInfo -> Bool Source #
isWeakLoopBreaker :: OccInfo -> Bool Source #
isManyOccs :: OccInfo -> Bool Source #
isNoOccInfo :: OccInfo -> Bool Source #
Inside Lambda
Constructors
| IsInsideLam | Occurs inside a non-linear lambda Substituting a redex for this occurrence is dangerous because it might duplicate work. |
| NotInsideLam |
type BranchCount = Int Source #
data InterestingCxt Source #
Interesting Context
Constructors
| IsInteresting | Function: is applied Data value: scrutinised by a case with at least one non-DEFAULT branch |
| NotInteresting |
Instances
| Monoid InterestingCxt Source # | |
Defined in GHC.Types.Basic Methods mempty :: InterestingCxt Source # mappend :: InterestingCxt -> InterestingCxt -> InterestingCxt Source # mconcat :: [InterestingCxt] -> InterestingCxt Source # | |
| Semigroup InterestingCxt Source # | If there is any |
Defined in GHC.Types.Basic Methods (<>) :: InterestingCxt -> InterestingCxt -> InterestingCxt Source # sconcat :: NonEmpty InterestingCxt -> InterestingCxt Source # stimes :: Integral b => b -> InterestingCxt -> InterestingCxt Source # | |
| Eq InterestingCxt Source # | |
Defined in GHC.Types.Basic Methods (==) :: InterestingCxt -> InterestingCxt -> Bool Source # (/=) :: InterestingCxt -> InterestingCxt -> Bool Source # | |
data TailCallInfo Source #
Constructors
| AlwaysTailCalled !JoinArity | |
| NoTailCallInfo |
Instances
| Outputable TailCallInfo Source # | |
Defined in GHC.Types.Basic Methods ppr :: TailCallInfo -> SDoc Source # | |
| Eq TailCallInfo Source # | |
Defined in GHC.Types.Basic Methods (==) :: TailCallInfo -> TailCallInfo -> Bool Source # (/=) :: TailCallInfo -> TailCallInfo -> Bool Source # | |
tailCallInfo :: OccInfo -> TailCallInfo Source #
zapOccTailCallInfo :: OccInfo -> OccInfo Source #
isAlwaysTailCalled :: OccInfo -> Bool Source #
data DefMethSpec ty Source #
Default Method Specification
Instances
| NFData (DefMethSpec IfaceType) Source # | |
Defined in GHC.Iface.Type Methods rnf :: DefMethSpec IfaceType -> () Source # | |
| Binary (DefMethSpec IfaceType) Source # | |
Defined in GHC.Iface.Type Methods put_ :: WriteBinHandle -> DefMethSpec IfaceType -> IO () Source # put :: WriteBinHandle -> DefMethSpec IfaceType -> IO (Bin (DefMethSpec IfaceType)) Source # get :: ReadBinHandle -> IO (DefMethSpec IfaceType) Source # | |
| Outputable (DefMethSpec ty) Source # | |
Defined in GHC.Types.Basic Methods ppr :: DefMethSpec ty -> SDoc Source # | |
Constructors
| NotSwapped | |
| IsSwapped |
notSwapped :: SwapFlag -> Bool Source #
data CompilerPhase Source #
Constructors
| InitialPhase | |
| Phase PhaseNum | |
| FinalPhase |
Instances
| Outputable CompilerPhase Source # | |
Defined in GHC.Types.Basic Methods ppr :: CompilerPhase -> SDoc Source # | |
| Eq CompilerPhase Source # | |
Defined in GHC.Types.Basic Methods (==) :: CompilerPhase -> CompilerPhase -> Bool Source # (/=) :: CompilerPhase -> CompilerPhase -> Bool Source # | |
beginPhase :: Activation -> CompilerPhase Source #
laterPhase :: CompilerPhase -> CompilerPhase -> CompilerPhase Source #
data Activation Source #
Constructors
| AlwaysActive | |
| ActiveBefore SourceText PhaseNum | |
| ActiveAfter SourceText PhaseNum | |
| FinalActive | |
| NeverActive |
Instances
isActive :: CompilerPhase -> Activation -> Bool Source #
competesWith :: Activation -> Activation -> Bool Source #
isNeverActive :: Activation -> Bool Source #
isAlwaysActive :: Activation -> Bool Source #
activeInFinalPhase :: Activation -> Bool Source #
data RuleMatchInfo Source #
Rule Match Information
Instances
isConLike :: RuleMatchInfo -> Bool Source #
isFunLike :: RuleMatchInfo -> Bool Source #
data InlineSpec Source #
Inline Specification
Constructors
| Inline SourceText | |
| Inlinable SourceText | |
| NoInline SourceText | |
| Opaque SourceText | |
| NoUserInlinePrag |
Instances
noUserInlineSpec :: InlineSpec -> Bool Source #
data InlinePragma Source #
Constructors
| InlinePragma | |
Fields
| |
Instances
isInlinePragma :: InlinePragma -> Bool Source #
isInlinablePragma :: InlinePragma -> Bool Source #
isNoInlinePragma :: InlinePragma -> Bool Source #
isOpaquePragma :: InlinePragma -> Bool Source #
isAnyInlinePragma :: InlinePragma -> Bool Source #
inlinePragmaName :: InlineSpec -> SDoc Source #
Outputs string for pragma name for any of INLINEINLINABLENOINLINE. This differs from the Outputable instance for the InlineSpec type where the pragma name string as well as the accompanying SourceText (if any) is printed.
inlinePragmaSat :: InlinePragma -> Maybe Arity Source #
pprInline :: InlinePragma -> SDoc Source #
Pretty-print without displaying the user-specified InlineSpec.
pprInlineDebug :: InlinePragma -> SDoc Source #
Pretty-print including the user-specified InlineSpec.
data UnfoldingSource Source #
Constructors
| VanillaSrc | |
| StableUserSrc | |
| StableSystemSrc | |
| CompulsorySrc |
Instances
| NFData UnfoldingSource Source # | |
Defined in GHC.Types.Basic Methods rnf :: UnfoldingSource -> () Source # | |
| Binary UnfoldingSource Source # | |
Defined in GHC.Types.Basic Methods put_ :: WriteBinHandle -> UnfoldingSource -> IO () Source # put :: WriteBinHandle -> UnfoldingSource -> IO (Bin UnfoldingSource) Source # get :: ReadBinHandle -> IO UnfoldingSource Source # | |
| Outputable UnfoldingSource Source # | |
Defined in GHC.Types.Basic Methods ppr :: UnfoldingSource -> SDoc Source # | |
isStableSource :: UnfoldingSource -> Bool Source #
data SuccessFlag Source #
Instances
| Outputable SuccessFlag Source # | |
Defined in GHC.Types.Basic Methods ppr :: SuccessFlag -> SDoc Source # | |
| Semigroup SuccessFlag Source # | |
Defined in GHC.Types.Basic Methods (<>) :: SuccessFlag -> SuccessFlag -> SuccessFlag Source # sconcat :: NonEmpty SuccessFlag -> SuccessFlag Source # stimes :: Integral b => b -> SuccessFlag -> SuccessFlag Source # | |
succeeded :: SuccessFlag -> Bool Source #
failed :: SuccessFlag -> Bool Source #
successIf :: Bool -> SuccessFlag Source #
data IntWithInf Source #
An integer or infinity
Instances
infinity :: IntWithInf Source #
A representation of infinity
treatZeroAsInf :: Int -> IntWithInf Source #
Turn a positive number into an IntWithInf, where 0 represents infinity
subWithInf :: IntWithInf -> Int -> IntWithInf Source #
Subtract an Int from an IntWithInf
mkIntWithInf :: Int -> IntWithInf Source #
Inject any integer into an IntWithInf
intGtLimit :: Int -> IntWithInf -> Bool Source #
data TypeOrKind Source #
Flag to see whether we're type-checking terms or kind-checking types
Instances
| Outputable TypeOrKind Source # | |
Defined in GHC.Types.Basic Methods ppr :: TypeOrKind -> SDoc Source # | |
| Eq TypeOrKind Source # | |
Defined in GHC.Types.Basic Methods (==) :: TypeOrKind -> TypeOrKind -> Bool Source # (/=) :: TypeOrKind -> TypeOrKind -> Bool Source # | |
isTypeLevel :: TypeOrKind -> Bool Source #
isKindLevel :: TypeOrKind -> Bool Source #
Instances
| Binary Levity Source # | |
| Outputable Levity Source # | |
| Eq Levity Source # | |
| Ord Levity Source # | |
| Data Levity Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Levity -> c Levity Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Levity Source # toConstr :: Levity -> Constr Source # dataTypeOf :: Levity -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Levity) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Levity) Source # gmapT :: (forall b. Data b => b -> b) -> Levity -> Levity Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Levity -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Levity -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Levity -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Levity -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Levity -> m Levity Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Levity -> m Levity Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Levity -> m Levity Source # | |
| Show Levity Source # | |
data TypeOrConstraint Source #
Constructors
| TypeLike | |
| ConstraintLike |
Instances
data TyConFlavour tc Source #
Paints a picture of what a TyCon represents, in broad strokes.
This is used towards more informative error messages.
Constructors
Instances
| Functor TyConFlavour Source # | |
Defined in GHC.Types.Basic Methods fmap :: (a -> b) -> TyConFlavour a -> TyConFlavour b Source # (<$) :: a -> TyConFlavour b -> TyConFlavour a Source # | |
| Outputable (TyConFlavour tc) Source # | |
Defined in GHC.Types.Basic Methods ppr :: TyConFlavour tc -> SDoc Source # | |
| Eq tc => Eq (TyConFlavour tc) Source # | |
Defined in GHC.Types.Basic Methods (==) :: TyConFlavour tc -> TyConFlavour tc -> Bool Source # (/=) :: TyConFlavour tc -> TyConFlavour tc -> Bool Source # | |
| Data tc => Data (TyConFlavour tc) Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyConFlavour tc -> c (TyConFlavour tc) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (TyConFlavour tc) Source # toConstr :: TyConFlavour tc -> Constr Source # dataTypeOf :: TyConFlavour tc -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (TyConFlavour tc)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (TyConFlavour tc)) Source # gmapT :: (forall b. Data b => b -> b) -> TyConFlavour tc -> TyConFlavour tc Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyConFlavour tc -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyConFlavour tc -> r Source # gmapQ :: (forall d. Data d => d -> u) -> TyConFlavour tc -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> TyConFlavour tc -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyConFlavour tc -> m (TyConFlavour tc) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyConFlavour tc -> m (TyConFlavour tc) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyConFlavour tc -> m (TyConFlavour tc) Source # | |
data TypeOrData Source #
Whether something is a type or a data declaration, e.g. a type family or a data family.
Instances
| Outputable TypeOrData Source # | |
Defined in GHC.Types.Basic Methods ppr :: TypeOrData -> SDoc Source # | |
| Eq TypeOrData Source # | |
Defined in GHC.Types.Basic Methods (==) :: TypeOrData -> TypeOrData -> Bool Source # (/=) :: TypeOrData -> TypeOrData -> Bool Source # | |
| Data TypeOrData Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TypeOrData -> c TypeOrData Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TypeOrData Source # toConstr :: TypeOrData -> Constr Source # dataTypeOf :: TypeOrData -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TypeOrData) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeOrData) Source # gmapT :: (forall b. Data b => b -> b) -> TypeOrData -> TypeOrData Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TypeOrData -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TypeOrData -> r Source # gmapQ :: (forall d. Data d => d -> u) -> TypeOrData -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> TypeOrData -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> TypeOrData -> m TypeOrData Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeOrData -> m TypeOrData Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TypeOrData -> m TypeOrData Source # | |
When we only care whether a data-type declaration is `data` or `newtype`, but not what constructors it has.
Instances
| Outputable NewOrData Source # | |
| Eq NewOrData Source # | |
| Data NewOrData Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NewOrData -> c NewOrData Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NewOrData Source # toConstr :: NewOrData -> Constr Source # dataTypeOf :: NewOrData -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NewOrData) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NewOrData) Source # gmapT :: (forall b. Data b => b -> b) -> NewOrData -> NewOrData Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r Source # gmapQ :: (forall d. Data d => d -> u) -> NewOrData -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> NewOrData -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData Source # | |
tyConFlavourAssoc_maybe :: TyConFlavour tc -> Maybe tc Source #
Get the enclosing class TyCon (if there is one) for the given TyConFlavour
data NonStandardDefaultingStrategy Source #
Specify whether to default type variables of kind RuntimeRepLevityMultiplicity.
Constructors
| DefaultNonStandardTyVars | Default type variables of the given kinds: |
| TryNotToDefaultNonStandardTyVars | Try not to default type variables of the kinds Note that these might get defaulted anyway, if they are kind variables and `-XNoPolyKinds` is enabled. |
Instances
| Outputable NonStandardDefaultingStrategy Source # | |
Defined in GHC.Types.Basic Methods | |
data DefaultingStrategy Source #
Specify whether to default kind variables, and type variables
of kind RuntimeRepLevityMultiplicity.
Constructors
| DefaultKindVars | Default kind variables:
When this strategy is used, it means that we have determined that the variables we are considering defaulting are all kind variables. Usually, we pass this option when -XNoPolyKinds is enabled. |
| NonStandardDefaulting NonStandardDefaultingStrategy | Default (or don't default) non-standard variables, of kinds
|
Instances
| Outputable DefaultingStrategy Source # | |
Defined in GHC.Types.Basic Methods ppr :: DefaultingStrategy -> SDoc Source # | |
data ForeignSrcLang Source #
Foreign formats supported by GHC via TH
Constructors
| LangC | C |
| LangCxx | C++ |
| LangObjc | Objective C |
| LangObjcxx | Objective C++ |
| LangAsm | Assembly language (.s) |
| LangJs | JavaScript |
| RawObject | Object (.o) |
Instances
data ImportLevel Source #
ImportLevel
Constructors
| NormalLevel | |
| SpliceLevel | |
| QuoteLevel |
Instances
| Binary ImportLevel Source # | |
Defined in GHC.Types.Basic Methods put_ :: WriteBinHandle -> ImportLevel -> IO () Source # put :: WriteBinHandle -> ImportLevel -> IO (Bin ImportLevel) Source # get :: ReadBinHandle -> IO ImportLevel Source # | |
| Outputable ImportLevel Source # | |
Defined in GHC.Types.Basic Methods ppr :: ImportLevel -> SDoc Source # | |
| Eq ImportLevel Source # | |
Defined in GHC.Types.Basic Methods (==) :: ImportLevel -> ImportLevel -> Bool Source # (/=) :: ImportLevel -> ImportLevel -> Bool Source # | |
| Ord ImportLevel Source # | |
Defined in GHC.Types.Basic Methods compare :: ImportLevel -> ImportLevel -> Ordering Source # (<) :: ImportLevel -> ImportLevel -> Bool Source # (<=) :: ImportLevel -> ImportLevel -> Bool Source # (>) :: ImportLevel -> ImportLevel -> Bool Source # (>=) :: ImportLevel -> ImportLevel -> Bool Source # max :: ImportLevel -> ImportLevel -> ImportLevel Source # min :: ImportLevel -> ImportLevel -> ImportLevel Source # | |
| Data ImportLevel Source # | |
Defined in GHC.Types.Basic Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportLevel -> c ImportLevel Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportLevel Source # toConstr :: ImportLevel -> Constr Source # dataTypeOf :: ImportLevel -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportLevel) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportLevel) Source # gmapT :: (forall b. Data b => b -> b) -> ImportLevel -> ImportLevel Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportLevel -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportLevel -> r Source # gmapQ :: (forall d. Data d => d -> u) -> ImportLevel -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportLevel -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportLevel -> m ImportLevel Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportLevel -> m ImportLevel Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportLevel -> m ImportLevel Source # | |
| Bounded ImportLevel Source # | |
Defined in GHC.Types.Basic | |
| Enum ImportLevel Source # | |
Defined in GHC.Types.Basic Methods succ :: ImportLevel -> ImportLevel Source # pred :: ImportLevel -> ImportLevel Source # toEnum :: Int -> ImportLevel Source # fromEnum :: ImportLevel -> Int Source # enumFrom :: ImportLevel -> [ImportLevel] Source # enumFromThen :: ImportLevel -> ImportLevel -> [ImportLevel] Source # enumFromTo :: ImportLevel -> ImportLevel -> [ImportLevel] Source # enumFromThenTo :: ImportLevel -> ImportLevel -> ImportLevel -> [ImportLevel] Source # | |
| Show ImportLevel Source # | |
Defined in GHC.Types.Basic | |
Orphan instances
| Binary Boxity Source # | |
| Binary PromotionFlag Source # | |
Methods put_ :: WriteBinHandle -> PromotionFlag -> IO () Source # put :: WriteBinHandle -> PromotionFlag -> IO (Bin PromotionFlag) Source # get :: ReadBinHandle -> IO PromotionFlag Source # | |
| Outputable Boxity Source # | |
| Outputable PromotionFlag Source # | |
Methods ppr :: PromotionFlag -> SDoc Source # | |