@tachybase/plugin-evaluator-mathjs 1.3.20

package/dist/node_modules/mathjs/lib/esm/function/algebra/sparse/csSqr.js

@@ -0,0 +1,195 @@
+import { csPermute } from './csPermute.js';
+import { csPost } from './csPost.js';
+import { csEtree } from './csEtree.js';
+import { createCsAmd } from './csAmd.js';
+import { createCsCounts } from './csCounts.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSqr';
+var dependencies = ['add', 'multiply', 'transpose'];
+export var createCsSqr = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    add,
+    multiply,
+    transpose
+  } = _ref;
+  var csAmd = createCsAmd({
+    add,
+    multiply,
+    transpose
+  });
+  var csCounts = createCsCounts({
+    transpose
+  });
+  /**
+   * Symbolic ordering and analysis for QR and LU decompositions.
+   *
+   * @param {Number}  order           The ordering strategy (see csAmd for more details)
+   * @param {Matrix}  a               The A matrix
+   * @param {boolean} qr              Symbolic ordering and analysis for QR decomposition (true) or
+   *                                  symbolic ordering and analysis for LU decomposition (false)
+   *
+   * @return {Object}                 The Symbolic ordering and analysis for matrix A
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+
+  return function csSqr(order, a, qr) {
+    // a arrays
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // vars
+
+    var k; // symbolic analysis result
+
+    var s = {}; // fill-reducing ordering
+
+    s.q = csAmd(order, a); // validate results
+
+    if (order && !s.q) {
+      return null;
+    } // QR symbolic analysis
+
+
+    if (qr) {
+      // apply permutations if needed
+      var c = order ? csPermute(a, null, s.q, 0) : a; // etree of C'*C, where C=A(:,q)
+
+      s.parent = csEtree(c, 1); // post order elimination tree
+
+      var post = csPost(s.parent, n); // col counts chol(C'*C)
+
+      s.cp = csCounts(c, s.parent, post, 1); // check we have everything needed to calculate number of nonzero elements
+
+      if (c && s.parent && s.cp && _vcount(c, s)) {
+        // calculate number of nonzero elements
+        for (s.unz = 0, k = 0; k < n; k++) {
+          s.unz += s.cp[k];
+        }
+      }
+    } else {
+      // for LU factorization only, guess nnz(L) and nnz(U)
+      s.unz = 4 * aptr[n] + n;
+      s.lnz = s.unz;
+    } // return result S
+
+
+    return s;
+  };
+  /**
+   * Compute nnz(V) = s.lnz, s.pinv, s.leftmost, s.m2 from A and s.parent
+   */
+
+  function _vcount(a, s) {
+    // a arrays
+    var aptr = a._ptr;
+    var aindex = a._index;
+    var asize = a._size; // rows & columns
+
+    var m = asize[0];
+    var n = asize[1]; // initialize s arrays
+
+    s.pinv = []; // (m + n)
+
+    s.leftmost = []; // (m)
+    // vars
+
+    var parent = s.parent;
+    var pinv = s.pinv;
+    var leftmost = s.leftmost; // workspace, next: first m entries, head: next n entries, tail: next n entries, nque: next n entries
+
+    var w = []; // (m + 3 * n)
+
+    var next = 0;
+    var head = m;
+    var tail = m + n;
+    var nque = m + 2 * n; // vars
+
+    var i, k, p, p0, p1; // initialize w
+
+    for (k = 0; k < n; k++) {
+      // queue k is empty
+      w[head + k] = -1;
+      w[tail + k] = -1;
+      w[nque + k] = 0;
+    } // initialize row arrays
+
+
+    for (i = 0; i < m; i++) {
+      leftmost[i] = -1;
+    } // loop columns backwards
+
+
+    for (k = n - 1; k >= 0; k--) {
+      // values & index for column k
+      for (p0 = aptr[k], p1 = aptr[k + 1], p = p0; p < p1; p++) {
+        // leftmost[i] = min(find(A(i,:)))
+        leftmost[aindex[p]] = k;
+      }
+    } // scan rows in reverse order
+
+
+    for (i = m - 1; i >= 0; i--) {
+      // row i is not yet ordered
+      pinv[i] = -1;
+      k = leftmost[i]; // check row i is empty
+
+      if (k === -1) {
+        continue;
+      } // first row in queue k
+
+
+      if (w[nque + k]++ === 0) {
+        w[tail + k] = i;
+      } // put i at head of queue k
+
+
+      w[next + i] = w[head + k];
+      w[head + k] = i;
+    }
+
+    s.lnz = 0;
+    s.m2 = m; // find row permutation and nnz(V)
+
+    for (k = 0; k < n; k++) {
+      // remove row i from queue k
+      i = w[head + k]; // count V(k,k) as nonzero
+
+      s.lnz++; // add a fictitious row
+
+      if (i < 0) {
+        i = s.m2++;
+      } // associate row i with V(:,k)
+
+
+      pinv[i] = k; // skip if V(k+1:m,k) is empty
+
+      if (--nque[k] <= 0) {
+        continue;
+      } // nque[k] is nnz (V(k+1:m,k))
+
+
+      s.lnz += w[nque + k]; // move all rows to parent of k
+
+      var pa = parent[k];
+
+      if (pa !== -1) {
+        if (w[nque + pa] === 0) {
+          w[tail + pa] = w[tail + k];
+        }
+
+        w[next + w[tail + k]] = w[head + pa];
+        w[head + pa] = w[next + i];
+        w[nque + pa] += w[nque + k];
+      }
+    }
+
+    for (i = 0; i < m; i++) {
+      if (pinv[i] < 0) {
+        pinv[i] = k++;
+      }
+    }
+
+    return true;
+  }
+});

