Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. spanJust :: (a -> Maybe b) -> [a] -> (Prefix b, Suffix a)

   Agda	Agda.Utils.List

   A generalized version of span. O(length . fst . spanJust f).

2. takeWhileJust :: (a -> Maybe b) -> [a] -> Prefix b

   Agda	Agda.Utils.List

   A generalized version of takeWhile. (Cf. mapMaybe vs. filter). @O(length . takeWhileJust f). takeWhileJust f = fst . spanJust f.

3. adjustM :: (Functor f, Ord k) => (v -> f v) -> k -> Map k v -> f (Map k v)

   Agda	Agda.Utils.Map

   Update monadically the value at one position (must exist!).

4. adjustM' :: (Functor f, Ord k) => (v -> f (a, v)) -> k -> Map k v -> f (a, Map k v)

   Agda	Agda.Utils.Map

   Wrapper for adjustM for convenience.

5. allJustM :: Monad m => [m (Maybe a)] -> m (Maybe [a])

   Agda	Agda.Utils.Maybe

   Lazy version of allJust . sequence. (allJust = mapM for the Maybe monad.) Only executes monadic effect while isJust.

6. ifJust :: Maybe a -> (a -> b) -> b -> b

   Agda	Agda.Utils.Maybe

   caseMaybe with flipped branches.

7. ifJustM :: Monad m => m (Maybe a) -> (a -> m b) -> m b -> m b

   Agda	Agda.Utils.Maybe

   caseMaybeM with flipped branches.

8. whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()

   Agda	Agda.Utils.Maybe

   A more telling name for forM_ for the Maybe collection type. Or: caseMaybe without the Nothing case.

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

   Agda	Agda.Utils.Maybe

   caseMaybeM without the Nothing case.

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

    Agda	Agda.Utils.Maybe.Strict

    caseMaybeM with flipped branches.

Page 106 of many | Previous | Next