mathjs 8.1.0 → 12.2.1

package/lib/cjs/plain/number/arithmetic.js

@@ -5,222 +5,170 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.absNumber = absNumber;
 exports.addNumber = addNumber;
-exports.subtractNumber = subtractNumber;
-exports.multiplyNumber = multiplyNumber;
-exports.divideNumber = divideNumber;
-exports.unaryMinusNumber = unaryMinusNumber;
-exports.unaryPlusNumber = unaryPlusNumber;
 exports.cbrtNumber = cbrtNumber;
-exports.ceilNumber = ceilNumber;
 exports.cubeNumber = cubeNumber;
+exports.divideNumber = divideNumber;
 exports.expNumber = expNumber;
 exports.expm1Number = expm1Number;
-exports.fixNumber = fixNumber;
-exports.floorNumber = floorNumber;
 exports.gcdNumber = gcdNumber;
 exports.lcmNumber = lcmNumber;
-exports.logNumber = logNumber;
 exports.log10Number = log10Number;
-exports.log2Number = log2Number;
 exports.log1pNumber = log1pNumber;
+exports.log2Number = log2Number;
+exports.logNumber = logNumber;
 exports.modNumber = modNumber;
+exports.multiplyNumber = multiplyNumber;
+exports.normNumber = normNumber;
 exports.nthRootNumber = nthRootNumber;
+exports.powNumber = powNumber;
+exports.roundNumber = roundNumber;
 exports.signNumber = signNumber;
 exports.sqrtNumber = sqrtNumber;
 exports.squareNumber = squareNumber;
+exports.subtractNumber = subtractNumber;
+exports.unaryMinusNumber = unaryMinusNumber;
+exports.unaryPlusNumber = unaryPlusNumber;
 exports.xgcdNumber = xgcdNumber;
-exports.powNumber = powNumber;
-exports.roundNumber = roundNumber;
-exports.normNumber = normNumber;
-
 var _number = require("../../utils/number.js");
-
 var n1 = 'number';
 var n2 = 'number, number';
-
 function absNumber(a) {
   return Math.abs(a);
 }
-
 absNumber.signature = n1;
-
 function addNumber(a, b) {
   return a + b;
 }
-
 addNumber.signature = n2;
-
 function subtractNumber(a, b) {
   return a - b;
 }
-
 subtractNumber.signature = n2;
-
 function multiplyNumber(a, b) {
   return a * b;
 }
-
 multiplyNumber.signature = n2;
-
 function divideNumber(a, b) {
   return a / b;
 }
-
 divideNumber.signature = n2;
-
 function unaryMinusNumber(x) {
   return -x;
 }
-
 unaryMinusNumber.signature = n1;
-
 function unaryPlusNumber(x) {
   return x;
 }
-
 unaryPlusNumber.signature = n1;
-
 function cbrtNumber(x) {
   return (0, _number.cbrt)(x);
 }
-
 cbrtNumber.signature = n1;
-
-function ceilNumber(x) {
-  return Math.ceil(x);
-}
-
-ceilNumber.signature = n1;
-
 function cubeNumber(x) {
   return x * x * x;
 }
-
 cubeNumber.signature = n1;
-
 function expNumber(x) {
   return Math.exp(x);
 }
-
 expNumber.signature = n1;
-
 function expm1Number(x) {
   return (0, _number.expm1)(x);
 }
-
 expm1Number.signature = n1;
 
-function fixNumber(x) {
-  return x > 0 ? Math.floor(x) : Math.ceil(x);
-}
-
-fixNumber.signature = n1;
-
-function floorNumber(x) {
-  return Math.floor(x);
-}
-
-floorNumber.signature = n1;
 /**
  * Calculate gcd for numbers
  * @param {number} a
  * @param {number} b
  * @returns {number} Returns the greatest common denominator of a and b
  */
-
 function gcdNumber(a, b) {
   if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
     throw new Error('Parameters in function gcd must be integer numbers');
-  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
-
+  }
 
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
   var r;
-
   while (b !== 0) {
     r = a % b;
     a = b;
     b = r;
   }
-
   return a < 0 ? -a : a;
 }
-
 gcdNumber.signature = n2;
+
 /**
  * Calculate lcm for two numbers
  * @param {number} a
  * @param {number} b
  * @returns {number} Returns the least common multiple of a and b
  */
-
 function lcmNumber(a, b) {
   if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
     throw new Error('Parameters in function lcm must be integer numbers');
   }
