name:                diagrams-solve
version:             0.1.3
x-revision: 2
synopsis:            Pure Haskell solver routines used by diagrams
description:         Pure Haskell solver routines used by the diagrams
                     project.  Currently includes finding real roots
                     of low-degree (n < 5) polynomials, and solving
                     tridiagonal and cyclic tridiagonal linear
                     systems.
homepage:            https://diagrams.github.io
license:             BSD3
license-file:        LICENSE
author:              various
maintainer:          diagrams-discuss@googlegroups.com
category:            Math
build-type:          Simple
extra-source-files:  README.markdown, CHANGES.markdown
cabal-version:       >=1.10
Tested-with:         GHC ==7.6.3 || ==7.8.4 || ==7.10.3 || ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.4 || ==9.4.5 || ==9.6.2
Source-repository head
  type:     git
  location: http://github.com/diagrams/diagrams-solve.git

library
  exposed-modules:     Diagrams.Solve.Polynomial,
                       Diagrams.Solve.Tridiagonal
  build-depends:       base >=4.5 && < 5.0
  hs-source-dirs:      src
  default-language:    Haskell2010

test-suite tests
  type: exitcode-stdio-1.0
  main-is: Test.hs
  -- other-modules: Instances
  hs-source-dirs: tests
  default-language:    Haskell2010
  build-depends:       base >= 4.2 && < 5.0,
                       deepseq >= 1.3 && < 1.6,
                       diagrams-solve,
                       tasty >= 0.10 && < 1.6,
                       tasty-hunit >= 0.9.2 && < 0.11,
                       tasty-quickcheck >= 0.8 && < 0.11