Hoogle Search

Within LTS Haskell 24.12 (ghc-9.10.3)

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

  1. lookupLT :: Key -> Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Internal

    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')

  2. lookupMax :: Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Internal

    The maximal key of the map. Returns Nothing if the map is empty.

  3. lookupMin :: Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Internal

    The minimal key of the map. Returns Nothing if the map is empty.

  4. lookupGE :: Key -> Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Lazy

    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

  5. lookupGT :: Key -> Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Lazy

    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

  6. 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')

  7. 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')

  8. lookupMax :: Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Lazy

    The maximal key of the map. Returns Nothing if the map is empty.

  9. lookupMin :: Word64Map a -> Maybe (Key, a)

    ghc GHC.Data.Word64Map.Lazy

    The minimal key of the map. Returns Nothing if the map is empty.

  10. 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

Page 45 of many | Previous | Next