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 a (m :: Type -> Type) b . (Eq a, Monad m) => a -> Fold m (a, b) (Maybe b)

    streamly-core Streamly.Internal.Data.Fold

    In a stream of (key-value) pairs (a, b), return the value b of the first pair where the key equals the given value a. Definition: 

    >>> lookup x = fmap snd <$> Fold.find ((== x) . fst)

  2. lookup :: (Monad m, Eq a) => a -> Stream m (a, b) -> m (Maybe b)

    streamly-core Streamly.Internal.Data.Stream

    No documentation available.

  3. lookup :: (Monad m, Eq a) => a -> StreamK m (a, b) -> m (Maybe b)

    streamly-core Streamly.Internal.Data.StreamK

    No documentation available.

  4. lookup :: MonadIO m => ThreadStorageMap a -> m (Maybe a)

    thread-utils-context Control.Concurrent.Thread.Storage

    Retrieve a value if it exists for the current thread

  5. lookup :: forall (ctx :: Ctx BaseType) e (tp :: BaseType) . Assignment IndexLit ctx -> ArrayUpdateMap e ctx tp -> Maybe (e tp)

    what4 What4.Expr.ArrayUpdateMap

    No documentation available.

  6. lookup :: (Ord k, Semigroup v) => k -> AnnotatedMap k v a -> Maybe (v, a)

    what4 What4.Utils.AnnotatedMap

    No documentation available.

  7. lookup :: Exp -> MemberId -> Exp

    Agda Agda.Compiler.JS.Substitution

    No documentation available.

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

    Agda Agda.Utils.AssocList

    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 :: Ord k => k -> BiMap k v -> Maybe v

    Agda Agda.Utils.BiMap

    Lookup. O(log n).

  10. lookup :: Ord n => n -> n -> Graph n e -> Maybe e

    Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional

    If there is an edge from s to t, then lookup s t g is Just e, where e is the edge's label. O(log n).

Page 16 of many | Previous | Next