mathjs 11.2.0 → 11.3.0

package/lib/cjs/function/arithmetic/floor.js

@@ -1,36 +1,25 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createFloorNumber = exports.createFloor = void 0;
-
 var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
-
 var _decimal = _interopRequireDefault(require("decimal.js"));
-
 var _factory = require("../../utils/factory.js");
-
 var _collection = require("../../utils/collection.js");
-
 var _number = require("../../utils/number.js");
-
 var _nearlyEqual = require("../../utils/bignumber/nearlyEqual.js");
-
 var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
-
 var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
-
 var _matAlgo14xDs = require("../../type/matrix/utils/matAlgo14xDs.js");
-
 var name = 'floor';
 var dependencies = ['typed', 'config', 'round', 'matrix', 'equalScalar', 'zeros', 'DenseMatrix'];
 var createFloorNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'config', 'round'], function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      round = _ref.round;
+    config = _ref.config,
+    round = _ref.round;
   return typed(name, {
     number: function number(x) {
       if ((0, _number.nearlyEqual)(x, round(x), config.epsilon)) {
@@ -44,16 +33,12 @@ var createFloorNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'co
         return round(x, n);
       } else {
         var _split = "".concat(x, "e").split('e'),
-            _split2 = (0, _slicedToArray2["default"])(_split, 2),
-            number = _split2[0],
-            exponent = _split2[1];
-
+          _split2 = (0, _slicedToArray2["default"])(_split, 2),
+          number = _split2[0],
+          exponent = _split2[1];
         var result = Math.floor(Number("".concat(number, "e").concat(Number(exponent) + n)));
-
         var _split3 = "".concat(result, "e").split('e');
-
         var _split4 = (0, _slicedToArray2["default"])(_split3, 2);
-
         number = _split4[0];
         exponent = _split4[1];
         return Number("".concat(number, "e").concat(Number(exponent) - n));
@@ -64,12 +49,12 @@ var createFloorNumber = /* #__PURE__ */(0, _factory.factory)(name, ['typed', 'co
 exports.createFloorNumber = createFloorNumber;
 var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref2) {
   var typed = _ref2.typed,
-      config = _ref2.config,
-      round = _ref2.round,
-      matrix = _ref2.matrix,
-      equalScalar = _ref2.equalScalar,
-      zeros = _ref2.zeros,
-      DenseMatrix = _ref2.DenseMatrix;
+    config = _ref2.config,
+    round = _ref2.round,
+    matrix = _ref2.matrix,
+    equalScalar = _ref2.equalScalar,
+    zeros = _ref2.zeros,
+    DenseMatrix = _ref2.DenseMatrix;
   var matAlgo11xS0s = (0, _matAlgo11xS0s.createMatAlgo11xS0s)({
     typed: typed,
     equalScalar: equalScalar
@@ -126,7 +111,6 @@ var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    * @param  {number | BigNumber | Array} [n=0]                            Number of decimals
    * @return {number | BigNumber | Fraction | Complex | Array | Matrix} Rounded value
    */
-
   return typed('floor', {
     number: floorNumber.signatures.number,
     'number,number': floorNumber.signatures['number,number'],
@@ -195,11 +179,9 @@ var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
     'number | Complex | Fraction | BigNumber, Matrix': typed.referToSelf(function (self) {
       return function (x, y) {
         if (equalScalar(x, 0)) return zeros(y.size(), y.storage());
-
         if (y.storage() === 'dense') {
           return matAlgo14xDs(y, x, self, true);
         }
-
         return matAlgo12xSfs(y, x, self, true);
       };
     })

package/lib/cjs/function/arithmetic/gcd.js

@@ -4,27 +4,20 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createGcd = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _matAlgo01xDSid = require("../../type/matrix/utils/matAlgo01xDSid.js");
-
 var _matAlgo04xSidSid = require("../../type/matrix/utils/matAlgo04xSidSid.js");
-
 var _matAlgo10xSids = require("../../type/matrix/utils/matAlgo10xSids.js");
-
 var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'gcd';
 var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix'];
 var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      equalScalar = _ref.equalScalar,
-      BigNumber = _ref.BigNumber,
-      DenseMatrix = _ref.DenseMatrix;
+    matrix = _ref.matrix,
+    equalScalar = _ref.equalScalar,
+    BigNumber = _ref.BigNumber,
+    DenseMatrix = _ref.DenseMatrix;
   var matAlgo01xDSid = (0, _matAlgo01xDSid.createMatAlgo01xDSid)({
     typed: typed
   });
@@ -45,14 +38,13 @@ var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
   gcdManySignature["".concat(gcdTypes, ", ").concat(gcdTypes, ", ...").concat(gcdTypes)] = typed.referToSelf(function (self) {
     return function (a, b, args) {
       var res = self(a, b);
-
       for (var i = 0; i < args.length; i++) {
         res = self(res, args[i]);
       }
-
       return res;
     };
   });
+
   /**
    * Calculate the greatest common divisor for two or more values or arrays.
    *
@@ -78,7 +70,6 @@ var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @param {... number | BigNumber | Fraction | Array | Matrix} args  Two or more integer numbers
    * @return {number | BigNumber | Fraction | Array | Matrix}                           The greatest common divisor
    */
-
   return typed(name, {
     'number, number': _index.gcdNumber,
     'BigNumber, BigNumber': _gcdBigNumber,
@@ -90,6 +81,7 @@ var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     DS: matAlgo01xDSid,
     Ss: matAlgo10xSids
   }), gcdManySignature);
+
   /**
    * Calculate gcd for BigNumbers
    * @param {BigNumber} a
@@ -97,21 +89,18 @@ var createGcd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @returns {BigNumber} Returns greatest common denominator of a and b
    * @private
    */
-
   function _gcdBigNumber(a, b) {
     if (!a.isInt() || !b.isInt()) {
       throw new Error('Parameters in function gcd must be integer numbers');
-    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
-
+    }
 
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
     var zero = new BigNumber(0);
-
     while (!b.isZero()) {
       var r = a.mod(b);
       a = b;
       b = r;
     }
-
     return a.lt(zero) ? a.neg() : a;
   }
 });

package/lib/cjs/function/arithmetic/hypot.js

@@ -4,25 +4,20 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createHypot = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _array = require("../../utils/array.js");
-
 var _is = require("../../utils/is.js");
-
 var name = 'hypot';
 var dependencies = ['typed', 'abs', 'addScalar', 'divideScalar', 'multiplyScalar', 'sqrt', 'smaller', 'isPositive'];
 var createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      abs = _ref.abs,
-      addScalar = _ref.addScalar,
-      divideScalar = _ref.divideScalar,
-      multiplyScalar = _ref.multiplyScalar,
-      sqrt = _ref.sqrt,
-      smaller = _ref.smaller,
-      isPositive = _ref.isPositive;
-
+    abs = _ref.abs,
+    addScalar = _ref.addScalar,
+    divideScalar = _ref.divideScalar,
+    multiplyScalar = _ref.multiplyScalar,
+    sqrt = _ref.sqrt,
+    smaller = _ref.smaller,
+    isPositive = _ref.isPositive;
   /**
    * Calculate the hypotenusa of a list with values. The hypotenusa is defined as:
    *
@@ -58,26 +53,23 @@ var createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return _hypot((0, _array.flatten)(M.toArray()));
     }
   });
+
   /**
    * Calculate the hypotenusa for an Array with values
    * @param {Array.<number | BigNumber>} args
    * @return {number | BigNumber} Returns the result
    * @private
    */
-
   function _hypot(args) {
     // code based on `hypot` from es6-shim:
     // https://github.com/paulmillr/es6-shim/blob/master/es6-shim.js#L1619-L1633
     var result = 0;
     var largest = 0;
-
     for (var i = 0; i < args.length; i++) {
       if ((0, _is.isComplex)(args[i])) {
         throw new TypeError('Unexpected type of argument to hypot');
       }
-
       var value = abs(args[i]);
-
       if (smaller(largest, value)) {
         result = multiplyScalar(result, multiplyScalar(divideScalar(largest, value), divideScalar(largest, value)));
         result = addScalar(result, 1);
@@ -86,7 +78,6 @@ var createHypot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         result = addScalar(result, isPositive(value) ? multiplyScalar(divideScalar(value, largest), divideScalar(value, largest)) : value);
       }
     }
-
     return multiplyScalar(largest, sqrt(result));
   }
 });

package/lib/cjs/function/arithmetic/invmod.js

@@ -1,29 +1,24 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createInvmod = void 0;
-
 var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'invmod';
 var dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
 var createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      BigNumber = _ref.BigNumber,
-      xgcd = _ref.xgcd,
-      equal = _ref.equal,
-      smaller = _ref.smaller,
-      mod = _ref.mod,
-      add = _ref.add,
-      isInteger = _ref.isInteger;
-
+    config = _ref.config,
+    BigNumber = _ref.BigNumber,
+    xgcd = _ref.xgcd,
+    equal = _ref.equal,
+    smaller = _ref.smaller,
+    mod = _ref.mod,
+    add = _ref.add,
+    isInteger = _ref.isInteger;
   /**
    * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
    * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
@@ -51,19 +46,16 @@ var createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
     'number, number': invmod,
     'BigNumber, BigNumber': invmod
   });
-
   function invmod(a, b) {
     if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
     a = mod(a, b);
     if (equal(b, 0)) throw new Error('Divisor must be non zero');
     var res = xgcd(a, b);
     res = res.valueOf();
-
     var _res = res,
-        _res2 = (0, _slicedToArray2["default"])(_res, 2),
-        gcd = _res2[0],
-        inv = _res2[1];
-
+      _res2 = (0, _slicedToArray2["default"])(_res, 2),
+      gcd = _res2[0],
+      inv = _res2[1];
     if (!equal(gcd, BigNumber(1))) return NaN;
     inv = mod(inv, b);
     if (smaller(inv, BigNumber(0))) inv = add(inv, b);

package/lib/cjs/function/arithmetic/lcm.js

@@ -4,25 +4,18 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createLcm = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
-
 var _matAlgo06xS0S = require("../../type/matrix/utils/matAlgo06xS0S0.js");
-
 var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
-
 var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'lcm';
 var dependencies = ['typed', 'matrix', 'equalScalar'];
 var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      equalScalar = _ref.equalScalar;
+    matrix = _ref.matrix,
+    equalScalar = _ref.equalScalar;
   var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
     typed: typed,
     equalScalar: equalScalar
@@ -44,14 +37,13 @@ var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
   lcmManySignature["".concat(lcmTypes, ", ").concat(lcmTypes, ", ...").concat(lcmTypes)] = typed.referToSelf(function (self) {
     return function (a, b, args) {
       var res = self(a, b);
-
       for (var i = 0; i < args.length; i++) {
         res = self(res, args[i]);
       }
-
       return res;
     };
   });
+
   /**
    * Calculate the least common multiple for two or more values or arrays.
    *
@@ -81,7 +73,6 @@ var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @param {... number | BigNumber | Array | Matrix} args  Two or more integer numbers
    * @return {number | BigNumber | Array | Matrix}                           The least common multiple
    */
-
   return typed(name, {
     'number, number': _index.lcmNumber,
     'BigNumber, BigNumber': _lcmBigNumber,
@@ -93,6 +84,7 @@ var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     DS: matAlgo02xDS0,
     Ss: matAlgo11xS0s
   }), lcmManySignature);
+
   /**
    * Calculate lcm for two BigNumbers
    * @param {BigNumber} a
@@ -100,30 +92,25 @@ var createLcm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @returns {BigNumber} Returns the least common multiple of a and b
    * @private
    */
-
   function _lcmBigNumber(a, b) {
     if (!a.isInt() || !b.isInt()) {
       throw new Error('Parameters in function lcm must be integer numbers');
     }
-
     if (a.isZero()) {
       return a;
     }
-
     if (b.isZero()) {
       return b;
-    } // https://en.wikipedia.org/wiki/Euclidean_algorithm
-    // evaluate lcm here inline to reduce overhead
-
+    }
 
+    // https://en.wikipedia.org/wiki/Euclidean_algorithm
+    // evaluate lcm here inline to reduce overhead
     var prod = a.times(b);
-
     while (!b.isZero()) {
       var t = b;
       b = a.mod(t);
       a = t;
     }
-
     return prod.div(a).abs();
   }
 });

package/lib/cjs/function/arithmetic/log.js

@@ -4,19 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createLog = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'log';
 var dependencies = ['config', 'typed', 'divideScalar', 'Complex'];
 var createLog = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      divideScalar = _ref.divideScalar,
-      Complex = _ref.Complex;
-
+    config = _ref.config,
+    divideScalar = _ref.divideScalar,
+    Complex = _ref.Complex;
   /**
    * Calculate the logarithm of a value.
    *

package/lib/cjs/function/arithmetic/log10.js

@@ -4,20 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createLog10 = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _collection = require("../../utils/collection.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'log10';
 var dependencies = ['typed', 'config', 'Complex'];
 var createLog10 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      _Complex = _ref.Complex;
-
+    config = _ref.config,
+    _Complex = _ref.Complex;
   /**
    * Calculate the 10-base logarithm of a value. This is the same as calculating `log(x, 10)`.
    *

package/lib/cjs/function/arithmetic/log1p.js

@@ -4,22 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createLog1p = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _collection = require("../../utils/collection.js");
-
 var _number = require("../../utils/number.js");
-
 var name = 'log1p';
 var dependencies = ['typed', 'config', 'divideScalar', 'log', 'Complex'];
 var createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      divideScalar = _ref.divideScalar,
-      log = _ref.log,
-      Complex = _ref.Complex;
-
+    config = _ref.config,
+    divideScalar = _ref.divideScalar,
+    log = _ref.log,
+    Complex = _ref.Complex;
   /**
    * Calculate the logarithm of a `value+1`.
    *
@@ -63,7 +58,6 @@ var createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
     Complex: _log1pComplex,
     BigNumber: function BigNumber(x) {
       var y = x.plus(1);
-
       if (!y.isNegative() || config.predictable) {
         return y.ln();
       } else {
@@ -83,13 +77,13 @@ var createLog1p = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       };
     })
   });
+
   /**
    * Calculate the natural logarithm of a complex number + 1
    * @param {Complex} x
    * @returns {Complex}
    * @private
    */
-
   function _log1pComplex(x) {
     var xRe1p = x.re + 1;
     return new Complex(Math.log(Math.sqrt(xRe1p * xRe1p + x.im * x.im)), Math.atan2(x.im, xRe1p));

package/lib/cjs/function/arithmetic/log2.js

@@ -4,20 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createLog2 = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _collection = require("../../utils/collection.js");
-
 var _index = require("../../plain/number/index.js");
-
 var name = 'log2';
 var dependencies = ['typed', 'config', 'Complex'];
 var createLog2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      config = _ref.config,
-      Complex = _ref.Complex;
-
+    config = _ref.config,
+    Complex = _ref.Complex;
   /**
    * Calculate the 2-base of a value. This is the same as calculating `log(x, 2)`.
    *
@@ -67,13 +62,13 @@ var createLog2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       };
     })
   });
+
   /**
    * Calculate log2 for a complex value
    * @param {Complex} x
    * @returns {Complex}
    * @private
    */
-
   function _log2Complex(x) {
     var newX = Math.sqrt(x.re * x.re + x.im * x.im);
     return new Complex(Math.log2 ? Math.log2(newX) : Math.log(newX) / Math.LN2, Math.atan2(x.im, x.re) / Math.LN2);

package/lib/cjs/function/arithmetic/mod.js

@@ -4,30 +4,21 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createMod = void 0;
-
 var _factory = require("../../utils/factory.js");
-
 var _matAlgo02xDS = require("../../type/matrix/utils/matAlgo02xDS0.js");
-
 var _matAlgo03xDSf = require("../../type/matrix/utils/matAlgo03xDSf.js");
-
 var _matAlgo05xSfSf = require("../../type/matrix/utils/matAlgo05xSfSf.js");
-
 var _matAlgo11xS0s = require("../../type/matrix/utils/matAlgo11xS0s.js");
-
 var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
-
 var _index = require("../../plain/number/index.js");
-
 var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
-
 var name = 'mod';
 var dependencies = ['typed', 'matrix', 'equalScalar', 'DenseMatrix'];
 var createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      matrix = _ref.matrix,
-      equalScalar = _ref.equalScalar,
-      DenseMatrix = _ref.DenseMatrix;
+    matrix = _ref.matrix,
+    equalScalar = _ref.equalScalar,
+    DenseMatrix = _ref.DenseMatrix;
   var matAlgo02xDS0 = (0, _matAlgo02xDS.createMatAlgo02xDS0)({
     typed: typed,
     equalScalar: equalScalar
@@ -51,6 +42,7 @@ var createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     typed: typed,
     matrix: matrix
   });
+
   /**
    * Calculates the modulus, the remainder of an integer division.
    *
@@ -86,22 +78,19 @@ var createMod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * @param  {number | BigNumber | Fraction | Array | Matrix} y Divisor
    * @return {number | BigNumber | Fraction | Array | Matrix} Returns the remainder of `x` divided by `y`.
    */
-
   return typed(name, {
     'number, number': _index.modNumber,
     'BigNumber, BigNumber': function BigNumberBigNumber(x, y) {
       if (y.isNeg()) {
         throw new Error('Cannot calculate mod for a negative divisor');
       }
-
       return y.isZero() ? x : x.mod(y);
     },
     'Fraction, Fraction': function FractionFraction(x, y) {
       if (y.compare(0) < 0) {
         throw new Error('Cannot calculate mod for a negative divisor');
-      } // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend
-
-
+      }
+      // Workaround suggested in Fraction.js library to calculate correct modulo for negative dividend
       return x.compare(0) >= 0 ? x.mod(y) : x.mod(y).add(y).mod(y);
     }
   }, matrixAlgorithmSuite({