mathjs 12.3.2 → 12.4.1

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/utils/map.js

@@ -30,6 +30,7 @@ var ObjectWrappingMap = exports.ObjectWrappingMap = /*#__PURE__*/function () {
   function ObjectWrappingMap(object) {
     (0, _classCallCheck2["default"])(this, ObjectWrappingMap);
     this.wrappedObject = object;
+    this[Symbol.iterator] = this.entries;
   }
   (0, _createClass2["default"])(ObjectWrappingMap, [{
     key: "keys",
@@ -130,6 +131,7 @@ var PartitionedMap = exports.PartitionedMap = /*#__PURE__*/function () {
     this.a = a;
     this.b = b;
     this.bKeys = bKeys;
+    this[Symbol.iterator] = this.entries;
   }
   (0, _createClass2["default"])(PartitionedMap, [{
     key: "get",

package/lib/cjs/version.js

@@ -4,6 +4,6 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.version = void 0;
-var version = exports.version = '12.3.2';
+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/entry/pureFunctionsAny.generated.js

@@ -593,6 +593,7 @@ export var rightArithShift = /* #__PURE__ */createRightArithShift({
 export var round = /* #__PURE__ */createRound({
   BigNumber,
   DenseMatrix,
+  config,
   equalScalar,
   matrix,
   typed,

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/expression/parse.js

@@ -1409,8 +1409,10 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
           while (state.token === ';') {
             // eslint-disable-line no-unmodified-loop-condition
             getToken(state);
-            params[rows] = parseRow(state);
-            rows++;
+            if (state.token !== ']') {
+              params[rows] = parseRow(state);
+              rows++;
+            }
           }
           if (state.token !== ']') {
             throw createSyntaxError(state, 'End of matrix ] expected');
@@ -1458,8 +1460,10 @@ export var createParse = /* #__PURE__ */factory(name, dependencies, _ref => {
       getToken(state);
 
       // parse expression
-      params[len] = parseAssignment(state);
-      len++;
+      if (state.token !== ']' && state.token !== ';') {
+        params[len] = parseAssignment(state);
+        len++;
+      }
     }
     return new ArrayNode(params);
   }

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

package/lib/esm/function/algebra/sparse/csEreach.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 { csMark } from './csMark.js';
 import { csMarked } from './csMarked.js';
 
@@ -11,8 +14,6 @@ import { csMarked } from './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
  */
 export function csEreach(a, k, parent, w) {
   // a arrays

package/lib/esm/function/algebra/sparse/csEtree.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
+
 /**
  * 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
  */
 export function csEtree(a, ata) {
   // check inputs

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

@@ -1,3 +1,7 @@
+// 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
  *
@@ -10,8 +14,6 @@
  * @param {any}      other          The state
  *
  * @return                          The number of nonzero elements in the matrix
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csFkeep(a, callback, other) {
   // a arrays

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

@@ -1,9 +1,11 @@
+// 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
  */
 export function csFlip(i) {
   // flip the value

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

@@ -1,3 +1,7 @@
+// 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/esm/function/algebra/sparse/csLeaf.js

@@ -1,3 +1,7 @@
+// 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)
@@ -11,8 +15,6 @@
  * @param {Number}  ancestor        The index offset within the workspace for the ancestor array
  *
  * @return {Object}
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csLeaf(i, j, w, first, maxfirst, prevleaf, ancestor) {
   var s, sparent;

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

@@ -1,3 +1,7 @@
+// 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 { createCsSpsolve } from './csSpsolve.js';
 var name = 'csLu';
@@ -30,8 +34,6 @@ export var createCsLu = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @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/esm/function/algebra/sparse/csMark.js

@@ -1,3 +1,7 @@
+// 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';
 
 /**
@@ -5,8 +9,6 @@ import { csFlip } from './csFlip.js';
  *
  * @param {Array}   w               The array
  * @param {Number}  j               The array index
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csMark(w, j) {
   // mark w[j]

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

@@ -1,10 +1,12 @@
+// 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
  */
 export function csMarked(w, j) {
   // check node is marked

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

@@ -1,3 +1,7 @@
+// 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
  *
@@ -7,8 +11,6 @@
  * @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
  */
 export function csPermute(a, pinv, q, values) {
   // a arrays

package/lib/esm/function/algebra/sparse/csPost.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 { csTdfs } from './csTdfs.js';
 
 /**
@@ -5,8 +8,6 @@ import { csTdfs } from './csTdfs.js';
  *
  * @param {Array}   parent          The tree or forest
  * @param {Number}  n               Number of columns
- *
- * Reference: http://faculty.cse.tamu.edu/davis/publications.html
  */
 export function csPost(parent, n) {
   // check inputs

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

@@ -1,3 +1,7 @@
+// 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 { csDfs } from './csDfs.js';
@@ -15,8 +19,6 @@ import { csDfs } from './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
  */
 export function csReach(g, b, k, xi, pinv) {
   // g arrays

package/lib/esm/function/algebra/sparse/csSpsolve.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 { csReach } from './csReach.js';
 import { factory } from '../../../utils/factory.js';
 var name = 'csSpsolve';
@@ -24,8 +27,6 @@ export var createCsSpsolve = /* #__PURE__ */factory(name, dependencies, _ref =>
    * @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/esm/function/algebra/sparse/csSqr.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 { csPermute } from './csPermute.js';
 import { csPost } from './csPost.js';
 import { csEtree } from './csEtree.js';
@@ -30,8 +33,6 @@ export var createCsSqr = /* #__PURE__ */factory(name, dependencies, _ref => {
    *                                  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/esm/function/algebra/sparse/csSymperm.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 { csCumsum } from './csCumsum.js';
 import { factory } from '../../../utils/factory.js';
 var name = 'csSymperm';
@@ -18,8 +21,6 @@ export var createCsSymperm = /* #__PURE__ */factory(name, dependencies, _ref =>
    * @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/esm/function/algebra/sparse/csTdfs.js

@@ -1,3 +1,7 @@
+// 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
  *
@@ -8,8 +12,6 @@
  * @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

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

@@ -1,11 +1,12 @@
+// 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';
 
 /**
  * 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