map -package:containers -package:charset -package:integration -package:imports -package:base-compat-batteries -package:ghc -package:base -package:bytestring -package:incipit-base -package:insert-ordered-containers -package:Cabal-syntax -package:os-string -package:case-insensitive -package:conduit -package:filepath -package:dlist -package:basement -package:amazonka-core -package:foldl -package:invertible -package:dense-linear-algebra -package:base-prelude
Map a function over all values in the map.
Combinator for the
<map> element.
Example:
map $ span $ toHtml "foo"
Result:
<map><span>foo</span></map>
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.
O(n) Transform this map by applying a function to every value.
Apply a function to all values flowing downstream
map id = cat
map (g . f) = map f >-> map g
O(n) Modify every value in the queue.
O(n) Modify every value in the queue.
O(n) Modify every value in the queue.
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.
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"]
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.