Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. lookup :: Str -> Dictionary a -> Maybe a

    rattletrap Rattletrap.Type.Dictionary

    No documentation available.

  2. lookup :: Int -> Vector a -> Maybe a

    rrb-vector Data.RRBVector

    The element at the index or Nothing if the index is out of range.

  3. lookup :: Eq a => a -> Slist (a, b) -> Maybe b

    slist Slist

    O(n). Looks up by the given key in the slist of key-value pairs. 

    >>> lookup 42 $ slist $ [(1, "one"), (2, "two")]
Nothing

>>> lookup 42 $ slist $ [(1, "one"), (2, "two"), (42, "life, the universe and everything")]
Just "life, the universe and everything"

>>> lookup 1 $ zip (infiniteSlist  [1..]) (infiniteSlist [0..])
Just 0

  4. lookup :: (Monad m, Eq a) => a -> SerialT m (a, b) -> m (Maybe b)

    streamly Streamly.Internal.Data.Stream.IsStream

    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. 

    lookup = snd <$> Stream.find ((==) . fst)
lookup = Stream.fold Fold.lookup

  5. lookup :: (Monad m, Eq a) => a -> SerialT m (a, b) -> m (Maybe b)

    streamly Streamly.Prelude

    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. 

    lookup = snd <$> Stream.find ((==) . fst)
lookup = Stream.fold Fold.lookup

  6. lookup :: (Textual str, MonadIO m) => str -> m (Maybe Symbol)

    symbolize Symbolize

    Looks up a symbol in the global symbol table. Returns Nothing if no such symbol currently exists. First converts the string to a ShortText (if it isn't already one). See Textual for the type-specific time complexity of this. Then, takes O(min(n, 64)) time, where n is the number of symbols currently in the table. Runs concurrently with any other operation on the symbol table, without any atomic memory barriers. Because the result can vary depending on the current state of the symbol table, this function is not pure.

  7. lookup :: Coupon -> Vendor a -> IO (Maybe (RemotePtr a))

    threepenny-gui Foreign.RemotePtr

    Take a Coupon to a Vendor and maybe you'll get a RemotePtr for it.

  8. lookup :: Ord k => TMapMVar k a -> k -> STM a

    tmapmvar Control.Concurrent.STM.TMapMVar

    Blocks, and deletes upon looking it up

  9. lookup :: (Eq k, Hashable k) => TMapMVar k a -> k -> STM a

    tmapmvar Control.Concurrent.STM.TMapMVar.Hash

    Blocks, and deletes upon looking it up

  10. lookup :: Key -> PrefixMap a -> Maybe a

    tomland Toml.Type.PrefixTree

    Looks up the value at a key in the PrefixMap.

Page 22 of many | Previous | Next