math-exercises 2.0.1 → 2.0.2

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"}

package/lib/tree/nodes/complex/complexNode.js

@@ -3,65 +3,44 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.ComplexNode = void 0;
 const mathjs_1 = require("mathjs");
 const node_1 = require("../node");
-const complex_1 = require("../../../math/complex/complex");
-const numberNode_1 = require("../numbers/numberNode");
 const variableNode_1 = require("../variables/variableNode");
-const oppositeNode_1 = require("../functions/oppositeNode");
 const multiplyNode_1 = require("../operators/multiplyNode");
 const addNode_1 = require("../operators/addNode");
 class ComplexNode {
-    constructor(re, im, tex, mathString) {
+    constructor(re, im, opts) {
         this.type = node_1.NodeType.number;
         this.re = re;
         this.im = im;
-        const reTex = re === 0 ? '' : re.toString();
-        const imTex = im === 0
-            ? ''
-            : im === 1
-                ? re === 0
-                    ? 'i'
-                    : '+i'
-                : im === -1
-                    ? '-i'
-                    : im > 0
-                        ? re === 0
-                            ? `${im}i`
-                            : `+${im}i`
-                        : `${im}i`;
-        const formatedTex = re === 0 && im === 0 ? '0' : `${reTex}${imTex}`;
-        this.tex = tex || formatedTex;
-        this.mathString = mathString || this.tex;
+        this.opts = opts;
     }
-    toEquivalentNodes() {
+    toEquivalentNodes(opts) {
+        const options = opts ?? this.opts;
         const res = [];
-        if (this.im === 0) {
-            return [new numberNode_1.NumberNode(this.re)];
+        if (this.im.toTex() === "0") {
+            return this.re.toEquivalentNodes(options);
         }
-        if (this.re === 0) {
-            if (this.im === 1) {
-                return [new variableNode_1.VariableNode('i')];
-            }
-            if (this.im === -1) {
-                return [new oppositeNode_1.OppositeNode(new variableNode_1.VariableNode('i'))];
-            }
-            return new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.im), new variableNode_1.VariableNode('i')).toEquivalentNodes();
+        if (this.re.toTex() === "0") {
+            return new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i")).toEquivalentNodes(options);
         }
-        return new addNode_1.AddNode(new numberNode_1.NumberNode(this.re), new multiplyNode_1.MultiplyNode(new numberNode_1.NumberNode(this.im), new variableNode_1.VariableNode('i'))).toEquivalentNodes();
+        return new addNode_1.AddNode(this.re, new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i"))).toEquivalentNodes(options);
     }
-    toAllValidTexs() {
-        return this.toEquivalentNodes().map((node) => node.toTex());
+    toAllValidTexs(opts) {
+        const options = opts ?? this.opts;
+        return this.toEquivalentNodes(options).map((node) => node.toTex());
     }
     toMathString() {
-        return `${this.mathString ? this.mathString : this.tex}`;
+        return this.toTex();
     }
     toTex() {
-        return `${this.tex}`;
+        if (this.im.toTex() === "0")
+            return this.re.toTex();
+        if (this.re.toTex() === "0") {
+            return new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i")).toTex();
+        }
+        return new addNode_1.AddNode(this.re, new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i"))).toTex();
     }
     toMathjs() {
-        return (0, mathjs_1.complex)(this.re, this.im);
-    }
-    toComplex() {
-        return new complex_1.Complex(this.re, this.im);
+        return (0, mathjs_1.complex)((0, mathjs_1.evaluate)(this.re.toMathjs()), (0, mathjs_1.evaluate)(this.im.toMathjs()));
     }
 }
 exports.ComplexNode = ComplexNode;

package/lib/tree/nodes/equations/equalNode.d.ts

@@ -0,0 +1,14 @@
+import { Node, NodeOptions, NodeType } from "../node";
+export declare class EqualNode implements Node {
+    leftChild: Node;
+    rightChild: Node;
+    opts?: NodeOptions;
+    type: NodeType;
+    constructor(leftChild: Node, rightChild: Node, opts?: NodeOptions);
+    toEquivalentNodes(): Node[];
+    toAllValidTexs(): string[];
+    toMathString(): string;
+    toTex(): string;
+    toMathjs(): boolean | import("mathjs").MathCollection;
+}
+//# sourceMappingURL=equalNode.d.ts.map

package/lib/tree/nodes/equations/equalNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equalNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGtD,qBAAa,SAAU,YAAW,IAAI;IACpC,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,EAAE,IAAI,CAAC;IACjB,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAC;gBACH,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,WAAW;IAOjE,iBAAiB;IAiBjB,cAAc,IAAI,MAAM,EAAE;IAI1B,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;CAGT"}

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

@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EqualNode = void 0;
+const mathjs_1 = require("mathjs");
+const node_1 = require("../node");
+class EqualNode {
+    constructor(leftChild, rightChild, opts) {
+        this.leftChild = leftChild;
+        this.rightChild = rightChild;
+        this.type = node_1.NodeType.equality;
+        this.opts = opts;
+    }
+    toEquivalentNodes() {
+        const res = [];
+        const rightNodes = this.rightChild.toEquivalentNodes();
+        if (this.opts?.allowRawRightChildAsSolution) {
+            res.push(...rightNodes);
+        }
+        const leftNodes = this.leftChild.toEquivalentNodes();
+        rightNodes.forEach((rightNode) => {
+            leftNodes.forEach((leftNode) => {
+                res.push(new EqualNode(leftNode, rightNode));
+                res.push(new EqualNode(rightNode, leftNode));
+            });
+        });
+        return res;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    toMathString() {
+        return `${this.leftChild.toMathString()} = ${this.rightChild.toMathString()}`;
+    }
+    toTex() {
+        return `${this.leftChild.toTex()}=${this.rightChild.toTex()}`;
+    }
+    toMathjs() {
+        return (0, mathjs_1.equal)(this.leftChild.toMathjs(), this.rightChild.toMathjs());
+    }
+}
+exports.EqualNode = EqualNode;

package/lib/tree/nodes/equations/equationSolutionNode.d.ts

@@ -0,0 +1,21 @@
+import { Node, NodeOptions, NodeType } from "../node";
+import { DiscreteSetNode } from "../sets/discreteSetNode";
+type EquationSolutionNodeOptions = {
+    variable?: string;
+    opts?: NodeOptions;
+};
+export declare class EquationSolutionNode implements Node {
+    type: NodeType;
+    variable: string;
+    solutionsSet: DiscreteSetNode;
+    opts?: NodeOptions;
+    constructor(solutionsSet: DiscreteSetNode, params?: EquationSolutionNodeOptions);
+    toAllValidTexs(): string[];
+    toAllTexs(): string[];
+    toEquivalentNodes(opts?: NodeOptions): EquationSolutionNode[];
+    toMathString(): string;
+    toMathjs(): string;
+    toTex(): string;
+}
+export {};
+//# sourceMappingURL=equationSolutionNode.d.ts.map

package/lib/tree/nodes/equations/equationSolutionNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"equationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAE1D,KAAK,2BAA2B,GAAG;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,IAAI,CAAC,EAAE,WAAW,CAAA;CAAE,CAAC;AAC7E,qBAAa,oBAAqB,YAAW,IAAI;IAC/C,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,MAAM,CAAC;IACjB,YAAY,EAAE,eAAe,CAAC;IAC9B,IAAI,CAAC,EAAE,WAAW,CAAC;gBAEjB,YAAY,EAAE,eAAe,EAC7B,MAAM,CAAC,EAAE,2BAA2B;IActC,cAAc;IAId,SAAS;IAUT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAQpC,YAAY;IAGZ,QAAQ;IAGR,KAAK;CAGN"}

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

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EquationSolutionNode = void 0;
+const node_1 = require("../node");
+class EquationSolutionNode {
+    constructor(solutionsSet, params) {
+        this.type = node_1.NodeType.set;
+        this.solutionsSet = solutionsSet;
+        this.variable = params?.variable ?? "x";
+        this.opts = params?.opts
+            ? {
+                ...params.opts,
+                allowRawRightChildAsSolution: params.opts.allowRawRightChildAsSolution ?? true,
+            }
+            : { allowRawRightChildAsSolution: true };
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes(this.opts).flatMap((el) => el.toAllTexs());
+    }
+    toAllTexs() {
+        const res = [this.toTex(), this.solutionsSet.toTex()];
+        if (this.solutionsSet.elements.length === 1) {
+            const solTex = this.solutionsSet.elements[0].toTex();
+            res.push(`${this.variable}=${solTex}`);
+            if (this.opts?.allowRawRightChildAsSolution)
+                res.push(solTex);
+        }
+        return res;
+    }
+    toEquivalentNodes(opts) {
+        const equivs = this.solutionsSet.toEquivalentNodes(opts ?? this.opts);
+        return equivs.map((equiv) => new EquationSolutionNode(equiv, { variable: this.variable, opts }));
+    }
+    toMathString() {
+        return "";
+    }
+    toMathjs() {
+        return `S={${this.solutionsSet.toMathjs()}}`;
+    }
+    toTex() {
+        return `S=${this.solutionsSet.toTex()}`;
+    }
+}
+exports.EquationSolutionNode = EquationSolutionNode;

package/lib/tree/nodes/equations/multiEqualNode.d.ts

@@ -0,0 +1,14 @@
+import { Node, NodeOptions, NodeType } from "../node";
+export declare class MultiEqualNode implements Node {
+    children: Node[];
+    opts?: NodeOptions;
+    type: NodeType;
+    constructor(children: Node[], opts?: NodeOptions);
+    toEquivalentNodes(): MultiEqualNode[];
+    toAllTexs(): string[];
+    toAllValidTexs(): string[];
+    toMathString(): string;
+    toTex(): string;
+    toMathjs(): string;
+}
+//# sourceMappingURL=multiEqualNode.d.ts.map

package/lib/tree/nodes/equations/multiEqualNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"multiEqualNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/multiEqualNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAItD,qBAAa,cAAe,YAAW,IAAI;IACzC,QAAQ,EAAE,IAAI,EAAE,CAAC;IACjB,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAC;gBACH,QAAQ,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,WAAW;IAMhD,iBAAiB;IAUjB,SAAS;IAMT,cAAc,IAAI,MAAM,EAAE;IAI1B,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;CAGT"}

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

@@ -0,0 +1,39 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MultiEqualNode = void 0;
+const node_1 = require("../node");
+const permutations_1 = require("../../../utils/permutations");
+const cartesianProducts_1 = require("../../../utils/cartesianProducts");
+class MultiEqualNode {
+    constructor(children, opts) {
+        this.children = children;
+        this.type = node_1.NodeType.equality;
+        this.opts = opts;
+    }
+    toEquivalentNodes() {
+        const res = [];
+        const equivs = this.children.map((node) => node.toEquivalentNodes());
+        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        cartesians.forEach((product) => {
+            res.push(new MultiEqualNode(product));
+        });
+        return res;
+    }
+    toAllTexs() {
+        const permutations = (0, permutations_1.permute)(this.children);
+        return permutations.flatMap((permutation) => `${permutation.map((node) => node.toTex()).join("=")}`);
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().flatMap((node) => node.toAllTexs());
+    }
+    toMathString() {
+        return this.toTex();
+    }
+    toTex() {
+        return `${this.children.map((node) => node.toTex()).join("=")}`;
+    }
+    toMathjs() {
+        return this.toTex();
+    }
+}
+exports.MultiEqualNode = MultiEqualNode;

package/lib/tree/nodes/functions/absNode.d.ts

@@ -0,0 +1,17 @@
+import { Node, NodeType } from "../node";
+import { FunctionNode, FunctionsIds } from "./functionNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isAbsNode(a: Node): a is AbsNode;
+export declare class AbsNode implements FunctionNode {
+    id: FunctionsIds;
+    child: AlgebraicNode;
+    type: NodeType;
+    constructor(child: AlgebraicNode);
+    toMathString(): string;
+    toTex(): string;
+    toMathjs(): number;
+    toEquivalentNodes(): Node[];
+    toAllValidTexs(): string[];
+    simplify(): Node;
+}
+//# sourceMappingURL=absNode.d.ts.map

package/lib/tree/nodes/functions/absNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"absNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/absNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AACD,qBAAa,OAAQ,YAAW,YAAY;IAC1C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;gBAEH,KAAK,EAAE,aAAa;IAMhC,YAAY,IAAI,MAAM;IAItB,KAAK,IAAI,MAAM;IAGf,QAAQ;IAIR,iBAAiB,IAAI,IAAI,EAAE;IAS3B,cAAc,IAAI,MAAM,EAAE;IAG1B,QAAQ,IAAI,IAAI;CAGjB"}

package/lib/tree/nodes/functions/absNode.js

@@ -0,0 +1,41 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AbsNode = exports.isAbsNode = void 0;
+const mathjs_1 = require("mathjs");
+const node_1 = require("../node");
+const functionNode_1 = require("./functionNode");
+function isAbsNode(a) {
+    return (0, functionNode_1.isFunctionNode)(a) && a.id === functionNode_1.FunctionsIds.abs;
+}
+exports.isAbsNode = isAbsNode;
+class AbsNode {
+    constructor(child) {
+        this.id = functionNode_1.FunctionsIds.abs;
+        this.child = child;
+        this.type = node_1.NodeType.function;
+    }
+    toMathString() {
+        return `abs(${this.child.toMathString()})`;
+    }
+    toTex() {
+        return `\\left|${this.child.toTex()}\\right|`;
+    }
+    toMathjs() {
+        return (0, mathjs_1.abs)(this.child.toMathjs());
+    }
+    toEquivalentNodes() {
+        const res = [];
+        const childNodes = this.child.toEquivalentNodes();
+        childNodes.forEach((childNode) => {
+            res.push(new AbsNode(childNode));
+        });
+        return res;
+    }
+    toAllValidTexs() {
+        return this.toEquivalentNodes().map((node) => node.toTex());
+    }
+    simplify() {
+        return this;
+    }
+}
+exports.AbsNode = AbsNode;

package/lib/tree/nodes/functions/cosNode.d.ts

@@ -1,8 +1,12 @@
-import { Node, NodeType } from '../node';
-import { FunctionNode } from './functionNode';
-export declare class CosNode extends FunctionNode implements Node {
+import { Node, NodeType } from "../node";
+import { FunctionNode, FunctionsIds } from "./functionNode";
+import { AlgebraicNode } from "../algebraicNode";
+export declare function isCosNode(a: Node): a is CosNode;
+export declare class CosNode implements FunctionNode {
+    id: FunctionsIds;
+    child: AlgebraicNode;
     type: NodeType;
-    constructor(child: Node);
+    constructor(child: AlgebraicNode);
     toMathString(): string;
     toEquivalentNodes(): Node[];
     toAllValidTexs(): string[];

package/lib/tree/nodes/functions/cosNode.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cosNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/cosNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAgB,MAAM,gBAAgB,CAAC;AAE5D,qBAAa,OAAQ,SAAQ,YAAa,YAAW,IAAI;IACvD,IAAI,EAAE,QAAQ,CAAqB;gBAEvB,KAAK,EAAE,IAAI;IAIvB,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,IAAI,EAAE;IAS3B,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,QAAQ,IAAI,IAAI;CAGjB"}
+{"version":3,"file":"cosNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/functions/cosNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,YAAY,EAAkB,MAAM,gBAAgB,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,IAAI,OAAO,CAE/C;AACD,qBAAa,OAAQ,YAAW,YAAY;IAC1C,EAAE,EAAE,YAAY,CAAC;IACjB,KAAK,EAAE,aAAa,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC;gBAEH,KAAK,EAAE,aAAa;IAMhC,YAAY,IAAI,MAAM;IAItB,iBAAiB,IAAI,IAAI,EAAE;IAS3B,cAAc,IAAI,MAAM,EAAE;IAI1B,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,QAAQ,IAAI,IAAI;CAGjB"}