name:                monoidal-containers
version:             0.3.0.2
synopsis:            Containers with monoidal accumulation
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, Monoid a) => Monoid (MonoidalMap k a)
    @
homepage:            http://github.com/bgamari/monoidal-containers
license:             BSD3
license-file:        LICENSE
author:              Ben Gamari
maintainer:          ben@smart-cactus.org
copyright:           (c) 2014 Ben Gamari
category:            Data
build-type:          Simple
cabal-version:       >=1.10
tested-with:         GHC ==7.6.3, GHC ==7.8.4, GHC ==8.0.1

source-repository head
  type:                git
  location:            git://github.com/bgamari/monoidal-containers

library
  exposed-modules:     Data.Map.Monoidal
                       Data.HashMap.Monoidal
                       Data.Map.Monoidal.Strict
  other-extensions:    CPP,
                       MultiParamTypeClasses,
                       GeneralizedNewtypeDeriving,
                       DeriveTraversable,
                       DeriveDataTypeable
  build-depends:       base >=4.5 && <4.11,
                       containers >=0.5 && <0.6,
                       deepseq >=1.3 && <1.5,
                       unordered-containers >= 0.2 && < 0.3,
                       hashable >= 1.2 && < 1.3,
                       lens >=4.4 && <5,
                       newtype >=0.2 && <0.3
  hs-source-dirs:      src
  default-language:    Haskell2010