map -package:charset -package:basement -package:foldl -package:invertible -package:integration -package:base -package:aeson -package:conduit is:exact -package:pipes -package:os-string

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.
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.
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) Modify every value in the queue.
O(n) Modify every value in the queue.
O(n) Modify every value in the queue.