Hoogle Search
Within LTS Haskell 24.12 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupTM :: TrieMap m => Key m -> m b -> Maybe bghc-lib-parser GHC.Core.Map.Expr No documentation available.
lookupCME :: CmEnv -> Var -> Maybe BoundVarghc-lib-parser GHC.Core.Map.Type No documentation available.
lookupTM :: TrieMap m => Key m -> m b -> Maybe bghc-lib-parser GHC.Core.Map.Type No documentation available.
lookupTypeMap :: TypeMap a -> Type -> Maybe aghc-lib-parser GHC.Core.Map.Type No documentation available.
lookupTypeMapWithScope :: TypeMap a -> CmEnv -> Type -> Maybe aghc-lib-parser GHC.Core.Map.Type No documentation available.
lookupRecBndr :: SimplEnv -> InId -> OutIdghc-lib-parser GHC.Core.Opt.Simplify.Env No documentation available.
lookupRM :: [RoughMatchLookupTc] -> RoughMap a -> [a]ghc-lib-parser GHC.Core.RoughMap Order of result is deterministic.
lookupRM' :: [RoughMatchLookupTc] -> RoughMap a -> (Bag a, [a])ghc-lib-parser GHC.Core.RoughMap N.B. Returns a Bag for matches, which allows us to avoid rebuilding all of the lists we find in rm_empty, which would otherwise be necessary due to ++ if we returned a list. We use a list for unifiers because the tail is computed lazily and we often only care about the first couple of potential unifiers. Constructing a bag forces the tail which performs much too much work. See Note [Matching a RoughMap] See Note [Matches vs Unifiers]
-
ghc-lib-parser GHC.Core.Rules The main rule matching function. Attempts to apply all (active) supplied rules to this instance of an application in a given context, returning the rule applied and the resulting expression if successful.
lookupIdSubst :: HasDebugCallStack => Subst -> Id -> CoreExprghc-lib-parser GHC.Core.Subst Find the substitution for an Id in the Subst The Id should not be a CoVar