map -package:blaze-html -package:bytestring -package:autodocodec -package:clay -package:containers

Map a function over all values in the map.

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]

Map a function over a NonEmpty stream.

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.

Apply a function to each element of a Stream, lazily

Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

Apply a function to each element, returning any other valid ListLike. rigidMap will always be at least as fast, if not faster, than this function and is recommended if it will work for your purposes. See also mapM.

Apply a function uniformly over all elements of a sequence.

Map all element a from a block to a new block of b

Map all elements in a list

O(n*log n) Map a function over all the left keys in the map. Version 0.3

Map over bytes in a sequence. The result has the same length as the argument.

Transform the original string-like value but keep it case insensitive.

"map f xs" is the vector obtained by applying f to each element of xs, i.e.,

map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)

and corresponds to the following circuit layout: