fold
:: Monoid m => t m -> m
Class Method

Combine the elements of a structure using a monoid.

map
:: (a -> b) -> [a] -> [b]

map
:: (a -> b) -> [a] -> [b]

`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
:: (a -> b) -> [a] -> [b]

map
:: (Char -> Char) -> ByteString -> ByteString

bytestring - Data.ByteString.Char8

*O(n)* `map`

`f xs`

is the ByteString obtained by applying `f`

to each element of `xs`

map
:: (Char -> Char) -> ByteString -> ByteString

bytestring - Data.ByteString.Lazy.Char8

*O(n)* `map`

`f xs`

is the ByteString obtained by applying `f`

to each element of `xs`

map
:: (Word8 -> Word8) -> ByteString -> ByteString

bytestring - Data.ByteString.Lazy

*O(n)* `map`

`f xs`

is the ByteString obtained by applying `f`

to each
element of `xs`

.

map
:: (Word8 -> Word8) -> ByteString -> ByteString

*O(n)* `map`

`f xs`

is the ByteString obtained by applying `f`

to each
element of `xs`

.

map
:: (Char -> Char) -> Stream Char -> Stream Char

text - Data.Text.Internal.Fusion.Common

*O(n)* `map`

`f `

xs is the Stream Char obtained by applying `f`

to each element of `xs`

.

map
:: (Char -> Char) -> Text -> Text

map
:: (Char -> Char) -> Text -> Text

map
:: (a -> b) -> IntMap a -> IntMap b

*O(n)*. Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

map
:: (a -> b) -> IntMap a -> IntMap b

containers - Data.IntMap.Strict

*O(n)*. Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

fold
:: (a -> b -> b) -> b -> IntMap a -> b

fold
:: (Key -> b -> b) -> b -> IntSet -> b

*O(n)*. Fold the elements in the set using the given right-associative
binary operator. This function is an equivalent of `foldr`

and is present
for compatibility only.

*Please note that fold will be deprecated in the future and removed.*

map
:: (Key -> Key) -> IntSet -> IntSet

*O(n*min(n,W))*.

is the set obtained by applying `map`

f s`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 -> b) -> Map k a -> Map k b

*O(n)*. Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

map
:: (a -> b) -> Map k a -> Map k b

*O(n)*. Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

fold
:: (a -> b -> b) -> b -> Map k a -> b