math-exercises 2.2.98 → 3.0.2

package/lib/tests/pdfs/quizPdfPreambule.js

@@ -0,0 +1,76 @@
+export const quizPdfPreambule = () => {
+    return `\\documentclass[a4paper, 8pt]{article}
+\\usepackage[dvipsnames]{xcolor}
+\\usepackage[utf8]{inputenc}
+\\usepackage[T1]{fontenc}
+\\usepackage[french]{babel}
+
+\\usepackage{arev}
+\\usepackage[left=1cm, right=1cm, top=1cm, bottom=1cm,includehead,includefoot]{geometry}
+\\usepackage{eurosym}
+\\usepackage{amstext} 
+\\DeclareRobustCommand{\\officialeuro}{%
+  \\ifmmode\\expandafter\\text\\fi
+  {\\fontencoding{U}\\fontfamily{eurosym}\\selectfont e}}
+
+\\usepackage{robust-externalize}
+\\usepackage{amsmath}
+\\usepackage{multicol}
+\\usepackage{qrcode}
+\\usepackage{listings}
+\\usepackage{hyperref}
+\\usepackage{tikz}
+\\usepackage{amssymb}
+\\usepackage{fancyhdr}
+
+\\newenvironment{tightcenter}{%
+  \\setlength\\topsep{0pt}
+  \\setlength\\parskip{0pt}
+  \\begin{center}
+}{%
+  \\end{center}
+}
+
+\\pagestyle{fancy}
+
+\\definecolor{codegreen}{rgb}{0,0.6,0}
+\\definecolor{codegray}{rgb}{0.5,0.5,0.5}
+\\definecolor{codepurple}{rgb}{0.58,0,0.82}
+\\definecolor{backcolour}{rgb}{0.95,0.95,0.92}
+ 
+\\lstdefinestyle{mystyle}{
+    backgroundcolor=\\color{backcolour},   
+    commentstyle=\\color{codegreen},
+    keywordstyle=\\color{magenta},
+    numberstyle=\\tiny\\color{codegray},
+    stringstyle=\\color{codepurple},
+    basicstyle=\\footnotesize,
+    breakatwhitespace=false,         
+    breaklines=true,                 
+    captionpos=b,                    
+    keepspaces=true,                 
+    numbers=left,                    
+    numbersep=5pt,                  
+    showspaces=false,                
+    showstringspaces=false,
+    showtabs=false,                  
+    tabsize=2,
+    xleftmargin=2em
+}
+
+\\setlength\\parindent{0pt}
+\\setlength{\\columnseprule}{0.5pt} 
+\\lstset{style=mystyle}
+
+\\newenvironment{correctionColored}{\\par\\color{RoyalBlue}}{\\par}
+
+\\begin{document}
+\\lstset{language=Python}
+%\\fancyhead{}
+%\\fancyfoot{}
+\\renewcommand{\\headrulewidth}{0pt}
+\\renewcommand{\\footrulewidth}{0.4pt}
+\\renewcommand{\\footruleskip}{2pt}
+
+`;
+};

package/lib/tests/questionTest.d.ts

@@ -0,0 +1,6 @@
+import { Exercise, Question } from "../exercises/exercise.js";
+export declare const questionTest: (exo: Exercise, question: Question) => {
+    veaTime: number;
+    qcmTime: number;
+};
+//# sourceMappingURL=questionTest.d.ts.map

package/lib/tests/questionTest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"questionTest.d.ts","sourceRoot":"","sources":["../../src/tests/questionTest.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAIjE,eAAO,MAAM,YAAY,QAAS,QAAQ,YAAY,QAAQ;;;CAkK7D,CAAC"}

package/lib/tests/questionTest.js

