Module documentation for 0.6.5.0

• Data
  • Data.HashMap
    • Data.HashMap.Monoidal
  • Data.IntMap
    • Data.IntMap.Monoidal
      • Data.IntMap.Monoidal.Strict
  • Data.Map
    • Data.Map.Monoidal
      • Data.Map.Monoidal.Strict

Containers with merging via monoidal accumulation. TheMonoid instancesprovided by thecontainers andunordered-containers packages mergestructures in a left-biased manner instead of using the underlying monoidalstructure of the value.

This package wraps the types provided by these packages, but providesMonoidinstances implemented in terms of the value type'smappend. For instance,theMonoidMap instance looks like,

instance (Ord k, Semigroup a) => Monoid (MonoidalMap k a)

Monoidal containers

0.6.5.0

• Support for GHC 9.10

0.6.4.0

• Bump upper bound ofthese
• Bump upper bound ofsemialign
• Build with GHC 9.6

0.6.3.0

• Bump upper bounds of aeson, base, and lens

0.6.2.0

• Remove cyclic definition of!?
• Bump lens and hashable version bounds

0.6.1.0

• Drop official support for GHC 7.8.4
• Require containers 0.5.9 or greater.
• Support lens-5, semialign-1.2, and aeson-2
• MonoidalMap and MonoidalMap.Strict: Add several functions added to Data.Map since 0.5 up to 0.5.9:take,drop,splitAt,lookupMin,lookupMax,restrictKeys,withoutKeys,fromDescList,fromDescListWith,fromDescListWithKey,fromDistinctDescList,takeWhileAntitone,dropWhileAntitone,spanAntitone, andtraverseMaybeWithKey
• Add instances ofFilterable andWitherable from thewitherable package
• AddControl.Lens.Wrapped.Rewrapped instances.

0.6.0.1

• Support semialign-1.1

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
• MakefromList,insert, andmapKeys fromData.Map.Monoidal andData.Map.Monoidal.Strict requireSemigroup on values to properly capture monoidal behavior instead of reverting to the left-biased semantics ofData.Map.
• Add Align instances and, for sufficiently recent versions ofthese, Semialign instances
• Supportthese 0.8.0

0.4.0.0

General changes:

• Added support forunordered-containers < 0.2.8
• Added many more functions inData.Map.[Strict.]Monoid

WeakenedMonoid constraints toSemigroup whenever possible as enabled by theSemigroup-Monoidproposal.This includes,

• theMonoid instance ofMonoidalHashMap andMonoidalMap
• theIsList instance ofMonoidalHashMap andMonoidalMap
• themodifyDef andmapKeys functions ofMonoidalHashMap

0.3 and earlier

Pre-history