Safe Haskell | None |
---|---|
Language | GHC2021 |
COMPLETE signature
Synopsis
- data CompleteMatchX con = CompleteMatch {
- cmConLikes :: UniqDSet con
- cmResultTyCon :: Maybe Name
- type CompleteMatch = CompleteMatchX Name
- type CompleteMatches = [CompleteMatch]
- type DsCompleteMatch = CompleteMatchX ConLike
- type DsCompleteMatches = [DsCompleteMatch]
- mkCompleteMatch :: UniqDSet con -> Maybe Name -> CompleteMatchX con
- vanillaCompleteMatch :: UniqDSet con -> CompleteMatchX con
- completeMatchAppliesAtType :: Type -> CompleteMatchX con -> Bool
Documentation
data CompleteMatchX con Source #
A list of conlikes which represents a complete pattern match.
These arise from COMPLETE
signatures.
See also Note [Implementation of COMPLETE pragmas].
CompleteMatch | |
|
Instances
Outputable con => Outputable (CompleteMatchX con) Source # | |
Defined in GHC.Types.CompleteMatch ppr :: CompleteMatchX con -> SDoc Source # | |
Eq (CompleteMatchX con) Source # | |
Defined in GHC.Types.CompleteMatch (==) :: CompleteMatchX con -> CompleteMatchX con -> Bool # (/=) :: CompleteMatchX con -> CompleteMatchX con -> Bool # |
type CompleteMatch = CompleteMatchX Name Source #
type CompleteMatches = [CompleteMatch] Source #
type DsCompleteMatch = CompleteMatchX ConLike Source #
type DsCompleteMatches = [DsCompleteMatch] Source #
mkCompleteMatch :: UniqDSet con -> Maybe Name -> CompleteMatchX con Source #
vanillaCompleteMatch :: UniqDSet con -> CompleteMatchX con Source #
completeMatchAppliesAtType :: Type -> CompleteMatchX con -> Bool Source #
Does this COMPLETE
set apply at this type?
See the part about "result type constructors" in Note [Implementation of COMPLETE pragmas] in GHC.HsToCore.Pmc.Solver.