mathjs 11.2.1 → 11.3.0

package/lib/cjs/function/set/setIntersect.js

@@ -4,21 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetIntersect = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setIntersect';
 var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index', 'DenseMatrix'];
 var createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      subset = _ref.subset,
-      compareNatural = _ref.compareNatural,
-      Index = _ref.Index,
-      DenseMatrix = _ref.DenseMatrix;
-
+    size = _ref.size,
+    subset = _ref.subset,
+    compareNatural = _ref.compareNatural,
+    Index = _ref.Index,
+    DenseMatrix = _ref.DenseMatrix;
   /**
    * Create the intersection of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -43,7 +39,6 @@ var createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies
   return typed(name, {
     'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
       var result;
-
       if (subset(size(a1), new Index(0)) === 0 || subset(size(a2), new Index(0)) === 0) {
         // of any of them is empty, return empty
         result = [];
@@ -51,7 +46,6 @@ var createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies
         var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
         var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
         result = [];
-
         for (var i = 0; i < b1.length; i++) {
           for (var j = 0; j < b2.length; j++) {
             if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
@@ -61,14 +55,12 @@ var createSetIntersect = /* #__PURE__ */(0, _factory.factory)(name, dependencies
             }
           }
         }
-      } // return an array, if both inputs were arrays
-
-
+      }
+      // return an array, if both inputs were arrays
       if (Array.isArray(a1) && Array.isArray(a2)) {
         return (0, _array.generalize)(result);
-      } // return a matrix otherwise
-
-
+      }
+      // return a matrix otherwise
       return new DenseMatrix((0, _array.generalize)(result));
     }
   });

package/lib/cjs/function/set/setIsSubset.js

@@ -4,20 +4,16 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetIsSubset = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setIsSubset';
 var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
 var createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      subset = _ref.subset,
-      compareNatural = _ref.compareNatural,
-      Index = _ref.Index;
-
+    size = _ref.size,
+    subset = _ref.subset,
+    compareNatural = _ref.compareNatural,
+    Index = _ref.Index;
   /**
    * Check whether a (multi)set is a subset of another (multi)set. (Every element of set1 is the element of set2.)
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -48,14 +44,11 @@ var createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
         // anything is not a subset of empty
         return false;
       }
-
       var b1 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
       var b2 = (0, _array.identify)((0, _array.flatten)(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
       var inb2;
-
       for (var i = 0; i < b1.length; i++) {
         inb2 = false;
-
         for (var j = 0; j < b2.length; j++) {
           if (compareNatural(b1[i].value, b2[j].value) === 0 && b1[i].identifier === b2[j].identifier) {
             // the identifier is always a decimal int
@@ -63,12 +56,10 @@ var createSetIsSubset = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
             break;
           }
         }
-
         if (inb2 === false) {
           return false;
         }
       }
-
       return true;
     }
   });

package/lib/cjs/function/set/setMultiplicity.js

@@ -4,20 +4,16 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetMultiplicity = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setMultiplicity';
 var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
 var createSetMultiplicity = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      subset = _ref.subset,
-      compareNatural = _ref.compareNatural,
-      Index = _ref.Index;
-
+    size = _ref.size,
+    subset = _ref.subset,
+    compareNatural = _ref.compareNatural,
+    Index = _ref.Index;
   /**
    * Count the multiplicity of an element in a multiset.
    * A multi-dimension array will be converted to a single-dimension array before the operation.
@@ -45,16 +41,13 @@ var createSetMultiplicity = /* #__PURE__ */(0, _factory.factory)(name, dependenc
         // if empty, return 0
         return 0;
       }
-
       var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray());
       var count = 0;
-
       for (var i = 0; i < b.length; i++) {
         if (compareNatural(b[i], e) === 0) {
           count++;
         }
       }
-
       return count;
     }
   });

package/lib/cjs/function/set/setPowerset.js

@@ -4,20 +4,16 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetPowerset = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setPowerset';
 var dependencies = ['typed', 'size', 'subset', 'compareNatural', 'Index'];
 var createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      subset = _ref.subset,
