mathjs 11.2.1 → 11.3.0

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

@@ -4,25 +4,21 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createPartitionSelect = void 0;
-
 var _is = require("../../utils/is.js");
-
 var _number = require("../../utils/number.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'partitionSelect';
 var dependencies = ['typed', 'isNumeric', 'isNaN', 'compare'];
 var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      isNumeric = _ref.isNumeric,
-      isNaN = _ref.isNaN,
-      compare = _ref.compare;
+    isNumeric = _ref.isNumeric,
+    isNaN = _ref.isNaN,
+    compare = _ref.compare;
   var asc = compare;
-
   var desc = function desc(a, b) {
     return -compare(a, b);
   };
+
   /**
    * Partition-based selection of an array or 1D matrix.
    * Will find the kth smallest value, and mutates the input array.
@@ -55,8 +51,6 @@ var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependenc
    *        and 0 when a == b.
    * @return {*} Returns the kth lowest value.
    */
-
-
   return typed(name, {
     'Array | Matrix, number': function ArrayMatrixNumber(x, k) {
       return _partitionSelect(x, k, asc);
@@ -72,26 +66,22 @@ var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependenc
     },
     'Array | Matrix, number, function': _partitionSelect
   });
-
   function _partitionSelect(x, k, compare) {
     if (!(0, _number.isInteger)(k) || k < 0) {
       throw new Error('k must be a non-negative integer');
     }
-
     if ((0, _is.isMatrix)(x)) {
       var size = x.size();
-
       if (size.length > 1) {
         throw new Error('Only one dimensional matrices supported');
       }
-
       return quickSelect(x.valueOf(), k, compare);
     }
-
     if (Array.isArray(x)) {
       return quickSelect(x, k, compare);
     }
   }
+
   /**
    * Quickselect algorithm.
    * Code adapted from:
@@ -102,14 +92,12 @@ var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependenc
    * @param {Function} compare
    * @private
    */
-
-
   function quickSelect(arr, k, compare) {
     if (k >= arr.length) {
       throw new Error('k out of bounds');
-    } // check for NaN values since these can cause an infinite while loop
-
+    }
 
+    // check for NaN values since these can cause an infinite while loop
     for (var i = 0; i < arr.length; i++) {
       if (isNumeric(arr[i]) && isNaN(arr[i])) {
         return arr[i]; // return NaN
@@ -117,13 +105,15 @@ var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependenc
     }
 
     var from = 0;
-    var to = arr.length - 1; // if from == to we reached the kth element
+    var to = arr.length - 1;
 
+    // if from == to we reached the kth element
     while (from < to) {
       var r = from;
       var w = to;
-      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from]; // stop if the reader and writer meets
+      var pivot = arr[Math.floor(Math.random() * (to - from + 1)) + from];
 
+      // stop if the reader and writer meets
       while (r < w) {
         // arr[r] >= pivot
         if (compare(arr[r], pivot) >= 0) {
@@ -136,21 +126,20 @@ var createPartitionSelect = /* #__PURE__ */(0, _factory.factory)(name, dependenc
           // the value is smaller than the pivot, skip
           ++r;
         }
-      } // if we stepped up (r++) we need to step one down (arr[r] > pivot)
-
+      }
 
+      // if we stepped up (r++) we need to step one down (arr[r] > pivot)
       if (compare(arr[r], pivot) > 0) {
         --r;
-      } // the r pointer is on the end of the first k elements
-
+      }
 
+      // the r pointer is on the end of the first k elements
       if (k <= r) {
         to = r;
       } else {
         from = r + 1;
       }
     }
-
     return arr[k];
   }
 });

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

@@ -4,33 +4,26 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createPinv = 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 _object = require("../../utils/object.js");
-
 var name = 'pinv';
 var dependencies = ['typed', 'matrix', 'inv', 'deepEqual', 'equal', 'dotDivide', 'dot', 'ctranspose', 'divideScalar', 'multiply', 'add', 'Complex'];
 var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      inv = _ref.inv,
