Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. lookup :: (Eq k, Hashable k) => HashTable s k v -> k -> ST s (Maybe v)

    hashtables Data.HashTable.ST.Basic

    See the documentation for this function in lookup.

  2. lookup :: (Eq k, Hashable k) => HashTable s k v -> k -> ST s (Maybe v)

    hashtables Data.HashTable.ST.Cuckoo

    See the documentation for this function in lookup.

  3. lookup :: (Eq k, Hashable k) => HashTable s k v -> k -> ST s (Maybe v)

    hashtables Data.HashTable.ST.Linear

    See the documentation for this function in Data.HashTable.Class#v:lookup.

  4. lookup :: TarIndex -> FilePath -> Maybe TarIndexEntry

    tar Codec.Archive.Tar.Index

    Look up a given filepath in the TarIndex. It may return a TarFileEntry containing the TarEntryOffset of the file within the tar file, or if the filepath identifies a directory then it returns a TarDir containing the list of files within that directory. Given the TarEntryOffset you can then use one of the I/O operations:

  5. lookup :: Key a -> Vault -> Maybe a

    vault Data.Vault.Lazy

    Lookup the value of a key in the vault.

  6. lookup :: Key s a -> Vault s -> Maybe a

    vault Data.Vault.ST.Lazy

    Lookup the value of a key in the vault.

  7. lookup :: Key s a -> Vault s -> Maybe a

    vault Data.Vault.ST.Strict

    Lookup the value of a key in the vault.

  8. lookup :: Key a -> Vault -> Maybe a

    vault Data.Vault.Strict

    Lookup the value of a key in the vault.

  9. lookup :: IsNode a => Key a -> Graph a -> Maybe a

    Cabal-syntax Distribution.Compat.Graph

    O(log V). Lookup the node at a key in the graph.

  10. lookup :: Eq a => a -> [(a, b)] -> Maybe b

    Cabal-syntax Distribution.Compat.Prelude

    No documentation available.

Page 5 of many | Previous | Next