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 :: (Ord a, Ord b, MonadThrow m) => a -> Bimap a b -> m b

    bimap Data.Bimap

    O(log n). Lookup a left key in the bimap, returning the associated right key. This function will return the result in the monad, or fail if the value isn't in the bimap. Note that the signature differs slightly from Data.Map's lookup. This one is more general - it functions the same way as the "original" if m is cast (or inferred) to Maybe. Version: 0.2

  2. lookup :: (Val v, MonadFail m) => Label -> Document -> m v

    bson Data.Bson

    Lookup value of field in document and cast to expected type. Fail (Nothing) if field not found or value not of expected type.

  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