foldMap -base

foldMapWithKey :: Monoid m => (Key -> a -> m) -> IntMap a -> m
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(n). Fold the keys and values in the map using the given monoid, such that > foldMapWithKey f = fold . mapWithKey f This can be an asymptotically faster than foldrWithKey or foldlWithKey for some monoids.
foldMapWithKey :: Monoid m => (k -> a -> m) -> Map k a -> m
containers Data.Map.Lazy, containers Data.Map.Strict
O(n). Fold the keys and values in the map using the given monoid, such that > foldMapWithKey f = fold . mapWithKey f This can be an asymptotically faster than foldrWithKey or foldlWithKey for some monoids.