Pure Haskell solver routines used by diagrams


Version on this page:0.1.3@rev:1
LTS Haskell 22.30:0.1.3@rev:3
Stackage Nightly 2024-07-24:0.1.3@rev:3
Latest on Hackage:0.1.3@rev:3

See all snapshots diagrams-solve appears in

BSD-3-Clause licensed by various
Maintained by [email protected]
This version can be pinned in stack with:diagrams-solve-0.1.3@sha256:10ecc7080d2521202bd635673ccea9b4ee10dbd4c784a1e186879e805f0ce636,1714

Module documentation for 0.1.3

Depends on 1 package(full list with versions):
Used by 2 packages in lts-21.7(full list with versions):

Build Status

Miscellaneous pure-Haskell solver routines used in diagrams, a Haskell embedded domain-specific language for compositional, declarative drawing.

This is split out into a separate package with no dependencies on the rest of diagrams in case it is useful to others, but no particular guarantees are made as to the suitability or correctness of the code (though we are certainly open to bug reports).

Currently the package contains:

  • functions to find real roots of quadratic, cubic, and quartic polynomials, in Diagrams.Solve.Polynomial

  • functions to solve tridiagonal and cyclic tridiagonal systems of linear equations, in Diagrams.Solve.Tridiagonal


  • 0.1.3 (13 Feb 2021)

    Test with up through GHC 9.0 Allow tasty-1.4

  • 0.1.2 (5 May 2020)

    Improvements to stability/accuraty of cubForm and quartForm, contributed by Jasper Van der Jeugt (#7, #8)

  • 0.1.1 (3 July 2017)

    allow base-4.10 for GHC-8.2 some minor optimizations add QC tests

  • (14 February 2016)

    allow base-4.9 for GHC-8.0

  • 0.1 (19 April 2015)

    initial release, in conjunction with diagrams-1.3 — some functionality split out from diagrams-lib