def Lapack.sgesv
import bend-blas-lapack@0.0.0.1/lapack.bend as Lapackimport Base
19# X = A^-1 B: A is n x n, B is n x nrhs, both row-major, both consumed;
20# answers X (n x nrhs). Fails with code i when U(i, i) of the LU
21# factorization is exactly zero (A singular).
22def Lapack.sgesv(n: U32, nrhs: U32, a: Array<F32>, b: Array<F32>) -> IO(Result<&1, &1, U32 & String, Array<F32>>):
23 import "./effs/lapack_sgesv.c"
24 import "./effs/lapack_sgesv.js"