mathjs 11.2.0 → 11.3.0

package/lib/esm/function/relational/equalScalar.js

@@ -13,6 +13,7 @@ export var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref =
   var compareUnits = createCompareUnits({
     typed
   });
+
   /**
    * Test whether two scalar values are nearly equal.
    *
@@ -21,7 +22,6 @@ export var createEqualScalar = /* #__PURE__ */factory(name, dependencies, _ref =
    * @return {boolean}                                                  Returns true when the compared values are equal, else returns false
    * @private
    */
-
   return typed(name, {
     'boolean, boolean': function booleanBoolean(x, y) {
       return x === y;

package/lib/esm/function/relational/equalText.js

@@ -7,7 +7,6 @@ export var createEqualText = /* #__PURE__ */factory(name, dependencies, _ref =>
     compareText,
     isZero
   } = _ref;
-
   /**
    * Check equality of two strings. Comparison is case sensitive.
    *

package/lib/esm/function/relational/larger.js

@@ -33,6 +33,7 @@ export var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {
   var compareUnits = createCompareUnits({
     typed
   });
+
   /**
    * Test whether value x is larger than y.
    *
@@ -64,7 +65,6 @@ export var createLarger = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
    * @return {boolean | Array | Matrix} Returns true when the x is larger than y, else returns false
    */
-
   return typed(name, createLargerNumber({
     typed,
     config

package/lib/esm/function/relational/largerEq.js

@@ -33,6 +33,7 @@ export var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
   var compareUnits = createCompareUnits({
     typed
   });
+
   /**
    * Test whether value x is larger or equal to y.
    *
@@ -60,7 +61,6 @@ export var createLargerEq = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
    * @return {boolean | Array | Matrix} Returns true when the x is larger or equal to y, else returns false
    */
-
   return typed(name, createLargerEqNumber({
     typed,
     config

package/lib/esm/function/relational/smaller.js

@@ -33,6 +33,7 @@ export var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {
   var compareUnits = createCompareUnits({
     typed
   });
+
   /**
    * Test whether value x is smaller than y.
    *
@@ -64,7 +65,6 @@ export var createSmaller = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
    * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
    */
-
   return typed(name, createSmallerNumber({
     typed,
     config

package/lib/esm/function/relational/smallerEq.js

@@ -33,6 +33,7 @@ export var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref =>
   var compareUnits = createCompareUnits({
     typed
   });
+
   /**
    * Test whether value x is smaller or equal to y.
    *
@@ -60,7 +61,6 @@ export var createSmallerEq = /* #__PURE__ */factory(name, dependencies, _ref =>
    * @param  {number | BigNumber | Fraction | boolean | Unit | string | Array | Matrix} y Second value to compare
    * @return {boolean | Array | Matrix} Returns true when the x is smaller than y, else returns false
    */
-
   return typed(name, createSmallerEqNumber({
     typed,
     config

package/lib/esm/function/relational/unequal.js

@@ -28,6 +28,7 @@ export var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {
     typed,
     matrix
   });
+
   /**
    * Test whether two values are unequal.
    *
@@ -71,7 +72,6 @@ export var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @param  {number | BigNumber | Fraction | boolean | Complex | Unit | string | Array | Matrix | undefined} y Second value to compare
    * @return {boolean | Array | Matrix} Returns true when the compared values are unequal, else returns false
    */
-
   return typed(name, createUnequalNumber({
     typed,
     equalScalar
@@ -81,7 +81,6 @@ export var createUnequal = /* #__PURE__ */factory(name, dependencies, _ref => {
     DS: matAlgo03xDSf,
     Ss: matAlgo12xSfs
   }));
-
   function _unequal(x, y) {
     return !equalScalar(x, y);
   }
@@ -97,19 +96,15 @@ export var createUnequalNumber = factory(name, ['typed', 'equalScalar'], _ref2 =
       if (x === null) {
         return y !== null;
       }
-
       if (y === null) {
         return x !== null;
       }
-
       if (x === undefined) {
         return y !== undefined;
       }
-
       if (y === undefined) {
         return x !== undefined;
       }
-
       return !equalScalar(x, y);
     }
   });

package/lib/esm/function/set/setCartesian.js

@@ -11,7 +11,6 @@ export var createSetCartesian = /* #__PURE__ */factory(name, dependencies, _ref
     Index,
     DenseMatrix
   } = _ref;
-
   /**
    * Create the cartesian product of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays
@@ -37,26 +36,22 @@ export var createSetCartesian = /* #__PURE__ */factory(name, dependencies, _ref
   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) {
         // if any of them is empty, return empty
         var b1 = flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural);
         var b2 = 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++) {
             result.push([b1[i], b2[j]]);
           }
         }
-      } // return an array, if both inputs were arrays
-
-
+      }
+      // return an array, if both inputs were arrays
       if (Array.isArray(a1) && Array.isArray(a2)) {
         return result;
-      } // return a matrix otherwise
-
-
+      }
+      // return a matrix otherwise
       return new DenseMatrix(result);
     }
   });

package/lib/esm/function/set/setDifference.js

@@ -11,7 +11,6 @@ export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref
     Index,
     DenseMatrix
   } = _ref;
-
   /**
    * Create the difference of two (multi)sets: every element of set1, that is not the element of set2.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -36,7 +35,6 @@ export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref
   return typed(name, {
     'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(a1, a2) {
       var result;
-
       if (subset(size(a1), new Index(0)) === 0) {
         // empty-anything=empty
         result = [];
@@ -48,10 +46,8 @@ export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref
         var b2 = identify(flatten(Array.isArray(a2) ? a2 : a2.toArray()).sort(compareNatural));
         result = [];
         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
@@ -59,19 +55,16 @@ export var createSetDifference = /* #__PURE__ */factory(name, dependencies, _ref
               break;
             }
           }
-
           if (!inb2) {
             result.push(b1[i]);
           }
         }
-      } // return an array, if both inputs were arrays
-
-
+      }
+      // return an array, if both inputs were arrays
       if (Array.isArray(a1) && Array.isArray(a2)) {
         return generalize(result);
-      } // return a matrix otherwise
-
-
+      }
+      // return a matrix otherwise
       return new DenseMatrix(generalize(result));
     }
   });

