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.
lookupLE :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Lazy Find largest key smaller or equal to the given one and return the corresponding (key, value) pair.
lookupLE 2 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLE 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupLE 5 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
lookupLT :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Lazy Find largest key smaller than the given one and return the corresponding (key, value) pair.
lookupLT 3 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLT 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
lookupMax :: Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Lazy The maximal key of the map. Returns Nothing if the map is empty.
lookupMin :: Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Lazy The minimal key of the map. Returns Nothing if the map is empty.
lookupGE :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict Find smallest key greater or equal to the given one and return the corresponding (key, value) pair.
lookupGE 3 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupGE 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGE 6 (fromList [(3,'a'), (5,'b')]) == Nothing
lookupGT :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict Find smallest key greater than the given one and return the corresponding (key, value) pair.
lookupGT 4 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b') lookupGT 5 (fromList [(3,'a'), (5,'b')]) == Nothing
lookupLE :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict Find largest key smaller or equal to the given one and return the corresponding (key, value) pair.
lookupLE 2 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLE 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a') lookupLE 5 (fromList [(3,'a'), (5,'b')]) == Just (5, 'b')
lookupLT :: Key -> Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict Find largest key smaller than the given one and return the corresponding (key, value) pair.
lookupLT 3 (fromList [(3,'a'), (5,'b')]) == Nothing lookupLT 4 (fromList [(3,'a'), (5,'b')]) == Just (3, 'a')
lookupMax :: Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict The maximal key of the map. Returns Nothing if the map is empty.
lookupMin :: Word64Map a -> Maybe (Key, a)ghc GHC.Data.Word64Map.Strict The minimal key of the map. Returns Nothing if the map is empty.