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.

  1. lookupMax :: IntMap a -> Maybe (Key, a)

    containers Data.IntMap.Strict.Internal

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

  2. lookupMin :: IntMap a -> Maybe (Key, a)

    containers Data.IntMap.Strict.Internal

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

  3. lookupGE :: Key -> IntSet -> Maybe Key

    containers Data.IntSet

    Find smallest element greater or equal to the given one. 

    lookupGE 3 (fromList [3, 5]) == Just 3
lookupGE 4 (fromList [3, 5]) == Just 5
lookupGE 6 (fromList [3, 5]) == Nothing

  4. lookupGT :: Key -> IntSet -> Maybe Key

    containers Data.IntSet

    Find smallest element greater than the given one. 

    lookupGT 4 (fromList [3, 5]) == Just 5
lookupGT 5 (fromList [3, 5]) == Nothing

  5. lookupLE :: Key -> IntSet -> Maybe Key

    containers Data.IntSet

    Find largest element smaller or equal to the given one. 

    lookupLE 2 (fromList [3, 5]) == Nothing
lookupLE 4 (fromList [3, 5]) == Just 3
lookupLE 5 (fromList [3, 5]) == Just 5

  6. lookupLT :: Key -> IntSet -> Maybe Key

    containers Data.IntSet

    Find largest element smaller than the given one. 

    lookupLT 3 (fromList [3, 5]) == Nothing
lookupLT 5 (fromList [3, 5]) == Just 3

  7. lookupGE :: Key -> IntSet -> Maybe Key

    containers Data.IntSet.Internal

    Find smallest element greater or equal to the given one. 

    lookupGE 3 (fromList [3, 5]) == Just 3
lookupGE 4 (fromList [3, 5]) == Just 5
lookupGE 6 (fromList [3, 5]) == Nothing

  8. lookupGT :: Key -> IntSet -> Maybe Key

    containers Data.IntSet.Internal

    Find smallest element greater than the given one. 

    lookupGT 4 (fromList [3, 5]) == Just 5
lookupGT 5 (fromList [3, 5]) == Nothing

  9. lookupLE :: Key -> IntSet -> Maybe Key

    containers Data.IntSet.Internal

    Find largest element smaller or equal to the given one. 

    lookupLE 2 (fromList [3, 5]) == Nothing
lookupLE 4 (fromList [3, 5]) == Just 3
lookupLE 5 (fromList [3, 5]) == Just 5

  10. lookupLT :: Key -> IntSet -> Maybe Key

    containers Data.IntSet.Internal

    Find largest element smaller than the given one. 

    lookupLT 3 (fromList [3, 5]) == Nothing
lookupLT 5 (fromList [3, 5]) == Just 3

Page 33 of many | Previous | Next