Map a function over all values in the map.

unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict, rio RIO.HashMap

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"]

Apply a function to each element of a Stream, lazily

ghc GHC.Prelude.Basic, base-compat Prelude.Compat, haskell-gi-base Data.GI.Base.ShortPrelude, relude Relude.List.Reexport

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]

Apply a function to all values flowing downstream

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

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

Map a function over a NonEmpty stream.

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

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]