-      deepEqual = _ref.deepEqual,
-      equal = _ref.equal,
-      dotDivide = _ref.dotDivide,
-      dot = _ref.dot,
-      ctranspose = _ref.ctranspose,
-      divideScalar = _ref.divideScalar,
-      multiply = _ref.multiply,
-      add = _ref.add,
-      Complex = _ref.Complex;
-
+    matrix = _ref.matrix,
+    inv = _ref.inv,
+    deepEqual = _ref.deepEqual,
+    equal = _ref.equal,
+    dotDivide = _ref.dotDivide,
+    dot = _ref.dot,
+    ctranspose = _ref.ctranspose,
+    divideScalar = _ref.divideScalar,
+    multiply = _ref.multiply,
+    add = _ref.add,
+    Complex = _ref.Complex;
   /**
    * Calculate the Moore–Penrose inverse of a matrix.
    *
@@ -54,37 +47,32 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
   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
           if (_isZeros(x)) return ctranspose(x); // null vector
-
           if (size[0] === 1) {
             return inv(x); // invertible matrix
           } else {
             return dotDivide(ctranspose(x), dot(x, x));
           }
-
         case 2:
           // two dimensional array
           {
             if (_isZeros(x)) return ctranspose(x); // zero matrixx
-
             var rows = size[0];
             var cols = size[1];
-
             if (rows === cols) {
               try {
                 return inv(x); // invertible matrix
               } catch (err) {
-                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {// Expected
+                if (err instanceof Error && err.message.match(/Cannot calculate inverse, determinant is zero/)) {
+                  // Expected
                 } else {
                   throw err;
                 }
               }
             }
-
             if ((0, _is.isMatrix)(x)) {
               return matrix(_pinv(x.valueOf(), rows, cols), x.storage());
             } else {
@@ -92,7 +80,6 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
               return _pinv(x, rows, cols);
             }
           }
-
         default:
           // multi dimensional array
           throw new RangeError('Matrix must be two dimensional ' + '(size: ' + (0, _string.format)(size) + ')');
@@ -101,10 +88,10 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
     any: function any(x) {
       // scalar
       if (equal(x, 0)) return (0, _object.clone)(x); // zero
-
       return divideScalar(1, x);
     }
   });
+
   /**
    * Calculate the Moore–Penrose inverse of a matrix
    * @param {Array[]} mat     A matrix
@@ -113,17 +100,15 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    * @return {Array[]} pinv    Pseudoinverse matrix
    * @private
    */
-
   function _pinv(mat, rows, cols) {
     var _rankFact2 = _rankFact(mat, rows, cols),
-        C = _rankFact2.C,
-        F = _rankFact2.F; // TODO: Use SVD instead (may improve precision)
-
-
+      C = _rankFact2.C,
+      F = _rankFact2.F; // TODO: Use SVD instead (may improve precision)
     var Cpinv = multiply(inv(multiply(ctranspose(C), C)), ctranspose(C));
     var Fpinv = multiply(ctranspose(F), inv(multiply(F, ctranspose(F))));
     return multiply(Fpinv, Cpinv);
   }
+
   /**
    * Calculate the reduced row echelon form of a matrix
    *
@@ -135,55 +120,43 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    * @return {Array[]}        Reduced row echelon form
    * @private
    */
-
-
   function _rref(mat, rows, cols) {
     var M = (0, _object.clone)(mat);
     var lead = 0;
-
     for (var r = 0; r < rows; r++) {
       if (cols <= lead) {
         return M;
       }
-
       var i = r;
-
       while (_isZero(M[i][lead])) {
         i++;
-
         if (rows === i) {
           i = r;
           lead++;
-
           if (cols === lead) {
             return M;
           }
         }
       }
-
       var _ref2 = [M[r], M[i]];
       M[i] = _ref2[0];
       M[r] = _ref2[1];
       var val = M[r][lead];
-
       for (var j = 0; j < cols; j++) {
         M[r][j] = dotDivide(M[r][j], val);
       }
-
       for (var _i = 0; _i < rows; _i++) {
         if (_i === r) continue;
         val = M[_i][lead];
-
         for (var _j = 0; _j < cols; _j++) {
           M[_i][_j] = add(M[_i][_j], multiply(-1, multiply(val, M[r][_j])));
         }
       }
-
       lead++;
     }
-
     return M;
   }
+
   /**
    * Calculate the rank factorization of a matrix
    *
@@ -193,11 +166,8 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    * @return {{C: Array, F: Array}}        rank factorization where M = C F
    * @private
    */
