mathjs 12.4.0 → 12.4.1

package/lib/cjs/expression/node/ConstantNode.js

@@ -175,21 +175,23 @@ var createConstantNode = exports.createConstantNode = /* #__PURE__ */(0, _factor
        */
       function _toTex(options) {
         var value = this._toString(options);
-        switch ((0, _is.typeOf)(this.value)) {
+        var type = (0, _is.typeOf)(this.value);
+        switch (type) {
           case 'string':
             return '\\mathtt{' + (0, _latex.escapeLatex)(value) + '}';
           case 'number':
           case 'BigNumber':
             {
-              if (!isFinite(this.value)) {
+              var finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+              if (!finite) {
                 return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
               }
               var index = value.toLowerCase().indexOf('e');
               if (index !== -1) {
                 return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
               }
+              return value;
             }
-            return value;
           case 'Fraction':
             return this.value.toLatex();
           default:

package/lib/cjs/function/algebra/simplifyCore.js

@@ -234,6 +234,9 @@ var createSimplifyCore = exports.createSimplifyCore = /* #__PURE__ */(0, _factor
         if ((0, _is.isConstantNode)(_a)) {
           if (_a.value) {
             if (isAlwaysBoolean(a1)) return a1;
+            if ((0, _is.isConstantNode)(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
           } else {
             return nodeF;
           }

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

@@ -8,6 +8,10 @@ var _factory = require("../../../utils/factory.js");
 var _csFkeep = require("./csFkeep.js");
 var _csFlip = require("./csFlip.js");
 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';
 var dependencies = ['add', 'multiply', 'transpose'];
 var createCsAmd = exports.createCsAmd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -20,8 +24,6 @@ var createCsAmd = exports.createCsAmd = /* #__PURE__ */(0, _factory.factory)(nam
    * than A. It is a gready method that selects the sparsest pivot row and column during the course
    * of a right looking sparse Cholesky factorization.
    *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
-   *
    * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
    * @param {Matrix} m        Sparse Matrix
    */

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

@@ -7,6 +7,10 @@ exports.createCsChol = void 0;
 var _factory = require("../../../utils/factory.js");
 var _csEreach = require("./csEreach.js");
 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';
 var dependencies = ['divideScalar', 'sqrt', 'subtract', 'multiply', 'im', 're', 'conj', 'equal', 'smallerEq', 'SparseMatrix'];
 var createCsChol = exports.createCsChol = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -33,8 +37,6 @@ var createCsChol = exports.createCsChol = /* #__PURE__ */(0, _factory.factory)(n
    * @param {Object}  s               The symbolic analysis from cs_schol()
    *
    * @return {Number}                 The numeric Cholesky factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function csChol(m, s) {
     // validate input

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

@@ -6,6 +6,10 @@ Object.defineProperty(exports, "__esModule", {
 exports.createCsCounts = void 0;
 var _factory = require("../../../utils/factory.js");
 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';
 var dependencies = ['transpose'];
 var createCsCounts = exports.createCsCounts = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -19,8 +23,6 @@ var createCsCounts = exports.createCsCounts = /* #__PURE__ */(0, _factory.factor
    * @param {Matrix} ata         Count the columns of A'A instead
    *
    * @return                     An array of size n of the column counts or null on error
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function (a, parent, post, ata) {
     // check inputs

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

@@ -4,14 +4,16 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * It sets the p[i] equal to the sum of c[0] through c[i-1].
  *
  * @param {Array}   ptr             The Sparse Matrix ptr array
  * @param {Array}   c               The Sparse Matrix ptr array
  * @param {Number}  n               The number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csCumsum(ptr, c, n) {
   // variables

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

@@ -7,6 +7,10 @@ exports.csDfs = csDfs;
 var _csMarked = require("./csMarked.js");
 var _csMark = require("./csMark.js");
 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
+
 /**
  * Depth-first search computes the nonzero pattern xi of the directed graph G (Matrix) starting
  * at nodes in B (see csReach()).
@@ -20,8 +24,6 @@ var _csUnflip = require("./csUnflip.js");
  * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
  *
  * @return {Number}                 New value of top
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csDfs(j, g, top, xi, pinv) {
   // g arrays

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

@@ -6,6 +6,10 @@ Object.defineProperty(exports, "__esModule", {
 exports.csEreach = csEreach;
 var _csMark = require("./csMark.js");
 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
+
 /**
  * Find nonzero pattern of Cholesky L(k,1:k-1) using etree and triu(A(:,k))
  *
@@ -16,8 +20,6 @@ var _csMarked = require("./csMarked.js");
  *                                  The first n entries is the nonzero pattern, the last n entries is the stack
  *
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csEreach(a, k, parent, w) {
   // a arrays

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

@@ -4,14 +4,16 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Computes the elimination tree of Matrix A (using triu(A)) or the
  * elimination tree of A'A without forming A'A.
  *
  * @param {Matrix}  a               The A Matrix
  * @param {boolean} ata             A value of true the function computes the etree of A'A
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csEtree(a, ata) {
   // check inputs

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

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Keeps entries in the matrix when the callback function returns true, removes the entry otherwise
  *
@@ -16,8 +20,6 @@ exports.csFkeep = csFkeep;
  * @param {any}      other          The state
  *
  * @return                          The number of nonzero elements in the matrix
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csFkeep(a, callback, other) {
   // a arrays

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

@@ -4,12 +4,14 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * 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
  */
 function csFlip(i) {
   // flip the value

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

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Permutes a vector; x = P'b. In MATLAB notation, x(p)=b.
  *

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

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * This function determines if j is a leaf of the ith row subtree.
  * Consider A(i,j), node j in ith row subtree and return lca(jprev,j)
@@ -17,8 +21,6 @@ exports.csLeaf = csLeaf;
  * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
  *
  * @return {Object}
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
   var s, sparent;

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

@@ -6,6 +6,10 @@ Object.defineProperty(exports, "__esModule", {
 exports.createCsLu = void 0;
 var _factory = require("../../../utils/factory.js");
 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';
 var dependencies = ['abs', 'divideScalar', 'multiply', 'subtract', 'larger', 'largerEq', 'SparseMatrix'];
 var createCsLu = exports.createCsLu = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -34,8 +38,6 @@ var createCsLu = exports.createCsLu = /* #__PURE__ */(0, _factory.factory)(name,
    * @param {Number}  tol             Partial pivoting threshold (1 for partial pivoting)
    *
    * @return {Number}                 The numeric LU factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function csLu(m, s, tol) {
     // validate input

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

@@ -5,13 +5,15 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.csMark = csMark;
 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
+
 /**
  * Marks the node at w[j]
  *
  * @param {Array}   w               The array
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csMark(w, j) {
   // mark w[j]

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

@@ -4,13 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Checks if the node at w[j] is marked
  *
  * @param {Array}   w               The array
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csMarked(w, j) {
   // check node is marked

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

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Permutes a sparse matrix C = P * A * Q
  *
@@ -13,8 +17,6 @@ exports.csPermute = csPermute;
  * @param {boolean} values          Create a pattern matrix (false), values and pattern otherwise
  *
  * @return {Matrix}                 C = P * A * Q, null on error
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csPermute(a, pinv, q, values) {
   // a arrays

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

@@ -5,13 +5,15 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.csPost = csPost;
 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
+
 /**
  * Post order a tree of forest
  *
  * @param {Array}   parent          The tree or forest
  * @param {Number}  n               Number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csPost(parent, n) {
   // check inputs

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

@@ -7,6 +7,10 @@ exports.csReach = csReach;
 var _csMarked = require("./csMarked.js");
 var _csMark = require("./csMark.js");
 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
+
 /**
  * The csReach function computes X = Reach(B), where B is the nonzero pattern of the n-by-1
  * sparse column of vector b. The function returns the set of nodes reachable from any node in B. The
@@ -20,8 +24,6 @@ var _csDfs = require("./csDfs.js");
  * @param {Array}   pinv            The inverse row permutation vector
  *
  * @return {Number}                 The index for the nonzero pattern
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 function csReach(g, b, k, xi, pinv) {
   // g arrays

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

@@ -6,6 +6,10 @@ Object.defineProperty(exports, "__esModule", {
 exports.createCsSpsolve = void 0;
 var _csReach = require("./csReach.js");
 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';
 var dependencies = ['divideScalar', 'multiply', 'subtract'];
 var createCsSpsolve = exports.createCsSpsolve = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -28,8 +32,6 @@ var createCsSpsolve = exports.createCsSpsolve = /* #__PURE__ */(0, _factory.fact
    * @param {boolean} lo              The lower (true) upper triangular (false) flag
    *
    * @return {Number}                 The index for the nonzero pattern
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function csSpsolve(g, b, k, xi, x, pinv, lo) {
     // g arrays

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

@@ -10,6 +10,10 @@ var _csEtree = require("./csEtree.js");
 var _csAmd = require("./csAmd.js");
 var _csCounts = require("./csCounts.js");
 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';
 var dependencies = ['add', 'multiply', 'transpose'];
 var createCsSqr = exports.createCsSqr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -34,8 +38,6 @@ var createCsSqr = exports.createCsSqr = /* #__PURE__ */(0, _factory.factory)(nam
    *                                  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

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

@@ -6,6 +6,10 @@ Object.defineProperty(exports, "__esModule", {
 exports.createCsSymperm = void 0;
 var _csCumsum = require("./csCumsum.js");
 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';
 var dependencies = ['conj', 'SparseMatrix'];
 var createCsSymperm = exports.createCsSymperm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
@@ -22,8 +26,6 @@ var createCsSymperm = exports.createCsSymperm = /* #__PURE__ */(0, _factory.fact
    * @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

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

@@ -4,6 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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
+
 /**
  * Depth-first search and postorder of a tree rooted at node j
  *
@@ -14,8 +18,6 @@ exports.csTdfs = csTdfs;
  * @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
  */
 function csTdfs(j, k, w, head, next, post, stack) {
   // variables

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

@@ -5,12 +5,14 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.csUnflip = csUnflip;
 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
+
 /**
  * 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
  */
 function csUnflip(i) {
   // flip the value if it is negative

package/lib/cjs/header.js

@@ -6,8 +6,8 @@
  * It features real and complex numbers, units, matrices, a large set of
  * mathematical functions, and a flexible expression parser.
  *
- * @version 12.4.0
- * @date    2024-02-22
+ * @version 12.4.1
+ * @date    2024-03-13
  *
  * @license
  * Copyright (C) 2013-2024 Jos de Jong <wjosdejong@gmail.com>

package/lib/cjs/type/unit/Unit.js

@@ -3281,6 +3281,7 @@ var createUnitClass = exports.createUnitClass = /* #__PURE__ */(0, _factory.fact
   };
 
   // aliases (formerly plurals)
+  // note that ALIASES is only used at creation to create more entries in UNITS by copying the aliased units
   var ALIASES = {
     meters: 'meter',
     inches: 'inch',
@@ -3926,13 +3927,16 @@ var createUnitClass = exports.createUnitClass = /* #__PURE__ */(0, _factory.fact
       _alias.name = aliasName;
       Unit.UNITS[aliasName] = _alias;
     }
-    // delete the memoization cache, since adding a new unit to the array
-    // invalidates all old results
+
+    // delete the memoization cache because we created a new unit
     delete _findUnit.cache;
     return new Unit(null, name);
   };
   Unit.deleteUnit = function (name) {
     delete Unit.UNITS[name];
+
+    // delete the memoization cache because we deleted a unit
+    delete _findUnit.cache;
   };
 
   // expose arrays with prefixes, dimensions, units, systems

package/lib/cjs/version.js

@@ -4,6 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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.

package/lib/esm/expression/node/ConstantNode.js

@@ -142,21 +142,23 @@ export var createConstantNode = /* #__PURE__ */factory(name, dependencies, _ref
      */
     _toTex(options) {
       var value = this._toString(options);
-      switch (typeOf(this.value)) {
+      var type = typeOf(this.value);
+      switch (type) {
         case 'string':
           return '\\mathtt{' + escapeLatex(value) + '}';
         case 'number':
         case 'BigNumber':
           {
-            if (!isFinite(this.value)) {
+            var finite = type === 'BigNumber' ? this.value.isFinite() : isFinite(this.value);
+            if (!finite) {
               return this.value.valueOf() < 0 ? '-\\infty' : '\\infty';
             }
             var index = value.toLowerCase().indexOf('e');
             if (index !== -1) {
               return value.substring(0, index) + '\\cdot10^{' + value.substring(index + 1) + '}';
             }
+            return value;
           }
-          return value;
         case 'Fraction':
           return this.value.toLatex();
         default:

package/lib/esm/function/algebra/simplifyCore.js

@@ -229,6 +229,9 @@ export var createSimplifyCore = /* #__PURE__ */factory(name, dependencies, _ref
         if (isConstantNode(_a)) {
           if (_a.value) {
             if (isAlwaysBoolean(a1)) return a1;
+            if (isConstantNode(a1)) {
+              return a1.value ? nodeT : nodeF;
+            }
           } else {
             return nodeF;
           }

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

@@ -1,3 +1,6 @@
+// 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';
 import { csFkeep } from './csFkeep.js';
 import { csFlip } from './csFlip.js';
@@ -16,8 +19,6 @@ export var createCsAmd = /* #__PURE__ */factory(name, dependencies, _ref => {
    * than A. It is a gready method that selects the sparsest pivot row and column during the course
    * of a right looking sparse Cholesky factorization.
    *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
-   *
    * @param {Number} order    0: Natural, 1: Cholesky, 2: LU, 3: QR
    * @param {Matrix} m        Sparse Matrix
    */

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

@@ -1,3 +1,6 @@
+// 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';
 import { csEreach } from './csEreach.js';
 import { createCsSymperm } from './csSymperm.js';
@@ -29,8 +32,6 @@ export var createCsChol = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param {Object}  s               The symbolic analysis from cs_schol()
    *
    * @return {Number}                 The numeric Cholesky factorization of A or null
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function csChol(m, s) {
     // validate input

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

@@ -1,3 +1,6 @@
+// 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';
 import { csLeaf } from './csLeaf.js';
 var name = 'csCounts';
@@ -15,8 +18,6 @@ export var createCsCounts = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param {Matrix} ata         Count the columns of A'A instead
    *
    * @return                     An array of size n of the column counts or null on error
-   *
-   * Reference: http://faculty.cse.tamu.edu/davis/publications.html
    */
   return function (a, parent, post, ata) {
     // check inputs

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

@@ -1,11 +1,13 @@
+// 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
+
 /**
  * It sets the p[i] equal to the sum of c[0] through c[i-1].
  *
  * @param {Array}   ptr             The Sparse Matrix ptr array
  * @param {Array}   c               The Sparse Matrix ptr array
  * @param {Number}  n               The number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csCumsum(ptr, c, n) {
   // variables

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

@@ -1,3 +1,6 @@
+// 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';
 import { csMark } from './csMark.js';
 import { csUnflip } from './csUnflip.js';
@@ -15,8 +18,6 @@ import { csUnflip } from './csUnflip.js';
  * @param {Array}   pinv            The inverse row permutation vector, must be null for L * x = b
  *
  * @return {Number}                 New value of top
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csDfs(j, g, top, xi, pinv) {
   // g arrays