base -Data.List  

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, ...]

base -GHC.OldList  

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, ...]

base -Prelude  

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

bytestring -Data.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

text -Data.Text.Lazy  

O(n) map f t is the Text obtained by applying f to each element of t. Subject to fusion. Performs replacement on invalid scalar values.

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

text -Data.Text  

O(n) map f t is the Text obtained by applying f to each element of t. Subject to fusion. Performs replacement on invalid scalar values.

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

containers -Data.IntMap.Lazy  

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")]
map :: (Key -> Key) -> IntSet -> IntSet

containers -Data.IntSet  

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

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

containers -Data.Map.Lazy  

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

containers -Data.Map.Strict  

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

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: Ord b => (a -> b) -> Set a -> Set b

containers -Data.Set  

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 -> b) -> NonEmpty a -> NonEmpty b

semigroups -Data.List.NonEmpty  

Map a function over a NonEmpty stream.

containers -Data.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.

Warning: The size of the map must not exceed maxBound::Int. Violation of this condition is not detected and if the size limit is exceeded, its behaviour is undefined.

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