-      compareNatural = _ref.compareNatural,
-      Index = _ref.Index;
-
+    size = _ref.size,
+    subset = _ref.subset,
+    compareNatural = _ref.compareNatural,
+    Index = _ref.Index;
   /**
    * Create the powerset of a (multi)set. (The powerset contains very possible subsets of a (multi)set.)
    * A multi-dimension array will be converted to a single-dimension array before the operation.
@@ -43,37 +39,32 @@ var createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
         // if empty, return empty
         return [];
       }
-
       var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
       var result = [];
       var number = 0;
-
       while (number.toString(2).length <= b.length) {
         result.push(_subset(b, number.toString(2).split('').reverse()));
         number++;
-      } // can not return a matrix, because of the different size of the subarrays
-
-
+      }
+      // can not return a matrix, because of the different size of the subarrays
       return _sort(result);
     }
-  }); // create subset
+  });
 
+  // create subset
   function _subset(array, bitarray) {
     var result = [];
-
     for (var i = 0; i < bitarray.length; i++) {
       if (bitarray[i] === '1') {
         result.push(array[i]);
       }
     }
-
     return result;
-  } // sort subsests by length
-
+  }
 
+  // sort subsests by length
   function _sort(array) {
     var temp = [];
-
     for (var i = array.length - 1; i > 0; i--) {
       for (var j = 0; j < i; j++) {
         if (array[j].length > array[j + 1].length) {
@@ -83,7 +74,6 @@ var createSetPowerset = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
         }
       }
     }
-
     return array;
   }
 });

package/lib/cjs/function/set/setSize.js

@@ -4,17 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetSize = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setSize';
 var dependencies = ['typed', 'compareNatural'];
 var createSetSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      compareNatural = _ref.compareNatural;
-
+    compareNatural = _ref.compareNatural;
   /**
    * Count the number of elements of a (multi)set. When a second parameter is 'true', count only the unique values.
    * A multi-dimension array will be converted to a single-dimension array before the operation.
@@ -46,13 +42,11 @@ var createSetSize = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fun
       } else {
         var b = (0, _array.flatten)(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
         var count = 1;
-
         for (var i = 1; i < b.length; i++) {
           if (compareNatural(b[i], b[i - 1]) !== 0) {
             count++;
           }
         }
-
         return count;
       }
     }

package/lib/cjs/function/set/setSymDifference.js

@@ -4,21 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetSymDifference = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setSymDifference';
 var dependencies = ['typed', 'size', 'concat', 'subset', 'setDifference', 'Index'];
 var createSetSymDifference = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      concat = _ref.concat,
-      subset = _ref.subset,
-      setDifference = _ref.setDifference,
-      Index = _ref.Index;
-
+    size = _ref.size,
+    concat = _ref.concat,
+    subset = _ref.subset,
+    setDifference = _ref.setDifference,
+    Index = _ref.Index;
   /**
    * Create the symmetric difference of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -48,7 +44,6 @@ var createSetSymDifference = /* #__PURE__ */(0, _factory.factory)(name, dependen
       } else if (subset(size(a2), new Index(0)) === 0) {
         return (0, _array.flatten)(a1);
       }
-
       var b1 = (0, _array.flatten)(a1);
       var b2 = (0, _array.flatten)(a2);
       return concat(setDifference(b1, b2), setDifference(b2, b1));

package/lib/cjs/function/set/setUnion.js

@@ -4,22 +4,18 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createSetUnion = void 0;
-
 var _array = require("../../utils/array.js");
-
 var _factory = require("../../utils/factory.js");
-
 var name = 'setUnion';
 var dependencies = ['typed', 'size', 'concat', 'subset', 'setIntersect', 'setSymDifference', 'Index'];
 var createSetUnion = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      size = _ref.size,
-      concat = _ref.concat,
-      subset = _ref.subset,
-      setIntersect = _ref.setIntersect,
-      setSymDifference = _ref.setSymDifference,
-      Index = _ref.Index;
-
+    size = _ref.size,
+    concat = _ref.concat,
+    subset = _ref.subset,
+    setIntersect = _ref.setIntersect,
+    setSymDifference = _ref.setSymDifference,
+    Index = _ref.Index;
   /**
    * Create the union of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -49,7 +45,6 @@ var createSetUnion = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       } else if (subset(size(a2), new Index(0)) === 0) {
         return (0, _array.flatten)(a1);
       }
-
       var b1 = (0, _array.flatten)(a1);
       var b2 = (0, _array.flatten)(a2);
       return concat(setSymDifference(b1, b2), setIntersect(b1, b2));

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

@@ -4,19 +4,15 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createErf = void 0;
-
 var _collection = require("../../utils/collection.js");
-
 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 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
-
   /**
    * Compute the erf function of a value using a rational Chebyshev
    * approximations for different intervals of x.
@@ -44,49 +40,45 @@ var createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
   return typed('name', {
     number: function number(x) {
       var y = Math.abs(x);
-
       if (y >= MAX_NUM) {
         return (0, _number.sign)(x);
       }
-
       if (y <= THRESH) {
         return (0, _number.sign)(x) * erf1(y);
       }
-
       if (y <= 4.0) {
         return (0, _number.sign)(x) * (1 - erfc2(y));
       }
-
       return (0, _number.sign)(x) * (1 - erfc3(y));
     },
     'Array | Matrix': typed.referToSelf(function (self) {
       return function (n) {
         return (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)
+    })
 
+    // TODO: For complex numbers, use the approximation for the Faddeeva function
+    //  from "More Efficient Computation of the Complex Error Function" (AMS)
   });
+
   /**
    * Approximates the error function erf() for x <= 0.46875 using this function:
    *               n
    * erf(x) = x * sum (p_j * x^(2j)) / (q_j * x^(2j))
    *              j=0
    */
