monoidal-containers

Containers with monoidal accumulation

Version0.6.8.0
CategoryData
LicenceBSD-3-Clause
AuthorBen Gamari
Maintainerben@smart-cactus.org
Homepagegithub.com/bgamari/monoidal-containers
Pinned byhackage monoidal-containers 0.6.8.0
Sourcehackage.haskell.org/package/monoidal-containers-0.6.8.0

Modules

5 modules

Data.HashMap.Monoidal20This module provides a Data.HashMap variant which uses the value's
Data.IntMap.Monoidal98This module provides a Data.IntMap variant which uses the value's
Data.IntMap.Monoidal.Strict98This module provides a Data.IntMap variant which uses the value's
Data.Map.Monoidal120This module provides a Data.Map variant which uses the value's
Data.Map.Monoidal.Strict120This module provides a Data.Map variant which uses the value's

Description

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)

Depends on

11 packages

aeson-2.3.2.0in this set
base-4.23.0.0with GHC
containers-0.8with GHC
deepseq-1.5.2.0with GHC
hashable-1.5.1.0in this set
lens-5.3.6in this set
newtype-0.2.2.1in this set
semialign-1.4in this set
these-1.2.1in this set
unordered-containers-0.2.21in this set
witherable-0.5in this set

Used by in this set · 0

Nothing in this set depends on it.