monoidal-containers

Containers with monoidal accumulation http://github.com/bgamari/monoidal-containers

Version on this page:	0.1.2.5
LTS Haskell 12.24:	0.3.1.0
Stackage Nightly 2018-12-19:	0.4.0.0
Latest on Hackage:	0.4.0.0

See all snapshots monoidal-containers appears in

BSD3 licensed by Ben Gamari

Maintained by ben@smart-cactus.org

Module documentation for 0.1.2.5

Data
- Data.HashMap
  - Data.HashMap.Monoidal
- Data.Map
  - Data.Map.Monoidal

Containers with merging via monoidal accumulation. The Monoid instances provided by the containers and unordered-containers packages merge structures in a left-biased manner instead of using the underlying monoidal structure of the value.

This package wraps the types provided by these packages, but provides Monoid instances implemented in terms of the value type's mappend. For instance, the Monoid Map instance looks like,

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

Changes

Monoidal containers

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

Depends on 9 packages:

aeson, base, containers, deepseq, hashable, lens, newtype, semigroups, unordered-containers

Used by 1 package:

acme-everything