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.

Exact lookup

1. lookupMin :: MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

2. lookupGE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

3. lookupGT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

4. lookupIndex :: Ord k => k -> MonoidalMap k a -> Maybe Int

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

5. lookupLE :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

6. lookupLT :: Ord k => k -> MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

7. lookupMax :: MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

8. lookupMin :: MonoidalMap k a -> Maybe (k, a)

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

9. lookupGE :: Key -> NEIntMap a -> Maybe (Key, a)

   nonempty-containers	Data.IntMap.NonEmpty

   O(log n). 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
   

10. lookupGT :: Key -> NEIntMap a -> Maybe (Key, a)

    nonempty-containers	Data.IntMap.NonEmpty

    O(log n). 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
    

Page 100 of many | Previous | Next