mathjs 10.0.2 → 10.2.0

package/lib/cjs/function/algebra/{simplify/simplifyCore.js → simplifyCore.js}

@@ -5,12 +5,14 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.createSimplifyCore = void 0;
 
-var _is = require("../../../utils/is.js");
+var _is = require("../../utils/is.js");
 
-var _factory = require("../../../utils/factory.js");
+var _util = require("./simplify/util.js");
+
+var _factory = require("../../utils/factory.js");
 
 var name = 'simplifyCore';
-var dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'ConstantNode', 'OperatorNode', 'FunctionNode', 'ParenthesisNode'];
+var dependencies = ['equal', 'isZero', 'add', 'subtract', 'multiply', 'divide', 'pow', 'AccessorNode', 'ArrayNode', 'ConstantNode', 'FunctionNode', 'IndexNode', 'ObjectNode', 'OperatorNode', 'ParenthesisNode', 'SymbolNode'];
 var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
   var equal = _ref.equal,
       isZero = _ref.isZero,
@@ -19,12 +21,25 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
       multiply = _ref.multiply,
       divide = _ref.divide,
       pow = _ref.pow,
+      AccessorNode = _ref.AccessorNode,
+      ArrayNode = _ref.ArrayNode,
       ConstantNode = _ref.ConstantNode,
-      OperatorNode = _ref.OperatorNode,
       FunctionNode = _ref.FunctionNode,
-      ParenthesisNode = _ref.ParenthesisNode;
+      IndexNode = _ref.IndexNode,
+      ObjectNode = _ref.ObjectNode,
+      OperatorNode = _ref.OperatorNode,
+      ParenthesisNode = _ref.ParenthesisNode,
+      SymbolNode = _ref.SymbolNode;
   var node0 = new ConstantNode(0);
   var node1 = new ConstantNode(1);
+
+  var _createUtil = (0, _util.createUtil)({
+    FunctionNode: FunctionNode,
+    OperatorNode: OperatorNode,
+    SymbolNode: SymbolNode
+  }),
+      hasProperty = _createUtil.hasProperty,
+      isCommutative = _createUtil.isCommutative;
   /**
    * simplifyCore() performs single pass simplification suitable for
    * applications requiring ultimate performance. In contrast, simplify()
@@ -33,30 +48,54 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
    *
    * Syntax:
    *
-   *     simplify.simplifyCore(expr)
+   *     simplifyCore(expr)
    *
    * Examples:
    *
    *     const f = math.parse('2 * 1 * x ^ (2 - 1)')
-   *     math.simplify.simpifyCore(f)                          // Node {2 * x}
-   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplify.simpifyCore]) // Node {2 * x}
+   *     math.simpifyCore(f)                          // Node {2 * x}
+   *     math.simplify('2 * 1 * x ^ (2 - 1)', [math.simplifyCore]) // Node {2 * x}
    *
    * See also:
    *
-   *     derivative
+   *     simplify, resolve, derivative
    *
    * @param {Node} node
    *     The expression to be simplified
+   * @param {Object} options
+   *     Simplification options, as per simplify()
+   * @return {Node} Returns expression with basic simplifications applied
    */
 
