map -package:Cabal -package:base -package:case-insensitive -package:bytestring -package:blaze-html -package:unordered-containers -package:containers -package:pipes is:exact -package:ghc -package:conduit

O(n) map f t is the Text obtained by applying f to each element of t. Example:
>>> let message = pack "I am not angry. Not at all."

>>> T.map (\c -> if c == '.' then '!' else c) message
"I am not angry! Not at all!"
Performs replacement on invalid scalar values.
O(n) map f xs is the Stream Char obtained by applying f to each element of xs. Properties
unstream . map f . stream = map f
O(n) map f t is the Text obtained by applying f to each element of t. Performs replacement on invalid scalar values.
Map a function over all values in the map.
O(n) Map a function over a vector.
Map a function over a Bundle
Map a function over a Bundle
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
map f xs is the list obtained by applying f to each element of xs, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
>>> map (+1) [1, 2, 3]
[2,3,4]
Generates a map using a Range to determine the length. This may fail to generate anything if the keys produced by the generator do not account for a large enough number of unique items to satify the required map size.
map f xs is the DList obtained by applying f to each element of xs. <math>(length (toList xs)). map obeys the law:
toList (map f xs) = map f (toList xs)
map f xs is the DNonEmpty obtained by applying f to each element of xs. <math>(length (toNonEmpty xs)). map obeys the law:
toNonEmpty (map f xs) = map f (toNonEmpty xs)
Map a function over a NonEmpty stream.
Fold pairs into a map.
Maps a pure function over an InputStream. map f s passes all output from s through the function f. Satisfies the following laws:
Streams.map (g . f) === Streams.map f >=> Streams.map g
Streams.map id === Streams.makeInputStream . Streams.read
map f xs is the list obtained by applying f to each element of xs, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]
this means that map id == id

Examples

>>> map (+1) [1, 2, 3]
[2,3,4]
>>> map id [1, 2, 3]
[1,2,3]
>>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]
Standard map on the elements of a stream.
>>> S.stdoutLn $ S.map reverse $ each (words "alpha beta")
ahpla
ateb