Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   Agda	Agda.Utils.Monad

   A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].

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

   Agda	Agda.Utils.Monad

   A version of mapMaybeM with a computation for the input list.

3. mapEither3M :: Applicative m => (a -> m (Either3 b c d)) -> [a] -> m ([b], [c], [d])

   Agda	Agda.Utils.Three

   No documentation available.

4. mapSubTries :: Ord k => (Trie k u -> Maybe v) -> Trie k u -> Trie k v

   Agda	Agda.Utils.Trie

   Create new values based on the entire subtrie. Almost, but not quite comonad extend.

5. mapFst :: (a -> c) -> (a, b) -> (c, b)

   Agda	Agda.Utils.Tuple

   mapFst f = f -*- id
   

6. mapFstM :: Functor m => (a -> m c) -> (a, b) -> m (c, b)

   Agda	Agda.Utils.Tuple

   Monadic mapFst.

7. mapPairM :: Applicative m => (a -> m c) -> (b -> m d) -> (a, b) -> m (c, d)

   Agda	Agda.Utils.Tuple

   Monadic version of -*-.

8. mapSnd :: (b -> d) -> (a, b) -> (a, d)

   Agda	Agda.Utils.Tuple

   mapSnd g = id -*- g
   

9. mapSndM :: Functor m => (b -> m d) -> (a, b) -> m (a, d)

   Agda	Agda.Utils.Tuple

   Monadic mapSnd.

10. mapChangeT :: (m (a, Any) -> n (b, Any)) -> ChangeT m a -> ChangeT n b

    Agda	Agda.Utils.Update

    Map a ChangeT computation (monad transformer action).

Page 276 of many | Previous | Next