mathjs 11.2.1 → 11.3.0

package/lib/cjs/function/matrix/inv.js

@@ -4,28 +4,22 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createInv = void 0;
-
 var _is = require("../../utils/is.js");
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var _string = require("../../utils/string.js");
-
 var name = 'inv';
 var dependencies = ['typed', 'matrix', 'divideScalar', 'addScalar', 'multiply', 'unaryMinus', 'det', 'identity', 'abs'];
 var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      divideScalar = _ref.divideScalar,
-      addScalar = _ref.addScalar,
-      multiply = _ref.multiply,
-      unaryMinus = _ref.unaryMinus,
-      det = _ref.det,
-      identity = _ref.identity,
-      abs = _ref.abs;
-
+    matrix = _ref.matrix,
+    divideScalar = _ref.divideScalar,
+    addScalar = _ref.addScalar,
+    multiply = _ref.multiply,
+    unaryMinus = _ref.unaryMinus,
+    det = _ref.det,
+    identity = _ref.identity,
+    abs = _ref.abs;
   /**
    * Calculate the inverse of a square matrix.
    *
@@ -49,7 +43,6 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
   return typed(name, {
     'Array | Matrix': function ArrayMatrix(x) {
       var size = (0, _is.isMatrix)(x) ? x.size() : (0, _array.arraySize)(x);
-
       switch (size.length) {
         case 1:
           // vector
@@ -62,13 +55,11 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
           } else {
             throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
           }
-
         case 2:
           // two dimensional array
           {
             var rows = size[0];
             var cols = size[1];
-
             if (rows === cols) {
               if ((0, _is.isMatrix)(x)) {
                 return matrix(_inv(x.valueOf(), rows, cols), x.storage());
@@ -80,7 +71,6 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
               throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
             }
           }
-
         default:
           // multi dimensional array
           throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
@@ -91,6 +81,7 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       return divideScalar(1, x); // FIXME: create a BigNumber one when configured for bignumbers
     }
   });
+
   /**
    * Calculate the inverse of a square matrix
    * @param {Array[]} mat     A square matrix
@@ -99,27 +90,21 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @return {Array[]} inv    Inverse matrix
    * @private
    */
-
   function _inv(mat, rows, cols) {
     var r, s, f, value, temp;
-
     if (rows === 1) {
       // this is a 1 x 1 matrix
       value = mat[0][0];
-
       if (value === 0) {
         throw Error('Cannot calculate inverse, determinant is zero');
       }
-
       return [[divideScalar(1, value)]];
     } else if (rows === 2) {
       // this is a 2 x 2 matrix
       var d = det(mat);
-
       if (d === 0) {
         throw Error('Cannot calculate inverse, determinant is zero');
       }
-
       return [[divideScalar(mat[1][1], d), divideScalar(unaryMinus(mat[0][1]), d)], [divideScalar(unaryMinus(mat[1][0]), d), divideScalar(mat[0][0], d)]];
     } else {
       // this is a matrix of 3 x 3 or larger
@@ -127,38 +112,34 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       //      https://en.wikipedia.org/wiki/Gaussian_elimination
       //      http://mathworld.wolfram.com/MatrixInverse.html
       //      http://math.uww.edu/~mcfarlat/inverse.htm
+
       // make a copy of the matrix (only the arrays, not of the elements)
       var A = mat.concat();
-
       for (r = 0; r < rows; r++) {
         A[r] = A[r].concat();
-      } // create an identity matrix which in the end will contain the
-      // matrix inverse
-
+      }
 
-      var B = identity(rows).valueOf(); // loop over all columns, and perform row reductions
+      // create an identity matrix which in the end will contain the
+      // matrix inverse
+      var B = identity(rows).valueOf();
 
+      // loop over all columns, and perform row reductions
       for (var c = 0; c < cols; c++) {
         // Pivoting: Swap row c with row r, where row r contains the largest element A[r][c]
         var ABig = abs(A[c][c]);
         var rBig = c;
         r = c + 1;
-
         while (r < rows) {
           if (abs(A[r][c]) > ABig) {
             ABig = abs(A[r][c]);
             rBig = r;
           }
-
           r++;
         }
-
         if (ABig === 0) {
           throw Error('Cannot calculate inverse, determinant is zero');
         }
-
         r = rBig;
-
         if (r !== c) {
           temp = A[c];
           A[c] = A[r];
@@ -166,26 +147,24 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
           temp = B[c];
           B[c] = B[r];
           B[r] = temp;
-        } // eliminate non-zero values on the other rows at column c
-
+        }
 
+        // eliminate non-zero values on the other rows at column c
         var Ac = A[c];
         var Bc = B[c];
-
         for (r = 0; r < rows; r++) {
           var Ar = A[r];
           var Br = B[r];
-
           if (r !== c) {
             // eliminate value at column c and row r
             if (Ar[c] !== 0) {
-              f = divideScalar(unaryMinus(Ar[c]), Ac[c]); // add (f * row c) to row r to eliminate the value
-              // at column c
+              f = divideScalar(unaryMinus(Ar[c]), Ac[c]);
 
+              // add (f * row c) to row r to eliminate the value
+              // at column c
               for (s = c; s < cols; s++) {
                 Ar[s] = addScalar(Ar[s], multiply(f, Ac[s]));
               }
-
               for (s = 0; s < cols; s++) {
                 Br[s] = addScalar(Br[s], multiply(f, Bc[s]));
               }
@@ -194,18 +173,15 @@ var createInv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
             // normalize value at Acc to 1,
             // divide each value on row r with the value at Acc
             f = Ac[c];
-
             for (s = c; s < cols; s++) {
               Ar[s] = divideScalar(Ar[s], f);
             }
-
             for (s = 0; s < cols; s++) {
               Br[s] = divideScalar(Br[s], f);
             }
           }
         }
       }
-
       return B;
     }
   }

