Hoogle Search
Within LTS Haskell 24.64 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupGE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)refined-containers Data.Map.Strict.Refined Find the smallest key greater or equal to the given one, and return the associated key-value pair.
lookupGT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)refined-containers Data.Map.Strict.Refined Find the smallest key greater than the given one, and return the associated key-value pair.
lookupLE :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)refined-containers Data.Map.Strict.Refined Find the largest key smaller or equal to the given one, and return the associated key-value pair.
lookupLT :: forall s k a . Ord k => k -> Map s k a -> Maybe (Key s k, a)refined-containers Data.Map.Strict.Refined Find the largest key smaller than the given one, and return the associated key-value pair.
lookupGE :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the smallest element greater or equal to the given one.
lookupGT :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the smallest element greater than the given one.
lookupLE :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the largest element smaller or equal to the given one.
lookupLT :: forall s a . (Ord a, KnownSet s a) => a -> Maybe (Element s a)refined-containers Data.Set.Refined Find the largest element smaller than the given one.
lookupAll :: Ord k => TMapChan k a -> k -> STM [a]tmapchan Control.Concurrent.STM.TMapChan No documentation available.
lookupAll :: (Eq k, Hashable k) => TMapChan k a -> k -> STM [a]tmapchan Control.Concurrent.STM.TMapChan.Hash No documentation available.