math-exercises 3.0.121 → 3.0.122

package/lib/math/probability/randomVariable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"randomVariable.d.ts","sourceRoot":"","sources":["../../../src/math/probability/randomVariable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,MAAM,uCAAuC,CAAC;AAWhE,8BAAsB,yBAAyB;IAC7C,MAAM,CAAC,MAAM;CAsBd;AACD,qBAAa,cAAc;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;gBAGvB,OAAO,EAAE,CAAC,aAAa,GAAG,MAAM,CAAC,EAAE,EACnC,OAAO,EAAE,CAAC,aAAa,GAAG,MAAM,CAAC,EAAE;IAMrC,WAAW;IAOX,UAAU;IAOV,WAAW;IAUX,oBAAoB;CAGrB"}
+{"version":3,"file":"randomVariable.d.ts","sourceRoot":"","sources":["../../../src/math/probability/randomVariable.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,MAAM,uCAAuC,CAAC;AAWhE,8BAAsB,yBAAyB;IAC7C,MAAM,CAAC,MAAM;CA0Bd;AACD,qBAAa,cAAc;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;gBAGvB,OAAO,EAAE,CAAC,aAAa,GAAG,MAAM,CAAC,EAAE,EACnC,OAAO,EAAE,CAAC,aAAa,GAAG,MAAM,CAAC,EAAE;IAMrC,WAAW;IAOX,UAAU;IAOV,WAAW;IAUX,oBAAoB;CAGrB"}

package/lib/math/probability/randomVariable.js

@@ -22,7 +22,11 @@ export class RandomVariableConstructor {
             yValues.push(round(0.05 * randint(1, 19), 2));
         }
         let sum = yValues.reduce((acc, curr) => acc + curr);
+        let counter = 0;
         while (sum !== 1) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("RandomVariableConstructor too many iterations");
             const index = doWhile(() => randint(0, nb), (x) => (sum > 1 ? yValues[x] < 0.1 : yValues[x] > 0.9));
             yValues[index] = round(yValues[index] + (sum > 1 ? -1 : 1) * 0.05, 2);
             sum = yValues.reduce((acc, curr) => acc + curr);

package/lib/math/utils/arithmetic/primeFactors.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"primeFactors.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/arithmetic/primeFactors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,GAAG,MAAM,KAAG,MAAM,EAa9C,CAAC"}
+{"version":3,"file":"primeFactors.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/arithmetic/primeFactors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,eAAO,MAAM,YAAY,GAAI,GAAG,MAAM,KAAG,MAAM,EAe9C,CAAC"}

package/lib/math/utils/arithmetic/primeFactors.js

@@ -5,7 +5,11 @@
 export const primeFactors = (a) => {
     const factors = [];
     let divisor = 2;
+    let counter = 0;
     while (a >= 2) {
+        counter++;
+        if (counter > 1000)
+            throw new Error("primeFactors too many iterations");
         if (a % divisor === 0) {
             factors.push(divisor);
             a = a / divisor;

package/lib/math/utils/decimals/decimalPartLengthOf.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"decimalPartLengthOf.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/decimals/decimalPartLengthOf.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,mBAAmB,GAAI,GAAG,MAAM,WAS5C,CAAC"}
+{"version":3,"file":"decimalPartLengthOf.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/decimals/decimalPartLengthOf.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,mBAAmB,GAAI,GAAG,MAAM,WAe5C,CAAC"}

package/lib/math/utils/decimals/decimalPartLengthOf.js

@@ -4,7 +4,12 @@ export const decimalPartLengthOf = (x) => {
     }
     let count = 0;
     // multiply by increasing powers of 10 until the fractional part is ~ 0
-    while (hasFraction(x * 10 ** count) && isFinite(10 ** count))
+    let counter = 0;
+    while (hasFraction(x * 10 ** count) && isFinite(10 ** count)) {
         count++;
+        counter++;
+        if (counter > 1000)
+            throw new Error("decimalPartLengthOf too many iterations");
+    }
     return count;
 };

package/lib/math/utils/random/randTupleInt.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"randTupleInt.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randTupleInt.ts"],"names":[],"mappings":"AAGA,UAAU,mBAAmB;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;;;GAIG;AACH,eAAO,MAAM,YAAY,GACvB,MAAM,MAAM,EACZ,SAAS,mBAAmB,KAC3B,MAAM,EAiBR,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAC/B,IAAI,MAAM,EACV,MAAM,MAAM,EACZ,SAAS,mBAAmB,KAC3B,MAAM,EAAE,EAUV,CAAC"}
+{"version":3,"file":"randTupleInt.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randTupleInt.ts"],"names":[],"mappings":"AAGA,UAAU,mBAAmB;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;IACtB,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB;AAED;;;;GAIG;AACH,eAAO,MAAM,YAAY,GACvB,MAAM,MAAM,EACZ,SAAS,mBAAmB,KAC3B,MAAM,EAuBR,CAAC;AAEF,eAAO,MAAM,oBAAoB,GAC/B,IAAI,MAAM,EACV,MAAM,MAAM,EACZ,SAAS,mBAAmB,KAC3B,MAAM,EAAE,EAcV,CAAC"}

