monoidal-containers: Containers with monoidal accumulation

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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)


Change logNone available
Dependenciesbase (>=4.5 && <4.10), containers (==0.5.*), deepseq (>=1.3 && <1.5), hashable (==1.2.*), lens (>=4.4 && <5), newtype (==0.2.*), unordered-containers (==0.2.*) [details]
Copyright(c) 2014 Ben Gamari
AuthorBen Gamari
Home page
Source repositoryhead: git clone git://
UploadedSun Oct 9 22:30:55 UTC 2016 by BenGamari




Maintainers' corner

For package maintainers and hackage trustees