mathjs 12.4.3 → 13.0.0

package/lib/cjs/function/signal/zpk2tf.js

@@ -5,14 +5,16 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.createZpk2tf = void 0;
 var _factory = require("../../utils/factory.js");
-var name = 'zpk2tf';
-var dependencies = ['typed', 'add', 'multiply', 'Complex', 'number'];
-var createZpk2tf = exports.createZpk2tf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    add = _ref.add,
-    multiply = _ref.multiply,
-    Complex = _ref.Complex,
-    number = _ref.number;
+const name = 'zpk2tf';
+const dependencies = ['typed', 'add', 'multiply', 'Complex', 'number'];
+const createZpk2tf = exports.createZpk2tf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    multiply,
+    Complex,
+    number
+  } = _ref;
   /**
      * Compute the transfer function of a zero-pole-gain model.
      *
@@ -32,58 +34,50 @@ var createZpk2tf = exports.createZpk2tf = /* #__PURE__ */(0, _factory.factory)(n
      *
      */
   return typed(name, {
-    'Array,Array,number': function ArrayArrayNumber(z, p, k) {
+    'Array,Array,number': function (z, p, k) {
       return _zpk2tf(z, p, k);
     },
-    'Array,Array': function ArrayArray(z, p) {
+    'Array,Array': function (z, p) {
       return _zpk2tf(z, p, 1);
     },
-    'Matrix,Matrix,number': function MatrixMatrixNumber(z, p, k) {
+    'Matrix,Matrix,number': function (z, p, k) {
       return _zpk2tf(z.valueOf(), p.valueOf(), k);
     },
-    'Matrix,Matrix': function MatrixMatrix(z, p) {
+    'Matrix,Matrix': function (z, p) {
       return _zpk2tf(z.valueOf(), p.valueOf(), 1);
     }
   });
   function _zpk2tf(z, p, k) {
     // if z is bignumber, convert it to number
-    if (z.some(function (el) {
-      return el.type === 'BigNumber';
-    })) {
-      z = z.map(function (el) {
-        return number(el);
-      });
+    if (z.some(el => el.type === 'BigNumber')) {
+      z = z.map(el => number(el));
     }
     // if p is bignumber, convert it to number
-    if (p.some(function (el) {
-      return el.type === 'BigNumber';
-    })) {
-      p = p.map(function (el) {
-        return number(el);
-      });
+    if (p.some(el => el.type === 'BigNumber')) {
+      p = p.map(el => number(el));
     }
-    var num = [Complex(1, 0)];
-    var den = [Complex(1, 0)];
-    for (var i = 0; i < z.length; i++) {
-      var zero = z[i];
+    let num = [Complex(1, 0)];
+    let den = [Complex(1, 0)];
+    for (let i = 0; i < z.length; i++) {
+      let zero = z[i];
       if (typeof zero === 'number') zero = Complex(zero, 0);
       num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)]);
     }
-    for (var _i = 0; _i < p.length; _i++) {
-      var pole = p[_i];
+    for (let i = 0; i < p.length; i++) {
+      let pole = p[i];
       if (typeof pole === 'number') pole = Complex(pole, 0);
       den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)]);
     }
-    for (var _i2 = 0; _i2 < num.length; _i2++) {
-      num[_i2] = multiply(num[_i2], k);
+    for (let i = 0; i < num.length; i++) {
+      num[i] = multiply(num[i], k);
     }
     return [num, den];
   }
   function _multiply(a, b) {
-    var c = [];
-    for (var i = 0; i < a.length + b.length - 1; i++) {
+    const c = [];
+    for (let i = 0; i < a.length + b.length - 1; i++) {
       c[i] = Complex(0, 0);
-      for (var j = 0; j < a.length; j++) {
+      for (let j = 0; j < a.length; j++) {
         if (i - j >= 0 && i - j < b.length) {
           c[i] = add(c[i], multiply(a[j], b[i - j]));
         }

package/lib/cjs/function/special/erf.js

@@ -9,10 +9,12 @@ var _number = require("../../utils/number.js");
 var _factory = require("../../utils/factory.js");
 /* eslint-disable no-loss-of-precision */
 
-var name = 'erf';
-var dependencies = ['typed'];
-var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed;
+const name = 'erf';
+const dependencies = ['typed'];
+const createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed
+  } = _ref;
   /**
    * Compute the erf function of a value using a rational Chebyshev
    * approximations for different intervals of x.
@@ -41,8 +43,8 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
    * @return {number | Array | Matrix}    The erf of `x`
    */
   return typed('name', {
-    number: function number(x) {
-      var y = Math.abs(x);
+    number: function (x) {
+      const y = Math.abs(x);
       if (y >= MAX_NUM) {
         return (0, _number.sign)(x);
       }
@@ -54,11 +56,7 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
       }
       return (0, _number.sign)(x) * (1 - erfc3(y));
     },
-    'Array | Matrix': typed.referToSelf(function (self) {
-      return function (n) {
-        return (0, _collection.deepMap)(n, self);
-      };
-    })
+    'Array | Matrix': typed.referToSelf(self => n => (0, _collection.deepMap)(n, self))
 
     // TODO: For complex numbers, use the approximation for the Faddeeva function
     //  from "More Efficient Computation of the Complex Error Function" (AMS)
@@ -71,10 +69,10 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
    *              j=0
    */
   function erf1(y) {
-    var ysq = y * y;
-    var xnum = P[0][4] * ysq;
-    var xden = ysq;
-    var i;
+    const ysq = y * y;
+    let xnum = P[0][4] * ysq;
+    let xden = ysq;
+    let i;
     for (i = 0; i < 3; i += 1) {
       xnum = (xnum + P[0][i]) * ysq;
       xden = (xden + Q[0][i]) * ysq;
@@ -90,16 +88,16 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
    *                      j=0
    */
   function erfc2(y) {
-    var xnum = P[1][8] * y;
-    var xden = y;
-    var i;
+    let xnum = P[1][8] * y;
+    let xden = y;
+    let i;
     for (i = 0; i < 7; i += 1) {
       xnum = (xnum + P[1][i]) * y;
       xden = (xden + Q[1][i]) * y;
     }
-    var result = (xnum + P[1][7]) / (xden + Q[1][7]);
-    var ysq = parseInt(y * 16) / 16;
-    var del = (y - ysq) * (y + ysq);
+    const result = (xnum + P[1][7]) / (xden + Q[1][7]);
+    const ysq = parseInt(y * 16) / 16;
+    const del = (y - ysq) * (y + ysq);
     return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
   }
 
@@ -113,18 +111,18 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
    *              j=0
    */
   function erfc3(y) {
-    var ysq = 1 / (y * y);
-    var xnum = P[2][5] * ysq;
-    var xden = ysq;
-    var i;
+    let ysq = 1 / (y * y);
+    let xnum = P[2][5] * ysq;
+    let xden = ysq;
+    let i;
     for (i = 0; i < 4; i += 1) {
       xnum = (xnum + P[2][i]) * ysq;
       xden = (xden + Q[2][i]) * ysq;
     }
-    var result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
+    let result = ysq * (xnum + P[2][4]) / (xden + Q[2][4]);
     result = (SQRPI - result) / y;
     ysq = parseInt(y * 16) / 16;
-    var del = (y - ysq) * (y + ysq);
+    const del = (y - ysq) * (y + ysq);
     return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
   }
 });
@@ -133,31 +131,31 @@ var createErf = exports.createErf = /* #__PURE__ */(0, _factory.factory)(name, d
  * Upper bound for the first approximation interval, 0 <= x <= THRESH
  * @constant
  */
-var THRESH = 0.46875;
+const THRESH = 0.46875;
 
 /**
  * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
  * @constant
  */
-var SQRPI = 5.6418958354775628695e-1;
+const SQRPI = 5.6418958354775628695e-1;
 
 /**
  * Coefficients for each term of the numerator sum (p_j) for each approximation
  * interval (see W. J. Cody's paper for more details)
  * @constant
  */
-var P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
+const P = [[3.16112374387056560e00, 1.13864154151050156e02, 3.77485237685302021e02, 3.20937758913846947e03, 1.85777706184603153e-1], [5.64188496988670089e-1, 8.88314979438837594e00, 6.61191906371416295e01, 2.98635138197400131e02, 8.81952221241769090e02, 1.71204761263407058e03, 2.05107837782607147e03, 1.23033935479799725e03, 2.15311535474403846e-8], [3.05326634961232344e-1, 3.60344899949804439e-1, 1.25781726111229246e-1, 1.60837851487422766e-2, 6.58749161529837803e-4, 1.63153871373020978e-2]];
 
 /**
  * Coefficients for each term of the denominator sum (q_j) for each approximation
  * interval (see W. J. Cody's paper for more details)
  * @constant
  */
-var Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
+const Q = [[2.36012909523441209e01, 2.44024637934444173e02, 1.28261652607737228e03, 2.84423683343917062e03], [1.57449261107098347e01, 1.17693950891312499e02, 5.37181101862009858e02, 1.62138957456669019e03, 3.29079923573345963e03, 4.36261909014324716e03, 3.43936767414372164e03, 1.23033935480374942e03], [2.56852019228982242e00, 1.87295284992346047e00, 5.27905102951428412e-1, 6.05183413124413191e-2, 2.33520497626869185e-3]];
 
 /**
  * Maximum/minimum safe numbers to input to erf() (in ES6+, this number is
  * Number.[MAX|MIN]_SAFE_INTEGER). erf() for all numbers beyond this limit will
  * return 1
  */
-var MAX_NUM = Math.pow(2, 53);
+const MAX_NUM = Math.pow(2, 53);

package/lib/cjs/function/special/zeta.js

@@ -5,25 +5,27 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.createZeta = void 0;
 var _factory = require("../../utils/factory.js");
-var name = 'zeta';
-var dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi'];
-var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    config = _ref.config,
-    multiply = _ref.multiply,
-    pow = _ref.pow,
-    divide = _ref.divide,
-    factorial = _ref.factorial,
-    equal = _ref.equal,
-    smallerEq = _ref.smallerEq,
-    isNegative = _ref.isNegative,
-    gamma = _ref.gamma,
-    sin = _ref.sin,
-    subtract = _ref.subtract,
-    add = _ref.add,
-    Complex = _ref.Complex,
-    _BigNumber = _ref.BigNumber,
-    pi = _ref.pi;
+const name = 'zeta';
+const dependencies = ['typed', 'config', 'multiply', 'pow', 'divide', 'factorial', 'equal', 'smallerEq', 'isNegative', 'gamma', 'sin', 'subtract', 'add', '?Complex', '?BigNumber', 'pi'];
+const createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    multiply,
+    pow,
+    divide,
+    factorial,
+    equal,
+    smallerEq,
+    isNegative,
+    gamma,
+    sin,
+    subtract,
+    add,
+    Complex,
+    BigNumber,
+    pi
+  } = _ref;
   /**
    * Compute the Riemann Zeta function of a value using an infinite series for
    * all of the complex plane using Riemann's Functional equation.
@@ -52,21 +54,11 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
    * @return {number | Complex | BigNumber}    The Riemann Zeta of `s`
    */
   return typed(name, {
-    number: function number(s) {
-      return zetaNumeric(s, function (value) {
-        return value;
-      }, function () {
-        return 20;
-      });
-    },
-    BigNumber: function BigNumber(s) {
-      return zetaNumeric(s, function (value) {
-        return new _BigNumber(value);
-      }, function () {
-        // epsilon is for example 1e-12. Extract the positive exponent 12 from that
-        return Math.abs(Math.log10(config.epsilon));
-      });
-    },
+    number: s => zetaNumeric(s, value => value, () => 20),
+    BigNumber: s => zetaNumeric(s, value => new BigNumber(value), () => {
+      // relTol is for example 1e-12. Extract the positive exponent 12 from that
+      return Math.abs(Math.log10(config.relTol));
+    }),
     Complex: zetaComplex
   });
 
@@ -86,9 +78,7 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
     if (!isFinite(s)) {
       return isNegative(s) ? createValue(NaN) : createValue(1);
     }
-    return zeta(s, createValue, determineDigits, function (s) {
-      return s;
-    });
+    return zeta(s, createValue, determineDigits, s => s);
   }
 
   /**
@@ -108,13 +98,7 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
     if (s.im === Infinity || s.re === -Infinity) {
       return new Complex(NaN, NaN);
     }
-    return zeta(s, function (value) {
-      return value;
-    }, function (s) {
-      return Math.round(1.3 * 15 + 0.9 * Math.abs(s.im));
-    }, function (s) {
-      return s.re;
-    });
+    return zeta(s, value => value, s => Math.round(1.3 * 15 + 0.9 * Math.abs(s.im)), s => s.re);
   }
 
   /**
@@ -125,12 +109,12 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
    * @returns {*|number}
    */
   function zeta(s, createValue, determineDigits, getRe) {
-    var n = determineDigits(s);
+    const n = determineDigits(s);
     if (getRe(s) > -(n - 1) / 2) {
       return f(s, createValue(n), createValue);
     } else {
       // Function Equation for reflection to x < 1
-      var c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)));
+      let c = multiply(pow(2, s), pow(createValue(pi), subtract(s, 1)));
       c = multiply(c, sin(multiply(divide(createValue(pi), 2), s)));
       c = multiply(c, gamma(subtract(1, s)));
       return multiply(c, zeta(subtract(1, s), createValue, determineDigits, getRe));
@@ -144,9 +128,9 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
    * @return {number}    the portion of the sum
    **/
   function d(k, n) {
-    var S = k;
-    for (var j = k; smallerEq(j, n); j = add(j, 1)) {
-      var factor = divide(multiply(factorial(add(n, subtract(j, 1))), pow(4, j)), multiply(factorial(subtract(n, j)), factorial(multiply(2, j))));
+    let S = k;
+    for (let j = k; smallerEq(j, n); j = add(j, 1)) {
+      const factor = divide(multiply(factorial(add(n, subtract(j, 1))), pow(4, j)), multiply(factorial(subtract(n, j)), factorial(multiply(2, j))));
       S = add(S, factor);
     }
     return multiply(n, S);
@@ -160,10 +144,10 @@ var createZeta = exports.createZeta = /* #__PURE__ */(0, _factory.factory)(name,
    * @return {number}    Riemann Zeta of s
    **/
   function f(s, n, createValue) {
-    var c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))));
-    var S = createValue(0);
-    for (var k = createValue(1); smallerEq(k, n); k = add(k, 1)) {
-      S = add(S, divide(multiply(Math.pow(-1, k - 1), d(k, n)), pow(k, s)));
+    const c = divide(1, multiply(d(createValue(0), n), subtract(1, pow(2, subtract(1, s)))));
+    let S = createValue(0);
+    for (let k = createValue(1); smallerEq(k, n); k = add(k, 1)) {
+      S = add(S, divide(multiply((-1) ** (k - 1), d(k, n)), pow(k, s)));
     }
     return multiply(c, S);
   }

package/lib/cjs/function/statistics/corr.js

@@ -5,18 +5,20 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.createCorr = void 0;
 var _factory = require("../../utils/factory.js");
-var name = 'corr';
-var dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide'];
-var createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    matrix = _ref.matrix,
-    sqrt = _ref.sqrt,
-    sum = _ref.sum,
-    add = _ref.add,
-    subtract = _ref.subtract,
-    multiply = _ref.multiply,
-    pow = _ref.pow,
-    divide = _ref.divide;
+const name = 'corr';
+const dependencies = ['typed', 'matrix', 'mean', 'sqrt', 'sum', 'add', 'subtract', 'multiply', 'pow', 'divide'];
+const createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    matrix,
+    sqrt,
+    sum,
+    add,
+    subtract,
+    multiply,
+    pow,
+    divide
+  } = _ref;
   /**
    * Compute the correlation coefficient of a two list with values, For matrices, the matrix correlation coefficient is calculated.
    *
@@ -39,11 +41,11 @@ var createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name,
    * @return {*} The correlation coefficient
    */
   return typed(name, {
-    'Array, Array': function ArrayArray(A, B) {
+    'Array, Array': function (A, B) {
       return _corr(A, B);
     },
-    'Matrix, Matrix': function MatrixMatrix(A, B) {
-      var res = _corr(A.toArray(), B.toArray());
+    'Matrix, Matrix': function (A, B) {
+      const res = _corr(A.toArray(), B.toArray());
       return Array.isArray(res) ? matrix(res) : res;
     }
   });
@@ -55,12 +57,12 @@ var createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name,
    * @private
    */
   function _corr(A, B) {
-    var correlations = [];
+    const correlations = [];
     if (Array.isArray(A[0]) && Array.isArray(B[0])) {
       if (A.length !== B.length) {
         throw new SyntaxError('Dimension mismatch. Array A and B must have the same length.');
       }
-      for (var i = 0; i < A.length; i++) {
+      for (let i = 0; i < A.length; i++) {
         if (A[i].length !== B[i].length) {
           throw new SyntaxError('Dimension mismatch. Array A and B must have the same number of elements.');
         }
@@ -75,20 +77,14 @@ var createCorr = exports.createCorr = /* #__PURE__ */(0, _factory.factory)(name,
     }
   }
   function correlation(A, B) {
-    var n = A.length;
-    var sumX = sum(A);
-    var sumY = sum(B);
-    var sumXY = A.reduce(function (acc, x, index) {
-      return add(acc, multiply(x, B[index]));
-    }, 0);
-    var sumXSquare = sum(A.map(function (x) {
-      return pow(x, 2);
-    }));
-    var sumYSquare = sum(B.map(function (y) {
-      return pow(y, 2);
-    }));
-    var numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY));
-    var denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))));
+    const n = A.length;
+    const sumX = sum(A);
+    const sumY = sum(B);
+    const sumXY = A.reduce((acc, x, index) => add(acc, multiply(x, B[index])), 0);
+    const sumXSquare = sum(A.map(x => pow(x, 2)));
+    const sumYSquare = sum(B.map(y => pow(y, 2)));
+    const numerator = subtract(multiply(n, sumXY), multiply(sumX, sumY));
+    const denominator = sqrt(multiply(subtract(multiply(n, sumXSquare), pow(sumX, 2)), subtract(multiply(n, sumYSquare), pow(sumY, 2))));
     return divide(numerator, denominator);
   }
 });

package/lib/cjs/function/statistics/cumsum.js

@@ -10,12 +10,14 @@ var _switch2 = require("../../utils/switch.js");
 var _improveErrorMessage = require("./utils/improveErrorMessage.js");
 var _array = require("../../utils/array.js");
 var _IndexError = require("../../error/IndexError.js");
-var name = 'cumsum';
-var dependencies = ['typed', 'add', 'unaryPlus'];
-var createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    add = _ref.add,
-    unaryPlus = _ref.unaryPlus;
+const name = 'cumsum';
+const dependencies = ['typed', 'add', 'unaryPlus'];
+const createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    add,
+    unaryPlus
+  } = _ref;
   /**
    * Compute the cumulative sum of a matrix or a list with values.
    * In case of a (multi dimensional) array or matrix, the cumulative sums
@@ -45,16 +47,16 @@ var createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(n
   return typed(name, {
     // sum([a, b, c, d, ...])
     Array: _cumsum,
-    Matrix: function Matrix(matrix) {
+    Matrix: function (matrix) {
       return matrix.create(_cumsum(matrix.valueOf()));
     },
     // sum([a, b, c, d, ...], dim)
     'Array, number | BigNumber': _ncumSumDim,
-    'Matrix, number | BigNumber': function MatrixNumberBigNumber(matrix, dim) {
+    'Matrix, number | BigNumber': function (matrix, dim) {
       return matrix.create(_ncumSumDim(matrix.valueOf(), dim));
     },
     // cumsum(a, b, c, d, ...)
-    '...': function _(args) {
+    '...': function (args) {
       if ((0, _collection.containsCollections)(args)) {
         throw new TypeError('All values expected to be scalar in function cumsum');
       }
@@ -79,8 +81,8 @@ var createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(n
     if (array.length === 0) {
       return [];
     }
-    var sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
-    for (var i = 1; i < array.length; ++i) {
+    const sums = [unaryPlus(array[0])]; // unaryPlus converts to number if need be
+    for (let i = 1; i < array.length; ++i) {
       // Must use add below and not addScalar for the case of summing a
       // 2+-dimensional array along the 0th dimension (the row vectors,
       // or higher-d analogues, are literally added to each other).
@@ -89,7 +91,7 @@ var createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(n
     return sums;
   }
   function _ncumSumDim(array, dim) {
-    var size = (0, _array.arraySize)(array);
+    const size = (0, _array.arraySize)(array);
     if (dim < 0 || dim >= size.length) {
       // TODO: would be more clear when throwing a DimensionError here
       throw new _IndexError.IndexError(dim, size.length);
@@ -103,9 +105,9 @@ var createCumSum = exports.createCumSum = /* #__PURE__ */(0, _factory.factory)(n
 
   /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
   function _cumsumDimensional(mat, dim) {
-    var i, ret, tran;
+    let i, ret, tran;
     if (dim <= 0) {
-      var initialValue = mat[0][0];
+      const initialValue = mat[0][0];
       if (!Array.isArray(initialValue)) {
         return _cumsummap(mat);
       } else {

package/lib/cjs/function/statistics/mad.js

@@ -7,14 +7,16 @@ exports.createMad = void 0;
 var _array = require("../../utils/array.js");
 var _factory = require("../../utils/factory.js");
 var _improveErrorMessage = require("./utils/improveErrorMessage.js");
-var name = 'mad';
-var dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
-var createMad = exports.createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    abs = _ref.abs,
-    map = _ref.map,
-    median = _ref.median,
-    subtract = _ref.subtract;
+const name = 'mad';
+const dependencies = ['typed', 'abs', 'map', 'median', 'subtract'];
+const createMad = exports.createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    abs,
+    map,
+    median,
+    subtract
+  } = _ref;
   /**
    * Compute the median absolute deviation of a matrix or a list with values.
    * The median absolute deviation is defined as the median of the absolute
@@ -43,7 +45,7 @@ var createMad = exports.createMad = /* #__PURE__ */(0, _factory.factory)(name, d
     // mad([a, b, c, d, ...])
     'Array | Matrix': _mad,
     // mad(a, b, c, d, ...)
-    '...': function _(args) {
+    '...': function (args) {
       return _mad(args);
     }
   });
@@ -53,7 +55,7 @@ var createMad = exports.createMad = /* #__PURE__ */(0, _factory.factory)(name, d
       throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
     }
     try {
-      var med = median(array);
+      const med = median(array);
       return median(map(array, function (value) {
         return abs(subtract(value, med));
       }));

package/lib/cjs/function/statistics/max.js

@@ -6,14 +6,17 @@ Object.defineProperty(exports, "__esModule", {
 exports.createMax = void 0;
 var _collection = require("../../utils/collection.js");
 var _factory = require("../../utils/factory.js");
+var _number = require("../../utils/number.js");
 var _improveErrorMessage = require("./utils/improveErrorMessage.js");
-var name = 'max';
-var dependencies = ['typed', 'config', 'numeric', 'larger'];
-var createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var typed = _ref.typed,
-    config = _ref.config,
-    numeric = _ref.numeric,
-    larger = _ref.larger;
+const name = 'max';
+const dependencies = ['typed', 'config', 'numeric', 'larger'];
+const createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => {
+  let {
+    typed,
+    config,
+    numeric,
+    larger
+  } = _ref;
   /**
    * Compute the maximum value of a matrix or a  list with values.
    * In case of a multidimensional array, the maximum of the flattened array
@@ -49,11 +52,11 @@ var createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, d
     // max([a, b, c, d, ...])
     'Array | Matrix': _max,
     // max([a, b, c, d, ...], dim)
-    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(array, dim) {
+    'Array | Matrix, number | BigNumber': function (array, dim) {
       return (0, _collection.reduce)(array, dim.valueOf(), _largest);
     },
     // max(a, b, c, d, ...)
-    '...': function _(args) {
+    '...': function (args) {
       if ((0, _collection.containsCollections)(args)) {
         throw new TypeError('Scalar values expected in function max');
       }
@@ -83,7 +86,7 @@ var createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, d
    * @private
    */
   function _max(array) {
-    var res;
+    let res;
     (0, _collection.deepForEach)(array, function (value) {
       try {
         if (isNaN(value) && typeof value === 'number') {
@@ -101,7 +104,7 @@ var createMax = exports.createMax = /* #__PURE__ */(0, _factory.factory)(name, d
 
     // make sure returning numeric value: parse a string into a numeric value
     if (typeof res === 'string') {
-      res = numeric(res, config.number);
+      res = numeric(res, (0, _number.safeNumberType)(res, config));
     }
     return res;
   }