Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

Exact lookup

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

2. mapM_ :: (Functor m, Monad m) => (a -> m b) -> Stream m a -> Stream m ()

   leveldb-haskell	Data.Stream.Monadic

   No documentation available.

3. mapMonad :: forall (s :: Type -> Type) m m' x . (Functor s, Monad m, Monad m') => (forall y . () => m y -> m' y) -> Coroutine s m x -> Coroutine s m' x

   monad-coroutine	Control.Monad.Coroutine

   Change the base monad of a Coroutine.

4. 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)

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

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

   opt-env-conf	OptEnvConf.Setting

   No documentation available.

7. mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

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

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. mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Strict

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

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

Page 56 of many | Previous | Next