Hoogle Search

Within LTS Haskell 24.60 (ghc-9.10.3)

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

  1. lookup :: forall t x proxy . Typeable t => proxy t -> TypeMap x -> Maybe (Item x t)

    type-map Data.TypeMap.Internal.Dynamic

    Lookup an element indexed by type t.

  2. lookup :: Typeable t => TypeMap x -> Maybe (Item x t)

    type-map Data.TypeMap.Internal.Dynamic.Alt

    Lookup an element indexed by type t.

  3. lookup :: Ord k => k -> IntervalMap k v -> Maybe v

    IntervalMap Data.IntervalMap.Generic.Lazy

    O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.

  4. lookup :: Ord k => k -> IntervalMap k v -> Maybe v

    IntervalMap Data.IntervalMap.Generic.Strict

    O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.

  5. lookup :: Ord k => k -> IntervalMap k v -> Maybe v

    IntervalMap Data.IntervalMap.Lazy

    O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.

  6. lookup :: Ord k => k -> IntervalMap k v -> Maybe v

    IntervalMap Data.IntervalMap.Strict

    O(log n). Look up the given key in the map, returning the value (Just value), or Nothing if the key is not in the map.

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

    bencoding Data.BEncode.BDict

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

  8. 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.

  9. 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"

  10. 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"

Page 24 of many | Previous | Next