fold
:: t m -> m
Class Method

Combine the elements of a structure using a monoid.

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

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

Module
Map

*Note:* You should use Data.Map.Strict instead of this module if:

- You will eventually need all the values stored.
- The stored values don't represent large virtual data structures to be lazily computed.

An efficient implementation of ordered maps from keys to values (dictionaries).

These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

import qualified Data.Map as Map

The implementation of `Map`

is based on *size balanced* binary trees (or
trees of *bounded balance*) as described by:

- Stephen Adams, "
*Efficient sets: a balancing act*", Journal of Functional Programming 3(4):553-562, October 1993, http://www.swiss.ai.mit.edu/~adams/BB/. - J. Nievergelt and E.M. Reingold,
"
*Binary search trees of bounded balance*", SIAM journal of computing 2(1), March 1973.

Note that the implementation is *left-biased* -- the elements of a
first argument are always preferred to the second, for example in
`union`

or `insert`

.

Operation comments contain the operation time complexity in the Big-O notation (http://en.wikipedia.org/wiki/Big_O_notation).

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) -> 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
:: (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`

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

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")]

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 -> Set a -> 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.*

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
:: (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
:: (Char -> Char) -> Text -> Text

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