map -package:containers -package:dlist -package:conduit -package:basement -package:dense-linear-algebra -package:case-insensitive -package:monoidal-containers -package:psqueues -package:incipit-base -package:insert-ordered-containers package:unordered-containers -is:exact is:exact

map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2
unordered-containers Data.HashMap.Internal Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict
Transform this map by applying a function to every value.
map :: (a -> b) -> Array a -> Array b
unordered-containers Data.HashMap.Internal.Array
map :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b
unordered-containers Data.HashSet Data.HashSet.Internal
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"]