package/lib/cjs/function/matrix/kron.js

@@ -4,18 +4,14 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createKron = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'kron';
 var dependencies = ['typed', 'matrix', 'multiplyScalar'];
 var createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      multiplyScalar = _ref.multiplyScalar;
-
+    matrix = _ref.matrix,
+    multiplyScalar = _ref.multiplyScalar;
   /**
      * Calculates the kronecker product of 2 matrices or vectors.
      *
@@ -55,6 +51,7 @@ var createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
     },
     'Array, Array': _kron
   });
+
   /**
      * Calculate the kronecker product of two matrices / vectors
      * @param {Array} a  First vector
@@ -62,23 +59,19 @@ var createKron = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
      * @returns {Array} Returns the kronecker product of x and y
      * @private
      */
-
   function _kron(a, b) {
     // Deal with the dimensions of the matricies.
     if ((0, _array.arraySize)(a).length === 1) {
       // Wrap it in a 2D Matrix
       a = [a];
     }
-
     if ((0, _array.arraySize)(b).length === 1) {
       // Wrap it in a 2D Matrix
       b = [b];
     }
-
     if ((0, _array.arraySize)(a).length > 2 || (0, _array.arraySize)(b).length > 2) {
       throw new RangeError('Vectors with dimensions greater then 2 are not supported expected ' + '(Size x = ' + JSON.stringify(a.length) + ', y = ' + JSON.stringify(b.length) + ')');
     }
-
     var t = [];
     var r = [];
     return a.map(function (a) {

package/lib/cjs/function/matrix/map.js

@@ -4,16 +4,12 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createMap = void 0;
-
 var _function = require("../../utils/function.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'map';
 var dependencies = ['typed'];
 var createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
-
   /**
    * Create a new matrix or array with the results of a callback function executed on
    * each entry of a given matrix/array.
@@ -62,6 +58,7 @@ var createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     }
   });
 });
+
 /**
  * Map for a multi dimensional array
  * @param {Array} array
@@ -69,13 +66,10 @@ var createMap = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
  * @return {Array}
  * @private
  */
-
 exports.createMap = createMap;
-
 function _map(array, callback) {
   // figure out what number of arguments the callback function expects
   var args = (0, _function.maxArgumentCount)(callback);
-
   var recurse = function recurse(value, index) {
     if (Array.isArray(value)) {
       return value.map(function (child, i) {
@@ -98,23 +92,19 @@ function _map(array, callback) {
         if (err instanceof TypeError && 'data' in err && err.data.category === 'wrongType') {
           var newmsg = "map attempted to call '".concat(err.data.fn, "(").concat(value);
           var indexString = JSON.stringify(index);
-
           if (args === 2) {
             newmsg += ',' + indexString;
           } else if (args !== 1) {
             newmsg += ",".concat(indexString, ",").concat(array);
           }
-
           newmsg += ")' but argument ".concat(err.data.index + 1, " of type ");
           newmsg += "".concat(err.data.actual, " does not match expected type ");
           newmsg += err.data.expected.join(' or ');
           throw new TypeError(newmsg);
         }
-
         throw err;
       }
     }
   };
-
   return recurse(array, []);
 }

package/lib/cjs/function/matrix/matrixFromColumns.js

@@ -4,23 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createMatrixFromColumns = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
 function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
 var name = 'matrixFromColumns';
 var dependencies = ['typed', 'matrix', 'flatten', 'size'];
 var createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      flatten = _ref.flatten,
-      size = _ref.size;
-
+    matrix = _ref.matrix,
+    flatten = _ref.flatten,
+    size = _ref.size;
   /**
    * Create a dense matrix from vectors as individual columns.
    * If you pass row vectors, they will be transposed (but not conjugated!)
@@ -51,35 +45,34 @@ var createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, depende
       return matrix(_createArray(arr.map(function (m) {
         return m.toArray();
       })));
-    } // TODO implement this properly for SparseMatrix
+    }
 
+    // TODO implement this properly for SparseMatrix
   });
 
   function _createArray(arr) {
     if (arr.length === 0) throw new TypeError('At least one column is needed to construct a matrix.');
-    var N = checkVectorTypeAndReturnLength(arr[0]); // create an array with empty rows
+    var N = checkVectorTypeAndReturnLength(arr[0]);
 
+    // create an array with empty rows
     var result = [];
-
     for (var i = 0; i < N; i++) {
       result[i] = [];
-    } // loop columns
-
+    }
 
+    // loop columns
     var _iterator = _createForOfIteratorHelper(arr),
-        _step;
-
+      _step;
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var col = _step.value;
         var colLength = checkVectorTypeAndReturnLength(col);
-
         if (colLength !== N) {
           throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (colLength | 0));
         }
+        var f = flatten(col);
 
-        var f = flatten(col); // push a value to each row
-
+        // push a value to each row
         for (var _i = 0; _i < N; _i++) {
           result[_i].push(f[_i]);
         }
@@ -89,13 +82,10 @@ var createMatrixFromColumns = /* #__PURE__ */(0, _factory.factory)(name, depende
     } finally {
       _iterator.f();
     }
-
     return result;
   }
-
   function checkVectorTypeAndReturnLength(vec) {
     var s = size(vec);
-
     if (s.length === 1) {
       // 1D vector
       return s[0];

package/lib/cjs/function/matrix/matrixFromFunction.js

@@ -4,16 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createMatrixFromFunction = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'matrixFromFunction';
 var dependencies = ['typed', 'matrix', 'isZero'];
 var createMatrixFromFunction = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      isZero = _ref.isZero;
-
+    matrix = _ref.matrix,
+    isZero = _ref.isZero;
   /**
    * Create a matrix by evaluating a generating function at each index.
    * The simplest overload returns a multi-dimensional array as long as `size` is an array.
@@ -63,16 +60,13 @@ var createMatrixFromFunction = /* #__PURE__ */(0, _factory.factory)(name, depend
       return _create(size, fn, format, datatype);
     }
   });
-
   function _create(size, fn, format, datatype) {
     var m;
-
     if (datatype !== undefined) {
       m = matrix(format, datatype);
     } else {
       m = matrix(format);
     }
-
     m.resize(size);
     m.forEach(function (_, index) {
       var val = fn(index);

package/lib/cjs/function/matrix/matrixFromRows.js

@@ -4,23 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createMatrixFromRows = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
-
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
-
 function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
-
 var name = 'matrixFromRows';
 var dependencies = ['typed', 'matrix', 'flatten', 'size'];
 var createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      flatten = _ref.flatten,
-      size = _ref.size;
-
+    matrix = _ref.matrix,
+    flatten = _ref.flatten,
+    size = _ref.size;
   /**
    * Create a dense matrix from vectors as individual rows.
    * If you pass column vectors, they will be transposed (but not conjugated!)
@@ -51,27 +45,24 @@ var createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependenci
       return matrix(_createArray(arr.map(function (m) {
         return m.toArray();
       })));
-    } // TODO implement this properly for SparseMatrix
+    }
 
+    // TODO implement this properly for SparseMatrix
   });
 
   function _createArray(arr) {
     if (arr.length === 0) throw new TypeError('At least one row is needed to construct a matrix.');
     var N = checkVectorTypeAndReturnLength(arr[0]);
     var result = [];
-
     var _iterator = _createForOfIteratorHelper(arr),
-        _step;
-
+      _step;
     try {
       for (_iterator.s(); !(_step = _iterator.n()).done;) {
         var row = _step.value;
         var rowLength = checkVectorTypeAndReturnLength(row);
-
         if (rowLength !== N) {
           throw new TypeError('The vectors had different length: ' + (N | 0) + ' ≠ ' + (rowLength | 0));
         }
-
         result.push(flatten(row));
       }
     } catch (err) {
@@ -79,13 +70,10 @@ var createMatrixFromRows = /* #__PURE__ */(0, _factory.factory)(name, dependenci
     } finally {
       _iterator.f();
     }
-
     return result;
   }
-
   function checkVectorTypeAndReturnLength(vec) {
     var s = size(vec);
-
     if (s.length === 1) {
       // 1D vector
       return s[0];

package/lib/cjs/function/matrix/ones.js

@@ -4,23 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createOnes = void 0;
-
 var _is = require("../../utils/is.js");
-
 var _number = require("../../utils/number.js");
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'ones';
 var dependencies = ['typed', 'config', 'matrix', 'BigNumber'];
 var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      matrix = _ref.matrix,
-      BigNumber = _ref.BigNumber;
-
+    config = _ref.config,
+    matrix = _ref.matrix,
+    BigNumber = _ref.BigNumber;
   /**
    * Create a matrix filled with ones. The created matrix can have one or
    * multiple dimensions.
@@ -63,7 +57,6 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
     // TODO: more accurate signature '...number | BigNumber, string' as soon as typed-function supports this
     '...number | BigNumber | string': function numberBigNumberString(size) {
       var last = size[size.length - 1];
-
       if (typeof last === 'string') {
         var format = size.pop();
         return _ones(size, format);
@@ -82,6 +75,7 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return _ones(size.valueOf(), format);
     }
   });
+
   /**
    * Create an Array or Matrix with ones
    * @param {Array} size
@@ -89,36 +83,28 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    * @return {Array | Matrix}
    * @private
    */
-
   function _ones(size, format) {
     var hasBigNumbers = _normalize(size);
-
     var defaultValue = hasBigNumbers ? new BigNumber(1) : 1;
-
     _validate(size);
-
     if (format) {
       // return a matrix
       var m = matrix(format);
-
       if (size.length > 0) {
         return m.resize(size, defaultValue);
       }
-
       return m;
     } else {
       // return an Array
       var arr = [];
-
       if (size.length > 0) {
         return (0, _array.resize)(arr, size, defaultValue);
       }
-
       return arr;
     }
-  } // replace BigNumbers with numbers, returns true if size contained BigNumbers
-
+  }
 
+  // replace BigNumbers with numbers, returns true if size contained BigNumbers
   function _normalize(size) {
     var hasBigNumbers = false;
     size.forEach(function (value, index, arr) {
@@ -128,9 +114,9 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       }
     });
     return hasBigNumbers;
-  } // validate arguments
-
+  }
 
+  // validate arguments
   function _validate(size) {
     size.forEach(function (value) {
       if (typeof value !== 'number' || !(0, _number.isInteger)(value) || value < 0) {