5 * Support semialign-1.1
9 * 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).
10 * Fix the argument order of Data.HashMap.Monoidal.insert
11 * Remove Data.HashMap.Monoidal.insertOrReplace as it is now identical to Data.HashMap.Monoidal.insert
12 * Added Data.HashMap.Monoidal.insertWith and Data.HashMap.Monoidal.fromListWith
16 * Add a flag, `split-these`, to select whether to use the new "these"/"semialign" packages or the older combined "these" package.
17 * Add default.nix to make it easier to hack on this package in nix
21 * Added Data.IntMap.Monoidal and Data.IntMap.Monoidal.Strict, corresponding to Data.IntMap and Data.IntMap.Strict
22 * 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`.
23 * Add Align instances and, for sufficiently recent versions of `these`, Semialign instances
24 * Support `these` 0.8.0
30 * Added support for `unordered-containers < 0.2.8`
31 * Added many more functions in `Data.Map.[Strict.]Monoid`
33Weakened `Monoid` constraints to `Semigroup` whenever possible as enabled by the
35proposal](https://prime.haskell.org/wiki/Libraries/Proposals/SemigroupMonoid).
38 * the `Monoid` instance of `MonoidalHashMap` and `MonoidalMap`
39 * the `IsList` instance of `MonoidalHashMap` and `MonoidalMap`
40 * the `modifyDef` and `mapKeys` functions of `MonoidalHashMap`
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list