map is:exact -package:unordered-containers -package:dlist -package:conduit -package:bytestring -package:base-prelude package:containers

map :: (a -> b) -> IntMap a -> IntMap b
containers Data.IntMap.Internal Data.IntMap.Lazy Data.IntMap.Strict Data.IntMap.Strict.Internal
Map a function over all values in the map. 
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (Key -> Key) -> IntSet -> IntSet
containers Data.IntSet Data.IntSet.Internal
map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y
map :: (a -> b) -> Map k a -> Map k b
containers Data.Map.Internal Data.Map.Lazy Data.Map.Strict Data.Map.Strict.Internal
Map a function over all values in the map. 
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: Ord b => (a -> b) -> Set a -> Set b
containers Data.Set Data.Set.Internal
map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y