math-exercises 2.2.94 → 2.2.96

package/lib/tree/parsers/purifyLatex.js

@@ -5,7 +5,7 @@ exports.purifyLatex = void 0;
  * supprime les éléments superflus sans aucun calcul maths
  * ex : transforme (2) en 2
  * ex : transforme (9)/3 en 9/3 mais pas en 3
- * doit-il transformer 1*x en x ?
+ * doit-il transformer 1*x en x ? -> je dirais que non
  * @param str réponse élève
  */
 const purifyLatex = (str) => {

package/lib/tree/parsers/sqrtParser.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sqrtParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/sqrtParser.ts"],"names":[],"mappings":"AAeA;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,QAAS,MAAM,uUAuCrC,CAAC"}
+{"version":3,"file":"sqrtParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/sqrtParser.ts"],"names":[],"mappings":"AAgBA;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,QAAS,MAAM,uUAuCrC,CAAC"}

package/lib/tree/parsers/sqrtParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.sqrtParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const oppositeNode_1 = require("../nodes/functions/oppositeNode");
 const sqrtNode_1 = require("../nodes/functions/sqrtNode");
 const numberNode_1 = require("../nodes/numbers/numberNode");
@@ -46,7 +47,7 @@ const sqrtParser = (ans) => {
         return false;
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.sqrtParser = sqrtParser;

package/lib/tree/parsers/trinomParser.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"trinomParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/trinomParser.ts"],"names":[],"mappings":"AAUA,eAAO,MAAM,YAAY,QAAS,MAAM,aAAY,MAAM,uEAgCzD,CAAC"}
+{"version":3,"file":"trinomParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/trinomParser.ts"],"names":[],"mappings":"AAWA,eAAO,MAAM,YAAY,QAAS,MAAM,aAAY,MAAM,uEAgCzD,CAAC"}

package/lib/tree/parsers/trinomParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.trinomParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const addNode_1 = require("../nodes/operators/addNode");
 const substractNode_1 = require("../nodes/operators/substractNode");
 const monomNode_1 = require("../nodes/polynomials/monomNode");
@@ -37,7 +38,7 @@ const trinomParser = (ans, variable = "x") => {
         // return false;
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.trinomParser = trinomParser;

package/lib/tree/parsers/unionIntervalParser.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unionIntervalParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/unionIntervalParser.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAIpE,KAAK,IAAI,GAAG;IACV,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,eAAO,MAAM,mBAAmB,QAAS,MAAM,SAAS,IAAI,6CAmB3D,CAAC"}
+{"version":3,"file":"unionIntervalParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/unionIntervalParser.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAIpE,KAAK,IAAI,GAAG;IACV,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,eAAO,MAAM,mBAAmB,QAAS,MAAM,SAAS,IAAI,6CAmB3D,CAAC"}

package/lib/tree/parsers/unionIntervalParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.unionIntervalParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const unionIntervalNode_1 = require("../nodes/sets/unionIntervalNode");
 const intervalParser_1 = require("./intervalParser");
 const unionIntervalParser = (ans, opts) => {
@@ -22,7 +23,7 @@ const unionIntervalParser = (ans, opts) => {
         }));
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.unionIntervalParser = unionIntervalParser;

package/lib/utils/alea/random.js

@@ -14,7 +14,7 @@ function randomMany(array, count, excludes) {
     let i = 0;
     while (res.length < count) {
         if (i > 10000)
-            throw new Error("randomMany malformed");
+            throw new Error("should-throw randomMany malformed");
         i++;
         res.push(random(array, [...res, ...(excludes ?? [])]));
     }

package/lib/utils/alea/shuffle.js

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.shuffle = void 0;
-/* Randomize array in-place using Durstenfeld shuffle algorithm */
+/* Randomize array using Durstenfeld shuffle algorithm */
 function shuffle(array) {
     const res = [...array];
     for (var i = res.length - 1; i > 0; i--) {

package/lib/utils/errors/handleVEAError.d.ts

@@ -0,0 +1,2 @@
+export declare const handleVEAError: (err: any) => false;
+//# sourceMappingURL=handleVEAError.d.ts.map

package/lib/utils/errors/handleVEAError.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"handleVEAError.d.ts","sourceRoot":"","sources":["../../../src/utils/errors/handleVEAError.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,cAAc,QAAS,GAAG,KAAG,KAGzC,CAAC"}

package/lib/utils/errors/handleVEAError.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.handleVEAError = void 0;
+const handleVEAError = (err) => {
+    if (err.message.includes("should-throw"))
+        throw err;
+    return false;
+};
+exports.handleVEAError = handleVEAError;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "math-exercises",
-  "version": "2.2.94",
+  "version": "2.2.96",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [