math-exercises 2.0.9 → 2.0.11

package/lib/tree/nodes/numbers/numberNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"numberNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/numberNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,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,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":"numberNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/numberNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AAED,8BAAsB,qBAAqB;IACzC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAM,EAAO;CAGhE;AACD,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,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"}

package/lib/tree/nodes/numbers/numberNode.js

@@ -1,11 +1,18 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.NumberNode = exports.isNumberNode = void 0;
+exports.NumberNode = exports.NumberNodeConstructor = exports.isNumberNode = void 0;
 const node_1 = require("../node");
+const randint_1 = require("../../../math/utils/random/randint");
 function isNumberNode(a) {
     return a.type === node_1.NodeType.number;
 }
 exports.isNumberNode = isNumberNode;
+class NumberNodeConstructor {
+    static random(min, max, excludes = []) {
+        return new NumberNode((0, randint_1.randint)(min, max, excludes));
+    }
+}
+exports.NumberNodeConstructor = NumberNodeConstructor;
 class NumberNode {
     constructor(value, tex, mathString) {
         this.type = node_1.NodeType.number;

package/lib/tree/nodes/operators/addNode.d.ts

@@ -1,6 +1,6 @@
 import { Node, NodeOptions, NodeType } from "../node";
 import { CommutativeOperatorNode, OperatorIds } from "./operatorNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isAddNode(a: Node): a is AddNode;
 export declare class AddNode implements CommutativeOperatorNode {
     id: OperatorIds;
@@ -17,7 +17,7 @@ export declare class AddNode implements CommutativeOperatorNode {
     toAllValidTexs(opts?: NodeOptions): string[];
     toTex(): string;
     evaluate(vars: Record<string, number>): number;
-    simplify(): AlgebraicNode;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
 }
 //# sourceMappingURL=addNode.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"addNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/addNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAGZ,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAOjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AAMD,qBAAa,OAAQ,YAAW,uBAAuB;IACrD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAoCtD,SAAS,IAAI,MAAM,EAAE;IAIrB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAK5C,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,IAAI,aAAa;IAwKzB,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAUrC"}
+{"version":3,"file":"addNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/addNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAGZ,MAAM,gBAAgB,CAAC;AAKxB,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAOlE,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AAMD,qBAAa,OAAQ,YAAW,uBAAuB;IACrD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,EAAE,OAAO,CAAC;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAoCtD,SAAS,IAAI,MAAM,EAAE;IAIrB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAK5C,KAAK,IAAI,MAAM;IAIf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA2K/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAUrC"}

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

@@ -87,7 +87,7 @@ class AddNode {
     // toMathjs() {
     //   return add(this.leftChild.toMathjs(), this.rightChild.toMathjs());
     // }
-    simplify() {
+    simplify(opts) {
         const leftSimplified = this.leftChild.simplify();
         const rightSimplified = this.rightChild.simplify();
         const copy = new AddNode(leftSimplified, rightSimplified, this.opts);
@@ -150,6 +150,8 @@ class AddNode {
                 return new numberNode_1.NumberNode(a.child.value + b.child.value);
             }
             //gérer opposites, fractions
+            if (opts?.forbidFactorize)
+                return null;
             const aSubExternals = [];
             const bSubExternals = [];
             const getAMultiplyExternals = (a) => {
@@ -196,9 +198,9 @@ class AddNode {
                     }
                 }
             }
-            //si aucun facteur on return le add node simplifié
+            //si aucun facteur on return
             if (!factors.length)
-                return copy;
+                return null;
             const factorsNode = factors.length === 1
                 ? factors[0]
                 : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, factors);
@@ -207,12 +209,12 @@ class AddNode {
                 ? new numberNode_1.NumberNode(1)
                 : aSubExternals.length === 1
                     ? aSubExternals[0]
-                    : (0, operatorComposition_1.operatorComposition)(AddNode, aSubExternals);
+                    : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, aSubExternals);
             const bNode = bSubExternals.length === 0
                 ? new numberNode_1.NumberNode(1)
                 : bSubExternals.length === 1
                     ? bSubExternals[0]
-                    : (0, operatorComposition_1.operatorComposition)(AddNode, bSubExternals);
+                    : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, bSubExternals);
             const addNode = new AddNode(aNode, bNode);
             return new multiplyNode_1.MultiplyNode(addNode, factorsNode).simplify();
         };

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

@@ -1,6 +1,6 @@
 import { Node, NodeOptions, NodeType } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isFractionNode(a: Node): a is FractionNode;
 export declare class FractionNode implements OperatorNode {
     opts?: NodeOptions;
@@ -20,7 +20,7 @@ export declare class FractionNode implements OperatorNode {
     toAllValidTexs(opts?: NodeOptions): string[];
     toTex(): string;
     evaluate(vars: Record<string, number>): number;
-    simplify(): AlgebraicNode;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
 }
 //# sourceMappingURL=fractionNode.d.ts.map

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,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAK3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAIjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,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;IAUpB,YAAY,IAAI,MAAM;IAItB,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA2BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAI5C,KAAK,IAAI,MAAM;IAaf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,IAAI,aAAa;IA6EzB,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}
+{"version":3,"file":"fractionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/fractionNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAK3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAIlE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,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;IAUpB,YAAY,IAAI,MAAM;IAItB,UAAU;IAGV,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IA2BpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAI5C,KAAK,IAAI,MAAM;IAaf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IA2E/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}

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

@@ -73,9 +73,9 @@ class FractionNode {
     // toMathjs() {
     //   return fraction(this.leftChild.toMathjs(), this.rightChild.toMathjs());
     // }
-    simplify() {
-        const simplifiedNum = this.leftChild.simplify();
-        const simplifiedDenum = this.rightChild.simplify();
+    simplify(opts) {
+        const simplifiedNum = this.leftChild.simplify(opts);
+        const simplifiedDenum = this.rightChild.simplify(opts);
         const copy = new FractionNode(simplifiedNum, simplifiedDenum, this.opts);
         const externalsNums = [];
         const externalsDenums = [];
@@ -102,7 +102,6 @@ class FractionNode {
         const simplifyExternalNodes = (num, denum) => {
             if ((0, numberNode_1.isNumberNode)(num) && (0, numberNode_1.isNumberNode)(denum)) {
                 const frac = new rational_1.Rational(num.value, denum.value);
-                console.log(frac.isIrreductible());
                 if (frac.isIrreductible())
                     return null;
                 return frac.simplify().toTree();
@@ -113,7 +112,6 @@ class FractionNode {
                 return new numberNode_1.NumberNode(1);
             return null;
         };
-        console.log(externalsNums, externalsDenums);
         const simplifyIteration = () => {
             for (let i = 0; i < externalsNums.length; i++) {
                 const num = externalsNums[i];
@@ -138,7 +136,7 @@ class FractionNode {
         simplifyIteration();
         const nums = externalsNums.length === 1
             ? externalsNums[0]
-            : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, externalsNums).simplify();
+            : (0, operatorComposition_1.operatorComposition)(multiplyNode_1.MultiplyNode, externalsNums).simplify(opts);
         if (externalsDenums.length === 0) {
             return nums;
         }

package/lib/tree/nodes/operators/limitNode.d.ts

@@ -0,0 +1,29 @@
+import { Node, NodeOptions, NodeType, ToTexOptions } from "../node";
+import { OperatorIds, OperatorNode } from "./operatorNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
+export declare function isLimitNode(a: Node): a is LimitNode;
+export declare class LimitNode implements OperatorNode {
+    opts?: NodeOptions;
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
+    isNumeric: boolean;
+    from: "+" | "-" | undefined;
+    /**
+     *
+     * @param leftChild x to ..
+     * @param rightChild f(x)
+     * @param from + ou - pour les VI
+     * @param opts
+     */
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, from?: "+" | "-", opts?: NodeOptions);
+    toMathString(): string;
+    toEquivalentNodes(opts?: NodeOptions | undefined): this[];
+    toAllValidTexs(): string[];
+    toTex(opts?: ToTexOptions): string;
+    evaluate(vars: Record<string, number>): number;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
+    equals(node: AlgebraicNode): boolean;
+}
+//# sourceMappingURL=limitNode.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"limitNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/limitNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AACpE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAElE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;IACnB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS,CAAC;IAE5B;;;;;;OAMG;gBAED,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,GAAG,GAAG,GAAG,EAChB,IAAI,CAAC,EAAE,WAAW;IAWpB,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,SAAS;IAIhD,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,GAAG,MAAM;IAWlC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,MAAM;IAI9C,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAG/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}

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

@@ -0,0 +1,56 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LimitNode = exports.isLimitNode = void 0;
+// import { pow } from "mathjs";
+const node_1 = require("../node");
+const operatorNode_1 = require("./operatorNode");
+function isLimitNode(a) {
+    return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.limit;
+}
+exports.isLimitNode = isLimitNode;
+class LimitNode {
+    /**
+     *
+     * @param leftChild x to ..
+     * @param rightChild f(x)
+     * @param from + ou - pour les VI
+     * @param opts
+     */
+    constructor(leftChild, rightChild, from, opts) {
+        this.id = operatorNode_1.OperatorIds.limit;
+        this.leftChild = leftChild;
+        this.rightChild = rightChild;
+        this.type = node_1.NodeType.operator;
+        this.opts = opts;
+        this.isNumeric = leftChild.isNumeric && rightChild.isNumeric;
+        this.from = from;
+    }
+    toMathString() {
+        return `limit_(${this.leftChild.toMathString()})(${this.rightChild.toMathString()})`;
+    }
+    toEquivalentNodes(opts) {
+        return [this];
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toTex(opts) {
+        const displayStyle = opts?.displayStyle ?? true;
+        let rightTex = this.rightChild.toTex();
+        let leftTex = this.leftChild.toTex();
+        let fromDisplay = this.from === "+" ? "^+" : this.from === "-" ? "^-" : "";
+        return `${displayStyle ? "\\displaystyle" : ""}\\lim_{x \\to ${leftTex}${fromDisplay}} ${rightTex}`;
+    }
+    evaluate(vars) {
+        throw Error("unimplemented limit evaluation");
+    }
+    simplify(opts) {
+        return this;
+    }
+    equals(node) {
+        return (isLimitNode(node) &&
+            node.leftChild.equals(this.leftChild) &&
+            node.rightChild.equals(this.rightChild));
+    }
+}
+exports.LimitNode = LimitNode;

package/lib/tree/nodes/operators/multiplyNode.d.ts

@@ -1,6 +1,6 @@
 import { Node, NodeOptions, NodeType } from "../node";
 import { CommutativeOperatorNode, OperatorIds } from "./operatorNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isMultiplyNode(a: Node): a is MultiplyNode;
 export declare const sortMultiplyNodes: (arr: AlgebraicNode[]) => void;
 export declare class MultiplyNode implements CommutativeOperatorNode {
@@ -19,7 +19,7 @@ export declare class MultiplyNode implements CommutativeOperatorNode {
     toAllValidTexs(opts?: NodeOptions): string[];
     evaluate(vars: Record<string, number>): number;
     copy(): MultiplyNode;
-    simplify(): AlgebraicNode;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
 }
 //# sourceMappingURL=multiplyNode.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,gBAAgB,CAAC;AAYxB,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,iBAAiB,QAAS,aAAa,EAAE,SAWrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,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;IAUpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAkDf,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAwFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAQ5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIrC,IAAI;IAGJ,QAAQ,IAAI,aAAa;IAqGzB,MAAM,CAAC,IAAI,EAAE,aAAa;CAU3B"}
+{"version":3,"file":"multiplyNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/multiplyNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EACL,uBAAuB,EACvB,WAAW,EAEZ,MAAM,gBAAgB,CAAC;AAYxB,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAKlE,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,eAAO,MAAM,iBAAiB,QAAS,aAAa,EAAE,SAWrD,CAAC;AACF,qBAAa,YAAa,YAAW,uBAAuB;IAC1D,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,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;IAUpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAkDf,SAAS;IAkDT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,YAAY,EAAE;IAwFrD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAQ5C,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAIrC,IAAI;IAGJ,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAoG/C,MAAM,CAAC,IAAI,EAAE,aAAa;CAU3B"}

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

@@ -201,9 +201,9 @@ class MultiplyNode {
     copy() {
         return new MultiplyNode(this.leftChild, this.rightChild, this.opts);
     }
-    simplify() {
-        const leftSimplified = this.leftChild.simplify();
-        const rightSimplified = this.rightChild.simplify();
+    simplify(opts) {
+        const leftSimplified = this.leftChild.simplify(opts);
+        const rightSimplified = this.rightChild.simplify(opts);
         const copy = new MultiplyNode(leftSimplified, rightSimplified, this.opts);
         /**get externals nodes
          * les opposites sont supprimés et on ajoute *-1 à la fin si leur nb est impair
@@ -259,16 +259,15 @@ class MultiplyNode {
             const denumNode = denums.length === 1
                 ? denums[0]
                 : (0, operatorComposition_1.operatorComposition)(MultiplyNode, denums);
-            return new fractionNode_1.FractionNode(numNode, denumNode).simplify();
+            return new fractionNode_1.FractionNode(numNode, denumNode).simplify(opts);
         }
         (0, exports.sortMultiplyNodes)(externals);
-        console.log(externals.map((n) => n.toTex()));
         const simplifyExternalNodes = (a, b) => {
             if ((0, numberNode_1.isNumberNode)(a) && (0, numberNode_1.isNumberNode)(b)) {
                 return new numberNode_1.NumberNode(a.value * b.value);
             }
             if ((0, sqrtNode_1.isSqrtNode)(a) && (0, sqrtNode_1.isSqrtNode)(b)) {
-                return new sqrtNode_1.SqrtNode(new MultiplyNode(a.child, b.child)).simplify();
+                return new sqrtNode_1.SqrtNode(new MultiplyNode(a.child, b.child)).simplify(opts);
             }
             //TODo continue
             return null;

package/lib/tree/nodes/operators/operatorNode.d.ts

@@ -6,7 +6,8 @@ export declare enum OperatorIds {
     multiply = 2,
     fraction = 3,
     divide = 4,
-    power = 5
+    power = 5,
+    limit = 6
 }
 export interface OperatorNode extends AlgebraicNode {
     id: OperatorIds;

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

@@ -1 +1 @@
-{"version":3,"file":"operatorNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/operatorNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AAEzC,oBAAY,WAAW;IACrB,GAAG,IAAA;IACH,SAAS,IAAA;IACT,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,MAAM,IAAA;IACN,KAAK,IAAA;CACN;AAED,MAAM,WAAW,YAAa,SAAQ,aAAa;IACjD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;CAC3B;AACD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,MAAM,WAAW,uBAAwB,SAAQ,YAAY;IAC3D,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,SAAS,EAAE,MAAM,MAAM,EAAE,CAAC;CAC3B"}
+{"version":3,"file":"operatorNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/operatorNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AAEzC,oBAAY,WAAW;IACrB,GAAG,IAAA;IACH,SAAS,IAAA;IACT,QAAQ,IAAA;IACR,QAAQ,IAAA;IACR,MAAM,IAAA;IACN,KAAK,IAAA;IACL,KAAK,IAAA;CACN;AAED,MAAM,WAAW,YAAa,SAAQ,aAAa;IACjD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;CAC3B;AACD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AAED,MAAM,WAAW,uBAAwB,SAAQ,YAAY;IAC3D,OAAO,EAAE,MAAM,IAAI,CAAC;IACpB,SAAS,EAAE,MAAM,MAAM,EAAE,CAAC;CAC3B"}

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

@@ -10,6 +10,7 @@ var OperatorIds;
     OperatorIds[OperatorIds["fraction"] = 3] = "fraction";
     OperatorIds[OperatorIds["divide"] = 4] = "divide";
     OperatorIds[OperatorIds["power"] = 5] = "power";
+    OperatorIds[OperatorIds["limit"] = 6] = "limit";
 })(OperatorIds || (exports.OperatorIds = OperatorIds = {}));
 function isOperatorNode(a) {
     return a.type === node_1.NodeType.operator;

package/lib/tree/nodes/operators/powerNode.d.ts

@@ -1,6 +1,6 @@
 import { Node, NodeOptions, NodeType } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isPowerNode(a: Node): a is PowerNode;
 export declare class PowerNode implements OperatorNode {
     opts?: NodeOptions;
@@ -15,7 +15,7 @@ export declare class PowerNode implements OperatorNode {
     toAllValidTexs(): string[];
     toTex(): string;
     evaluate(vars: Record<string, number>): number;
-    simplify(): this;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
 }
 export declare class SquareNode extends PowerNode {

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

@@ -1 +1 @@
-{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAKjD,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,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;IAUpB,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IA6CrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAO3B;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}
+{"version":3,"file":"powerNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/powerNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAOlE,wBAAgB,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,SAAS,CAEnD;AAED,qBAAa,SAAU,YAAW,YAAY;IAC5C,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,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;IAUpB,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAqBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAuBf,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IA+FrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,aAAa;IAO/C,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC;AAED,qBAAa,UAAW,SAAQ,SAAS;gBAC3B,KAAK,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;CAGrD"}

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

@@ -77,6 +77,7 @@ class PowerNode {
     // simplify(): AlgebraicNode {
     //   const leftSimplified = this.leftChild.simplify();
     //   const rightSimplified = this.rightChild.simplify();
+    //   const copy = new PowerNode(leftSimplified, rightSimplified, this.opts);
     //   if (isNumberNode(rightSimplified)) {
     //     const value = rightSimplified.value;
     //     if (value === 0) return new NumberNode(1);
@@ -87,6 +88,36 @@ class PowerNode {
     //     if (value === 0) return leftSimplified;
     //     if (value === 1) return leftSimplified;
     //   }
+    //   let externals: AlgebraicNode[] = [];
+    //   //TODO Fractions
+    //   const recursive = (node: AlgebraicNode) => {
+    //     if (isMultiplyNode(node)) {
+    //       recursive(node.leftChild);
+    //       recursive(node.rightChild);
+    //     } else {
+    //       externals.push(node);
+    //     }
+    //   };
+    //   recursive(copy.leftChild)
+    //   const simplifyIteration = () => {
+    //     for (let i = 0; i < externals.length - 1; i++) {
+    //       const left = externals[i];
+    //       for (let j = i + 1; j < externals.length; j++) {
+    //         const right = externals[j];
+    //         const simplified = simplifyExternalNodes(left, right);
+    //         if (simplified) {
+    //           externals[i] = simplified;
+    //           externals.splice(j, 1);
+    //           if (isNumberNode(simplified) && simplified.value === 1) {
+    //             externals.splice(i, 1);
+    //           }
+    //           simplifyIteration();
+    //           return;
+    //         }
+    //       }
+    //     }
+    //   };
+    //   simplifyIteration();
     //   if (isNumberNode(rightSimplified) && isNumberNode(leftSimplified)) {
     //     const value = this.evaluate({});
     //     // à partir de ^21 et de ^-7, javascript returns des écritures scientifiques
@@ -107,11 +138,29 @@ class PowerNode {
     //     ).simplify();
     //   }
     //   if (isSqrtNode(leftSimplified) && isNumberNode(rightSimplified)) {
+    //     const powerValue = rightSimplified.value;
+    //     const powerIsEven = powerValue % 2 === 0;
+    //     if (powerIsEven) {
+    //       return new PowerNode(
+    //         leftSimplified.child,
+    //         new NumberNode(powerValue / 2),
+    //       ).simplify();
+    //     } else {
+    //       const parityPower = Math.floor(powerValue / 2);
+    //       return new MultiplyNode(
+    //         new PowerNode(leftSimplified.child, new NumberNode(parityPower)),
+    //         leftSimplified,
+    //       ).simplify();
+    //     }
     //   }
-    //   //! simplifications possibles :
+    //   return this;
     //   // puissances négatives ?
     // }
-    simplify() {
+    simplify(opts) {
+        //! temporaire
+        if ((0, numberNode_1.isNumberNode)(this.rightChild) && this.rightChild.value === 2) {
+            return new multiplyNode_1.MultiplyNode(this.leftChild, this.leftChild).simplify(opts);
+        }
         return this;
     }
     equals(node) {

package/lib/tree/nodes/operators/substractNode.d.ts

@@ -1,6 +1,6 @@
 import { Node, NodeType } from "../node";
 import { OperatorIds, OperatorNode } from "./operatorNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { AlgebraicNode, SimplifyOptions } from "../algebraicNode";
 export declare function isSubstractNode(a: Node): a is SubstractNode;
 export declare class SubstractNode implements OperatorNode {
     id: OperatorIds;
@@ -14,7 +14,7 @@ export declare class SubstractNode implements OperatorNode {
     toAllValidTexs(): string[];
     toTex(): string;
     evaluate(vars: Record<string, number>): number;
-    simplify(): this;
+    simplify(opts?: SimplifyOptions): AlgebraicNode;
     equals(node: AlgebraicNode): boolean;
 }
 //# sourceMappingURL=substractNode.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AACD,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBACP,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa;IAQ/D,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,KAAK,IAAI,MAAM;IAef,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ;IAGR,MAAM,CAAC,IAAI,EAAE,aAAa;CAO3B"}
+{"version":3,"file":"substractNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/substractNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,WAAW,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAG3E,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAClE,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,aAAa,CAE3D;AACD,qBAAa,aAAc,YAAW,YAAY;IAChD,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC;gBACP,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa;IAQ/D,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,aAAa,EAAE;IAapC,cAAc,IAAI,MAAM,EAAE;IAG1B,KAAK,IAAI,MAAM;IAef,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAMrC,QAAQ,CAAC,IAAI,CAAC,EAAE,eAAe;IAM/B,MAAM,CAAC,IAAI,EAAE,aAAa,GAAG,OAAO;CAOrC"}

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

@@ -52,8 +52,8 @@ class SubstractNode {
     // toMathjs() {
     //   return subtract(this.leftChild.toMathjs(), this.rightChild.toMathjs());
     // }
-    simplify() {
-        return this;
+    simplify(opts) {
+        return new addNode_1.AddNode(this.leftChild, new oppositeNode_1.OppositeNode(this.rightChild)).simplify(opts);
     }
     equals(node) {
         return (isSubstractNode(node) &&

package/lib/utils/randomLetter.d.ts

@@ -1,2 +1,2 @@
-export declare const randomLetter: (isMaj?: boolean) => string;
+export declare const randomLetter: (isMaj?: boolean, excludes?: string[]) => string;
 //# sourceMappingURL=randomLetter.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"randomLetter.d.ts","sourceRoot":"","sources":["../../src/utils/randomLetter.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,YAAY,WAAW,OAAO,WAI1C,CAAC"}
+{"version":3,"file":"randomLetter.d.ts","sourceRoot":"","sources":["../../src/utils/randomLetter.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,YAAY,WAChB,OAAO,aACJ,MAAM,EAAE,WASnB,CAAC"}

package/lib/utils/randomLetter.js

@@ -1,9 +1,11 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.randomLetter = void 0;
-const randomLetter = (isMaj = false) => {
-    if (isMaj)
-        return String.fromCharCode(65 + Math.floor(Math.random() * 26));
-    return String.fromCharCode(97 + Math.floor(Math.random() * 26));
+const randomLetter = (isMaj = false, excludes = []) => {
+    let letter = "";
+    do {
+        letter = String.fromCharCode((isMaj ? 65 : 97) + Math.floor(Math.random() * 26));
+    } while (excludes.includes(letter));
+    return letter;
 };
 exports.randomLetter = randomLetter;

package/package.json

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