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. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   dunai	Control.Monad.Trans.MSF.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

2. mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => MSF m a b -> MSF m (Maybe a) (Maybe b)

   dunai	Data.MonadicStreamFunction.Util

   Apply an MSF to every input. Freezes temporarily if the input is Nothing, and continues as soon as a Just is received.

3. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b

   hashmap	Data.HashMap

   Map keys/values and collect the Just results.

4. mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]

   invertible	Control.Invertible.Monoidal

   Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).

5. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   monadology	Control.Monad.Ology.Specific.MaybeT

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

6. mapMaybeFieldsWithNulls :: ProductProfunctor p => p (Field SqlBool) (Field SqlBool) -> WithNulls p a b -> WithNulls p (MaybeFields a) (MaybeFields b)

   opaleye	Opaleye.Internal.MaybeFields

   This is only safe if b is OK with having nulls passed through it when they claim to be non-null.

7. mapMaybeBuilder :: (BuildInstruction a -> Maybe (BuildInstruction b)) -> Builder a -> Builder b

   opt-env-conf	OptEnvConf.Setting

   No documentation available.

8. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create a tree out of Just results.

9. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Strict

   Apply a function to every value in the tree and create a tree out of Just results. The Maybe is evaluated to WHNF.

10. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

    radix-tree	Data.Radix1Tree.Word8.Lazy

    Apply a function to every value in the tree and create one out of Just values.

Page 26 of many | Previous | Next