-
   if (a === 0 || b === 0) {
     return 0;
-  } // https://en.wikipedia.org/wiki/Euclidean_algorithm
-  // evaluate lcm here inline to reduce overhead
-
+  }
 
+  // https://en.wikipedia.org/wiki/Euclidean_algorithm
+  // evaluate lcm here inline to reduce overhead
   var t;
   var prod = a * b;
-
   while (b !== 0) {
     t = b;
     b = a % t;
     a = t;
   }
-
   return Math.abs(prod / a);
 }
-
 lcmNumber.signature = n2;
+
 /**
- * Calculate the logarithm of a value.
+ * Calculate the logarithm of a value, optionally to a given base.
  * @param {number} x
+ * @param {number | null | undefined} base
  * @return {number}
  */
-
-function logNumber(x) {
+function logNumber(x, y) {
+  if (y) {
+    return Math.log(x) / Math.log(y);
+  }
   return Math.log(x);
 }
 
-logNumber.signature = n1;
 /**
  * Calculate the 10-base logarithm of a number
  * @param {number} x
  * @return {number}
  */
-
 function log10Number(x) {
   return (0, _number.log10)(x);
 }
-
 log10Number.signature = n1;
+
 /**
  * Calculate the 2-base logarithm of a number
  * @param {number} x
  * @return {number}
  */
-
 function log2Number(x) {
   return (0, _number.log2)(x);
 }
-
 log2Number.signature = n1;
+
 /**
  * Calculate the natural logarithm of a `number+1`
  * @param {number} x
  * @returns {number}
  */
-
 function log1pNumber(x) {
   return (0, _number.log1p)(x);
 }
-
 log1pNumber.signature = n1;
+
 /**
  * Calculate the modulus of two numbers
  * @param {number} x
@@ -228,63 +176,50 @@ log1pNumber.signature = n1;
  * @returns {number} res
  * @private
  */
-
 function modNumber(x, y) {
-  if (y > 0) {
-    // We don't use JavaScript's % operator here as this doesn't work
-    // correctly for x < 0 and x === 0
-    // see https://en.wikipedia.org/wiki/Modulo_operation
-    return x - y * Math.floor(x / y);
-  } else if (y === 0) {
-    return x;
-  } else {
-    // y < 0
-    // TODO: implement mod for a negative divisor
-    throw new Error('Cannot calculate mod for a negative divisor');
-  }
+  // We don't use JavaScript's % operator here as this doesn't work
+  // correctly for x < 0 and x === 0
+  // see https://en.wikipedia.org/wiki/Modulo_operation
+  return y === 0 ? x : x - y * Math.floor(x / y);
 }
-
 modNumber.signature = n2;
+
 /**
  * Calculate the nth root of a, solve x^root == a
  * http://rosettacode.org/wiki/Nth_root#JavaScript
  * @param {number} a
- * @param {number} root
+ * @param {number} [2] root
  * @private
  */
-
-function nthRootNumber(a, root) {
+function nthRootNumber(a) {
+  var root = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 2;
   var inv = root < 0;
-
   if (inv) {
     root = -root;
   }
-
   if (root === 0) {
     throw new Error('Root must be non-zero');
   }
-
   if (a < 0 && Math.abs(root) % 2 !== 1) {
     throw new Error('Root must be odd when a is negative.');
-  } // edge cases zero and infinity
-
+  }
 
+  // edge cases zero and infinity
   if (a === 0) {
     return inv ? Infinity : 0;
   }
-
   if (!isFinite(a)) {
     return inv ? 0 : a;
   }
-
-  var x = Math.pow(Math.abs(a), 1 / root); // If a < 0, we require that root is an odd integer,
+  var x = Math.pow(Math.abs(a), 1 / root);
+  // If a < 0, we require that root is an odd integer,
   // so (-1) ^ (1/root) = -1
-
   x = a < 0 ? -x : x;
-  return inv ? 1 / x : x; // Very nice algorithm, but fails with nthRoot(-2, 3).
+  return inv ? 1 / x : x;
+
+  // Very nice algorithm, but fails with nthRoot(-2, 3).
   // Newton's method has some well-known problems at times:
   // https://en.wikipedia.org/wiki/Newton%27s_method#Failure_analysis
-
   /*
   let x = 1 // Initial guess
   let xPrev = 1
@@ -303,26 +238,19 @@ function nthRootNumber(a, root) {
    return inv ? 1 / x : x
   */
 }
-
-nthRootNumber.signature = n2;
-
 function signNumber(x) {
   return (0, _number.sign)(x);
 }
-
 signNumber.signature = n1;
-
 function sqrtNumber(x) {
   return Math.sqrt(x);
 }
-
 sqrtNumber.signature = n1;
-
 function squareNumber(x) {
   return x * x;
 }
-
 squareNumber.signature = n1;
+
 /**
  * Calculate xgcd for two numbers
  * @param {number} a
@@ -330,24 +258,18 @@ squareNumber.signature = n1;
  * @return {number} result
  * @private
  */
-
 function xgcdNumber(a, b) {
   // source: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
   var t; // used to swap two variables
-
   var q; // quotient
-
   var r; // remainder
-
   var x = 0;
   var lastx = 1;
   var y = 1;
   var lasty = 0;
-
   if (!(0, _number.isInteger)(a) || !(0, _number.isInteger)(b)) {
     throw new Error('Parameters in function xgcd must be integer numbers');
   }
-
   while (b) {
     q = Math.floor(a / b);
     r = a - q * b;
@@ -360,37 +282,32 @@ function xgcdNumber(a, b) {
     a = b;
     b = r;
   }
-
   var res;
-
   if (a < 0) {
     res = [-a, -lastx, -lasty];
   } else {
     res = [a, a ? lastx : 0, lasty];
   }
-
   return res;
 }
-
 xgcdNumber.signature = n2;
+
 /**
  * Calculates the power of x to y, x^y, for two numbers.
  * @param {number} x
  * @param {number} y
  * @return {number} res
  */
-
 function powNumber(x, y) {
   // x^Infinity === 0 if -1 < x < 1
   // A real number 0 is returned instead of complex(0)
   if (x * x < 1 && y === Infinity || x * x > 1 && y === -Infinity) {
     return 0;
   }
-
   return Math.pow(x, y);
 }
-
 powNumber.signature = n2;
+
 /**
  * round a number to the given number of decimals, or to zero if decimals is
  * not provided
@@ -398,21 +315,20 @@ powNumber.signature = n2;
  * @param {number} decimals       number of decimals, between 0 and 15 (0 by default)
  * @return {number} roundedValue
  */
-
 function roundNumber(value) {
   var decimals = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  if (!(0, _number.isInteger)(decimals) || decimals < 0 || decimals > 15) {
+    throw new Error('Number of decimals in function round must be an integer from 0 to 15 inclusive');
+  }
   return parseFloat((0, _number.toFixed)(value, decimals));
 }
 
-roundNumber.signature = n2;
 /**
  * Calculate the norm of a number, the absolute value.
  * @param {number} x
  * @return {number}
  */
-
 function normNumber(x) {
   return Math.abs(x);
 }
-
 normNumber.signature = n1;

package/lib/cjs/plain/number/bitwise.js

@@ -10,78 +10,55 @@ exports.bitXorNumber = bitXorNumber;
 exports.leftShiftNumber = leftShiftNumber;
 exports.rightArithShiftNumber = rightArithShiftNumber;
 exports.rightLogShiftNumber = rightLogShiftNumber;
-
 var _number = require("../../utils/number.js");
-
 var n1 = 'number';
 var n2 = 'number, number';
-
 function bitAndNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function bitAnd');
   }
-
   return x & y;
 }
