Monoidal containers

0.6

• Deprecates 0.5.* and reverts behavior of fromList, insert, mapKeys, etc. to match behavior in Data.Map. The only difference in behavior between Data.Map.Monoidal.MonoidalMap and Data.Map.Map is now the semigroup and monoid instances (as was the case in 0.4 and earlier).
• Fix the argument order of Data.HashMap.Monoidal.insert
• Remove Data.HashMap.Monoidal.insertOrReplace as it is now identical to Data.HashMap.Monoidal.insert
• Added Data.HashMap.Monoidal.insertWith and Data.HashMap.Monoidal.fromListWith

0.5.0.1

• Add a flag, split-these, to select whether to use the new "these"/"semialign" packages or the older combined "these" package.
• Add default.nix to make it easier to hack on this package in nix

0.5.0.0

• Added Data.IntMap.Monoidal and Data.IntMap.Monoidal.Strict, corresponding to Data.IntMap and Data.IntMap.Strict
• Make fromList, insert, and mapKeys from Data.Map.Monoidal and Data.Map.Monoidal.Strict require Semigroup on values to properly capture monoidal behavior instead of reverting to the left-biased semantics of Data.Map.
• Add Align instances and, for sufficiently recent versions of these, Semialign instances
• Support these 0.8.0

0.4.0.0

General changes:

• Added support for unordered-containers < 0.2.8
• Added many more functions in Data.Map.[Strict.]Monoid

Weakened Monoid constraints to Semigroup whenever possible as enabled by the Semigroup-Monoid proposal. This includes,

• the Monoid instance of MonoidalHashMap and MonoidalMap
• the IsList instance of MonoidalHashMap and MonoidalMap
• the modifyDef and mapKeys functions of MonoidalHashMap

0.3 and earlier

Pre-history