map -package:Cabal -package:base -package:text -package:pipes -package:containers -package:regex-tdfa -package:ghc -package:vector -package:unordered-containers -package:io-streams -package:rio package:ListLike

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.
A map in monad space. Same as sequence . map See also rigidMapM
A map in monad space, discarding results.
Map a function over the items and concatenate the results. See also rigidConcatMap.
Map each element to a monoid, then combine the results
Like concatMap, but without the possibility of changing the type of the item. This can have performance benefits for some things such as ByteString.
Like map, but without the possibility of changing the type of the item. This can have performance benefits for things such as ByteStrings, since it will let the ByteString use its native low-level map implementation.
Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.