homepage: https://nest.pijul.com/quickdudley/pareto-front
changelog-type: markdown
hash: 1fb6c254fec179e998a8fd24cd5cf052b4cf26994916d692c2da8cec6b6b5b14
test-bench-deps:
  base: '>=4.7 && <5'
  pareto-front: -any
maintainer: quick.dudley@gmail.com
synopsis: Monoids for dealing with Pareto efficiency
changelog: |
  # Changelog for pareto

  ## Unreleased changes
basic-deps:
  base: '>=4.7 && <5'
all-versions:
- 0.1.0.0
author: Jeremy List
latest: 0.1.0.0
description-type: markdown
description: |
  # pareto
license-name: BSD-3-Clause

homepage: https://nest.pijul.com/quickdudley/pareto-front
changelog-type: markdown
hash: 2b529746ff35dafc1ac6028539180c2694bad13ffd567406aeb0b6b4e35e380d
test-bench-deps:
  base: '>=4.7 && <5'
  pareto-front: -any
maintainer: quick.dudley@gmail.com
synopsis: Monoids for dealing with Pareto efficiency
changelog: |
  # Changelog for pareto

  ## Unreleased changes
basic-deps:
  base: '>=4.7 && <5'
all-versions:
- 0.1.0.0
- 0.1.0.1
author: Jeremy List
latest: 0.1.0.1
description-type: markdown
description: |+
  # pareto-front

  Two monoids for finding either the Pareto efficient subset of a collection or
  splitting the collection into a series of Pareto fronts.

license-name: BSD-3-Clause

Update from Hackage at 2022-02-09T03:11:06Z
Update from Hackage at 2022-02-09T03:11:06Z
