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.

  1. lookupUniqueInstEnv :: InstEnvs -> Class -> [Type] -> Either LookupInstanceErrReason (ClsInst, [Type])

    ghc GHC.Core.InstEnv

    Look up an instance in the given instance environment. The given class application must match exactly one instance and the match may not contain any flexi type variables. If the lookup is unsuccessful, yield 'Left errorMessage'.

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

    ghc GHC.Core.Map.Expr

    No documentation available.

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

    ghc GHC.Core.Map.Expr

    No documentation available.

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

    ghc GHC.Core.Map.Type

    No documentation available.

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

    ghc GHC.Core.Map.Type

    No documentation available.

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

    ghc GHC.Core.Map.Type

    No documentation available.

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

    ghc GHC.Core.Map.Type

    No documentation available.

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

    ghc GHC.Core.Opt.Simplify.Env

    No documentation available.

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

    ghc GHC.Core.RoughMap

    Order of result is deterministic.

  10. 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]

Page 42 of many | Previous | Next