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. lookupGT :: Key -> IntMap a -> Maybe (Key, a)

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

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

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

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

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

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

   containers	Data.IntMap.Lazy

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

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

   containers	Data.IntMap.Lazy

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

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

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

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

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

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

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

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

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

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

    containers	Data.IntMap.Strict

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

Page 31 of many | Previous | Next