mathjs 11.2.1 → 11.3.1

package/lib/esm/function/statistics/quantileSeq.js

@@ -12,7 +12,6 @@ export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref =
     partitionSelect,
     compare
   } = _ref;
-
   /**
    * Compute the prob order quantile of a matrix or a list with values.
    * The sequence is sorted and the middle value is returned.
@@ -49,98 +48,75 @@ export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref =
    */
   function quantileSeq(data, probOrN, sorted) {
     var probArr, dataArr, one;
-
     if (arguments.length < 2 || arguments.length > 3) {
       throw new SyntaxError('Function quantileSeq requires two or three parameters');
     }
-
     if (isCollection(data)) {
       sorted = sorted || false;
-
       if (typeof sorted === 'boolean') {
         dataArr = data.valueOf();
-
         if (isNumber(probOrN)) {
           if (probOrN < 0) {
             throw new Error('N/prob must be non-negative');
           }
-
           if (probOrN <= 1) {
             // quantileSeq([a, b, c, d, ...], prob[,sorted])
             return _quantileSeq(dataArr, probOrN, sorted);
           }
-
           if (probOrN > 1) {
             // quantileSeq([a, b, c, d, ...], N[,sorted])
             if (!isInteger(probOrN)) {
               throw new Error('N must be a positive integer');
             }
-
             var nPlusOne = probOrN + 1;
             probArr = new Array(probOrN);
-
             for (var i = 0; i < probOrN;) {
               probArr[i] = _quantileSeq(dataArr, ++i / nPlusOne, sorted);
             }
-
             return probArr;
           }
         }
-
         if (isBigNumber(probOrN)) {
           var BigNumber = probOrN.constructor;
-
           if (probOrN.isNegative()) {
             throw new Error('N/prob must be non-negative');
           }
-
           one = new BigNumber(1);
-
           if (probOrN.lte(one)) {
             // quantileSeq([a, b, c, d, ...], prob[,sorted])
             return new BigNumber(_quantileSeq(dataArr, probOrN, sorted));
           }
-
           if (probOrN.gt(one)) {
             // quantileSeq([a, b, c, d, ...], N[,sorted])
             if (!probOrN.isInteger()) {
               throw new Error('N must be a positive integer');
-            } // largest possible Array length is 2^32-1
-            // 2^32 < 10^15, thus safe conversion guaranteed
-
+            }
 
+            // largest possible Array length is 2^32-1
+            // 2^32 < 10^15, thus safe conversion guaranteed
             var intN = probOrN.toNumber();
-
             if (intN > 4294967295) {
               throw new Error('N must be less than or equal to 2^32-1, as that is the maximum length of an Array');
             }
-
             var _nPlusOne = new BigNumber(intN + 1);
-
             probArr = new Array(intN);
-
             for (var _i = 0; _i < intN;) {
               probArr[_i] = new BigNumber(_quantileSeq(dataArr, new BigNumber(++_i).div(_nPlusOne), sorted));
             }
-
             return probArr;
           }
         }
-
         if (Array.isArray(probOrN)) {
           // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
           probArr = new Array(probOrN.length);
-
           for (var _i2 = 0; _i2 < probArr.length; ++_i2) {
             var currProb = probOrN[_i2];
-
             if (isNumber(currProb)) {
               if (currProb < 0 || currProb > 1) {
                 throw new Error('Probability must be between 0 and 1, inclusive');
               }
             } else if (isBigNumber(currProb)) {
               one = new currProb.constructor(1);
-
               if (currProb.isNegative() || currProb.gt(one)) {
                 throw new Error('Probability must be between 0 and 1, inclusive');
               }
@@ -150,10 +126,8 @@ export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref =
 
             probArr[_i2] = _quantileSeq(dataArr, currProb, sorted);
           }
-
           return probArr;
         }
-
         throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
       }
 
@@ -162,6 +136,7 @@ export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref =
 
     throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
   }
+
   /**
    * Calculate the prob order quantile of an n-dimensional array.
    *
@@ -171,101 +146,85 @@ export var createQuantileSeq = /* #__PURE__ */factory(name, dependencies, _ref =
    * @return {Number, BigNumber, Unit} prob order quantile
    * @private
    */
-
-
   function _quantileSeq(array, prob, sorted) {
     var flat = flatten(array);
     var len = flat.length;
-
     if (len === 0) {
       throw new Error('Cannot calculate quantile of an empty sequence');
     }
-
     if (isNumber(prob)) {
       var _index = prob * (len - 1);
-
       var _fracPart = _index % 1;
-
       if (_fracPart === 0) {
         var value = sorted ? flat[_index] : partitionSelect(flat, _index);
         validate(value);
         return value;
       }
-
       var _integerPart = Math.floor(_index);
-
       var _left;
-
       var _right;
-
       if (sorted) {
         _left = flat[_integerPart];
         _right = flat[_integerPart + 1];
       } else {
-        _right = partitionSelect(flat, _integerPart + 1); // max of partition is kth largest
+        _right = partitionSelect(flat, _integerPart + 1);
 
+        // max of partition is kth largest
         _left = flat[_integerPart];
-
         for (var i = 0; i < _integerPart; ++i) {
           if (compare(flat[i], _left) > 0) {
             _left = flat[i];
           }
         }
       }
-
       validate(_left);
-      validate(_right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+      validate(_right);
 
+      // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
       return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));
-    } // If prob is a BigNumber
-
+    }
 
+    // If prob is a BigNumber
     var index = prob.times(len - 1);
-
     if (index.isInteger()) {
       index = index.toNumber();
-
       var _value = sorted ? flat[index] : partitionSelect(flat, index);
-
       validate(_value);
       return _value;
     }
-
     var integerPart = index.floor();
     var fracPart = index.minus(integerPart);
     var integerPartNumber = integerPart.toNumber();
     var left;
     var right;
-
     if (sorted) {
       left = flat[integerPartNumber];
       right = flat[integerPartNumber + 1];
     } else {
-      right = partitionSelect(flat, integerPartNumber + 1); // max of partition is kth largest
+      right = partitionSelect(flat, integerPartNumber + 1);
 
+      // max of partition is kth largest
       left = flat[integerPartNumber];
-
       for (var _i3 = 0; _i3 < integerPartNumber; ++_i3) {
         if (compare(flat[_i3], left) > 0) {
           left = flat[_i3];
         }
       }
     }
-
     validate(left);
-    validate(right); // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
+    validate(right);
 
+    // Q(prob) = (1-f)*A[floor(index)] + f*A[floor(index)+1]
     var one = new fracPart.constructor(1);
     return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));
   }
