map -package:containers -package:aeson -package:insert-ordered-containers -package:foldl -package:base -package:ghc is:exact -package:conduit -package:invertible

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 a NonEmpty stream.
Map all element a from a block to a new block of b
Map all elements in a list
Combinator for the <map> element. Example:
map $ span $ toHtml "foo"
Result:
<map><span>foo</span></map>
O(n) map f xs is the ByteString obtained by applying f to each element of xs.
O(n) map f xs is the ByteString 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.
Transform the original string-like value but keep it case insensitive.
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.
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.
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.