package/lib/esm/function/set/setDistinct.js

@@ -11,7 +11,6 @@ export var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref =
     Index,
     DenseMatrix
   } = _ref;
-
   /**
    * Collect the distinct elements of a multiset.
    * A multi-dimension array will be converted to a single-dimension array before the operation.
@@ -34,7 +33,6 @@ export var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref =
   return typed(name, {
     'Array | Matrix': function ArrayMatrix(a) {
       var result;
-
       if (subset(size(a), new Index(0)) === 0) {
         // if empty, return empty
         result = [];
@@ -42,20 +40,17 @@ export var createSetDistinct = /* #__PURE__ */factory(name, dependencies, _ref =
         var b = flatten(Array.isArray(a) ? a : a.toArray()).sort(compareNatural);
         result = [];
         result.push(b[0]);
-
         for (var i = 1; i < b.length; i++) {
           if (compareNatural(b[i], b[i - 1]) !== 0) {
             result.push(b[i]);
           }
         }
-      } // return an array, if the input was an array
-
-
+      }
+      // return an array, if the input was an array
       if (Array.isArray(a)) {
         return result;
-      } // return a matrix otherwise
-
-
+      }
+      // return a matrix otherwise
       return new DenseMatrix(result);
     }
   });

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

@@ -11,7 +11,6 @@ export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref
     Index,
     DenseMatrix
   } = _ref;
-
   /**
    * Create the intersection of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -36,7 +35,6 @@ export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref
   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 = [];
@@ -44,7 +42,6 @@ export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref
         var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
         var b2 = identify(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) {
@@ -54,14 +51,12 @@ export var createSetIntersect = /* #__PURE__ */factory(name, dependencies, _ref
             }
           }
         }
-      } // return an array, if both inputs were arrays
-
-
+      }
+      // return an array, if both inputs were arrays
       if (Array.isArray(a1) && Array.isArray(a2)) {
         return generalize(result);
-      } // return a matrix otherwise
-
-
+      }
+      // return a matrix otherwise
       return new DenseMatrix(generalize(result));
     }
   });

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

@@ -10,7 +10,6 @@ export var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref =
     compareNatural,
     Index
   } = _ref;
-
   /**
    * 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.
@@ -41,14 +40,11 @@ export var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref =
         // anything is not a subset of empty
         return false;
       }
-
       var b1 = identify(flatten(Array.isArray(a1) ? a1 : a1.toArray()).sort(compareNatural));
       var b2 = identify(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
@@ -56,12 +52,10 @@ export var createSetIsSubset = /* #__PURE__ */factory(name, dependencies, _ref =
             break;
           }
         }
