Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

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

Exact lookup

1. mapConcurrently :: Traversable t => (a -> IO b) -> t a -> IO (t b)

   async	Control.Concurrent.Async.Internal

   Maps an IO-performing function over any Traversable data type, performing all the IO actions concurrently, and returning the original data structure with the arguments replaced by the results. If any of the actions throw an exception, then all other actions are cancelled and the exception is re-thrown. For example, mapConcurrently works with lists:

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

   Take into account that async will try to immediately spawn a thread for each element of the Traversable, so running this on large inputs without care may lead to resource exhaustion (of memory, file descriptors, or other limited resources).

2. mapConcurrently_ :: Foldable f => (a -> IO b) -> f a -> IO ()

   async	Control.Concurrent.Async.Internal

   mapConcurrently_ is mapConcurrently with the return value discarded; a concurrent equivalent of mapM_.

3. mapAccumLM :: Monad m => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, [y])

   test-framework	Test.Framework.Providers.API

   No documentation available.

4. mappendBy :: Monoid b => (a -> b) -> a -> a -> b

   test-framework	Test.Framework.Providers.API

   No documentation available.

5. mappend :: Monoid a => a -> a -> a

   optparse-applicative	Options.Applicative

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

6. mappend :: Monoid a => a -> a -> a

   optparse-applicative	Options.Applicative.Builder

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

7. mapParser :: (forall x . () => ArgumentReachability -> Option x -> b) -> Parser a -> [b]

   optparse-applicative	Options.Applicative.Common

   Map a polymorphic function over all the options of a parser, and collect the results in a list.

8. mapAccumS :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> ConduitT b Void m s) -> s -> ConduitT () b m () -> ConduitT a Void m s

   conduit	Conduit

   Consume a source with a strict accumulator, in a way piecewise defined by a controlling stream. The latter will be evaluated until it terminates.

   >>> let f a s = liftM (:s) $ mapC (*a) =$ CL.take a
   
   >>> reverse $ runIdentity $ yieldMany [0..3] $$ mapAccumS f [] (yieldMany [1..])
   [[],[1],[4,6],[12,15,18]] :: [[Int]]
   

9. mapAccumWhileC :: forall (m :: Type -> Type) a s b . Monad m => (a -> s -> Either s (s, b)) -> s -> ConduitT a b m s

   conduit	Conduit

   mapWhileC with a break condition dependent on a strict accumulator. Equivalently, mapAccum as long as the result is Right. Instead of producing a leftover, the breaking input determines the resulting accumulator via Left.

10. mapAccumWhileMC :: Monad m => (a -> s -> m (Either s (s, b))) -> s -> ConduitT a b m s

    conduit	Conduit

    Monadic mapAccumWhileC.

Page 75 of many | Previous | Next