Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. lookupCoreMap :: CoreMap a -> CoreExpr -> Maybe a

   ghc	GHC.Core.Map.Expr

   No documentation available.

2. lookupTM :: TrieMap m => Key m -> m b -> Maybe b

   ghc	GHC.Core.Map.Expr

   No documentation available.

3. lookupCME :: CmEnv -> Var -> Maybe BoundVar

   ghc	GHC.Core.Map.Type

   No documentation available.

4. lookupTM :: TrieMap m => Key m -> m b -> Maybe b

   ghc	GHC.Core.Map.Type

   No documentation available.

5. lookupTypeMap :: TypeMap a -> Type -> Maybe a

   ghc	GHC.Core.Map.Type

   No documentation available.

6. lookupTypeMapWithScope :: TypeMap a -> CmEnv -> Type -> Maybe a

   ghc	GHC.Core.Map.Type

   No documentation available.

7. lookupRecBndr :: SimplEnv -> InId -> OutId

   ghc	GHC.Core.Opt.Simplify.Env

   No documentation available.

8. lookupRM :: [RoughMatchLookupTc] -> RoughMap a -> [a]

   ghc	GHC.Core.RoughMap

   Order of result is deterministic.

9. lookupRM' :: [RoughMatchLookupTc] -> RoughMap a -> (Bag a, [a])

   ghc	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]

10. lookupRule :: RuleOpts -> InScopeEnv -> (Activation -> Bool) -> Id -> [CoreExpr] -> [CoreRule] -> Maybe (CoreRule, CoreExpr)

    ghc	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.

Page 44 of many | Previous | Next