-
-
   function _rankFact(mat, rows, cols) {
     var rref = _rref(mat, rows, cols);
-
     var C = mat.map(function (_, i) {
       return _.filter(function (_, j) {
         return j < rows && !_isZero(dot(rref[j], rref[j]));
@@ -211,11 +181,9 @@ var createPinv = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       F: F
     };
   }
-
   function _isZero(x) {
     return equal(add(x, Complex(1, 1)), add(0, Complex(1, 1)));
   }
-
   function _isZeros(arr) {
     return deepEqual(add(arr, Complex(1, 1)), add(multiply(arr, 0), Complex(1, 1)));
   }

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

@@ -4,23 +4,19 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createRange = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _noop = require("../../utils/noop.js");
-
 var name = 'range';
 var dependencies = ['typed', 'config', '?matrix', '?bignumber', 'smaller', 'smallerEq', 'larger', 'largerEq'];
 var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      matrix = _ref.matrix,
-      bignumber = _ref.bignumber,
-      smaller = _ref.smaller,
-      smallerEq = _ref.smallerEq,
-      larger = _ref.larger,
-      largerEq = _ref.largerEq;
-
+    config = _ref.config,
+    matrix = _ref.matrix,
+    bignumber = _ref.bignumber,
+    smaller = _ref.smaller,
+    smallerEq = _ref.smallerEq,
+    larger = _ref.larger,
+    largerEq = _ref.largerEq;
   /**
    * Create an array from a range.
    * By default, the range end is excluded. This can be customized by providing
@@ -66,6 +62,7 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    */
   return typed(name, {
     // TODO: simplify signatures when typed-function supports default values and optional arguments
+
     // TODO: a number or boolean should not be converted to string here
     string: _strRange,
     'string, boolean': _strRange,
@@ -96,29 +93,22 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return includeEnd ? _out(_bigRangeInc(start, end, step)) : _out(_bigRangeEx(start, end, step));
     }
   });
-
   function _out(arr) {
     if (config.matrix === 'Matrix') {
       return matrix ? matrix(arr) : (0, _noop.noMatrix)();
     }
-
     return arr;
   }
-
   function _strRange(str, includeEnd) {
     var r = _parse(str);
-
     if (!r) {
       throw new SyntaxError('String "' + str + '" is no valid range');
     }
-
     var fn;
-
     if (config.number === 'BigNumber') {
       if (bignumber === undefined) {
         (0, _noop.noBignumber)();
       }
-
       fn = includeEnd ? _bigRangeInc : _bigRangeEx;
       return _out(fn(bignumber(r.start), bignumber(r.end), bignumber(r.step)));
     } else {
@@ -126,6 +116,7 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return _out(fn(r.start, r.end, r.step));
     }
   }
+
   /**
    * Create a range with numbers. End is excluded
    * @param {number} start
@@ -134,12 +125,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @returns {Array} range
    * @private
    */
-
-
   function _rangeEx(start, end, step) {
     var array = [];
     var x = start;
-
     if (step > 0) {
       while (smaller(x, end)) {
         array.push(x);
@@ -151,9 +139,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         x += step;
       }
     }
-
     return array;
   }
+
   /**
    * Create a range with numbers. End is included
    * @param {number} start
@@ -162,12 +150,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @returns {Array} range
    * @private
    */
-
-
   function _rangeInc(start, end, step) {
     var array = [];
     var x = start;
-
     if (step > 0) {
       while (smallerEq(x, end)) {
         array.push(x);
@@ -179,9 +164,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         x += step;
       }
     }
-
     return array;
   }
+
   /**
    * Create a range with big numbers. End is excluded
    * @param {BigNumber} start
@@ -190,13 +175,10 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @returns {Array} range
    * @private
    */
-
-
   function _bigRangeEx(start, end, step) {
     var zero = bignumber(0);
     var array = [];
     var x = start;
-
     if (step.gt(zero)) {
       while (smaller(x, end)) {
         array.push(x);
@@ -208,9 +190,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         x = x.plus(step);
       }
     }
-
     return array;
   }
+
   /**
    * Create a range with big numbers. End is included
    * @param {BigNumber} start
@@ -219,13 +201,10 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @returns {Array} range
    * @private
    */
-
-
   function _bigRangeInc(start, end, step) {
     var zero = bignumber(0);
     var array = [];
     var x = start;
-
     if (step.gt(zero)) {
       while (smallerEq(x, end)) {
         array.push(x);
@@ -237,9 +216,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         x = x.plus(step);
       }
     }
-
     return array;
   }
+
   /**
    * Parse a string into a range,
    * The string contains the start, optional step, and end, separated by a colon.
@@ -249,11 +228,10 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @return {{start: number, end: number, step: number} | null} range Object containing properties start, end, step
    * @private
    */
-
-
   function _parse(str) {
-    var args = str.split(':'); // number
+    var args = str.split(':');
 
+    // number
     var nums = args.map(function (arg) {
       // use Number and not parseFloat as Number returns NaN on invalid garbage in the string
       return Number(arg);
@@ -261,11 +239,9 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
     var invalid = nums.some(function (num) {
       return isNaN(num);
     });
-
     if (invalid) {
       return null;
     }
-
     switch (nums.length) {
       case 2:
         return {
@@ -273,14 +249,12 @@ var createRange = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
           end: nums[1],
           step: 1
         };
-
       case 3:
         return {
           start: nums[0],
           end: nums[2],
           step: nums[1]
         };
-
       default:
         return null;
     }

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

@@ -4,17 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createReshape = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'reshape';
 var dependencies = ['typed', 'isInteger', 'matrix'];
 var createReshape = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      isInteger = _ref.isInteger;
-
+    isInteger = _ref.isInteger;
   /**
    * Reshape a multi dimensional array to fit the specified dimensions
    *

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

@@ -4,29 +4,19 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createResize = void 0;
-
 var _is = require("../../utils/is.js");
-
 var _DimensionError = require("../../error/DimensionError.js");
-
 var _ArgumentsError = require("../../error/ArgumentsError.js");
-
 var _number = require("../../utils/number.js");
-
 var _string = require("../../utils/string.js");
-
 var _object = require("../../utils/object.js");
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'resize';
 var dependencies = ['config', 'matrix'];
 var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var config = _ref.config,
-      matrix = _ref.matrix;
-
+    matrix = _ref.matrix;
   /**
    * Resize a matrix
    *
@@ -58,7 +48,6 @@ var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
     if (arguments.length !== 2 && arguments.length !== 3) {
       throw new _ArgumentsError.ArgumentsError('resize', arguments.length, 2, 3);
     }
-
     if ((0, _is.isMatrix)(size)) {
       size = size.valueOf(); // get Array
     }
@@ -68,40 +57,37 @@ var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
       size = size.map(function (value) {
         return !(0, _is.isBigNumber)(value) ? value : value.toNumber();
       });
-    } // check x is a Matrix
-
+    }
 
+    // check x is a Matrix
     if ((0, _is.isMatrix)(x)) {
       // use optimized matrix implementation, return copy
       return x.resize(size, defaultValue, true);
     }
-
     if (typeof x === 'string') {
       // resize string
       return _resizeString(x, size, defaultValue);
-    } // check result should be a matrix
-
+    }
 
+    // check result should be a matrix
     var asMatrix = Array.isArray(x) ? false : config.matrix !== 'Array';
-
     if (size.length === 0) {
       // output a scalar
       while (Array.isArray(x)) {
         x = x[0];
       }
-
       return (0, _object.clone)(x);
     } else {
       // output an array/matrix
       if (!Array.isArray(x)) {
         x = [x];
       }
-
       x = (0, _object.clone)(x);
       var res = (0, _array.resize)(x, size, defaultValue);
       return asMatrix ? matrix(res) : res;
     }
   };
+
   /**
    * Resize a string
    * @param {string} str
@@ -109,7 +95,6 @@ var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
    * @param {string} [defaultChar=' ']
    * @private
    */
-
   function _resizeString(str, size, defaultChar) {
     if (defaultChar !== undefined) {
       if (typeof defaultChar !== 'string' || defaultChar.length !== 1) {
@@ -118,26 +103,20 @@ var createResize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
     } else {
       defaultChar = ' ';
     }
-
     if (size.length !== 1) {
       throw new _DimensionError.DimensionError(size.length, 1);
     }
-
     var len = size[0];
-
     if (typeof len !== 'number' || !(0, _number.isInteger)(len)) {
       throw new TypeError('Invalid size, must contain positive integers ' + '(size: ' + (0, _string.format)(size) + ')');
     }
-
     if (str.length > len) {
       return str.substring(0, len);
     } else if (str.length < len) {
       var res = str;
-
       for (var i = 0, ii = len - str.length; i < ii; i++) {
         res += defaultChar;
       }
-
       return res;
     } else {
       return str;