@@ -0,0 +1,156 @@
+import { latexTester } from "../latexTester.js";
+import { formatMarkdownToLatex } from "./pdfs/formatMdToLatex.js";
+export const questionTest = (exo, question) => {
+    let qcmTime = -1;
+    let veaTime = -1;
+    if (exo.hasHintAndCorrection) {
+        if (!question.hint?.length) {
+            throw new Error(`exo ${exo.id} has no hint`);
+        }
+        const formatedHint = formatMarkdownToLatex(question.hint);
+        if (!latexTester(formatedHint)) {
+            throw new Error(`exo ${exo.id} has invalid hint`);
+        }
+        if (!question.correction?.length) {
+            throw new Error(`exo ${exo.id} has no correction`);
+        }
+        const formatedCorrection = formatMarkdownToLatex(question.correction);
+        if (!latexTester(formatedCorrection)) {
+            throw new Error(`exo ${exo.id} has invalid correction`);
+        }
+    }
+    if (question.hint || question.correction) {
+        if (!exo.hasHintAndCorrection) {
+            throw new Error(`exo ${exo.id} has hint or correction but not hasHintAndCorr`);
+        }
+    }
+    if (!question.identifiers)
+        throw new Error(`exo ${exo.id} has no identifiers`);
+    const dotDecimalPattern = /\d+\.\d+/;
+    if (question.studentGgbOptions?.coords?.length) {
+        if (exo.answerType !== "GGB") {
+            throw new Error(`exo ${exo.id} has studentGgbOptions but answerType is not GGB`);
+        }
+    }
+    if (exo.answerType === "GGB") {
+        if (!question.ggbAnswer?.length)
+            throw new Error(`exo ${exo.id} has no ggbAnswer`);
+        if (!question.studentGgbOptions?.coords?.length)
+            throw new Error(`exo ${exo.id} has no studentGgbOptions Coords`);
+    }
+    else {
+        if (!question.answer)
+            throw new Error(`exo ${exo.id} has no answer`);
+    }
+    if (question.answer) {
+        if (question.answer.match(dotDecimalPattern))
+            throw new Error(`exo ${exo.id} has invalid number format`);
+        if (question.answer.includes("[object Object]"))
+            throw new Error(`exo ${exo.id} has invalid answer`);
+        if (question.answerFormat !== "raw") {
+            if (!latexTester(question.answer, true))
+                throw new Error(`exo ${exo.id} has invalid answer`);
+        }
+    }
+    if (!question.instruction.length) {
+        throw new Error(`exo ${exo.id} has no instruction`);
+    }
+    if (question.instruction.includes("[object Object]")) {
+        throw new Error(`exo ${exo.id} has invalid instruction`);
+    }
+    const imgRegex = /!\[.*?\]\((.*?)\)/g;
+    const matches = question.instruction.matchAll(imgRegex);
+    for (const match of matches) {
+        question.instruction = question.instruction.replace(match[0], ``);
+    }
+    const formatedInstruction = formatMarkdownToLatex(question.instruction);
+    if (!latexTester(formatedInstruction)) {
+        throw new Error(`exo ${exo.id} has invalid instruction`);
+    }
+    if (exo.hasGeogebra) {
+        if (!question.ggbOptions?.coords?.length)
+            throw new Error(`exo ${exo.id} has no ggbOptions coords`);
+    }
+    if (question.ggbOptions) {
+        if (!exo.hasGeogebra)
+            throw new Error(`exo ${exo.id} has ggbOptions but not hasGeogebra`);
+    }
+    //! probélamtique car la réponse crée par nous n'est pas toujours au même format que celle fourni par l'élève
+    //! voir par ex drawAvector
+    // if (exo.answerType === "GGB") {
+    //   let before = Date.now();
+    //   console.log("will test ggbVea");
+    //   expect(
+    //     exo.isGGBAnswerValid!(question.ggbAnswer!, {
+    //       ggbAnswer: question.ggbAnswer,
+    //       ...question.identifiers,
+    //     }),
+    //   ).toBe(true);
+    //   let after = Date.now();
+    //   let time = after - before;
+    //   ggbVeaTimes.push(time);
+    //   if (worstGGBVEATime.time < time) {
+    //     worstGGBVEATime = {
+    //       exoId: exo.id,
+    //       time,
+    //     };
+    //   }
+    // }
+    if (exo.answerType !== "QCM" &&
+        exo.answerType !== "QCU" &&
+        exo.answerType !== "GGB") {
+        if (!question.keys)
+            throw new Error(`exo ${exo.id} has no keys`);
+        const answer = question.answer;
+        let before = Date.now();
+        console.log("will test vea : ", exo.id);
+        if (!exo.isAnswerValid(answer, { answer, ...question.identifiers })) {
+            throw new Error(`exo ${exo.id} has invalid VEA`);
+        }
+        let after = Date.now();
+        veaTime = after - before;
+    }
+    if (exo.answerType !== "free" && exo.answerType !== "GGB") {
+        let before = Date.now();
+        console.log("will generate props : ", exo.id);
+        const props = exo.getPropositions(4, {
+            answer: question.answer,
+            ...question.identifiers,
+        });
+        let after = Date.now();
+        qcmTime = after - before;
+        if (props.length > 4)
+            throw new Error(`exo ${exo.id} has too many props`);
+        const rightAnswers = props.filter((prop) => prop.isRightAnswer).length;
+        if (exo.isQCM) {
+            if (rightAnswers < 2)
+                throw new Error(`exo ${exo.id} has invalid props`);
+        }
+        else {
+            if (rightAnswers !== 1)
+                throw new Error(`exo ${exo.id} has invalid props`);
+        }
+        props.forEach((prop) => {
+            if (prop.statement.match(dotDecimalPattern))
+                throw new Error(`exo ${exo.id} has invalid prop`);
+            if (prop.statement.includes("[object Object]"))
+                throw new Error(`exo ${exo.id} has invalid prop`);
+            if (!props.every((prop2) => prop2.id === prop.id || prop.statement !== prop2.statement))
+                throw new Error(`exo ${exo.id} has invalid prop`);
+            if (prop.format !== "raw") {
+                if (!latexTester(prop.statement, true))
+                    throw new Error(`exo ${exo.id} has invalid prop`);
+            }
+        });
+        if (question.ggbOptions?.coords) {
+            question.ggbOptions?.coords.forEach((element) => {
+                if (Math.abs(element) === Infinity)
+                    throw new Error(`exo ${exo.id} has invalid coords`);
+            });
+        }
+    }
+    return {
+        veaTime,
+        qcmTime,
+    };
+};