-
   function erf1(y) {
     var ysq = y * y;
     var xnum = P[0][4] * ysq;
     var xden = ysq;
     var i;
-
     for (i = 0; i < 3; i += 1) {
       xnum = (xnum + P[0][i]) * ysq;
       xden = (xden + Q[0][i]) * ysq;
     }
-
     return y * (xnum + P[0][3]) / (xden + Q[0][3]);
   }
+
   /**
    * Approximates the complement of the error function erfc() for
    * 0.46875 <= x <= 4.0 using this function:
@@ -94,23 +86,20 @@ var createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    * erfc(x) = e^(-x^2) * sum (p_j * x^j) / (q_j * x^j)
    *                      j=0
    */
-
-
   function erfc2(y) {
     var xnum = P[1][8] * y;
     var xden = y;
     var 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);
     return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
   }
+
   /**
    * Approximates the complement of the error function erfc() for x > 4.0 using
    * this function:
@@ -120,19 +109,15 @@ var createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
    *    1/(x^2) * sum (p_j * x^(-2j)) / (q_j * x^(-2j)) ]
    *              j=0
    */
-
-
   function erfc3(y) {
     var ysq = 1 / (y * y);
     var xnum = P[2][5] * ysq;
     var xden = ysq;
     var 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]);
     result = (SQRPI - result) / y;
     ysq = parseInt(y * 16) / 16;
@@ -140,37 +125,37 @@ var createErf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
     return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
   }
 });
+
 /**
  * Upper bound for the first approximation interval, 0 <= x <= THRESH
  * @constant
  */
-
 exports.createErf = createErf;
 var THRESH = 0.46875;
+
 /**
  * Constant used by W. J. Cody's Fortran77 implementation to denote sqrt(pi)
  * @constant
  */
-
 var 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]];
+
 /**
  * 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]];
+
 /**
  * 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);

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

@@ -4,26 +4,18 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.createCumSum = void 0;
-
 var _collection = require("../../utils/collection.js");
-
 var _factory = require("../../utils/factory.js");
-
 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 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      add = _ref.add,
-      unaryPlus = _ref.unaryPlus;
-
+    add = _ref.add,
+    unaryPlus = _ref.unaryPlus;
   /**
    * Compute the cumulative sum of a matrix or a list with values.
    * In case of a (multi dimensional) array or matrix, the cumulative sums
@@ -66,17 +58,16 @@ var createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
       if ((0, _collection.containsCollections)(args)) {
         throw new TypeError('All values expected to be scalar in function cumsum');
       }
-
       return _cumsum(args);
     }
   });
+
   /**
      * Recursively calculate the cumulative sum of an n-dimensional array
      * @param {Array} array
      * @return {number} cumsum
      * @private
      */
-
   function _cumsum(array) {
     try {
       return _cumsummap(array);
@@ -84,66 +75,52 @@ var createCumSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
       throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
     }
   }
-
   function _cumsummap(array) {
     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) {
       // 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).
       sums.push(add(sums[i - 1], array[i]));
     }
-
     return sums;
   }
-
   function _ncumSumDim(array, dim) {
     var 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);
     }
-
     try {
       return _cumsumDimensional(array, dim);
     } catch (err) {
       throw (0, _improveErrorMessage.improveErrorMessage)(err, name);
     }
   }
-  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
-
 
+  /* Possible TODO: Refactor _reduce in collection.js to be able to work here as well */
   function _cumsumDimensional(mat, dim) {
     var i, ret, tran;
-
     if (dim <= 0) {
       var initialValue = mat[0][0];
-
       if (!Array.isArray(initialValue)) {
         return _cumsummap(mat);
       } else {
         tran = (0, _switch2._switch)(mat);
         ret = [];
-
         for (i = 0; i < tran.length; i++) {
           ret[i] = _cumsumDimensional(tran[i], dim - 1);
         }
-
         return ret;
       }
     } else {
       ret = [];
-
       for (i = 0; i < mat.length; i++) {
         ret[i] = _cumsumDimensional(mat[i], dim - 1);
       }
-
       return ret;
     }
   }

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

@@ -4,22 +4,17 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 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 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
-      abs = _ref.abs,
-      map = _ref.map,
-      median = _ref.median,
-      subtract = _ref.subtract;
-
+    abs = _ref.abs,
+    map = _ref.map,
+    median = _ref.median,
+    subtract = _ref.subtract;
   /**
    * 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
@@ -52,14 +47,11 @@ var createMad = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       return _mad(args);
     }
   });
-
   function _mad(array) {
     array = (0, _array.flatten)(array.valueOf());
-
     if (array.length === 0) {
       throw new Error('Cannot calculate median absolute deviation (mad) of an empty array');
     }
-
     try {
       var med = median(array);
       return median(map(array, function (value) {