mathjs 10.6.3 → 11.0.1

package/lib/cjs/function/matrix/eigs/complexEigs.js

@@ -11,7 +11,7 @@ var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers
 
 var _object = require("../../../utils/object.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 _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); }
 
@@ -84,7 +84,7 @@ function createComplexEigs(_ref) {
 
     if (findVectors) {
       vectors = findEigenvectors(arr, N, C, R, values, prec, type);
-      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2.default)(vectors));
+      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2["default"])(vectors));
     }
 
     return {
@@ -366,7 +366,7 @@ function createComplexEigs(_ref) {
       } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
         lastConvergenceBefore = 0;
         var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
-        lambdas.push.apply(lambdas, (0, _toConsumableArray2.default)(ll)); // keep track of transformations
+        lambdas.push.apply(lambdas, (0, _toConsumableArray2["default"])(ll)); // keep track of transformations
 
         if (findVectors) {
           Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
@@ -495,7 +495,7 @@ function createComplexEigs(_ref) {
       solutions = solutions.map(function (v) {
         return multiply(correction, v);
       });
-      vectors.push.apply(vectors, (0, _toConsumableArray2.default)(solutions.map(function (v) {
+      vectors.push.apply(vectors, (0, _toConsumableArray2["default"])(solutions.map(function (v) {
         return flatten(v);
       })));
     };
@@ -579,7 +579,7 @@ function createComplexEigs(_ref) {
     for (var i = 0; i < arr.length; i++) {
       var _arr$i;
 
-      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2.default)(Array(N - arr[i].length).fill(0)));
+      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2["default"])(Array(N - arr[i].length).fill(0)));
     } // add rows
 
 

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

@@ -106,9 +106,9 @@ var createFft = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     if (len === 1) return [arr[0]];
 
     if (len % 2 === 0) {
-      var ret = [].concat((0, _toConsumableArray2.default)(_fft(arr.filter(function (_, i) {
+      var ret = [].concat((0, _toConsumableArray2["default"])(_fft(arr.filter(function (_, i) {
         return i % 2 === 0;
-      }), len / 2)), (0, _toConsumableArray2.default)(_fft(arr.filter(function (_, i) {
+      }), len / 2)), (0, _toConsumableArray2["default"])(_fft(arr.filter(function (_, i) {
         return i % 2 === 1;
       }), len / 2)));
 

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

@@ -7,7 +7,7 @@ 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 _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); }
 

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

@@ -7,7 +7,7 @@ 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 _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); }
 

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

@@ -38,6 +38,7 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    *
    * Examples:
    *
+   *    math.ones()                    // returns []
    *    math.ones(3)                   // returns [1, 1, 1]
    *    math.ones(3, 2)                // returns [[1, 1], [1, 1], [1, 1]]
    *    math.ones(3, 2, 'dense')       // returns Dense Matrix [[1, 1], [1, 1], [1, 1]]
@@ -49,7 +50,7 @@ var createOnes = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
    *
    *    zeros, identity, size, range
    *
-   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
    * @param {string} [format]           The Matrix storage format
    *
    * @return {Array | Matrix | number}  A matrix filled with ones

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

@@ -27,13 +27,13 @@ var createRotate = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
      *
      * Examples:
      *
-     *    math.rotate([11, 12], math.pi / 2)                           // returns matrix([-12, 11])
-     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns matrix([-12, 11])
+     *    math.rotate([11, 12], math.pi / 2)                           // returns [-12, 11]
+     *    math.rotate(matrix([11, 12]), math.pi / 2)                   // returns [-12, 11]
      *
-     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns matrix([0, 1, 0])
-     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns matrix([0, 1, 0])
+     *    math.rotate([1, 0, 0], unit('90deg'), [0, 0, 1])             // returns [0, 1, 0]
+     *    math.rotate(matrix([1, 0, 0]), unit('90deg'), [0, 0, 1])     // returns Matrix [0, 1, 0]
      *
-     *    math.rotate([1, 0], math.complex(1 + i))                     // returns matrix([cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)])
+     *    math.rotate([1, 0], math.complex(1 + i))                     // returns [cos(1 + i) - sin(1 + i), sin(1 + i) + cos(1 + i)]
      *
      * See also:
      *

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

@@ -14,12 +14,13 @@ var _array = require("../../utils/array.js");
 var _factory = require("../../utils/factory.js");
 
 var name = 'sqrtm';
-var dependencies = ['typed', 'abs', 'add', 'multiply', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
+var dependencies = ['typed', 'abs', 'add', 'multiply', 'map', 'sqrt', 'subtract', 'inv', 'size', 'max', 'identity'];
 var createSqrtm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
       abs = _ref.abs,
       add = _ref.add,
       multiply = _ref.multiply,
+      map = _ref.map,
       sqrt = _ref.sqrt,
       subtract = _ref.subtract,
       inv = _ref.inv,
@@ -88,7 +89,7 @@ var createSqrtm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         case 1:
           // Single element Array | Matrix
           if (size[0] === 1) {
-            return sqrt(A);
+            return map(A, sqrt);
           } else {
             throw new RangeError('Matrix must be square ' + '(size: ' + (0, _string.format)(size) + ')');
           }

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

@@ -39,59 +39,58 @@ var createTranspose = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
    * @param {Array | Matrix} x  Matrix to be transposed
    * @return {Array | Matrix}   The transposed matrix
    */
-  return typed('transpose', {
+  return typed(name, {
     Array: function Array(x) {
-      // use dense matrix implementation
-      return this(matrix(x)).valueOf();
+      return transposeMatrix(matrix(x)).valueOf();
     },
-    Matrix: function Matrix(x) {
-      // matrix size
-      var size = x.size(); // result
-
-      var c; // process dimensions
-
-      switch (size.length) {
-        case 1:
-          // vector
-          c = x.clone();
-          break;
-
-        case 2:
-          {
-            // rows and columns
-            var rows = size[0];
-            var columns = size[1]; // check columns
-
-            if (columns === 0) {
-              // throw exception
-              throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + (0, _string.format)(size) + ')');
-            } // process storage format
-
-
-            switch (x.storage()) {
-              case 'dense':
-                c = _denseTranspose(x, rows, columns);
-                break;
-
-              case 'sparse':
-                c = _sparseTranspose(x, rows, columns);
-                break;
-            }
-          }
-          break;
+    Matrix: transposeMatrix,
+    any: _object.clone // scalars
 
-        default:
-          // multi dimensional
-          throw new RangeError('Matrix must be a vector or two dimensional (size: ' + (0, _string.format)(this._size) + ')');
-      }
+  });
 
-      return c;
-    },
-    // scalars
-    any: function any(x) {
-      return (0, _object.clone)(x);
+  function transposeMatrix(x) {
+    // matrix size
+    var size = x.size(); // result
+
+    var c; // process dimensions
+
+    switch (size.length) {
+      case 1:
+        // vector
+        c = x.clone();
+        break;
+
+      case 2:
+        {
+          // rows and columns
+          var rows = size[0];
+          var columns = size[1]; // check columns
+
+          if (columns === 0) {
+            // throw exception
+            throw new RangeError('Cannot transpose a 2D matrix with no columns (size: ' + (0, _string.format)(size) + ')');
+          } // process storage format
+
+
+          switch (x.storage()) {
+            case 'dense':
+              c = _denseTranspose(x, rows, columns);
+              break;
+
+            case 'sparse':
+              c = _sparseTranspose(x, rows, columns);
+              break;
+          }
+        }
+        break;
+
+      default:
+        // multi dimensional
+        throw new RangeError('Matrix must be a vector or two dimensional (size: ' + (0, _string.format)(size) + ')');
     }
-  });
+
+    return c;
+  }
 
   function _denseTranspose(m, rows, columns) {
     // matrix array

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

@@ -36,6 +36,7 @@ var createZeros = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    *
    * Examples:
    *
+   *    math.zeros()                   // returns []
    *    math.zeros(3)                  // returns [0, 0, 0]
    *    math.zeros(3, 2)               // returns [[0, 0], [0, 0], [0, 0]]
    *    math.zeros(3, 'dense')         // returns [0, 0, 0]
@@ -47,7 +48,7 @@ var createZeros = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    *
    *    ones, identity, size, range
    *
-   * @param {...number | Array} size    The size of each dimension of the matrix
+   * @param {...(number|BigNumber) | Array} size    The size of each dimension of the matrix
    * @param {string} [format]           The Matrix storage format
    *
    * @return {Array | Matrix}           A matrix filled with zeros

package/lib/cjs/function/probability/factorial.js

@@ -52,9 +52,11 @@ var createFactorial = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
 
       return gamma(n.plus(1));
     },
-    'Array | Matrix': function ArrayMatrix(n) {
-      return (0, _collection.deepMap)(n, this);
-    }
+    'Array | Matrix': typed.referToSelf(function (self) {
+      return function (n) {
+        return (0, _collection.deepMap)(n, self);
+      };
+    })
   });
 });
 exports.createFactorial = createFactorial;

package/lib/cjs/function/probability/gamma.js

@@ -5,8 +5,6 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.createGamma = void 0;
 
-var _collection = require("../../utils/collection.js");
-
 var _factory = require("../../utils/factory.js");
 
 var _index = require("../../plain/number/index.js");
@@ -19,13 +17,14 @@ var createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       multiplyScalar = _ref.multiplyScalar,
       pow = _ref.pow,
       _BigNumber = _ref.BigNumber,
-      _Complex = _ref.Complex;
+      Complex = _ref.Complex;
 
   /**
    * Compute the gamma function of a value using Lanczos approximation for
    * small values, and an extended Stirling approximation for large values.
    *
-   * For matrices, the function is evaluated element wise.
+   * To avoid confusion with the matrix Gamma function, this function does
+   * not apply to matrices.
    *
    * Syntax:
    *
@@ -41,51 +40,53 @@ var createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
    *
    *    combinations, factorial, permutations
    *
-   * @param {number | Array | Matrix} n   A real or complex number
-   * @return {number | Array | Matrix}    The gamma of `n`
+   * @param {number | BigNumber | Complex} n   A real or complex number
+   * @return {number | BigNumber | Complex}    The gamma of `n`
    */
-  return typed(name, {
-    number: _index.gammaNumber,
-    Complex: function Complex(n) {
-      if (n.im === 0) {
-        return this(n.re);
-      } // Lanczos approximation doesn't work well with real part lower than 0.5
-      // So reflection formula is required
+  function gammaComplex(n) {
+    if (n.im === 0) {
+      return (0, _index.gammaNumber)(n.re);
+    } // Lanczos approximation doesn't work well with real part lower than 0.5
+    // So reflection formula is required
 
 
-      if (n.re < 0.5) {
-        // Euler's reflection formula
-        // gamma(1-z) * gamma(z) = PI / sin(PI * z)
-        // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
-        // thanks to imperfect sin implementation sin(PI * n) != 0
-        // we can safely use it anyway
-        var _t = new _Complex(1 - n.re, -n.im);
+    if (n.re < 0.5) {
+      // Euler's reflection formula
+      // gamma(1-z) * gamma(z) = PI / sin(PI * z)
+      // real part of Z should not be integer [sin(PI) == 0 -> 1/0 - undefined]
+      // thanks to imperfect sin implementation sin(PI * n) != 0
+      // we can safely use it anyway
+      var _t = new Complex(1 - n.re, -n.im);
 
-        var r = new _Complex(Math.PI * n.re, Math.PI * n.im);
-        return new _Complex(Math.PI).div(r.sin()).div(this(_t));
-      } // Lanczos approximation
-      // z -= 1
+      var r = new Complex(Math.PI * n.re, Math.PI * n.im);
+      return new Complex(Math.PI).div(r.sin()).div(gammaComplex(_t));
+    } // Lanczos approximation
+    // z -= 1
 
 
-      n = new _Complex(n.re - 1, n.im); // x = gammaPval[0]
+    n = new Complex(n.re - 1, n.im); // x = gammaPval[0]
 
-      var x = new _Complex(_index.gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
+    var x = new Complex(_index.gammaP[0], 0); // for (i, gammaPval) in enumerate(gammaP):
 
-      for (var i = 1; i < _index.gammaP.length; ++i) {
-        // x += gammaPval / (z + i)
-        var gammaPval = new _Complex(_index.gammaP[i], 0);
-        x = x.add(gammaPval.div(n.add(i)));
-      } // t = z + gammaG + 0.5
+    for (var i = 1; i < _index.gammaP.length; ++i) {
+      // x += gammaPval / (z + i)
+      var gammaPval = new Complex(_index.gammaP[i], 0);
+      x = x.add(gammaPval.div(n.add(i)));
+    } // t = z + gammaG + 0.5
 
 
-      var t = new _Complex(n.re + _index.gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
+    var t = new Complex(n.re + _index.gammaG + 0.5, n.im); // y = sqrt(2 * pi) * t ** (z + 0.5) * exp(-t) * x
 
-      var twoPiSqrt = Math.sqrt(2 * Math.PI);
-      var tpow = t.pow(n.add(0.5));
-      var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
+    var twoPiSqrt = Math.sqrt(2 * Math.PI);
+    var tpow = t.pow(n.add(0.5));
+    var expt = t.neg().exp(); // y = [x] * [sqrt(2 * pi)] * [t ** (z + 0.5)] * [exp(-t)]
 
-      return x.mul(twoPiSqrt).mul(tpow).mul(expt);
-    },
+    return x.mul(twoPiSqrt).mul(tpow).mul(expt);
+  }
+
+  return typed(name, {
+    number: _index.gammaNumber,
+    Complex: gammaComplex,
     BigNumber: function BigNumber(n) {
       if (n.isInteger()) {
         return n.isNegative() || n.isZero() ? new _BigNumber(Infinity) : bigFactorial(n.minus(1));
@@ -96,9 +97,6 @@ var createGamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       }
 
       throw new Error('Integer BigNumber expected');
-    },
-    'Array | Matrix': function ArrayMatrix(n) {
-      return (0, _collection.deepMap)(n, this);
     }
   });
   /**

package/lib/cjs/function/probability/kldivergence.js

@@ -8,13 +8,14 @@ exports.createKldivergence = void 0;
 var _factory = require("../../utils/factory.js");
 
 var name = 'kldivergence';
-var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'dotDivide', 'log', 'isNumeric'];
+var dependencies = ['typed', 'matrix', 'divide', 'sum', 'multiply', 'map', 'dotDivide', 'log', 'isNumeric'];
 var createKldivergence = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
       matrix = _ref.matrix,
       divide = _ref.divide,
       sum = _ref.sum,
       multiply = _ref.multiply,
+      map = _ref.map,
       dotDivide = _ref.dotDivide,
       log = _ref.log,
       isNumeric = _ref.isNumeric;
@@ -81,7 +82,9 @@ var createKldivergence = /* #__PURE__ */(0, _factory.factory)(name, dependencies
 
     var qnorm = divide(q, sum(q));
     var pnorm = divide(p, sum(p));
-    var result = sum(multiply(qnorm, log(dotDivide(qnorm, pnorm))));
+    var result = sum(multiply(qnorm, map(dotDivide(qnorm, pnorm), function (x) {
+      return log(x);
+    })));
 
     if (isNumeric(result)) {
       return result;

package/lib/cjs/function/probability/lgamma.js

@@ -19,7 +19,7 @@ var _number = require("../../utils/number.js");
 var name = 'lgamma';
 var dependencies = ['Complex', 'typed'];
 var createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
-  var _Complex = _ref.Complex,
+  var Complex = _ref.Complex,
       typed = _ref.typed;
   // Stirling series is non-convergent, we need to use the recurrence `lgamma(z) = lgamma(z+1) - log z` to get
   // sufficient accuracy.
@@ -65,38 +65,38 @@ var createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
 
   return typed(name, {
     number: _index.lgammaNumber,
-    Complex: function Complex(n) {
-      var TWOPI = 6.2831853071795864769252842; // 2*pi
-
-      var LOGPI = 1.1447298858494001741434262; // log(pi)
-
-      var REFLECTION = 0.1;
-
-      if (n.isNaN()) {
-        return new _Complex(NaN, NaN);
-      } else if (n.im === 0) {
-        return new _Complex((0, _index.lgammaNumber)(n.re), 0);
-      } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
-        return lgammaStirling(n);
-      } else if (n.re <= REFLECTION) {
-        // Reflection formula. see Proposition 3.1 in [1]
-        var tmp = (0, _number.copysign)(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25); // TODO: `complex.js sin` doesn't have extremely high precision, so this value `a` may lose a little precision,
-        // causing the computation results to be less accurate than the lgamma of real numbers
-
-        var a = n.mul(Math.PI).sin().log();
-        var b = this(new _Complex(1 - n.re, -n.im));
-        return new _Complex(LOGPI, tmp).sub(a).sub(b);
-      } else if (n.im >= 0) {
-        return lgammaRecurrence(n);
-      } else {
-        return lgammaRecurrence(n.conjugate()).conjugate();
-      }
-    },
+    Complex: lgammaComplex,
     BigNumber: function BigNumber() {
       throw new Error("mathjs doesn't yet provide an implementation of the algorithm lgamma for BigNumber");
     }
   });
 
+  function lgammaComplex(n) {
+    var TWOPI = 6.2831853071795864769252842; // 2*pi
+
+    var LOGPI = 1.1447298858494001741434262; // log(pi)
+
+    var REFLECTION = 0.1;
+
+    if (n.isNaN()) {
+      return new Complex(NaN, NaN);
+    } else if (n.im === 0) {
+      return new Complex((0, _index.lgammaNumber)(n.re), 0);
+    } else if (n.re >= SMALL_RE || Math.abs(n.im) >= SMALL_IM) {
+      return lgammaStirling(n);
+    } else if (n.re <= REFLECTION) {
+      // Reflection formula. see Proposition 3.1 in [1]
+      var tmp = (0, _number.copysign)(TWOPI, n.im) * Math.floor(0.5 * n.re + 0.25);
+      var a = n.mul(Math.PI).sin().log();
+      var b = lgammaComplex(new Complex(1 - n.re, -n.im));
+      return new Complex(LOGPI, tmp).sub(a).sub(b);
+    } else if (n.im >= 0) {
+      return lgammaRecurrence(n);
+    } else {
+      return lgammaRecurrence(n.conjugate()).conjugate();
+    }
+  }
+
   function lgammaStirling(z) {
     // formula ref in [2]
     // computation ref:
@@ -106,7 +106,7 @@ var createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
     // => (x - 0.5) * log(x) - x + log(2PI) / 2
     var leftPart = z.sub(0.5).mul(z.log()).sub(z).add(_index.lnSqrt2PI); // right part
 
-    var rz = new _Complex(1, 0).div(z);
+    var rz = new Complex(1, 0).div(z);
     var rzz = rz.div(z);
     var a = coeffs[0];
     var b = coeffs[1];
@@ -140,7 +140,7 @@ var createLgamma = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
       z = z.add(1);
     }
 
-    return lgammaStirling(z).sub(shiftprod.log()).sub(new _Complex(0, signflips * 2 * Math.PI * 1));
+    return lgammaStirling(z).sub(shiftprod.log()).sub(new Complex(0, signflips * 2 * Math.PI * 1));
   }
 });
 exports.createLgamma = createLgamma;

package/lib/cjs/function/probability/util/seededRNG.js

@@ -9,13 +9,13 @@ exports.createRng = createRng;
 
 var _seedrandom = _interopRequireDefault(require("seedrandom"));
 
-var singletonRandom = /* #__PURE__ */(0, _seedrandom.default)(Date.now());
+var singletonRandom = /* #__PURE__ */(0, _seedrandom["default"])(Date.now());
 
 function createRng(randomSeed) {
   var random; // create a new random generator with given seed
 
   function setSeed(seed) {
-    random = seed === null ? singletonRandom : (0, _seedrandom.default)(String(seed));
+    random = seed === null ? singletonRandom : (0, _seedrandom["default"])(String(seed));
   } // initialize a seeded pseudo random number generator with config's random seed