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.

  1. lookupSolvedDict :: InertSet -> CtLoc -> Class -> [Type] -> Maybe CtEvidence

    ghc-lib GHC.Tc.Solver.Monad

    Look up a solved inert.

  2. lookupGlobal :: HscEnv -> Name -> IO TyThing

    ghc-lib GHC.Tc.Utils.Env

    No documentation available.

  3. lookupGlobal_maybe :: HscEnv -> Name -> IO (MaybeErr (Either Name IfaceMessage) TyThing)

    ghc-lib GHC.Tc.Utils.Env

    No documentation available.

  4. lookupTyVarX :: TcTyVar -> ZonkTcM TyVar

    ghc-lib GHC.Tc.Zonk.Type

    No documentation available.

  5. lookupFileCache :: FinderCache -> FilePath -> IO Fingerprint

    ghc-lib GHC.Unit.Finder

    Look for the hash of a file in the cache. This should add it to the cache. If the file doesn't exist, raise an IOException.

  6. lookupFinderCache :: FinderCache -> InstalledModuleWithIsBoot -> IO (Maybe InstalledFindResult)

    ghc-lib GHC.Unit.Finder

    Look for a location in the cache.

  7. lookupByCoord :: Extent -> Coord -> QuadTree a -> Maybe a

    gloss-algorithms Graphics.Gloss.Data.QuadTree

    Lookup a node if a tree given a coordinate which it contains.

  8. lookupByPath :: [Quad] -> QuadTree a -> Maybe a

    gloss-algorithms Graphics.Gloss.Data.QuadTree

    Lookup an element based given a path to it.

  9. lookupNodeByPath :: [Quad] -> QuadTree a -> Maybe (QuadTree a)

    gloss-algorithms Graphics.Gloss.Data.QuadTree

    Lookup a node based on a path to it.

  10. lookupMax :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))

    haskey-btree Data.BTree.Impure

    The maximal key of the map, returns Nothing if the map is empty.

Page 159 of many | Previous | Next