map -package:charset -package:base is:exact -package:byteslice -package:ghc -package:Cabal-syntax
Map a function over all values in the map.
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.
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
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
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!"
Performs replacement on invalid scalar values.
O(n) map f t is the
Text
obtained by applying
f to each element of
t.
Performs replacement on invalid scalar values.
Apply a function to each element, returning any other valid
ListLike.
rigidMap will always be at least as fast, if
not faster, than this function and is recommended if it will work for
your purposes. See also
mapM.
Apply a function uniformly over all elements of a sequence.
Map all element a from a block to a new block of b
Map all elements in a list
O(n*log n) Map a function over all the left keys in the map.
Version 0.3
Combinator for the
<map> element.
Example:
map $ span $ toHtml "foo"
Result:
<map><span>foo</span></map>