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

base -Data.Foldable  

Combine the elements of a structure using a monoid.

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 :: (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")]
fold :: (a -> b -> b) -> b -> IntMap a -> b

containers -Data.IntMap  

Deprecated. As of version 0.5, replaced by foldr.

O(n). Fold the values in the map using the given right-associative binary operator. This function is an equivalent of foldr and is present for compatibility only.

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

containers -Data.IntSet  

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

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")]
fold :: (a -> b -> b) -> b -> Map k a -> b

containers -Data.Map  

Deprecated. As of version 0.5, replaced by foldr.

O(n). Fold the values in the map using the given right-associative binary operator. This function is an equivalent of foldr and is present for compatibility only.

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

containers -Data.Set  

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