package/dist/node_modules/mathjs/lib/esm/function/algebra/sparse/csSymperm.js

@@ -0,0 +1,100 @@
+import { csCumsum } from './csCumsum.js';
+import { factory } from '../../../utils/factory.js';
+var name = 'csSymperm';
+var dependencies = ['conj', 'SparseMatrix'];
+export var createCsSymperm = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    conj,
+    SparseMatrix
+  } = _ref;
+
+  /**
+   * Computes the symmetric permutation of matrix A accessing only
+   * the upper triangular part of A.
+   *
+   * C = P * A * P'
+   *
+   * @param {Matrix}  a               The A matrix
+   * @param {Array}   pinv            The inverse of permutation vector
+   * @param {boolean} values          Process matrix values (true)
+   *
+   * @return {Matrix}                 The C matrix, C = P * A * P'
+   *
+   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+   */
+  return function csSymperm(a, pinv, values) {
+    // A matrix arrays
+    var avalues = a._values;
+    var aindex = a._index;
+    var aptr = a._ptr;
+    var asize = a._size; // columns
+
+    var n = asize[1]; // C matrix arrays
+
+    var cvalues = values && avalues ? [] : null;
+    var cindex = []; // (nz)
+
+    var cptr = []; // (n + 1)
+    // variables
+
+    var i, i2, j, j2, p, p0, p1; // create workspace vector
+
+    var w = []; // (n)
+    // count entries in each column of C
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // column count of C
+
+        w[Math.max(i2, j2)]++;
+      }
+    } // compute column pointers of C
+
+
+    csCumsum(cptr, w, n); // loop columns
+
+    for (j = 0; j < n; j++) {
+      // column j of A is column j2 of C
+      j2 = pinv ? pinv[j] : j; // loop values in column j
+
+      for (p0 = aptr[j], p1 = aptr[j + 1], p = p0; p < p1; p++) {
+        // row
+        i = aindex[p]; // skip lower triangular part of A
+
+        if (i > j) {
+          continue;
+        } // row i of A is row i2 of C
+
+
+        i2 = pinv ? pinv[i] : i; // C index for column j2
+
+        var q = w[Math.max(i2, j2)]++; // update C index for entry q
+
+        cindex[q] = Math.min(i2, j2); // check we need to process values
+
+        if (cvalues) {
+          cvalues[q] = i2 <= j2 ? avalues[p] : conj(avalues[p]);
+        }
+      }
+    } // return C matrix
+
+
+    return new SparseMatrix({
+      values: cvalues,
+      index: cindex,
+      ptr: cptr,
+      size: [n, n]
+    });
+  };
+});

package/dist/node_modules/mathjs/lib/esm/function/algebra/sparse/csTdfs.js

