Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. mapCE :: forall (m :: Type -> Type) f a b . (Monad m, Functor f) => (a -> b) -> ConduitT (f a) (f b) m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a transformation to all elements in a chunked stream.

2. mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)

   classy-prelude-yesod	ClassyPrelude.Yesod

   Executes a Traversable container of items concurrently, it uses the Flat type internally.

3. mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Executes a Traversable container of items concurrently, it uses the Flat type internally. This function ignores the results.

4. mapExceptionM :: (Exception e1, Exception e2, MonadUnliftIO m) => (e1 -> e2) -> m a -> m a

   classy-prelude-yesod	ClassyPrelude.Yesod

   Same as mapException, except works in a monadic context.

5. mapFromList :: IsMap map => [(ContainerKey map, MapValue map)] -> map

   classy-prelude-yesod	ClassyPrelude.Yesod

   Convert a list of key-value pairs to a map

6. mapInput :: forall (m :: Type -> Type) i1 i2 o r . Monad m => (i1 -> i2) -> (i2 -> Maybe i1) -> ConduitT i2 o m r -> ConduitT i1 o m r

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a function to all the input values of a ConduitT. Since 0.5.0

7. mapInputM :: Monad m => (i1 -> m i2) -> (i2 -> m (Maybe i1)) -> ConduitT i2 o m r -> ConduitT i1 o m r

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a monadic action to all the input values of a ConduitT. Since 1.3.2

8. mapKeysWith :: (BiPolyMap map, BPMKeyConstraint map k1, BPMKeyConstraint map k2) => (v -> v -> v) -> (k1 -> k2) -> map k1 v -> map k2 v

   classy-prelude-yesod	ClassyPrelude.Yesod

   No documentation available.

9. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   classy-prelude-yesod	ClassyPrelude.Yesod

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

10. mapMC :: Monad m => (a -> m b) -> ConduitT a b m ()

    classy-prelude-yesod	ClassyPrelude.Yesod

    Apply a monadic transformation to all values in a stream. If you do not need the transformed values, and instead just want the monadic side-effects of running the action, see mapM_.

Page 376 of many | Previous | Next