GHC.Tc.Solver.Types

Utility types used within the constraint solver

Documentation

type DictMap a = TcAppMap a

emptyDictMap :: DictMap a

findDictsByClass :: DictMap a -> Class -> Bag a

addDict :: DictMap a -> Class -> [Type] -> a -> DictMap a

addDictsByClass :: DictMap Ct -> Class -> Bag Ct -> DictMap Ct

delDict :: DictMap a -> Class -> [Type] -> DictMap a

foldDicts :: (a -> b -> b) -> DictMap a -> b -> b

filterDicts :: (Ct -> Bool) -> DictMap Ct -> DictMap Ct

findDict :: DictMap a -> CtLoc -> Class -> [Type] -> Maybe a

dictsToBag :: DictMap a -> Bag a

partitionDicts :: (Ct -> Bool) -> DictMap Ct -> (Bag Ct, DictMap Ct)

type FunEqMap a = TcAppMap a

emptyFunEqs :: TcAppMap a

foldFunEqs :: (a -> b -> b) -> FunEqMap a -> b -> b

findFunEq :: FunEqMap a -> TyCon -> [Type] -> Maybe a

insertFunEq :: FunEqMap a -> TyCon -> [Type] -> a -> FunEqMap a

findFunEqsByTyCon :: FunEqMap a -> TyCon -> [a]

type TcAppMap a = DTyConEnv (ListMap LooseTypeMap a)

emptyTcAppMap :: TcAppMap a

isEmptyTcAppMap :: TcAppMap a -> Bool

insertTcApp :: TcAppMap a -> TyCon -> [Type] -> a -> TcAppMap a

alterTcApp :: forall a. TcAppMap a -> TyCon -> [Type] -> XT a -> TcAppMap a

filterTcAppMap :: forall a. (a -> Bool) -> TcAppMap a -> TcAppMap a

tcAppMapToBag :: TcAppMap a -> Bag a

foldTcAppMap :: (a -> b -> b) -> TcAppMap a -> b -> b

type EqualCtList = [Ct]

filterEqualCtList :: (Ct -> Bool) -> EqualCtList -> Maybe EqualCtList

addToEqualCtList :: Ct -> EqualCtList -> EqualCtList