-
 bitAndNumber.signature = n2;
-
 function bitNotNumber(x) {
   if (!(0, _number.isInteger)(x)) {
     throw new Error('Integer expected in function bitNot');
   }
-
   return ~x;
 }
-
 bitNotNumber.signature = n1;
-
 function bitOrNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function bitOr');
   }
-
   return x | y;
 }
-
 bitOrNumber.signature = n2;
-
 function bitXorNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function bitXor');
   }
-
   return x ^ y;
 }
-
 bitXorNumber.signature = n2;
-
 function leftShiftNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function leftShift');
   }
-
   return x << y;
 }
-
 leftShiftNumber.signature = n2;
-
 function rightArithShiftNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function rightArithShift');
   }
-
   return x >> y;
 }
-
 rightArithShiftNumber.signature = n2;
-
 function rightLogShiftNumber(x, y) {
   if (!(0, _number.isInteger)(x) || !(0, _number.isInteger)(y)) {
     throw new Error('Integers expected in function rightLogShift');
   }
-
   return x >>> y;
 }
-
 rightLogShiftNumber.signature = n2;

package/lib/cjs/plain/number/combinations.js

@@ -4,34 +4,36 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.combinationsNumber = combinationsNumber;
-
 var _number = require("../../utils/number.js");
-
 var _product = require("../../utils/product.js");
