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

replicateM :: Monad m => Int -> m a -> m [a]
base Control.Monad
replicateM n act performs the action n times, gathering the results.
vectorOf :: Int -> Gen a -> Gen [a]
QuickCheck Test.QuickCheck.Gen, QuickCheck Test.QuickCheck
Generates a list of the given length.
count :: Int -> ReadP a -> ReadP [a]
base Text.ParserCombinators.ReadP
count n p parses n occurrences of p in sequence. A list of results is returned.
drop :: Int -> [a] -> [a]
base Prelude, base Data.List
drop n xs returns the suffix of xs after the first n elements, or [] if n > length xs: > drop 6 "Hello World!" == "World!" > drop 3 [1,2,3,4,5] == [4,5] > drop 3 [1,2] == [] > drop 3 [] == [] > drop (-1) [1,2] == [1,2] > drop 0 [1,2] == [1,2] It is an instance of the more general Data.List.genericDrop, in which n may be of any integral type.
take :: Int -> [a] -> [a]
base Prelude, base Data.List
take n, applied to a list xs, returns the prefix of xs of length n, or xs itself if n > length xs: > take 5 "Hello World!" == "Hello" > take 3 [1,2,3,4,5] == [1,2,3] > take 3 [1,2] == [1,2] > take 3 [] == [] > take (-1) [1,2] == [] > take 0 [1,2] == [] It is an instance of the more general Data.List.genericTake, in which n may be of any integral type.
replicate :: Int -> a -> [a]
base Prelude, base Data.List
replicate n x is a list of length n with x the value of every element. It is an instance of the more general Data.List.genericReplicate, in which n may be of any integral type.
intersperse :: a -> [a] -> [a]
base Data.List
The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example, > intersperse ',' "abcde" == "a,b,c,d,e"
manyTill :: ReadP a -> ReadP end -> ReadP [a]
base Text.ParserCombinators.ReadP
manyTill p end parses zero or more occurrences of p, until end succeeds. Returns a list of values returned by p.
endBy :: ReadP a -> ReadP sep -> ReadP [a]
base Text.ParserCombinators.ReadP
endBy p sep parses zero or more occurrences of p, separated and ended by sep.
endBy1 :: ReadP a -> ReadP sep -> ReadP [a]
base Text.ParserCombinators.ReadP
endBy p sep parses one or more occurrences of p, separated and ended by sep.
sepBy :: ReadP a -> ReadP sep -> ReadP [a]
base Text.ParserCombinators.ReadP
sepBy p sep parses zero or more occurrences of p, separated by sep. Returns a list of values returned by p.
sepBy1 :: ReadP a -> ReadP sep -> ReadP [a]
base Text.ParserCombinators.ReadP
sepBy1 p sep parses one or more occurrences of p, separated by sep. Returns a list of values returned by p.
replicateM_ :: Monad m => Int -> m a -> m ()
base Control.Monad
Like replicateM, but discards the result.
chunksOf :: Int -> Text -> [Text]
text Data.Text
O(n) Splits a Text into components of length k. The last element may be shorter than the other chunks, depending on the length of the input. Examples: > chunksOf 3 "foobarbaz" == ["foo","bar","baz"] > chunksOf 4 "haskell.org" == ["hask","ell.","org"]
number :: Int -> String -> String
QuickCheck Test.QuickCheck.Text
short :: Int -> String -> String
QuickCheck Test.QuickCheck.Text
insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
base Data.List
The non-overloaded version of insert.
deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
base Data.List
The deleteBy function behaves like delete, but takes a user-supplied equality predicate.
zipWithM :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c]
base Control.Monad
The zipWithM function generalizes zipWith to arbitrary monads.
(>>) :: Monad m => m a -> m b -> m b
base Prelude, base Control.Monad, base Control.Monad.Instances

Show more results