Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. lastMay :: [a] -> Maybe a

   safe	Safe

   No documentation available.

2. firstJustM :: Monad m => (a -> m (Maybe b)) -> [a] -> m (Maybe b)

   extra	Control.Monad.Extra

   Like findM, but also allows you to compute some additional information in the predicate.

3. untilJustM :: Monad m => m (Maybe a) -> m a

   extra	Control.Monad.Extra

   Keep running an operation until it becomes a Just, then return the value inside the Just as the result of the overall loop.

4. whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()

   extra	Control.Monad.Extra

   Like whenJust, but where the test can be monadic.

5. whileJustM :: (Monad m, Monoid a) => m (Maybe a) -> m a

   extra	Control.Monad.Extra

   Keep running an operation until it becomes a Nothing, accumulating the monoid results inside the Justs as the result of the overall loop.

6. firstJustM :: (Foldable f, Monad m) => (a -> m (Maybe b)) -> f a -> m (Maybe b)

   extra	Data.Foldable.Extra

   A generalization of firstJustM to Foldable instances.

7. firstM :: Functor m => (a -> m a') -> (a, b) -> m (a', b)

   extra	Data.Tuple.Extra

   Update the first component of a pair.

   firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
   

8. firstJustM :: Monad m => (a -> m (Maybe b)) -> [a] -> m (Maybe b)

   extra	Extra

   Like findM, but also allows you to compute some additional information in the predicate.

9. firstM :: Functor m => (a -> m a') -> (a, b) -> m (a', b)

   extra	Extra

   Update the first component of a pair.

   firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
   

10. untilJustM :: Monad m => m (Maybe a) -> m a

    extra	Extra

    Keep running an operation until it becomes a Just, then return the value inside the Just as the result of the overall loop.

Page 24 of many | Previous | Next