:: Int -> IO a -> IO [a] -package:ghc-internal

replicateConcurrently :: Int -> IO a -> IO [a]

async Control.Concurrent.Async Control.Concurrent.Async.Internal

Perform the action in the given number of threads.

replicateConcurrently :: MonadBaseControl IO m => Int -> m a -> m [a]

lifted-async Control.Concurrent.Async.Lifted

Generalized version of replicateConcurrently.

replicateConcurrently :: (MonadBaseControl IO m, Forall (Pure m)) => Int -> m a -> m [a]

lifted-async Control.Concurrent.Async.Lifted.Safe

Generalized version of replicateConcurrently.

replicateM :: Applicative m => Int -> m a -> m [a]

base Control.Monad, relude Relude.Monad.Reexport, verset Verset

replicateM n act performs the action act n times, and then returns the list of results.

replicateM n (pure x) == replicate n x

Examples

>>> replicateM 3 getLine
hi
heya
hiya
["hi","heya","hiya"]

>>> import Control.Monad.State

>>> runState (replicateM 3 $ state $ \s -> (s, s + 1)) 1
([1,2,3],4)

replicateM :: Applicative m => Int -> m a -> m [a]

replicateM n act performs the action act n times, and then returns the list of results:

Examples

>>> import Control.Monad.State

>>> runState (replicateM 3 $ state $ \s -> (s, s + 1)) 1
([1,2,3],4)

count :: Applicative m => Int -> m a -> m [a]

parser-combinators Control.Applicative.Combinators

count n p parses n occurrences of p. If n is smaller or equal to zero, the parser equals to pure []. Returns a list of n parsed values.

count = replicateM

See also: skipCount, count'.

count :: Applicative m => Int -> m a -> m [a]

parsers Text.Parser.Combinators, Cabal-syntax Distribution.Compat.Parsing

count n p parses n occurrences of p. If n is smaller or equal to zero, the parser equals to return []. Returns a list of n values returned by p.

independent :: Applicative m => Int -> m a -> m [a]

monad-bayes Control.Monad.Bayes.Class

replicateM :: Applicative m => Int -> m a -> m [a]

yesod-paginator Yesod.Paginator.Prelude

replicateM n act performs the action n times, gathering the results. Using ApplicativeDo: 'replicateM 5 as' can be understood as the do expression

do a1 <- as
a2 <- as
a3 <- as
a4 <- as
a5 <- as
pure [a1,a2,a3,a4,a5]

Note the Applicative constraint.

replicateM :: Applicative m => Int -> m a -> m [a]

control-monad-free Control.Monad.Free

replicateM n act performs the action n times, gathering the results.

count :: Monad m => Int -> m a -> m [a]

attoparsec Data.Attoparsec.ByteString Data.Attoparsec.ByteString.Char8 Data.Attoparsec.ByteString.Lazy Data.Attoparsec.Combinator Data.Attoparsec.Text Data.Attoparsec.Text.Lazy

Apply the given action repeatedly, returning every result.

replicate :: Monad m => Int -> m a -> m [a]

utility-ht Control.Monad.HT

count :: Monad m => Int -> m a -> m [a]

parser-combinators Control.Monad.Combinators

count n p parses n occurrences of p. If n is smaller or equal to zero, the parser equals to return []. Returns a list of n values. See also: skipCount, count'.

replicateTailM :: Monad m => Int -> m a -> m [a]

mempack Data.MemPack

Tail recursive version of replicateM

resampleIO :: Foldable f => Int -> f a -> IO [a]

sampling Numeric.Sampling

(O(n log n)) resample specialized to IO.

pooledReplicateConcurrently :: MonadUnliftIO m => Int -> m a -> m [a]

unliftio UnliftIO.Async UnliftIO.Internals.Async

Similar to pooledReplicateConcurrentlyN but with number of threads set from getNumCapabilities. Usually this is useful for CPU bound tasks.

replicateConcurrently :: MonadUnliftIO f => Int -> f a -> f [a]

unliftio UnliftIO.Async UnliftIO.Internals.Async

Unlifted replicateConcurrently.