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.
mapConcurrentlyBounded :: Traversable t => Int -> (a -> IO b) -> t a -> IO (t b)async-extra Control.Concurrent.Async.Extra Span a green thread for each task, but only execute N tasks concurrently.
mapConcurrentlyBounded_ :: Traversable t => Int -> (a -> IO ()) -> t a -> IO ()async-extra Control.Concurrent.Async.Extra Span a green thread for each task, but only execute N tasks concurrently. Ignore the result
-
async-extra Control.Concurrent.Async.Extra Split input into N chunks with equal length and work on each chunk in a dedicated green thread. Then merge results using provided merge function
mapConcurrentlyChunks_ :: Foldable t => Int -> (a -> IO ()) -> t a -> IO ()async-extra Control.Concurrent.Async.Extra Split input into N chunks with equal length and work on each chunk in a dedicated green thread. Ignore results
mapConcurrently :: Traversable t => TaskGroup -> (a -> IO b) -> t a -> IO (t b)async-pool Control.Concurrent.Async.Pool 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. For example, mapConcurrently works with lists:
pages <- mapConcurrently getURL ["url1", "url2", "url3"]
mapRace :: Foldable t => TaskGroup -> t (IO a) -> IO (Async a, Either SomeException a)async-pool Control.Concurrent.Async.Pool Execute a group of tasks, but return the first result or failure and cancel the remaining tasks.
mapReduce :: (Foldable t, Monoid a) => TaskGroup -> t (IO a) -> STM (Async a)async-pool Control.Concurrent.Async.Pool Given a list of actions yielding Monoid results, execute the actions concurrently (up to N at a time, based on available slots), and mappend each pair of results concurrently as they become ready. The immediate result of this function is an Async representing the final value. This is similar to the following: mconcat $ mapTasks n actions, except that intermediate results can be garbage collected as soon as they've been merged. Also, the value returned from this function is an Async which may be polled for the final result. Lastly, if an Exception occurs in any subtask, the final result will also yield an exception -- but not necessarily the first or last that was caught.
mapTasks :: Traversable t => TaskGroup -> t (IO a) -> IO (t a)async-pool Control.Concurrent.Async.Pool Execute a group of tasks within the given task group, returning the results in order. The order of execution is random, but the results are returned in order.
mapTasksE :: Traversable t => TaskGroup -> t (IO a) -> IO (t (Either SomeException a))async-pool Control.Concurrent.Async.Pool Execute a group of tasks within the given task group, returning the results in order as an Either type to represent exceptions from actions. The order of execution is random, but the results are returned in order.
mapTasksE_ :: Traversable t => TaskGroup -> t (IO a) -> IO (t (Maybe SomeException))async-pool Control.Concurrent.Async.Pool Execute a group of tasks within the given task group, ignoring results, but returning a list of all exceptions.