Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupTyVarX :: TcTyVar -> ZonkTcM TyVarghc-lib GHC.Tc.Zonk.Type No documentation available.
lookupFileCache :: FinderCache -> FilePath -> IO Fingerprintghc-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.
lookupFinderCache :: FinderCache -> InstalledModuleWithIsBoot -> IO (Maybe InstalledFindResult)ghc-lib GHC.Unit.Finder Look for a location in the cache.
lookupByCoord :: Extent -> Coord -> QuadTree a -> Maybe agloss-algorithms Graphics.Gloss.Data.QuadTree Lookup a node if a tree given a coordinate which it contains.
lookupByPath :: [Quad] -> QuadTree a -> Maybe agloss-algorithms Graphics.Gloss.Data.QuadTree Lookup an element based given a path to it.
lookupNodeByPath :: [Quad] -> QuadTree a -> Maybe (QuadTree a)gloss-algorithms Graphics.Gloss.Data.QuadTree Lookup a node based on a path to it.
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.
lookupMin :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))haskey-btree Data.BTree.Impure The minimal key of the map, returns Nothing if the map is empty.
lookupMax :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))haskey-btree Data.BTree.Impure.Internal.Lookup The maximal key of the map, returns Nothing if the map is empty.
lookupMin :: (AllocReaderM m, Key key, Value val) => Tree key val -> m (Maybe (key, val))haskey-btree Data.BTree.Impure.Internal.Lookup The minimal key of the map, returns Nothing if the map is empty.