map is:exact -package:bytestring -package:base-compat -package:blaze-html -package:base -package:conduit -package:case-insensitive -package:ghc -package:foldl -package:base-prelude -package:integration -package:charset -package:invertible -package:hedgehog -package:base-compat-batteries -package:incipit-base

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]

Map a function over all values in the map.

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

Map all elements in a list

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

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 function to every element of matrix

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)

O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.

O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.

O(n) map f xs is the OsString obtained by applying f to each element of xs.

O(n) map f xs is the OsString obtained by applying f to each element of xs.

O(n) map f xs is the OsString obtained by applying f to each element of xs.

Apply a function to all values flowing downstream

map id = cat

map (g . f) = map f >-> map g

O(n) Modify every value in the queue.