mathjs 11.11.0 → 11.11.2

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

@@ -9,14 +9,25 @@ var _array = require("../../utils/array.js");
 var _factory = require("../../utils/factory.js");
 var _apply = require("../matrix/apply.js");
 var name = 'quantileSeq';
-var dependencies = ['typed', 'add', 'multiply', 'partitionSelect', 'compare', 'isInteger'];
-var createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var dependencies = ['typed', '?bignumber', 'add', 'subtract', 'divide', 'multiply', 'partitionSelect', 'compare', 'isInteger', 'smaller', 'smallerEq', 'larger'];
+var createQuantileSeq = exports.createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
+    bignumber = _ref.bignumber,
     add = _ref.add,
+    subtract = _ref.subtract,
+    divide = _ref.divide,
     multiply = _ref.multiply,
     partitionSelect = _ref.partitionSelect,
     compare = _ref.compare,
-    isInteger = _ref.isInteger;
+    isInteger = _ref.isInteger,
+    smaller = _ref.smaller,
+    smallerEq = _ref.smallerEq,
+    larger = _ref.larger;
+  var apply = (0, _apply.createApply)({
+    typed: typed,
+    isInteger: isInteger
+  });
+
   /**
    * Compute the prob order quantile of a matrix or a list with values.
    * The sequence is sorted and the middle value is returned.
@@ -51,130 +62,83 @@ var createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
    * @param {Boolean} sorted=false              is data sorted in ascending order
    * @return {Number, BigNumber, Unit, Array}   Quantile(s)
    */
-
-  var apply = (0, _apply.createApply)({
-    typed: typed,
-    isInteger: isInteger
-  });
-  /**
-   * 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;
-    }
-  });
   return typed(name, {
-    'Array|Matrix, number|BigNumber|Array': function ArrayMatrixNumberBigNumberArray(data, prob) {
-      return quantileSeq(data, prob, false);
+    'Array | Matrix, number | BigNumber': function ArrayMatrixNumberBigNumber(data, p) {
+      return _quantileSeqProbNumber(data, p, false);
+    },
+    'Array | Matrix, number | BigNumber, number': function ArrayMatrixNumberBigNumberNumber(data, prob, dim) {
+      return _quantileSeqDim(data, prob, false, dim, _quantileSeqProbNumber);
+    },
+    'Array | Matrix, number | BigNumber, boolean': _quantileSeqProbNumber,
+    'Array | Matrix, number | BigNumber, boolean, number': function ArrayMatrixNumberBigNumberBooleanNumber(data, prob, sorted, dim) {
+      return _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbNumber);
+    },
+    'Array | Matrix, Array | Matrix': function ArrayMatrixArrayMatrix(data, p) {
+      return _quantileSeqProbCollection(data, p, false);
     },
-    'Array|Matrix, number|BigNumber|Array, boolean': quantileSeq,
-    'Array|Matrix, number|BigNumber|Array, number': function ArrayMatrixNumberBigNumberArrayNumber(data, prob, dim) {
-      return _quantileSeqDim(data, prob, false, dim);
+    'Array | Matrix, Array | Matrix, number': function ArrayMatrixArrayMatrixNumber(data, prob, dim) {
+      return _quantileSeqDim(data, prob, false, dim, _quantileSeqProbCollection);
     },
-    'Array|Matrix, number|BigNumber|Array, boolean, number': function ArrayMatrixNumberBigNumberArrayBooleanNumber(data, prob, sorted, dim) {
-      return _quantileSeqDim(data, prob, sorted, dim);
+    'Array | Matrix, Array | Matrix, boolean': _quantileSeqProbCollection,
+    'Array | Matrix, Array | Matrix, boolean, number': function ArrayMatrixArrayMatrixBooleanNumber(data, prob, sorted, dim) {
+      return _quantileSeqDim(data, prob, sorted, dim, _quantileSeqProbCollection);
     }
   });
-  function _quantileSeqDim(data, prob, sorted, dim) {
-    // return [1.3, 1.2]
+  function _quantileSeqDim(data, prob, sorted, dim, fn) {
     return apply(data, dim, function (x) {
-      return quantileSeq(x, prob, sorted);
+      return fn(x, prob, sorted);
     });
   }
-  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');
+  function _quantileSeqProbNumber(data, probOrN, sorted) {
+    var probArr;
+    var dataArr = data.valueOf();
+    if (smaller(probOrN, 0)) {
+      throw new Error('N/prob must be non-negative');
     }
-    if ((0, _is.isCollection)(data)) {
-      sorted = sorted || false;
-      if (typeof sorted === 'boolean') {
-        dataArr = data.valueOf();
-        if ((0, _is.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 ((0, _is.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
-            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 ((0, _is.isCollection)(probOrN)) {
-          // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
-          var probOrNArr = probOrN.valueOf();
-          probArr = new Array(probOrNArr.length);
-          for (var _i2 = 0; _i2 < probArr.length; ++_i2) {
-            var currProb = probOrNArr[_i2];
-            if ((0, _is.isNumber)(currProb)) {
-              if (currProb < 0 || currProb > 1) {
-                throw new Error('Probability must be between 0 and 1, inclusive');
-              }
-            } else if ((0, _is.isBigNumber)(currProb)) {
-              one = new currProb.constructor(1);
-              if (currProb.isNegative() || currProb.gt(one)) {
-                throw new Error('Probability must be between 0 and 1, inclusive');
-              }
-            } else {
-              throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
-            }
-
-            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
+    if (smallerEq(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], prob[,sorted])
+      return (0, _is.isNumber)(probOrN) ? _quantileSeq(dataArr, probOrN, sorted) : bignumber(_quantileSeq(dataArr, probOrN, sorted));
+    }
+    if (larger(probOrN, 1)) {
+      // quantileSeq([a, b, c, d, ...], N[,sorted])
+      if (!isInteger(probOrN)) {
+        throw new Error('N must be a positive integer');
       }
 
-      throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+      // largest possible Array length is 2^32-1
+      // 2^32 < 10^15, thus safe conversion guaranteed
+      if (larger(probOrN, 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 = add(probOrN, 1);
+      probArr = [];
+      for (var i = 0; smaller(i, probOrN); i++) {
+        var prob = divide(i + 1, nPlusOne);
+        probArr.push(_quantileSeq(dataArr, prob, sorted));
+      }
+      return (0, _is.isNumber)(probOrN) ? probArr : bignumber(probArr);
     }
+  }
+
+  /**
+   * Calculate the prob order quantile of an n-dimensional array.
+   *
+   * @param {Array, Matrix} array
+   * @param {Array, Matrix} prob
+   * @param {Boolean} sorted
+   * @return {Number, BigNumber, Unit} prob order quantile
+   * @private
+   */
 
