mathjs 10.1.0 → 10.1.1

package/lib/cjs/function/algebra/simplify.js

@@ -138,11 +138,14 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
    * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
    *
    *  An optional `options` argument can be passed as last argument of `simplify`.
-   *  There is currently one option available:
-   *  - `exactFractions`: a boolean which is `true` by default.
-   *  - `fractionsLimit`: when `exactFractions` is true, a fraction will be returned
-   *    only when both numerator and denominator are smaller than `fractionsLimit`.
-   *    Default value is 10000.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+        and any changes to it, along with the rule responsible, to console
+   *  - `exactFractions` (true): whether to try to convert all constants to
+        exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+        be expressed as fractions only when both numerator and denominator
+        are smaller than `fractionsLimit`.
    *
    * Syntax:
    *
@@ -213,6 +216,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
       return this(expr, rules, (0, _map.createMap)(scope), options);
     },
     'Node, Array, Map, Object': function NodeArrayMapObject(expr, rules, scope, options) {
+      var debug = options.consoleDebug;
       rules = _buildRules(rules);
       var res = resolve(expr, scope);
       res = removeParens(res);
@@ -225,12 +229,33 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
         visited[str] = true;
         _lastsym = 0; // counter for placeholder symbols
 
+        var laststr = str;
+        if (debug) console.log('Working on: ', str);
+
         for (var i = 0; i < rules.length; i++) {
+          var rulestr = '';
+
           if (typeof rules[i] === 'function') {
             res = rules[i](res, options);
+            if (debug) rulestr = rules[i].name;
           } else {
             flatten(res);
             res = applyRule(res, rules[i]);
+
+            if (debug) {
+              rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+            }
+          }
+
+          if (debug) {
+            var newstr = res.toString({
+              parenthesis: 'all'
+            });
+
+            if (newstr !== laststr) {
+              console.log('Applying', rulestr, 'produced', newstr);
+              laststr = newstr;
+            }
           }
 
           unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it
@@ -314,18 +339,7 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   {
     l: 'n/n1',
     r: 'n*n1^-1'
-  }, // remove parenthesis in the case of negating a quantity
-  {
-    l: 'n1 + (n2 + n3)*(-1)',
-    r: 'n1 + n2*(-1) + n3*(-1)'
-  }, // subsume resulting -1 into constants where possible
-  {
-    l: '(-1) * c',
-    r: '-c'
-  }, {
-    l: '(-1) * (-c)',
-    r: 'c'
-  }, // expand nested exponentiation
+  }, simplifyConstant, // expand nested exponentiation
   {
     l: '(n ^ n1) ^ n2',
     r: 'n ^ (n1 * n2)'
@@ -357,11 +371,19 @@ var createSimplify = /* #__PURE__ */(0, _factory.factory)(name, dependencies, fu
   {
     l: 'n*c + c',
     r: '(n+1)*c'
-  }, simplifyConstant, {
+  }, // remove parenthesis in the case of negating a quantity
+  // (It might seem this rule should precede collecting like terms,
+  // but putting it after gives another chance of noticing like terms,
+  // and any new like terms produced by this will be collected
+  // on the next pass through all the rules.)
+  {
+    l: 'n1 + (n2 + n3)*(-1)',
+    r: 'n1 + n2*(-1) + n3*(-1)'
+  }, // make factors positive (and undo 'make non-constant terms positive')
+  {
     l: '(-n)*n1',
     r: '-(n*n1)'
-  }, // make factors positive (and undo 'make non-constant terms positive')
-  // final ordering of constants
+  }, // final ordering of constants
   {
     l: 'c+v',
     r: 'v+c',

package/lib/cjs/header.js

@@ -6,8 +6,8 @@
  * It features real and complex numbers, units, matrices, a large set of
  * mathematical functions, and a flexible expression parser.
  *
- * @version 10.1.0
- * @date    2022-01-15
+ * @version 10.1.1
+ * @date    2022-02-02
  *
  * @license
  * Copyright (C) 2013-2022 Jos de Jong <wjosdejong@gmail.com>

package/lib/cjs/version.js

@@ -4,7 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.version = void 0;
-var version = '10.1.0'; // Note: This file is automatically generated when building math.js.
+var version = '10.1.1'; // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.
 
 exports.version = version;

package/lib/esm/function/algebra/simplify.js

@@ -121,11 +121,14 @@ export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
    * - [Symbolic computation - Simplification (Wikipedia)](https://en.wikipedia.org/wiki/Symbolic_computation#Simplification)
    *
    *  An optional `options` argument can be passed as last argument of `simplify`.
-   *  There is currently one option available:
-   *  - `exactFractions`: a boolean which is `true` by default.
-   *  - `fractionsLimit`: when `exactFractions` is true, a fraction will be returned
-   *    only when both numerator and denominator are smaller than `fractionsLimit`.
-   *    Default value is 10000.
+   *  Currently available options (defaults in parentheses):
+   *  - `consoleDebug` (false): whether to write the expression being simplified
+        and any changes to it, along with the rule responsible, to console
+   *  - `exactFractions` (true): whether to try to convert all constants to
+        exact rational numbers.
+   *  - `fractionsLimit` (10000): when `exactFractions` is true, constants will
+        be expressed as fractions only when both numerator and denominator
+        are smaller than `fractionsLimit`.
    *
    * Syntax:
    *
@@ -195,6 +198,7 @@ export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
       return this(expr, rules, createMap(scope), options);
     },
     'Node, Array, Map, Object': function NodeArrayMapObject(expr, rules, scope, options) {
+      var debug = options.consoleDebug;
       rules = _buildRules(rules);
       var res = resolve(expr, scope);
       res = removeParens(res);
@@ -207,12 +211,33 @@ export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
         visited[str] = true;
         _lastsym = 0; // counter for placeholder symbols
 
+        var laststr = str;
+        if (debug) console.log('Working on: ', str);
+
         for (var i = 0; i < rules.length; i++) {
+          var rulestr = '';
+
           if (typeof rules[i] === 'function') {
             res = rules[i](res, options);
+            if (debug) rulestr = rules[i].name;
           } else {
             flatten(res);
             res = applyRule(res, rules[i]);
+
+            if (debug) {
+              rulestr = "".concat(rules[i].l.toString(), " -> ").concat(rules[i].r.toString());
+            }
+          }
+
+          if (debug) {
+            var newstr = res.toString({
+              parenthesis: 'all'
+            });
+
+            if (newstr !== laststr) {
+              console.log('Applying', rulestr, 'produced', newstr);
+              laststr = newstr;
+            }
           }
 
           unflattenl(res); // using left-heavy binary tree here since custom rule functions may expect it
@@ -296,18 +321,7 @@ export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
   {
     l: 'n/n1',
     r: 'n*n1^-1'
-  }, // remove parenthesis in the case of negating a quantity
-  {
-    l: 'n1 + (n2 + n3)*(-1)',
-    r: 'n1 + n2*(-1) + n3*(-1)'
-  }, // subsume resulting -1 into constants where possible
-  {
-    l: '(-1) * c',
-    r: '-c'
-  }, {
-    l: '(-1) * (-c)',
-    r: 'c'
-  }, // expand nested exponentiation
+  }, simplifyConstant, // expand nested exponentiation
   {
     l: '(n ^ n1) ^ n2',
     r: 'n ^ (n1 * n2)'
@@ -339,11 +353,19 @@ export var createSimplify = /* #__PURE__ */factory(name, dependencies, _ref => {
   {
     l: 'n*c + c',
     r: '(n+1)*c'
-  }, simplifyConstant, {
+  }, // remove parenthesis in the case of negating a quantity
+  // (It might seem this rule should precede collecting like terms,
+  // but putting it after gives another chance of noticing like terms,
+  // and any new like terms produced by this will be collected
+  // on the next pass through all the rules.)
+  {
+    l: 'n1 + (n2 + n3)*(-1)',
+    r: 'n1 + n2*(-1) + n3*(-1)'
+  }, // make factors positive (and undo 'make non-constant terms positive')
+  {
     l: '(-n)*n1',
     r: '-(n*n1)'
-  }, // make factors positive (and undo 'make non-constant terms positive')
-  // final ordering of constants
+  }, // final ordering of constants
   {
     l: 'c+v',
     r: 'v+c',

package/lib/esm/version.js

@@ -1,2 +1,2 @@
-export var version = '10.1.0'; // Note: This file is automatically generated when building math.js.
+export var version = '10.1.1'; // Note: This file is automatically generated when building math.js.
 // Changes made in this file will be overwritten.

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "mathjs",
-  "version": "10.1.0",
+  "version": "10.1.1",
   "description": "Math.js is an extensive math library for JavaScript and Node.js. It features a flexible expression parser with support for symbolic computation, comes with a large set of built-in functions and constants, and offers an integrated solution to work with different data types like numbers, big numbers, complex numbers, fractions, units, and matrices.",
   "author": "Jos de Jong <wjosdejong@gmail.com> (https://github.com/josdejong)",
   "homepage": "https://mathjs.org",
@@ -25,7 +25,7 @@
     "unit"
   ],
   "dependencies": {
-    "@babel/runtime": "^7.16.5",
+    "@babel/runtime": "^7.16.7",
     "complex.js": "^2.0.15",
     "decimal.js": "^10.3.1",
     "escape-latex": "^1.2.0",
@@ -36,32 +36,32 @@
     "typed-function": "^2.0.0"
   },
   "devDependencies": {
-    "@babel/core": "7.16.5",
-    "@babel/plugin-transform-object-assign": "7.16.5",
-    "@babel/plugin-transform-runtime": "7.16.5",
-    "@babel/preset-env": "7.16.5",
-    "@babel/register": "7.16.5",
+    "@babel/core": "7.16.12",
+    "@babel/plugin-transform-object-assign": "7.16.7",
+    "@babel/plugin-transform-runtime": "7.16.10",
+    "@babel/preset-env": "7.16.11",
+    "@babel/register": "7.16.9",
     "babel-loader": "8.2.3",
     "benchmark": "2.1.4",
     "codecov": "3.8.3",
-    "core-js": "3.20.1",
+    "core-js": "3.21.0",
     "del": "6.0.0",
     "dtslint": "4.2.1",
     "expr-eval": "2.0.2",
-    "fancy-log": "1.3.3",
+    "fancy-log": "2.0.0",
     "glob": "7.2.0",
     "gulp": "4.0.2",
     "gulp-babel": "8.0.0",
     "handlebars": "4.7.7",
     "istanbul": "0.4.5",
     "jsep": "1.2.0",
-    "karma": "6.3.9",
+    "karma": "6.3.13",
     "karma-browserstack-launcher": "1.6.0",
     "karma-firefox-launcher": "2.1.2",
     "karma-mocha": "2.0.1",
     "karma-mocha-reporter": "2.2.5",
     "karma-webpack": "4.0.2",
-    "math-expression-evaluator": "1.3.8",
+    "math-expression-evaluator": "1.3.14",
     "mkdirp": "1.0.4",
     "mocha": "8.4.0",
     "ndarray": "1.0.19",
@@ -74,7 +74,7 @@
     "pad-right": "0.2.2",
     "standard": "16.0.4",
     "sylvester": "0.0.21",
-    "typescript": "4.5.4",
+    "typescript": "4.5.5",
     "webpack": "4.46.0",
     "zeros": "1.0.0"
   },

package/types/index.d.ts

@@ -3409,11 +3409,11 @@ declare namespace math {
 
   interface ConfigOptions {
     epsilon?: number;
-    matrix?: string;
-    number?: string;
+    matrix?: 'Matrix' | 'Array';
+    number?: 'number' | 'BigNumber' | 'Fraction';
     precision?: number;
-    parenthesis?: string;
-    randomSeed?: string;
+    predictable?: boolean;
+    randomSeed?: string | null;
   }
 
   interface MathJsJson {