ghc-lib-parser-0.20220301: The GHC API, decoupled from GHC versions

Safe Haskell	None
Language	Haskell2010

GHC.Tc.Solver.InertSet

Contents

The work list
The inert set
Inert equalities
Kick-out

Synopsis

data WorkList = WL {
- wl_eqs :: [Ct]
- wl_rest :: [Ct]
- wl_implics :: Bag Implication
}
isEmptyWorkList :: WorkList -> Bool
emptyWorkList :: WorkList
extendWorkListNonEq :: Ct -> WorkList -> WorkList
extendWorkListCt :: Ct -> WorkList -> WorkList
extendWorkListCts :: [Ct] -> WorkList -> WorkList
extendWorkListEq :: Ct -> WorkList -> WorkList
appendWorkList :: WorkList -> WorkList -> WorkList
extendWorkListImplic :: Implication -> WorkList -> WorkList
workListSize :: WorkList -> Int
selectWorkItem :: WorkList -> Maybe (Ct, WorkList)
data InertSet = IS {
- inert_cans :: InertCans
- inert_cycle_breakers :: [(TcTyVar, TcType)]
- inert_famapp_cache :: FunEqMap Reduction
- inert_solved_dicts :: DictMap CtEvidence
}
data InertCans = IC {
- inert_eqs :: InertEqs
- inert_funeqs :: FunEqMap EqualCtList
- inert_dicts :: DictMap Ct
- inert_insts :: [QCInst]
- inert_safehask :: DictMap Ct
- inert_irreds :: Cts
- inert_given_eq_lvl :: TcLevel
- inert_given_eqs :: Bool
}
type InertEqs = DTyVarEnv EqualCtList
emptyInert :: InertSet
addInertItem :: TcLevel -> InertCans -> Ct -> InertCans
matchableGivens :: CtLoc -> PredType -> InertSet -> Cts
mightEqualLater :: InertSet -> TcPredType -> CtLoc -> TcPredType -> CtLoc -> Bool
prohibitedSuperClassSolve :: CtLoc -> CtLoc -> Bool
foldTyEqs :: (Ct -> b -> b) -> InertEqs -> b -> b
delEq :: InertCans -> CanEqLHS -> TcType -> InertCans
findEq :: InertCans -> CanEqLHS -> [Ct]
partitionInertEqs :: (Ct -> Bool) -> InertEqs -> ([Ct], InertEqs)
partitionFunEqs :: (Ct -> Bool) -> FunEqMap EqualCtList -> ([Ct], FunEqMap EqualCtList)
kickOutRewritableLHS :: CtFlavourRole -> CanEqLHS -> InertCans -> (WorkList, InertCans)

The work list

data WorkList Source #

Constructors

WL
Fields wl_eqs :: [Ct] wl_rest :: [Ct] wl_implics :: Bag Implication

Instances

Instances details

Outputable WorkList Source #
Instance details Defined in GHC.Tc.Solver.InertSet Methods ppr :: WorkList -> SDoc Source #

isEmptyWorkList :: WorkList -> Bool Source #

emptyWorkList :: WorkList Source #

extendWorkListNonEq :: Ct -> WorkList -> WorkList Source #

extendWorkListCt :: Ct -> WorkList -> WorkList Source #

extendWorkListCts :: [Ct] -> WorkList -> WorkList Source #

extendWorkListEq :: Ct -> WorkList -> WorkList Source #

appendWorkList :: WorkList -> WorkList -> WorkList Source #

extendWorkListImplic :: Implication -> WorkList -> WorkList Source #

workListSize :: WorkList -> Int Source #

selectWorkItem :: WorkList -> Maybe (Ct, WorkList) Source #

The inert set

data InertSet Source #

Constructors

IS
Fields inert_cans :: InertCans inert_cycle_breakers :: [(TcTyVar, TcType)] inert_famapp_cache :: FunEqMap Reduction inert_solved_dicts :: DictMap CtEvidence

Instances

Instances details

Outputable InertSet Source #
Instance details Defined in GHC.Tc.Solver.InertSet Methods ppr :: InertSet -> SDoc Source #

data InertCans Source #

Constructors

IC
Fields inert_eqs :: InertEqs inert_funeqs :: FunEqMap EqualCtList inert_dicts :: DictMap Ct inert_insts :: [QCInst] inert_safehask :: DictMap Ct See Note [Safe Haskell Overlapping Instances Implementation] in GHC.Tc.Solver inert_irreds :: Cts inert_given_eq_lvl :: TcLevel inert_given_eqs :: Bool

Instances

Instances details

Outputable InertCans Source #
Instance details Defined in GHC.Tc.Solver.InertSet Methods ppr :: InertCans -> SDoc Source #

type InertEqs = DTyVarEnv EqualCtList Source #

emptyInert :: InertSet Source #

addInertItem :: TcLevel -> InertCans -> Ct -> InertCans Source #

matchableGivens :: CtLoc -> PredType -> InertSet -> Cts Source #

Returns Given constraints that might, potentially, match the given pred. This is used when checking to see if a Given might overlap with an instance. See Note [Instance and Given overlap] in GHC.Tc.Solver.Interact

mightEqualLater :: InertSet -> TcPredType -> CtLoc -> TcPredType -> CtLoc -> Bool Source #

prohibitedSuperClassSolve :: CtLoc -> CtLoc -> Bool Source #

Inert equalities

foldTyEqs :: (Ct -> b -> b) -> InertEqs -> b -> b Source #

delEq :: InertCans -> CanEqLHS -> TcType -> InertCans Source #

findEq :: InertCans -> CanEqLHS -> [Ct] Source #

partitionInertEqs :: (Ct -> Bool) -> InertEqs -> ([Ct], InertEqs) Source #

partitionFunEqs :: (Ct -> Bool) -> FunEqMap EqualCtList -> ([Ct], FunEqMap EqualCtList) Source #

Kick-out

kickOutRewritableLHS :: CtFlavourRole -> CanEqLHS -> InertCans -> (WorkList, InertCans) Source #