mathjs
Version:
Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with dif
105 lines (97 loc) • 2.88 kB
JavaScript
import { factory } from '../../../utils/factory.js';
var name = 'matAlgo10xSids';
var dependencies = ['typed', 'DenseMatrix'];
export var createMatAlgo10xSids = /* #__PURE__ */factory(name, dependencies, _ref => {
var {
typed,
DenseMatrix
} = _ref;
/**
* Iterates over SparseMatrix S nonzero items and invokes the callback function f(Sij, b).
* Callback function invoked NZ times (number of nonzero items in S).
*
*
* ┌ f(Sij, b) ; S(i,j) !== 0
* C(i,j) = ┤
* └ b ; otherwise
*
*
* @param {Matrix} s The SparseMatrix instance (S)
* @param {Scalar} b The Scalar value
* @param {Function} callback The f(Aij,b) operation to invoke
* @param {boolean} inverse A true value indicates callback should be invoked f(b,Sij)
*
* @return {Matrix} DenseMatrix (C)
*
* https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813
*/
return function matAlgo10xSids(s, b, callback, inverse) {
// sparse matrix arrays
var avalues = s._values;
var aindex = s._index;
var aptr = s._ptr;
var asize = s._size;
var adt = s._datatype;
// sparse matrix cannot be a Pattern matrix
if (!avalues) {
throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');
}
// rows & columns
var rows = asize[0];
var columns = asize[1];
// datatype
var dt;
// callback signature to use
var cf = callback;
// process data types
if (typeof adt === 'string') {
// datatype
dt = adt;
// convert b to the same datatype
b = typed.convert(b, dt);
// callback
cf = typed.find(callback, [dt, dt]);
}
// result arrays
var cdata = [];
// workspaces
var x = [];
// marks indicating we have a value in x for a given column
var w = [];
// loop columns
for (var j = 0; j < columns; j++) {
// columns mark
var mark = j + 1;
// values in j
for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {
// row
var r = aindex[k];
// update workspace
x[r] = avalues[k];
w[r] = mark;
}
// loop rows
for (var i = 0; i < rows; i++) {
// initialize C on first column
if (j === 0) {
// create row array
cdata[i] = [];
}
// check sparse matrix has a value @ i,j
if (w[i] === mark) {
// invoke callback, update C
cdata[i][j] = inverse ? cf(b, x[i]) : cf(x[i], b);
} else {
// dense matrix value @ i, j
cdata[i][j] = b;
}
}
}
// return dense matrix
return new DenseMatrix({
data: cdata,
size: [rows, columns],
datatype: dt
});
};
});