-
 function combinationsNumber(n, k) {
   if (!(0, _number.isInteger)(n) || n < 0) {
     throw new TypeError('Positive integer value expected in function combinations');
   }
-
   if (!(0, _number.isInteger)(k) || k < 0) {
     throw new TypeError('Positive integer value expected in function combinations');
   }
-
   if (k > n) {
     throw new TypeError('k must be less than or equal to n');
   }
-
   var nMinusk = n - k;
-  var prodrange;
-
-  if (k < nMinusk) {
-    prodrange = (0, _product.product)(nMinusk + 1, n);
-    return prodrange / (0, _product.product)(1, k);
+  var answer = 1;
+  var firstnumerator = k < nMinusk ? nMinusk + 1 : k + 1;
+  var nextdivisor = 2;
+  var lastdivisor = k < nMinusk ? k : nMinusk;
+  // balance multiplications and divisions to try to keep intermediate values
+  // in exact-integer range as long as possible
+  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
   }
-
-  prodrange = (0, _product.product)(k + 1, n);
-  return prodrange / (0, _product.product)(1, nMinusk);
+  // for big n, k, floating point may have caused weirdness in remainder
+  if (nextdivisor <= lastdivisor) {
+    answer /= (0, _product.product)(nextdivisor, lastdivisor);
+  }
+  return answer;
 }
-
 combinationsNumber.signature = 'number, number';

package/lib/cjs/plain/number/constants.js

@@ -3,13 +3,8 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-exports.phi = exports.e = exports.tau = exports.pi = void 0;
-var pi = Math.PI;
-exports.pi = pi;
-var tau = 2 * Math.PI;
-exports.tau = tau;
-var e = Math.E;
-exports.e = e;
-var phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision
-
-exports.phi = phi;
+exports.tau = exports.pi = exports.phi = exports.e = void 0;
+var pi = exports.pi = Math.PI;
+var tau = exports.tau = 2 * Math.PI;
+var e = exports.e = Math.E;
+var phi = exports.phi = 1.6180339887498948; // eslint-disable-line no-loss-of-precision

package/lib/cjs/plain/number/index.js

@@ -3,9 +3,7 @@
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
-
 var _arithmetic = require("./arithmetic.js");
-
 Object.keys(_arithmetic).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _arithmetic[key]) return;
@@ -16,9 +14,7 @@ Object.keys(_arithmetic).forEach(function (key) {
     }
   });
 });
-
 var _bitwise = require("./bitwise.js");
-
 Object.keys(_bitwise).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _bitwise[key]) return;
@@ -29,9 +25,7 @@ Object.keys(_bitwise).forEach(function (key) {
     }
   });
 });
-
 var _combinations = require("./combinations.js");
-
 Object.keys(_combinations).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _combinations[key]) return;
@@ -42,9 +36,7 @@ Object.keys(_combinations).forEach(function (key) {
     }
   });
 });
-
 var _constants = require("./constants.js");
-
 Object.keys(_constants).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _constants[key]) return;
@@ -55,9 +47,7 @@ Object.keys(_constants).forEach(function (key) {
     }
   });
 });
-
 var _logical = require("./logical.js");
-
 Object.keys(_logical).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _logical[key]) return;
@@ -68,9 +58,7 @@ Object.keys(_logical).forEach(function (key) {
     }
   });
 });
-
 var _relational = require("./relational.js");
-
 Object.keys(_relational).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _relational[key]) return;
@@ -81,9 +69,7 @@ Object.keys(_relational).forEach(function (key) {
     }
   });
 });
-
 var _probability = require("./probability.js");
-
 Object.keys(_probability).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _probability[key]) return;
@@ -94,9 +80,7 @@ Object.keys(_probability).forEach(function (key) {
     }
   });
 });
-
 var _trigonometry = require("./trigonometry.js");
-
 Object.keys(_trigonometry).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _trigonometry[key]) return;
@@ -107,9 +91,7 @@ Object.keys(_trigonometry).forEach(function (key) {
     }
   });
 });
-
 var _utils = require("./utils.js");
-
 Object.keys(_utils).forEach(function (key) {
   if (key === "default" || key === "__esModule") return;
   if (key in exports && exports[key] === _utils[key]) return;