math-exercises 2.0.2 → 2.0.4

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

@@ -1,37 +1,37 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-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 + "";
-    }
-    toMathString() {
-        return `${this.mathString}`;
-    }
-    toTex() {
-        return `${this.tex}`;
-    }
-    toMathjs() {
-        return this.toMathString();
-    }
-    toAllValidTexs() {
-        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(",", "."));
-        return res;
-    }
-    toEquivalentNodes() {
-        return [this];
-    }
-}
-exports.NumberNode = NumberNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+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 + "";
+    }
+    toMathString() {
+        return `${this.mathString}`;
+    }
+    toTex() {
+        return `${this.tex}`;
+    }
+    toMathjs() {
+        return this.toMathString();
+    }
+    toAllValidTexs() {
+        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(",", "."));
+        return res;
+    }
+    toEquivalentNodes() {
+        return [this];
+    }
+}
+exports.NumberNode = NumberNode;

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

@@ -1,12 +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[];
-}
+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.js

@@ -1,26 +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;
+"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/numbers/piNode.d.ts

@@ -1,3 +1,3 @@
-import { ConstantNode } from './constantNode';
-export declare const PiNode: ConstantNode;
+import { ConstantNode } from './constantNode';
+export declare const PiNode: ConstantNode;
 //# sourceMappingURL=piNode.d.ts.map

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

@@ -1,5 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.PiNode = void 0;
-const constantNode_1 = require("./constantNode");
-exports.PiNode = new constantNode_1.ConstantNode('\\pi', 'pi');
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PiNode = void 0;
+const constantNode_1 = require("./constantNode");
+exports.PiNode = new constantNode_1.ConstantNode('\\pi', 'pi');

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

@@ -1,20 +1,19 @@
-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(opts?: NodeOptions): Node[];
-    toAllTexs(): string[];
-    toAllValidTexs(opts?: NodeOptions): string[];
-    toTex(): string;
-    toMathjs(): any;
-}
+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(opts?: NodeOptions): Node[];
+    toAllTexs(): string[];
+    toAllValidTexs(opts?: NodeOptions): string[];
+    toTex(): string;
+}
 //# 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;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"}
+{"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;CAOhB"}

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

@@ -1,80 +1,77 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-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}`;
-};
-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(opts) {
-        const options = opts ?? this.opts;
-        const res = [];
-        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;
-    }
-    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();
-        return addNodeToTex(this.leftChild.toTex(), rightTex);
-    }
-    toMathjs() {
-        return (0, mathjs_1.add)(this.leftChild.toMathjs(), this.rightChild.toMathjs());
-    }
-}
-exports.AddNode = AddNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AddNode = exports.isAddNode = void 0;
+// import { add } from "mathjs";
+const node_1 = require("../node");
+const operatorNode_1 = require("./operatorNode");
+const coinFlip_1 = require("../../../utils/coinFlip");
+const permutations_1 = require("../../../utils/permutations");
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+const 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}`;
+};
+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(opts) {
+        const options = opts ?? this.opts;
+        const res = [];
+        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;
+    }
+    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();
+        return addNodeToTex(this.leftChild.toTex(), rightTex);
+    }
+}
+exports.AddNode = AddNode;

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

@@ -1,21 +1,20 @@
-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: AlgebraicNode, rightChild: AlgebraicNode);
-    toMathString(): string;
-    toEquivalentNodes(opts?: NodeOptions): Node[];
-    toAllValidTexs(): string[];
-    toTex(): string;
-    toMathjs(): number | import("mathjs").Unit;
-}
+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: AlgebraicNode, rightChild: AlgebraicNode);
+    toMathString(): string;
+    toEquivalentNodes(opts?: NodeOptions): Node[];
+    toAllValidTexs(): string[];
+    toTex(): string;
+}
 //# sourceMappingURL=divideNode.d.ts.map

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,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"}
+{"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;CAMhB"}

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

@@ -1,66 +1,63 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-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 ((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 ((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}`;
-};
-class DivideNode {
-    /**
-     * @param leftChild num
-     * @param rightChild denum
-     */
-    constructor(leftChild, rightChild) {
-        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(opts) {
-        const res = [];
-        const rightNodes = this.rightChild.toEquivalentNodes();
-        const leftNodes = this.leftChild.toEquivalentNodes();
-        rightNodes.forEach((rightNode) => {
-            leftNodes.forEach((leftNode) => {
-                res.push(new DivideNode(leftNode, rightNode));
-            });
-        });
-        return res;
-    }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
-    }
-    toTex() {
-        return divideNodeToTex(this.leftChild, this.rightChild);
-    }
-    toMathjs() {
-        return (0, mathjs_1.divide)(this.leftChild.toMathjs(), this.rightChild.toMathjs());
-    }
-}
-exports.DivideNode = DivideNode;
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DivideNode = exports.isDivideNode = void 0;
+// import { divide } from "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 ((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 ((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}`;
+};
+class DivideNode {
+    /**
+     * @param leftChild num
+     * @param rightChild denum
+     */
+    constructor(leftChild, rightChild) {
+        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(opts) {
+        const res = [];
+        const rightNodes = this.rightChild.toEquivalentNodes();
+        const leftNodes = this.leftChild.toEquivalentNodes();
+        rightNodes.forEach((rightNode) => {
+            leftNodes.forEach((leftNode) => {
+                res.push(new DivideNode(leftNode, rightNode));
+            });
+        });
+        return res;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toTex() {
+        return divideNodeToTex(this.leftChild, this.rightChild);
+    }
+}
+exports.DivideNode = DivideNode;

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

@@ -1,23 +1,22 @@
-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
-     */
-    id: OperatorIds;
-    leftChild: AlgebraicNode;
-    rightChild: AlgebraicNode;
-    type: NodeType;
-    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
-    toMathString(): string;
-    toInversed(): FractionNode;
-    toEquivalentNodes(opts?: NodeOptions): Node[];
-    toAllValidTexs(opts?: NodeOptions): string[];
-    toTex(): string;
-    toMathjs(): import("mathjs").Fraction;
-}
+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
+     */
+    id: OperatorIds;
+    leftChild: AlgebraicNode;
+    rightChild: AlgebraicNode;
+    type: NodeType;
+    constructor(leftChild: AlgebraicNode, rightChild: AlgebraicNode, opts?: NodeOptions);
+    toMathString(): string;
+    toInversed(): FractionNode;
+    toEquivalentNodes(opts?: NodeOptions): Node[];
+    toAllValidTexs(opts?: NodeOptions): string[];
+    toTex(): string;
+}
 //# 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;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"}
+{"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;CAiBhB"}