cabal-version: 1.12
name:           pareto-front
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
license:        BSD3
license-file:   LICENSE
build-type:     Simple
extra-source-files:
    README.md
    ChangeLog.md

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

library
  exposed-modules:
      Math.ParetoFront
  other-modules:
      Paths_pareto_front
  hs-source-dirs:
      src
  build-depends:
      base >=4.7 && <5
  default-language: Haskell2010

test-suite pareto-test
  type: exitcode-stdio-1.0
  main-is: Spec.hs
  other-modules:
      Paths_pareto_front
  hs-source-dirs:
      test
  ghc-options: -threaded -rtsopts -with-rtsopts=-N
  build-depends:
      base >=4.7 && <5
    , pareto-front
  default-language: Haskell2010