when package:ghc
Returns an unfolding only if (a) not a strong loop breaker and (b)
active in according to is_active
Monadic version of when, taking the condition in the monad
Says what to do with -dppr-debug; without, return empty
A tactic for dealing with keys present in both maps in
merge or
mergeA.
A tactic of type
WhenMatched f x y z is an abstract
representation of a function of type
Key -> x -> y -> f
(Maybe z).
A tactic for dealing with keys present in one map but not the other in
merge or
mergeA.
A tactic of type
WhenMissing f k x z is an abstract
representation of a function of type
Key -> x -> f (Maybe
z).
Explain how a kind equality originated.
Display all foralls, runtime-reps, and kind information when provided
Bool argument is
True. See GHC.Tc.Errors.Ppr Note
[Showing invisible bits of types in error messages]
A tactic for dealing with keys present in both maps in
merge.
A tactic of type
SimpleWhenMatched x y z is an abstract
representation of a function of type
Key -> x -> y ->
Maybe z.
A tactic for dealing with keys present in one map but not the other in
merge.
A tactic of type
SimpleWhenMissing x z is an abstract
representation of a function of type
Key -> x -> Maybe
z.