name: diagrams-solve
version: 0.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 ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.8 || ==9.6.5 || ==9.8.2 || ==9.10.1 || ==9.12.1 || ==9.14.1
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,
diagrams-solve,
tasty >= 0.10 && < 1.6,
tasty-quickcheck >= 0.8 && < 0.12