unionsWith -package:multi-containers

unionsWith :: Foldable f => (a -> a -> a) -> f (IntMap a) -> IntMap a
containers Data.IntMap.Internal Data.IntMap.Lazy Data.IntMap.Strict Data.IntMap.Strict.Internal
The union of a list of maps, with a combining operation. 
unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
== fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
unionsWith :: (Foldable f, Ord k) => (a -> a -> a) -> f (Map k a) -> Map k a
containers Data.Map.Internal Data.Map.Lazy Data.Map.Strict Data.Map.Strict.Internal, rio RIO.Map
The union of a list of maps, with a combining operation: (unionsWith f == foldl (unionWith f) empty). 
unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
== fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
unionsWith :: Foldable f => (a -> a -> a) -> f (Word64Map a) -> Word64Map a
ghc GHC.Data.Word64Map.Internal GHC.Data.Word64Map.Lazy GHC.Data.Word64Map.Strict GHC.Data.Word64Map.Strict.Internal, ghc-lib-parser GHC.Data.Word64Map.Internal GHC.Data.Word64Map.Lazy GHC.Data.Word64Map.Strict GHC.Data.Word64Map.Strict.Internal
The union of a list of maps, with a combining operation. 
unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
== fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
unionsWith :: (a -> a -> a) -> [CharMap a] -> CharMap a
regex-tdfa Data.IntMap.CharMap2
unionsWith :: Enum key => (a -> a -> a) -> [EnumMap key a] -> EnumMap key a
regex-tdfa Data.IntMap.EnumMap2
unionsWith :: IsMap map => (MapValue map -> MapValue map -> MapValue map) -> [map] -> map
mono-traversable Data.Containers
Combine a list of maps. When a key exists in two different maps, apply a function to both of the values and use the result of that as the value of the key in the resulting map.
unionsWith :: forall a . (a -> a -> a) -> [MonoidalIntMap a] -> MonoidalIntMap a
monoidal-containers Data.IntMap.Monoidal Data.IntMap.Monoidal.Strict
unionsWith :: forall k a . Ord k => (a -> a -> a) -> [MonoidalMap k a] -> MonoidalMap k a
monoidal-containers Data.Map.Monoidal Data.Map.Monoidal.Strict
unionsWith :: Ord n => (e -> e -> e) -> [Graph n e] -> Graph n e
Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional
Union. The function is used to combine edge labels for edges that occur in several graphs. O((n + e) log n (where n and e refer to the resulting graph).
unionsWith :: (a -> a -> a) -> [EnumMap k a] -> EnumMap k a
enummapset Data.EnumMap.Lazy Data.EnumMap.Strict
unionsWith :: Ord k => (a -> a -> a) -> [Map k a] -> Map k a
hashmap Data.HashMap
The union of a list of maps, with a combining operation.
unionsWith :: Foldable1 f => (a -> a -> a) -> f (NEIntMap a) -> NEIntMap a
nonempty-containers Data.IntMap.NonEmpty
The union of a non-empty list of maps, with a combining operation: (unionsWith f == foldl1 (unionWith f)). 
unionsWith (++) (fromList ((5, "a") :| [(3, "b")]) :| [fromList ((5, "A") :| [(7, "C")]), fromList ((5, "A3") :| [(3, "B3")])])
== fromList ((3, "bB3") :| [(5, "aAA3"), (7, "C")])
unionsWith :: (Foldable1 f, Ord k) => (a -> a -> a) -> f (NEMap k a) -> NEMap k a
nonempty-containers Data.Map.NonEmpty
The union of a non-empty list of maps, with a combining operation: (unionsWith f == foldl1 (unionWith f)). 
unionsWith (++) (fromList ((5, "a") :| [(3, "b")]) :| [fromList ((5, "A") :| [(7, "C")]), fromList ((5, "A3") :| [(3, "B3")])])
== fromList ((3, "bB3") :| [(5, "aAA3"), (7, "C")])
unionsWith :: Ord k => (a -> a -> a) -> [IntervalMap k a] -> IntervalMap k a
data-interval Data.IntervalMap.Lazy Data.IntervalMap.Strict
The union of a list of maps, with a combining operation: (unionsWith f == foldl (unionWith f) empty).
unionsWith :: (Interval k e, Ord k) => (a -> a -> a) -> [IntervalMap k a] -> IntervalMap k a
IntervalMap Data.IntervalMap.Generic.Lazy Data.IntervalMap.Generic.Strict Data.IntervalMap.Lazy Data.IntervalMap.Strict
The union of a list of maps, with a combining operation: (unionsWith f == foldl (unionWith f) empty).
unionsWithKey :: GCompare k => (forall v . k v -> f v -> f v -> f v) -> [DMap k f] -> DMap k f
dependent-map Data.Dependent.Map
The union of a list of maps, with a combining operation: (unionsWithKey f == foldl (unionWithKey f) empty).
unionsWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> f v -> f v) -> [MonoidalDMap k2 f] -> MonoidalDMap k2 f
dependent-monoidal-map Data.Dependent.Map.Monoidal
The union of a list of maps, with a combining operation: (unionsWithKey f == foldl (unionWithKey f) empty).