Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

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

Exact lookup

1. lookup :: Interface (m :: Type -> Type) -> Addr -> m (Maybe Addr)

   network-house	Net.ARP_Protocol

   No documentation available.

2. lookup :: (Eq k, Hashable k, Typeable s, Typeable k, Typeable a) => PredKey s k a -> k -> PredSet s k -> ST s (Maybe a)

   pred-set	Data.PredSet.Mutable

   No documentation available.

3. lookup :: forall s k a . Hashable k => k -> HashMap s k a -> Maybe (Key s k, a)

   refined-containers	Data.HashMap.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

4. lookup :: forall s k a . Hashable k => k -> HashMap s k a -> Maybe (Key s k, a)

   refined-containers	Data.HashMap.Strict.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

5. lookup :: Int -> IntMap s a -> Maybe (Key s, a)

   refined-containers	Data.IntMap.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

6. lookup :: Int -> IntMap s a -> Maybe (Key s, a)

   refined-containers	Data.IntMap.Strict.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

7. lookup :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

   refined-containers	Data.Map.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

8. lookup :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)

   refined-containers	Data.Map.Strict.Refined

   If the key is in the map, return the proof of this, and the associated value; otherwise return Nothing.

9. lookup :: Ord k => TMapChan k a -> k -> STM a

   tmapchan	Control.Concurrent.STM.TMapChan

   Blocks until there's a value available to remove from the mutlimap

10. lookup :: (Eq k, Hashable k) => TMapChan k a -> k -> STM a

    tmapchan	Control.Concurrent.STM.TMapChan.Hash

    Blocks until there's a value available to remove from the mutlimap

Page 25 of many | Previous | Next