-  function simplifyCore(node) {
-    if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
-      var a0 = simplifyCore(node.args[0]);
 
-      if (node.op === '+') {
-        // unary plus
-        return a0;
+  function simplifyCore(node, options) {
+    var context = options ? options.context : undefined;
+
+    if (hasProperty(node, 'trivial', context)) {
+      // This node does nothing if it has only one argument, so if so,
+      // return that argument simplified
+      if ((0, _is.isFunctionNode)(node) && node.args.length === 1) {
+        return simplifyCore(node.args[0], options);
+      } // For other node types, we try the generic methods
+
+
+      var simpChild = false;
+      var childCount = 0;
+      node.forEach(function (c) {
+        ++childCount;
+
+        if (childCount === 1) {
+          simpChild = simplifyCore(c, options);
+        }
+      });
+
+      if (childCount === 1) {
+        return simpChild;
       }
+    }
+
+    if ((0, _is.isOperatorNode)(node) && node.isUnary()) {
+      var a0 = simplifyCore(node.args[0], options);
 
       if (node.op === '-') {
         // unary minus
@@ -71,9 +110,9 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
         return new OperatorNode(node.op, node.fn, [a0]);
       }
     } else if ((0, _is.isOperatorNode)(node) && node.isBinary()) {
-      var _a = simplifyCore(node.args[0]);
+      var _a = simplifyCore(node.args[0], options);
 
-      var a1 = simplifyCore(node.args[1]);
+      var a1 = simplifyCore(node.args[1], options);
 
       if (node.op === '+') {
         if ((0, _is.isConstantNode)(_a)) {
@@ -109,7 +148,7 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
           }
 
           if ((0, _is.isOperatorNode)(a1) && a1.isUnary() && a1.op === '-') {
-            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]));
+            return simplifyCore(new OperatorNode('+', 'add', [_a, a1.args[0]]), options);
           }
 
           return new OperatorNode(node.op, node.fn, [_a, a1]);
@@ -130,7 +169,7 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
             return node0;
           } else if (equal(a1.value, 1)) {
             return _a;
-          } else if ((0, _is.isOperatorNode)(_a) && _a.isBinary() && _a.op === node.op) {
+          } else if ((0, _is.isOperatorNode)(_a) && _a.isBinary() && _a.op === node.op && isCommutative(node, context)) {
             var a00 = _a.args[0];
 
             if ((0, _is.isConstantNode)(a00)) {
@@ -139,7 +178,11 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
             }
           }
 
-          return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
+          if (isCommutative(node, context)) {
+            return new OperatorNode(node.op, node.fn, [a1, _a], node.implicit); // constants on left
+          } else {
+            return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
+          }
         }
 
         return new OperatorNode(node.op, node.fn, [_a, a1], node.implicit);
@@ -175,19 +218,28 @@ var createSimplifyCore = /* #__PURE__ */(0, _factory.factory)(name, dependencies
 
         return new OperatorNode(node.op, node.fn, [_a, a1]);
       }