-    throw new TypeError('Unexpected type of argument in function quantileSeq'); // FIXME: becomes redundant when converted to typed-function
+  function _quantileSeqProbCollection(data, probOrN, sorted) {
+    var dataArr = data.valueOf();
+    // quantileSeq([a, b, c, d, ...], [prob1, prob2, ...][,sorted])
+    var probOrNArr = probOrN.valueOf();
+    var probArr = [];
+    for (var i = 0; i < probOrNArr.length; ++i) {
+      probArr.push(_quantileSeq(dataArr, probOrNArr[i], sorted));
+    }
+    return probArr;
   }
 
   /**
@@ -192,71 +156,29 @@ var createQuantileSeq = /* #__PURE__ */(0, _factory.factory)(name, dependencies,
     if (len === 0) {
       throw new Error('Cannot calculate quantile of an empty sequence');
     }
-    if ((0, _is.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
-        _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]
-      return add(multiply(_left, 1 - _fracPart), multiply(_right, _fracPart));
-    }
-
-    // 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 index = (0, _is.isNumber)(prob) ? prob * (len - 1) : prob.times(len - 1);
+    var integerPart = (0, _is.isNumber)(prob) ? Math.floor(index) : index.floor().toNumber();
+    var fracPart = (0, _is.isNumber)(prob) ? index % 1 : index.minus(integerPart);
+    if (isInteger(index)) {
+      return sorted ? flat[index] : partitionSelect(flat, (0, _is.isNumber)(prob) ? index : index.valueOf());
     }
-    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];
+      left = flat[integerPart];
+      right = flat[integerPart + 1];
     } else {
-      right = partitionSelect(flat, integerPartNumber + 1);
+      right = partitionSelect(flat, integerPart + 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];
+      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]
-    var one = new fracPart.constructor(1);
-    return add(multiply(left, one.minus(fracPart)), multiply(right, fracPart));
+    return add(multiply(left, subtract(1, fracPart)), multiply(right, fracPart));
   }
-});
-exports.createQuantileSeq = createQuantileSeq;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _is = require("../../utils/is.js");
 var name = 'std';
 var dependencies = ['typed', 'map', 'sqrt', 'variance'];
