quickdudley/pareto-front - Change F3FKUZOB7UDNXH46C3I3UBK7JSL757B5B5UPQ6RQ3DTRU4BT7YSAC

Release

Created by quickdudley on February 8, 2022

F3FKUZOB7UDNXH46C3I3UBK7JSL757B5B5UPQ6RQ3DTRU4BT7YSAC

Dependencies

In channels

main

Change contents

Replacement in pareto-front.cabal at line 3 [2.442]

B:BD[2.492] → [2.492:840]

version:        0.1.0.0
description:    Please see the README on GitHub at <https://github.com/githubuser/pareto#readme>
homepage:       https://github.com/githubuser/pareto#readme
bug-reports:    https://github.com/githubuser/pareto/issues
author:         Author name here
maintainer:     example@example.com
copyright:      2022 Author name here

[2.492]

[2.840]

version:        0.1.0.1
description:    Two monoids for finding either the Pareto efficient
                subset of a collection or splitting the collection into a
                series of Pareto fronts.
synopsis:       Monoids for dealing with Pareto efficiency
homepage:       https://nest.pijul.com/quickdudley/pareto-front
bug-reports:    https://nest.pijul.com/quickdudley/discussions
category:       math
author:         Jeremy List
maintainer:     quick.dudley@gmail.com
copyright:      2022 Jeremy List

Replacement in pareto-front.cabal at line 22 [2.442]

B:BD[2.983] → [2.983:1044]

  type: git
  location: https://github.com/githubuser/pareto

[2.983]

[2.1044]

  type: pijul
  location: https://nest.pijul.com/quickdudley/pareto-front

Replacement in pareto-front.cabal at line 40 [2.442]
B:BD[2.1324] → [2.1324:1343]
```
      Paths_pareto
```
[2.1324]
[2.1343]
```
      Paths_pareto_front
```

Replacement in README.md at line 1 [3.4615]

B:BD[3.4615] → [3.4616:4625]

# pareto

[3.4615]

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