-    } else if ((0, _is.isParenthesisNode)(node)) {
-      var c = simplifyCore(node.content);
-
-      if ((0, _is.isParenthesisNode)(c) || (0, _is.isSymbolNode)(c) || (0, _is.isConstantNode)(c)) {
-        return c;
+    } else if ((0, _is.isFunctionNode)(node)) {
+      return new FunctionNode(simplifyCore(node.fn), node.args.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isArrayNode)(node)) {
+      return new ArrayNode(node.items.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isAccessorNode)(node)) {
+      return new AccessorNode(simplifyCore(node.object, options), simplifyCore(node.index, options));
+    } else if ((0, _is.isIndexNode)(node)) {
+      return new IndexNode(node.dimensions.map(function (n) {
+        return simplifyCore(n, options);
+      }));
+    } else if ((0, _is.isObjectNode)(node)) {
+      var newProps = {};
+
+      for (var prop in node.properties) {
+        newProps[prop] = simplifyCore(node.properties[prop], options);
       }
 
-      return new ParenthesisNode(c);
-    } else if ((0, _is.isFunctionNode)(node)) {
-      var args = node.args.map(simplifyCore).map(function (arg) {
-        return (0, _is.isParenthesisNode)(arg) ? arg.content : arg;
-      });
-      return new FunctionNode(simplifyCore(node.fn), args);
+      return new ObjectNode(newProps);
     } else {// cannot simplify
     }
 

package/lib/cjs/function/algebra/solver/lsolveAll.js

@@ -107,7 +107,7 @@ var createLsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
           }
         } else if (k === 0) {
           // singular row, RHS is zero
-          var bNew = (0, _toConsumableArray2["default"])(b);
+          var bNew = (0, _toConsumableArray2.default)(b);
           bNew[i] = 1;
 
           for (var _j = i + 1; _j < columns; _j++) {
@@ -187,7 +187,7 @@ var createLsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
           }
         } else if (k === 0) {
           // singular row, RHS is zero
-          var bNew = (0, _toConsumableArray2["default"])(b);
+          var bNew = (0, _toConsumableArray2.default)(b);
           bNew[i] = 1;
 
           for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {

package/lib/cjs/function/algebra/solver/usolveAll.js

@@ -107,7 +107,7 @@ var createUsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
           }
         } else if (k === 0) {
           // singular row, RHS is zero
-          var bNew = (0, _toConsumableArray2["default"])(b);
+          var bNew = (0, _toConsumableArray2.default)(b);
           bNew[i] = 1;
 
           for (var _j = i - 1; _j >= 0; _j--) {
@@ -187,7 +187,7 @@ var createUsolveAll = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
           }
         } else if (k === 0) {
           // singular row, RHS is zero
-          var bNew = (0, _toConsumableArray2["default"])(b);
+          var bNew = (0, _toConsumableArray2.default)(b);
           bNew[i] = 1; // loop upper triangular
 
           for (var _j3 = 0, _lastIndex2 = iIndices.length; _j3 < _lastIndex2; _j3++) {

package/lib/cjs/function/arithmetic/ceil.js

@@ -91,7 +91,7 @@ var createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
         return round(x, n);
       } else {
         var _$split = "".concat(x, "e").split('e'),
-            _$split2 = (0, _slicedToArray2["default"])(_$split, 2),
+            _$split2 = (0, _slicedToArray2.default)(_$split, 2),
             number = _$split2[0],
             exponent = _$split2[1];
 
@@ -99,7 +99,7 @@ var createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
 
         var _$split3 = "".concat(result, "e").split('e');
 
-        var _$split4 = (0, _slicedToArray2["default"])(_$split3, 2);
+        var _$split4 = (0, _slicedToArray2.default)(_$split3, 2);
 
         number = _$split4[0];
         exponent = _$split4[1];
@@ -123,7 +123,7 @@ var createCeil = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {
         return round(x, n);
       } else {
-        return x.toDecimalPlaces(n.toNumber(), _decimal["default"].ROUND_CEIL);
+        return x.toDecimalPlaces(n.toNumber(), _decimal.default.ROUND_CEIL);
       }
     },
     Fraction: function Fraction(x) {

package/lib/cjs/function/arithmetic/floor.js

@@ -88,7 +88,7 @@ var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
         return round(x, n);
       } else {
         var _$split = "".concat(x, "e").split('e'),
-            _$split2 = (0, _slicedToArray2["default"])(_$split, 2),
+            _$split2 = (0, _slicedToArray2.default)(_$split, 2),
             number = _$split2[0],
             exponent = _$split2[1];
 
@@ -96,7 +96,7 @@ var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
 
         var _$split3 = "".concat(result, "e").split('e');
 
-        var _$split4 = (0, _slicedToArray2["default"])(_$split3, 2);
+        var _$split4 = (0, _slicedToArray2.default)(_$split3, 2);
 
         number = _$split4[0];
         exponent = _$split4[1];
@@ -120,7 +120,7 @@ var createFloor = /* #__PURE__ */(0, _factory.factory)(name, dependencies, funct
       if ((0, _nearlyEqual.nearlyEqual)(x, round(x, n), config.epsilon)) {
         return round(x, n);
       } else {
-        return x.toDecimalPlaces(n.toNumber(), _decimal["default"].ROUND_FLOOR);
+        return x.toDecimalPlaces(n.toNumber(), _decimal.default.ROUND_FLOOR);
       }
     },
     Fraction: function Fraction(x) {

package/lib/cjs/function/arithmetic/invmod.js

@@ -0,0 +1,73 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.createInvmod = void 0;
+
+var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
+
+var _factory = require("../../utils/factory.js");
+
+var name = 'invmod';
+var dependencies = ['typed', 'config', 'BigNumber', 'xgcd', 'equal', 'smaller', 'mod', 'add', 'isInteger'];
+var createInvmod = /* #__PURE__ */(0, _factory.factory)(name, dependencies, function (_ref) {
+  var typed = _ref.typed,
+      config = _ref.config,
+      BigNumber = _ref.BigNumber,
+      xgcd = _ref.xgcd,
+      equal = _ref.equal,
+      smaller = _ref.smaller,
+      mod = _ref.mod,
+      add = _ref.add,
+      isInteger = _ref.isInteger;
+
+  /**
+   * Calculate the (modular) multiplicative inverse of a modulo b. Solution to the equation `ax ≣ 1 (mod b)`
+   * See https://en.wikipedia.org/wiki/Modular_multiplicative_inverse.
+   *
+   * Syntax:
+   *
+   *    math.invmod(a, b)
+   *
+   * Examples:
+   *
+   *    math.invmod(8, 12)             // returns NaN
+   *    math.invmod(7, 13)             // return 2
+   *    math.invmod(15151, 15122)      // returns 10429
+   *
+   * See also:
+   *
+   *    gcd, xgcd
+   *
+   * @param {number | BigNumber} a  An integer number
+   * @param {number | BigNumber} b  An integer number
+   * @return {number | BigNumber }  Returns an integer number
+   *                              where `invmod(a,b)*a ≣ 1 (mod b)`
+   */
+  return typed(name, {
+    'number, number': invmod,
+    'BigNumber, BigNumber': invmod
+  });
+
+  function invmod(a, b) {
+    if (!isInteger(a) || !isInteger(b)) throw new Error('Parameters in function invmod must be integer numbers');
+    a = mod(a, b);
+    if (equal(b, 0)) throw new Error('Divisor must be non zero');
+    var res = xgcd(a, b);
+    res = res.valueOf();
+
+    var _res = res,
+        _res2 = (0, _slicedToArray2.default)(_res, 2),
+        gcd = _res2[0],
+        inv = _res2[1];
+
+    if (!equal(gcd, BigNumber(1))) return NaN;
+    inv = mod(inv, b);
+    if (smaller(inv, BigNumber(0))) inv = add(inv, b);
+    return inv;
+  }
+});
+exports.createInvmod = createInvmod;

package/lib/cjs/function/arithmetic/norm.js

@@ -71,7 +71,7 @@ var createNorm = /* #__PURE__ */(0, _factory.factory)(name, dependencies, functi
       // norm(x) = abs(x)
       return x.abs();
     },
-    "boolean": function boolean(x) {
+    boolean: function boolean(x) {
       // norm(x) = abs(x)
       return Math.abs(x);
     },

package/lib/cjs/function/arithmetic/round.js

@@ -25,7 +25,7 @@ var _index = require("../../plain/number/index.js");
 
 function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
 
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2.default)(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
 
 var NO_INT = 'Number of decimals in function round must be an integer';
 var name = 'round';

package/lib/cjs/function/matrix/eigs/complexEigs.js

@@ -11,7 +11,7 @@ var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers
 
 var _object = require("../../../utils/object.js");
 
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
 
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 
@@ -80,7 +80,7 @@ function createComplexEigs(_ref) {
 
     if (findVectors) {
       vectors = findEigenvectors(arr, N, C, values, prec, type);
-      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2["default"])(vectors));
+      vectors = matrixFromColumns.apply(void 0, (0, _toConsumableArray2.default)(vectors));
     }
 
     return {
@@ -360,7 +360,7 @@ function createComplexEigs(_ref) {
       } else if (n === 2 || smaller(abs(arr[n - 2][n - 3]), prec)) {
         lastConvergenceBefore = 0;
         var ll = eigenvalues2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1]);
-        lambdas.push.apply(lambdas, (0, _toConsumableArray2["default"])(ll)); // keep track of transformations
+        lambdas.push.apply(lambdas, (0, _toConsumableArray2.default)(ll)); // keep track of transformations
 
         if (findVectors) {
           Sdiag.unshift(jordanBase2x2(arr[n - 2][n - 2], arr[n - 2][n - 1], arr[n - 1][n - 2], arr[n - 1][n - 1], ll[0], ll[1], prec, type));
@@ -488,7 +488,7 @@ function createComplexEigs(_ref) {
         solutions.push(approxVec);
       }
 
-      vectors.push.apply(vectors, (0, _toConsumableArray2["default"])(solutions.map(function (v) {
+      vectors.push.apply(vectors, (0, _toConsumableArray2.default)(solutions.map(function (v) {
         return flatten(v);
       })));
     }
@@ -568,7 +568,7 @@ function createComplexEigs(_ref) {
     for (var i = 0; i < arr.length; i++) {
       var _arr$i;
 
-      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2["default"])(Array(N - arr[i].length).fill(0)));
+      (_arr$i = arr[i]).push.apply(_arr$i, (0, _toConsumableArray2.default)(Array(N - arr[i].length).fill(0)));
     } // add rows
 
 

package/lib/cjs/function/matrix/matrixFromColumns.js

@@ -7,7 +7,7 @@ exports.createMatrixFromColumns = void 0;
 
 var _factory = require("../../utils/factory.js");
 
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
 
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 

package/lib/cjs/function/matrix/matrixFromRows.js

@@ -7,7 +7,7 @@ exports.createMatrixFromRows = void 0;
 
 var _factory = require("../../utils/factory.js");
 
-function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
+function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = it.call(o); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
 
 function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
 

package/lib/cjs/function/probability/util/seededRNG.js

@@ -9,13 +9,13 @@ exports.createRng = createRng;
 
 var _seedrandom = _interopRequireDefault(require("seedrandom"));
 
-var singletonRandom = /* #__PURE__ */(0, _seedrandom["default"])(Date.now());
+var singletonRandom = /* #__PURE__ */(0, _seedrandom.default)(Date.now());
 
 function createRng(randomSeed) {
   var random; // create a new random generator with given seed
 
   function setSeed(seed) {
-    random = seed === null ? singletonRandom : (0, _seedrandom["default"])(String(seed));
+    random = seed === null ? singletonRandom : (0, _seedrandom.default)(String(seed));
   } // initialize a seeded pseudo random number generator with config's random seed
 
 

package/lib/cjs/function/relational/compareNatural.js

@@ -101,7 +101,7 @@ var createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependenci
           // c can be number, BigNumber, or Fraction
           return c > 0 ? 1 : -1; // return a number
         } else {
-          return (0, _javascriptNaturalSort["default"])(typeX, typeY);
+          return (0, _javascriptNaturalSort.default)(typeX, typeY);
         }
       } // matrix types
 
@@ -112,13 +112,13 @@ var createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependenci
         if (c !== 0) {
           return c;
         } else {
-          return (0, _javascriptNaturalSort["default"])(typeX, typeY);
+          return (0, _javascriptNaturalSort.default)(typeX, typeY);
         }
       } // in case of different types, order by name of type, i.e. 'BigNumber' < 'Complex'
 
 
       if (typeX !== typeY) {
-        return (0, _javascriptNaturalSort["default"])(typeX, typeY);
+        return (0, _javascriptNaturalSort.default)(typeX, typeY);
       }
 
       if (typeX === 'Complex') {
@@ -139,7 +139,7 @@ var createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependenci
       }
 
       if (typeX === 'string') {
-        return (0, _javascriptNaturalSort["default"])(x, y);
+        return (0, _javascriptNaturalSort.default)(x, y);
       }
 
       if (typeX === 'Object') {
@@ -252,8 +252,8 @@ var createCompareNatural = /* #__PURE__ */(0, _factory.factory)(name, dependenci
     var keysX = Object.keys(x);
     var keysY = Object.keys(y); // compare keys
 
-    keysX.sort(_javascriptNaturalSort["default"]);
-    keysY.sort(_javascriptNaturalSort["default"]);
+    keysX.sort(_javascriptNaturalSort.default);
+    keysY.sort(_javascriptNaturalSort.default);
     var c = compareArrays(compareNatural, keysX, keysY);
 
     if (c !== 0) {

package/lib/cjs/header.js

@@ -6,11 +6,11 @@
  * It features real and complex numbers, units, matrices, a large set of
  * mathematical functions, and a flexible expression parser.
  *
- * @version 10.0.2
- * @date    2021-12-29
+ * @version 10.2.0
+ * @date    2022-03-01
  *
  * @license
- * Copyright (C) 2013-2021 Jos de Jong <wjosdejong@gmail.com>
+ * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>
  *
  * Licensed under the Apache License, Version 2.0 (the "License"); you may not
  * use this file except in compliance with the License. You may obtain a copy

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

@@ -27,7 +27,7 @@ Object.keys(_arithmetic).forEach(function (key) {
 });
 
 // TODO: this is ugly. Instead, be able to pass your own isBigNumber function to typed?
-var BigNumber = _decimal["default"].clone();
+var BigNumber = _decimal.default.clone();
 
 BigNumber.prototype.isBigNumber = true;
 

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

@@ -23,15 +23,27 @@ function combinationsNumber(n, k) {
   }
 
   var nMinusk = n - k;
-  var prodrange;
+  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
 
-  if (k < nMinusk) {
-    prodrange = (0, _product.product)(nMinusk + 1, n);
-    return prodrange / (0, _product.product)(1, k);
+  for (var nextnumerator = firstnumerator; nextnumerator <= n; ++nextnumerator) {
+    answer *= nextnumerator;
+
+    while (nextdivisor <= lastdivisor && answer % nextdivisor === 0) {
+      answer /= nextdivisor;
+      ++nextdivisor;
+    }
+  } // for big n, k, floating point may have caused weirdness in remainder
+
+
+  if (nextdivisor <= lastdivisor) {
+    answer /= (0, _product.product)(nextdivisor, lastdivisor);
   }
 
-  prodrange = (0, _product.product)(k + 1, n);
-  return prodrange / (0, _product.product)(1, nMinusk);
+  return answer;
 }
 
 combinationsNumber.signature = 'number, number';

package/lib/cjs/type/bignumber/BigNumber.js

@@ -17,9 +17,9 @@ var createBigNumberClass = /* #__PURE__ */(0, _factory.factory)(name, dependenci
   var on = _ref.on,
       config = _ref.config;
 
-  var BigNumber = _decimal["default"].clone({
+  var BigNumber = _decimal.default.clone({
     precision: config.precision,
-    modulo: _decimal["default"].EUCLID
+    modulo: _decimal.default.EUCLID
   });
 
   BigNumber.prototype = Object.create(BigNumber.prototype);

package/lib/cjs/type/bignumber/function/bignumber.js

@@ -79,7 +79,7 @@ var createBignumber = /* #__PURE__ */(0, _factory.factory)(name, dependencies, f
     Fraction: function Fraction(x) {
       return new BigNumber(x.n).div(x.d).times(x.s);
     },
-    "null": function _null(x) {
+    null: function _null(x) {
       return new BigNumber(0);
     },
     'Array | Matrix': function ArrayMatrix(x) {

package/lib/cjs/type/boolean.js

@@ -45,13 +45,13 @@ var createBoolean = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fun
     '': function _() {
       return false;
     },
-    "boolean": function boolean(x) {
+    boolean: function boolean(x) {
       return x;
     },
     number: function number(x) {
       return !!x;
     },
-    "null": function _null(x) {
+    null: function _null(x) {
       return false;
     },
     BigNumber: function BigNumber(x) {