map -package:Cabal -package:base -package:text -is:exact -package:containers -package:base-compat -package:hedgehog

O(n) map f xs is the ByteString obtained by applying f to each element of xs.

O(n) map f xs is the ByteString obtained by applying f to each element of xs

O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.

Map a function over all values in the map.

Transform this map by applying a function to every value.

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

>>> HashSet.map show (HashSet.fromList [1,2,3])
HashSet.fromList ["1","2","3"]

Transform the original string-like value but keep it case insensitive.

Apply a transformation to all values in a stream. Subject to fusion

Apply a transformation to all values in a stream. Subject to fusion Since 0.3.0

Apply a function to each element of a Stream, lazily

Map a function over all values in the map.

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

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

Combinator for the <map> element. Example:

map $ span $ toHtml "foo"

Result:

<map><span>foo</span></map>

Apply a function to all values flowing downstream

map id = cat

map (g . f) = map f >-> map g

map f xs is the DList obtained by applying f to each element of xs. <math>(length (toList xs)). map obeys the law:

toList (map f xs) = map f (toList xs)

map f xs is the DNonEmpty obtained by applying f to each element of xs. <math>(length (toNonEmpty xs)). map obeys the law:

toNonEmpty (map f xs) = map f (toNonEmpty xs)

Fold pairs into a map.

Maps a pure function over an InputStream. map f s passes all output from s through the function f. Satisfies the following laws:

Streams.map (g . f) === Streams.map f >=> Streams.map g
Streams.map id === Streams.makeInputStream . Streams.read