-var createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createStd = exports.createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     map = _ref.map,
     sqrt = _ref.sqrt,
@@ -98,5 +98,4 @@ var createStd = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       }
     }
   }
-});
-exports.createStd = createStd;
+});

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

@@ -9,7 +9,7 @@ var _factory = require("../../utils/factory.js");
 var _improveErrorMessage = require("./utils/improveErrorMessage.js");
 var name = 'sum';
 var dependencies = ['typed', 'config', 'add', 'numeric'];
-var createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createSum = exports.createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     add = _ref.add,
@@ -85,5 +85,4 @@ var createSum = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functio
       throw (0, _improveErrorMessage.improveErrorMessage)(err, 'sum');
     }
   }
-});
-exports.createSum = createSum;
+});

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

@@ -11,7 +11,7 @@ var _improveErrorMessage = require("./utils/improveErrorMessage.js");
 var DEFAULT_NORMALIZATION = 'unbiased';
 var name = 'variance';
 var dependencies = ['typed', 'add', 'subtract', 'multiply', 'divide', 'apply', 'isNaN'];
-var createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createVariance = exports.createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     add = _ref.add,
     subtract = _ref.subtract,
@@ -156,5 +156,4 @@ var createVariance = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       throw (0, _improveErrorMessage.improveErrorMessage)(err, 'variance');
     }
   }
-});
-exports.createVariance = createVariance;
+});

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

@@ -29,7 +29,7 @@ var dependencies = ['typed', 'format'];
  * @param {number} wordSize Optional word size (see `format`)
  * @return {string}         The formatted value
  */
-var createBin = (0, _factory.factory)(name, dependencies, function (_ref) {
+var createBin = exports.createBin = (0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     format = _ref.format;
   return typed(name, {
@@ -45,5 +45,4 @@ var createBin = (0, _factory.factory)(name, dependencies, function (_ref) {
       });
     }
   });
-});
-exports.createBin = createBin;
+});

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

@@ -8,7 +8,7 @@ var _string = require("../../utils/string.js");
 var _factory = require("../../utils/factory.js");
 var name = 'format';
 var dependencies = ['typed'];
-var createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createFormat = exports.createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
   /**
    * Format a value of any type into a string.
@@ -132,5 +132,4 @@ var createFormat = /* #__PURE__ */(0, _factory.factory)(name, dependencies, func
     any: _string.format,
     'any, Object | function | number': _string.format
   });
-});
-exports.createFormat = createFormat;
+});

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

@@ -28,7 +28,7 @@ var dependencies = ['typed', 'format'];
  * @param {number} wordSize Optional word size (see `format`)
  * @return {string}         The formatted value
  */
-var createHex = (0, _factory.factory)(name, dependencies, function (_ref) {
+var createHex = exports.createHex = (0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     format = _ref.format;
   return typed(name, {
@@ -44,5 +44,4 @@ var createHex = (0, _factory.factory)(name, dependencies, function (_ref) {
       });
     }
   });
-});
-exports.createHex = createHex;
+});

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

@@ -30,7 +30,7 @@ var dependencies = ['typed', 'format'];
  * @return {string}         The formatted value
  */
 
-var createOct = (0, _factory.factory)(name, dependencies, function (_ref) {
+var createOct = exports.createOct = (0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     format = _ref.format;
   return typed(name, {
@@ -46,5 +46,4 @@ var createOct = (0, _factory.factory)(name, dependencies, function (_ref) {
       });
     }
   });
-});
-exports.createOct = createOct;
+});

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

@@ -7,9 +7,10 @@ exports.createPrint = void 0;
 var _string = require("../../utils/string.js");
 var _is = require("../../utils/is.js");
 var _factory = require("../../utils/factory.js");
+var _print2 = require("../../utils/print.js");
 var name = 'print';
 var dependencies = ['typed'];
-var createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createPrint = exports.createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
   /**
    * Interpolate values into a string template.
@@ -70,11 +71,13 @@ var createPrint = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
  * @returns {string} Interpolated string
  * @private
  */
