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.
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.
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.
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.
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.
lookup :: Ord k => TMapChan k a -> k -> STM atmapchan Control.Concurrent.STM.TMapChan Blocks until there's a value available to remove from the mutlimap
lookup :: (Eq k, Hashable k) => TMapChan k a -> k -> STM atmapchan Control.Concurrent.STM.TMapChan.Hash Blocks until there's a value available to remove from the mutlimap
lookup :: MonadUnion l m => Node -> m (Node, l)union-find-array Control.Monad.Union Find the node representing a given node, and its label.
lookup :: MonadUnion l m => Node -> m (Node, l)union-find-array Control.Monad.Union.Class Find the node representing a given node, and its label.
lookup :: Union l -> Node -> (Node, l)union-find-array Data.Union Look up the representative of a node, and its label.
lookup :: UnionST s l -> Int -> ST s (Int, l)union-find-array Data.Union.ST Look up the representative of a given node and its label.