math-exercises 2.2.26 → 2.2.28

package/lib/math/sets/discreteSet.d.ts

@@ -1,5 +1,5 @@
-import { Nombre } from '../numbers/nombre';
-import { MathSetInterface } from './mathSetInterface';
+import { Nombre } from "../numbers/nombre";
+import { MathSetInterface } from "./mathSetInterface";
 export declare class DiscreteSet implements MathSetInterface {
     elements: Nombre[];
     tex: string;

package/lib/math/sets/discreteSet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"discreteSet.d.ts","sourceRoot":"","sources":["../../../src/math/sets/discreteSet.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,qBAAa,WAAY,YAAW,gBAAgB;IAClD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;gBACA,QAAQ,EAAE,MAAM,EAAE;IAW9B,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI7B,gBAAgB,IAAI,MAAM;CAG3B"}
+{"version":3,"file":"discreteSet.d.ts","sourceRoot":"","sources":["../../../src/math/sets/discreteSet.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,qBAAa,WAAY,YAAW,gBAAgB;IAClD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,GAAG,EAAE,MAAM,CAAC;gBACA,QAAQ,EAAE,MAAM,EAAE;IAW9B,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAM7B,gBAAgB,IAAI,MAAM;CAG3B"}

package/lib/math/sets/discreteSet.js

@@ -1,17 +1,17 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DiscreteSet = void 0;
-const random_1 = require("../../utils/random");
+const random_1 = require("../../utils/alea/random");
 class DiscreteSet {
     constructor(elements) {
         this.elements = Array.from(new Set(elements));
-        let tex = '\\{';
+        let tex = "\\{";
         this.elements.forEach((el, index) => {
             tex += el.tex;
             if (index < this.elements.length - 1)
-                tex += ';';
+                tex += ";";
             else
-                tex += '\\}';
+                tex += "\\}";
         });
         this.tex = tex;
     }

package/lib/math/sets/intervals/intervals.js

@@ -6,7 +6,7 @@ const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
 const closure_1 = require("../../../tree/nodes/sets/closure");
 const discreteSetNode_1 = require("../../../tree/nodes/sets/discreteSetNode");
 const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
+const coinFlip_1 = require("../../../utils/alea/coinFlip");
 const mathSet_1 = require("../mathSet");
 class IntervalConstructor {
     static random() {

package/lib/math/trigonometry/remarkableValue.js

@@ -5,7 +5,7 @@ const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const piNode_1 = require("../../tree/nodes/numbers/piNode");
 const addNode_1 = require("../../tree/nodes/operators/addNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const random_1 = require("../../utils/random");
+const random_1 = require("../../utils/alea/random");
 const randint_1 = require("../utils/random/randint");
 const remarkableValues_1 = require("./remarkableValues");
 class RemarkableValueConstructor {

package/lib/math/trigonometry/remarkableValues.d.ts

@@ -7,5 +7,8 @@ export interface RemarkableValue {
     tan: AlgebraicNode;
     point: string;
 }
+export declare const negativeMainTrigovalues: RemarkableValue[];
 export declare const remarkableTrigoValues: RemarkableValue[];
+export declare const mainTrigoValues: RemarkableValue[];
+export declare const mainPositiveTrigovalues: RemarkableValue[];
 //# sourceMappingURL=remarkableValues.d.ts.map

package/lib/math/trigonometry/remarkableValues.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"remarkableValues.d.ts","sourceRoot":"","sources":["../../../src/math/trigonometry/remarkableValues.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAQ/D,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,aAAa,CAAC;IACrB,GAAG,EAAE,aAAa,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,aAAa,CAAC;IACnB,GAAG,EAAE,aAAa,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,eAAO,MAAM,qBAAqB,EAAE,eAAe,EA2LlD,CAAC"}
+{"version":3,"file":"remarkableValues.d.ts","sourceRoot":"","sources":["../../../src/math/trigonometry/remarkableValues.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAQ/D,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,aAAa,CAAC;IACrB,GAAG,EAAE,aAAa,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,GAAG,EAAE,aAAa,CAAC;IACnB,GAAG,EAAE,aAAa,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,eAAO,MAAM,uBAAuB,EAAE,eAAe,EAoGpD,CAAC;AAEF,eAAO,MAAM,qBAAqB,EAAE,eAAe,EA2LlD,CAAC;AAEF,eAAO,MAAM,eAAe,mBAG3B,CAAC;AAEF,eAAO,MAAM,uBAAuB,mBAAoC,CAAC"}

package/lib/math/trigonometry/remarkableValues.js

@@ -1,12 +1,78 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.remarkableTrigoValues = void 0;
+exports.mainPositiveTrigovalues = exports.mainTrigoValues = exports.remarkableTrigoValues = exports.negativeMainTrigovalues = void 0;
 const oppositeNode_1 = require("../../tree/nodes/functions/oppositeNode");
 const sqrtNode_1 = require("../../tree/nodes/functions/sqrtNode");
 const numberNode_1 = require("../../tree/nodes/numbers/numberNode");
 const piNode_1 = require("../../tree/nodes/numbers/piNode");
 const fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
+exports.negativeMainTrigovalues = [
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(5), piNode_1.PiNode), new numberNode_1.NumberNode(6))),
+        degree: 210,
+        cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2))),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2))),
+        tan: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3))),
+        point: "H",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(3), piNode_1.PiNode), new numberNode_1.NumberNode(4))),
+        degree: 225,
+        cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2))),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2))),
+        tan: new numberNode_1.NumberNode(1),
+        point: "K",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), piNode_1.PiNode), new numberNode_1.NumberNode(3))),
+        degree: 240,
+        cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2))),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2))),
+        tan: new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)),
+        point: "L",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(2))),
+        degree: 270,
+        cos: new numberNode_1.NumberNode(0),
+        sin: new numberNode_1.NumberNode(-1),
+        tan: new numberNode_1.NumberNode(Infinity),
+        point: "M",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(3))),
+        degree: 300,
+        cos: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2)),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2))),
+        tan: new oppositeNode_1.OppositeNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3))),
+        point: "N",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(4))),
+        degree: 315,
+        cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2))),
+        tan: new oppositeNode_1.OppositeNode(new numberNode_1.NumberNode(1)),
+        point: "P",
+    },
+    {
+        angle: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(6))),
+        degree: 330,
+        cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
+        sin: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2))),
+        tan: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)))),
+        point: "Q",
+    },
+    {
+        angle: new numberNode_1.NumberNode(0),
+        degree: 0,
+        cos: new numberNode_1.NumberNode(1),
+        sin: new numberNode_1.NumberNode(0),
+        tan: new numberNode_1.NumberNode(0),
+        point: "I",
+    },
+];
 exports.remarkableTrigoValues = [
     {
         angle: new numberNode_1.NumberNode(0),
@@ -137,3 +203,8 @@ exports.remarkableTrigoValues = [
         point: "Q",
     },
 ];
+exports.mainTrigoValues = [
+    ...exports.negativeMainTrigovalues,
+    ...exports.remarkableTrigoValues.slice(1).slice(0, 8),
+];
+exports.mainPositiveTrigovalues = exports.remarkableTrigoValues.slice(0, 9);

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

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.distinctRandTupleInt = exports.randTupleInt = void 0;
-const arrayEqual_1 = require("../../../utils/arrayEqual");
+const arrayEqual_1 = require("../../../utils/arrays/arrayEqual");
 const randint_1 = require("./randint");
 /**
  * @param size tuple length

package/lib/playground.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AAsBA,eAAO,MAAM,UAAU,YAWtB,CAAC"}
+{"version":3,"file":"playground.d.ts","sourceRoot":"","sources":["../src/playground.ts"],"names":[],"mappings":"AA4BA,eAAO,MAAM,UAAU,YAEtB,CAAC"}

package/lib/playground.js

@@ -2,15 +2,6 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.playground = void 0;
 const playground = () => {
-    // const affine1 = new Affine(4, 5);
-    // const affine2 = new Affine(2, 3);
-    // const tree = affine1.toTree({ toTexOptions: { color: "green" } });
-    // console.log(tree.opts);
-    // console.log(tree.toTex());
-    // const node = new MultiplyNode(
-    //   affine1.toTree({ toTexOptions: { color: "green" } }),
-    //   new (coinFlip() ? SubstractNode : AddNode)(affine2.toTree(), (1).toTree()),
-    // ).toTex();
-    // console.log(node);
+    // console.log(mainTrigoValues.map((e) => e.angle.toTex()));
 };
 exports.playground = playground;

package/lib/tree/nodes/equations/multiEqualNode.js

@@ -2,8 +2,8 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MultiEqualNode = void 0;
 const node_1 = require("../node");
-const permutations_1 = require("../../../utils/permutations");
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const permutations_1 = require("../../../utils/arrays/permutations");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 class MultiEqualNode {
     constructor(children, opts) {
         this.children = children;

package/lib/tree/nodes/geometry/degree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"degree.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/geometry/degree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AAED,qBAAa,UAAW,YAAW,aAAa;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAmB;IACjC,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAO5D,aAAa;;;;IAMb,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAOd,iBAAiB;IAGjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAG3B"}
+{"version":3,"file":"degree.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/geometry/degree.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AAED,qBAAa,UAAW,YAAW,aAAa;IAC9C,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAmB;IACjC,SAAS,EAAE,OAAO,CAAC;gBACP,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAO5D,aAAa;;;;IAMb,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAQd,iBAAiB;IAGjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAGrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAG3B"}

package/lib/tree/nodes/geometry/degree.js

@@ -11,8 +11,8 @@ class DegreeNode {
         this.type = node_1.NodeType.number;
         this.value = value;
         this.tex =
-            (tex?.replace(".", ",") || (value + "").replace(".", ",")) + `^\\circ`;
-        this.mathString = mathString || this.value + "^\\circ";
+            (tex?.replace(".", ",") || (value + "").replace(".", ",")) + `^{\\circ}`;
+        this.mathString = mathString || this.value + "^\\{\\circ\\}";
         this.isNumeric = true;
     }
     toIdentifiers() {
@@ -33,6 +33,7 @@ class DegreeNode {
     toAllValidTexs() {
         const res = [];
         res.push(this.tex);
+        res.push(this.value.frenchify());
         //!est-ce vraiment nécessaire sachant que les inputs students n'auront en théorie jamais de "."
         if (this.tex.includes(","))
             res.push(this.tex.replace(",", "."));

package/lib/tree/nodes/geometry/pointNode.js

@@ -2,7 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.PointNode = void 0;
 const point_1 = require("../../../math/geometry/point");
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 const node_1 = require("../node");
 class PointNode {
     constructor(point, opts) {

package/lib/tree/nodes/inequations/inequationNode.js

@@ -2,7 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.InequationNode = void 0;
 const inequation_1 = require("../../../math/inequations/inequation");
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 const isLetter_1 = require("../../../utils/strings/isLetter");
 const node_1 = require("../node");
 const infiniteNode_1 = require("../numbers/infiniteNode");

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

@@ -4,9 +4,9 @@ exports.AddNode = exports.isAddNode = void 0;
 // import { add } from "mathjs";
 const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const permutations_1 = require("../../../utils/permutations");
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const coinFlip_1 = require("../../../utils/alea/coinFlip");
+const permutations_1 = require("../../../utils/arrays/permutations");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 const operatorComposition_1 = require("../../../tree/utilities/operatorComposition");
 const substractNode_1 = require("./substractNode");
 const oppositeNode_1 = require("../functions/oppositeNode");

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

@@ -4,7 +4,7 @@ exports.DivideNode = exports.isDivideNode = void 0;
 // import { divide } from "mathjs";
 const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
+const coinFlip_1 = require("../../../utils/alea/coinFlip");
 function isDivideNode(a) {
     return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.divide;
 }

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

@@ -4,9 +4,9 @@ exports.MultiplyNode = exports.sortMultiplyNodes = exports.isMultiplyNode = void
 // import { multiply } from "mathjs";
 const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
-const permutations_1 = require("../../../utils/permutations");
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const coinFlip_1 = require("../../../utils/alea/coinFlip");
+const permutations_1 = require("../../../utils/arrays/permutations");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 const operatorComposition_1 = require("../../../tree/utilities/operatorComposition");
 const powerNode_1 = require("./powerNode");
 const numberNode_1 = require("../numbers/numberNode");

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

@@ -6,7 +6,7 @@ const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
 const oppositeNode_1 = require("../functions/oppositeNode");
 const addNode_1 = require("./addNode");
-const coinFlip_1 = require("../../../utils/coinFlip");
+const coinFlip_1 = require("../../../utils/alea/coinFlip");
 const colorize_1 = require("../../../utils/latex/colorize");
 function isSubstractNode(a) {
     return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.substract;

package/lib/tree/nodes/sets/discreteSetNode.d.ts

@@ -20,6 +20,7 @@ export declare class DiscreteSetNode implements SetNode {
     toMathString(): string;
     toMathjs(): string;
     toTex(): string;
+    toDeleteRandomElement(): DiscreteSetNode;
 }
 export declare const EmptySet: DiscreteSetNode;
 //# sourceMappingURL=discreteSetNode.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,eAAe,CAE/D;AACD,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAOhD,UAAU;IAGV,cAAc;IAGd,aAAa;;;;;;IAMb,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAMN;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}
+{"version":3,"file":"discreteSetNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/sets/discreteSetNode.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,MAAM,EAAE,OAAO,EAAa,MAAM,WAAW,CAAC;AACvD,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,eAAe,CAE/D;AACD,qBAAa,eAAgB,YAAW,OAAO;IAC7C,IAAI,EAAE,QAAQ,CAAC;IACf,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS,CAAC;IAC/B,QAAQ,EAAE,IAAI,EAAE,CAAC;IACjB,OAAO,EAAE,OAAO,CAAC;gBACL,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAOhD,UAAU;IAGV,cAAc;IAGd,aAAa;;;;;;IAMb,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAyBpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;IAOL,qBAAqB;CAMtB;AAED,eAAO,MAAM,QAAQ,iBAA0B,CAAC"}

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

@@ -1,8 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.EmptySet = exports.DiscreteSetNode = exports.isDiscreteSetNode = void 0;
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
-const permutations_1 = require("../../../utils/permutations");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
+const permutations_1 = require("../../../utils/arrays/permutations");
 const node_1 = require("../node");
 const setNode_1 = require("./setNode");
 function isDiscreteSetNode(a) {
@@ -65,6 +65,12 @@ class DiscreteSetNode {
             .map((el) => el.toTex())
             .join(";")}\\right\\}`;
     }
+    toDeleteRandomElement() {
+        const index = Math.floor(Math.random() * this.elements.length);
+        const newElements = [...this.elements];
+        newElements.splice(index, 1);
+        return new DiscreteSetNode(newElements);
+    }
 }
 exports.DiscreteSetNode = DiscreteSetNode;
 exports.EmptySet = new DiscreteSetNode([]);

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

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.IntervalNode = exports.isIntervalNode = void 0;
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
 const inequationNode_1 = require("../inequations/inequationNode");
 const node_1 = require("../node");
 const constantNode_1 = require("../numbers/constantNode");

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

@@ -1,8 +1,8 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.UnionIntervalNode = exports.UnionIntervalNodeBuilder = exports.isUnionIntervalNode = void 0;
-const cartesianProducts_1 = require("../../../utils/cartesianProducts");
-const permutations_1 = require("../../../utils/permutations");
+const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
+const permutations_1 = require("../../../utils/arrays/permutations");
 const node_1 = require("../node");
 const infiniteNode_1 = require("../numbers/infiniteNode");
 const closure_1 = require("./closure");

package/lib/tree/parsers/euroParser.d.ts

@@ -0,0 +1,2 @@
+export declare const euroParser: (ans: string, allowNoEuroSign?: boolean) => string | false;
+//# sourceMappingURL=euroParser.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"euroParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/euroParser.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,UAAU,QAAS,MAAM,8CAKrC,CAAC"}

package/lib/tree/parsers/euroParser.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.euroParser = void 0;
+const euroParser = (ans, allowNoEuroSign = true) => {
+    if (!allowNoEuroSign && !ans.includes("€"))
+        return false;
+    const nb = ans.replace("€", "").unfrenchify();
+    if (isNaN(nb))
+        return false;
+    return nb.frenchify() + "€";
+};
+exports.euroParser = euroParser;

package/lib/tree/parsers/percentParser.d.ts

@@ -1 +1,2 @@
+export declare const percentParser: (ans: string, allowNoPercentSign?: boolean) => string | false;
 //# sourceMappingURL=percentParser.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"percentParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/percentParser.ts"],"names":[],"mappings":""}
+{"version":3,"file":"percentParser.d.ts","sourceRoot":"","sources":["../../../src/tree/parsers/percentParser.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,aAAa,QAAS,MAAM,iDAKxC,CAAC"}

package/lib/tree/parsers/percentParser.js

@@ -1 +1,12 @@
 "use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.percentParser = void 0;
+const percentParser = (ans, allowNoPercentSign = true) => {
+    if (!allowNoPercentSign && !ans.includes("\\%"))
+        return false;
+    const nb = ans.replace("\\%", "").unfrenchify();
+    if (isNaN(nb))
+        return false;
+    return nb.frenchify() + "\\%";
+};
+exports.percentParser = percentParser;

package/lib/utils/alea/coinFlip.d.ts

@@ -0,0 +1,2 @@
+export declare const coinFlip: () => boolean;
+//# sourceMappingURL=coinFlip.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"coinFlip.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/coinFlip.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,QAAQ,QAAO,OAE3B,CAAC"}

package/lib/utils/alea/coinFlip.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.coinFlip = void 0;
+const coinFlip = () => {
+    return Math.random() < 0.5;
+};
+exports.coinFlip = coinFlip;

package/lib/utils/alea/diceFlip.d.ts

@@ -0,0 +1,2 @@
+export declare const diceFlip: (faces: number) => number;
+//# sourceMappingURL=diceFlip.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"diceFlip.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/diceFlip.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,QAAQ,UAAW,MAAM,WAErC,CAAC"}

package/lib/utils/alea/diceFlip.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.diceFlip = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const diceFlip = (faces) => {
+    return (0, randint_1.randint)(1, faces + 1);
+};
+exports.diceFlip = diceFlip;

package/lib/utils/alea/probaFlip.d.ts

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param n
+ * @returns true iff random < n
+ */
+export declare const probaFlip: (n: number) => boolean;
+//# sourceMappingURL=probaFlip.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"probaFlip.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/probaFlip.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,eAAO,MAAM,SAAS,MAAO,MAAM,YAElC,CAAC"}

package/lib/utils/alea/probaFlip.js

@@ -0,0 +1,12 @@
+"use strict";
+/**
+ *
+ * @param n
+ * @returns true iff random < n
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.probaFlip = void 0;
+const probaFlip = (n) => {
+    return Math.random() < n;
+};
+exports.probaFlip = probaFlip;

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

@@ -0,0 +1,7 @@
+/**
+ *
+ * @param arr [T, proba]
+ * @returns element T_i with proba p_i
+ */
+export declare const probaLawFlip: <T>(arr: [T, number][]) => T;
+//# sourceMappingURL=probaLawFlip.d.ts.map

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

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

package/lib/utils/alea/probaLawFlip.js

@@ -0,0 +1,24 @@
+"use strict";
+/**
+ *
+ * @param arr [T, proba]
+ * @returns element T_i with proba p_i
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.probaLawFlip = void 0;
+const probaLawFlip = (arr) => {
+    if (Math.abs(arr.reduce((acc, curr) => (acc += curr[1]), 0) - 1) > 0.1)
+        throw Error("proba law does not add up t 1");
+    const rand = Math.random();
+    const sorted = [...arr].sort((a, b) => b[1] - a[1]);
+    let probaAcc = 0;
+    let i = 0;
+    while (i < arr.length - 1) {
+        probaAcc += sorted[i][1];
+        if (rand < probaAcc)
+            return arr[i][0];
+        i++;
+    }
+    return arr[arr.length - 1][0];
+};
+exports.probaLawFlip = probaLawFlip;

package/lib/utils/alea/random.d.ts

@@ -0,0 +1,2 @@
+export declare function random<t>(array: t[]): t;
+//# sourceMappingURL=random.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"random.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/random.ts"],"names":[],"mappings":"AAAA,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAEnC"}

package/lib/utils/alea/random.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.random = void 0;
+function random(array) {
+    return array[Math.floor(Math.random() * array.length)];
+}
+exports.random = random;

package/lib/utils/alea/randomEnumValue.d.ts

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"randomEnumValue.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/randomEnumValue.ts"],"names":[],"mappings":"AAEA,eAAO,MAAM,eAAe,MAAO,GAAG,QAGrC,CAAC"}

package/lib/utils/alea/randomEnumValue.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.randomEnumValue = void 0;
+const randint_1 = require("../../math/utils/random/randint");
+const randomEnumValue = (e) => {
+    const randIndex = (0, randint_1.randint)(0, Object.keys(e).length / 2);
+    return e[randIndex];
+};
+exports.randomEnumValue = randomEnumValue;

package/lib/utils/alea/shuffle.d.ts

@@ -0,0 +1,2 @@
+export declare function shuffle<T>(array: T[]): T[];
+//# sourceMappingURL=shuffle.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"shuffle.d.ts","sourceRoot":"","sources":["../../../src/utils/alea/shuffle.ts"],"names":[],"mappings":"AACA,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAS1C"}

package/lib/utils/alea/shuffle.js

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

package/lib/utils/arrays/arrayEqual.d.ts

@@ -0,0 +1,2 @@
+export declare function arrayEqual<T>(arr1: T[], arr2: T[]): boolean;
+//# sourceMappingURL=arrayEqual.d.ts.map

package/lib/utils/arrays/arrayEqual.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayEqual.d.ts","sourceRoot":"","sources":["../../../src/utils/arrays/arrayEqual.ts"],"names":[],"mappings":"AAAA,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,OAAO,CAM3D"}

package/lib/utils/arrays/arrayEqual.js

@@ -0,0 +1,13 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayEqual = void 0;
+function arrayEqual(arr1, arr2) {
+    if (arr1.length !== arr2.length)
+        return false;
+    for (let i = 0; i < arr1.length; i++) {
+        if (arr1[i] !== arr2[i])
+            return false;
+    }
+    return true;
+}
+exports.arrayEqual = arrayEqual;

package/lib/utils/arrays/arrayHasSameElement.d.ts

@@ -0,0 +1,2 @@
+export declare function arrayHasSameElements<E>(arr1: E[], arr2: E[]): boolean;
+//# sourceMappingURL=arrayHasSameElement.d.ts.map

package/lib/utils/arrays/arrayHasSameElement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrayHasSameElement.d.ts","sourceRoot":"","sources":["../../../src/utils/arrays/arrayHasSameElement.ts"],"names":[],"mappings":"AAAA,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,OAAO,CAKrE"}

package/lib/utils/arrays/arrayHasSameElement.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayHasSameElements = void 0;
+function arrayHasSameElements(arr1, arr2) {
+    return (arr1.length === arr2.length &&
+        arr1.every((element) => arr2.includes(element)));
+}
+exports.arrayHasSameElements = arrayHasSameElements;