math-exercises 2.0.0 → 2.0.2

package/lib/tree/nodes/node.js

@@ -8,4 +8,11 @@ var NodeType;
     NodeType[NodeType["variable"] = 2] = "variable";
     NodeType[NodeType["operator"] = 3] = "operator";
     NodeType[NodeType["function"] = 4] = "function";
+    NodeType[NodeType["set"] = 5] = "set";
+    NodeType[NodeType["inequation"] = 6] = "inequation";
+    NodeType[NodeType["point"] = 7] = "point";
+    NodeType[NodeType["mesure"] = 8] = "mesure";
+    NodeType[NodeType["equality"] = 9] = "equality";
+    NodeType[NodeType["belongs"] = 10] = "belongs";
+    NodeType[NodeType["vector"] = 11] = "vector";
 })(NodeType = exports.NodeType || (exports.NodeType = {}));

package/lib/tree/nodes/numbers/constantNode.d.ts

@@ -1,5 +1,7 @@
-import { Node, NodeType } from '../node';
-export declare class ConstantNode implements Node {
+import { Node, NodeType } from "../node";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isConstantNode(a: Node): a is ConstantNode;
+export declare class ConstantNode implements AlgebraicNode {
     tex: string;
     mathString: string;
     type: NodeType;

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

@@ -1 +1 @@
-{"version":3,"file":"constantNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/constantNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,qBAAa,YAAa,YAAW,IAAI;IACvC,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAK3C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAGlB"}
+{"version":3,"file":"constantNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/constantNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,qBAAa,YAAa,YAAW,aAAa;IAChD,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,GAAG,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAK3C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAGlB"}

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

@@ -1,8 +1,12 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.ConstantNode = void 0;
+exports.ConstantNode = exports.isConstantNode = void 0;
 const mathjs_1 = require("mathjs");
 const node_1 = require("../node");
+function isConstantNode(a) {
+    return a.type === node_1.NodeType.constant;
+}
+exports.isConstantNode = isConstantNode;
 class ConstantNode {
     constructor(tex, mathString) {
         this.type = node_1.NodeType.constant;

package/lib/tree/nodes/numbers/infiniteNode.d.ts

@@ -0,0 +1,5 @@
+import { ConstantNode } from "./constantNode";
+export declare const InfinityNode: ConstantNode;
+export declare const PlusInfinityNode: ConstantNode;
+export declare const MinusInfinityNode: ConstantNode;
+//# sourceMappingURL=infiniteNode.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"infiniteNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/infiniteNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,eAAO,MAAM,YAAY,cAA0C,CAAC;AACpE,eAAO,MAAM,gBAAgB,cAA2C,CAAC;AACzE,eAAO,MAAM,iBAAiB,cAA4C,CAAC"}

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

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MinusInfinityNode = exports.PlusInfinityNode = exports.InfinityNode = void 0;
+const constantNode_1 = require("./constantNode");
+exports.InfinityNode = new constantNode_1.ConstantNode("\\infty", "infinity");
+exports.PlusInfinityNode = new constantNode_1.ConstantNode("+\\infty", "infinity");
+exports.MinusInfinityNode = new constantNode_1.ConstantNode("-\\infty", "-infinity");

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

@@ -1,5 +1,7 @@
-import { Node, NodeType } from '../node';
-export declare class NumberNode implements Node {
+import { Node, NodeType } from "../node";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isNumberNode(a: Node): a is NumberNode;
+export declare class NumberNode implements AlgebraicNode {
     tex: string;
     mathString: string;
     value: number;

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":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,qBAAa,UAAW,YAAW,IAAI;IACrC,GAAG,EAAE,MAAM,CAAC;IACZ,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAmB;gBAErB,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAM5D,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAOd,iBAAiB;CAGlB"}
+{"version":3,"file":"numberNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/numberNode.ts"],"names":[],"mappings":"AACA,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;gBAErB,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM;IAM5D,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAOd,iBAAiB;CAGlB"}

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

@@ -1,13 +1,17 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.NumberNode = void 0;
+exports.NumberNode = exports.isNumberNode = void 0;
 const node_1 = require("../node");
+function isNumberNode(a) {
+    return a.type === node_1.NodeType.number;
+}
+exports.isNumberNode = isNumberNode;
 class NumberNode {
     constructor(value, tex, mathString) {
         this.type = node_1.NodeType.number;
         this.value = value;
-        this.tex = tex || (value + '').replace('.', ',');
-        this.mathString = mathString || this.value + '';
+        this.tex = tex || (value + "").replace(".", ",");
+        this.mathString = mathString || this.value + "";
     }
     toMathString() {
         return `${this.mathString}`;
@@ -22,8 +26,8 @@ class NumberNode {
         const res = [];
         res.push(this.tex);
         //!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(',', '.'));
+        if (this.tex.includes(","))
+            res.push(this.tex.replace(",", "."));
         return res;
     }
     toEquivalentNodes() {

package/lib/tree/nodes/numbers/percentNode.d.ts

@@ -0,0 +1,12 @@
+import { Node, NodeType } from "../node";
+export declare class PercentNode implements Node {
+    value: number;
+    type: NodeType;
+    constructor(value: number);
+    toMathString(): string;
+    toTex(): string;
+    toMathjs(): string;
+    toAllValidTexs(): string[];
+    toEquivalentNodes(): this[];
+}
+//# sourceMappingURL=percentNode.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"percentNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/numbers/percentNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEzC,qBAAa,WAAY,YAAW,IAAI;IACtC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,QAAQ,CAAC;gBAEH,KAAK,EAAE,MAAM;IAKzB,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAGR,cAAc;IAGd,iBAAiB;CAGlB"}

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

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PercentNode = void 0;
+const node_1 = require("../node");
+class PercentNode {
+    constructor(value) {
+        this.value = value;
+        this.type = node_1.NodeType.number;
+    }
+    toMathString() {
+        return `${this.value}%`;
+    }
+    toTex() {
+        return `${(this.value + "").replace(".", ",")}\\%`;
+    }
+    toMathjs() {
+        return this.toMathString();
+    }
+    toAllValidTexs() {
+        return [this.toTex()];
+    }
+    toEquivalentNodes() {
+        return [this];
+    }
+}
+exports.PercentNode = PercentNode;

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

@@ -1,10 +1,19 @@
-import { Node } from '../node';
-import { OperatorNode } from './operatorNode';
-export declare class AddNode extends OperatorNode implements Node {
-    constructor(leftChild: Node, rightChild: Node);
+import { Node, NodeOptions, NodeType } from "../node";
+import { CommutativeOperatorNode, OperatorIds } from "./operatorNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isAddNode(a: Node): a is AddNode;
+export declare class AddNode implements CommutativeOperatorNode {
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
+    opts?: NodeOptions;
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
+    shuffle: () => void;
     toMathString(): string;
-    toEquivalentNodes(): Node[];
-    toAllValidTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): Node[];
+    toAllTexs(): string[];
+    toAllValidTexs(opts?: NodeOptions): string[];
     toTex(): string;
     toMathjs(): any;
 }

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,EAAY,MAAM,SAAS,CAAC;AACzC,OAAO,EAAe,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAK3D,qBAAa,OAAQ,SAAQ,YAAa,YAAW,IAAI;gBAC3C,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI;IAK7C,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,IAAI,EAAE;IAa3B,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAIf,QAAQ;CAGT"}
+{"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;AAEjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AAKD,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;gBAEjB,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAQpB,OAAO,aAGL;IAEF,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,EAAE;IAoC7C,SAAS,IAAI,MAAM,EAAE;IAIrB,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAK5C,KAAK,IAAI,MAAM;IAIf,QAAQ;CAGT"}

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

@@ -1,34 +1,73 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.AddNode = void 0;
+exports.AddNode = exports.isAddNode = void 0;
 const mathjs_1 = require("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 operatorComposition_1 = require("../../../tree/utilities/operatorComposition");
+function isAddNode(a) {
+    return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.add;
+}
+exports.isAddNode = isAddNode;
 const addNodeToTex = (leftTex, rightTex) => {
-    return `${leftTex}${rightTex[0] === '-' ? '' : '+'}${rightTex}`;
+    return `${leftTex}${rightTex[0] === "-" ? "" : "+"}${rightTex}`;
 };
-class AddNode extends operatorNode_1.OperatorNode {
-    constructor(leftChild, rightChild) {
-        super(operatorNode_1.OperatorIds.add, leftChild, rightChild, true, '+');
+class AddNode {
+    constructor(leftChild, rightChild, opts) {
+        this.shuffle = () => {
+            if ((0, coinFlip_1.coinFlip)())
+                [this.leftChild, this.rightChild] = [this.rightChild, this.leftChild];
+        };
+        this.id = operatorNode_1.OperatorIds.add;
         this.leftChild = leftChild;
         this.rightChild = rightChild;
+        this.type = node_1.NodeType.operator;
+        this.opts = opts;
     }
     toMathString() {
         return `${this.leftChild.toMathString()} + (${this.rightChild.toMathString()})`;
     }
-    toEquivalentNodes() {
+    toEquivalentNodes(opts) {
+        const options = opts ?? this.opts;
         const res = [];
-        const rightNodes = this.rightChild.toEquivalentNodes();
-        const leftNodes = this.leftChild.toEquivalentNodes();
-        rightNodes.forEach((rightNode) => {
-            leftNodes.forEach((leftNode) => {
-                res.push(new AddNode(leftNode, rightNode));
-                res.push(new AddNode(rightNode, leftNode));
+        const addTree = [];
+        //ce seront des nodes qui ne sont pas des AddNode
+        //1: choper le sous arbre de type Non AddNode (ie les enfants nonAddNode des AddNode)
+        const recursive = (node) => {
+            if ((0, operatorNode_1.isOperatorNode)(node)) {
+                if (isAddNode(node)) {
+                    recursive(node.leftChild);
+                    recursive(node.rightChild);
+                }
+                else
+                    addTree.push(node);
+            }
+            else
+                addTree.push(node);
+        };
+        recursive(this);
+        //2: pour tous les nodes qui ne sont pas Add, on génère les equiv node
+        const equivNodesArr = addTree.map((node) => node.toEquivalentNodes(options));
+        //3: créer toutes les permutations de tous kes nodes equiv
+        let equivNodesPermutations = (0, permutations_1.permute)(equivNodesArr);
+        equivNodesPermutations.forEach((permutation) => {
+            //4: créé les produits cartésiens des nodes equiv puis nodify
+            const cartesiansProducts = (0, cartesianProducts_1.getCartesiansProducts)(permutation);
+            cartesiansProducts.forEach((product) => {
+                res.push((0, operatorComposition_1.operatorComposition)(AddNode, product));
             });
         });
         return res;
     }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
+    toAllTexs() {
+        return [this.toTex()];
+    }
+    toAllValidTexs(opts) {
+        const options = opts ?? this.opts;
+        return this.toEquivalentNodes(options).map((node) => node.toTex());
     }
     toTex() {
         const rightTex = this.rightChild.toTex();

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

@@ -1,13 +1,19 @@
-import { Node } from '../node';
-import { OperatorNode } from './operatorNode';
-export declare class DivideNode extends OperatorNode implements Node {
+import { Node, NodeOptions, NodeType } from "../node";
+import { OperatorIds, OperatorNode } from "./operatorNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isDivideNode(a: Node): a is DivideNode;
+export declare class DivideNode implements OperatorNode {
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
     /**
      * @param leftChild num
      * @param rightChild denum
      */
-    constructor(leftChild: Node, rightChild: Node);
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode);
     toMathString(): string;
-    toEquivalentNodes(): Node[];
+    toEquivalentNodes(opts?: NodeOptions): Node[];
     toAllValidTexs(): string[];
     toTex(): string;
     toMathjs(): number | import("mathjs").Unit;

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

@@ -1 +1 @@
-{"version":3,"file":"divideNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/divideNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AACzC,OAAO,EAAe,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAsB3D,qBAAa,UAAW,SAAQ,YAAa,YAAW,IAAI;IAC1D;;;OAGG;gBACS,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI;IAI7C,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAYjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAGf,QAAQ;CAGT"}
+{"version":3,"file":"divideNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/operators/divideNode.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;AAC3E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,UAAU,CAErD;AA0BD,qBAAa,UAAW,YAAW,YAAY;IAC7C,EAAE,EAAE,WAAW,CAAC;IAChB,SAAS,EAAE,aAAa,CAAC;IACzB,UAAU,EAAE,aAAa,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf;;;OAGG;gBAES,SAAS,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa;IAO/D,YAAY,IAAI,MAAM;IAItB,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAYpC,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAGf,QAAQ;CAGT"}

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

@@ -1,38 +1,48 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.DivideNode = void 0;
+exports.DivideNode = exports.isDivideNode = void 0;
 const mathjs_1 = require("mathjs");
 const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
+function isDivideNode(a) {
+    return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.divide;
+}
+exports.isDivideNode = isDivideNode;
 const divideNodeToTex = (leftChild, rightChild) => {
     let rightTex = rightChild.toTex();
     let leftTex = leftChild.toTex();
-    if (leftChild.type === node_1.NodeType.operator) {
+    if ((0, operatorNode_1.isOperatorNode)(leftChild)) {
         if ([operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract, operatorNode_1.OperatorIds.multiply].includes(leftChild.id))
             leftTex = `\\left(${leftTex}\\right)`;
     }
-    let needBrackets = rightTex[0] === '-';
-    if (rightChild.type === node_1.NodeType.operator) {
-        const operatorRightChild = rightChild;
-        needBrackets ||= [operatorNode_1.OperatorIds.add, operatorNode_1.OperatorIds.substract, operatorNode_1.OperatorIds.divide].includes(operatorRightChild.id);
+    let needBrackets = rightTex[0] === "-";
+    if ((0, operatorNode_1.isOperatorNode)(rightChild)) {
+        needBrackets ||= [
+            operatorNode_1.OperatorIds.add,
+            operatorNode_1.OperatorIds.substract,
+            operatorNode_1.OperatorIds.divide,
+        ].includes(rightChild.id);
     }
     if (needBrackets)
         rightTex = `\\left(${rightTex}\\right)`;
     const nextIsLetter = rightTex[0].toLowerCase() !== rightTex[0].toUpperCase();
-    return `${leftTex}\\div${nextIsLetter ? ' ' : ''}${rightTex}`;
+    return `${leftTex}\\div${nextIsLetter ? " " : ""}${rightTex}`;
 };
-class DivideNode extends operatorNode_1.OperatorNode {
+class DivideNode {
     /**
      * @param leftChild num
      * @param rightChild denum
      */
     constructor(leftChild, rightChild) {
-        super(operatorNode_1.OperatorIds.divide, leftChild, rightChild, false, '\\div');
+        this.id = operatorNode_1.OperatorIds.divide;
+        this.leftChild = leftChild;
+        this.rightChild = rightChild;
+        this.type = node_1.NodeType.operator;
     }
     toMathString() {
         return `(${this.leftChild.toMathString()}) / (${this.rightChild.toMathString()})`;
     }
-    toEquivalentNodes() {
+    toEquivalentNodes(opts) {
         const res = [];
         const rightNodes = this.rightChild.toEquivalentNodes();
         const leftNodes = this.leftChild.toEquivalentNodes();

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

@@ -1,19 +1,22 @@
-import { Node } from '../node';
-import { OperatorNode } from './operatorNode';
-export type FractionNodeOptions = {
-    allowDecimalSyntax?: boolean;
-    forceMinusBefore?: boolean;
-};
-export declare class FractionNode extends OperatorNode implements Node {
-    opts?: FractionNodeOptions;
+import { Node, NodeOptions, NodeType } from "../node";
+import { OperatorIds, OperatorNode } from "./operatorNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isFractionNode(a: Node): a is FractionNode;
+export declare class FractionNode implements OperatorNode {
+    opts?: NodeOptions;
     /**
      * @param leftChild num
      * @param rightChild denum
      */
-    constructor(leftChild: Node, rightChild: Node, opts?: FractionNodeOptions);
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
     toMathString(): string;
-    toEquivalentNodes(): Node[];
-    toAllValidTexs(): string[];
+    toInversed(): FractionNode;
+    toEquivalentNodes(opts?: NodeOptions): Node[];
+    toAllValidTexs(opts?: NodeOptions): string[];
     toTex(): string;
     toMathjs(): import("mathjs").Fraction;
 }

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,EAAY,MAAM,SAAS,CAAC;AACzC,OAAO,EAAe,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAM3D,MAAM,MAAM,mBAAmB,GAAG;IAChC,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,gBAAgB,CAAC,EAAE,OAAO,CAAC;CAC5B,CAAC;AACF,qBAAa,YAAa,SAAQ,YAAa,YAAW,IAAI;IAC5D,IAAI,CAAC,EAAE,mBAAmB,CAAC;IAC3B;;;OAGG;gBACS,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,mBAAmB;IAKzE,YAAY,IAAI,MAAM;IAItB,iBAAiB;IAsBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAYf,QAAQ;CAGT"}
+{"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;AACjD,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;gBAEb,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IASpB,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;IAcf,QAAQ;CAGT"}

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

@@ -1,36 +1,45 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.FractionNode = void 0;
+exports.FractionNode = exports.isFractionNode = void 0;
 const mathjs_1 = require("mathjs");
 const node_1 = require("../node");
 const operatorNode_1 = require("./operatorNode");
 const numberNode_1 = require("../numbers/numberNode");
-const functionNode_1 = require("../functions/functionNode");
 const round_1 = require("../../../math/utils/round");
-class FractionNode extends operatorNode_1.OperatorNode {
-    /**
-     * @param leftChild num
-     * @param rightChild denum
-     */
+const oppositeNode_1 = require("../functions/oppositeNode");
+function isFractionNode(a) {
+    return (0, operatorNode_1.isOperatorNode)(a) && a.id === operatorNode_1.OperatorIds.fraction;
+}
+exports.isFractionNode = isFractionNode;
+class FractionNode {
     constructor(leftChild, rightChild, opts) {
-        super(operatorNode_1.OperatorIds.fraction, leftChild, rightChild, false, '\\frac');
+        this.id = operatorNode_1.OperatorIds.fraction;
+        this.leftChild = leftChild;
+        this.rightChild = rightChild;
+        this.type = node_1.NodeType.operator;
         this.opts = opts;
     }
     toMathString() {
         return `(${this.leftChild.toMathString()}) / (${this.rightChild.toMathString()})`;
     }
-    toEquivalentNodes() {
+    toInversed() {
+        return new FractionNode(this.rightChild, this.leftChild);
+    }
+    toEquivalentNodes(opts) {
+        const options = opts ?? this.opts;
         const res = [];
         const rightNodes = this.rightChild.toEquivalentNodes();
         const leftNodes = this.leftChild.toEquivalentNodes();
         rightNodes.forEach((rightNode) => {
             leftNodes.forEach((leftNode) => {
                 res.push(new FractionNode(leftNode, rightNode));
-                if (this.opts?.allowDecimalSyntax && leftNode.type === node_1.NodeType.number && rightNode.type === node_1.NodeType.number) {
+                if (options?.allowFractionToDecimal &&
+                    (0, numberNode_1.isNumberNode)(leftNode) &&
+                    (0, numberNode_1.isNumberNode)(rightNode)) {
                     const [num, denum] = [leftNode.value, rightNode.value];
                     const decimal = (0, round_1.round)(num / denum, 12);
                     //on ne push pas les non décimaux (limite arbitraire : partie décimale de 12 => non décimal)
-                    if ((decimal + '').split('.')[1].length > 11)
+                    if ((decimal + "").split(".")[1].length > 11)
                         return;
                     res.push(new numberNode_1.NumberNode(decimal));
                 }
@@ -41,14 +50,16 @@ class FractionNode extends operatorNode_1.OperatorNode {
         //! si le num est un multiplynode, ex x*y/z , est ce qu'on créé x*(y/z), y*(x/z) ??
         //! est ce qu'on gère le placement du moins n'importe où
     }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
+    toAllValidTexs(opts) {
+        return this.toEquivalentNodes(opts).map((node) => node.toTex());
     }
     toTex() {
-        if ((this.leftChild.type === node_1.NodeType.function &&
-            this.leftChild.id === functionNode_1.FunctionsIds.opposite) ||
-            (this.leftChild.type === node_1.NodeType.number && this.leftChild.value < 0)) {
-            return `-\\frac{${this.leftChild.toTex().slice(1)}}{${this.rightChild.toTex()}}`;
+        if (!this.opts?.allowMinusAnywhereInFraction &&
+            ((0, oppositeNode_1.isOppositeNode)(this.leftChild) ||
+                ((0, numberNode_1.isNumberNode)(this.leftChild) && this.leftChild.value < 0))) {
+            return `-\\frac{${this.leftChild
+                .toTex()
+                .slice(1)}}{${this.rightChild.toTex()}}`;
         }
         return `\\frac{${this.leftChild.toTex()}}{${this.rightChild.toTex()}}`;
     }

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

@@ -1,16 +1,21 @@
-import { Node } from '../node';
-import { OperatorNode } from './operatorNode';
-type MultiplyNodeOptions = {
-    forceTimesSign?: boolean;
-};
-export declare class MultiplyNode extends OperatorNode implements Node {
-    opts?: MultiplyNodeOptions | undefined;
-    constructor(leftChild: Node, rightChild: Node, opts?: MultiplyNodeOptions);
+import { Node, NodeOptions, NodeType } from "../node";
+import { CommutativeOperatorNode, OperatorIds } from "./operatorNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isMultiplyNode(a: Node): a is MultiplyNode;
+export declare class MultiplyNode implements CommutativeOperatorNode {
+    opts?: NodeOptions;
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
+    shuffle: () => void;
     toMathString(): string;
     toTex(): string;
-    toEquivalentNodes(): Node[];
-    toAllValidTexs(): string[];
+    toAllTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): MultiplyNode[];
+    toAllValidTexs(opts?: NodeOptions): string[];
     toMathjs(): any;
+    simplify(): void;
 }
-export {};
 //# 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":"AAEA,OAAO,EAAE,IAAI,EAAY,MAAM,SAAS,CAAC;AACzC,OAAO,EAAe,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE3D,KAAK,mBAAmB,GAAG;IACzB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B,CAAC;AACF,qBAAa,YAAa,SAAQ,YAAa,YAAW,IAAI;IAC5D,IAAI,CAAC,EAAE,mBAAmB,GAAG,SAAS,CAAC;gBAC3B,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,mBAAmB;IAazE,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAmCf,iBAAiB;IAiBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,QAAQ;CAGT"}
+{"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;AACjD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,YAAY,CAEzD;AACD,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;gBAEb,SAAS,EAAE,aAAa,EACxB,UAAU,EAAE,aAAa,EACzB,IAAI,CAAC,EAAE,WAAW;IAkBpB,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;IAI5C,QAAQ;IAIR,QAAQ;CACT"}