<commit_before>homepage: https://github.com/mtth/more-containers
changelog-type: ''
hash: f0ef35c2a459529a50f3784ffe83ec5d73aad6881622bf8ca1188fe545065f65
test-bench-deps:
  more-containers: -any
  base: ! '>=4.11 && <5'
  hspec: ! '>=2.6'
  containers: ! '>=0.6'
maintainer: <EMAIL>
synopsis: A few more collections
changelog: ''
basic-deps:
  base: ! '>=4.11 && <5'
  containers: ! '>=0.6'
all-versions:
- 0.1.0.0
- 0.1.0.1
- 0.1.0.2
- 0.1.0.3
- 0.1.0.4
- 0.1.0.5
- 0.1.1.0
- 0.1.2.0
- 0.2.0.0
author: <NAME>
latest: 0.2.0.0
description-type: markdown
description: |
  # 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)

  ## Multisets

  ```haskell
  > m1 = fromList [1, 2, 1] :: Multiset Int
  > count 1 m -- 2
  > m2 = replicate 3 1 -- fromList [1, 1, 1]
  > insert 1 m == m2 <> singleton 2 -- True
  ```

  ## Multimaps

  This library provides both generic and versions specialized to lists, sets, and
  sequences.

  ```haskell
  > m1 = fromList [(1, "ab"), (2, "d")] :: ListMultimap Int Char
  > m1 ! 1 -- "ab"
  > m1 ! 3 -- ""
  > m2 = prepend 2 'c' m1 -- fromList [(1, "ab"), (2, "cd")]
  > toList m2 -- [(1, 'a'), (1, 'b'), (2, 'c'), (2, 'd')]
  ```
license-name: MIT<commit_msg>Update from Hackage at 2019-06-29T19:05:21Z<commit_after>homepage: https://github.com/mtth/more-containers
changelog-type: ''
hash: 5b48a25b23c867ca6b2991e7299a42cdbf4740257a66db416ca2a7092497f44c
test-bench-deps:
  more-containers: -any
  base: ! '>=4.11 && <5'
  hspec: ! '>=2.6'
  containers: ! '>=0.6'
maintainer: <EMAIL>
synopsis: A few more collections
changelog: ''
basic-deps:
  base: ! '>=4.11 && <5'
  containers: ! '>=0.6'
all-versions:
- 0.1.0.0
- 0.1.0.1
- 0.1.0.2
- 0.1.0.3
- 0.1.0.4
- 0.1.0.5
- 0.1.1.0
- 0.1.2.0
- 0.2.0.0
- 0.2.0.1
author: <NAME>
latest: 0.2.0.1
description-type: markdown
description: |
  # 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)
license-name: MIT
{'fraction_non_alphanumeric': 0.19268914706715784, 'fraction_numerical': 0.06857466704448853, 'mean_word_length': 3.663143989431968, 'pattern_counts': {'":': 0, '<': 12, '<?xml version=': 0, '>': 34, 'https://': 22, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 21, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '646825', 'n_tokens_mistral': 1552, 'n_tokens_neox': 1415, 'n_words': 262}