# map -package:base -is:exact -is:exact -package:unordered-containers -package:case-insensitive -package:text is:exact

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.
O(n). Map a function over all values in the map.
```map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
```
O(n*min(n,W)). 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
O(n). Map a function over all values in the map.
```map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
```
O(n*log n). 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.
O(n) Map a function over a vector.
Map a function over a Bundle
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
Apply a transformation to all values in a stream. Subject to fusion
Apply a transformation to all values in a stream. Subject to fusion Since 0.3.0
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]
```
Combinator for the <map> element. Example:
```map \$ span \$ toHtml "foo"
```
Result:
```<map><span>foo</span></map>
```
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]
```
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 function to all values flowing downstream
```map id = cat

map (g . f) = map f >-> map g
```
map f xs is the DList obtained by applying f to each element of xs. [itex](length (toList xs)). map obeys the law:
```toList (map f xs) = map f (toList xs)
```