@@ -0,0 +1,42 @@
+/**
+ * Depth-first search and postorder of a tree rooted at node j
+ *
+ * @param {Number}  j               The tree node
+ * @param {Number}  k
+ * @param {Array}   w               The workspace array
+ * @param {Number}  head            The index offset within the workspace for the head array
+ * @param {Number}  next            The index offset within the workspace for the next array
+ * @param {Array}   post            The post ordering array
+ * @param {Number}  stack           The index offset within the workspace for the stack array
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+export function csTdfs(j, k, w, head, next, post, stack) {
+  // variables
+  var top = 0; // place j on the stack
+
+  w[stack] = j; // while (stack is not empty)
+
+  while (top >= 0) {
+    // p = top of stack
+    var p = w[stack + top]; // i = youngest child of p
+
+    var i = w[head + p];
+
+    if (i === -1) {
+      // p has no unordered children left
+      top--; // node p is the kth postordered node
+
+      post[k++] = p;
+    } else {
+      // remove i from children of p
+      w[head + p] = w[next + i]; // increment top
+
+      ++top; // start dfs on child node i
+
+      w[stack + top] = i;
+    }
+  }
+
+  return k;
+}

package/dist/node_modules/mathjs/lib/esm/function/algebra/sparse/csUnflip.js

@@ -0,0 +1,13 @@
+import { csFlip } from './csFlip.js';
+/**
+ * Flips the value if it is negative of returns the same value otherwise.
+ *
+ * @param {Number}  i               The value to flip
+ *
+ * Reference: http://faculty.cse.tamu.edu/davis/publications.html
+ */
+
+export function csUnflip(i) {
+  // flip the value if it is negative
+  return i < 0 ? csFlip(i) : i;
+}

package/dist/node_modules/mathjs/lib/esm/function/algebra/symbolicEqual.js

@@ -0,0 +1,80 @@
+import { isConstantNode } from '../../utils/is.js';
+import { factory } from '../../utils/factory.js';
+var name = 'symbolicEqual';
+var dependencies = ['parse', 'simplify', 'typed', 'OperatorNode'];
+export var createSymbolicEqual = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    parse,
+    simplify,
+    typed,
+    OperatorNode
+  } = _ref;
+
+  /**
+   * Attempts to determine if two expressions are symbolically equal, i.e.
+   * one is the result of valid algebraic manipulations on the other.
+   * Currently, this simply checks if the difference of the two expressions
+   * simplifies down to 0. So there are two important caveats:
+   * 1. whether two expressions are symbolically equal depends on the
+   *     manipulations allowed. Therefore, this function takes an optional
+   *     third argument, which are the options that control the behavior
+   *     as documented for the `simplify()` function.
+   * 2. it is in general intractable to find the minimal simplification of
+   *     an arbitrarily complicated expression. So while a `true` value
+   *     of `symbolicEqual` ensures that the two expressions can be manipulated
+   *     to match each other, a `false` value does not absolutely rule this out.
+   *
+   * Syntax:
+   *
+   *    symbolicEqual(expr1, expr2)
+   *    symbolicEqual(expr1, expr2, options)
+   *
+   * Examples:
+   *
+   *    symbolicEqual('x*y', 'y*x') // true
+   *    symbolicEqual('x*y', 'y*x', {context: {multiply: {commutative: false}}})
+   *        //false
+   *    symbolicEqual('x/y', '(y*x^(-1))^(-1)') // true
+   *    symbolicEqual('abs(x)','x') // false
+   *    symbolicEqual('abs(x)','x', simplify.positiveContext) // true
+   *
+   * See also:
+   *
+   *    simplify, evaluate
+   *
+   * @param {Node|string} expr1  The first expression to compare
+   * @param {Node|string} expr2  The second expression to compare
+   * @param {Object} [options] Optional option object, passed to simplify
+   * @returns {boolean}
+   *     Returns true if a valid manipulation making the expressions equal
+   *     is found.
+   */
+  return typed(name, {
+    'string, string': function stringString(s1, s2) {
+      return this(parse(s1), parse(s2), {});
+    },
+    'string, string, Object': function stringStringObject(s1, s2, options) {
+      return this(parse(s1), parse(s2), options);
+    },
+    'Node, string': function NodeString(e1, s2) {
+      return this(e1, parse(s2), {});
+    },
+    'Node, string, Object': function NodeStringObject(e1, s2, options) {
+      return this(e1, parse(s2), options);
+    },
+    'string, Node': function stringNode(s1, e2) {
+      return this(parse(s1), e2, {});
+    },
+    'string, Node, Object': function stringNodeObject(s1, e2, options) {
+      return this(parse(s1), e2, options);
+    },
+    'Node, Node': function NodeNode(e1, e2) {
+      return this(e1, e2, {});
+    },
+    'Node, Node, Object': function NodeNodeObject(e1, e2, options) {
+      var diff = new OperatorNode('-', 'subtract', [e1, e2]);
+      var simplified = simplify(diff, {}, options);
+      return isConstantNode(simplified) && !simplified.value;
+    }
+  });
+});

