GHC.Tc.Solver.InertSet · ghc-9.14.1

The work list

12 declarations

datadata WorkList

#

Constructors

WL
- wl_eqs_N :: [Ct]
- wl_eqs_X :: [Ct]
- wl_rw_eqs :: [Ct]
- wl_rest :: [Ct]

Instances1Outputable

Outputable WorkListDefined in ghc-9.14.1 · GHC.Tc.Solver.InertSet

valueisEmptyWorkList :: WorkList -> Bool

#

valueemptyWorkList :: WorkList

#

valueextendWorkListNonEq :: Ct -> WorkList -> WorkList

#

valueextendWorkListCt :: Ct -> WorkList -> WorkList

#

valueextendWorkListCts :: Cts -> WorkList -> WorkList

#

valueextendWorkListCtList :: [Ct] -> WorkList -> WorkList

#

valueextendWorkListEq :: RewriterSet -> Ct -> WorkList -> WorkList

#

valueextendWorkListChildEqs :: CtEvidence -> Bag Ct -> WorkList -> WorkList

#

valueextendWorkListRewrittenEqs :: [EqCt] -> WorkList -> WorkList

#

valueappendWorkList :: WorkList -> WorkList -> WorkList

#

valueworkListSize :: WorkList -> Int

#

The inert set

7 declarations

datadata InertSet

#

Constructors

IS
- inert_cans :: InertCans
- inert_givens :: InertCans
- inert_cycle_breakers :: CycleBreakerVarStack
- inert_famapp_cache :: FunEqMap Reduction
- inert_solved_dicts :: DictMap DictCt
- inert_safehask :: DictMap DictCt
  See Note [Safe Haskell Overlapping Instances Implementation] in GHC.Tc.Solver

Instances1Outputable

Outputable InertSetDefined in ghc-9.14.1 · GHC.Tc.Solver.InertSet

datadata InertCans

#

Constructors

IC
- inert_eqs :: InertEqs
- inert_funeqs :: InertFunEqs
- inert_dicts :: DictMap DictCt
- inert_qcis :: [QCInst]
- inert_irreds :: InertIrreds
- inert_given_eq_lvl :: TcLevel
- inert_given_eqs :: Bool

Instances1Outputable

Outputable InertCansDefined in ghc-9.14.1 · GHC.Tc.Solver.InertSet

valueemptyInertSet :: TcLevel -> InertSet

#

valueemptyInertCans :: TcLevel -> InertCans

#

valuenoGivenNewtypeReprEqs :: TyCon -> InertSet -> Bool

#

valueupdGivenEqs :: TcLevel -> Ct -> InertCans -> InertCans

#

valueprohibitedSuperClassSolve

:: CtLoc
is it loopy to use this one ...
-> CtLoc
... to solve this one?
-> Bool
True ==> don't solve it

#

Is it (potentially) loopy to use the first ct1 to solve ct2?

Necessary (but not sufficient) conditions for this function to return True:

ct1 and ct2 both arise from superclass expansion,
ct1 is a Given and ct2 is a Wanted.

See Note [Solving superclass constraints] in GHC.Tc.TyCl.Instance, (sc2).

Inert equalities

10 declarations

typetype InertEqs = DTyVarEnv EqualCtList

#

valuefoldTyEqs :: (EqCt -> b -> b) -> InertEqs -> b -> b

#

valuedelEq :: EqCt -> InertCans -> InertCans

#

valuefindEq :: InertCans -> CanEqLHS -> [EqCt]

#

valuepartitionInertEqs :: (EqCt -> Bool) -> InertEqs -> ([EqCt], InertEqs)

#

valuepartitionFunEqs :: (EqCt -> Bool) -> InertFunEqs -> ([EqCt], InertFunEqs)

#

valuefilterInertEqs :: (EqCt -> Bool) -> InertEqs -> InertEqs

#

Filter InertEqs according to a predicate

valuefilterFunEqs :: (EqCt -> Bool) -> InertFunEqs -> InertFunEqs

#

Filter entries in InertFunEqs that satisfy the predicate

valuefoldFunEqs :: (EqCt -> b -> b) -> FunEqMap EqualCtList -> b -> b

#

valueaddEqToCans :: TcLevel -> EqCt -> InertCans -> InertCans

#

Inert Dicts

8 declarations

valueupdDicts :: (DictMap DictCt -> DictMap DictCt) -> InertCans -> InertCans

#

valuedelDict :: DictCt -> DictMap a -> DictMap a

#

valueaddDict :: DictCt -> DictMap DictCt -> DictMap DictCt

#

valuefilterDicts :: (DictCt -> Bool) -> DictMap DictCt -> DictMap DictCt

#

valuepartitionDicts

#

valueaddSolvedDict :: DictCt -> DictMap DictCt -> DictMap DictCt

#

valuelookupSolvedDict :: InertSet -> Class -> [Type] -> Maybe CtEvidence

#

Look up a solved inert.

valuelookupInertDict :: InertCans -> Class -> [Type] -> Maybe DictCt

#

Look up a dictionary inert.

Inert Irreds

8 declarations

typetype InertIrreds = Bag IrredCt

#

valuedelIrred :: IrredCt -> InertCans -> InertCans

#

valueaddIrreds :: [IrredCt] -> InertIrreds -> InertIrreds

#

valueaddIrred :: IrredCt -> InertIrreds -> InertIrreds

#

valuefoldIrreds :: (IrredCt -> b -> b) -> InertIrreds -> b -> b

#

valuefindMatchingIrreds

:: InertIrreds
-> CtEvidence
-> (Bag (IrredCt, SwapFlag), InertIrreds)

#

valueupdIrreds :: (InertIrreds -> InertIrreds) -> InertCans -> InertCans

#

valueaddIrredToCans :: TcLevel -> IrredCt -> InertCans -> InertCans

#

Kick-out

2 declarations

datadata KickOutSpec

#

Constructors

Instances1Outputable

Outputable KickOutSpecDefined in ghc-9.14.1 · GHC.Tc.Solver.InertSet

valuekickOutRewritableLHS

:: KickOutSpec
-> CtFlavourRole
-> InertCans
-> (Cts, InertCans)

#

Cycle breaker vars

4 declarations

typetype CycleBreakerVarStack = NonEmpty (Bag (TcTyVar, TcType))

#

valuepushCycleBreakerVarStack :: CycleBreakerVarStack -> CycleBreakerVarStack

#

Push a fresh environment onto the cycle-breaker var stack. Useful when entering a nested implication.

valueaddCycleBreakerBindings

:: Bag (TcTyVar, Type)
(cbv,expansion) pairs
-> InertSet
-> InertSet

#

Add a new cycle-breaker binding to the top environment on the stack.

valueforAllCycleBreakerBindings_

:: Monad m
=> CycleBreakerVarStack
-> TcTyVar -> TcType -> m ()
-> m ()

#

Perform a monadic operation on all pairs in the top environment in the stack.

Solving one from another

2 declarations

datadata InteractResult

#

KeepInert KeepWork

Instances1Outputable

Outputable InteractResultDefined in ghc-9.14.1 · GHC.Tc.Solver.InertSet

valuesolveOneFromTheOther :: Ct -> Ct -> InteractResult

#