GHC.Tc.Solver.InertSet · ghc-9.10.3

Returns True iff there are no Given constraints that might, potentially, match the given class constraint. 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.Dict

valuenoGivenNewtypeReprEqs :: TyCon -> InertSet -> Bool

#

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

#

valuemightEqualLater

:: InertSet
-> TcPredType
-> CtLoc
-> TcPredType
-> CtLoc
-> Maybe Subst

#

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

8 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)

#

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

#

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

#

Inert Dicts

6 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

#

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

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.10.3 · GHC.Tc.Solver.InertSet

valuesolveOneFromTheOther :: Ct -> Ct -> InteractResult

#