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.

Exact lookup

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

   containers	Data.IntMap.Strict

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

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

   containers	Data.IntMap.Strict.Internal

   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
   

3. lookupGT :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Strict.Internal

   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
   

4. lookupLE :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Strict.Internal

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

5. lookupLT :: Key -> IntMap a -> Maybe (Key, a)

   containers	Data.IntMap.Strict.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')
   

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

   containers	Data.IntMap.Strict.Internal

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

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

   containers	Data.IntMap.Strict.Internal

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

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

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

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

Page 32 of many | Previous | Next