package/dist/node_modules/mathjs/lib/esm/function/arithmetic/abs.js

@@ -0,0 +1,54 @@
+import { factory } from '../../utils/factory.js';
+import { deepMap } from '../../utils/collection.js';
+import { absNumber } from '../../plain/number/index.js';
+var name = 'abs';
+var dependencies = ['typed'];
+export var createAbs = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Calculate the absolute value of a number. For matrices, the function is
+   * evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.abs(x)
+   *
+   * Examples:
+   *
+   *    math.abs(3.5)                // returns number 3.5
+   *    math.abs(-4.2)               // returns number 4.2
+   *
+   *    math.abs([3, -5, -1, 0, 2])  // returns Array [3, 5, 1, 0, 2]
+   *
+   * See also:
+   *
+   *    sign
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Array | Matrix | Unit} x
+   *            A number or matrix for which to get the absolute value
+   * @return {number | BigNumber | Fraction | Complex | Array | Matrix | Unit}
+   *            Absolute value of `x`
+   */
+  return typed(name, {
+    number: absNumber,
+    Complex: function Complex(x) {
+      return x.abs();
+    },
+    BigNumber: function BigNumber(x) {
+      return x.abs();
+    },
+    Fraction: function Fraction(x) {
+      return x.abs();
+    },
+    'Array | Matrix': function ArrayMatrix(x) {
+      // deep map collection, skip zeros since abs(0) = 0
+      return deepMap(x, this, true);
+    },
+    Unit: function Unit(x) {
+      return x.abs();
+    }
+  });
+});

package/dist/node_modules/mathjs/lib/esm/function/arithmetic/add.js

