BSD-3-Clause licensed and maintained by Henning Thielemann
This version can be pinned in stack with:lapack-comfort-array-0.0.1@sha256:9afd7cfd53011711d1026d47fb6052c45bca397fc38a5d7b5e6e5d37acbd007d,3103

LAPACK is a package for efficient numerically robust linear algebra. The original implementation is written in FORTRAN. This is a semi-automatically generated mid-level wrapper. The functions are not ready to use for high-level applications, but they are a step closer.

The functions are all in IO monad because they are auto-generated and we cannot make sure automatically that unsafePerformIO is always safe. Instead of raw pointers we use Arrays and Mutable.Arrays and assign and check array bounds to LAPACK function parameters, as far we can retrieve this information from the FORTRAN comments. We check consistency of dimensions where consistent dimensions are required, but we cannot do all kind of bound checks. We use immutable Array for input and output parameters and mutable Mutable.Array for input/output parameters. LAPACK plays some nasty tricks of in-place array updates on input/output arrays even if the dimensions of input and output array differ (see e.g. GELS). The wrappers also manage allocation of memory for function parameters. This is necessary since FORTRAN passes all parameters by reference. Further on, the wrappers convert from Haskell values like Int to low-level values like CInt.

We provide bindings to functions of all variants for Float, Double, Complex Float and Complex Double. We do not use TemplateHaskell nor HSC nor CHS, but instead Haskell 98 code generated by the custom lapack-ffi-tools package.