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 :: (Hashable key, Hashable value) => value -> key -> Multimap key value -> STM Bool

    stm-containers StmContainers.Multimap

    Look up an item by a value and a key.

  2. lookup :: Hashable item => item -> Set item -> STM Bool

    stm-containers StmContainers.Set

    Lookup an element.

  3. lookup :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m (Maybe v)

    vector-hashtables Data.Vector.Hashtables

    O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Like lookup' but return Nothing if value not found.

  4. lookup :: forall (ks :: Type -> Type -> Type) k (vs :: Type -> Type -> Type) v m . (MVector ks k, MVector vs v, PrimMonad m, Hashable k, Eq k) => Dictionary (PrimState m) ks k vs v -> k -> m (Maybe v)

    vector-hashtables Data.Vector.Hashtables.Internal

    O(1) in the best case, O(n) in the worst case. Find value by given key in Dictionary. Like lookup' but return Nothing if value not found.

  5. lookup :: FilePath -> ContentTypes -> Maybe Text

    xlsx Codec.Xlsx.Types.Internal.ContentTypes

    No documentation available.

  6. lookup :: RefId -> Relationships -> Maybe Relationship

    xlsx Codec.Xlsx.Types.Internal.Relationships

    No documentation available.

  7. lookup :: Attribute name => Name name -> [T name string] -> Maybe string

    xml-basic Text.XML.Basic.Attribute

    No documentation available.

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

    LambdaHack Game.LambdaHack.Core.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"

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

    LambdaHack Game.LambdaHack.Core.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 :: Ord k => k -> PSQ k p -> Maybe p

    PSQueue Data.PSQueue

    O(log n) The priority of a given key, or Nothing if the key is not bound.

Page 12 of many | Previous | Next