map is:exact -package:text -package:base -package:containers -package:aeson -package:charset -package:conduit -package:basement -package:pipes -package:base-prelude

Apply a function to each element of a Stream, lazily

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.

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.

Fold pairs into a map.

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.

Apply a bijection over a list using map.

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.

O(n) Modify every value in the queue.

O(n) Modify every value in the queue.

O(n) Modify every value in the queue.