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. 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"]
   

2. 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_.

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

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

   No documentation available.

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

   debian	Debian.Apt.Dependencies

   No documentation available.

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

   debian	Debian.Loc

   No documentation available.

6. mapEither :: Filtrable f => (a -> Either b c) -> f a -> (f b, f c)

   filtrable	Data.Filtrable

   Map the container with the given function, collecting the Lefts and the Rights separately.

7. mapEitherA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Either b c)) -> f a -> p (f b, f c)

   filtrable	Data.Filtrable

   Traverse the container with the given function, collecting the Lefts and the Rights separately.

8. mapMaybe :: Filtrable f => (a -> Maybe b) -> f a -> f b

   filtrable	Data.Filtrable

   Map the container with the given function, dropping the elements for which it returns Nothing.

9. mapMaybeA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Maybe b)) -> f a -> p (f b)

   filtrable	Data.Filtrable

   Traverse the container with the given function, dropping the elements for which it returns Nothing.

10. mapS :: (Applicative f, Sequence sq) => (forall x y . () => cat x y -> f (cat x y)) -> sq cat a b -> f (sq cat a b)

    freer-par-monad	Control.Monad.Freer.Par.Sequence

    No documentation available.

Page 239 of many | Previous | Next