@@ -0,0 +1,128 @@
+import { factory } from '../../utils/factory.js';
+import { extend } from '../../utils/object.js';
+import { createAlgorithm01 } from '../../type/matrix/utils/algorithm01.js';
+import { createAlgorithm04 } from '../../type/matrix/utils/algorithm04.js';
+import { createAlgorithm10 } from '../../type/matrix/utils/algorithm10.js';
+import { createAlgorithm13 } from '../../type/matrix/utils/algorithm13.js';
+import { createAlgorithm14 } from '../../type/matrix/utils/algorithm14.js';
+var name = 'add';
+var dependencies = ['typed', 'matrix', 'addScalar', 'equalScalar', 'DenseMatrix', 'SparseMatrix'];
+export var createAdd = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed,
+    matrix,
+    addScalar,
+    equalScalar,
+    DenseMatrix,
+    SparseMatrix
+  } = _ref;
+  var algorithm01 = createAlgorithm01({
+    typed
+  });
+  var algorithm04 = createAlgorithm04({
+    typed,
+    equalScalar
+  });
+  var algorithm10 = createAlgorithm10({
+    typed,
+    DenseMatrix
+  });
+  var algorithm13 = createAlgorithm13({
+    typed
+  });
+  var algorithm14 = createAlgorithm14({
+    typed
+  });
+  /**
+   * Add two or more values, `x + y`.
+   * For matrices, the function is evaluated element wise.
+   *
+   * Syntax:
+   *
+   *    math.add(x, y)
+   *    math.add(x, y, z, ...)
+   *
+   * Examples:
+   *
+   *    math.add(2, 3)               // returns number 5
+   *    math.add(2, 3, 4)            // returns number 9
+   *
+   *    const a = math.complex(2, 3)
+   *    const b = math.complex(-4, 1)
+   *    math.add(a, b)               // returns Complex -2 + 4i
+   *
+   *    math.add([1, 2, 3], 4)       // returns Array [5, 6, 7]
+   *
+   *    const c = math.unit('5 cm')
+   *    const d = math.unit('2.1 mm')
+   *    math.add(c, d)               // returns Unit 52.1 mm
+   *
+   *    math.add("2.3", "4")         // returns number 6.3
+   *
+   * See also:
+   *
+   *    subtract, sum
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} x First value to add
+   * @param  {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} y Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit | Array | Matrix} Sum of `x` and `y`
+   */
+
+  return typed(name, extend({
+    // we extend the signatures of addScalar with signatures dealing with matrices
+    'DenseMatrix, DenseMatrix': function DenseMatrixDenseMatrix(x, y) {
+      return algorithm13(x, y, addScalar);
+    },
+    'DenseMatrix, SparseMatrix': function DenseMatrixSparseMatrix(x, y) {
+      return algorithm01(x, y, addScalar, false);
+    },
+    'SparseMatrix, DenseMatrix': function SparseMatrixDenseMatrix(x, y) {
+      return algorithm01(y, x, addScalar, true);
+    },
+    'SparseMatrix, SparseMatrix': function SparseMatrixSparseMatrix(x, y) {
+      return algorithm04(x, y, addScalar);
+    },
+    'Array, Array': function ArrayArray(x, y) {
+      // use matrix implementation
+      return this(matrix(x), matrix(y)).valueOf();
+    },
+    'Array, Matrix': function ArrayMatrix(x, y) {
+      // use matrix implementation
+      return this(matrix(x), y);
+    },
+    'Matrix, Array': function MatrixArray(x, y) {
+      // use matrix implementation
+      return this(x, matrix(y));
+    },
+    'DenseMatrix, any': function DenseMatrixAny(x, y) {
+      return algorithm14(x, y, addScalar, false);
+    },
+    'SparseMatrix, any': function SparseMatrixAny(x, y) {
+      return algorithm10(x, y, addScalar, false);
+    },
+    'any, DenseMatrix': function anyDenseMatrix(x, y) {
+      return algorithm14(y, x, addScalar, true);
+    },
+    'any, SparseMatrix': function anySparseMatrix(x, y) {
+      return algorithm10(y, x, addScalar, true);
+    },
+    'Array, any': function ArrayAny(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(x), y, addScalar, false).valueOf();
+    },
+    'any, Array': function anyArray(x, y) {
+      // use matrix implementation
+      return algorithm14(matrix(y), x, addScalar, true).valueOf();
+    },
+    'any, any': addScalar,
+    'any, any, ...any': function anyAnyAny(x, y, rest) {
+      var result = this(x, y);
+
+      for (var i = 0; i < rest.length; i++) {
+        result = this(result, rest[i]);
+      }
+
+      return result;
+    }
+  }, addScalar.signatures));
+});

package/dist/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js

@@ -0,0 +1,43 @@
+import { factory } from '../../utils/factory.js';
+import { addNumber } from '../../plain/number/index.js';
+var name = 'addScalar';
+var dependencies = ['typed'];
+export var createAddScalar = /* #__PURE__ */factory(name, dependencies, _ref => {
+  var {
+    typed
+  } = _ref;
+
+  /**
+   * Add two scalar values, `x + y`.
+   * This function is meant for internal use: it is used by the public function
+   * `add`
+   *
+   * This function does not support collections (Array or Matrix).
+   *
+   * @param  {number | BigNumber | Fraction | Complex | Unit} x   First value to add
+   * @param  {number | BigNumber | Fraction | Complex} y          Second value to add
+   * @return {number | BigNumber | Fraction | Complex | Unit}     Sum of `x` and `y`
+   * @private
+   */
+  return typed(name, {
+    'number, number': addNumber,
+    'Complex, Complex': function ComplexComplex(x, y) {
+      return x.add(y);
+    },
+    'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
+      return x.plus(y);
+    },
+    'Fraction, Fraction': function FractionFraction(x, y) {
+      return x.add(y);
+    },
+    'Unit, Unit': function UnitUnit(x, y) {
+      if (x.value === null || x.value === undefined) throw new Error('Parameter x contains a unit with undefined value');
+      if (y.value === null || y.value === undefined) throw new Error('Parameter y contains a unit with undefined value');
+      if (!x.equalBase(y)) throw new Error('Units do not match');
+      var res = x.clone();
+      res.value = this(res.value, y.value);
+      res.fixPrefix = false;
+      return res;
+    }
+  });
+});