math-exercises 2.2.94 → 2.2.95

package/lib/tree/parsers/equationSolutionParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.equationSolutionParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const algebraicNode_1 = require("../nodes/algebraicNode");
 const equalNode_1 = require("../nodes/equations/equalNode");
 const variableNode_1 = require("../nodes/variables/variableNode");
@@ -34,7 +35,7 @@ const equationSolutionParser = (str, variable = "x") => {
         }
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.equationSolutionParser = equationSolutionParser;

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

@@ -1 +1 @@
-{"version":3,"file":"inequationParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/inequationParser.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AAGrE,KAAK,IAAI,GAAG;IACV,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,eAAO,MAAM,gBAAgB,QAAS,MAAM,SAAS,IAAI,2BAyBxD,CAAC"}
+{"version":3,"file":"inequationParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/inequationParser.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AAGrE,KAAK,IAAI,GAAG;IACV,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAEF,eAAO,MAAM,gBAAgB,QAAS,MAAM,SAAS,IAAI,2BAyBxD,CAAC"}

package/lib/tree/parsers/inequationParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.inequationParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const inequationNode_1 = require("../nodes/inequations/inequationNode");
 const latexParser_1 = require("./latexParser");
 const inequationParser = (ans, opts) => {
@@ -24,7 +25,7 @@ const inequationParser = (ans, opts) => {
         return new inequationNode_1.InequationNode([...children], ineqType[0]);
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.inequationParser = inequationParser;

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

@@ -1 +1 @@
-{"version":3,"file":"intervalParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/intervalParser.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAG1D,KAAK,IAAI,GAAG;IACV,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,eAAO,MAAM,cAAc,QAAS,MAAM,SAAS,IAAI,yBA8CtD,CAAC"}
+{"version":3,"file":"intervalParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/intervalParser.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAG1D,KAAK,IAAI,GAAG;IACV,4BAA4B,CAAC,EAAE,OAAO,CAAC;IACvC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,eAAO,MAAM,cAAc,QAAS,MAAM,SAAS,IAAI,yBA8CtD,CAAC"}

package/lib/tree/parsers/intervalParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.intervalParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const closure_1 = require("../nodes/sets/closure");
 const intervalNode_1 = require("../nodes/sets/intervalNode");
 const latexParser_1 = require("./latexParser");
@@ -37,8 +38,8 @@ const intervalParser = (ans, opts) => {
             return false;
         return new intervalNode_1.IntervalNode(aParsed, bParsed, closure_1.Closure.fromBrackets(leftBracket, rightBracket));
     }
-    catch (e) {
-        return false;
+    catch (err) {
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.intervalParser = intervalParser;

package/lib/tree/parsers/latexParser.js

@@ -45,7 +45,7 @@ const isDyck = (tokens) => {
     while (brackets.length) {
         counter++;
         if (counter > 1000)
-            throw Error("Too many iterations");
+            throw Error("should-throw Too many iterations");
         const rightIndex = brackets.findIndex((el) => el == ")");
         if (rightIndex === -1 || rightIndex === 0)
             return false;
@@ -214,14 +214,14 @@ const buildTree = (tokens) => {
     while (true) {
         counter++;
         if (counter > 1000)
-            throw Error("Too many iterations");
+            throw Error("should-throw Too many iterations");
         if (maxDepth === 0) {
             const tree = buildTreeForSameDepthTokens(depthedTokens.map((el) => el.token));
             return tree;
         }
         for (let i = 0; i < depthedTokens.length; i++) {
             if (i > 1000)
-                throw Error("Too many iterations");
+                throw Error("should-throw Too many iterations");
             const token = depthedTokens[i];
             //? on commence par les tokens de depth max
             if (token.depth < maxDepth)

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

@@ -1 +1 @@
-{"version":3,"file":"monomParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/monomParser.ts"],"names":[],"mappings":"AAGA,KAAK,IAAI,GAAG;IACV,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,CAAC;AACF,eAAO,MAAM,WAAW,QACjB,MAAM,uCACyB,IAAI,2DAiBzC,CAAC"}
+{"version":3,"file":"monomParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/monomParser.ts"],"names":[],"mappings":"AAIA,KAAK,IAAI,GAAG;IACV,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB,CAAC;AACF,eAAO,MAAM,WAAW,QACjB,MAAM,uCACyB,IAAI,2DAiBzC,CAAC"}

package/lib/tree/parsers/monomParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.monomParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const monomNode_1 = require("../nodes/polynomials/monomNode");
 const latexParser_1 = require("./latexParser");
 const monomParser = (str, { variable, maxDegree, minDegree } = {
@@ -18,7 +19,7 @@ const monomParser = (str, { variable, maxDegree, minDegree } = {
         //   } else return false;
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.monomParser = monomParser;

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

@@ -1 +1 @@
-{"version":3,"file":"polynomialParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/polynomialParser.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAWvD,eAAO,MAAM,gBAAgB,QAAS,MAAM,8OAmC3C,CAAC"}
+{"version":3,"file":"polynomialParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/polynomialParser.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAWvD,eAAO,MAAM,gBAAgB,QAAS,MAAM,8OAmC3C,CAAC"}

package/lib/tree/parsers/polynomialParser.js

@@ -1,6 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.polynomialParser = void 0;
+const handleVEAError_1 = require("../../utils/errors/handleVEAError");
 const oppositeNode_1 = require("../nodes/functions/oppositeNode");
 const addNode_1 = require("../nodes/operators/addNode");
 const substractNode_1 = require("../nodes/operators/substractNode");
@@ -45,7 +46,7 @@ const polynomialParser = (ans) => {
         return false;
     }
     catch (err) {
-        return false;
+        return (0, handleVEAError_1.handleVEAError)(err);
     }
 };
 exports.polynomialParser = polynomialParser;

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

@@ -1 +1 @@
-{"version":3,"file":"powerParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/powerParser.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,WAAW,QAAS,MAAM,uKAgBtC,CAAC"}
+{"version":3,"file":"powerParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/powerParser.ts"],"names":[],"mappings":"AAOA,eAAO,MAAM,WAAW,QAAS,MAAM,uKAgBtC,CAAC"}

package/lib/tree/parsers/powerParser.js

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

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/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.95",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [