# More containers [![Stackage LTS](https://stackage.org/package/more-containers/badge/lts)](https://stackage.org/lts/package/more-containers) [![Stackage Nightly](https://stackage.org/package/more-containers/badge/nightly)](https://stackage.org/nightly/package/more-containers) [![Hackage](https://img.shields.io/hackage/v/more-containers.svg)](https://hackage.haskell.org/package/more-containers) [![Build Status](https://travis-ci.org/mtth/more-containers.svg?branch=master)](https://travis-ci.org/mtth/more-containers)

+ [`Multimap`](https://hackage.haskell.org/package/more-containers/docs/Data-Multimap.html)

  > [...] a multimap (sometimes also multihash or multidict) is a
  > generalization of a map or associative array abstract data type in which
  > more than one value may be associated with and returned for a given key. --
  > [Wikipedia](https://en.wikipedia.org/wiki/Multimap)

+ [`Multiset`](https://hackage.haskell.org/package/more-containers/docs/Data-Multiset.html)

  > [...] a multiset (aka bag or mset) is a modification of the concept of a
  > set that, unlike a set, allows for multiple instances for each of its
  > elements. -- [Wikipedia](https://en.wikipedia.org/wiki/Multiset)