package/lib/tests/simplify.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=simplify.test.d.ts.map

package/lib/tests/simplify.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"simplify.test.d.ts","sourceRoot":"","sources":["../../src/tests/simplify.test.ts"],"names":[],"mappings":""}

package/lib/tests/simplify.test.js

@@ -0,0 +1,32 @@
+import { OppositeNode } from "../tree/nodes/functions/oppositeNode.js";
+import { NumberNode } from "../tree/nodes/numbers/numberNode.js";
+import { AddNode } from "../tree/nodes/operators/addNode.js";
+import { FractionNode } from "../tree/nodes/operators/fractionNode.js";
+const data = [
+    {
+        in: new AddNode(new NumberNode(1), new NumberNode(2)),
+        out: new NumberNode(3),
+    },
+    {
+        in: new FractionNode(new NumberNode(2), new NumberNode(4)),
+        out: new FractionNode(new NumberNode(1), new NumberNode(2)),
+    },
+    {
+        in: new FractionNode(new NumberNode(-2), new NumberNode(4)),
+        out: new OppositeNode(new FractionNode(new NumberNode(1), new NumberNode(2))),
+    },
+    {
+        in: new FractionNode(new NumberNode(2), new NumberNode(-4)),
+        out: new OppositeNode(new FractionNode(new NumberNode(1), new NumberNode(2))),
+    },
+];
+try {
+    for (const d of data) {
+        if (!d.in.simplify().equals(d.out))
+            throw new Error(`simplify(${d.in}) != ${d.out}`);
+    }
+}
+catch (err) {
+    console.log(err);
+    throw err;
+}

package/lib/tests/singleExo.test.d.ts

