Hoogle Search
Within LTS Haskell 24.62 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
lookupGE :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Refined Find the smallest key greater or equal to the given one, and return the associated key-value pair.
lookupGT :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Refined Find the smallest key greater than the given one, and return the associated key-value pair.
lookupLE :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Refined Find the largest key smaller or equal to the given one, and return the associated key-value pair.
lookupLT :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Refined Find the largest key smaller than the given one, and return the associated key-value pair.
lookupGE :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Strict.Refined Find the smallest key greater or equal to the given one, and return the associated key-value pair.
lookupGT :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Strict.Refined Find the smallest key greater than the given one, and return the associated key-value pair.
lookupLE :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Strict.Refined Find the largest key smaller or equal to the given one, and return the associated key-value pair.
lookupLT :: Int -> IntMap s a -> Maybe (Key s, a)refined-containers Data.IntMap.Strict.Refined Find the largest key smaller than the given one, and return the associated key-value pair.
lookupGE :: KnownIntSet s => Int -> Maybe (Element s)refined-containers Data.IntSet.Refined Find the smallest element greater or equal to the given one.
lookupGT :: KnownIntSet s => Int -> Maybe (Element s)refined-containers Data.IntSet.Refined Find the smallest element greater than the given one.