Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

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

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

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

   Agda	Agda.Utils.Maybe

   caseMaybe with flipped branches.

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

   Agda	Agda.Utils.Maybe

   caseMaybeM with flipped branches.

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

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

   Agda	Agda.Utils.Maybe

   caseMaybeM without the Nothing case.

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

   Agda	Agda.Utils.Maybe.Strict

   caseMaybeM with flipped branches.

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

   Agda	Agda.Utils.Maybe.Strict

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

   caseMaybeM without the Nothing case.

10. adjust :: Ord k => [k] -> (Maybe v -> Maybe v) -> Trie k v -> Trie k v

    Agda	Agda.Utils.Trie

    Adjust value at key, leave subtree intact. Disclaimer: may return a non-canoncial trie because it does not clean up subtries that become empty.

Page 118 of many | Previous | Next