monoidal-containers

Containers with monoidal accumulation

http://github.com/bgamari/monoidal-containers

Version on this page:	0.3.0.2
LTS Haskell 20.24:	0.6.4.0
Stackage Nightly 2023-06-04:	0.6.4.0
Latest on Hackage:	0.6.4.0

See all snapshots monoidal-containers appears in

BSD-3-Clause licensed by Ben Gamari

Maintained by ben@smart-cactus.org

This version can be pinned in stack with:monoidal-containers-0.3.0.2@sha256:bce9f7a1845a841f41eb25954a395eb41620ce5bd611c9e6d41eb7c6516602be,1939

Module documentation for 0.3.0.2

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

Depends on 7 packages(full list with versions):

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

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, Monoid a) => Monoid (MonoidalMap k a)