-
         if (inb2 === false) {
           return false;
         }
       }
-
       return true;
     }
   });

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

@@ -10,7 +10,6 @@ export var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, _r
     compareNatural,
     Index
   } = _ref;
-
   /**
    * Count the multiplicity of an element in a multiset.
    * A multi-dimension array will be converted to a single-dimension array before the operation.
@@ -38,16 +37,13 @@ export var createSetMultiplicity = /* #__PURE__ */factory(name, dependencies, _r
         // if empty, return 0
         return 0;
       }
-
       var b = 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/esm/function/set/setPowerset.js

@@ -10,7 +10,6 @@ export var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref =
     compareNatural,
     Index
   } = _ref;
-
   /**
    * 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.
@@ -36,37 +35,32 @@ export var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref =
         // if empty, return empty
         return [];
       }
-
       var b = 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) {
@@ -76,7 +70,6 @@ export var createSetPowerset = /* #__PURE__ */factory(name, dependencies, _ref =
         }
       }
     }
-
     return array;
   }
 });

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

@@ -7,7 +7,6 @@ export var createSetSize = /* #__PURE__ */factory(name, dependencies, _ref => {
     typed,
     compareNatural
   } = _ref;
-
   /**
    * 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.
@@ -39,13 +38,11 @@ export var createSetSize = /* #__PURE__ */factory(name, dependencies, _ref => {
       } else {
         var b = 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/esm/function/set/setSymDifference.js

@@ -11,7 +11,6 @@ export var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, _
     setDifference,
     Index
   } = _ref;
-
   /**
    * Create the symmetric difference of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -41,7 +40,6 @@ export var createSetSymDifference = /* #__PURE__ */factory(name, dependencies, _
       } else if (subset(size(a2), new Index(0)) === 0) {
         return flatten(a1);
       }
-
       var b1 = flatten(a1);
       var b2 = flatten(a2);
       return concat(setDifference(b1, b2), setDifference(b2, b1));

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

@@ -12,7 +12,6 @@ export var createSetUnion = /* #__PURE__ */factory(name, dependencies, _ref => {
     setSymDifference,
     Index
   } = _ref;
-
   /**
    * Create the union of two (multi)sets.
    * Multi-dimension arrays will be converted to single-dimension arrays before the operation.
@@ -42,7 +41,6 @@ export var createSetUnion = /* #__PURE__ */factory(name, dependencies, _ref => {
       } else if (subset(size(a2), new Index(0)) === 0) {
         return flatten(a1);
       }
-
       var b1 = flatten(a1);
       var b2 = flatten(a2);
       return concat(setSymDifference(b1, b2), setIntersect(b1, b2));

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

@@ -1,4 +1,5 @@
 /* eslint-disable no-loss-of-precision */
+
 import { deepMap } from '../../utils/collection.js';
 import { sign } from '../../utils/number.js';
 import { factory } from '../../utils/factory.js';
@@ -8,7 +9,6 @@ export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed
   } = _ref;
-
   /**
    * Compute the erf function of a value using a rational Chebyshev
    * approximations for different intervals of x.
@@ -36,45 +36,41 @@ export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
   return typed('name', {
     number: function number(x) {
       var y = Math.abs(x);
-
       if (y >= MAX_NUM) {
         return sign(x);
       }
-
       if (y <= THRESH) {
         return sign(x) * erf1(y);
       }
-
       if (y <= 4.0) {
         return sign(x) * (1 - erfc2(y));
       }
-
       return sign(x) * (1 - erfc3(y));
     },
-    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self)) // TODO: For complex numbers, use the approximation for the Faddeeva function
-    //  from "More Efficient Computation of the Complex Error Function" (AMS)
+    'Array | Matrix': typed.referToSelf(self => n => deepMap(n, self))
 
+    // 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:
@@ -82,23 +78,20 @@ export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
    * 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:
@@ -108,19 +101,15 @@ export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
    *    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;
@@ -128,36 +117,36 @@ export var createErf = /* #__PURE__ */factory(name, dependencies, _ref => {
     return Math.exp(-ysq * ysq) * Math.exp(-del) * result;
   }
 });
+
 /**
  * Upper bound for the first approximation interval, 0 <= x <= THRESH
  * @constant
  */
-
 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);