map -package:Cabal -package:base -package:text -package:pipes -package:containers -package:regex-tdfa -package:bytestring -package:vector -package:conduit

O(n) map f xs is the ShortByteString 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.
Generates a map using a Range to determine the length. This may fail to generate anything if the keys produced by the generator do not account for a large enough number of unique items to satify the required map size.
Apply a function to each element of a Stream, lazily
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 (+1) [1, 2, 3]
[2,3,4]
Combinator for the <map> element. Example:
map $ span $ toHtml "foo"
Result:
<map><span>foo</span></map>
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)
Map a function over a NonEmpty stream.
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
Standard map on the elements of a stream.
>>> S.stdoutLn $ S.map reverse $ each (words "alpha beta")
ahpla
ateb
O(n) map f xs is the ByteString obtained by applying f to each element of xs.
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 (+1) [1, 2, 3]
O(n). Map a function over all values in the map.
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
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
O(n) map f t is the Text obtained by applying f to each element of t. Example:
>>> let message = pack "I am not angry. Not at all."

>>> T.map (\c -> if c == '.' then '!' else c) message
"I am not angry! Not at all!"
Subject to fusion. Performs replacement on invalid scalar values.
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.