Class

Documentation

data Class

Instances

Eq Class

Methods

(==) :: Class -> Class -> Bool

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

Data Class

Methods

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

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

toConstr :: Class -> Constr

dataTypeOf :: Class -> DataType

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

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

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

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

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

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

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

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

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

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

Outputable Class

Methods

ppr :: Class -> SDoc

pprPrec :: Rational -> Class -> SDoc

Uniquable Class

Methods

getUnique :: Class -> Unique

NamedThing Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

type ClassOpItem = (Id, DefMethInfo)

data ClassATItem

Constructors

ATI TyCon (Maybe (Type, SrcSpan))

type ClassMinimalDef = BooleanFormula Name

type DefMethInfo = Maybe (Name, DefMethSpec Type)

pprDefMethInfo :: DefMethInfo -> SDoc

type FunDep a = ([a], [a])

pprFundeps :: Outputable a => [FunDep a] -> SDoc

pprFunDep :: Outputable a => FunDep a -> SDoc

mkClass :: Name -> [TyVar] -> [FunDep TyVar] -> [PredType] -> [Id] -> [ClassATItem] -> [ClassOpItem] -> ClassMinimalDef -> TyCon -> Class

mkAbstractClass :: Name -> [TyVar] -> [FunDep TyVar] -> TyCon -> Class

classTyVars :: Class -> [TyVar]

classArity :: Class -> Arity

classKey :: Class -> Unique

className :: Class -> Name

classATs :: Class -> [TyCon]

classATItems :: Class -> [ClassATItem]

classTyCon :: Class -> TyCon

classMethods :: Class -> [Id]

classOpItems :: Class -> [ClassOpItem]

classBigSig :: Class -> ([TyVar], [PredType], [Id], [ClassOpItem])

classExtraBigSig :: Class -> ([TyVar], [FunDep TyVar], [PredType], [Id], [ClassATItem], [ClassOpItem])

classTvsFds :: Class -> ([TyVar], [FunDep TyVar])

classSCTheta :: Class -> [PredType]

classAllSelIds :: Class -> [Id]

classSCSelId :: Class -> Int -> Id

classMinimalDef :: Class -> ClassMinimalDef

classHasFds :: Class -> Bool

isAbstractClass :: Class -> Bool

naturallyCoherentClass :: Class -> Bool

If a class is "naturally coherent", then we needn't worry at all, in any way, about overlapping/incoherent instances. Just solve the thing!