Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. mapMaybe :: (a -> Maybe b) -> Tree a -> Maybe (Tree b)

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

2. mapMaybeMaybeT :: (a -> Maybe b) -> TreeT (MaybeT Identity) a -> TreeT (MaybeT Identity) b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

3. mapMaybeT :: forall (m :: Type -> Type) a b . (Monad m, Alternative m) => (a -> Maybe b) -> TreeT m a -> TreeT m b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

4. mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t

   microlens	Lens.Micro

   Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results.

   >>> mapMOf both (\x -> [x, x + 1]) (1,3)
   [(1,3),(1,4),(2,3),(2,4)]
   

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

   extra	Control.Monad.Extra

   A version of mapMaybe that works with a monadic predicate.

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

   extra	Extra

   A version of mapMaybe that works with a monadic predicate.

7. mapM_ :: Monad m => (Word8 -> m ()) -> ConduitT ByteString o m ()

   conduit-extra	Data.Conduit.Binary

   Perform a computation on each Word8 in a stream. Since 1.0.10

8. mapMaybe :: forall (m :: Type -> Type) a b . Functor m => (a -> Maybe b) -> SourceT m a -> SourceT m b

   servant	Servant.Types.SourceT

   Filter values.

   >>> toList $ mapMaybe (\x -> if odd x then Just x else Nothing) (source [0..10]) :: [Int]
   [1,3,5,7,9]
   

   >>> mapMaybe (\x -> if odd x then Just x else Nothing) (source [0..2]) :: SourceT Identity Int
   fromStepT (Effect (Identity (Skip (Yield 1 (Skip Stop)))))
   

   Illustrates why we need Skip.

9. mapMaybeStep :: forall (m :: Type -> Type) a b . Functor m => (a -> Maybe b) -> StepT m a -> StepT m b

   servant	Servant.Types.SourceT

   No documentation available.

10. mapMTV :: Monad m => (Name -> m Name) -> (flag -> m flag') -> (Kind -> m Kind) -> TyVarBndr_ flag -> m (TyVarBndr_ flag')

    th-abstraction	Language.Haskell.TH.Datatype.TyVarBndr

    Map over the components of a TyVarBndr in a monadic fashion. This is the same as traverseTV, but with a Monad constraint. This is mainly useful for use with old versions of base where Applicative was not a superclass of Monad.

Page 14 of many | Previous | Next