+
   /**
    * Check if array value types are valid, throw error otherwise.
    * @param {number | BigNumber | Unit} x
    * @param {number | BigNumber | Unit} x
    * @private
    */
-
-
   var validate = typed({
     'number | BigNumber | Unit': function numberBigNumberUnit(x) {
       return x;

package/lib/esm/function/statistics/std.js

@@ -9,7 +9,6 @@ export var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {
     sqrt,
     variance
   } = _ref;
-
   /**
    * Compute the standard deviation of a matrix or a  list with values.
    * The standard deviations is defined as the square root of the variance:
@@ -76,15 +75,12 @@ export var createStd = /* #__PURE__ */factory(name, dependencies, _ref => {
       return _std(args);
     }
   });
-
   function _std(array, normalization) {
     if (array.length === 0) {
       throw new SyntaxError('Function std requires one or more parameters (0 provided)');
     }
-
     try {
       var v = variance.apply(null, arguments);
-
       if (isCollection(v)) {
         return map(v, sqrt);
       } else {

package/lib/esm/function/statistics/sum.js

@@ -10,7 +10,6 @@ export var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {
     add,
     numeric
   } = _ref;
-
   /**
    * Compute the sum of a matrix or a list with values.
    * In case of a (multi dimensional) array or matrix, the sum of all
@@ -44,17 +43,16 @@ export var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {
       if (containsCollections(args)) {
         throw new TypeError('Scalar values expected in function sum');
       }
-
       return _sum(args);
     }
   });
+
   /**
    * Recursively calculate the sum of an n-dimensional array
    * @param {Array | Matrix} array
    * @return {number} sum
    * @private
    */
-
   function _sum(array) {
     var sum;
     deepForEach(array, function (value) {
@@ -63,19 +61,17 @@ export var createSum = /* #__PURE__ */factory(name, dependencies, _ref => {
       } catch (err) {
         throw improveErrorMessage(err, 'sum', value);
       }
-    }); // make sure returning numeric value: parse a string into a numeric value
+    });
 
+    // make sure returning numeric value: parse a string into a numeric value
     if (sum === undefined) {
       sum = numeric(0, config.number);
     }
-
     if (typeof sum === 'string') {
       sum = numeric(sum, config.number);
     }
-
     return sum;
   }
-
   function _nsumDim(array, dim) {
     try {
       var sum = reduce(array, dim, add);

package/lib/esm/function/statistics/utils/improveErrorMessage.js

@@ -1,4 +1,5 @@
 import { typeOf } from '../../../utils/is.js';
+
 /**
  * Improve error messages for statistics functions. Errors are typically
  * thrown in an internally used function like larger, causing the error
@@ -9,20 +10,16 @@ import { typeOf } from '../../../utils/is.js';
  * @param {*} [value]
  * @return {Error}
  */
-
 export function improveErrorMessage(err, fnName, value) {
   // TODO: add information with the index (also needs transform in expression parser)
   var details;
-
   if (String(err).indexOf('Unexpected type') !== -1) {
     details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : ' (type: ' + err.data.actual + ')';
     return new TypeError('Cannot calculate ' + fnName + ', unexpected type of argument' + details);
   }
-
   if (String(err).indexOf('complex numbers') !== -1) {
     details = arguments.length > 2 ? ' (type: ' + typeOf(value) + ', value: ' + JSON.stringify(value) + ')' : '';
     return new TypeError('Cannot calculate ' + fnName + ', no ordering relation is defined for complex numbers' + details);
   }
-
   return err;
 }

package/lib/esm/function/statistics/variance.js

@@ -15,7 +15,6 @@ export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
     apply,
     isNaN
   } = _ref;
-
   /**
    * Compute the variance of a matrix or a  list with values.
    * In case of a (multi dimensional) array or matrix, the variance over all
@@ -87,6 +86,7 @@ export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
       return _var(args, DEFAULT_NORMALIZATION);
     }
   });
+
   /**
    * Recursively calculate the variance of an n-dimensional array
    * @param {Array} array
@@ -98,16 +98,14 @@ export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
    * @return {number | BigNumber} variance
    * @private
    */
-
   function _var(array, normalization) {
     var sum;
     var num = 0;
-
     if (array.length === 0) {
       throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
-    } // calculate the mean and number of elements
-
+    }
 
+    // calculate the mean and number of elements
     deepForEach(array, function (value) {
       try {
         sum = sum === undefined ? value : add(sum, value);
@@ -117,42 +115,36 @@ export var createVariance = /* #__PURE__ */factory(name, dependencies, _ref => {
       }
     });
     if (num === 0) throw new Error('Cannot calculate variance of an empty array');
-    var mean = divide(sum, num); // calculate the variance
+    var mean = divide(sum, num);
 
+    // calculate the variance
     sum = undefined;
     deepForEach(array, function (value) {
       var diff = subtract(value, mean);
       sum = sum === undefined ? multiply(diff, diff) : add(sum, multiply(diff, diff));
     });
-
     if (isNaN(sum)) {
       return sum;
     }
-
     switch (normalization) {
       case 'uncorrected':
         return divide(sum, num);
-
       case 'biased':
         return divide(sum, num + 1);
-
       case 'unbiased':
         {
           var zero = isBigNumber(sum) ? sum.mul(0) : 0;
           return num === 1 ? zero : divide(sum, num - 1);
         }
-
       default:
         throw new Error('Unknown normalization "' + normalization + '". ' + 'Choose "unbiased" (default), "uncorrected", or "biased".');
     }
   }
-
   function _varDim(array, dim, normalization) {
     try {
       if (array.length === 0) {
         throw new SyntaxError('Function variance requires one or more parameters (0 provided)');
       }
-
       return apply(array, dim, x => _var(x, normalization));
     } catch (err) {
       throw improveErrorMessage(err, 'variance');

package/lib/esm/function/string/bin.js

@@ -1,6 +1,7 @@
 import { factory } from '../../utils/factory.js';
 var name = 'bin';
 var dependencies = ['typed', 'format'];
+
 /**
  * Format a number as binary.
  *
@@ -22,7 +23,6 @@ var dependencies = ['typed', 'format'];
  * @param {number} wordSize Optional word size (see `format`)
  * @return {string}         The formatted value
  */
-
 export var createBin = factory(name, dependencies, _ref => {
   var {
     typed,

package/lib/esm/function/string/format.js

@@ -6,7 +6,6 @@ export var createFormat = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed
   } = _ref;
-
   /**
    * Format a value of any type into a string.
    *

package/lib/esm/function/string/hex.js

@@ -1,6 +1,7 @@
 import { factory } from '../../utils/factory.js';
 var name = 'hex';
 var dependencies = ['typed', 'format'];
+
 /**
  * Format a number as hexadecimal.
  *
@@ -21,7 +22,6 @@ var dependencies = ['typed', 'format'];
  * @param {number} wordSize Optional word size (see `format`)
  * @return {string}         The formatted value
  */
-
 export var createHex = factory(name, dependencies, _ref => {
   var {
     typed,

package/lib/esm/function/string/oct.js

@@ -1,6 +1,7 @@
 import { factory } from '../../utils/factory.js';
 var name = 'oct';
 var dependencies = ['typed', 'format'];
+
 /**
  * Format a number as octal.
  *

package/lib/esm/function/string/print.js

@@ -7,7 +7,6 @@ export var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed
   } = _ref;
-
   /**
    * Interpolate values into a string template.
    *
@@ -58,6 +57,7 @@ export var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {
     'string, Object | Array, number | Object': _print
   });
 });
+
 /**
  * Interpolate values into a string template.
  * @param {string} template
@@ -66,17 +66,14 @@ export var createPrint = /* #__PURE__ */factory(name, dependencies, _ref => {
  * @returns {string} Interpolated string
  * @private
  */
-
 function _print(template, values, options) {
   return template.replace(/\$([\w.]+)/g, function (original, key) {
     var keys = key.split('.');
     var value = values[keys.shift()];
-
     while (keys.length && value !== undefined) {
       var k = keys.shift();
       value = k ? value[k] : value + '.';
     }
-
     if (value !== undefined) {
       if (!isString(value)) {
         return format(value, options);
@@ -84,7 +81,6 @@ function _print(template, values, options) {
         return value;
       }
     }
-
     return original;
   });
 }

package/lib/esm/function/trigonometry/acos.js

@@ -7,7 +7,6 @@ export var createAcos = /* #__PURE__ */factory(name, dependencies, _ref => {
     config,
     Complex
   } = _ref;
-
   /**
    * Calculate the inverse cosine of a value.
    *

package/lib/esm/function/trigonometry/acosh.js

@@ -8,7 +8,6 @@ export var createAcosh = /* #__PURE__ */factory(name, dependencies, _ref => {
     config,
     Complex
   } = _ref;
-
   /**
    * Calculate the hyperbolic arccos of a value,
    * defined as `acosh(x) = ln(sqrt(x^2 - 1) + x)`.
@@ -35,11 +34,9 @@ export var createAcosh = /* #__PURE__ */factory(name, dependencies, _ref => {
       if (x >= 1 || config.predictable) {
         return acoshNumber(x);
       }
-
       if (x <= -1) {
         return new Complex(Math.log(Math.sqrt(x * x - 1) - x), Math.PI);
       }
-
       return new Complex(x, 0).acosh();
     },
     Complex: function Complex(x) {

package/lib/esm/function/trigonometry/acot.js

@@ -7,7 +7,6 @@ export var createAcot = /* #__PURE__ */factory(name, dependencies, _ref => {
     typed,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the inverse cotangent of a value, defined as `acot(x) = atan(1/x)`.
    *

package/lib/esm/function/trigonometry/acoth.js

@@ -9,7 +9,6 @@ export var createAcoth = /* #__PURE__ */factory(name, dependencies, _ref => {
     Complex,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the hyperbolic arccotangent of a value,
    * defined as `acoth(x) = atanh(1/x) = (ln((x+1)/x) + ln(x/(x-1))) / 2`.
@@ -37,7 +36,6 @@ export var createAcoth = /* #__PURE__ */factory(name, dependencies, _ref => {
       if (x >= 1 || x <= -1 || config.predictable) {
         return acothNumber(x);
       }
-
       return new Complex(x, 0).acoth();
     },
     Complex: function Complex(x) {

package/lib/esm/function/trigonometry/acsc.js

@@ -9,7 +9,6 @@ export var createAcsc = /* #__PURE__ */factory(name, dependencies, _ref => {
     Complex,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the inverse cosecant of a value, defined as `acsc(x) = asin(1/x)`.
    *
@@ -38,7 +37,6 @@ export var createAcsc = /* #__PURE__ */factory(name, dependencies, _ref => {
       if (x <= -1 || x >= 1 || config.predictable) {
         return acscNumber(x);
       }
-
       return new Complex(x, 0).acsc();
     },
     Complex: function Complex(x) {

package/lib/esm/function/trigonometry/acsch.js

@@ -7,7 +7,6 @@ export var createAcsch = /* #__PURE__ */factory(name, dependencies, _ref => {
     typed,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the hyperbolic arccosecant of a value,
    * defined as `acsch(x) = asinh(1/x) = ln(1/x + sqrt(1/x^2 + 1))`.

package/lib/esm/function/trigonometry/asec.js

@@ -9,7 +9,6 @@ export var createAsec = /* #__PURE__ */factory(name, dependencies, _ref => {
     Complex,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the inverse secant of a value. Defined as `asec(x) = acos(1/x)`.
    *
@@ -39,7 +38,6 @@ export var createAsec = /* #__PURE__ */factory(name, dependencies, _ref => {
       if (x <= -1 || x >= 1 || config.predictable) {
         return asecNumber(x);
       }
-
       return new Complex(x, 0).asec();
     },
     Complex: function Complex(x) {

package/lib/esm/function/trigonometry/asech.js

@@ -9,7 +9,6 @@ export var createAsech = /* #__PURE__ */factory(name, dependencies, _ref => {
     Complex,
     BigNumber: _BigNumber
   } = _ref;
-
   /**
    * Calculate the hyperbolic arcsecant of a value,
    * defined as `asech(x) = acosh(1/x) = ln(sqrt(1/x^2 - 1) + 1/x)`.
@@ -36,15 +35,12 @@ export var createAsech = /* #__PURE__ */factory(name, dependencies, _ref => {
     number: function number(x) {
       if (x <= 1 && x >= -1 || config.predictable) {
         var xInv = 1 / x;
-
         if (xInv > 0 || config.predictable) {
           return asechNumber(x);
         }
-
         var ret = Math.sqrt(xInv * xInv - 1);
         return new Complex(Math.log(ret - xInv), Math.PI);
       }
-
       return new Complex(x, 0).asech();
     },
     Complex: function Complex(x) {

package/lib/esm/function/trigonometry/asin.js

@@ -7,7 +7,6 @@ export var createAsin = /* #__PURE__ */factory(name, dependencies, _ref => {
     config,
     Complex
   } = _ref;
-
   /**
    * Calculate the inverse sine of a value.
    *

package/lib/esm/function/trigonometry/asinh.js

@@ -6,7 +6,6 @@ export var createAsinh = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed
   } = _ref;
-
   /**
    * Calculate the hyperbolic arcsine of a value,
    * defined as `asinh(x) = ln(x + sqrt(x^2 + 1))`.

package/lib/esm/function/trigonometry/atan.js

@@ -5,7 +5,6 @@ export var createAtan = /* #__PURE__ */factory(name, dependencies, _ref => {
   var {
     typed
   } = _ref;
-
   /**
    * Calculate the inverse tangent of a value.
    *