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

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

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

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

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

6. lookupGE :: Ord k => k -> Map k v -> Maybe (k, v)

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

7. lookupGT :: Ord k => k -> Map k v -> Maybe (k, v)

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

8. lookupIndex :: Ord k => k -> Map k a -> Maybe Int

   containers	Data.Map.Internal

   Lookup the index of a key, which is its zero-based index in the sequence sorted by keys. The index is a number from 0 up to, but not including, the size of the map.

   isJust (lookupIndex 2 (fromList [(5,"a"), (3,"b")]))   == False
   fromJust (lookupIndex 3 (fromList [(5,"a"), (3,"b")])) == 0
   fromJust (lookupIndex 5 (fromList [(5,"a"), (3,"b")])) == 1
   isJust (lookupIndex 6 (fromList [(5,"a"), (3,"b")]))   == False
   

9. lookupLE :: Ord k => k -> Map k v -> Maybe (k, v)

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

10. lookupLT :: Ord k => k -> Map k v -> Maybe (k, v)

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

Page 33 of many | Previous | Next