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.

  1. mapOutput :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    classy-prelude-conduit ClassyPrelude.Conduit

    Apply a function to all the output values of a ConduitT. This mimics the behavior of fmap for a Source and Conduit in pre-0.4 days. It can also be simulated by fusing with the map conduit from Data.Conduit.List. Since 0.4.1

  2. mapOutputMaybe :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> Maybe o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    classy-prelude-conduit ClassyPrelude.Conduit

    Same as mapOutput, but use a function that returns Maybe values. Since 0.5.0

  3. mapWhileC :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> ConduitT a b m ()

    classy-prelude-conduit ClassyPrelude.Conduit

    Map values as long as the result is Just.

  4. mapHeadedness :: (forall x . () => h x -> h' x) -> Colonnade h a c -> Colonnade h' a c

    colonnade Colonnade

    Map over the header type of a Colonnade.

  5. mapHeaderContent :: forall (h :: Type -> Type) c a . Functor h => (c -> c) -> Colonnade h a c -> Colonnade h a c

    colonnade Colonnade

    Map over the content in the header. This is similar performing fmap on a Colonnade except that the body content is unaffected.

  6. mapConcurrently :: (Traversable t, MonadConc m) => (a -> m b) -> t a -> m (t b)

    concurrency Control.Concurrent.Classy.Async

    Maps a MonadConc-performing function over any Traversable data type, performing all the MonadConc actions concurrently, and returning the original data structure with the arguments replaced by the results. For example, mapConcurrently works with lists: 

    pages <- mapConcurrently getURL ["url1", "url2", "url3"]

  7. mapConcurrently_ :: (Foldable f, MonadConc m) => (a -> m b) -> f a -> m ()

    concurrency Control.Concurrent.Classy.Async

    mapConcurrently_ is mapConcurrently with the return value discarded, just like mapM_.

  8. mapTupleE :: (Type -> Exp -> Q Exp) -> Type -> Exp -> Maybe (Q Exp)

    data-effects-th Data.Effect.HFunctor.TH.Internal

    No documentation available.

  9. mapTree :: (a -> b) -> Tree a -> Tree b

    debian Debian.Apt.Dependencies

    No documentation available.

  10. mapExn :: forall e m a . (MonadCatch m, Exception e) => m a -> (e -> e) -> m a

    debian Debian.Loc

    No documentation available.

Page 241 of many | Previous | Next