map -package:base -is:exact -is:exact -package:case-insensitive -package:text -package:ghc -package:containers
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.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
O(n) Map a function over a vector.
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"]
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]
A Map from keys
k to values
a.
The
Semigroup operation for
Map is
union, which
prefers values from the left operand. If
m1 maps a key
k to a value
a1, and
m2 maps the same key
to a different value
a2, then their union
m1 <>
m2 maps
k to
a1.
Not on Stackage, so not searched.
Class of key-value maps
The
mapAccumL function behaves like a combination of
map
and
foldl; it applies a function to each element of a
ByteString, passing an accumulating parameter from left to right, and
returning a final value of this accumulator together with the new
ByteString.
The
mapAccumR function behaves like a combination of
map
and
foldr; it applies a function to each element of a
ByteString, passing an accumulating parameter from right to left, and
returning a final value of this accumulator together with the new
ByteString.
The
mapAccumL function behaves like a combination of
map
and
foldl; it applies a function to each element of a
ByteString, passing an accumulating parameter from left to right, and
returning a final value of this accumulator together with the new
ByteString.
The
mapAccumR function behaves like a combination of
map
and
foldr; it applies a function to each element of a
ByteString, passing an accumulating parameter from right to left, and
returning a final value of this accumulator together with the new
ByteString.
Apply a transformation to the other computation.
Map both the return value and output of a computation using the given
function.
Map both the return value and output of a computation using the given
function.
Apply a function to transform the result of a continuation-passing
computation.