Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

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

    ghc-internal GHC.Internal.Data.OldList

    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"

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

    ghc-internal GHC.Internal.List

    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"

  3. lookup :: Eq a => a -> Infinite (a, b) -> b

    infinite-list Data.List.Infinite

    Find the first pair, whose first component is equal to the first argument, and return the second component. If there is nothing to be found, this function will hang indefinitely.

  4. lookup :: IsMap k m => k -> m a -> Maybe a

    morpheus-graphql-core Data.Morpheus.Internal.Utils

    No documentation available.

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

    numeric-prelude NumericPrelude

    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 :: Eq a => a -> [(a, b)] -> Maybe b

    numeric-prelude NumericPrelude.Base

    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"

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

    numhask NumHask.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"

  8. lookup :: forall (n :: Natural) a . Fin n -> FinMap n a -> Maybe a

    parameterized-utils Data.Parameterized.FinMap.Safe

    O(log n). Fetch the value at the given key in the map.

  9. lookup :: forall (n :: Natural) a . Fin n -> FinMap n a -> Maybe a

    parameterized-utils Data.Parameterized.FinMap.Unsafe

    O(min(n,W)). Fetch the value at the given key in the map.

  10. lookup :: (Ord k, Hashable k, Ord p) => k -> HashPSQ k p v -> Maybe (p, v)

    psqueues Data.HashPSQ

    O(min(n,W)) The priority and value of a given key, or Nothing if the key is not bound.

Page 7 of many | Previous | Next