Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. lookup :: BKey -> BDictMap a -> Maybe a

    bencoding Data.BEncode.BDict

    O(n). Lookup the value at a key in the dictionary.

  2. lookup :: IsMap map => ContainerKey map -> map -> Maybe (MapValue map)

    classy-prelude-yesod ClassyPrelude.Yesod

    Look up a value in a map with a specified key.

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

    constrained-categories Control.Category.Constrained.Prelude

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

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

    constrained-categories Control.Category.Hask

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

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

    copilot-language Copilot.Language.Prelude

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

  6. lookup :: (OverloadedLookup t k v, Show k, Show t, MonadFail m, Applicative m) => k -> t -> m v

    error-or-utils Data.ErrorOr.Utils

    Overloaded lookup with good error messages.

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

    haskey-btree Data.BTree.Impure

    Lookup a value in an impure B+-tree.

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

    haskey-btree Data.BTree.Impure.Internal.Lookup

    Lookup a value in an impure B+-tree.

  9. lookup :: Key k => k -> Tree k v -> Maybe v

    haskey-btree Data.BTree.Pure

    Lookup a value in the tree.

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

    listsafe Data.List.Safe

    lookup key assocs looks up a key in an association list. For the result to be Nothing, the list must be finite.

    Examples

    >>> lookup 2 []
Nothing

    >>> lookup 2 [(1, "first")]
Nothing

    >>> lookup 2 [(1, "first"), (2, "second"), (3, "third")]
Just "second"

Page 24 of many | Previous | Next