package/lib/math/utils/random/randTupleInt.js

@@ -7,11 +7,19 @@ import { randint } from "./randint.js";
  */
 export const randTupleInt = (size, options) => {
     let res = [];
+    let counter = 0;
     do {
+        counter++;
+        if (counter > 1000)
+            throw new Error("randTupleInt too many iterations");
         res = [];
         for (let i = 0; i < size; i++) {
             let x;
+            let cnt = 0;
             do {
+                cnt++;
+                if (cnt > 1000)
+                    throw new Error("randTupleInt too many iterations 2");
                 x = randint(options.from, options.to);
             } while (options.allDifferent && res.includes(x));
             res.push(x);
@@ -24,7 +32,11 @@ export const distinctRandTupleInt = (nb, size, options) => {
     const res = [];
     for (let i = 0; i < nb; i++) {
         let newTuple;
+        let counter = 0;
         do {
+            counter++;
+            if (counter > 1000)
+                throw new Error("distinctRandTupleInt too many iterations");
             newTuple = randTupleInt(size, options);
         } while (res.some((tuple) => arrayEqual(tuple, newTuple)));
         res.push(newTuple);

package/lib/math/utils/random/randfloat.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"randfloat.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randfloat.ts"],"names":[],"mappings":"AAAA;;GAEG;AASH,MAAM,MAAM,cAAc,GAAG;IAC3B,CAAC,EAAE,MAAM;IACT,CAAC,CAAC,EAAE,MAAM;IACV,OAAO,CAAC,EAAE,MAAM;IAChB,QAAQ,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC;CAC/C,CAAC;AACF,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,cAAc,KAAG,MAkBnD,CAAC"}
+{"version":3,"file":"randfloat.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randfloat.ts"],"names":[],"mappings":"AAAA;;GAEG;AASH,MAAM,MAAM,cAAc,GAAG;IAC3B,CAAC,EAAE,MAAM;IACT,CAAC,CAAC,EAAE,MAAM;IACV,OAAO,CAAC,EAAE,MAAM;IAChB,QAAQ,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC;CAC/C,CAAC;AACF,eAAO,MAAM,SAAS,GAAI,GAAG,MAAM,cAAc,KAAG,MAwBnD,CAAC"}

package/lib/math/utils/random/randfloat.js

@@ -10,14 +10,22 @@ export const randfloat = (...args) => {
         return a + Math.random() * (b - a);
     if (Array.isArray(excludes)) {
         let res = 0;
+        let counter = 0;
         do {
+            counter++;
+            if (counter > 1000)
+                throw new Error("randfloat too many iterations");
             res = round(a + Math.random() * (b - a), roundTo);
         } while (excludes.includes(res));
         return res;
     }
     else if (excludes) {
         let res = 0;
+        let counter = 0;
         do {
+            counter++;
+            if (counter > 1000)
+                throw new Error("randfloat too many iterations");
             res = round(a + Math.random() * (b - a), roundTo);
         } while (excludes(res));
         return res;

package/lib/math/utils/random/randint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"randint.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randint.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,KAAK,OAAO,GAAG;IACb,KAAK,CAAC,EAAE;QACN,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH,CAAC;AACF,MAAM,MAAM,YAAY,GAAG;IACzB,CAAC,EAAE,MAAM;IACT,CAAC,CAAC,EAAE,MAAM;IACV,QAAQ,CAAC,EAAE,MAAM,EAAE;IACnB,IAAI,CAAC,EAAE,OAAO;CACf,CAAC;AACF,eAAO,MAAM,OAAO,GAClB,GAAG,MAAM,YAAY,KAKvB,MAcC,CAAC"}
+{"version":3,"file":"randint.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/random/randint.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,KAAK,OAAO,GAAG;IACb,KAAK,CAAC,EAAE;QACN,KAAK,EAAE,MAAM,CAAC;QACd,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH,CAAC;AACF,MAAM,MAAM,YAAY,GAAG;IACzB,CAAC,EAAE,MAAM;IACT,CAAC,CAAC,EAAE,MAAM;IACV,QAAQ,CAAC,EAAE,MAAM,EAAE;IACnB,IAAI,CAAC,EAAE,OAAO;CACf,CAAC;AACF,eAAO,MAAM,OAAO,GAClB,GAAG,MAAM,YAAY,KAKvB,MAiBC,CAAC"}

package/lib/math/utils/random/randint.js

@@ -2,6 +2,7 @@
  * @returns random [[a, b[[
  */
 export const randint = (...args) => {
+    let counter = 0;
     const [a, b, excludes, opts] = args;
     if (opts?.favor) {
         if (Math.random() < opts.favor.proba) {
@@ -14,6 +15,9 @@ export const randint = (...args) => {
         return a + Math.floor(Math.random() * (b - a));
     let res;
     do {
+        counter++;
+        if (counter > 1000)
+            throw new Error("randint too many iterations");
         res = a + Math.floor(Math.random() * (b - a));
     } while (excludes.includes(res));
     return res;

package/lib/math/utils/stats/generateAffineCloud.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generateAffineCloud.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/stats/generateAffineCloud.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,mBAAmB,GAAI,GAAG,MAAM;;;GAiB5C,CAAC"}
+{"version":3,"file":"generateAffineCloud.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/stats/generateAffineCloud.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,mBAAmB,GAAI,GAAG,MAAM;;;GAuB5C,CAAC"}

package/lib/math/utils/stats/generateAffineCloud.js

@@ -5,9 +5,17 @@ export const generateAffineCloud = (n) => {
     const intercept = randint(100, 5000) / 100;
     const data = [];
     const generatedXs = new Set();
+    let cnt = 0;
     while (data.length < n) {
+        cnt++;
+        if (cnt > 1000)
+            throw new Error("generateAffineCloud too many iterations");
         let x = randint(1, 100);
+        let counter = 0;
         while (generatedXs.has(x)) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("generateAffineCloud too many iterations 2");
             x = randint(1, 100);
         }
         generatedXs.add(x);

package/lib/pc/constants/molecularChemistry/reaction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reaction.d.ts","sourceRoot":"","sources":["../../../../src/pc/constants/molecularChemistry/reaction.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,QAAQ,CAAC;CACpB;AAED,8BAAsB,mBAAmB;IACvC,MAAM,CAAC,cAAc,IAAI,QAAQ;CAmVlC;AAED,qBAAa,QAAQ;IACnB,aAAa,EAAE,eAAe,EAAE,CAAC;gBAErB,aAAa,EAAE,eAAe,EAAE;IAI5C,OAAO,CAAC,YAAY;IAIpB,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,kBAAkB;IAU1B,iBAAiB,IAAI,MAAM;IAU3B,sBAAsB,IAAI,MAAM;IAchC,wBAAwB,IAAI,MAAM;IAsBlC,OAAO,CAAC,oBAAoB;IAwB5B,2BAA2B,CAAC,2BAA2B,EAAE,MAAM,GAAG,MAAM;IAgCxE,kBAAkB,IAAI,KAAK,EAAE;IAc7B,iBAAiB,IAAI,MAAM,EAAE;IAW7B,cAAc,IAAI,MAAM,EAAE;IAW1B,SAAS,IAAI,KAAK,EAAE;CAWrB;AACD,OAAO,EAAE,SAAS,EAAE,CAAC"}
+{"version":3,"file":"reaction.d.ts","sourceRoot":"","sources":["../../../../src/pc/constants/molecularChemistry/reaction.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,CAAC,EAAE,QAAQ,CAAC;CACpB;AAED,8BAAsB,mBAAmB;IACvC,MAAM,CAAC,cAAc,IAAI,QAAQ;CAmVlC;AAED,qBAAa,QAAQ;IACnB,aAAa,EAAE,eAAe,EAAE,CAAC;gBAErB,aAAa,EAAE,eAAe,EAAE;IAI5C,OAAO,CAAC,YAAY;IAIpB,OAAO,CAAC,WAAW;IAInB,OAAO,CAAC,kBAAkB;IAU1B,iBAAiB,IAAI,MAAM;IAU3B,sBAAsB,IAAI,MAAM;IAchC,wBAAwB,IAAI,MAAM;IAsBlC,OAAO,CAAC,oBAAoB;IA0B5B,2BAA2B,CAAC,2BAA2B,EAAE,MAAM,GAAG,MAAM;IAgCxE,kBAAkB,IAAI,KAAK,EAAE;IAc7B,iBAAiB,IAAI,MAAM,EAAE;IAW7B,cAAc,IAAI,MAAM,EAAE;IAW1B,SAAS,IAAI,KAAK,EAAE;CAWrB;AACD,OAAO,EAAE,SAAS,EAAE,CAAC"}

package/lib/pc/constants/molecularChemistry/reaction.js

@@ -385,7 +385,11 @@ export class Reaction {
         const myReactionCoef = this.reactionArray.map((species) => species.coefficient);
         const randomCoefs = [];
         let verif = true;
+        let counter = 0;
         while (verif) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("Too many iterations");
             for (let i = 0; i < myReactionCoef.length; i++) {
                 const randomCoef = Math.floor(Math.random() * maxRange) + 1;
                 randomCoefs.push(randomCoef);

package/lib/tests/megaExosTest.js

@@ -1,6 +1,6 @@
 import { exosTest } from "./exosTest.js";
 export const megaExosTest = (exos) => {
-    for (let i = 0; i < 100; i++) {
+    for (let i = 0; i < 1000; i++) {
         exosTest(exos);
     }
 };

package/lib/tests/pdfs/mdCodeToLatex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mdCodeToLatex.d.ts","sourceRoot":"","sources":["../../../src/tests/pdfs/mdCodeToLatex.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,GAAI,MAAM,MAAM,WAgCzC,CAAC"}
+{"version":3,"file":"mdCodeToLatex.d.ts","sourceRoot":"","sources":["../../../src/tests/pdfs/mdCodeToLatex.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,GAAI,MAAM,MAAM,WAsCzC,CAAC"}

package/lib/tests/pdfs/mdCodeToLatex.js

@@ -3,7 +3,11 @@ export const mdCodeToLatex = (text) => {
     //finds things that starts with ``` and ends with ```
     const re = /```[\s\S]*?```/g;
     let match;
+    let counter = 0;
     while ((match = re.exec(text)) != null) {
+        counter++;
+        if (counter > 1000)
+            throw new Error("mdCodeToLatex too many iterations");
         const content = match[0]
             .replaceAll("```", "")
             .split("\n")
@@ -17,7 +21,11 @@ export const mdCodeToLatex = (text) => {
                 res.slice(match.index + match[0].length);
     }
     const singleRe = /`[\s\S]*?`/;
+    let cnt = 0;
     while ((match = singleRe.exec(res)) != null) {
+        cnt++;
+        if (cnt > 1000)
+            throw new Error("mdCodeToLatex too many iterations");
         const content = match[0].replaceAll("`", "");
         res =
             res.slice(0, match.index) +

package/lib/tests/pdfs/mdTableToLatexTabular.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mdTableToLatexTabular.d.ts","sourceRoot":"","sources":["../../../src/tests/pdfs/mdTableToLatexTabular.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,qBAAqB,GAAI,MAAM,MAAM,WAwBjD,CAAC"}
+{"version":3,"file":"mdTableToLatexTabular.d.ts","sourceRoot":"","sources":["../../../src/tests/pdfs/mdTableToLatexTabular.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,qBAAqB,GAAI,MAAM,MAAM,WA4BjD,CAAC"}

package/lib/tests/pdfs/mdTableToLatexTabular.js

@@ -3,7 +3,11 @@ export const mdTableToLatexTabular = (text) => {
     //finds things that starts with <!-- table --> and ends with <!-- !table -->
     const re = /<!-- table -->[\s\S]*?<!-- !table -->/g;
     let match;
+    let counter = 0;
     while ((match = re.exec(text)) != null) {
+        counter++;
+        if (counter > 1000)
+            throw new Error("mdTableToLatexTabular too many iterations");
         const content = match[0]
             .replace("<!-- table -->", "")
             .replace("<!-- !table -->", "")

package/lib/tree/nodes/operators/fractionNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fractionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/fractionNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAK9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKrE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAMxD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,IAAI,GACf,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,OAAO,WAAW,iBAOnB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;CAC7B,CAAC;AACF,qBAAa,YAAa,YAAW,YAAY;IAC/C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;OAGG;IACH,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAiBpB,YAAY,IAAI,MAAM;IAItB,aAAa,IAAI,uBAAuB;IAQxC,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA+BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,SAAS;IAUT,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IA8BrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,GAAG,UAAQ,GAAG,aAAa;IA0M5D,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,mBAAmB;IAQnB,UAAU,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAGzD"}
+{"version":3,"file":"fractionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/fractionNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAChF,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,mBAAmB,CAAC;AAK9E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAKrE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAMxD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,IAAI,GACf,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,GAAG,aAAa,GAAG,MAAM,GAAG,MAAM,EAClC,OAAO,WAAW,iBAOnB,CAAC;AAEF,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC,QAAQ,CAAC;IACrB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;CAC7B,CAAC;AACF,qBAAa,YAAa,YAAW,YAAY;IAC/C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB;;;OAGG;IACH,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAiBpB,YAAY,IAAI,MAAM;IAItB,aAAa,IAAI,uBAAuB;IAQxC,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA+BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAG5C,SAAS;IAoBT,KAAK,CAAC,OAAO,CAAC,EAAE,YAAY,GAAG,MAAM;IA8BrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMtC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,EAAE,GAAG,UAAQ,GAAG,aAAa;IA0M5D,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;IAOpC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAOxD,mBAAmB;IAQnB,UAAU,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,aAAa;CAGzD"}

package/lib/tree/nodes/operators/fractionNode.js

@@ -96,10 +96,20 @@ export class FractionNode {
         if (isNumberNode(simp))
             return true;
         let denum = simp.leftChild.evaluate();
-        while (denum % 2 === 0)
+        let counter = 0;
+        while (denum % 2 === 0) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("Too many iterations in isDecimal");
             denum = denum / 2;
-        while (denum % 5 === 0)
+        }
+        counter = 0;
+        while (denum % 5 === 0) {
+            counter++;
+            if (counter > 1000)
+                throw new Error("Too many iterations in isDecimal");
             denum = denum / 5;
+        }
         return denum === 1;
     }
     toTex(texOpts) {

package/lib/tree/nodes/sets/intervalNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,eAAe,EAAkB,MAAM,uBAAuB,CAAC;AAOxE,OAAO,EAAW,WAAW,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAY,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAE3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,8BAAsB,uBAAuB;IAC3C,MAAM,CAAC,MAAM;IA2Cb,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM;IAYlC,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,uBAAuB;CAQpD;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC;IACZ,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,OAAO,EAAE,WAAW,CAAC;IACrB,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AACF,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;gBAGjB,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa,EAChB,OAAO,EAAE,WAAW,EACpB,IAAI,CAAC,EAAE,WAAW;IAYpB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,aAAa;IA4BxC,YAAY;IAIZ,MAAM,CAAC,CAAC,EAAE,aAAa;IASvB,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAYxB,YAAY;IAkCZ,KAAK;IAWL;;SAEK;IACL,YAAY;IAWZ,SAAS,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAOvC,aAAa,IAAI,uBAAuB;IAUxC,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO;IAiB7C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,UAAU,IAAI,aAAa;IAG3B,QAAQ;IAGR,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IASxD,YAAY;IAGZ,aAAa;IAGb,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO;IAanC,YAAY,CAAC,QAAQ,EAAE,YAAY;IA0DnC,YAAY;IAIZ,SAAS,CAAC,CAAC,EAAE,WAAW;IAGxB,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB;CAkDhE"}
+{"version":3,"file":"intervalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/intervalNode.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,eAAe,EAAkB,MAAM,uBAAuB,CAAC;AAOxE,OAAO,EAAW,WAAW,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,eAAe,EAAY,MAAM,sBAAsB,CAAC;AACjE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,cAAc,CAAC;AAC1D,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAE3D,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,8BAAsB,uBAAuB;IAC3C,MAAM,CAAC,MAAM;IA2Cb,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,MAAM;IAgBlC,MAAM,CAAC,eAAe,CAAC,GAAG,EAAE,uBAAuB;CAQpD;AAED,MAAM,MAAM,uBAAuB,GAAG;IACpC,EAAE,EAAE,OAAO,CAAC;IACZ,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,OAAO,EAAE,WAAW,CAAC;IACrB,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AACF,qBAAa,YAAa,YAAW,OAAO;IAC1C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,OAAO,EAAE,WAAW,CAAC;IACrB,CAAC,EAAE,aAAa,CAAC;IACjB,CAAC,EAAE,aAAa,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;gBAGjB,CAAC,EAAE,aAAa,EAChB,CAAC,EAAE,aAAa,EAChB,OAAO,EAAE,WAAW,EACpB,IAAI,CAAC,EAAE,WAAW;IAYpB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW;IAMjC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAoBpC,YAAY,CAAC,WAAW,CAAC,EAAE,aAAa;IA4BxC,YAAY;IAIZ,MAAM,CAAC,CAAC,EAAE,aAAa;IASvB,iBAAiB;IAGjB,qBAAqB;IAGrB,sBAAsB;IAGtB,wBAAwB;IAgBxB,YAAY;IAkCZ,KAAK;IAWL;;SAEK;IACL,YAAY;IAWZ,SAAS,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAOvC,aAAa,IAAI,uBAAuB;IAUxC,MAAM,CAAC,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO;IAiB7C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAQ/B,UAAU,IAAI,aAAa;IAG3B,QAAQ;IAGR,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IASxD,YAAY;IAGZ,aAAa;IAGb,QAAQ,CAAC,CAAC,EAAE,aAAa,GAAG,OAAO;IAanC,YAAY,CAAC,QAAQ,EAAE,YAAY;IA0DnC,YAAY;IAIZ,SAAS,CAAC,CAAC,EAAE,WAAW;IAGxB,KAAK,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,GAAG,iBAAiB;CAkDhE"}

package/lib/tree/nodes/sets/intervalNode.js

@@ -63,7 +63,11 @@ export class IntervalNodeConstructor {
         const res = [];
         for (let i = 0; i < nb; i++) {
             let interval;
+            let counter = 0;
             do {
+                counter++;
+                if (counter > 1000)
+                    throw new Error("should-throw Too many iterations in simplify");
                 interval = this.random();
             } while (res.some((int) => int.equals(interval)));
             res.push(this.random());
@@ -146,7 +150,11 @@ export class IntervalNode {
         if (isInfiniteNode(this.a) && isInfiniteNode(this.b))
             return this;
         let closure;
+        let counter = 0;
         do {
+            counter++;
+            if (counter > 1000)
+                throw new Error("should-throw Too many iterations in simplify");
             const left = isInfiniteNode(this.a) ? "]" : random(["[", "]"]);
             const right = isInfiniteNode(this.b)
                 ? "["

package/lib/tree/parsers/latexParser.js

@@ -355,8 +355,12 @@ const buildTreeForSameDepthTokens = (tokens) => {
                 tempTokens[i - 1] === "-") {
                 //faire la liste des - conéscutifs
                 let j = i + 1;
+                let counter = 0;
                 while (tempTokens[j] === "-" && j < tempTokens.length) {
                     j++;
+                    counter++;
+                    if (counter > 1000)
+                        throw Error("should-throw Too many iterations");
                 }
                 if (j === tempTokens.length)
                     throw Error("Nothing after minus");

package/lib/utils/alea/probaLawFlip.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"probaLawFlip.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/probaLawFlip.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,MAajD,CAAC"}
+{"version":3,"file":"probaLawFlip.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/probaLawFlip.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,eAAO,MAAM,YAAY,GAAI,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,MAgBjD,CAAC"}

package/lib/utils/alea/probaLawFlip.js

@@ -10,7 +10,11 @@ export const probaLawFlip = (arr) => {
     // const sorted = [...arr].sort((a, b) => b[1] - a[1]);
     let probaAcc = 0;
     let i = 0;
+    let counter = 0;
     while (i < arr.length - 1) {
+        counter++;
+        if (counter > 1000)
+            throw new Error("probaLawFlip too many iterations 1");
         probaAcc += arr[i][1];
         if (rand < probaAcc)
             return arr[i][0];

package/lib/utils/doWhile.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"doWhile.d.ts","sourceRoot":"","sources":["../../src/utils/doWhile.ts"],"names":[],"mappings":"AAAA,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,KAMrE"}
+{"version":3,"file":"doWhile.d.ts","sourceRoot":"","sources":["../../src/utils/doWhile.ts"],"names":[],"mappings":"AAAA,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,KASrE"}

package/lib/utils/doWhile.js

@@ -1,6 +1,10 @@
 export function doWhile(exec, whileTrue) {
     let res;
+    let counter = 0;
     do {
+        counter++;
+        if (counter > 1000)
+            throw new Error("too many iterations, doWhile");
         res = exec();
     } while (whileTrue(res));
     return res;

package/lib/utils/strings/randomLetter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"randomLetter.d.ts","sourceRoot":"","sources":["../../../src/utils/strings/randomLetter.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,YAAY,GACvB,QAAO,OAAe,EACtB,WAAU,MAAM,EAAO,WASxB,CAAC"}
+{"version":3,"file":"randomLetter.d.ts","sourceRoot":"","sources":["../../../src/utils/strings/randomLetter.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,YAAY,GACvB,QAAO,OAAe,EACtB,WAAU,MAAM,EAAO,WAYxB,CAAC"}

package/lib/utils/strings/randomLetter.js

@@ -1,6 +1,10 @@
 export const randomLetter = (isMaj = false, excludes = []) => {
     let letter = "";
+    let counter = 0;
     do {
+        counter++;
+        if (counter > 1000)
+            throw new Error("randomLetter too many iterations");
         letter = String.fromCharCode((isMaj ? 65 : 97) + Math.floor(Math.random() * 26));
     } while (excludes.includes(letter));
     return letter;

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "math-exercises",
   "type": "module",
-  "version": "3.0.121",
+  "version": "3.0.122",
   "description": "Math exercises generator for middle school and high school",
   "main": "lib/index.js",
   "files": [