Safe Haskell	None
Language	Haskell2010

GHC.Core.PatSyn

Contents

Main data types
- Type deconstruction

Synopsis

data PatSyn
mkPatSyn :: Name -> Bool -> ([InvisTVBinder], ThetaType) -> ([InvisTVBinder], ThetaType) -> [Type] -> Type -> (Id, Bool) -> Maybe (Id, Bool) -> [FieldLabel] -> PatSyn
patSynName :: PatSyn -> Name
patSynArity :: PatSyn -> Arity
patSynIsInfix :: PatSyn -> Bool
patSynArgs :: PatSyn -> [Type]
patSynMatcher :: PatSyn -> (Id, Bool)
patSynBuilder :: PatSyn -> Maybe (Id, Bool)
patSynUnivTyVarBinders :: PatSyn -> [InvisTVBinder]
patSynExTyVars :: PatSyn -> [TyVar]
patSynExTyVarBinders :: PatSyn -> [InvisTVBinder]
patSynSig :: PatSyn -> ([TyVar], ThetaType, [TyVar], ThetaType, [Scaled Type], Type)
patSynSigBndr :: PatSyn -> ([InvisTVBinder], ThetaType, [InvisTVBinder], ThetaType, [Scaled Type], Type)
patSynInstArgTys :: PatSyn -> [Type] -> [Type]
patSynInstResTy :: PatSyn -> [Type] -> Type
patSynFieldLabels :: PatSyn -> [FieldLabel]
patSynFieldType :: PatSyn -> FieldLabelString -> Type
updatePatSynIds :: (Id -> Id) -> PatSyn -> PatSyn
pprPatSynType :: PatSyn -> SDoc

Main data types

data PatSyn Source #

Pattern Synonym

See Note [Pattern synonym representation] See Note [Pattern synonym signature contexts]

Instances

Instances details

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

mkPatSyn Source #

Arguments

:: Name
-> Bool	Is the pattern synonym declared infix?
-> ([InvisTVBinder], ThetaType)	Universially-quantified type variables and required dicts
-> ([InvisTVBinder], ThetaType)	Existentially-quantified type variables and provided dicts
-> [Type]	Original arguments
-> Type	Original result type
-> (Id, Bool)	Name of matcher
-> Maybe (Id, Bool)	Name of builder
-> [FieldLabel]	Names of fields for a record pattern synonym
-> PatSyn