math-exercises 2.0.0 → 2.0.2

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

@@ -7,21 +7,24 @@ const nombre_1 = require("../../../math/numbers/nombre");
 const real_1 = require("../../../math/numbers/reals/real");
 const randint_1 = require("../../../math/utils/random/randint");
 const round_1 = require("../../../math/utils/round");
+const infiniteNode_1 = require("../../../tree/nodes/numbers/infiniteNode");
+const numberNode_1 = require("../../../tree/nodes/numbers/numberNode");
+const intervalNode_1 = require("../../../tree/nodes/sets/intervalNode");
 const coinFlip_1 = require("../../../utils/coinFlip");
 const mathSet_1 = require("../mathSet");
 class IntervalConstructor {
     static random() {
-        let tex = '';
+        let tex = "";
         const randType = (0, randint_1.randint)(0, 6);
         let a, b;
         switch (randType) {
             case 0:
                 b = (0, randint_1.randint)(-10, 10);
-                tex = `]-\\infty;${b}${(0, coinFlip_1.coinFlip)() ? ']' : '['}`;
+                tex = `]-\\infty;${b}${(0, coinFlip_1.coinFlip)() ? "]" : "["}`;
                 break;
             case 1:
                 a = (0, randint_1.randint)(-10, 10);
-                tex = `${(0, coinFlip_1.coinFlip)() ? ']' : '['}${a};+\\infty[`;
+                tex = `${(0, coinFlip_1.coinFlip)() ? "]" : "["}${a};+\\infty[`;
                 break;
             case 2:
                 a = (0, randint_1.randint)(-10, 10);
@@ -59,64 +62,59 @@ class IntervalConstructor {
     }
 }
 exports.IntervalConstructor = IntervalConstructor;
-var BoundType;
-(function (BoundType) {
-    BoundType["OO"] = "]a;b[";
-    BoundType["OF"] = "]a;b]";
-    BoundType["FO"] = "[a;b[";
-    BoundType["FF"] = "[a;b]";
-})(BoundType || (BoundType = {}));
 class Interval {
     /**
      * [[a; b]] pour un interval d'integer;  [a;b] pour des réels
      */
-    constructor(tex = '[-10; 10]') {
-        if (!tex.includes(';'))
-            throw Error('wrong interval format');
+    constructor(tex = "[-10; 10]") {
+        if (!tex.includes(";"))
+            throw Error("wrong interval format");
         this.tex = tex;
-        const isInt = tex[1] === '[' || tex[1] === ']';
+        const isInt = tex[1] === "[" || tex[1] === "]";
         this.type = isInt ? nombre_1.NumberType.Integer : nombre_1.NumberType.Real;
         const left = tex[0];
         const right = tex[tex.length - 1];
-        const [a, b] = tex.slice(isInt ? 2 : 1, isInt ? tex.length - 2 : tex.length - 1).split(';');
+        const [a, b] = tex
+            .slice(isInt ? 2 : 1, isInt ? tex.length - 2 : tex.length - 1)
+            .split(";");
         this.minTex = a;
         this.maxTex = b;
         switch (`${left}a;b${right}`) {
-            case '[a;b]':
-                this.leftBracket = '[';
-                this.leftInequalitySymbol = '\\le';
-                this.rightInequalitySymbol = '\\le';
-                this.rightBracket = ']';
-                this.boundType = BoundType.FF;
+            case "[a;b]":
+                this.leftBracket = "[";
+                this.leftInequalitySymbol = "\\le";
+                this.rightInequalitySymbol = "\\le";
+                this.rightBracket = "]";
+                this.closure = intervalNode_1.ClosureType.FF;
                 break;
-            case ']a;b[':
-                this.leftBracket = ']';
-                this.rightBracket = '[';
-                this.leftInequalitySymbol = '<';
-                this.rightInequalitySymbol = '<';
-                this.boundType = BoundType.OO;
+            case "]a;b[":
+                this.leftBracket = "]";
+                this.rightBracket = "[";
+                this.leftInequalitySymbol = "<";
+                this.rightInequalitySymbol = "<";
+                this.closure = intervalNode_1.ClosureType.OO;
                 break;
-            case '[a;b[':
-                this.leftBracket = '[';
-                this.rightBracket = '[';
-                this.leftInequalitySymbol = '\\le';
-                this.rightInequalitySymbol = '<';
-                this.boundType = BoundType.FO;
+            case "[a;b[":
+                this.leftBracket = "[";
+                this.rightBracket = "[";
+                this.leftInequalitySymbol = "\\le";
+                this.rightInequalitySymbol = "<";
+                this.closure = intervalNode_1.ClosureType.FO;
                 break;
-            case ']a;b]':
-                this.leftBracket = ']';
-                this.rightBracket = ']';
-                this.leftInequalitySymbol = '<';
-                this.rightInequalitySymbol = '\\le';
-                this.boundType = BoundType.OF;
+            case "]a;b]":
+                this.leftBracket = "]";
+                this.rightBracket = "]";
+                this.leftInequalitySymbol = "<";
+                this.rightInequalitySymbol = "\\le";
+                this.closure = intervalNode_1.ClosureType.OF;
                 break;
             default:
-                throw console.error('wrong interval format');
+                throw console.error("wrong interval format");
         }
         function getBound(bound) {
-            return bound === '-\\infty'
+            return bound === "-\\infty"
                 ? Number.NEGATIVE_INFINITY
-                : bound === '+\\infty'
+                : bound === "+\\infty"
                     ? Number.POSITIVE_INFINITY
                     : Number(bound);
         }
@@ -127,16 +125,16 @@ class Interval {
         let unionRightBracket = this.max > interval.max
             ? this.rightBracket
             : this.max === interval.max
-                ? this.rightBracket === ']' || interval.rightBracket === ']'
-                    ? ']'
-                    : '['
+                ? this.rightBracket === "]" || interval.rightBracket === "]"
+                    ? "]"
+                    : "["
                 : interval.rightBracket;
         let unionLeftBracket = this.min < interval.min
             ? this.leftBracket
             : this.max === interval.max
-                ? this.leftBracket === '[' || interval.leftBracket === '['
-                    ? '['
-                    : ']'
+                ? this.leftBracket === "[" || interval.leftBracket === "["
+                    ? "["
+                    : "]"
                 : interval.leftBracket;
         let min = Math.min(this.min, interval.min);
         let minTex = this.min < interval.min ? this.minTex : interval.minTex;
@@ -144,11 +142,17 @@ class Interval {
         let maxTex = this.max > interval.max ? this.maxTex : interval.maxTex;
         if (this.max < interval.min ||
             this.min > interval.max ||
-            (this.max === interval.min && this.rightBracket === '[' && interval.leftBracket === ']') ||
-            (this.min === interval.max && this.leftBracket === ']' && interval.rightBracket === '[')) {
+            (this.max === interval.min &&
+                this.rightBracket === "[" &&
+                interval.leftBracket === "]") ||
+            (this.min === interval.max &&
+                this.leftBracket === "]" &&
+                interval.rightBracket === "[")) {
             const firstInterval = this.min < interval.min ? this : interval;
             const secondInterval = this.min < interval.min ? interval : this;
-            return new mathSet_1.MathSet(`${unionLeftBracket}${firstInterval.minTex};${firstInterval.maxTex}${firstInterval.rightBracket}\\cup${secondInterval.leftBracket}${secondInterval.minTex};${secondInterval.maxTex}${unionRightBracket}`, () => ((0, coinFlip_1.coinFlip)() ? firstInterval.getRandomElement() : secondInterval.getRandomElement()));
+            return new mathSet_1.MathSet(`${unionLeftBracket}${firstInterval.minTex};${firstInterval.maxTex}${firstInterval.rightBracket}\\cup${secondInterval.leftBracket}${secondInterval.minTex};${secondInterval.maxTex}${unionRightBracket}`, () => (0, coinFlip_1.coinFlip)()
+                ? firstInterval.getRandomElement()
+                : secondInterval.getRandomElement());
         }
         else {
             return new Interval(`${unionLeftBracket}${minTex};${maxTex}${unionRightBracket}`);
@@ -162,13 +166,14 @@ class Interval {
         //[a,b] n [c,d]
         const isDisjoint = b < c ||
             d < a ||
-            (b === c && (this.rightBracket === '[' || interval.leftBracket === ']')) ||
-            (a === d && (interval.rightBracket === '[' || this.leftBracket === ']'));
+            (b === c &&
+                (this.rightBracket === "[" || interval.leftBracket === "]")) ||
+            (a === d && (interval.rightBracket === "[" || this.leftBracket === "]"));
         if (isDisjoint) {
-            return new mathSet_1.MathSet('\\emptyset', () => null);
+            return new mathSet_1.MathSet("\\emptyset", () => null);
         }
-        const winningLeftBracket = (brack1, brack2) => (brack1 === ']' || brack2 === ']' ? ']' : '[');
-        const winningRightBracket = (brack1, brack2) => brack1 === '[' || brack2 === '[' ? '[' : ']';
+        const winningLeftBracket = (brack1, brack2) => brack1 === "]" || brack2 === "]" ? "]" : "[";
+        const winningRightBracket = (brack1, brack2) => brack1 === "[" || brack2 === "[" ? "[" : "]";
         let min = Math.max(a, c);
         let minTex = a >= c ? this.minTex : interval.minTex;
         let leftBracket = a === c
@@ -206,14 +211,14 @@ class Interval {
         return new mathSet_1.MathSet(this.toTex() + `\\ ${set.toTex()}`, rand);
     }
     insideToTex() {
-        return this.tex.replaceAll('[', '').replaceAll(']', '');
+        return this.tex.replaceAll("[", "").replaceAll("]", "");
     }
     toTex() {
         return `${this.leftBracket}${this.insideToTex()}${this.rightBracket}`;
     }
     toInequality() {
-        const isLeftClosed = this.boundType === BoundType.FO || this.boundType === BoundType.FF;
-        const isRightClosed = this.boundType === BoundType.FF || this.boundType === BoundType.OF;
+        const isLeftClosed = this.closure === intervalNode_1.ClosureType.FO || this.closure === intervalNode_1.ClosureType.FF;
+        const isRightClosed = this.closure === intervalNode_1.ClosureType.FF || this.closure === intervalNode_1.ClosureType.OF;
         if (this.max === Infinity) {
             if (isLeftClosed) {
                 return `x\\ge${this.min}`;
@@ -222,19 +227,23 @@ class Interval {
                 return `x>${this.min}`;
         }
         else if (this.min === -Infinity) {
-            if (this.boundType === BoundType.OF) {
+            if (this.closure === intervalNode_1.ClosureType.OF) {
                 return `x\\le${this.max}`;
             }
             else
                 return `x<${this.max}`;
         }
-        return `${this.min}${isLeftClosed ? '\\le x' : '<x'}${isRightClosed ? '\\le' : '<'}${this.max}`;
+        return `${this.min}${isLeftClosed ? "\\le x" : "<x"}${isRightClosed ? "\\le" : "<"}${this.max}`;
     }
     getRandomElement(precision = this.type === nombre_1.NumberType.Integer ? 0 : 2) {
         if (this.min === -Infinity || this.max === Infinity)
             throw Error("Can't chose amongst infinity");
-        let min = this.boundType === BoundType.OO || this.boundType === BoundType.OF ? this.min + epsilon_1.EPSILON : this.min;
-        let max = this.boundType === BoundType.OO || this.boundType === BoundType.FO ? this.max - epsilon_1.EPSILON : this.max;
+        let min = this.closure === intervalNode_1.ClosureType.OO || this.closure === intervalNode_1.ClosureType.OF
+            ? this.min + epsilon_1.EPSILON
+            : this.min;
+        let max = this.closure === intervalNode_1.ClosureType.OO || this.closure === intervalNode_1.ClosureType.FO
+            ? this.max - epsilon_1.EPSILON
+            : this.max;
         const value = (0, round_1.round)(min + Math.random() * (max - this.min), precision);
         switch (this.type) {
             case nombre_1.NumberType.Integer:
@@ -243,5 +252,10 @@ class Interval {
                 return new real_1.Real(value, value.toString());
         }
     }
+    toTree() {
+        const a = this.min === -Infinity ? infiniteNode_1.MinusInfinityNode : new numberNode_1.NumberNode(this.min);
+        const b = this.max === Infinity ? infiniteNode_1.PlusInfinityNode : new numberNode_1.NumberNode(this.max);
+        return new intervalNode_1.IntervalNode(a, b, this.closure);
+    }
 }
 exports.Interval = Interval;

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

@@ -1,11 +1,16 @@
-import { Node } from '../../tree/nodes/node';
+import { Node } from "../../tree/nodes/node";
+import { Integer } from "../numbers/integer/integer";
+import { Rational } from "../numbers/rationals/rational";
 export interface RemarkableValue {
+    angleValue: Integer | Rational;
     angle: Node;
     cos: Node;
     sin: Node;
 }
 export declare abstract class RemarkableValueConstructor {
     static mainInterval: () => RemarkableValue;
-    static simplifiable: () => RemarkableValue;
+    static simplifiable: () => RemarkableValue & {
+        index: number;
+    };
 }
 //# sourceMappingURL=remarkableValue.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"remarkableValue.d.ts","sourceRoot":"","sources":["../../../src/math/trigonometry/remarkableValue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAW7C,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,IAAI,CAAC;IACZ,GAAG,EAAE,IAAI,CAAC;IACV,GAAG,EAAE,IAAI,CAAC;CACX;AAED,8BAAsB,0BAA0B;IAC9C,MAAM,CAAC,YAAY,QAAO,eAAe,CAIvC;IAEF,MAAM,CAAC,YAAY,QAAO,eAAe,CASvC;CACH"}
+{"version":3,"file":"remarkableValue.d.ts","sourceRoot":"","sources":["../../../src/math/trigonometry/remarkableValue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAM7C,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAErD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAKzD,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,OAAO,GAAG,QAAQ,CAAC;IAC/B,KAAK,EAAE,IAAI,CAAC;IACZ,GAAG,EAAE,IAAI,CAAC;IACV,GAAG,EAAE,IAAI,CAAC;CACX;AAED,8BAAsB,0BAA0B;IAC9C,MAAM,CAAC,YAAY,QAAO,eAAe,CAIvC;IAEF,MAAM,CAAC,YAAY;eAAkC,MAAM;MAwBzD;CACH"}

package/lib/math/trigonometry/remarkableValue.js

@@ -3,10 +3,12 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.RemarkableValueConstructor = void 0;
 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 fractionNode_1 = require("../../tree/nodes/operators/fractionNode");
 const multiplyNode_1 = require("../../tree/nodes/operators/multiplyNode");
-const simplify_1 = require("../../tree/parsers/simplify");
 const random_1 = require("../../utils/random");
+const integer_1 = require("../numbers/integer/integer");
+const nombre_1 = require("../numbers/nombre");
+const rational_1 = require("../numbers/rationals/rational");
 const randint_1 = require("../utils/random/randint");
 const remarkableValues_1 = require("./remarkableValues");
 class RemarkableValueConstructor {
@@ -18,12 +20,21 @@ RemarkableValueConstructor.mainInterval = () => {
     // return new RemarkableValue(randValue.angle, randValue.cos, randValue.sin);
 };
 RemarkableValueConstructor.simplifiable = () => {
-    const randValue = (0, random_1.random)(remarkableValues_1.remarkableTrigoValues);
-    const toAdd = new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode((0, randint_1.randint)(-3, 4) * 2), piNode_1.PiNode);
-    const newAngle = (0, simplify_1.simplifyNode)(new addNode_1.AddNode(randValue.angle, toAdd));
+    const index = (0, randint_1.randint)(0, remarkableValues_1.remarkableTrigoValues.length);
+    const randValue = remarkableValues_1.remarkableTrigoValues[index];
+    const isInt = randValue.angleValue.type === nombre_1.NumberType.Integer;
+    const toAdd = (0, randint_1.randint)(-3, 4) * 2;
+    const newRadian = isInt
+        ? new integer_1.Integer(randValue.angleValue.value + toAdd)
+        : new rational_1.Rational(randValue.angleValue.num, randValue.angleValue.denum).add(new integer_1.Integer(toAdd));
+    const newAngle = isInt
+        ? new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(newRadian.value), piNode_1.PiNode)
+        : new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(newRadian.num), piNode_1.PiNode), new numberNode_1.NumberNode(newRadian.denum));
     return {
+        angleValue: newRadian,
         angle: newAngle,
         cos: randValue.cos,
         sin: randValue.sin,
+        index,
     };
 };

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

@@ -1,3 +1,3 @@
-import { RemarkableValue } from './remarkableValue';
+import { RemarkableValue } from "./remarkableValue";
 export declare const remarkableTrigoValues: 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":"AAMA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,eAAO,MAAM,qBAAqB,EAAE,eAAe,EA8ClD,CAAC"}
+{"version":3,"file":"remarkableValues.d.ts","sourceRoot":"","sources":["../../../src/math/trigonometry/remarkableValues.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAEpD,eAAO,MAAM,qBAAqB,EAAE,eAAe,EA+ElD,CAAC"}

package/lib/math/trigonometry/remarkableValues.js

@@ -7,48 +7,59 @@ 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");
+const integer_1 = require("../numbers/integer/integer");
+const rational_1 = require("../numbers/rationals/rational");
 exports.remarkableTrigoValues = [
     {
+        angleValue: new integer_1.Integer(0),
         angle: new numberNode_1.NumberNode(0),
         cos: new numberNode_1.NumberNode(1),
         sin: new numberNode_1.NumberNode(0),
     },
     {
+        angleValue: new rational_1.Rational(1, 6),
         angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(6)),
         cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
         sin: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2)),
     },
     {
+        angleValue: new rational_1.Rational(1, 4),
         angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(4)),
         cos: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
         sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
     },
     {
+        angleValue: new rational_1.Rational(1, 3),
         angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(3)),
         cos: new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2)),
         sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
     },
     {
+        angleValue: new rational_1.Rational(1, 2),
         angle: new fractionNode_1.FractionNode(piNode_1.PiNode, new numberNode_1.NumberNode(2)),
         cos: new numberNode_1.NumberNode(0),
         sin: new numberNode_1.NumberNode(1),
     },
     {
+        angleValue: new rational_1.Rational(2, 3),
         angle: new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), piNode_1.PiNode), new numberNode_1.NumberNode(3)),
         cos: new oppositeNode_1.OppositeNode(new fractionNode_1.FractionNode(new numberNode_1.NumberNode(1), new numberNode_1.NumberNode(2))),
         sin: new fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(3)), new numberNode_1.NumberNode(2)),
     },
     {
+        angleValue: new rational_1.Rational(3, 4),
         angle: new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(3), piNode_1.PiNode), new numberNode_1.NumberNode(4)),
         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 fractionNode_1.FractionNode(new sqrtNode_1.SqrtNode(new numberNode_1.NumberNode(2)), new numberNode_1.NumberNode(2)),
     },
     {
+        angleValue: new rational_1.Rational(5, 6),
         angle: new fractionNode_1.FractionNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(5), piNode_1.PiNode), new numberNode_1.NumberNode(6)),
         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))),
     },
     {
+        angleValue: new integer_1.Integer(1),
         angle: piNode_1.PiNode,
         cos: new numberNode_1.NumberNode(-1),
         sin: new numberNode_1.NumberNode(0),

package/lib/math/utils/latex/frenchify.d.ts

@@ -1,2 +1,2 @@
-export declare const frenchify: (s: string) => string;
+export declare const frenchify: (s: string | number) => string;
 //# sourceMappingURL=frenchify.d.ts.map

package/lib/math/utils/latex/frenchify.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"frenchify.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/latex/frenchify.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,SAAS,MAAO,MAAM,WAElC,CAAC"}
+{"version":3,"file":"frenchify.d.ts","sourceRoot":"","sources":["../../../../src/math/utils/latex/frenchify.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,SAAS,MAAO,MAAM,GAAG,MAAM,WAG3C,CAAC"}

package/lib/math/utils/latex/frenchify.js

@@ -2,6 +2,8 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.frenchify = void 0;
 const frenchify = (s) => {
-    return s.replace('.', ',');
+    if (typeof s === "number")
+        return s.toString().replace(".", ",");
+    return s.replace(".", ",");
 };
 exports.frenchify = frenchify;

package/lib/server.d.ts

@@ -1,2 +1,3 @@
-export {};
+import * as Exercises from "./exercises";
+export { Exercises };
 //# sourceMappingURL=server.d.ts.map

package/lib/server.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":""}
+{"version":3,"file":"server.d.ts","sourceRoot":"","sources":["../src/server.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,SAAS,MAAM,aAAa,CAAC;AAGzC,OAAO,EAAE,SAAS,EAAE,CAAC"}

package/lib/server.js

@@ -1,64 +1,108 @@
 "use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-const exercises_1 = require("./exercises/exercises");
+exports.Exercises = void 0;
+// import { exercises } from "./exercises";
+const Exercises = __importStar(require("./exercises"));
+exports.Exercises = Exercises;
+const exercises = Object.values(Exercises);
 const express_1 = __importDefault(require("express"));
 const body_parser_1 = __importDefault(require("body-parser"));
 const dotenv_1 = __importDefault(require("dotenv"));
 const cors_1 = __importDefault(require("cors"));
+const rational_1 = require("./math/numbers/rationals/rational");
+const multiplyNode_1 = require("./tree/nodes/operators/multiplyNode");
+const numberNode_1 = require("./tree/nodes/numbers/numberNode");
+const oppositeNode_1 = require("./tree/nodes/functions/oppositeNode");
 const jsonParser = body_parser_1.default.json();
-const allExercises = [...exercises_1.exercises];
+const allExercises = [...exercises];
 const runServer = () => {
     dotenv_1.default.config();
     const app = (0, express_1.default)();
     app.use((0, cors_1.default)());
-    app.get('/', (req, res) => {
+    const frac = new rational_1.Rational(-2, 3).simplify().toTree();
+    console.log(frac.toAllValidTexs());
+    const prod = new oppositeNode_1.OppositeNode(new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(2), new numberNode_1.NumberNode(3)));
+    console.log(prod.toAllValidTexs());
+    console.log(exercises.length);
+    app.get("/", (req, res) => {
         res.json(allExercises);
     });
-    app.get('/exo', (req, res) => {
+    app.get("/exo", (req, res) => {
         const exoId = req.query.exoId;
         const exoIndex = allExercises.findIndex((exo) => exo.id == exoId);
         const exo = allExercises[exoIndex];
         if (!exo)
-            res.send('Exo not found');
+            res.send("Exo not found");
         const questions = exo?.generator(10);
         res.json({
             exercise: exo,
             questions,
             nextId: allExercises[(exoIndex + 1) % allExercises.length].id,
-            prevId: allExercises[(exoIndex - 1 + allExercises.length) % allExercises.length].id,
+            prevId: allExercises[(exoIndex - 1 + allExercises.length) % allExercises.length]
+                .id,
         });
     });
-    app.get('/qcmExo', (req, res) => {
+    app.get("/qcmExo", (req, res) => {
         const exoId = req.query.exoId;
         const exoIndex = allExercises.findIndex((exo) => exo.id == exoId);
         const exo = allExercises[exoIndex];
         if (!exo)
-            res.send('Exo not found');
+            res.send("Exo not found");
         const questions = exo?.generator(10);
         const populatedQuestions = questions?.map((q) => {
-            return { ...q, propositions: exo.getPropositions?.(4, q.qcmGeneratorProps) };
+            return {
+                ...q,
+                propositions: exo.getPropositions?.(4, {
+                    answer: q.answer,
+                    ...q.identifiers,
+                }),
+            };
         });
         res.json({
             exercise: exo,
             questions: populatedQuestions,
             nextId: allExercises[(exoIndex + 1) % allExercises.length].id,
-            prevId: allExercises[(exoIndex - 1 + allExercises.length) % allExercises.length].id,
+            prevId: allExercises[(exoIndex - 1 + allExercises.length) % allExercises.length]
+                .id,
         });
     });
-    app.post('/vea', jsonParser, (req, res) => {
+    app.post("/vea", jsonParser, (req, res) => {
         const exoId = req.query.exoId;
         const { ans, veaProps } = req.body;
         const exoIndex = allExercises.findIndex((exo) => exo.id == exoId);
         const exo = allExercises[exoIndex];
         if (!exo) {
-            res.send('Exo not found');
+            res.send("Exo not found");
             return;
         }
         if (!exo.isAnswerValid) {
-            res.send('No VEA implemented');
+            res.send("No VEA implemented");
             return;
         }
         const result = exo.isAnswerValid(ans, veaProps) ?? false;
@@ -66,7 +110,7 @@ const runServer = () => {
             result,
         });
     });
-    app.listen('5000', () => {
+    app.listen("5000", () => {
         console.log(`[server]: Server is running at http://localhost:5000`);
     });
 };

package/lib/tree/nodes/algebraicNode.d.ts

@@ -0,0 +1,4 @@
+import { Node } from "./node";
+export interface AlgebraicNode extends Node {
+}
+//# sourceMappingURL=algebraicNode.d.ts.map

package/lib/tree/nodes/algebraicNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"algebraicNode.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/algebraicNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,MAAM,WAAW,aAAc,SAAQ,IAAI;CAE1C"}

package/lib/tree/nodes/algebraicNode.js

@@ -0,0 +1,5 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//tous les operators et function
+// tous les externals (number, variable, constant, length)
+//implémenter les opérations add, substract, divide, power etc

package/lib/tree/nodes/complex/complexNode.d.ts

@@ -1,17 +1,14 @@
-import { Node, NodeType } from '../node';
-import { Complex } from '../../../math/complex/complex';
+import { Node, NodeOptions, NodeType } from "../node";
 export declare class ComplexNode implements Node {
-    tex: string;
-    mathString: string;
-    re: number;
-    im: number;
+    re: Node;
+    im: Node;
+    opts?: NodeOptions;
     type: NodeType;
-    constructor(re: number, im: number, tex?: string, mathString?: string);
-    toEquivalentNodes(): Node[];
-    toAllValidTexs(): string[];
+    constructor(re: Node, im: Node, opts?: NodeOptions);
+    toEquivalentNodes(opts?: NodeOptions): Node[];
+    toAllValidTexs(opts?: NodeOptions): string[];
     toMathString(): string;
     toTex(): string;
     toMathjs(): import("mathjs").Complex;
-    toComplex(): Complex;
 }
 //# sourceMappingURL=complexNode.d.ts.map

package/lib/tree/nodes/complex/complexNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"complexNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/complex/complexNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,OAAO,EAAE,MAAM,4BAA4B,CAAC;AAOrD,qBAAa,WAAY,YAAW,IAAI;IACtC,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAmB;gBAErB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAwBrE,iBAAiB,IAAI,IAAI,EAAE;IAqB3B,cAAc,IAAI,MAAM,EAAE;IAG1B,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,SAAS;CAGV"}
+{"version":3,"file":"complexNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/complex/complexNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAQtD,qBAAa,WAAY,YAAW,IAAI;IACtC,EAAE,EAAE,IAAI,CAAC;IACT,EAAE,EAAE,IAAI,CAAC;IACT,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAmB;gBAErB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,WAAW;IAKlD,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,EAAE;IAkB7C,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAI5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAWf,QAAQ;CAMT"}