@@ -0,0 +1,2 @@
+import "../prototypesEnhancement.js";
+//# sourceMappingURL=singleExo.test.d.ts.map

package/lib/tests/singleExo.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"singleExo.test.d.ts","sourceRoot":"","sources":["../../src/tests/singleExo.test.ts"],"names":[],"mappings":"AAqBA,OAAO,6BAA6B,CAAC"}

package/lib/tests/singleExo.test.js

@@ -0,0 +1,9 @@
+import { calculateFrequency, } from "../exercises/math/index.js";
+import "../prototypesEnhancement.js";
+import { exoTest } from "./exoTest.js";
+try {
+    exoTest(calculateFrequency);
+}
+catch (err) {
+    throw err;
+}

package/lib/tests/xl.test.d.ts

@@ -0,0 +1,2 @@
+import "../prototypesEnhancement.js";
+//# sourceMappingURL=xl.test.d.ts.map

package/lib/tests/xl.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"xl.test.d.ts","sourceRoot":"","sources":["../../src/tests/xl.test.ts"],"names":[],"mappings":"AAGA,OAAO,6BAA6B,CAAC"}

package/lib/tests/xl.test.js

@@ -0,0 +1,11 @@
+import { exosTest } from "./exosTest.js";
+import * as PCExercises from "../exercises/pc/index.js";
+import "../prototypesEnhancement.js";
+const pcExercises = Object.values(PCExercises);
+try {
+    exosTest(pcExercises);
+}
+catch (err) {
+    console.log(err);
+    throw err;
+}

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

