exp-pairs-0.1.2.0: exp-pairs.cabal

name:                exp-pairs
version:             0.1.2.0
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
cabal-version:       >=1.10

source-repository head
  type:     git
  location: git://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.RatioInf
  build-depends:       base >=4 && <5,
                       memoize >=0.1,
                       ghc-prim
  default-language:    Haskell2010
  ghc-options:         -Wall

test-suite tests
  type:                exitcode-stdio-1.0
  main-is:             Tests.hs
  build-depends:       base >=4 && <5,
                       tasty >=0.7,
                       tasty-quickcheck,
                       tasty-smallcheck,
                       tasty-hunit,
                       QuickCheck >=2.4.2,
                       smallcheck >=0.2.1,
                       exp-pairs,
                       memoize >=0.1,
                       matrix >=0.1,
                       random
  hs-source-dirs:      tests
  default-language:    Haskell2010
  ghc-options:         -Wall