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.

map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2

unordered-containers - Data.HashMap.Lazy  

O(n) Transform this map by applying a function to every value.

map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2

unordered-containers - Data.HashMap.Strict  

O(n) Transform this map by applying a function to every value.

map :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b

unordered-containers - Data.HashSet  

O(n) Transform this set by applying a function to every value. The resulting set may be smaller than the source.