Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

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

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

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

  4. lookup :: Int -> IntPSQ p v -> Maybe (p, v)

    psqueues Data.IntPSQ

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

  5. lookup :: Ord k => k -> OrdPSQ k p v -> Maybe (p, v)

    psqueues Data.OrdPSQ

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

  6. lookup :: FastMutableIntMap a -> Int -> IO (Maybe a)

    reflex Data.FastMutableIntMap

    Attempt to lookup an element by key in a FastMutableIntMap

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

    basic-prelude BasicPrelude

    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 :: Location -> BorderMap a -> Maybe a

    brick Brick.BorderMap

    Look up a single position.

  9. lookup :: Int -> IMap a -> Maybe a

    brick Data.IMap

    No documentation available.

  10. lookup :: forall (m :: Type -> Type) a . Monad m => Focus a m (Maybe a)

    focus Focus

    Reproduces the behaviour of Data.Map.lookup.

Page 8 of many | Previous | Next