homepage: https://github.com/andrewthad/non-empty-containers#readme
changelog-type: ''
hash: 8e12edba9288f8c5e53c8ad4003dace546fcc5a7e9828a88b614c3049924a13a
test-bench-deps: {}
maintainer: andrew.thaddeus@gmail.com
synopsis: ''
changelog: ''
basic-deps:
  semigroupoids: ! '>=5.2.0 && <6.0'
  base: ! '>=4.11 && <5'
  containers: ! '>=0.5.10 && <0.7'
all-versions:
- 0.1.0.0
- 0.1.1.0
- 0.1.2.0
author: Andrew Martin
latest: 0.1.2.0
description-type: markdown
description: ! '# non-empty-containers

'
license-name: BSD-3-Clause

homepage: https://github.com/andrewthad/non-empty-containers#readme
changelog-type: ''
hash: a789d2a7d20e3dab7ef8c4ac818cb2cd9713cf44ecb8f7fa2167305b76a8e765
test-bench-deps: {}
maintainer: andrew.thaddeus@gmail.com
synopsis: ''
changelog: ''
basic-deps:
  semigroupoids: ! '>=5.2.0 && <6.0'
  base: ! '>=4.11 && <5'
  containers: ! '>=0.5.10 && <0.7'
all-versions:
- 0.1.0.0
- 0.1.1.0
- 0.1.2.0
- 0.1.4.0
author: Andrew Martin
latest: 0.1.4.0
description-type: markdown
description: |
  # non-empty-containers

  `non-empty-containers` provides two new data structures, `NonEmptyMap` and
  `NonEmptySet`, by extending Haskell's built-in `Map` and `Set` data structures.

  Both structures are guaranteed to contain at least one element.
license-name: BSD-3-Clause

Update from Hackage at 2018-12-30T15:38:54Z
Update from Hackage at 2018-12-30T15:38:54Z