-exports.createPrint = createPrint;
 function _print(template, values, options) {
-  return template.replace(/\$([\w.]+)/g, function (original, key) {
+  return template.replace(_print2.printTemplate, function (original, key) {
     var keys = key.split('.');
     var value = values[keys.shift()];
+    if (value !== undefined && value.isMatrix) {
+      value = value.toArray();
+    }
     while (keys.length && value !== undefined) {
       var k = keys.shift();
       value = k ? value[k] : value + '.';

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

@@ -7,7 +7,7 @@ exports.createAcos = void 0;
 var _factory = require("../../utils/factory.js");
 var name = 'acos';
 var dependencies = ['typed', 'config', 'Complex'];
-var createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcos = exports.createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex;
@@ -50,5 +50,4 @@ var createAcos = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return x.acos();
     }
   });
-});
-exports.createAcos = createAcos;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'acosh';
 var dependencies = ['typed', 'config', 'Complex'];
-var createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcosh = exports.createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex;
@@ -50,5 +50,4 @@ var createAcosh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return x.acosh();
     }
   });
-});
-exports.createAcosh = createAcosh;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'acot';
 var dependencies = ['typed', 'BigNumber'];
-var createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcot = exports.createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     _BigNumber = _ref.BigNumber;
   /**
@@ -43,5 +43,4 @@ var createAcot = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return new _BigNumber(1).div(x).atan();
     }
   });
-});
-exports.createAcot = createAcot;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'acoth';
 var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
-var createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcoth = exports.createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex,
@@ -49,5 +49,4 @@ var createAcoth = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return new _BigNumber(1).div(x).atanh();
     }
   });
-});
-exports.createAcoth = createAcoth;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'acsc';
 var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
-var createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcsc = exports.createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex,
@@ -50,5 +50,4 @@ var createAcsc = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return new _BigNumber(1).div(x).asin();
     }
   });
-});
-exports.createAcsc = createAcsc;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'acsch';
 var dependencies = ['typed', 'BigNumber'];
-var createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAcsch = exports.createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     _BigNumber = _ref.BigNumber;
   /**
@@ -42,5 +42,4 @@ var createAcsch = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return new _BigNumber(1).div(x).asinh();
     }
   });
-});
-exports.createAcsch = createAcsch;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'asec';
 var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
-var createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAsec = exports.createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex,
@@ -51,5 +51,4 @@ var createAsec = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return new _BigNumber(1).div(x).acos();
     }
   });
-});
-exports.createAsec = createAsec;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'asech';
 var dependencies = ['typed', 'config', 'Complex', 'BigNumber'];
-var createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAsech = exports.createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex,
@@ -54,5 +54,4 @@ var createAsech = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return new _BigNumber(1).div(x).acosh();
     }
   });
-});
-exports.createAsech = createAsech;
+});

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

@@ -7,7 +7,7 @@ exports.createAsin = void 0;
 var _factory = require("../../utils/factory.js");
 var name = 'asin';
 var dependencies = ['typed', 'config', 'Complex'];
-var createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAsin = exports.createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     config = _ref.config,
     Complex = _ref.Complex;
@@ -50,5 +50,4 @@ var createAsin = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return x.asin();
     }
   });
-});
-exports.createAsin = createAsin;
+});

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

@@ -8,7 +8,7 @@ var _factory = require("../../utils/factory.js");
 var _index = require("../../plain/number/index.js");
 var name = 'asinh';
 var dependencies = ['typed'];
-var createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAsinh = exports.createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
   /**
    * Calculate the hyperbolic arcsine of a value,
@@ -41,5 +41,4 @@ var createAsinh = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       return x.asinh();
     }
   });
-});
-exports.createAsinh = createAsinh;
+});

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

@@ -7,7 +7,7 @@ exports.createAtan = void 0;
 var _factory = require("../../utils/factory.js");
 var name = 'atan';
 var dependencies = ['typed'];
-var createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAtan = exports.createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed;
   /**
    * Calculate the inverse tangent of a value.
@@ -43,5 +43,4 @@ var createAtan = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       return x.atan();
     }
   });
-});
-exports.createAtan = createAtan;
+});

package/lib/cjs/function/trigonometry/atan2.js

@@ -13,7 +13,7 @@ var _matAlgo12xSfs = require("../../type/matrix/utils/matAlgo12xSfs.js");
 var _matrixAlgorithmSuite = require("../../type/matrix/utils/matrixAlgorithmSuite.js");
 var name = 'atan2';
 var dependencies = ['typed', 'matrix', 'equalScalar', 'BigNumber', 'DenseMatrix', 'concat'];
-var createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+var createAtan2 = exports.createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var typed = _ref.typed,
     matrix = _ref.matrix,
     equalScalar = _ref.equalScalar,
@@ -92,5 +92,4 @@ var createAtan2 = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
     Ss: matAlgo11xS0s,
     sS: matAlgo12xSfs
   }));
-});
-exports.createAtan2 = createAtan2;
+});