@@ -1,4 +1,4 @@
-import { Node, NodeOptions } from "./node";
+import { Node, NodeOptions } from "./node.js";
 export type SimplifyOptions = {
     forbidFactorize?: boolean;
     forceDistributeFractions?: boolean;

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

@@ -1 +1 @@
-{"version":3,"file":"algebraicNode.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/algebraicNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAE3C,MAAM,MAAM,eAAe,GAAG;IAC5B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,MAAM,WAAW,aAAc,SAAQ,IAAI;IACzC,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC;IACpD,oBAAoB,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,KAAK,aAAa,CAAC;IAC7E,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,aAAa,EAAE,CAAC;IAC3D,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,eAAe,KAAK,aAAa,CAAC;IACpD,MAAM,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO,CAAC;IACzC,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,KAAK,aAAa,CAAC;CACjD;AAED,eAAO,MAAM,eAAe,SAAU,IAAI,0BACA,CAAC"}
+{"version":3,"file":"algebraicNode.d.ts","sourceRoot":"","sources":["../../../src/tree/nodes/algebraicNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE9C,MAAM,MAAM,eAAe,GAAG;IAC5B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B,uBAAuB,CAAC,EAAE,OAAO,CAAC;IAClC,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B,CAAC;AACF,MAAM,WAAW,aAAc,SAAQ,IAAI;IACzC,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,MAAM,CAAC;IACpD,oBAAoB,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,KAAK,aAAa,CAAC;IAC7E,iBAAiB,EAAE,CAAC,IAAI,CAAC,EAAE,WAAW,KAAK,aAAa,EAAE,CAAC;IAC3D,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,eAAe,KAAK,aAAa,CAAC;IACpD,MAAM,EAAE,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO,CAAC;IACzC,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,CAAC,OAAO,CAAC,EAAE,MAAM,KAAK,aAAa,CAAC;CACjD;AAED,eAAO,MAAM,eAAe,SAAU,IAAI,KAAG,IAAI,IAAI,aACX,CAAC"}

package/lib/tree/nodes/algebraicNode.js

@@ -1,5 +1 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isAlgebraicNode = void 0;
-const isAlgebraicNode = (node) => Object(node).hasOwnProperty("isNumeric");
-exports.isAlgebraicNode = isAlgebraicNode;
+export const isAlgebraicNode = (node) => Object(node).hasOwnProperty("isNumeric");

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

@@ -1,5 +1,5 @@
-import { Node, NodeIds, NodeOptions, NodeType } from "../node";
-import { AlgebraicNode } from "../algebraicNode";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node.js";
+import { AlgebraicNode } from "../algebraicNode.js";
 export declare class ComplexNode implements Node {
     re: AlgebraicNode;
     im: AlgebraicNode;

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,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAI/D,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,qBAAa,WAAY,YAAW,IAAI;IACtC,EAAE,EAAE,aAAa,CAAC;IAClB,EAAE,EAAE,aAAa,CAAC;IAClB,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAmB;gBAErB,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAKpE,aAAa;;;;;;;;;IAOb,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAkBtD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAI5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAUf,QAAQ;CAST"}
+{"version":3,"file":"complexNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/complex/complexNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAIlE,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD,qBAAa,WAAY,YAAW,IAAI;IACtC,EAAE,EAAE,aAAa,CAAC;IAClB,EAAE,EAAE,aAAa,CAAC;IAClB,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,IAAI,EAAE,QAAQ,CAAmB;gBAErB,EAAE,EAAE,aAAa,EAAE,EAAE,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,WAAW;IAKpE,aAAa;;;;;;;;;IAOb,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,aAAa,EAAE;IAkBtD,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAI5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAUf,QAAQ;CAST"}

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

@@ -1,21 +1,21 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ComplexNode = void 0;
 // import { complex, evaluate } from "mathjs";
-const node_1 = require("../node");
-const variableNode_1 = require("../variables/variableNode");
-const multiplyNode_1 = require("../operators/multiplyNode");
-const addNode_1 = require("../operators/addNode");
-class ComplexNode {
+import { NodeIds, NodeType } from "../node.js";
+import { VariableNode } from "../variables/variableNode.js";
+import { MultiplyNode } from "../operators/multiplyNode.js";
+import { AddNode } from "../operators/addNode.js";
+export class ComplexNode {
+    re;
+    im;
+    opts;
+    type = NodeType.number;
     constructor(re, im, opts) {
-        this.type = node_1.NodeType.number;
         this.re = re;
         this.im = im;
         this.opts = opts;
     }
     toIdentifiers() {
         return {
-            id: node_1.NodeIds.complex,
+            id: NodeIds.complex,
             re: this.re.toIdentifiers(),
             im: this.im.toIdentifiers(),
         };
@@ -27,9 +27,9 @@ class ComplexNode {
             return this.re.toEquivalentNodes(options);
         }
         if (this.re.toTex() === "0") {
-            return new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i")).toEquivalentNodes(options);
+            return new MultiplyNode(this.im, new VariableNode("i")).toEquivalentNodes(options);
         }
-        return new addNode_1.AddNode(this.re, new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i"))).toEquivalentNodes(options);
+        return new AddNode(this.re, new MultiplyNode(this.im, new VariableNode("i"))).toEquivalentNodes(options);
     }
     toAllValidTexs(opts) {
         const options = opts ?? this.opts;
@@ -42,12 +42,11 @@ class ComplexNode {
         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 MultiplyNode(this.im, new VariableNode("i")).toTex();
         }
-        return new addNode_1.AddNode(this.re, new multiplyNode_1.MultiplyNode(this.im, new variableNode_1.VariableNode("i"))).toTex();
+        return new AddNode(this.re, new MultiplyNode(this.im, new VariableNode("i"))).toTex();
     }
     simplify() {
         return this;
     }
 }
-exports.ComplexNode = ComplexNode;

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

@@ -1,7 +1,7 @@
-import { Affine } from "../../../math/polynomials/affine";
-import { AlgebraicNode } from "../algebraicNode";
-import { Node, NodeIds, NodeOptions, NodeType } from "../node";
-import { NodeIdentifiers } from "../nodeConstructor";
+import { Affine } from "../../../math/polynomials/affine.js";
+import { AlgebraicNode } from "../algebraicNode.js";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node.js";
+import { NodeIdentifiers } from "../nodeConstructor.js";
 export declare const equal: (a: AlgebraicNode | number | string, b: AlgebraicNode | number | string) => EqualNode;
 export type EqualNodeIdentifiers = {
     id: NodeIds.equal;

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

@@ -1 +1 @@
-{"version":3,"file":"equalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equalNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,+BAA+B,CAAC;AAEvD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAmB,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAEtE,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,cAOnC,CAAC;AAEF,MAAM,MAAM,oBAAoB,GAAG;IACjC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC;IAClB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AAEF,8BAAsB,oBAAoB;IACxC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,oBAAoB,GAAG,SAAS;CAOrE;AAED,eAAO,MAAM,WAAW,SAAU,IAAI,sBACL,CAAC;AAElC,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,aAAa,IAAI,oBAAoB;IAQrC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAmBpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAM5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,OAAO;IAIP,OAAO;CAUR;AAED,eAAO,MAAM,gCAAgC,eAC/B,MAAM,eACL,MAAM,SAuBpB,CAAC"}
+{"version":3,"file":"equalNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equalNode.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAE1D,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAmB,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAEzE,eAAO,MAAM,KAAK,MACb,aAAa,GAAG,MAAM,GAAG,MAAM,KAC/B,aAAa,GAAG,MAAM,GAAG,MAAM,cAOnC,CAAC;AAEF,MAAM,MAAM,oBAAoB,GAAG;IACjC,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC;IAClB,SAAS,EAAE,eAAe,CAAC;IAC3B,UAAU,EAAE,eAAe,CAAC;IAC5B,IAAI,CAAC,EAAE,WAAW,CAAC;CACpB,CAAC;AAEF,8BAAsB,oBAAoB;IACxC,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,oBAAoB,GAAG,SAAS;CAOrE;AAED,eAAO,MAAM,WAAW,SAAU,IAAI,KAAG,IAAI,IAAI,SAChB,CAAC;AAElC,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,aAAa,IAAI,oBAAoB;IAQrC,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAmBpC,cAAc,CAAC,IAAI,CAAC,EAAE,WAAW,GAAG,MAAM,EAAE;IAM5C,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,OAAO;IAIP,OAAO;CAUR;AAED,eAAO,MAAM,gCAAgC,eAC/B,MAAM,eACL,MAAM,SAuBpB,CAAC"}

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

@@ -1,33 +1,31 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.firstDegreeEquationResolutionTex = exports.EqualNode = exports.isEqualNode = exports.EqualNodeConstructor = exports.equal = void 0;
-const coinFlip_1 = require("../../../utils/alea/coinFlip");
-const node_1 = require("../node");
-const nodeConstructor_1 = require("../nodeConstructor");
-const equal = (a, b) => {
+import { coinFlip } from "../../../utils/alea/coinFlip.js";
+import { NodeIds, NodeType } from "../node.js";
+import { NodeConstructor } from "../nodeConstructor.js";
+export const equal = (a, b) => {
     const nodeA = typeof a === "number" ? a.toTree() : typeof a === "string" ? a.toTree() : a;
     const nodeB = typeof b === "number" ? b.toTree() : typeof b === "string" ? b.toTree() : b;
     return new EqualNode(nodeA, nodeB);
 };
-exports.equal = equal;
-class EqualNodeConstructor {
+export class EqualNodeConstructor {
     static fromIdentifiers(identifiers) {
-        return new EqualNode(nodeConstructor_1.NodeConstructor.fromIdentifiers(identifiers.leftChild), nodeConstructor_1.NodeConstructor.fromIdentifiers(identifiers.rightChild), identifiers.opts);
+        return new EqualNode(NodeConstructor.fromIdentifiers(identifiers.leftChild), NodeConstructor.fromIdentifiers(identifiers.rightChild), identifiers.opts);
     }
 }
-exports.EqualNodeConstructor = EqualNodeConstructor;
-const isEqualNode = (node) => node.type === node_1.NodeType.equality;
-exports.isEqualNode = isEqualNode;
-class EqualNode {
+export const isEqualNode = (node) => node.type === NodeType.equality;
+export class EqualNode {
+    leftChild;
+    rightChild;
+    opts;
+    type;
     constructor(leftChild, rightChild, opts) {
         this.leftChild = leftChild;
         this.rightChild = rightChild;
-        this.type = node_1.NodeType.equality;
+        this.type = NodeType.equality;
         this.opts = opts;
     }
     toIdentifiers() {
         return {
-            id: node_1.NodeIds.equal,
+            id: NodeIds.equal,
             leftChild: this.leftChild.toIdentifiers(),
             rightChild: this.rightChild.toIdentifiers(),
             opts: this.opts,
@@ -63,14 +61,13 @@ class EqualNode {
         return this;
     }
     shuffle() {
-        return (0, coinFlip_1.coinFlip)() ? this : this.reverse();
+        return coinFlip() ? this : this.reverse();
     }
     reverse() {
         return new EqualNode(this.rightChild, this.leftChild, this.opts);
     }
 }
-exports.EqualNode = EqualNode;
-const firstDegreeEquationResolutionTex = (affineLeft, affineRight) => {
+export const firstDegreeEquationResolutionTex = (affineLeft, affineRight) => {
     //ax(+-b) = (+-c)(x)(+-d)
     // const b = affine.b;
     // const a = affine.a;
@@ -93,4 +90,3 @@ const firstDegreeEquationResolutionTex = (affineLeft, affineRight) => {
     // }
     // return alignTex(steps, true);
 };
-exports.firstDegreeEquationResolutionTex = firstDegreeEquationResolutionTex;

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

@@ -1,5 +1,5 @@
-import { Node, NodeIds, NodeOptions, NodeType } from "../node";
-import { DiscreteSetNode } from "../sets/discreteSetNode";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node.js";
+import { DiscreteSetNode } from "../sets/discreteSetNode.js";
 type EquationSolutionNodeOptions = {
     variable?: string;
     opts?: NodeOptions;

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

@@ -1 +1 @@
-{"version":3,"file":"equationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC/D,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,aAAa;;;;;;;;;IAMb,cAAc;IAId,SAAS;IAkBT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAQpC,YAAY;IAIZ,KAAK;IAGL,QAAQ;CAGT"}
+{"version":3,"file":"equationSolutionNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/equationSolutionNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,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,aAAa;;;;;;;;;IAMb,cAAc;IAId,SAAS;IAkBT,iBAAiB,CAAC,IAAI,CAAC,EAAE,WAAW;IAQpC,YAAY;IAIZ,KAAK;IAGL,QAAQ;CAGT"}

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

@@ -1,10 +1,11 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EquationSolutionNode = void 0;
-const node_1 = require("../node");
-class EquationSolutionNode {
+import { NodeIds, NodeType } from "../node.js";
+export class EquationSolutionNode {
+    type;
+    variable;
+    solutionsSet;
+    opts;
     constructor(solutionsSet, params) {
-        this.type = node_1.NodeType.set;
+        this.type = NodeType.set;
         this.solutionsSet = solutionsSet;
         this.variable = params?.variable ?? "x";
         this.opts = params?.opts
@@ -16,7 +17,7 @@ class EquationSolutionNode {
     }
     toIdentifiers() {
         return {
-            id: node_1.NodeIds.equationSolution,
+            id: NodeIds.equationSolution,
             solutionsSet: this.solutionsSet.toIdentifiers(),
         };
     }
@@ -56,4 +57,3 @@ class EquationSolutionNode {
         return new EquationSolutionNode(this.solutionsSet.simplify());
     }
 }
-exports.EquationSolutionNode = EquationSolutionNode;

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

@@ -1,4 +1,4 @@
-import { Node, NodeIds, NodeOptions, NodeType } from "../node";
+import { Node, NodeIds, NodeOptions, NodeType } from "../node.js";
 export declare class MultiEqualNode implements Node {
     children: Node[];
     opts?: NodeOptions;

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

@@ -1 +1 @@
-{"version":3,"file":"multiEqualNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/multiEqualNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAI/D,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,aAAa;;;;;;IAMb,SAAS;IAMT,cAAc,IAAI,MAAM,EAAE;IAI1B,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,QAAQ;CAGT"}
+{"version":3,"file":"multiEqualNode.d.ts","sourceRoot":"","sources":["../../../../src/tree/nodes/equations/multiEqualNode.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAIlE,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,aAAa;;;;;;IAMb,SAAS;IAMT,cAAc,IAAI,MAAM,EAAE;IAI1B,YAAY,IAAI,MAAM;IAGtB,KAAK,IAAI,MAAM;IAIf,QAAQ;IAIR,QAAQ;CAGT"}

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

@@ -1,19 +1,19 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MultiEqualNode = void 0;
-const node_1 = require("../node");
-const permutations_1 = require("../../../utils/arrays/permutations");
-const cartesianProducts_1 = require("../../../utils/arrays/cartesianProducts");
-class MultiEqualNode {
+import { NodeIds, NodeType } from "../node.js";
+import { permute } from "../../../utils/arrays/permutations.js";
+import { getCartesiansProducts } from "../../../utils/arrays/cartesianProducts.js";
+export class MultiEqualNode {
+    children;
+    opts;
+    type;
     constructor(children, opts) {
         this.children = children;
-        this.type = node_1.NodeType.equality;
+        this.type = NodeType.equality;
         this.opts = opts;
     }
     toEquivalentNodes() {
         const res = [];
         const equivs = this.children.map((node) => node.toEquivalentNodes());
-        const cartesians = (0, cartesianProducts_1.getCartesiansProducts)(equivs);
+        const cartesians = getCartesiansProducts(equivs);
         cartesians.forEach((product) => {
             res.push(new MultiEqualNode(product));
         });
@@ -21,12 +21,12 @@ class MultiEqualNode {
     }
     toIdentifiers() {
         return {
-            id: node_1.NodeIds.multiEqual,
+            id: NodeIds.multiEqual,
             children: this.children.map((e) => e.toIdentifiers()),
         };
     }
     toAllTexs() {
-        const permutations = (0, permutations_1.permute)(this.children);
+        const permutations = permute(this.children);
         return permutations.flatMap((permutation) => `${permutation.map((node) => node.toTex()).join("=")}`);
     }
     toAllValidTexs() {
@@ -45,4 +45,3 @@ class MultiEqualNode {
         return this;
     }
 }
-exports.MultiEqualNode = MultiEqualNode;

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

@@ -1,6 +1,6 @@
-import { Node, NodeIds, NodeType } from "../node";
-import { FunctionNode, FunctionsIds } from "./functionNode";
-import { AlgebraicNode } from "../algebraicNode";
+import { Node, NodeIds, NodeType } from "../node.js";
+import { FunctionNode, FunctionsIds } from "./functionNode.js";
+import { AlgebraicNode } from "../algebraicNode.js";
 export declare function isAbsNode(a: Node): a is AbsNode;
 export declare const abs: (a: AlgebraicNode | number | string) => AbsNode;
 export declare class AbsNode implements FunctionNode {
@@ -19,10 +19,10 @@ export declare class AbsNode implements FunctionNode {
     toTex(): string;
     toEquivalentNodes(): AlgebraicNode[];
     toAllValidTexs(): string[];
-    simplify(): AlgebraicNode | import("../numbers/constantNode").ConstantNode | import("../numbers/numberNode").NumberNode | AbsNode;
+    simplify(): AlgebraicNode | import("../numbers/constantNode.js").ConstantNode | import("../numbers/numberNode.js").NumberNode | AbsNode;
     evaluate(vars?: Record<string, number>): number;
     equals(node: AlgebraicNode): boolean;
     toDetailedEvaluation(vars: Record<string, AlgebraicNode>): AbsNode;
-    derivative(varName?: string | undefined): import("../operators/multiplyNode").MultiplyNode;
+    derivative(varName?: string | undefined): import("../operators/multiplyNode.js").MultiplyNode;
 }
 //# sourceMappingURL=absNode.d.ts.map