monoidal-containers

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

LTS Haskell 8.20:	0.3.0.1
Stackage Nightly 2017-06-28:	0.3.0.1
Latest on Hackage:	0.3.0.1

BSD3 licensed by Ben Gamari

Maintained by ben@smart-cactus.org

Module documentation for 0.3.0.1

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

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)

Depends on:

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

Used by 1 package:

acme-everything