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 :: Ord key => key -> AtomicLRU key val -> IO (Maybe val)

    lrucache Data.Cache.LRU.IO.Internal

    Look up a key in an AtomicLRU. See lookup for the semantics.

  2. lookup :: Ord key => key -> LRU key val -> (LRU key val, Maybe val)

    lrucache Data.Cache.LRU.Internal

    Look up an item in an LRU. If it was present, it is marked as the most recently accesed in the returned LRU.

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

    monoidmap-internal Data.MonoidMap.Internal.RecoveredMap

    No documentation available.

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

    network-control Network.Control

    Looking up. O(log n)

  5. lookup :: Name -> Filter -> Maybe FilterFunction

    pandoc-lua-marshal Text.Pandoc.Lua.Marshal.Filter

    Looks up a filter function in a Lua Filter.

  6. lookup :: Int -> By6Bits e -> Maybe e

    primitive-extras PrimitiveExtras.By6Bits

    Lookup an item at the index.

  7. lookup :: forall p (c :: Type -> Constraint) f a . Typeable p => PolyMap c f a -> Maybe (f (p -> a))

    reroute Data.PolyMap

    No documentation available.

  8. lookup :: Hashable key => (element -> key) -> key -> Hamt element -> STM (Maybe element)

    stm-hamt StmHamt.Hamt

    Returns a flag, specifying, whether the size has been affected.

  9. lookup :: Hashable key => (element -> key) -> key -> SizedHamt element -> STM (Maybe element)

    stm-hamt StmHamt.SizedHamt

    No documentation available.

  10. lookup :: forall a (m :: Type -> Type) b . (Eq a, Monad m) => a -> Fold m (a, b) (Maybe b)

    streamly-core Streamly.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)

Page 15 of many | Previous | Next