mathjs - npm Package Compare versions

Comparing version 12.4.0 to 12.4.1

bin/cli.js

@@ -62,3 +62,3 @@ #!/usr/bin/env node
 function getMath () {
-  return require('../lib/cjs/defaultInstance.js').default
+  return require('../lib/browser/math.js')
 }
@@ -65,0 +65,0 @@

bin/repl.js

@@ -7,5 +7,5 @@ #!/usr/bin/env node
  **/
-global.math = require('../lib/cjs/defaultInstance.js').default
+global.math = require('../lib/browser/math.js')
 const repl = require('repl')
 
 repl.start({ useGlobal: true })

lib/browser/math.js.LICENSE.txt

@@ -26,4 +26,4 @@ /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */
  *
- * @version 12.4.0
- * @date    2024-02-22
+ * @version 12.4.1
+ * @date    2024-03-13
  *
@@ -30,0 +30,0 @@ * @license

lib/cjs/expression/node/ConstantNode.js

@@ -178,3 +178,4 @@ "use strict";
         var value = this._toString(options);
-        switch ((0, _is.typeOf)(this.value)) {
+        var type = (0, _is.typeOf)(this.value);
+        switch (type) {
           case 'string':
@@ -185,3 +186,4 @@ return '\\mathtt{' + (0, _latex.escapeLatex)(value) + '}';
             {
-              if (!isFinite(this.value)) {
+              var finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+              if (!finite) {
                 return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
@@ -193,4 +195,4 @@ }
               }
+              return value;
             }
-            return value;
           case 'Fraction':
@@ -197,0 +199,0 @@ return this.value.toLatex();

lib/cjs/function/algebra/simplifyCore.js

@@ -237,2 +237,5 @@ "use strict";
             if (isAlwaysBoolean(a1)) return a1;
+            if ((0, _is.isConstantNode)(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
           } else {
@@ -239,0 +242,0 @@ return nodeF;

lib/cjs/function/algebra/sparse/csAmd.js

@@ -11,2 +11,6 @@ "use strict";
 var _csTdfs = require("./csTdfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csAmd';
@@ -24,4 +28,2 @@ var dependencies = ['add', 'multiply', 'transpose'];
    *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
-   *
    * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
@@ -28,0 +30,0 @@ * @param {Matrix} m        Sparse Matrix

lib/cjs/function/algebra/sparse/csChol.js

@@ -10,2 +10,6 @@ "use strict";
 var _csSymperm = require("./csSymperm.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csChol';
@@ -37,4 +41,2 @@ var dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
    * @return {Number}                 The numeric Cholesky factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -41,0 +43,0 @@ return function csChol(m, s) {

lib/cjs/function/algebra/sparse/csCounts.js

@@ -9,2 +9,6 @@ "use strict";
 var _csLeaf = require("./csLeaf.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csCounts';
@@ -23,4 +27,2 @@ var dependencies = ['transpose'];
    * @return                     An array of size n of the column counts or null on error
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -27,0 +29,0 @@ return function (a, parent, post, ata) {

lib/cjs/function/algebra/sparse/csCumsum.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csCumsum = csCumsum;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -14,4 +18,2 @@ * It sets the p[i] equal to the sum of c[0] through c[i-1].
  * @param {Number}  n               The number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +20,0 @@ function csCumsum(ptr, c, n) {

lib/cjs/function/algebra/sparse/csDfs.js

@@ -10,2 +10,6 @@ "use strict";
 var _csUnflip = require("./csUnflip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -24,4 +28,2 @@ * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
  * @return {Number}                 New value of top
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -28,0 +30,0 @@ function csDfs(j, g, top, xi, pinv) {

lib/cjs/function/algebra/sparse/csEreach.js

@@ -9,2 +9,6 @@ "use strict";
 var _csMarked = require("./csMarked.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -20,4 +24,2 @@ * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -24,0 +26,0 @@ function csEreach(a, k, parent, w) {

lib/cjs/function/algebra/sparse/csEtree.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csEtree = csEtree;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -14,4 +18,2 @@ * Computes the elimination tree of Matrix A (using triu(A)) or the
  * @param {boolean} ata             A value of true the function computes the etree of A'A
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +20,0 @@ function csEtree(a, ata) {

lib/cjs/function/algebra/sparse/csFkeep.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csFkeep = csFkeep;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -20,4 +24,2 @@ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
  * @return                          The number of nonzero elements in the matrix
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -24,0 +26,0 @@ function csFkeep(a, callback, other) {

lib/cjs/function/algebra/sparse/csFlip.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csFlip = csFlip;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -12,4 +16,2 @@ * This function "flips" its input about the integer -1.
  * @param {Number}  i               The value to flip
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -16,0 +18,0 @@ function csFlip(i) {

lib/cjs/function/algebra/sparse/csIpvec.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csIpvec = csIpvec;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -9,0 +13,0 @@ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.

lib/cjs/function/algebra/sparse/csLeaf.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csLeaf = csLeaf;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -21,4 +25,2 @@ * This function determines if j is a leaf of the ith row subtree.
  * @return {Object}
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -25,0 +27,0 @@ function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {

lib/cjs/function/algebra/sparse/csLu.js

@@ -9,2 +9,6 @@ "use strict";
 var _csSpsolve = require("./csSpsolve.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csLu';
@@ -38,4 +42,2 @@ var dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
    * @return {Number}                 The numeric LU factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -42,0 +44,0 @@ return function csLu(m, s, tol) {

lib/cjs/function/algebra/sparse/csMark.js

@@ -8,2 +8,6 @@ "use strict";
 var _csFlip = require("./csFlip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -14,4 +18,2 @@ * Marks the node at w[j]
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +20,0 @@ function csMark(w, j) {

lib/cjs/function/algebra/sparse/csMarked.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csMarked = csMarked;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -13,4 +17,2 @@ * Checks if the node at w[j] is marked
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -17,0 +19,0 @@ function csMarked(w, j) {

lib/cjs/function/algebra/sparse/csPermute.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csPermute = csPermute;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -17,4 +21,2 @@ * Permutes a sparse matrix C = P * A * Q
  * @return {Matrix}                 C = P * A * Q, null on error
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -21,0 +23,0 @@ function csPermute(a, pinv, q, values) {

lib/cjs/function/algebra/sparse/csPost.js

@@ -8,2 +8,6 @@ "use strict";
 var _csTdfs = require("./csTdfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -14,4 +18,2 @@ * Post order a tree of forest
  * @param {Number}  n               Number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +20,0 @@ function csPost(parent, n) {

lib/cjs/function/algebra/sparse/csReach.js

@@ -10,2 +10,6 @@ "use strict";
 var _csDfs = require("./csDfs.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -24,4 +28,2 @@ * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -28,0 +30,0 @@ function csReach(g, b, k, xi, pinv) {

lib/cjs/function/algebra/sparse/csSpsolve.js

@@ -9,2 +9,6 @@ "use strict";
 var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csSpsolve';
@@ -32,4 +36,2 @@ var dependencies = ['divideScalar', 'multiply', 'subtract'];
    * @return {Number}                 The index for the nonzero pattern
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -36,0 +38,0 @@ return function csSpsolve(g, b, k, xi, x, pinv, lo) {

lib/cjs/function/algebra/sparse/csSqr.js

@@ -13,2 +13,6 @@ "use strict";
 var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csSqr';
@@ -38,4 +42,2 @@ var dependencies = ['add', 'multiply', 'transpose'];
    * @return {Object}                 The Symbolic ordering and analysis for matrix A
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -42,0 +44,0 @@ return function csSqr(order, a, qr) {

lib/cjs/function/algebra/sparse/csSymperm.js

@@ -9,2 +9,6 @@ "use strict";
 var _factory = require("../../../utils/factory.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 var name = 'csSymperm';
@@ -26,4 +30,2 @@ var dependencies = ['conj', 'SparseMatrix'];
    * @return {Matrix}                 The C matrix, C = P * A * P'
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -30,0 +32,0 @@ return function csSymperm(a, pinv, values) {

lib/cjs/function/algebra/sparse/csTdfs.js

@@ -7,2 +7,6 @@ "use strict";
 exports.csTdfs = csTdfs;
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -18,4 +22,2 @@ * Depth-first search and postorder of a tree rooted at node j
  * @param {Number}  stack           The index offset within the workspace for the stack array
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -22,0 +24,0 @@ function csTdfs(j, k, w, head, next, post, stack) {

lib/cjs/function/algebra/sparse/csUnflip.js

@@ -8,2 +8,6 @@ "use strict";
 var _csFlip = require("./csFlip.js");
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -13,4 +17,2 @@ * 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
  */
@@ -17,0 +19,0 @@ function csUnflip(i) {

lib/cjs/header.js

@@ -9,4 +9,4 @@ /**
  *
- * @version 12.4.0
- * @date    2024-02-22
+ * @version 12.4.1
+ * @date    2024-03-13
  *
@@ -13,0 +13,0 @@ * @license

lib/cjs/version.js

@@ -7,4 +7,4 @@ "use strict";
 exports.version = void 0;
-var version = exports.version = '12.4.0';
+var version = exports.version = '12.4.1';
 // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.

lib/esm/expression/node/ConstantNode.js

@@ -145,3 +145,4 @@ import _defineProperty from "@babel/runtime/helpers/defineProperty";
       var value = this._toString(options);
-      switch (typeOf(this.value)) {
+      var type = typeOf(this.value);
+      switch (type) {
         case 'string':
@@ -152,3 +153,4 @@ return '\\mathtt{' + escapeLatex(value) + '}';
           {
-            if (!isFinite(this.value)) {
+            var finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+            if (!finite) {
               return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
@@ -160,4 +162,4 @@ }
             }
+            return value;
           }
-          return value;
         case 'Fraction':
@@ -164,0 +166,0 @@ return this.value.toLatex();

lib/esm/function/algebra/simplifyCore.js

@@ -232,2 +232,5 @@ import { isAccessorNode, isArrayNode, isConstantNode, isFunctionNode, isIndexNode, isObjectNode, isOperatorNode } from '../../utils/is.js';
             if (isAlwaysBoolean(a1)) return a1;
+            if (isConstantNode(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
           } else {
@@ -234,0 +237,0 @@ return nodeF;

lib/esm/function/algebra/sparse/csAmd.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { factory } from '../../../utils/factory.js';
@@ -19,4 +22,2 @@ import { csFkeep } from './csFkeep.js';
    *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
-   *
    * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
@@ -23,0 +24,0 @@ * @param {Matrix} m        Sparse Matrix

lib/esm/function/algebra/sparse/csChol.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { factory } from '../../../utils/factory.js';
@@ -32,4 +35,2 @@ import { csEreach } from './csEreach.js';
    * @return {Number}                 The numeric Cholesky factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -36,0 +37,0 @@ return function csChol(m, s) {

lib/esm/function/algebra/sparse/csCounts.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { factory } from '../../../utils/factory.js';
@@ -18,4 +21,2 @@ import { csLeaf } from './csLeaf.js';
    * @return                     An array of size n of the column counts or null on error
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -22,0 +23,0 @@ return function (a, parent, post, ata) {

lib/esm/function/algebra/sparse/csCumsum.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -7,4 +11,2 @@ * It sets the p[i] equal to the sum of c[0] through c[i-1].
  * @param {Number}  n               The number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -11,0 +13,0 @@ export function csCumsum(ptr, c, n) {

lib/esm/function/algebra/sparse/csDfs.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csMarked } from './csMarked.js';
@@ -18,4 +21,2 @@ import { csMark } from './csMark.js';
  * @return {Number}                 New value of top
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -22,0 +23,0 @@ export function csDfs(j, g, top, xi, pinv) {

lib/esm/function/algebra/sparse/csEreach.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csMark } from './csMark.js';
@@ -14,4 +17,2 @@ import { csMarked } from './csMarked.js';
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +19,0 @@ export function csEreach(a, k, parent, w) {

lib/esm/function/algebra/sparse/csEtree.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -7,4 +11,2 @@ * Computes the elimination tree of Matrix A (using triu(A)) or the
  * @param {boolean} ata             A value of true the function computes the etree of A'A
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -11,0 +13,0 @@ export function csEtree(a, ata) {

lib/esm/function/algebra/sparse/csFkeep.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -13,4 +17,2 @@ * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
  * @return                          The number of nonzero elements in the matrix
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -17,0 +19,0 @@ export function csFkeep(a, callback, other) {

lib/esm/function/algebra/sparse/csFlip.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -5,4 +9,2 @@ * This function "flips" its input about the integer -1.
  * @param {Number}  i               The value to flip
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -9,0 +11,0 @@ export function csFlip(i) {

lib/esm/function/algebra/sparse/csIpvec.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -2,0 +6,0 @@ * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.

lib/esm/function/algebra/sparse/csLeaf.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -14,4 +18,2 @@ * This function determines if j is a leaf of the ith row subtree.
  * @return {Object}
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -18,0 +20,0 @@ export function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {

lib/esm/function/algebra/sparse/csLu.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 import { factory } from '../../../utils/factory.js';
@@ -33,4 +37,2 @@ import { createCsSpsolve } from './csSpsolve.js';
    * @return {Number}                 The numeric LU factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -37,0 +39,0 @@ return function csLu(m, s, tol) {

lib/esm/function/algebra/sparse/csMark.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 import { csFlip } from './csFlip.js';
@@ -8,4 +12,2 @@
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -12,0 +14,0 @@ export function csMark(w, j) {

lib/esm/function/algebra/sparse/csMarked.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -6,4 +10,2 @@ * Checks if the node at w[j] is marked
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -10,0 +12,0 @@ export function csMarked(w, j) {

lib/esm/function/algebra/sparse/csPermute.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -10,4 +14,2 @@ * Permutes a sparse matrix C = P * A * Q
  * @return {Matrix}                 C = P * A * Q, null on error
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -14,0 +16,0 @@ export function csPermute(a, pinv, q, values) {

lib/esm/function/algebra/sparse/csPost.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csTdfs } from './csTdfs.js';
@@ -8,4 +11,2 @@
  * @param {Number}  n               Number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -12,0 +13,0 @@ export function csPost(parent, n) {

lib/esm/function/algebra/sparse/csReach.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 import { csMarked } from './csMarked.js';
@@ -18,4 +22,2 @@ import { csMark } from './csMark.js';
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -22,0 +24,0 @@ export function csReach(g, b, k, xi, pinv) {

lib/esm/function/algebra/sparse/csSpsolve.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csReach } from './csReach.js';
@@ -27,4 +30,2 @@ import { factory } from '../../../utils/factory.js';
    * @return {Number}                 The index for the nonzero pattern
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -31,0 +32,0 @@ return function csSpsolve(g, b, k, xi, x, pinv, lo) {

lib/esm/function/algebra/sparse/csSqr.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csPermute } from './csPermute.js';
@@ -33,4 +36,2 @@ import { csPost } from './csPost.js';
    * @return {Object}                 The Symbolic ordering and analysis for matrix A
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -37,0 +38,0 @@ return function csSqr(order, a, qr) {

lib/esm/function/algebra/sparse/csSymperm.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csCumsum } from './csCumsum.js';
@@ -21,4 +24,2 @@ import { factory } from '../../../utils/factory.js';
    * @return {Matrix}                 The C matrix, C = P * A * P'
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
@@ -25,0 +26,0 @@ return function csSymperm(a, pinv, values) {

lib/esm/function/algebra/sparse/csTdfs.js

@@ -0,1 +1,5 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
+
 /**
@@ -11,4 +15,2 @@ * Depth-first search and postorder of a tree rooted at node j
  * @param {Number}  stack           The index offset within the workspace for the stack array
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -15,0 +17,0 @@ export function csTdfs(j, k, w, head, next, post, stack) {

lib/esm/function/algebra/sparse/csUnflip.js

@@ -0,1 +1,4 @@
+// Copyright (c) 2006-2024, Timothy A. Davis, All Rights Reserved.
+// SPDX-License-Identifier: LGPL-2.1+
+// https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source
 import { csFlip } from './csFlip.js';
@@ -7,4 +10,2 @@
  * @param {Number}  i               The value to flip
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
@@ -11,0 +12,0 @@ export function csUnflip(i) {

lib/esm/version.js

@@ -1,3 +0,3 @@
-export var version = '12.4.0';
+export var version = '12.4.1';
 // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.

package.json

 {
   "name": "mathjs",
-  "version": "12.4.0",
+  "version": "12.4.1",
   "description": "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 different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.",
@@ -28,3 +28,3 @@ "author": "Jos de Jong <[e-mail]> (https://github.com/josdejong)",
   "dependencies": {
-    "@babel/runtime": "^7.23.9",
+    "@babel/runtime": "^7.24.0",
     "complex.js": "^2.1.1",
@@ -40,11 +40,11 @@ "decimal.js": "^10.4.3",
   "devDependencies": {
-    "@babel/core": "7.23.9",
+    "@babel/core": "7.24.0",
     "@babel/plugin-transform-object-assign": "7.23.3",
-    "@babel/plugin-transform-runtime": "7.23.9",
-    "@babel/preset-env": "7.23.9",
+    "@babel/plugin-transform-runtime": "7.24.0",
+    "@babel/preset-env": "7.24.0",
     "@babel/register": "7.23.7",
     "@types/assert": "1.5.10",
     "@types/mocha": "10.0.6",
-    "@typescript-eslint/eslint-plugin": "7.0.2",
-    "@typescript-eslint/parser": "7.0.2",
+    "@typescript-eslint/eslint-plugin": "7.2.0",
+    "@typescript-eslint/parser": "7.2.0",
     "assert": "2.1.0",
@@ -58,11 +58,11 @@ "babel-loader": "9.1.3",
     "dtslint": "4.2.1",
-    "eslint": "8.56.0",
+    "eslint": "8.57.0",
     "eslint-config-prettier": "9.1.0",
     "eslint-config-standard": "17.1.0",
     "eslint-plugin-import": "2.29.1",
-    "eslint-plugin-mocha": "10.3.0",
+    "eslint-plugin-mocha": "10.4.1",
     "eslint-plugin-n": "16.6.2",
     "eslint-plugin-prettier": "5.1.3",
     "eslint-plugin-promise": "6.1.1",
-    "expect-type": "0.17.3",
+    "expect-type": "0.18.0",
     "expr-eval": "2.0.2",
@@ -75,5 +75,5 @@ "fancy-log": "2.0.0",
     "jsep": "1.3.8",
-    "karma": "6.4.2",
+    "karma": "6.4.3",
     "karma-browserstack-launcher": "1.6.0",
-    "karma-firefox-launcher": "2.1.2",
+    "karma-firefox-launcher": "2.1.3",
     "karma-mocha": "2.0.1",
@@ -96,3 +96,3 @@ "karma-mocha-reporter": "2.2.5",
     "ts-node": "10.9.2",
-    "typescript": "5.3.3",
+    "typescript": "5.4.2",
     "webpack": "5.90.3",
@@ -99,0 +99,0 @@ "zeros": "1.0.0"

README.md

@@ -198,2 +198,5 @@ ![math.js](https://raw.github.com/josdejong/mathjs/master/misc/img/mathjs.png)
 
+mathjs is published under the Apache 2.0 license:
+
+```
 Copyright (C) 2013-2024 Jos de Jong <[e-mail]>
@@ -212,1 +215,26 @@
 limitations under the License.
+```
+
+mathjs contains a JavaScript port of the [CSparse](https://github.com/DrTimothyAldenDavis/SuiteSparse/tree/dev/CSparse/Source) library, published under the LGPL-2.1+ license:
+
+```
+CSparse: a Concise Sparse matrix package.
+Copyright (c) 2006, Timothy A. Davis.
+http://www.suitesparse.com
+
+--------------------------------------------------------------------------------
+
+CSparse is free software; you can redistribute it and/or
+modify it under the terms of the GNU Lesser General Public
+License as published by the Free Software Foundation; either
+version 2.1 of the License, or (at your option) any later version.
+
+CSparse is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+Lesser General Public License for more details.
+
+You should have received a copy of the GNU Lesser General Public
+License along with this Module; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
+```

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

9720825

increased by0.11%

Lines of code

155385

increased by0.04%

Number of lines in readme file

239

increased by13.27%

Worsened metrics

Published versions last months

0

decreased by-100%

Dependency changes

• Updated@babel/runtime@^7.24.0