monoidal-containers: Containers with monoidal accumulation

[ bsd3, data, library ] [ Propose Tags ]

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)
Versions [faq] 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.1.2.3, 0.1.2.4, 0.1.2.5, 0.2.0.0, 0.3.0.0, 0.3.0.1, 0.3.0.2, 0.3.1.0, 0.4.0.0, 0.5.0.0, 0.5.0.1, 0.6, 0.6.0.1 (info)
Dependencies base (>=4.5 && <4.11), containers (==0.5.*), deepseq (>=1.3 && <1.5), hashable (==1.2.*), lens (>=4.4 && <5), newtype (==0.2.*), unordered-containers (==0.2.*) [details]
License BSD-3-Clause
Copyright (c) 2014 Ben Gamari
Author Ben Gamari
Maintainer ben@smart-cactus.org
Category Data
Home page http://github.com/bgamari/monoidal-containers
Source repo head: git clone git://github.com/bgamari/monoidal-containers
Uploaded by BenGamari at 2017-08-01T13:42:08Z
Distributions LTSHaskell:0.4.0.0, NixOS:0.6.0.1, Stackage:0.4.0.0
Downloads 11218 total (308 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees