name:                exp-pairs
version:             0.2.1.1
x-revision: 1
synopsis:            Linear programming over exponent pairs
description:         Package implements an algorithm to minimize rational objective function over the set of exponent pairs
homepage:            https://github.com/Bodigrim/exp-pairs
license:             GPL-3
license-file:        LICENSE
author:              Andrew Lelechenko
maintainer:          andrew.lelechenko@gmail.com
category:            Math
build-type:          Simple
extra-source-files:  tests/*.txt
extra-doc-files:     README.md, CHANGELOG.md
cabal-version:       1.18
tested-with:
  GHC ==8.4.4 GHC ==8.6.5 GHC ==8.8.4 GHC ==8.10.7 GHC ==9.0.2 GHC ==9.2.8 GHC ==9.4.8 GHC ==9.6.6 GHC ==9.8.4 GHC ==9.10.1 GHC ==9.12.1

source-repository head
  type:     git
  location: https://github.com/Bodigrim/exp-pairs.git

library
  exposed-modules:     Math.ExpPairs,
                       Math.ExpPairs.Ivic,
                       Math.ExpPairs.Kratzel,
                       Math.ExpPairs.MenzerNowak
                       Math.ExpPairs.LinearForm,
                       Math.ExpPairs.Matrix3,
                       Math.ExpPairs.Pair,
                       Math.ExpPairs.Process,
                       Math.ExpPairs.PrettyProcess,
                       Math.ExpPairs.ProcessMatrix,
                       Math.ExpPairs.RatioInf
  build-depends:       base >=4.11 && <5,
                       ghc-prim < 1,
                       prettyprinter >= 1.7 && < 1.8,
                       deepseq >=1.3 && <1.6,
                       containers < 0.9
  default-language:    Haskell2010
  ghc-options:         -Wall -fno-warn-type-defaults -Wcompat

test-suite tests
  type:                exitcode-stdio-1.0
  main-is:             Tests.hs
  other-modules:       Etalon,
                       Instances,
                       Ivic,
                       Kratzel,
                       LinearForm,
                       Matrix3,
                       MenzerNowak,
                       Pair,
                       Process,
                       PrettyProcess,
                       RatioInf
  build-depends:       base,
                       tasty >=0.7,
                       tasty-quickcheck,
                       tasty-smallcheck,
                       tasty-hunit,
                       QuickCheck >=2.9,
                       smallcheck >=1.2,
                       exp-pairs,
                       matrix >=0.3.4,
                       random
  hs-source-dirs:      tests
  default-language:    Haskell2010
  ghc-options:         -Wall -fno-warn-type-defaults -Wcompat -Wno-incomplete-uni-patterns

benchmark matrix-bench
  build-depends:
    base,
    exp-pairs,
    tasty-bench
  type: exitcode-stdio-1.0
  main-is: BenchMatrix.hs
  default-language: Haskell2010
  hs-source-dirs: auxiliary
  ghc-options: -Wall -fno-warn-type-defaults -Wcompat

benchmark optimize-sum
  build-depends:
    base < 5,
    bimap,
    containers,
    prettyprinter,
    raw-strings-qq
  type: exitcode-stdio-1.0
  main-is: OptimizeSum.hs
  default-language: Haskell2010
  hs-source-dirs: auxiliary
  ghc-options: -Wall -fno-warn-type-defaults -Wcompat